Caterpillars have antimagic orientations
From MaRDI portal
Publication:5227912
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.
Recommendations
Cited in
(11)- Antimagic labelings of caterpillars
- Antimagic orientation of subdivided caterpillars
- Product antimagic labeling of caterpillars
- Graph antimagic labeling: a survey
- Antimagic orientations of disconnected even regular graphs
- scientific article; zbMATH DE number 6537750 (Why is no real title available?)
- Antimagic orientation of Halin graphs
- Antimagic orientation of forests
- Caterpillars are antimagic
- Antimagic orientation of lobsters
- Caterpillars with maximum degree 3 are antimagic
This page was built for publication: Caterpillars have antimagic orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227912)