$$L(2,1)$$ L ( 2, 1 ) -labeling for brick product graphs

Zehui Shao (), Jin Xu and Roger K. Yeh
Additional contact information
Zehui Shao: Chengdu University
Jin Xu: Peking University
Roger K. Yeh: Feng Chia University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 2, No 1, 447-462

Abstract: Abstract Let $$G=(V, E)$$ G = ( V , E ) be a graph. Denote $$d_G(u, v)$$ d G ( u , v ) the distance between two vertices $$u$$ u and $$v$$ v in $$G$$ G . An $$L(2, 1)$$ L ( 2 , 1 ) -labeling of $$G$$ G is a function $$f: V \rightarrow \{0,1,\cdots \}$$ f : V → { 0 , 1 , ⋯ } such that for any two vertices $$u$$ u and $$v$$ v , $$|f(u)-f(v)| \ge 2$$ | f ( u ) - f ( v ) | ≥ 2 if $$d_G(u, v) = 1$$ d G ( u , v ) = 1 and $$|f(u)-f(v)| \ge 1$$ | f ( u ) - f ( v ) | ≥ 1 if $$d_G(u, v) = 2$$ d G ( u , v ) = 2 . The span of $$f$$ f is the difference between the largest and the smallest number in $$f(V)$$ f ( V ) . The $$\lambda $$ λ -number of $$G$$ G , denoted $$\lambda (G)$$ λ ( G ) , is the minimum span over all $$L(2,1 )$$ L ( 2 , 1 ) -labelings of $$G$$ G . In this article, we confirm Conjecture 6.1 stated in X. Li et al. (J Comb Optim 25:716–736, 2013) in the case when (i) $$\ell $$ ℓ is even, or (ii) $$\ell \ge 5$$ ℓ ≥ 5 is odd and $$0 \le r \le 8$$ 0 ≤ r ≤ 8 .

Keywords: L(2; 1)-labeling; Brick product graph; Graph labeling; Frequency assignment problem (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9763-8 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:31:y:2016:i:2:d:10.1007_s10878-014-9763-8

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

DOI: 10.1007/s10878-014-9763-8

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 ().