The Inter-magic Spectra of Trees
arXiv:2202.09477
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.
4 figures