Existence of regular supermagic graphs

A paper by Andra Semaničová, Jaroslav Ivančo and me.

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 this paper we deal with the existence of r-regular supermagic graph of order n. Some constructions of supermagic labeling of regular graphs are described.

Status

??

Petr<dot>Kovar<at>vsb<dot>cz phone ++420 / 597 325 972

Last update: 29.12.2011