A note on (s, t)-relaxed L(2, 1)-labeling of graphs

Taiyin Zhao () and Guangmin Hu
Additional contact information
Taiyin Zhao: University of Electronic Science and Technology of China
Guangmin Hu: University of Electronic Science and Technology of China

Journal of Combinatorial Optimization, 2017, vol. 34, issue 2, No 4, 378-382

Abstract: Abstract Let $$G=(V, E)$$ G = ( V , E ) be a graph. For two vertices u and v in G, we denote $$d_G(u, v)$$ d G ( u , v ) the distance between u and v. A vertex v is called an i-neighbor of u if $$d_G(u,v)=i$$ d G ( u , v ) = i . Let s, t and k be nonnegative integers. An (s, t)-relaxed k-L(2, 1)-labeling of a graph G is an assignment of labels from $$\{0, 1, \ldots , k\}$$ { 0 , 1 , … , k } to the vertices of G if the following three conditions are met: (1) adjacent vertices get different labels; (2) for any vertex u of G, there are at most s 1-neighbors of u receiving labels from $$\{f(u)-1,f(u)+1\}$$ { 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 (s, t)-relaxed L(2, 1)-labeling number $$\lambda _{2,1}^{s,t}(G)$$ λ 2 , 1 s , t ( G ) of G is the minimum k such that G admits an (s, t)-relaxed k-L(2, 1)-labeling. In this article, we refute Conjecture 4 and Conjecture 5 stated in (Lin in J Comb Optim. doi: 10.1007/s10878-014-9746-9 , 2013).

Keywords: (s; t)-relaxed L(2; 1)-labeling; Graph labeling; Channel assignment problem; Combinatorial problems (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-9996-9 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:2:d:10.1007_s10878-016-9996-9

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

DOI: 10.1007/s10878-016-9996-9

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