Abstract
Let C(G) denote the number of spanning trees of a graph G. It is shown that there is a function ϵ(k) that tends to zero as k tends to infinity such that for every connected, k‐regular simple graph G on n vertices C(G) = {k[1 − δ(G)]}n. where 0 ≤ δ(G) ≤ ϵ(k).
Original language | English (US) |
---|---|
Pages (from-to) | 175-181 |
Number of pages | 7 |
Journal | Random Structures & Algorithms |
Volume | 1 |
Issue number | 2 |
DOIs | |
State | Published - 1990 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics