vix.ing · top · new · best · stats · spec

Antimagic orientations of graphs with a dominating clique

2026/07/31 by Abdulrahman Al-Taweel
Mathematics · #math.CO #msc:05C78 #msc:05C20

paper · pdf

6 pages, 1 figure

arxiv created 2026/07/31 · arxiv updated 2026/08/04

Abstract

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.

Citations