| De Bruijn Graph |
Article Index for De Bruijn |
Website Links For Bruijn |
Information AboutDe Bruijn Graph |
| CATEGORIES ABOUT DE BRUIJN GRAPH | |
| graphs | |
| graph families | |
| dynamical systems | |
| automata theory | |
|
DEFINITION In Graph Theory , an -dimensional de Bruijn graph of symbols is a Directed Graph with vertices and the edges defined as below. The vertices consist of all possible way combinations of the symbols. If we have the symbols then the set of vertices is: : If one of the vertices can be expressed by shifting all symbols by one place to the left and adding a new symbol at the end of another vertex, then the latter has a directed edge to the former vertex. Thus the set of (directed) edges is: : Properties
EXAMPLES For simplified notation, let our symbols be the Whole Numbers 1,2,3,etc. Then, following are some examples of de Bruijn graphs. de Bruijn (2,1) : 2 symbols and 1 dimension de Bruijn (2,2) : 2 symbols and 2 dimensions de Bruijn (3,2) : 3 symbols and 2 dimensions |
|
|