Is there any polynomial upper bound for the universal labeling of graphs?

Arash Ahadi (), Ali Dehghan () and Morteza Saghafian ()
Additional contact information
Arash Ahadi: Sharif University of Technology
Ali Dehghan: Carleton University
Morteza Saghafian: Sharif University of Technology

Journal of Combinatorial Optimization, 2017, vol. 34, issue 3, No 8, 760-770

Abstract: 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 of incoming edges of v and u in the oriented graph are different from each other. The universal labeling number of a graph G is the minimum number k such that G has universal labeling from $$\{1,2,\ldots , k\}$$ { 1 , 2 , … , k } denoted it by $$\overrightarrow{\chi _{u}}(G) $$ χ u → ( G ) . We have $$2\Delta (G)-2 \le \overrightarrow{\chi _{u}} (G)\le 2^{\Delta (G)}$$ 2 Δ ( G ) - 2 ≤ χ u → ( G ) ≤ 2 Δ ( G ) , where $$\Delta (G)$$ Δ ( G ) denotes the maximum degree of G. In this work, we offer a provocative question that is: “Is there any polynomial function f such that for every graph G, $$\overrightarrow{\chi _{u}} (G)\le f(\Delta (G))$$ χ u → ( G ) ≤ f ( Δ ( G ) ) ?”. Towards this question, we introduce some lower and upper bounds on their parameter of interest. Also, we prove that for every tree T, $$\overrightarrow{\chi _{u}}(T)={\mathcal {O}}(\Delta ^3) $$ χ u → ( T ) = O ( Δ 3 ) . Next, we show that for a given 3-regular graph G, the universal labeling number of G is 4 if and only if G belongs to Class 1. Therefore, for a given 3-regular graph G, it is an $$ {{\mathbf {N}}}{{\mathbf {P}}} $$ N P -complete to determine whether the universal labeling number of G is 4. Finally, using probabilistic methods, we almost confirm a weaker version of the problem.

Keywords: Universal labeling; Universal labeling number; 1-2-3-Conjecture; Regular graphs; Trees (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0107-8 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-0107-8

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

DOI: 10.1007/s10878-016-0107-8

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