Trees whose even-degree vertices induce a path are antimagic

DOI10.7151/dmgt.2322zbMath1492.05140arXiv1905.06595OpenAlexW2950245101MaRDI QIDQ2151224

Joaquín Tey, Antoni Lozano, Carlos Seara, Mercè Mora

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.06595

zbMATH Keywords

treeantimagic labeling

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Antimagic orientation of forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-magic labeling of trees
• On zero-sum partitions and anti-magic trees
• Caterpillars with maximum degree 3 are antimagic
• Antimagic labelings of caterpillars
• Caterpillars are antimagic
• The Strongly Antimagic labelings of Double Spiders

This page was built for publication: Trees whose even-degree vertices induce a path are antimagic