# Wolfram Language & System 11.0 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.
BUILT-IN WOLFRAM LANGUAGE SYMBOL

# DeBruijnGraph

DeBruijnGraph[m,n]
gives the n-dimensional De Bruijn graph with m symbols.

DeBruijnGraph[m,n,type]
gives the De Bruijn graph with connectivity given by type.

## Details and OptionsDetails and Options

• DeBruijnGraph[m,n] has mn vertices, consisting of all length-n sequences of m symbols. Given two vertices v={s1,,sn} and ={t1,,tn}, there is an edge from v to , provided s2==t1, s3==t2, , sn==tn-1.
• DeBruijnGraph[m,n,type] specifies different connectivity types. The following types can be given:
•  "Noncyclic" , …, "LeftShift" , s2t1, …, sn "RightShift" , …, ,
• is a directed graph.
• DeBruijnGraph takes the same options as Graph.

## ExamplesExamplesopen allclose all

### Basic Examples  (3)Basic Examples  (3)

The first few De Bruijn graphs with two symbols and different dimensions:

 In[1]:=
 Out[1]=

De Bruijn graphs with different numbers of symbols in dimension two:

 In[1]:=
 Out[1]=

De Bruijn graphs with different connectivity types:

 In[1]:=
 Out[1]=