| 关于联图P_n∨C_n的邻点可区别的均匀全染色 |
| |
| 作者单位： | 咸阳师范学院教学系，咸阳师范学院教学系，咸阳师范学院教学系 陕西咸阳7120100，陕西咸阳7120100，陕西咸阳7120100兰州交通大学数理学院，甘肃兰州730070 |
| |
| 摘 要： | 一个图G的全染色被称为邻点可区别的如果满足图G中任意两个相邻点所关联的元素所染的色的集合不同.一个图的邻点可区别的全染色被称为均匀的如果满足任意两色所染元素的数目之差的绝对值不超过1.本文研究了联图P_n∨C_n的邻点可区别的均匀全染色并证明它满足邻点可区别的均匀全染色猜想.
|
| 关 键 词： | 路 圈 联图 邻点可区别的均匀全染色 |
On the Adjacent Vertex Distinguishing Equitable Total Coloring of P_n V C_n |
| |
| Authors: | YAN Lihong WANG Zhiwen ZHANG Zhongfu |
| |
| Institution: | YAN Lihong~1 WANG Zhiwen~1 ZHANG Zhongfu~ |
| |
| Abstract: | An adjacent vertex distinguishing equitable total coloring of graph G is a proper total coloring of graph G that any two adjacent vertices' coloring sets are not the same and the difference of the elements colored by any two colors is not more than i.In this paper we shall give adjacent vertex distinguishing equitable total chromatic number of join graph P_n V C_n which proves to satisfy adjacent vertex distinguishing equitable total coloring conjecture. |
| |
| Keywords: | Path Cycle Join graph Adjacent Vertex Distinguishing Equitable Total Chromatic Number |
| 本文献已被 CNKI 等数据库收录！ |
