On L(2,1)-labelings of Cartesian products of paths and cycles

被引：60
|
作者：
Kuo, D [1 ]
Yan, JH
机构：
[1] Natl Dong Hwa Univ, Dept Appl Math, Hualien 974, Taiwan
[2] Aletheia Univ, Dept Math, Tamsui 251, Taiwan
来源：
DISCRETE MATHEMATICS | 2004年 / 283卷 / 1-3期
关键词：
L(2,1)-labeling; L(2,1)-labeling number; Cartesian product; path; cycle;
D O I：
10.1016/j.disc.2003.11.009
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A k-L(2, 1)-labeling of a graph G is a function f from the vertex set V(G) to {0, 1,...,k} such that \f(u) - f(upsilon)\ greater than or equal to 1 if d(u, v) = 2 and \f (u) - f (v)\ greater than or equal to 2 if d(u, v) = 1. The L(2, 1)-labefing problem is to find the L(2, 1)-labeling number lambda(G) of a graph G which is the minimum cardinality k such that G has a k-L(2, 1)-labeling. In this paper, we study L(2, 1)-labeling numbers of Cartesian products of paths and cycles. (C) 2004 Elsevier B.V. All fights reserved.
引用
收藏
页码：137 / 144
页数：8
相关论文
共 50 条
  • [1] n-fold L(2,1)-labelings of Cartesian product of paths and cycles
    Chang, Fei-Huang
    Chia, Ma-Lian
    Jiang, Shih-Ang
    Kuo, David
    Yan, Jing-Ho
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (03)
  • [2] Classification of l(2, 1)-labeling of cartesian products of paths and cycles
    Zhao T.
    Zhou X.
    Zhao, Taiyin, 1600, American Scientific Publishers (13): : 388 - 393
  • [3] Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
    Jha, PK
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 2000, 47 (10): : 1531 - 1534
  • [4] On L(d, 1)-Labelings of the Cartesian Product of Two Cycles
    Lin, Chun-Chun
    Yan, Jing-Ho
    ARS COMBINATORIA, 2015, 122 : 33 - 53
  • [5] Vertex-neighbor-toughness of the Cartesian Products of paths and cycles
    Wei, Zongtian
    Yang, Jingting
    Li, Yinkui
    Yue, Chao
    ARS COMBINATORIA, 2019, 147 : 63 - 78
  • [6] On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars
    Clancy K.
    Haythorpe M.
    Newcombe A.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2024, 119 : 323 - 333
  • [7] On L(2,1)-labeling of the Cartesian product of a cycle and a path
    Jha, PK
    Narayanan, A
    Sood, P
    Sundaram, K
    Sunder, V
    ARS COMBINATORIA, 2000, 55 : 81 - 89
  • [8] On the L(2,1)-labelings of amalgamations of graphs
    Adams, Sarah Spence
    Howell, Noura
    Karst, Nathaniel
    Troxell, Denise Sakai
    Zhu, Junjie
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (7-8) : 881 - 888
  • [9] (2,1)-TOTAL NUMBER OF JOINS OF PATHS AND CYCLES
    Wang, Weifan
    Huang, Jing
    Sun Haina
    Huang, Danjun
    TAIWANESE JOURNAL OF MATHEMATICS, 2012, 16 (02): : 605 - 619
  • [10] Optimal L(2,1)-labeling of strong products of cycles
    Jha, PK
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 2001, 48 (04): : 498 - 500
12345