Algorithm for the Vertex-Distinguishing Total Coloring of Complete Graphs
Weiping Zhang · Computer Knowledge and Technology · 2012
Let f be a proper k-total coloring of a graph G,if for any two distinct vertices u and v in G,the set of colors of u differs from the set of colors of v,f is called a k-vertex distinguishing total coloring of G,is abbreviated k-VDTC of G and the minimal number k of colors required for vertex-distinguishing total coloring of G is called the vertex-distingishing total chromatic number of G.In this paper,a new algorithm whose name is algorithm of classified order coloring is proposed on the base of the characteristics of the vertex-distinguish ing total coloring of complete graphs.All of its elements are classified according to some rules and then are colored in proper sequence in the algorithm.Moreover,a relatelocktable is presented to judge whether the result is correct.The experimental results show that the algo rithm can effectively solve the vertex-distinguishing total coloring of complete graphs.