2009•Journal of Lanzhou University of TechnologyRequires access
Adjacent vertex distinguishing total coloring of path's general Mycielski graphs
Wang Xiao
Open publisher page 0 citations
Abstract
A proper total coloring of graph G was called as adjacent vertex distinguishing total coloring of G if C(u)≠C(v) for arbitrarily adjacent vertices u and v.To study the adjacent vertex distinguishing total coloring of graph was to find out the minimum chromatic number of the adjacent vertex distinguishing total coloring of graph.The adjacent vertex distinguishing total coloring of path's general Mycielski graphs was studied by using the exhaustion method and the combination analytic method,so that the adjacent vertex distinguishing total chromatic number was obtained.