An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5701983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient approach for counting the number of spanning trees in circulant and related graphs |
scientific article; zbMATH DE number 5701983 |
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
0.9077326059341432
0 references
0.8899058699607849
0 references
0.8826330900192261
0 references
0.8670738935470581
0 references
0.8659180998802185
0 references
