Vertex-Distinguishing Total Coloring of Some Split Graphs
Renyu Xu · Shuxue de shijian yu renshi · 2011
A vertex distinguishing total coloring is a proper total coloring using k colors that two colors sets of vertex are different.In this paper,we obtain the vertex distinguishing edge chromatic number of some split graphs K_(2n+1)\E(K_m)(n≥4,m≥3).