Abstract: An edge-magic
total labeling on a graph with p
vertices and q edges is defined as a one-to-one map taking the vertices and edges
onto the integers with the property that the sum of
the label on an edge and the labels of its endpoints is constant independent of
the choice of edge. Also, a graph G is said to be super edge-magic if The super edge-magic deficiency, of a graph G
is defined to be either the smallest nonnegative integer n
with the property that the graph is super edge-magic or if there exists no such integer n.
In this paper, we study the super edge-magic deficiency of some graphs.
Keywords and phrases: edge-magic total labeling, super edge-magic labeling, super edge-magic deficiency.
