On L(2,1)-labeling of the Cartesian product of a cycle and a path

被引：0
|
作者：
Jha, PK
Narayanan, A
Sood, P
Sundaram, K
Sunder, V
机构：
[1] Multimedia Univ, Fac Informat Sci & Tech, Melaka 75450, Malaysia
[2] Cisco Syst, Chelmsford, MA 01824 USA
[3] Nortel Networks, Chelmsford, MA 01545 USA
[4] Lucent Technol, Murray Hill, NJ 07974 USA
[5] Proctor & Gamble I Ltd, Mumbai 400076, India
来源：
ARS COMBINATORIA | 2000年 / 55卷
关键词：
L(2,1)-labeling; Cartesian product; cycle; path;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Sharp bounds are presented for the lambda-number of the Cartesian product of a cycle and a path, and of the Cartesian product of two cycles.
引用
收藏
页码：81 / 89
页数：9
相关论文
共 50 条
  • [31] L(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs Murugan Muthali
    Muthali, Murugan
    MATEMATIKA, 2014, 30 (02) : 109 - 116
  • [32] (2,1)-Total Labeling of Cube Connected Cycle
    Sethuraman, G.
    Velankanni, A.
    UTILITAS MATHEMATICA, 2018, 109 : 63 - 82
  • [33] THE L(2,1)-CHOOSABILITY OF CYCLE
    Zhou, H.
    Shiu, W. C.
    Lam, P. C. B.
    TRANSACTIONS ON COMBINATORICS, 2012, 1 (03) : 21 - 38
  • [34] Circular L(j,k)-labeling number of direct product of path and cycle
    Wu, Qiong
    Shiu, Wai Chee
    Sun, Pak Kiu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (02) : 355 - 368
  • [35] Circular L(j,k)-labeling number of direct product of path and cycle
    Qiong Wu
    Wai Chee Shiu
    Pak Kiu Sun
    Journal of Combinatorial Optimization, 2014, 27 : 355 - 368
  • [36] Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle
    Susanti, Bety Hayat
    Salman, A. N. M.
    Simanjuntak, Rinovia
    2ND INTERNATIONAL CONFERENCE OF GRAPH THEORY AND INFORMATION SECURITY, 2015, 74 : 151 - 154
  • [37] L(3,2,1)-LABELING FOR THE PRODUCT OF A COMPLETE GRAPH AND A CYCLE
    Kim, Byeong Moon
    Hwang, Woonjae
    Song, Byung Chul
    TAIWANESE JOURNAL OF MATHEMATICS, 2015, 19 (03): : 849 - 859
  • [38] L(2,1)-labelings of Cartesian products of two cycles
    Schwarz, Christopher
    Troxell, Denise Sakai
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (10) : 1522 - 1540
  • [39] Nordhaus-Gaddum-type results for path covering and L(2,1)-labeling numbers
    Lu, Damei
    Du, Juan
    Lin, Nianfeng
    Zhang, Ke
    Yi, Dan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (02) : 502 - 510
  • [40] On L(2,1)-labelings of Cartesian products of paths and cycles
    Kuo, D
    Yan, JH
    DISCRETE MATHEMATICS, 2004, 283 (1-3) : 137 - 144
12345