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
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2016年 / 31卷 / 02期
关键词：
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
相关论文
共 50 条
12345