For , we call a graph -magic if there exists a labeling such that the induced vertex set labeling , defined by
is a constant map. We denote the set of all such that is -magic by . We call this set the \textbf{\emph{integer-magic spectrum}} of . We investigate these sets for trees, double trees, and abbreviated double trees. We define group-magic spectrum for similarly. Finally, we show that a tree is -magic, , if and only if it is -label reducible.