Abstract
Let n,j,k be nonnegative integers. An n-fold L(j,k)-labeling of a graph G is an assignment f of sets of nonnegative integers of order n to the vertices of G such that, for any two vertices u,v and any two integers a∈f(u), b∈f(v), |a−b|≥j if uv∈E(G), and |a−b|≥k if u and v are distance two apart. The span of f is the absolute difference between the maximum and minimum integers used by f. The n-fold L(j,k)-labeling number of G is the minimum span over all n-fold L(j,k)-labelings of G.
Let n,j,k and m be nonnegative integers. An n-fold circular m-L(j,k)-labeling of a graph G is an assignment f of subsets of {0,1,…,m−1} of order n to the vertices of G such that, for any two vertices u,v and any two integers a∈f(u), b∈f(v), min{|a−b|,m−|a−b|}≥j if uv∈E(G), and min{|a−b|,m−|a−b|}≥k if u and v are distance two apart. The minimum m such that G has an n-fold circular m-L(j,k)-labeling is called the n-fold circular L(j,k)-labeling number of G.
This paper provides upper and lower bounds for the n-fold L(j,1)-labeling number and the n-fold circular L(j,1)-labeling number of the triangular lattice and determines the n-fold L(2,1)-labeling number and n-fold circular L(2,1)-labeling number of the triangular lattice for n≥3.
Similar content being viewed by others
References
Calamoneri T (2006) Optimal L(h,k)-labeling of regular grids. Discrete Math Theor Comput Sci 8:141–158
Calamoneri T (2011) The L(h,k)-labeling problem: an updated survey and annotated bibliography. Comput J 54(8):1344–1371
Calamoneri T, Caminiti S, Fertin G (2006) New bounds for the L(h,k)-number of regular grids. Int J Mobile Netw Design Innovat 1(2):92–101
Chvátal V, Garey MR, Johnson DS (1978) Two results concerning multicoloring. Ann Discrete Math 2:151–154
Goodwin J, Johnston D, Marcus A (2000) Radio channel assignments. UMAP J 21:369–378
Griggs JR, Jin XH (2005) Optimal channel assignments for the lattices with a condition at distance two. In: Proceedings of the 5th international workshop on algorithms for wireless, mobile, ad hoc and sensor networks (W-MAN05), vol 13, Denver, Colorado, April 4–8. IEEE Comput Soc, Los Alamitos, p 238.1.
Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance 2. SIAM J Discrete Math 5:586–595
Griggs JR, Jin XT (2007) Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. J Comb Optim 14(2–3):249–257
Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68:1497–1514
van den Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channel assignment. J Graph Theory 29:263–283
Johnson A, Holroyd FC, Stahl S (1997) Multichromatic numbers, star chromatic numbers and Kneser graphs. J Graph Theory 26:137–145
Leese RA, Noble SD (2004) Cyclic labellings with constraints at two distances. Electron J Comb 11:#R16
Lü D, Lin W, Song Z (2009) L(2,1)-circular labelings of Cartesian products of complete graphs. J Math Res Expo 29(1):91–98
Lam PCB, Lin W, Wu J (2007) L(j,k)-labellings and circular L(j,k)-labellings of products of complete graphs. J Comb Optim 14(2–3):219–227
Lin W (2008) Multicolouring and Mycielski construction. Discrete Math 308:3565–3573
Lin W, Zhang P (2012) On n-fold L(j,k)- and circular L(j,k)-labeling of graphs. Discrete Appl Math 160(16–17):2452–2461
Lin W, Liu DDF, Zhu X (2010) Multi-colouring the Mycielskian of graphs. J Graph Theory 63(4):311–323
Liu DD-F (2001) Hamiltonicity and circular distance two labellings. Discrete Math 232:163–169
Liu DD-F, Zhu X (2003) Circulant distant two labeling and circular chromatic number. Ars Comb 69:177–183
Stahl S (1976) n-tuple colorings and associated graphs. J Comb Theory, Ser B 20:185–203
Wu K-F, Yeh RK (2000) Labelling graphs with the circular difference. Taiwan J Math 4:397–405
Yeh RK (2006) A survey on labeling graphs with a condition at distance two. Discrete Math 306:1217–1231
Acknowledgements
The authors would like to give their thanks to the referees for their valuable suggestions for the revision of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Project 10971025 supported by NSFC.
Rights and permissions
About this article
Cite this article
Zhang, P., Lin, W. Multiple L(j,1)-labeling of the triangular lattice. J Comb Optim 27, 695–710 (2014). https://doi.org/10.1007/s10878-012-9549-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9549-9