The following pages link to Algorithms and Computation (Q5712140):
Displayed 4 items.
- Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori (Q893895) (← links)
- The asymptotic number of spanning trees in circulant graphs (Q965958) (← links)
- An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019) (← links)
- The number of spanning trees in a class of double fixed-step loop networks (Q3528151) (← links)