皇冠图G_(n,m)的邻点可区别的I-全染色

Adjacent Vertex-distinguishing I-total Coloring of the Crown Graph G_(n,m)

通过函数构造法,讨论了皇冠图G_(n,m)的邻点可区别I-的全染色,得到了其邻点可区别I-的色数,并验证了其满足邻点可区别I-的全染色猜想.

In this paper, Adjacent vertex-distinguishing I-total coloring of the Crown Graph Gn,m was discussed by the method of function construction, the adjacent vertex-distinguishing I-total chromatic number is obtained, and the conjecture that satisfies the adjacent vertex-distinguishing I-total coloring is verified.