D-Antimagic Labelings of Oriented 2-Regular Graphs

Abstract

Given an oriented graph $\overrightarrow{G}$ and $D$ a distance set of $\overrightarrow{G}$, $\overrightarrow{G}$ is $D$-antimagic if there exists a bijective vertex labeling such that the sum of all labels of the $D$-out-neighbors of each vertex is distinct. This paper investigates $D$-antimagic labelings of 2-regular oriented graphs. We characterize $D$-antimagic oriented cycles, when $|D|=1$; $D$-antimagic unidirectional odd cycles, when $|D|=2$; and $D$-antimagic $\hat{I}˜$-oriented cycles. Finally, we characterize $D$-antimagic oriented 2-regular graphs, when $|D|=1$, and $D$-antimagic $\hat{I}˜$-oriented 2-regular graphs.

20 pages, 8 figures