L(2,1)-labeling of a circular graph

被引：0
|
作者：
Ma, Dengju [1 ,2 ]
Ren, Han [2 ]
Lv, Damei [1 ]
机构：
[1] Nantong Univ, Sch Sci, Nantong 226019, Jiangsu, Peoples R China
[2] E China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
来源：
ARS COMBINATORIA | 2015年 / 123卷
关键词：
L(2,1)-labeling; lambda-number; circular graph; GENERALIZED PETERSEN GRAPHS; CARTESIAN PRODUCTS; LABELING GRAPHS; DISTANCE-2; CYCLES;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper the A-number of the circular graph C(km,m) is shown at most 9 where m >= 3 and k >= 2, and the lambda-number of the circular graph C(km+s, m) is shown at most 15 where m >= 3, k >= 2 and 1 <= s <= m - 1. In particular, the lambda-numbers of C(2m, m) and C(n, 2) are determined, which are at most 8. All our results indicates that the Griggs and Yeh's conjecture holds for circular graphs. The conjecture says that for any graph G with maximum degree Delta >= 2, lambda(G) <= Delta(2). Also, we determine A-numbers of C(n, 3), C(n, 4) and C(n, 5) if n equivalent to 0(mod 7).
引用
收藏
页码：231 / 245
页数：15
相关论文
共 50 条
  • [21] Exact Algorithms for L(2,1)-Labeling of Graphs
    Havet, Frederic
    Klazar, Martin
    Kratochvil, Jan
    Kratsch, Dieter
    Liedloff, Mathieu
    ALGORITHMICA, 2011, 59 (02) : 169 - 194
  • [22] L(2,1)-labeling of disk intersection graphs
    Chybowska-Sokol, Joanna
    Junosza-Szaniawski, Konstanty
    Rzazewski, Pawel
    DISCRETE APPLIED MATHEMATICS, 2020, 277 (277) : 71 - 81
  • [23] L(d,2,1)-Labeling of Sun Graphs
    Indriati, Diari
    Martini, Titin S.
    Herlinawati, Novita
    4TH INTERNATIONAL CONFERENCE ON MATHEMATICS AND NATURAL SCIENCES (ICMNS 2012)L: SCIENCE FOR HEALTH, FOOD AND SUSTAINABLE ENERGY, 2014, 1589 : 500 - 503
  • [24] Exact algorithms for L(2,1)-labeling of graphs
    Kratochvil, Jan
    Kratsch, Dieter
    Liedloff, Mathieu
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 513 - +
  • [25] L(2,1)-labeling for brick product graphs
    Shao, Zehui
    Xu, Jin
    Yeh, Roger K.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 447 - 462
  • [26] The list L(2,1)-labeling of planar graphs
    Zhu, Haiyang
    Miao, Lianying
    Chen, Sheng
    Lu, Xinzhong
    Song, Wenyao
    DISCRETE MATHEMATICS, 2018, 341 (08) : 2211 - 2219
  • [27] Heuristic Algorithms for the L(2,1)-Labeling Problem
    Panda, B. S.
    Goel, Preeti
    SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, 2010, 6466 : 214 - 221
  • [28] L(2,1)-labeling of strong products of cycles
    Korze, D
    Vesel, A
    INFORMATION PROCESSING LETTERS, 2005, 94 (04) : 183 - 190
  • [29] Exact Algorithm for L(2,1) Labeling of Cartesian Product Between Complete Bipartite Graph and Cycle
    Ghosh, Sumonta
    Sarkar, Prosanta
    Pal, Anita
    HARMONY SEARCH AND NATURE INSPIRED OPTIMIZATION ALGORITHMS, 2019, 741 : 325 - 334
  • [30] Reconfiguration of List L(2,1)-Labelings in a Graph
    Ito, Takehiro
    Kawamura, Kazuto
    Ono, Hirotaka
    Zhou, Xiao
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 34 - 43
12345