Abstract
Suppose \(G\) is a graph. Let \(u\) be a vertex of \(G\). A vertex \(v\) is called an \(i\)-neighbor of \(u\) if \(d_G(u,v)=i\). A \(1\)-neighbor of \(u\) is simply called a neighbor of \(u\). Let \(s\) and \(t\) be two nonnegative integers. Suppose \(f\) is an assignment of nonnegative integers to the vertices of \(G\). If the following three conditions are satisfied, then \(f\) is called an \((s,t)\)-relaxed \(L(2,1)\)-labeling of \(G\): (1) for any two adjacent vertices \(u\) and \(v\) of \(G,\,f(u)\not =f(v)\); (2) for any vertex \(u\) of \(G\), there are at most \(s\) neighbors of \(u\) receiving labels from \(\{f(u)-1,f(u)+1\}\); (3) for any vertex \(u\) of \(G\), the number of \(2\)-neighbors of \(u\) assigned the label \(f(u)\) is at most \(t\). The minimum span of \((s,t)\)-relaxed \(L(2,1)\)-labelings of \(G\) is called the \((s,t)\)-relaxed \(L(2,1)\)-labeling number of \(G\), denoted by \(\lambda ^{s,t}_{2,1}(G)\). It is clear that \(\lambda ^{0,0}_{2,1}(G)\) is the so called \(L(2,1)\)-labeling number of \(G\). In this paper, the \((s,t)\)-relaxed \(L(2,1)\)-labeling number of the triangular lattice is determined for each pair of two nonnegative integers \(s\) and \(t\). And this provides a series of channel assignment schemes for the corresponding channel assignment problem on the triangular lattice.
Similar content being viewed by others
References
Calamoneri T, Petreschi R (2004) \(L(h,1)\)-labeling subclasses of planar graphs. J Parallel Distrib Comput 64:414–426
Calamoneri T (2006) Optimal \(L(h, k)\)-labeling of regular grids. Discret Math Theor Comput Sci 8:141–158
Calamoneri T, Caminiti S, Fertin G (2006) New bounds for the \(L(h, k)\)-number of regular grids. Int J Mob Netw Des Innov 1(2):92–101
Calamoneri T (2011) The L(h, k)-labeling problem: an updated survey and annotated bibliography. Comput J 54(8):1344–1371
Dai B, Lin W (2012a) On \((s, t)\)-relaxed \(L(2,1)\)-labelings of the hexagonal lattice (under review)
Dai B, Lin W (2012b) On \((s, t)\)-relaxed \(L(2,1)\)-labelings of the square lattice (under review)
Goodwin J, Johnston D, Marcus A (2000) Radio channel assignments. UMAP J 21:369–378
Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance 2. SIAM J Discret Math 5:586–595
Griggs JR, Jin XT (2007) Recent progress in mathematics and engineering on optimal graph labelings with distance conditions. J Combin Optim 14(2–3):249–257
Griggs JR, Jin XT (2008) Real number channel assignments for lattices. SIAM J Discret Math 22(3):996C1021
Lin W (2012) On relaxed \(L(2,1)\)-labeling of graphs. Manuscript
Lin W, Wu J (2012) On circular-\(L(2,1)\)-edge-labeling of graphs. Taiwan J Math 16(6):2063–2075
Lin W, Wu J (2012) Distance two edge labelings of lattices. J. Combin. Optim. doi:10.1007/s10878-012-9508-5
Lin W, Zhang P (2012) On n-fold \(L(j, k)\)- and circular \(L(j, k)\)-labeling of graphs. Discret Appl Math 160(16–17):2452–2461
van den Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channel assignment. J Graph Theory 29:263–283
Yeh RK (2006) A survey on labeling graphs with a condition at distance two. Discret Math 306:1217–1231
Zhang P, Lin W (2012) Multiple \(L(j,1)\)-labeling of the triangular lattice, to appear in. J. Combin. Optim. doi: 10.1007/s10878-012-9549-9
Acknowledgments
Project 10971025 supported by NSFC. We are pleased to thank the referees for their valuable comments and remarks which helped to improve the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, W., Dai, B. On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice. J Comb Optim 29, 655–669 (2015). https://doi.org/10.1007/s10878-013-9615-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-013-9615-y