TOPICS
Search

Antimagic Graph


An antimagic graph is a finite simple graph with e graph edges labeled bijectively with {1,2,...,e} so that the sums of the graph edge labels at the graph vertices are pairwise distinct.

Hartsfield and Ringel (1990) conjectured that every connected graph other than K_2 is antimagic. Beaudoire et al. (2026) proved the conjecture for every graph join of two finite simple graphs that each have at least one graph vertex, provided the join has at least three vertices.


See also

Antimagic Square, Graph Join, Labeled Graph, Local Antimagic Chromatic Number, Local Antimagic Graph, Local Antimagic Labeling, Magic Graph

Explore with Wolfram|Alpha

References

Beaudoire, G.; Bentz, C.; and Picouleau, C. "Antimagicness of Join Graphs." 28 Sep 2026. https://arxiv.org/abs/2609.35245.Hartsfield, N. and Ringel, G. Pearls in Graph Theory: A Comprehensive Introduction. San Diego, CA: Academic Press, 1990.

Referenced on Wolfram|Alpha

Antimagic Graph

Cite this as:

Weisstein, Eric W. "Antimagic Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/AntimagicGraph.html

Subject classifications