On VMT labelings of graphs
Paper about VMT labelings for Ph.D. Workshop of Faculty of Electrical Engineering and Computer Science.
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.
Published in the proceedings of Wofex 2004.
P. Kovář, On VMT Labelings of graphs, Conference proceedings of Wofex 2004, 22.-23. September, V©B - TU Ostrava, (2004), p. 316-321.
phone ++420 / 597 325 972
|Last update: 29.12.2011