Introduction to Magic Labelings of Graphs II
Talk on the DiMaS seminar.
Magic type labeling are an analogue to magic squares well known from recreational mathematics.
First we introduce various magic type graph labelings:
In the beginning we review the definitions and some examples.
This talk should introduce the notion of magic rectangles and especially Kotzig arrays.
These arrays are used to construct magic type labelings of regular graphs, copies of regular graphs or products of regular graphs.
- a vertex magic total (VMT) labeling of a graph G(V,E),
- an (s,d)-vertex antimagic total (VAMT) labeling,
- a supermagic (SPM) labeling (also known as vertex magic edge labeling).
In the talk we present recent results post some research problems realted to the MacDougall's conjecture that any regular graph with the exception of K2 and 2K3 has a VMT labeling.
Talk given at
Talk given at the DiMaS seminar, V©B - TU Ostrava, 20th May 2005.
phone ++420 / 597 325 972
|Last update: 29.12.2011