The vertex strong total chromatic number of general graphs K(n,m)
Jingfa Liu, Wenqi Huang · 2006
A proper k-total coloring σ of graph G(V,E) is called a k-vertex strong total coloring of G(V,E) if and only if for v∈V(G),the elements in N are colored with different colors,where N{u|vu∈E(G)}∪{v};and χ~~(vs)__T(G)=min{k| there is a k-vertex strong total coloring of G} is called the vertex strong total chromatic number of G.In this paper,we determine the vertex strong total chromatic number χ~~(vs)__T(G) of general graph K(n,m) of complete graph K_n and product graph L_m×K_n.