2006•Journal of Lanzhou UniversityRequires access
On the adjacent vertex distinguishing total chromatic number of general mycielski M_n(K_m)
Zhang Zhong-fu
Open publisher page 0 citations
Abstract
A total-coloring is called adjacent vertex-distinguishing.If every two adjacent vertices are incident to different sets of colored vertices,they have incident edges with vertex.The minimum number of colors required for a adjacent vertex-distinguishing total-coloring is called adjacent vertex-distinguishing total color number.This paper obtained the adjacent vertex distinguishing total chromatic number of General Mycielski Mn(K_m)(n≥1,m≥3),where K_m is a complete graph with order m.