A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0, 1, 2, ..., e - 1} such that when graph edge i j is labeled f_i + f_j, the set of graph edge labels is a block of e consecutive integers. No harmonious graph is known which cannot also be labeled sequentially.

connected graph | harmonious graph