Article
Licensed
Unlicensed
Requires Authentication
A simple upper bound for the number of spanning trees of regular graphs
Published/Copyright:
September 30, 2008
Abstract
We obtain an upper bound for the number of spanning trees of regular graphs of degree k which is in a sense asymptotically exact as k → ∞.
Received: 2008-06-10
Published Online: 2008-09-30
Published in Print: 2008-October
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
