Counting closed walks in generalized de Bruijn graphs
References (7)
- et al.
De Bruijn and Kautz networks: A competitor for the hypercube?
A combinatorial problem
Proc. Kon. Nederl. Akad. Wetensch. Ser. A
(1946)- et al.
Generalized de Bruijn digraphs
Networks
(1988)
There are more references available in the full text version of this article.
Cited by (10)
Constructing the minimum dominating sets of generalized de Bruijn digraphs
2015, Discrete MathematicsCitation Excerpt :studied the Hamiltonian property of generalized de Bruijn and Kautz networks. Also, several structural objects such as spanning trees, Eulerian tours [19], closed walks [25] and small cycles [11] have been counted. Shan et al. [22–24]
The k-tuple twin domination in generalized de Bruijn and Kautz networks
2012, Computers and Mathematics with ApplicationsOn the k-tuple domination of generalized de Brujin and Kautz digraphs
2010, Information SciencesThe twin domination number in generalized de Bruijn digraphs
2009, Information Processing LettersOn the number of cycles in generalized Kautz digraphs
2004, Discrete MathematicsNew bounds on the decycling number of generalized de Bruijn digraphs
2017, Discrete Mathematics, Algorithms and Applications
Copyright © 1994 Published by Elsevier B.V.