2020/12/18 by Eranda Dhananjaya, W. Li, Dhananjaya, Eranda +1
Computer Science · Mathematics · #05C78 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2012.10087
openalex publication_date 2020/12/18 · openalex created_date 2023/02/13 · openalex updated_date 2026/07/28
A simple graph G is said to admit an antimagic orientation if there exist an orientation on the edges of G and a bijection from E(G) to \1,2,…,|E(G)|\ such that the vertex sums of vertices are pairwise distinct, where the vertex sum of a vertex is defined to be the sum of the labels of the in-edges minus that of the out-edges incident to the vertex. It was conjectured by Hefetz, Mütze, and Schwartz~\citeHMS10 in 2010 that every connected simple graph admits an antimagic orientation. In this paper, we prove that the Mycielski construction and the corona product for graphs with some conditions yield graphs satisfying the above conjecture.