scientific article; zbMATH DE number 7800557

zbMath1529.05138arXiv2307.16836MaRDI QIDQ6190501

No author found.

Publication date: 6 February 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treesrooted treesforestsantimagic labelingantimagic graphs

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• 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 labeling of forests with sets of consecutive integers
• Antimagic labeling for unions of graphs with many three-paths
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Regular bipartite graphs are antimagic
• Magic and Antimagic Graphs

This page was built for publication: