Antimagic orientations of disconnected even regular graphs

25 Oct 2018 Song Chen Hao Rong-Xia

A $labeling$ of a digraph $D$ with $m$ arcs is a bijection from the set of arcs of $D$ to $\{1,2,\ldots,m\}$. A labeling of $D$ is $antimagic$ if no two vertices in $D$ have the same vertex-sum, where the vertex-sum of a vertex $u \in V(D)$ for a labeling is the sum of labels of all arcs entering $u$ minus the sum of labels of all arcs leaving $u$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS