On magic joins of graphs
Jaroslav Ivančo, Tatiana Polláková · Mathematica Bohemica · 2012
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.