摘要
一个图G的全染色被称为邻点可区别的如果满足图G中任意两个相邻点所关联的元素所染的色的集合不同.一个图的邻点可区别的全染色被称为均匀的如果满足任意两色所染元素的数目之差的绝对值不超过1.本文研究了联图P_n∨C_n的邻点可区别的均匀全染色并证明它满足邻点可区别的均匀全染色猜想.
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 1. In this paper we shall give adjacent vertex distinguishing equitable total chromatic number of join graph Pn V Cn which proves to satisfy adjacent vertex distinguishing equitable total coloring conjecture.
出处
《宁夏师范学院学报》
2007年第6期24-27,共4页
Journal of Ningxia Normal University
基金
The research is supported by the Xianyang Normal University foundation for basic reaearch(No.06XSYK266)
关键词
路
圈
联图
邻点可区别的均匀全染色.
Path
Cycle
Join graph
Adjacent Vertex Distinguishing Equitable Total Chromatic Number
