The Inter-magic Spectra of Trees
Alvaro Carbonero, Dylan Obata

TL;DR
This paper determines the integer-magic spectra of trees with diameter six or more, extending previous results limited to trees of smaller diameter, and explores the labeling properties related to graph theory.
Contribution
It introduces the complete characterization of the integer-magic spectra for trees of diameter six and higher, advancing the understanding of graph labelings.
Findings
Complete spectra for trees of diameter six and higher are established.
Extends previous results limited to trees of diameter at most five.
Provides new insights into graph labelings and their properties.
Abstract
For any positive integer , a graph is said to be -magic if there exists a labeling such that the induced vertex set labeling defined by is a constant map. The integer-magic spectrum of a graph , denoted by , is the set of all for which is -magic. So far, only the integer-magic spectra of trees of diameter at most five have been determined. In this paper, we determine the integer-magic spectra of trees of diameter six and higher.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
