Counting spanning trees on fractal graphs and their asymptotic complexity (Q2834772): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3103256708 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1602.01996 / rank | |||
Normal rank | |||
Latest revision as of 08:59, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting spanning trees on fractal graphs and their asymptotic complexity |
scientific article |
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
