Elsevier

Information Processing Letters

Volume 49, Issue 3, 11 February 1994, Pages 135-138
Information Processing Letters

Counting closed walks in generalized de Bruijn graphs

https://doi.org/10.1016/0020-0190(94)90090-6Get rights and content

First page preview

First page preview
Click to open first page preview

References (7)

  • J-C. Bermond et al.

    De Bruijn and Kautz networks: A competitor for the hypercube?

  • N.G. de Bruijn

    A combinatorial problem

    Proc. Kon. Nederl. Akad. Wetensch. Ser. A

    (1946)
  • D.Z. Du 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 Mathematics
    Citation 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 Applications
  • New bounds on the decycling number of generalized de Bruijn digraphs

    2017, Discrete Mathematics, Algorithms and Applications
View all citing articles on Scopus
View full text