| 三个特殊图的邻点可区别全色数 |
| |
| 引用本文： | 田双亮 李敬文 马少仙. 三个特殊图的邻点可区别全色数[J]. 西北民族学院学报, 2004, 25(1): 10-11,65 |
| |
| 作者姓名： | 田双亮 李敬文 马少仙 |
| |
| 作者单位： | [1]西北民族大学数学系，甘肃兰州730030 [2]兰州交通大学信息与电气工程学院，甘肃兰州730070 |
| |
| 摘 要： | 一个正常的全染色满足相邻点的点染色及关联边的色集不同时 ,称为邻强全染色 ,其所用最少染色数称为邻强全色数 (或点可区别的全色数 ) .文中给出了Petersen图、Heawood图、Thomassen图的邻点可区别全色数
|
| 关 键 词： | 图 邻点可区别全染色 方法 |
| 文章编号： | 1009-2102(2004)01-0010-02 |
On the Adjacent Vertex- Distinguishing Total Coloring of Three Specific Graphs |
| |
| TIAN Shuang-liang,LI Jing-wen,MA Shao-xian. On the Adjacent Vertex- Distinguishing Total Coloring of Three Specific Graphs[J]. Journal of Northwest Minorities University(Natural Science ), 2004, 25(1): 10-11,65 |
| |
| Authors: | TIAN Shuang-liang LI Jing-wen MA Shao-xian |
| |
| Affiliation: | TIAN Shuang-liang~1,LI Jing-wen~2,MA Shao-xian~1 |
| |
| Abstract: | A total-coloring is called adjacent vertex-distinguishing if every two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex. The minimum number of colors required for a adjacent vertex-distinguishing proper total-coloring a simple graph G is denoted by.We get the adjacent Vertex-distinguishing total chromatic number of Petersen, Heawood and Thomassen. |
| |
| Keywords: | Graph Adjacent Vertex-distinguishing Total coloring |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
