Is there any polynomial upper bound for the universal labeling of graphs?
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0107-8
Abstract: A universal labeling of a graph G is a labeling of the edge set in G such that in every orientation $$\ell $$ℓ of G for every two adjacent vertices v and u, the sum… read more here.
Keywords: labeling number; delta; graph; universal labeling ... See more keywords
L(D, 2, 1)-labeling of Square Grid
Sign Up to like & getrecommendations! Published in 2019 at "National Academy Science Letters"
DOI: 10.1007/s40009-018-0780-5
Abstract: For a fixed integer $$D (\ge 3)$$D(≥3) and $$\lambda $$λ$$\in $$∈$${\mathbb {Z}}^+$$Z+, a $$\lambda $$λ-L(D, 2, 1)-labeling of a graph $$G = (V, E)$$G=(V,E) is the problem of assigning non-negative integers (known as labels) from the set… read more here.
Keywords: square grid; lambda labeling; labeling number; bound labeling ... See more keywords