On the Adjacent Vertex Distinguishing Equitable Total Coloring of P_n V C_n
Yan Li-hong · 2007
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.