de Bruijn diagram

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional de Bruijn graphs on m symbols (m, n) for m, n>=2. The graph (m, n) is implemented in the Wolfram Language as DeBruijnGraph[m, n]. The independence number of the de Bruijn graphs (2, n) for n = 1, 2, ... are given by 1, 2, 3, 7, 13, 28, ... (OEIS A006946).