| P_m∨W_n的点可区别全色数 |
| |
| 引用本文： | 刘广军,;刘信生. P_m∨W_n的点可区别全色数[J]. 郑州大学学报(自然科学版), 2009, 0(1) |
| |
| 作者姓名： | 刘广军, 刘信生 |
| |
| 作者单位： | [1]西北师范大学数学与信息科学学院; [2]周口师范学院数学与信息科学系 |
| |
| 基金项目： | 甘肃省教育厅科研基金资助项目,编号0501-03 |
| |
| 摘 要： | 根据点可区别全染色的概念及其染色方法,讨论了路与轮联图的点可区别全染色,给出了路与轮联图的点可区别全色数的结论及其证明,为进一步探讨其他联图的点可区别全染色提供了理论证据,丰富了图的点可区别全染色的结果.
|
| 关 键 词： | 联图 点可区别全染色 点可区别全色数 |
Vertex-distinguishing Total Chromatic Number of P_m∨W_n |
| |
| Affiliation: | LIU Guang-jun1; 2; LIU Xin-sheng1(1.College of Mathematics and Information Science; Northwest Normal University; Lanzhou 730070; China; 2.Department of Mathematics and Information Science; Zhoukou Normal University; Zhoukou 466001; China); |
| |
| Abstract: | According to the definition and the method of the vertex-distinguishing total coloring,the vertex-distinguishing total coloring of Pm∨Wn is discussed,and the conclusion and proof of the vertex-distinguishing total chromatic number of Pm∨Wn are given.It provides the theoretical basis to further explore the distinguishing total coloring of other join graphs,and the results of the vertex-distinguishing total coloring of graphs are enriched. |
| |
| Keywords: | join graph vertex-distinguishing total coloring vertex-distinguishing total chromatic number |
| 本文献已被 维普 等数据库收录！ |
|
