Generalized de Bruijn graphs
Matematičeskie zametki, Tome 62 (1997) no. 4, pp. 540-548
Voir la notice de l'article provenant de la source Math-Net.Ru
Oriented graphs in which every pair of vertices can be connected by a unique path of given length (not depending on the choice of the pair of vertices) are studied. These graphs are a natural extension of the well-known de Bruijn graphs and retain their most important properties. Some results on the structure of and methods for constructing such graphs are obtained.
@article{MZM_1997_62_4_a6,
author = {F. M. Malyshev and V. E. Tarakanov},
title = {Generalized de {Bruijn} graphs},
journal = {Matemati\v{c}eskie zametki},
pages = {540--548},
publisher = {mathdoc},
volume = {62},
number = {4},
year = {1997},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1997_62_4_a6/}
}
F. M. Malyshev; V. E. Tarakanov. Generalized de Bruijn graphs. Matematičeskie zametki, Tome 62 (1997) no. 4, pp. 540-548. http://geodesic.mathdoc.fr/item/MZM_1997_62_4_a6/