Adjacent Vertex Distinguishing Total Coloring of M(T_n)
Yuying Gu, Shudong Wang · Shuxue jikan · 2008
A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets.According to the property of trees,the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction.