On the L(2, 1)-labeling conjecture for brick product graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0101-1
Abstract: Let $$G=(V, E)$$G=(V,E) be a graph. Denote $$d_G(u, v)$$dG(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… read more here.
Keywords: conjecture brick; product; brick product; product graphs ... See more keywords