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
关键词
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 条
  • [21] L(3,2,1)-LABELING OF GRAPHS
    Chia, Ma-Lian
    Kuo, David
    Liao, Hong-ya
    Yang, Cian-Hui
    Yeh, Roger K.
    TAIWANESE JOURNAL OF MATHEMATICS, 2011, 15 (06): : 2439 - 2457
  • [22] The (2,1) -Total Labeling of Double Graph of Some Graphs
    Ma, Qiaoling
    Wang, Jihui
    2011 2ND INTERNATIONAL CONFERENCE ON CHALLENGES IN ENVIRONMENTAL SCIENCE AND COMPUTER ENGINEERING (CESCE 2011), VOL 11, PT A, 2011, 11 : 281 - 284
  • [23] Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
    Arockiaraj, Micheal
    Delaila, J. Nancy
    Abraham, Jessie
    FUNDAMENTA INFORMATICAE, 2021, 178 (03) : 187 - 202
  • [24] THE lambda-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
    Kim, Byeong Moon
    Song, Byung Chul
    Rho, Yoomi
    KOREAN JOURNAL OF MATHEMATICS, 2013, 21 (02): : 151 - 159
  • [25] MMD labeling of EASS of cartesian product of two graphs
    R. Revathi
    D. Angel
    I. Annammal
    OPSEARCH, 2023, 60 : 870 - 876
  • [26] MMD labeling of EASS of cartesian product of two graphs
    Revathi, R.
    Angel, D.
    Annammal, I.
    OPSEARCH, 2023, 60 (02) : 870 - 876
  • [27] Matching Book Embedding of the Cartesian Product of a Complete Graph and a Cycle
    Shao, Zeling
    Liu, Yanqing
    Li, Zhiguo
    ARS COMBINATORIA, 2020, 153 : 89 - 97
  • [28] An Am-Supermagic Decomposition Of The Cartesian Product of A Sun Graph And A Path
    Hader, Antik Estika
    Salman, M. A. N.
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON MATHEMATICS AND MATHEMATICS EDUCATION 2018 (ICM2E 2018), 2018, 235 : 349 - 351
  • [29] L(j,k)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L(j,k)$$\end{document}-labeling number of Cartesian product of path and cycle
    Qiong Wu
    Wai Chee Shiu
    Pak Kiu Sun
    Journal of Combinatorial Optimization, 2016, 31 (2) : 604 - 634
  • [30] On identifying codes in the Cartesian product of a path and a complete graph
    Jason Hedetniemi
    Journal of Combinatorial Optimization, 2016, 31 : 1405 - 1416