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 (MSC2000): 05C78
Full text of the article: