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.
Key Wordsoriented graphs de Bruijn graphs adjacency matrix simple graphs
Unable to display preview. Download preview PDF.
- 1.M. Hall, Jr.,Combinatorial Theory, Toronto (1967).Google Scholar
- 4.M. I. Kratko and V. V. Strok, “De Bruijn Sequences With Constraints,” in:Questions of Cybernetics: Combinatorial Analysis and Graph Theory [in Russian], Nauka, Moscow (1980), pp. 80–84.Google Scholar
- 5.I. V. Shirisheva (I. V. Sherisheva), “On the number of finite automata stabilized by a constant input in a fixed state,”Diskret. Mat. [Discrete Math. Appl.],6, No. 4, 80–86 (1994).Google Scholar
- 6.F. Harary,Graph Theory, Addison-Wesley, Reading (USA) (1973).Google Scholar
- 7.C. M. Allow and J. L. Brenner, “Roots and canonical forms for circulant matrices,”Trans. Amer. Math. Soc.,107, 60–76 (1963).Google Scholar