Abstract
Dr. James MacDougall (University of Newcastle, Australia), Magic Labelings of Graphs
Let G be a graph with v vertices and e edges, and let L(G) be a labeling of the vertices
and edges of G with the distinct integer labels 1, 2, ..., v+e. We call L(G) a vertex-magic
labeling of G if there is a constant k such that for every vertex x, the sum of the label on
x and the labels on all edges incident with x is equal to k. Similarly, we call L(G) an
edge-magic labeling of G if there is a constant k such that for every edge y, the sum of the
label on y and the labels on the two vertices
incident with y is equal to k. We will discuss some known results and open problems about
such labelings.
Abstract:
Papa Amar Sissokho
Last modified: Monday, Jan 30, 2006