A note on antimagic orientations of even regular graphs

DOI10.1016/J.DAM.2019.04.017zbMATH Open1419.05190arXiv1811.01904OpenAlexW2962977267MaRDI QIDQ2322893FDOQ2322893

Authors: Donglei Yang 

Publication date: 5 September 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Motivated by the conjecture of Hartsfield and Ringel on antimagic labelings of undirected graphs, Hefetz, M"{u}tze, and Schwartz initiated the study of antimagic labelings of digraphs in 2010. Very recently, it has been conjectured in [Antimagic orientation of even regular graphs, J. Graph Theory, 90 (2019), 46-53.] that every graph admits an antimagtic orientation, which is a strengthening of an earlier conjecture of Hefetz, M"{u}tze and Schwartz. In this paper, we prove that every $2d$-regular graph (not necessarily connected) admits an antimagic orientation, where $dge2$. Together with known results, our main result implies that the above-mentioned conjecture is true for all regular graphs.

Full work available at URL: https://arxiv.org/abs/1811.01904

Recommendations

• Antimagic orientations of even regular graphs
• Antimagic orientations of disconnected even regular graphs
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientations of graphs with large maximum degree
• On antimagic directed graphs

zbMATH Keywords

Euler tourantimagic labellingantimagic orientation

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• An application of the combinatorial nullstellensatz to a graph labelling problem
• Dense graphs are antimagic
• Title not available (Why is that?)
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• On antimagic directed graphs
• Antimagic labeling of regular graphs
• Antimagic orientation of biregular bipartite graphs
• Graphs of large linear size are antimagic
• Antimagic orientations of even regular graphs
• Regular graphs of odd degree are antimagic

Cited In (15)

• Antimagic orientation of subdivided caterpillars
• Antimagic orientation of graphs with minimum degree at least 33
• Antimagic labeling of biregular bipartite graphs
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientation of lobsters
• Antimagic orientations of graphs with large maximum degree
• Antimagic orientations of disconnected even regular graphs
• List-antimagic labeling of vertex-weighted graphs
• Antimagic orientations of graphs with given independence number
• Antimagic orientation of forests
• Title not available (Why is that?)
• On antimagic directed graphs
• Title not available (Why is that?)
• Graph antimagic labeling: a survey
• Antimagic orientations of even regular graphs

This page was built for publication: A note on antimagic orientations of even regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322893)