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