Numbers of edges in supermagic graphs
Svetlana Drajnová, Jaroslav Ivančo, Andrea Semaničová–Feňovčíková · Journal of Graph Theory · 2005
Abstract A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we establish some bounds for the number of edges in supermagic graphs. © 2005 Wiley Periodicals, Inc. J Graph Theory 52: 15–26, 2006