On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
From MaRDI portal
Publication:1182967
DOI10.1016/0012-365X(91)90024-VzbMath0746.05029MaRDI QIDQ1182967
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (11)
On the number of cycles in generalized Kautz digraphs ⋮ On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\) ⋮ On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ On the number of spanning trees and Eulerian tours in iterated line digraphs ⋮ Projective de Bruijn Sequences ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ Error correcting sequence and projective de Bruijn graph ⋮ Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs
Cites Work
- A Design for Directed Graphs with Minimum Diameter
- Generalized de Bruijn digraphs
- Roots and Canonical Forms for Circulant Matrices
- Design to Minimize Diameter on Building-Block Network
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
