Unified approach to magic labelings of copies of regular graphs
Third paper on VMT labelings.
In the paper we give a general technique for constructing vertex magic total (VMT) labelings of copies of regular VMT graphs and supermagic (SPM) labelings of copies of regular class 1 SPM graphs. As an application we give methods for constructing VMT and SPM labelings of Cartesian products of graphs under certain restrictions. The result supports the conjecture by MacDougall that all regular graphs with the exception of K2 and 2K3 are VMT.