【摘要】 一个图G的全染色被称为邻点可区别的,如果满足图G中任意两个相邻点所关联的元素所染的色的集合不同.一个图的邻点可区别的全染色被称为均匀的,如果满足任意两色所染元素的数目之差的绝对值不超过1.本文研究了联图P_n■P_n的邻点可区别的均匀全染色并证明它满足邻点可区别的均匀全染色猜想.更多还原

【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.更多还原