de Bruijn diagram

The (m, n)-de Bruijn graph is a non-simple regular directed graph whose nodes are sequences of n copies of m symbols from some alphabet and whose edges consist of pairs of vertices such that shifting the symbols of the first vertex by one place to the left and adding any symbol at the end corresponds to the symbol of the second vertex. For example, the (3, 2)-de Bruijn graph is illustrated above. The above figures show the first few n-dimensional de Bruijn graphs on n copies of m symbols for m, n>=2. The (m, n)-de Bruijn graph is implemented in the Wolfram Language as DeBruijnGraph[m, n].