A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of each graph edge are also distinct (mod n). The ladder graph, fan, wheel graph, Petersen graph, tetrahedral graph, dodecahedral graph, and icosahedral graph are all harmonious.

graceful graph | labeled graph | postage stamp problem | sequential graph