On the adjacent vertex distinguishing total coloring numbers of graphs with image

An adjacent vertex distinguishing total-coloring of a simple graph image is a proper total-coloring of image such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors image required to give image an adjacent vertex distinguishing total-coloring is studied. We proved image for graphs with maximum degree image in this paper.