L(j, k)-labeling number of Cartesian product of path and cycle

被引:0
作者
Wu, Qiong [1 ,2 ]
Shiu, Wai Chee [1 ]
Sun, Pak Kiu [1 ]
机构
[1] Hong Kong Baptist Univ, Dept Math, 224 Waterloo Rd, Kowloon Tong, Hong Kong, Peoples R China
[2] Tianjin Univ Technol & Educ, Dept Computat Sci, Tianjin 300222, Peoples R China
关键词
L(j; k)-labeling; Cartesian product; Path; Cycle;
D O I
10.1007/s10878-014-9775-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
For positive numbers and , an -labeling of is an assignment of numbers to vertices of such that if , and if . The span of is the difference between the maximum and the minimum numbers assigned by . The -labeling number of , denoted by , is the minimum span over all -labelings of . In this article, we completely determine the -labeling number () of the Cartesian product of path and cycle.
引用
收藏
页码:604 / 634
页数:31
相关论文
共 21 条
[1]   CODE ASSIGNMENT FOR HIDDEN TERMINAL INTERFERENCE AVOIDANCE IN MULTIHOP PACKET RADIO NETWORKS [J].
BERTOSSI, AA ;
BONUCCELLI, MA .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (04) :441-449
[2]  
Bondy J., 2008, GRADUATE TEXTS MATH
[3]   Labeling trees with a condition at distance two [J].
Calamoneri, Tiziana ;
Pelc, Andrzej ;
Petreschi, Rossella .
DISCRETE MATHEMATICS, 2006, 306 (14) :1534-1539
[4]   The L(h, k)-labelling problem:: A survey and annotated bibliography [J].
Calamoneri, Tiziana .
COMPUTER JOURNAL, 2006, 49 (05) :585-608
[5]  
Griggs J R, 2005, P 5 INT WORKSH ALG W
[6]   Recent progress in mathematics and engineering on optimal graph labellings with distance conditions [J].
Griggs, Jerrold R. ;
Jin, Xiaohua Teresa .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (2-3) :249-257
[7]  
Jin XT, 2004, NAV RES LOG, V51, P1
[8]  
Lam PCB, 2007, J COMB OPTIM, V14, P219, DOI [10.1007/s10878-007-9057-5, 10.1007/S10878-007-9057-5]
[9]  
Lin W, 2009, 1 K CIRCULAR C UNPUB
[10]   Circular distance two labeling and the λ-number for outerplanar graphs [J].
Liu, DDF ;
Zhu, XD .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (02) :281-293