D(5)-Vertex Distinguishing Total Coloring of Cycle
Chen Xiang-en · Journal of Jiamusi University · 2008
D(β)-vertex-distinguishing total coloring of graph G is a proper total coloring of graph G,which any two vertices whose distance is not large than β have different color sets.In this article,D(5)-vertex-distinguishing total coloring of the cycle are discussed.