A normal total coloring f of graph G is adjacent vertex distinguishing. If any point of an adjacent vertex in G and the color set of its related edges are different, the smallest number of colors used in the normal adjacent vertex distinguishing total coloring for a Graph G is called the number of adjacent vertex distinguishing total coloring and is denoted as Xat (G). This paper gives a class of special adjacent vertex distinguishing total coloring number of graphs.