Antimagic orientations of graphs with a dominating clique
A graph G with m edges has an antimagic orientation if its edges can be oriented and bijectively labelled 1, ..., m so that the oriented vertex sums, the labels on in-arcs minus the labels on out-arcs, are pairwise distinct. Hefetz, Mütze and Schwartz conjectured that every connected graph admits an antimagic orientation. We prove that this conjecture holds for every graph with a dominating clique.
math.CO↗