Weighted spanning trees on some self-similar graphs (Q625378): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1007.0021 / rank | |||
Normal rank | |||
Latest revision as of 15:27, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weighted spanning trees on some self-similar graphs |
scientific article |
Statements
Weighted spanning trees on some self-similar graphs (English)
0 references
17 February 2011
0 references
Summary: We compute the complexity of two infinite families of finite graphs: the Sierpiński graphs, which are finite approximations of the well-known Sierpiński gasket, and the Schreier graphs of the Hanoi Towers group \(H^{(3)}\) acting on the rooted ternary tree. For both of them, we study the weighted generating functions of the spanning trees, associated with several natural labellings of the edge sets.
0 references
