D-Antimagic Labelings of Oriented 2-Regular Graphs
Ahmad Muchlas Abrar, Rinovia Simanjuntak

TL;DR
This paper studies $D$-antimagic labelings in oriented 2-regular graphs, providing characterizations for various cycle types and specific conditions on the distance set $D$.
Contribution
It offers new characterizations of $D$-antimagic labelings for different classes of oriented 2-regular graphs, including cycles and $ heta$-oriented graphs.
Findings
Characterization of $D$-antimagic oriented cycles for $|D|=1$
Characterization of $D$-antimagic unidirectional odd cycles for $|D|=2$
Characterization of $D$-antimagic $ heta$-oriented cycles and 2-regular graphs
Abstract
Given an oriented graph and a distance set of , is -antimagic if there exists a bijective vertex labeling such that the sum of all labels of the -out-neighbors of each vertex is distinct. This paper investigates -antimagic labelings of 2-regular oriented graphs. We characterize -antimagic oriented cycles, when ; -antimagic unidirectional odd cycles, when ; and -antimagic -oriented cycles. Finally, we characterize -antimagic oriented 2-regular graphs, when , and -antimagic -oriented 2-regular graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Blockchain Technology in Education and Learning
