
On Vertex Magic Total LabelingsTalk on Gratko seminar. AbstractA vertexmagic total labeling of a graph G(V,E) is defined as onetoone mapping from V union E to the set of 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 of 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 and certain sregular supermagic graphs with proper edge scoloring. If time permits we compare this technique to other methods based on decomposing G into two regular factors or/and H into two regular factors. Talk given atGratko seminar at University of Minnesota Duluth, (March 24th, 2004).
