Vertex-Distinguishing E-Total Coloring of the Graphs mC_3 and mC_4

查看全文 作　　者：Xiang En CHEN Yue [1]ZU

机构地区：[1]College of Mathematics and Information Science, Northwest Normal University, Gansu 730070, P. R. China

出　　处：《Journal of Mathematical Research and Exposition》索引2011年第31卷第1期,共14页

基　　金：Supported by the National Natural Science Foundation of China (Grant No.10771091);the Scientific Research Project of Northwest Normal University (Grant No.NWNU-KJCXGC-03-61) 摘　　要：Let G be a simple graph.A total coloring f of G is called E-total-coloring if no two adjacent vertices of G receive the same color and no edge of G receives the same color as one of its endpoints.For E-total-coloring f of a graph G and any vertex u of G,let Cf(u) or C(u) denote the set of colors of vertex u and the edges incident to u.We call C(u) the color set of u.If C(u) = C(v) for any two different vertices u and v of V(G),then we say that f is a vertex-distinguishing E-total-coloring of G,or a V DET coloring of G for short.The minimum number of colors required for a V DET colorings of G is denoted by χevt(G),and it is called the VDET chromatic number of G.In this article,we will discuss vertex-distinguishing E-total colorings of the graphs mC3 and mC4. 关键词：COLORING E-total coloring vertex-distinguishing E-total coloring vertex-distinguishing E-total chromatic number the vertex-disjoint union of m cycles with length n.

相关文献

参考文献（15）
引证文献（15）
耦合文献（0）

参考文献(15)

引证文献(15)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Vertex-Distinguishing E-Total Coloring of the Graphs mC_3 and mC_4

参考文献(15)

引证文献(15)

用户提示