On the Adjacent Vertex Distinguishing Total Chromatic Number of C_m×K_n

For a proper total coloring of graph,if the coloring set of adjacent vertex in which the vertex's coloring and incidence edge's coloring are different,we call this coloring is adjacent vertex distinguishing total coloring of graph,and the minimal chromatic number is called adjacent vertex distinguishing total coloring chromatic number.In this paper,the adjacent vertex distinguishing total coloring chromatic number of cartesian product graph of Cm and Kn(m,n≥4).