Jaroslav Ivanco, Department of Geometry and Algebra, P. J. Safarik University, 041 54 Kosice, Jesenna 5, Slovakia, e-mail: ivanco@duro.upjs.sk
Abstract: A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized.
Keywords: supermagic graphs, complete multipartite graphs, products of graphs
Classification (MSC 1991): 05C78
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
