mK的点可区别全染色mK的点可区别全染色

J4 ›› 2012, Vol. 50 ›› Issue (4): 686-692.

Previous Articles Next Articles

Vertex-Distinguishing Total Colorings-of-mK4

CHEN Xiangen¹, WANG Zhiwen², MA Yanrong¹, YAO Bing¹

1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China;
2. School of Mathematics and Computer Science, Ningxia University, Yinchuan 750021, China

Received:2011-09-22 Online:2012-07-01 Published:2012-09-07
Contact: CHEN Xiangen1 E-mail:chenxe@nwnu.edu.cn

Abstract

Abstract:

The problem of vertex-distinguishing total colorings of graphs was discussed via the methods of distributing color sets in advance, constructing concrete coloring with the help of matrices and recurrence method. The exact value of the vertex-distinguishing total chromatic number χvt(mK4) of the union mK4 of m vertex-disjoint K4 was given, that is “If k-14<4m≤k4, m≥2, k≥6, then χvt(mK4)=k”. This illustrates that the VDTC conjecture is valid for mK4.

Key words: graphs, vertexdistinguishing total coloring, vertexdistinguishing total chromatic number

CLC Number:

CHEN Xiangen, WANG Zhiwen, MA Yanrong, YAO Bing. Vertex-Distinguishing Total Colorings-of-mK4[J].J4, 2012, 50(4): 686-692.

[1]	YANG Weiguang, CHEN Xiang’en. VertexDistinguishing ETotal Coloring of Complete Bipartite Graph K_9,n(9≤n≤92) [J]. Journal of Jilin University Science Edition, 2020, 58(2): 301-308.
[2]	LI Ting, CHEN Xiang’en, WANG Zhiwen. General VertexDistinguishing Total Colorings of Corona Graph of 2K₂∨K₁#br# [J]. Journal of Jilin University Science Edition, 2019, 57(3): 544-552.
[3]	ZHANG Hui, CHEN Xiang’en, WANG Zhiwen. Neighbor Expanded Sum Distinguishing Total Colorings of Joinsof Two Cycles, One Path and One Cycle and Two Paths#br# [J]. Journal of Jilin University Science Edition, 2018, 56(6): 1402-1408.
[4]	HE Yuping, WANG Zhiwen, CHEN Xiang’en. VertexDistinguishing Total Coloring of mC_7 [J]. Journal of Jilin University Science Edition, 2017, 55(03): 531-536.
[5]	CHEN Xiang’en, SU Li, WANG Zhiwen. General VertexDistinguishing Total Colorings ofComplete Bipartite Graphs K_2,nand K_3,n [J]. Journal of Jilin University Science Edition, 2016, 54(06): 1289-1293.
[6]	LI Shiling, CHEN Xiang’en, WANG Zhiwen. VertexDistinguishing E-Total Coloring of CompleteBipartite Graph K_3,n with 3≤n≤17 [J]. Journal of Jilin University Science Edition, 2015, 53(06): 1171-1176.
[7]	CHEN Xiang-En, LI Ze-Feng, TAO Bing. AdjacentVertexDistinguishing Total Coloring ofK_15-E(K₃)和K₁₇-E(K₃) [J]. J4, 2012, 50(03): 504-.
[8]	XIN Xiao-Jing, WANG Chi-Wen, CHEN Xiang-En, TAO Bing. Vertex Distinguishing Total Chromatic Number of mC_3 [J]. J4, 2012, 50(02): 251-257.
[9]	CHEN Xiang-En, MA Pan-Rong. AdjacentVertexDistinguishing Total Chromatic Number of K^c_r∨K_s [J]. J4, 2011, 49(01): 68-70.
[10]	YAN Yunsheng, WU Long shu. Induced Matching Extendability of the Graphs with Diameter Two [J]. J4, 2009, 47(01): 21-25.
[11]	WANG Xuyan, LU Ning, FAN Renhong, JI Xiang, LIU Lei. Design and Implementation of Graphic Ontology Modeling Tool (GOM) [J]. J4, 2008, 46(05): 903-910.
[12]	ZHAO Ke-wen, ZENG Ke-yang. Pathconnected Graphs with Neighborhood Union Conditions [J]. J4, 2003, 41(02): 162-165.

Vertex-Distinguishing Total Colorings-of-mK4

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 12

Metrics

Comments

Recommended 10