| 一类沿联图的邻点可区别全染色 |
| |
| 引用本文： | 杜建伟,孙晓玲.一类沿联图的邻点可区别全染色[J].山东理工大学学报,2009,23(4). |
| |
| 作者姓名： | 杜建伟 孙晓玲 |
| |
| 作者单位： | 中北大学理学院; |
| |
| 摘 要： | 为了解决图的邻点可区别全染色中一个图的色数算法问题,从沿联图的结构特点出发,对一类沿联图的邻点可区别全染色问题进行了研究,并得到了它的邻点可区别全色数.
|
| 关 键 词： | 沿联图 邻点可区别全染色 邻点可区别全色数 |
On the adjacent vertex distinguishing total coloring of a class of join-graph |
| |
| DU Jian-wei,SUN Xiao-ling.On the adjacent vertex distinguishing total coloring of a class of join-graph[J].Journal of Shandong University of Technology:Science and Technology,2009,23(4). |
| |
| Authors: | DU Jian-wei SUN Xiao-ling |
| |
| Institution: | School of Science;North University of China;Taiyuan 030051;China |
| |
| Abstract: | This paper mainly discusses the adjacent vertex distinguishing total coloring of a class of join-graph to resolve the algorithm of the chromatic number of a graph.The adjacent vertex distinguishing total chromatic number of the join-graph is obtained from the structure of join-graph. |
| |
| Keywords: | join-graph adjacent vertex distinguishing total coloring adjacent vertex distinguishing total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
