| P_m∨F_n的点可区别边色数 |
| |
| 引用本文： | 毛新叶,刘信生.P_m∨F_n的点可区别边色数[J].甘肃科学学报,2008,20(4). |
| |
| 作者姓名： | 毛新叶 刘信生 |
| |
| 作者单位： | 西北师范大学,数学与信息科学学院,甘肃,兰州,730070 |
| |
| 摘 要： | 对G的正常边染色,若满足不同顶点所关联的边所对应的颜色集不同,则称此染色法为点可区别的边染色法,其所称用最少染色数为该图的点可区别边色数,得到了路与扇的联图的点可区别边色数.
|
| 关 键 词： | 联图 边染色 点可区别边染色 点可区别边色数 |
On the Vertex-distinguishing Edge Chromatic Number of Pm ∨ Fn |
| |
| MAO Xin-ye,LIU Xin-sheng.On the Vertex-distinguishing Edge Chromatic Number of Pm ∨ Fn[J].Journal of Gansu Sciences,2008,20(4). |
| |
| Authors: | MAO Xin-ye LIU Xin-sheng |
| |
| Institution: | College of Mathematics and Information Science;Northwest Normal University;Lanzhou 730070;China |
| |
| Abstract: | A proper edge-coloring is called vertex-distinguishing if every two vertices are incident to edge with vertex.The minimum number of colors is required for a vertex-distinguishing proper edge-coloring.We have given the vertex-distinguishing edge chromatic number of path and fan join-graph. |
| |
| Keywords: | join-graph vertex-distinguishing edge coloring vertex-distinguishing edge chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
