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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Hall, Jr.,Combinatorial Theory, Toronto (1967).
I. J. Good, “Normal recurring decimals,”J. London Math. Soc.,21, 167–169 (1946).
H. Fredricksen, “A survey of full length nonlinear shift register cycle algorithms,”SIAM Rev.,24, No. 2, 195–221 (1982).
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.
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).
F. Harary,Graph Theory, Addison-Wesley, Reading (USA) (1973).
C. M. Allow and J. L. Brenner, “Roots and canonical forms for circulant matrices,”Trans. Amer. Math. Soc.,107, 60–76 (1963).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 62, No. 4, pp. 540–548, October, 1997.
Translated by O. V. Sipacheva
Rights and permissions
About this article
Cite this article
Malyshev, F.M., Tarakanov, V.E. Generalized de Bruijn graphs. Math Notes 62, 449–456 (1997). https://doi.org/10.1007/BF02358978
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02358978