
TL;DR
This paper proves that caterpillars, a subclass of trees, can be oriented to have antimagic labelings, supporting the conjecture that all connected graphs admit such orientations.
Contribution
It provides a constructive proof that caterpillars have antimagic orientations, advancing understanding of antimagic labelings in graph theory.
Findings
Caterpillars have antimagic orientations.
Constructive technique used for proof.
Supports the conjecture for broader classes of graphs.
Abstract
An antimagic labeling of a directed graph with arcs is a bijection from the set of arcs of to such that all oriented vertex sums of vertices in are pairwise distinct, where the oriented vertex sum of a vertex is the sum of labels of all arcs entering minus the sum of labels of all arcs leaving . Hefetz, M\"utze, and Schwartz conjectured that every connected graph admits an antimagic orientation, where an antimagic orientation of a graph is an orientation of which has an antimagic labeling. We use a constructive technique to prove that caterpillars, a well-known subclass of trees, have antimagic orientations.
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.
