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. The magic strength of G, denoted by is defined as the minimum of all where the minimum is taken over all
edge-magic total labelings of G. The maximum magic strength of G, denoted by is defined as the maximum of all where the maximum is taken over all
edge-magic total labelings of G. A graph G is called
weak magic if In this paper, we study some classes
of weak magic graphs.
Keywords and phrases: edge-magic total labeling, weak magic graph.
