Supermagic generalized double graphs
Jaroslav Ivančo · Discussiones Mathematicae Graph Theory · 2015
A graph G 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 this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs.Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.