2008•Journal of Lanzhou Jiaotong UniversityRequires access
Vertex-distinguishing Total Chromatic Number of Mycielski's Graph of Complete Bipartite Graph
Zhang Zhong-fu
Open publisher page 0 citations
Abstract
A proper total coloring of a graph is called vertex-distinguishing total coloring if any two vertices have different color sets,where the color set of a vertex is the set composed of all colors of the vertex and the edges incidental to it.The minimum number of colors of a vertex-distinguishing total coloring is called the vertex-distinguishing total chromatic number of the graph.In this paper,we obtained the vertex-distinguishing total chromatic number of Mycielski's graph of complete bipartite graph.