1. On supermagic regular graphs
- Creator:
- Ivančo, Jaroslav
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- supermagic graphs, complete multipartite graphs, and products of graphs
- Language:
- English
- Description:
- 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.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public