A Hamiltonian graph is a graph with a circuit -- a path starting and ending at the same point -- which visits each node exactly once.
Given an octave-equivalent scale, we can form the q-odd-limit graph of the scale by making the degrees of the scale the nodes, and the concordances of the scale the edges. If the resulting graph is Hamiltonian, we can say the scale is Hamiltonian in the q-limit.
A Hamiltonian scale has a tone row where each succesive element of the row is related via a concordance to the last, including the last to the first again.
The tonalsoft.com website is almost entirely the work of one person: me, Joe Monzo. Please reward me for my knowledge and effort by choosing your preferred level of financial support. Thank you.