Strong edge-magic graphs of maximum size Original Research Article

An edge-magic total labeling on G is a one-to-one map image from image onto the integers image with the property that, given any edge image, image 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 image edges. In this paper we study graphs of this maximum size.