TOPICS
Search

Edge-Magic Total Labeling


An edge-magic total labeling of a graph G=(V,E) is a bijection

 f:V union E->{1,2,...,|V|+|E|}

for which there is a constant k such that

 f(u)+f(uv)+f(v)=k

for every graph edge uv. Thus the edge weights are constant even though both graph vertices and graph edges receive labels.

An edge-magic total labeling is distinct from a vertex-magic edge labeling, in which only the graph edges are labeled and the sums at the graph vertices are constant.


See also

Magic Graph, Magic Labeling, Vertex-Magic Edge Labeling

Explore with Wolfram|Alpha

References

Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin., Dynamic Survey DS6, Oct. 30, 2025. https://doi.org/10.37236/27.

Cite this as:

Weisstein, Eric W. "Edge-Magic Total Labeling." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Edge-MagicTotalLabeling.html

Subject classifications