Vertex magic total labeling of Cartesian products of certain regular VMT graphs and certain regular supermagic graphs

Talk on the 17th Midwest Conference on Combinatorics Cryptography and Computing.

Abstract

A vertex-magic total labeling of a graph G(V,E) is defined as one-to-one 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 one-to-one 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 r-regular graphs G and certain 2s-regular supermagic graphs H. H has to be decomposable into two s-regular factors and r is either odd or even and |H| is odd.

Talk given at

Talk given at the conference 17th Midwest Conference on Combinatorics Cryptography and Computing, University of Nevada, Las Vegas (2003), 10th-12th November 2003, (11th November 2003).

---

Petr<dot>Kovar<at>vsb<dot>cz phone ++420 / 597 325 972

Last update: 29.12.2011