Elegant Graph

A graph G with m edges is said to be elegant if the vertices of G can be labeled with distinct integers (0,1,2,...,m) in such a way that the set of values on the edges obtained by the sums (mod m+1) of the labels of their end vertices is {1,2,...,m}.

See also

Graceful Graph, Harmonious Graph

This entry contributed by Simone Severini

Explore with Wolfram|Alpha


Chang, G. J.; Hsu, D. F.; and Rogers, D. G. "Additive Variations on a Graceful Theme: Some Results on Harmonious and Other Related Graphs." Congr. Numer. 32, 181-197, 1981.

Referenced on Wolfram|Alpha

Elegant Graph

Cite this as:

Severini, Simone. "Elegant Graph." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein.

Subject classifications