On the L(2, 1)-labeling conjecture for brick product graphs

Zehui Shao, Xiaosong Zhang (), Huiqin Jiang, Bo Wang and Juanjuan He
Additional contact information
Zehui Shao: Chengdu University
Xiaosong Zhang: University of Electronic Science and Technology of China
Huiqin Jiang: Chengdu University
Bo Wang: Chengdu University
Juanjuan He: Wuhan University of Science and Technology

Journal of Combinatorial Optimization, 2017, vol. 34, issue 3, No 4, 706-724

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 and v in G. An L(2, 1)-labeling of G is a function $$f: V \rightarrow \{0,1,\ldots \}$$ f : V → { 0 , 1 , … } such that for any two vertices u and 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 is the difference between the largest and the smallest number in f(V). The $$\lambda $$ λ -number $$\lambda (G)$$ λ ( G ) of G is the minimum span over all L(2, 1)-labelings of G. In this paper, we conclude that the $$\lambda $$ λ -number of each brick product graph is 5 or 6, which confirms Conjecture 6.1 stated in Li et al. (J Comb Optim 25:716–736, 2013).

Keywords: L(2; 1)-labeling; Brick product graph; Graph labeling (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0101-1 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:34:y:2017:i:3:d:10.1007_s10878-016-0101-1

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

DOI: 10.1007/s10878-016-0101-1

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