关于P_m∨S_n的邻点可区别全染色

On Adjacent Vertex Distinguishing Total Coloring of P_m∨S_n

对一个正常的全染色满足相邻点的点及其关联边染色的色集不同时,称为邻点可区别全染色,其所用最少染色数称为邻点可区别全色数.本文得到了路Pm与星Sn的联图Pm∨Sn的邻点可区别全色数.

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.