A graph 
with 
edges is said to be elegant if the vertices of 
can be labeled with distinct integers 
in such a way that the set of values on the edges
obtained by the sums (mod 
)
of the labels of their end vertices is 
.
Elegant Graph
See also
Graceful Graph, Harmonious GraphThis entry contributed by Simone Severini
Explore with Wolfram|Alpha
References
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 GraphCite this as:
Severini, Simone. "Elegant Graph." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/ElegantGraph.html