Abstract
A graph is called edge-magic if it admits a labeling of the vertices and edges by pairwise different integers of such that the sum of the label of an edge and the labels of its endpoints is constant independent of the choice of edge. A construction of edge-magic labelings of some disconnected graphs is described. Some edge-magic forests are characterized.
Citation
Jaroslav Ivančo. Iveta Lučkaničová. "On edge–magic disconnected graphs." SUT J. Math. 38 (2) 175 - 184, June 2002. https://doi.org/10.55937/sut/1057898710
Information