Abstract
For positive numbers \(j\) and \(k\), an \(L(j,k)\)-labeling \(f\) of \(G\) is an assignment of numbers to vertices of \(G\) such that \(|f(u)-f(v)|\ge j\) if \(d(u,v)=1\), and \(|f(u)-f(v)|\ge k\) if \(d(u,v)=2\). The span of \(f\) is the difference between the maximum and the minimum numbers assigned by \(f\). The \(L(j,k)\)-labeling number of \(G\), denoted by \(\lambda _{j,k}(G)\), is the minimum span over all \(L(j,k)\)-labelings of \(G\). In this article, we completely determine the \(L(j,k)\)-labeling number (\(2j\le k\)) of the Cartesian product of path and cycle.














Similar content being viewed by others
References
Bertossi AA, Bonuccelli MA (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans Netw 3(4):441–449
Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, New York
Calamoneri T (2006) The \(L(j, k)\)-labelling problem: a survey and annotated bibliography. Comput J 49(5):585–608
Calamoneri T, Pelc A, Petreschi R (2006) Labeling trees with a condition at distance two. Discrete Math 306:1534–1539
Griggs JR, Jin XT (2005) Optimal channel assignments for lattices with conditions at distance two, In Proceedings of the 5th international workshop on algorithms for wireless mobile, Ad Hoc and sensor networks (W-MAN ’05), IEEE Computer Society, Denver, Colorado, April 4–8 2005
Griggs JR, Jin XT (2007) Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. J Combin Optim 14(2–3):249–257
Jin XT, Yeh RK (2004) Graph distance-dependent labeling related to code assignment in computer networks. Naval Res Logist 51:1–5
Lam PCB, Lin W, Wu J (2007) \(L(j, k)\)-labellings and circular \(L(j, k)\)-labellings of products of complete graphs. J Combin Optim 14(2–3):219–227
Lin W, Wu Q (2009) The \((1, k)\)-circular chromatic numbers of lattices, manuscript.
Liu D (2001) Hamiltonicity and circular distance two labelings. Discrete Math 232:163–169
Liu D (2003) Sizes of graphs with fixed orders and spans for circular distance two labeling. Ars Combinatoria 67:125–139
Liu D, Zhu X (2003) Circular distance two labeling and circular chromatic number. Ars Combinatoria 69:177–183
Liu D, Zhu X (2005) Circular distance two labeling and the \(\lambda \)-number for outerplanar graphs. SIAM J Discrete Math 19:281–293
Mohar B (2003) Circular colorings of edge weighted graphs. J Graph Theory 43:107–116
Niu Q (2007) \(L(j, k)\)-labeling of graph and edge span, M.Phil. Thesis, Southeast University.
Shiu WC, Wu Q (2013) \(L(j, k)\)-labeling number of direct product of path and cycle. Acta Math Sinica 29:1437–1448
Wu Q (2013) Distance two labeling of some products of graphs. Ph.D. Thesis, Hong Kong Baptist University.
Wu Q, Lin W (2010) Circular \(L(j, k)\)-labeling numbers of trees and products of graphs. J Southeast University 26(1):142–145
Wu Q, Shiu WC, Sun PK (2014) Circular \(L(j, k)\)-labeling number of direct product of path and cycle. J Combin Opt 27:355–368
Yeh RK (2006) A survey on labeling graphs with a condition at distance two. Discrete Math 306:1217–1231
Zhu X (2001) Circular chromatic number: a survey. Discrete Math 229:371–410
Acknowledgments
This work is partially supported by Faculty Research Grant, Hong Kong Baptist University.
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Wu, Q., Shiu, W.C. & Sun, P.K. \(L(j,k)\)-labeling number of Cartesian product of path and cycle. J Comb Optim 31, 604–634 (2016). https://doi.org/10.1007/s10878-014-9775-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-014-9775-4