On the adjacent vertex-distinguishing total coloring of K(r,2m)
Zhang Zhong-fu · Journal of Zhejiang Normal University · 2008
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.