1. On magic joins of graphs
- Creator:
- Ivančo, Jaroslav and Polláková, Tatiana
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- magic graph, supermagic graph, and join of graphs
- Language:
- English
- Description:
- A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and 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 characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public