A lemma of Enomoto, Llado, Nakamigawa and Ringel gives an upper bound for the edge number of a super edge-magic graph with \(p > 1\) vertices. In this paper we give some results which come out from answering some natural questions suggested by this useful lemma.
Citation
Zhibo Chen. On Super Edge-Magic Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 038. 55-64. .