Counting spanning trees on fractal graphs and their asymptotic complexity (Q2834772)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting spanning trees on fractal graphs and their asymptotic complexity |
scientific article; zbMATH DE number 6655744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting spanning trees on fractal graphs and their asymptotic complexity |
scientific article; zbMATH DE number 6655744 |
Statements
Counting spanning trees on fractal graphs and their asymptotic complexity (English)
0 references
24 November 2016
0 references
fractal graphs
0 references
spanning trees
0 references
spectral decimation
0 references
asymptotic complexity
0 references
0.8573735356330872
0 references
0.8092322945594788
0 references
0.8075882196426392
0 references
0.7938918471336365
0 references
