两类积图的邻点可区别全染色

On the Adjacent Vertex-Distinguishing Total Coloring of Two Classes of Product Graphs

本文.证明了,当n≥2时,Xat(K_n×K′_n)=2n;当p,q≥2时,Xat(C_(2p)×K_(2q))=2q+3,其中K_n×K′_n是两个不同标号完全图的积图,C_(2p)×K_(2q)是偶圈和偶阶完全图的积图.

It is proved that if n ≥ 2, then χat（Kn×Kn＇） = 2n, and if p, q ≥ 2, then χat（C2p×K2q） = 2q ＋ 3, where Kn x Kn＇ is the product of two complete graphs with different labels, and C2p×K2q is the product of an even cycle and a complete graph of even order.