Adjacent Vertex-Distinguishing Total Coloring of C_m·F_n

A total-coloring is called adjacent vertex-distinguishing if every two adjacent vertices are incident to different sets of colored vertex and incident edge with vertex. The minimum number of colors required for an adjacent vertex-distinguishing proper total-coloring, a simple graph G is denoted by ., The adjacent vertex distinguishing total chromatic number of have been given in this paper.