Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation

Eranda Dhananjaya, Wei-Tian Li

An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E(G)$ and $\{1,2,\dots ,|E(G)|\}$ such that any two ver…