连通度为k的图的L(2,1)-标号

J4

• 数学 • Previous Articles Next Articles

L(2,1)-Labelings of Graphs with Connectivity k

LV Damei¹,², LIN Wensong², SONG Zengmin²

1. College of Science, Nantong University, Nantong 226007, Jiangsu Province, China;2. Department of Mathematics, Southeast University, Nanjing 210096, China

Received:2006-09-18 Revised:1900-01-01 Online:2007-07-26 Published:2007-07-26
Contact: LV Damei

Abstract

Abstract: We firstly gave the relationship between the path covering number of the complement G^cof G and the path covering number of the complement graphs of the connect components of G-S. And we then obtained the relationship between the λnumber of graph Gwith connectivity kand the path covering number of the complement graphs of the connect components of G-S via the relationship between the λnumber of graph Gand the path covering number of its complement G^cwhere Sis a kvertexcut ofG ).

Key words: L(2,1)-labelings, path covering number, connec tivity

CLC Number:

O157.5

LV Damei,, LIN Wensong, SONG Zengmin. L(2,1)-Labelings of Graphs with Connectivity k[J].J4, 2007, 45(04): 555-561.

[1]	CHEN Dandan, MA Xiaoling. Normalized Laplacian and Normalized Signless Laplacian Characteristic Polynomials of a Graph [J]. Journal of Jilin University Science Edition, 2022, 60(5): 1078-1084.
[2]	CHENG Yinwan, YANG Chao, YAO Bing. Notes on Neighbor Sum Distinguishing Coloring of Halin Graphs [J]. Journal of Jilin University Science Edition, 2022, 60(4): 833-837.
[3]	CHEN Xiang’en, WANG Yongjun. IE-Total Coloring and General Total Coloring of Complete Bipartite Graph Which Are Vertex-Distinguished by Multiple Sets#br# [J]. Journal of Jilin University Science Edition, 2022, 60(4): 838-844.
[4]	CUI Fuxiang, YANG Chao, YE Hongbo, YAO Bing. Neighbor Full Sum Distinguishing Total Coloring of Join Graphs [J]. Journal of Jilin University Science Edition, 2022, 60(1): 44-0052.
[5]	JIA Xiuqing, LI Muchun. D(2)-Vertex-Distinguishing Edge Coloring of Unicyclic Graphs [J]. Journal of Jilin University Science Edition, 2021, 59(4): 807-815.
[6]	ZHAO Yadi, CHEN Xiang’en. Vertex-Distinguishing Ⅰ-Total Colorings and Vertex-Distinguishing Ⅵ-Total Colorings of Graph mC₁₅ [J]. Journal of Jilin University Science Edition, 2021, 59(3): 497-512.
[7]	ZHANG Panpan, LIU Fengxia, MENG Jixiang. Arbitrarily Partitionable Product Graph of Star-Like Tree and Path [J]. Journal of Jilin University Science Edition, 2021, 59(3): 525-530.
[8]	YANG Han, CHEN Xiang’en. Vertex-Distinguishing Ⅰ-Total Colorings and Vertex-Distinguishing Ⅵ-Total Colorings of Graph mC₈ [J]. Journal of Jilin University Science Edition, 2021, 59(2): 241-249.
[9]	TIAN Jingjing. Weight of Light Chords 4-Cycles in IC-Planar Graphs with Degree Restrictions [J]. Journal of Jilin University Science Edition, 2020, 58(5): 1093-1099.
[10]	YANG Jiarui, CHEN Xiang’en. Vertex-Distinguishing General Total Coloring of K_3,5,p [J]. Journal of Jilin University Science Edition, 2020, 58(4): 832-840.
[11]	TANG Baoxiang, REN Han. Perfect Matching Counts for 2-2nP₅ and 2-nK_1,1,1,3 Graphs [J]. Journal of Jilin University Science Edition, 2020, 58(4): 859-863.
[12]	ZHANG Yan. Upper Bound on Chromatic Number of Square Graph of Sparse Graphs [J]. Journal of Jilin University Science Edition, 2020, 58(3): 575-589.
[13]	YANG Qing, TIAN Shuangliang, SUO Langwangqing. b-Colorings of Corona Product and Edge Corona Product of Graphs [J]. Journal of Jilin University Science Edition, 2020, 58(3): 590-594.
[14]	GU Yanbo, LI Jingwen, WANG Lulu. Several Labellings of a Class of Special Graphin Graphical Cryptograph [J]. Journal of Jilin University Science Edition, 2020, 58(2): 293-300.
[15]	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.

L(2,1)-Labelings of Graphs with Connectivity k

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 10