Antimagic labeling for unions of graphs with many three-paths

DOI10.1016/j.disc.2023.113356OpenAlexW4320719390MaRDI QIDQ2699924

Daphne Der-Fen Liu, Mason Shurman, Angel Chavez, Parker Le, Derek Lin

Publication date: 20 April 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph labelingforests2-regular graphsantimagic labelingantimagic graphsjellyfish graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Unnamed Item

Cites Work

• Anti-magic labeling of trees
• Regular graphs are antimagic
• On zero-sum partitions and anti-magic trees
• Caterpillars with maximum degree 3 are antimagic
• Antimagic labelings of caterpillars
• Shifted-antimagic labelings for graphs
• Antimagic labeling of forests with sets of consecutive integers
• Caterpillars are antimagic
• Antimagic labelling of vertex weighted graphs
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Regular bipartite graphs are antimagic
• The Strongly Antimagic labelings of Double Spiders
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Antimagic labeling for unions of graphs with many three-paths