An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient approach for counting the number of spanning trees in circulant and related graphs |
scientific article |
Statements
An efficient approach for counting the number of spanning trees in circulant and related graphs (English)
0 references
27 April 2010
0 references
circulant graphs
0 references
counting the number of spanning trees
0 references
recurrence relations
0 references
0 references
