|
On the existence of regular supermagic graphsThe full paper by Andra Semaničová, Jaroslav Ivančo and me. AbstractA graph is called supermagic if it admits a labeling of its 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 this paper we prove that the necessary conditions for an r-regular supermagic graph of order n to exist are also sufficient. All proofs are constructive and they are based on finding supermagic labelings of circulant graphs. Status
Submitted (JCMCC).
|