For any , 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. For a given graph , the set of all for which is -magic is called the integer-magic spectrum of and is denoted by . The concept of integer-magic spectrum of a graph was first introduced in [4]. But unfortunately, this paper has a number of incorrect statements and theorems. In this paper, first we will correct some of those statements, then we will determine the integer-magic spectra of caterpillars.