Vertex-distinguishing total coloring of ladder graphs(n=7(mod8))
Bao Shi-tan · Automation and Instrumentation · 2011
A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors assigned to the elements incident to u differs from the set of colors incident to v. The minimal number of colors required for a vertex distinguishing total coloring of G is called the vertex distingguishing total coloring chromatic number. In a paper, we give a triangle by the compositor, we proved that when n=7(mod8) and Cn-1 4/2+2m≤Cn 4/2+2, vertex distinguishing total chromatic number of ladder graphs Lm. is n.