|
|||||
|
|
| 图K（r，2m）的邻点可区别全染色 | |
| 引用本文： | 田双亮,陈萍,张忠辅.图K（r，2m）的邻点可区别全染色[J].浙江师范大学学报(自然科学版),2008,31(1):23-25. |
| 作者姓名： | 田双亮 陈萍 张忠辅 |
| 作者单位： | 1. 西北民族大学,计算机科学与信息工程学院,甘肃,兰州,730030 2. 西北民族大学,经济管理学院,甘肃,兰州,730030 3. 兰州交通大学,应用数学研究所,甘肃,兰州,730070 |
| 摘 要： | 在等完全r-部图全染色的研究中，首先确定了每部有2个点的完全r-部图的全色数；然后利用已得到的结果进一步研究每部有n个点的完全r-部图的全色数．采用上述思路研究了等完全卜部图的邻点可区别全染色，利用图分解的方法给出了每部有2个点的完全r-部图的邻点可区别全色数；并给出了每部有偶数个点的等完全r-部图的邻点可区别全色数． |
| 关 键 词： | 等完全r-部图 完全图 邻点可区别全染色 邻点可区别全色数 |
| 文章编号： | 1001-5051（2008）01-0023-03 |
| 收稿时间： | 2006-10-25 |
| 修稿时间： | 2007-09-14 |
On the adjacent vertex-distinguishing total coloring of K(r,2m) |
|
| TIAN Shuangliang,CHEN Ping,ZHANG Zhongfu.On the adjacent vertex-distinguishing total coloring of K(r,2m)[J].Journal of Zhejiang Normal University Natural Sciences,2008,31(1):23-25. | |
| Authors: | TIAN Shuangliang CHEN Ping ZHANG Zhongfu |
| Institution: | TIAN Shuangliang, CHEN Ping, ZHANG Zhongfu ( 1. Computer Science and Information Engineering College, Northwest University for Nationalities, Lanzhou Gansu 730030, China ; 2. Economics and Management College, Northwest University for Nationalities, Lanzhou Gansu 730030, China; 3. Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou Gansu 730070, China ) |
| Abstract: | In the study of the total coloring about the balanced complete r-partite graph, the total chromatic number of complete r-partite graph with two vertices on each partition had been given. The total chromatic number of complete r-partite graph with n vertices on each partition using the result had also been studied. The adjacent vertex-distinguishing total coloring of the balanced complete r-partite graph was considered. The adjacent vertex-distinguishing total chromatic number of the complete r-partite graph with two vertices on each partition by the method of graph decomposition was given, and then the adjacent vertex-distinguishing total chromatic number of the balanced complete r-partite graph with even vertices on each partition was obtained. |
| Keywords: | balanced complete r-partite graph complete graph adjacent vertex-distinguishing total coloring adjacent vertex-distinguishing total chromatic number |
| 本文献已被 维普 万方数据 等数据库收录！ | |