gives the n-dimensional De Bruijn graph with m symbols.
gives the De Bruijn graph with connectivity given by type.
- DeBruijnGraph[m,n] has vertices, consisting of all length-n sequences of m symbols. Given two vertices and , there is an edge from v to , provided , , …, .
- DeBruijnGraph[m,n,type] specifies different connectivity types. The following types can be given:
"Noncyclic" , …, "LeftShift" , , …, "RightShift" , …, ,
- DeBruijnGraph[…] is a directed graph.
- DeBruijnGraph takes the same options as Graph.
Introduced in 2010