An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(G)∪E(G)| with the property that, given any edge (x,y), λ(x)+λ(x,y)+λ(y)=k for some constant k. The labeling is strong if all the smallest labels are assigned to the vertices. Enomoto et al. proved that a graph admitting a strong labeling can have at most 2|V(G)|-3 edges. In this paper we study graphs of this maximum size.
Discrete Mathematics Vol. 308, Issue 13, p. 2756-2763