On edge–magic disconnected graphs

Jaroslav Ivančo, Iveta Lučkaničová

SUT Journal of Mathematics · 2002 · 21 citations · 5 references

DOIFull text

Open access

Concepts

Abstract

A graph G is called edge-magic if it admits a labeling of the vertices and edges by pairwise different integers of 1,2,...,|V(G)|+|E(G)| 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.

References

5