| 关于路和路的联图的邻点可区别的均匀全染色 |
| |
| 引用本文： | 闫丽宏,王治文,张忠辅.关于路和路的联图的邻点可区别的均匀全染色[J].宁夏师范学院学报,2008,29(3):8-10. |
| |
| 作者姓名： | 闫丽宏 王治文 张忠辅 |
| |
| 作者单位： | 1. 咸阳师范学院,数学系,陕西,咸阳,712000
2. 咸阳师范学院,数学系,陕西,咸阳,712000;兰州交通大学,数理学院,甘肃,兰州,730070 |
| |
| 摘 要： | 一个图G的全染色被称为邻点可区别的,如果满足图G中任意两个相邻点所关联的元素所染的色的集合不同.一个图的邻点可区别的全染色被称为均匀的,如果满足任意两色所染元素的数目之差的绝对值不超过1.本文研究了联图P_n■P_n的邻点可区别的均匀全染色并证明它满足邻点可区别的均匀全染色猜想.
|
| 关 键 词： | 路 联图 邻点可区别的均匀全染色 |
On the Adjacent Vertex Distinguishing Equitable Total Coloring of Join Graph of Two Paths |
| |
| YAN lihong,WANG Zhiwen,ZHANG Zhongfu.On the Adjacent Vertex Distinguishing Equitable Total Coloring of Join Graph of Two Paths[J].Journal of Ningxia Teachers College,2008,29(3):8-10. |
| |
| Authors: | YAN lihong WANG Zhiwen ZHANG Zhongfu |
| |
| Abstract: | A adjacent vertex distinguishing equitable total coloring of graph G is a proper total coloring of graph G such that any two adjacent vertices'coloring sets are not same and the difference of the elements colored by any two colors is not more than 1.In this paper we shall give adjacent vertex distinguishing equitable total chromatic number of join graph P_n(?)P_n and prove that it satisfies adjacent vertex distinguishing equitable total coloring conjecture. |
| |
| Keywords: | Path Join graph Adjacent vertex distinguishing equitable total chromatic number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
