Notes on $$L(1,1)$$ and $$L(2,1)$$ labelings for $$n$$ -cube

Haiying Zhou (), Wai Chee Shiu () and Peter Che Bor Lam ()
Additional contact information
Haiying Zhou: Hong Kong Baptist University
Wai Chee Shiu: Hong Kong Baptist University
Peter Che Bor Lam: BNU-HKBU United International College

Journal of Combinatorial Optimization, 2014, vol. 28, issue 3, No 10, 626-638

Abstract: Abstract Suppose $$d$$ is a positive integer. An $$L(d,1)$$ -labeling of a simple graph $$G=(V,E)$$ is a function $$f:V\rightarrow \mathbb{N }=\{0,1,2,{\ldots }\}$$ such that $$|f(u)-f(v)|\ge d$$ if $$d_G(u,v)=1$$ ; and $$|f(u)-f(v)|\ge 1$$ if $$d_G(u,v)=2$$ . The span of an $$L(d,1)$$ -labeling $$f$$ is the absolute difference between the maximum and minimum labels. The $$L(d,1)$$ -labeling number, $$\lambda _d(G)$$ , is the minimum of span over all $$L(d,1)$$ -labelings of $$G$$ . Whittlesey et al. proved that $$\lambda _2(Q_n)\le 2^k+2^{k-q+1}-2,$$ where $$n\le 2^k-q$$ and $$1\le q\le k+1$$ . As a consequence, $$\lambda _2(Q_n)\le 2n$$ for $$n\ge 3$$ . In particular, $$\lambda _2(Q_{2^k-k-1})\le 2^k-1$$ . In this paper, we provide an elementary proof of this bound. Also, we study the $$L(1,1)$$ -labeling number of $$Q_n$$ . A lower bound on $$\lambda _1(Q_n)$$ are provided and $$\lambda _1(Q_{2^k-1})$$ are determined.

Keywords: Channel assignment problem; Distance two labeling; $$n$$ -cube (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9568-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-012-9568-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9568-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().