mK_(2,3)的点可区别全染色

Vertex-Distinguishing Total Colorings of mK_(2,3)

用mK2,3表示m个完全二部图K2,3的点不交的并,给出了mK2,3的点可区别全色数,证明了对任意的m≥4,[k-13]<3m≤[3k],有χvt(mK2,3)=k.

Let mK2,3 be a vertex-disjoint union of m complete bipartite graph K2,3.In this article,vertex-distinguishing total chromatic numbers of mK2,3 are obtained,and it is proved that χvt（mK2,3）=k for any [k-13]3m≤[k3,m≥4.