On Adjacent Vertex Distinguishing Total Coloring of P_m∨S_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 χ_(at)(G).In this paper,we obtain the adjacent vertex distinguishing total chromatic number of P_m∨S_n.