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}.

graceful graph | harmonious graph