Back to Search
Start Over
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- Source :
- Discrete Mathematics. 94:189-197
- Publication Year :
- 1991
- Publisher :
- Elsevier BV, 1991.
-
Abstract
- In this paper, we give the spectra and characteristic polynomials of generalized de Bruijn graphs. By Tutte's Theorem we can obtain the number of spanning trees and the number of Eulerian tours in such graphs.
- Subjects :
- De Bruijn sequence
Discrete mathematics
Mathematics::Combinatorics
Spanning tree
Eulerian path
Theoretical Computer Science
Combinatorics
symbols.namesake
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
symbols
Discrete Mathematics and Combinatorics
BEST theorem
MathematicsofComputing_DISCRETEMATHEMATICS
Mathematics
Subjects
Details
- ISSN :
- 0012365X
- Volume :
- 94
- Database :
- OpenAIRE
- Journal :
- Discrete Mathematics
- Accession number :
- edsair.doi.dedup.....d26afc2d2c6859f666f2375084e57da1
- Full Text :
- https://doi.org/10.1016/0012-365x(91)90024-v