一些分裂图的点可区别全染色

Vertex-Distinguishing Total Coloring of Some Split Graphs

图G的一个k-正常染色被称为点可区别全染色指任意两点的点及其关联边所染色集合不同.研究了一些分裂图K_(2n+1)\E(K_m)(n≥4,m≥3)的点可区别全色数.

A vertex distinguishing total coloring is a proper total coloring using k colors that two colors sets o,f vertex are different. In this paper, we obtain the vertex distinguishing edge chromatic number of some split graphs K2n＋1／E（Km）（n≥4,m≥3）.