Abstract
An antimagic labelling of a digraph D with m arcs is a bijection from the set of arcs of D to \(\{1,\ldots ,m\}\) such that any two vertices have distinct vertex-sums, where the vertex-sum of a vertex \(v\in V(D)\) is the sum of labels of all arcs entering v minus the sum of labels of all arcs leaving v. An orientation D of a graph G is antimagic if D has an antimagic labelling. In 2010, Hefetz, M\(\ddot{\text {u}}\)tze and Schwartz conjectured that every connected graph admits an antimagic orientation. The conjecture is still open, even for trees. Motivated by directed version of the well-known 1-2-3 Conjecture, we deal with vertex-sums such that only adjacent vertices must be distinguished. An orientation D of a graph G is local antimagic if there is a bijection from E(G) to \(\{1,\ldots ,|E(G)|\}\) such that any two adjacent vertices have distinct vertex-sums. We prove that every graph with maximum degree at most 4 admits a local antimagic orientation by Alon’s Combinatorial Nullstellensatz.
Similar content being viewed by others
References
Alon N (1999) Combinatorial Nullstellensatz. Comb Probab Comput 8:7–29
Alon N, Kaplan G, Lev A, Roditty Y, Yuster R (2004) Dense graphs are antimagic. J Graph Theory 47:297–309
Arumugam S, Premalatha K, Bača M, Semaničová-Feňovčíková A (2017) Local antimagic vertex coloring of a graph. Graphs Comb 33:275–285
Bensmail J, Senhaji M, Lyngsie KS (2017) On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture. Discrete Math Theor Comput Sci 19:21
Bondy JA, Murty USR (1976) Graph theory with application. Macmillan, London
Borowiecki M, Grytczuk J, Pilśniak M (2012) Coloring chip configurations on graphs and digraphs. Inf Process Lett 112:1–4
Chang F, Liang Y, Pan Z, Zhu X (2016) Antimagic labelling of regular graphs. J Graph Theory 82:339–349
Cranston D (2009) Regular bipartite graphs are antimagic. J Graph Theory 60:173–182
Cranston D, Liang Y, Zhu X (2015) Regular graphs of odd degree are antimagic. J Graph Theory 80:28–33
Haslegrave J (2018) Proof of a local antimagic conjecture. Discrete Math Theor Comput Sci 20:18
Hartsfield N, Ringle G (1990) Pearls in graph theory. Academic Press, Boston
Hefetz D (2005) Anti-magic graphs via the combinatorial nullstellensatz. J Graph Theory 50:263–272
Hefetz D, Saluz A, Tran H (2010) An application of the combinatorial nullstellensatz to a graph labelling problem. J Graph Theory 65:70–82
Hefetz D, Mütze T, Schwartz J (2010) On antimagic directed graphs. J Graph Theory 64:219–232
Kalkowski M, Karoński M, Pfender F (2010) Vertex-coloring edge-weightings: towards the 1-2-3 conjecture. J Comb Theory Ser B 100:347–349
Karoński M, Łuczak T, Thomason A (2004) Edge weights and vertex colours. J Comb Theory Ser B 91:151–157
Li T, Song Z, Wang G, Yang D, Zhang C (2019) Antimagic orientations of even regular graphs. J Graph Theory 90:46–53
Shan S, Yu X (2017) Antimagic orientation of biregular bipartite graphs. Electron J Comb 24:P4.31
Yilma ZB (2013) Antimagic properties of graphs with large maximum degree. J Graph Theory 72:367–373
Acknowledgements
This work was supported by the National Natural Science Foundation of China (11631014, 11871131) and Shandong University multidisciplinary research and innovation team of young scholars.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Chang, Y., Jing, F. & Wang, G. Local antimagic orientation of graphs. J Comb Optim 39, 1129–1152 (2020). https://doi.org/10.1007/s10878-020-00551-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00551-x