
Vertex magic total labeling of Cartesian products of certain regular VMT graphs and certain regular supermagic graphsTalk on the 17th Midwest Conference on Combinatorics Cryptography and Computing. AbstractA vertexmagic total labeling of a graph G(V,E) is defined as onetoone mapping from V ∪ E to the set integers {1, 2, ..., V+E} with the property that the sum of the label of a vertex and the labels of all edges incident to this vertex is the same constant for all vertices of the graph. A supermagic labeling of a graph G(V,E) is defined as onetoone mapping from E to the set integers {1, 2,..., E} with the property that the sum of the labels of all edges incident to a vertex is the same constant for all vertices of the graph. In the talk we present a technique for constructing vertex magic total labelings of Cartesian products of certain vertex magic total rregular graphs G and certain 2sregular supermagic graphs H. H has to be decomposable into two sregular factors and r is either odd or even and H is odd. Talk given atTalk given at the conference 17th Midwest Conference on Combinatorics Cryptography and Computing, University of Nevada, Las Vegas (2003), 10th12th November 2003, (11th November 2003).
