Skip to main content
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

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

    Article  Google Scholar 

  • Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, New York

    Book  MATH  Google Scholar 

  • Calamoneri T (2006) The \(L(j, k)\)-labelling problem: a survey and annotated bibliography. Comput J 49(5):585–608

    Article  Google Scholar 

  • Calamoneri T, Pelc A, Petreschi R (2006) Labeling trees with a condition at distance two. Discrete Math 306:1534–1539

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • Jin XT, Yeh RK (2004) Graph distance-dependent labeling related to code assignment in computer networks. Naval Res Logist 51:1–5

    Article  MathSciNet  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • Liu D (2003) Sizes of graphs with fixed orders and spans for circular distance two labeling. Ars Combinatoria 67:125–139

    Google Scholar 

  • Liu D, Zhu X (2003) Circular distance two labeling and circular chromatic number. Ars Combinatoria 69:177–183

    MathSciNet  MATH  Google Scholar 

  • Liu D, Zhu X (2005) Circular distance two labeling and the \(\lambda \)-number for outerplanar graphs. SIAM J Discrete Math 19:281–293

    Article  MathSciNet  MATH  Google Scholar 

  • Mohar B (2003) Circular colorings of edge weighted graphs. J Graph Theory 43:107–116

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    MathSciNet  Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

  • Zhu X (2001) Circular chromatic number: a survey. Discrete Math 229:371–410

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is partially supported by Faculty Research Grant, Hong Kong Baptist University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wai Chee Shiu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9775-4

Keywords

Mathematics Subject Classification

Navigation