On VMT labelings of graphs
Talk on the Wofex 2004 seminar.
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.
Talk given at
Talk given at the seminar Wofex 2004, 22.-23. August 2004, V©B - TU Ostrava, (September 23rd, 2004).
phone ++420 / 597 325 972
|Last update: 29.12.2011