Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C（x） be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C（u） ≠ C（v） for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_vt^ie （G） and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_8,n are discussed in this paper. Particularly, the VDIET chromatic number of K_8,n are obtained. 

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C（x） be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C（u） ≠ C（v） for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_vt^ie （G） and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_8,n are discussed in this paper. Particularly, the VDIET chromatic number of K_8,n are obtained.