Abstract: Let G be a simple graph. An E-total coloring f of G is called that if there are no two adjacent vertices of G receive the same color, and no edges of G receives the same color as one of its endpoints. For an E-total coloring f of G, if C(u)≠C(v) for any two distinct vertices u and v of V(G), where C(x) denotes the set of colors of vertex x and of the edges incident with x under f, then f is called a vertex-distinguishing E-total coloring of G. Let χ^e_vt(G)=min{k|G has a k-VDET coloring}. Then χ^e_vt(G) is called the VDET chromatic number of G. By using analytical method and proof by contradiction, the VDET coloring of complete bipartite graph K10,n is discussed and the VDET chromatic number of K10,n(10≤n≤90) has been obtained.

Key words: complete bipartite graphs, E-total coloring, vertex-distinguishing E-total coloring, vertex-distinguishing E-total chromatic number