|
|||||
|
|
| k-方体图邻点可区别全色数 | |
| 引用本文： | 田双亮,李敬文,马少仙,张忠辅.k-方体图邻点可区别全色数[J].经济数学,2004,21(2):174-176. |
| 作者姓名： | 田双亮 李敬文 马少仙 张忠辅 |
| 作者单位： | 1. 西北民族大学数学系,兰州,730030 2. 兰州交通大学计算机科学系,兰州,730070 3. 西北师范大学数学系,兰州,730070;兰州交通大学应用数学研究所,兰州,730070 |
| 基金项目： | This research is supported by NSFC of China(No.198710 36 ) |
| 摘 要： | 本文证明k-方体图(k≥2)的邻点可区别的全色数为k+2. |
| 关 键 词： | k-方体图 点可区别的全染色 |
A NOTE OF THE ADJACENT VERTEX-DISTINGUISHING TOTAL CHROMATIC NUMBER OF k-CUBE GRAPH |
|
| Abstract.A NOTE OF THE ADJACENT VERTEX-DISTINGUISHING TOTAL CHROMATIC NUMBER OF k-CUBE GRAPH[J].Mathematics in Economics,2004,21(2):174-176. | |
| Authors: | Abstract |
| Abstract: | In this paper, k-cube graph Qk is proved that xat(Qk)=△(Qk)+2, where △(Qk) is maximum degree of graph Qk. So it is right for the conjecture in 6]. And in this paper good methods of (k+2)-AVDTC coloring of Qk are given. |
| Keywords: | k-cube Graph Adjacent Vertex-Distinguishing Total Coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |