M_(2n)(r)和L_(2n)(r)两类图的邻点可区别全染色

The Adjacent Vertex Distinguishable Total Coloring of M_(2n)(r) and L_(2n)(r)

对于一个正常的全染色,相邻点满足顶点及其关联边染色的色集不同的条件时,称为邻点可区别全染色,其所用的最小染色数称为邻点可区别全色数,就M2n(r)和L2n(r)两类图,得到n,r任意取值下的邻点可区别全色数.

A total coloring is called adjacent distinguishable 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 distinguishable proper total coloring, denoted byХat （G） . This paper will give the adjacent vertex distinguishable total chromatic number of M2n （r） and L2n （r） , for arbitrary n and r.