On Adjacent Vertex-Distinguishing Total Coloring of Generalized Petersen Graph
Yanni Wang · Shandong kexue · 2007
The Total Coloring of a graph is a generalization of the vetex and edge coloring,in which all of the elements(vertices and edges)are colored in such a way that no any two adjacent or correlative elements are colored indentically.The adjacent vertex-distinguish total coloring is a normal total coloring and the colors sets of two adjacent vertices are different.In this paper,the adjacent vertex-distinguishing total coloring numbers of generalized Petersen graph are presented.