Caterpillars Have Antimagic Orientations
From MaRDI portal
Publication:5227912
DOI10.2478/AUOM-2018-0039zbMATH Open1438.05217arXiv1708.02607OpenAlexW2963281691MaRDI QIDQ5227912FDOQ5227912
Authors: Antoni Lozano
Publication date: 7 August 2019
Published in: Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1708.02607
Recommendations
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (11)
- Antimagic orientation of subdivided caterpillars
- Caterpillars with maximum degree 3 are antimagic
- Antimagic labelings of caterpillars
- Product antimagic labeling of caterpillars
- Antimagic orientation of lobsters
- Caterpillars are antimagic
- Antimagic orientations of disconnected even regular graphs
- Antimagic orientation of Halin graphs
- Antimagic orientation of forests
- Title not available (Why is that?)
- Graph antimagic labeling: a survey
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)