|
This article is cited in 12 scientific papers (total in 12 papers)
Generalized de Bruijn graphs
F. M. Malyshev, V. E. Tarakanov Steklov Mathematical Institute, Russian Academy of Sciences
Abstract:
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.
Received: 07.02.1997
Citation:
F. M. Malyshev, V. E. Tarakanov, “Generalized de Bruijn graphs”, Mat. Zametki, 62:4 (1997), 540–548; Math. Notes, 62:4 (1997), 449–456
Linking options:
https://www.mathnet.ru/eng/mzm1637https://doi.org/10.4213/mzm1637 https://www.mathnet.ru/eng/mzm/v62/i4/p540
|
Statistics & downloads: |
Abstract page: | 672 | Full-text PDF : | 429 | References: | 63 | First page: | 3 |
|