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 条

[31] 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
[32] L(2, 1)-LABELING OF THE CARTESIAN AND STRONG PRODUCT OF TWO DIRECTED CYCLES
Shao, Zehui
Jiang, Huiqin
Vesel, Aleksander
MATHEMATICAL FOUNDATIONS OF COMPUTING, 2018, 1 (01): : 49 - 61
[33] Path covering number and L(2,1)-labeling number of graphs
Lu, Changhong
Zhou, Qing
DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2062 - 2074
[34] The Menger number of the Cartesian product of graphs
Ma, Meijie
Xu, Jun-Ming
Zhu, Qiang
APPLIED MATHEMATICS LETTERS, 2011, 24 (05) : 627 - 629
[35] On the security number of the Cartesian product of graphs
Jakovac, Marko
Otachi, Yota
DISCRETE APPLIED MATHEMATICS, 2021, 304 : 119 - 128
[36] Zombie number of the Cartesian product of graphs
Keramatipour, Ali
Bahrak, Behnam
DISCRETE APPLIED MATHEMATICS, 2021, 289 : 545 - 549
[37] Hadwiger number and the Cartesian product of graphs
Chandran, L. Sunil
Kostochka, Alexandr
Raju, J. Krishnam
GRAPHS AND COMBINATORICS, 2008, 24 (04) : 291 - 301
[38] The Monophonic Number of Cartesian Product Graphs
Santhakumaran, A. P.
Chandran, S. V. Ullas
INDIANA UNIVERSITY MATHEMATICS JOURNAL, 2012, 61 (02) : 849 - 857
[39] On the independence number of the Cartesian product of caterpillars
Martin, SP
Powell, JS
Rall, DF
ARS COMBINATORIA, 2001, 60 : 73 - 84
[40] The Independence Number of the Cartesian Product of Graphs
Friedler, Louis M.
ARS COMBINATORIA, 2011, 99 : 205 - 216

← 1 2 3 4 5 →