广义Mycielski图M_(n)(C_(m)^(3))的邻和可区别全染色

Neighbor Sum Distinguish Total Coloring of Generalized Mycielski Graph M_(n)(C_(m)^(3))

将阶数至少为4的圈图中距离为3的任意两点连边得到了圈的3次方图,应用构造染色法,研究了广义Mycielski图M_(n)(C_(m)^(3))和M n(C k 2k)的邻和可区别全染色问题,得到了邻和可区别全色数,验证了邻和可区别全色数的猜想对这两类图的正确性.

This article obtains the cubic graph of a cycle by connecting any two points with edges at a distance of 3 in a cycle graph of order at least 4,By applying the construction coloring method,we studied the neighbor sum distinguishing total coloring of generalized Mycielski graph M_(n)(C_(m)^(3))and M n(C k 2k),obtain their neighbor sum distinguishing total chromatic numbers,and verify that the conjecture of neighbor sum distinguishing total chromatic numbers was correct for these two types of graphs.