Weighted spanning trees on some self-similar graphs (Q625378)
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: Weighted spanning trees on some self-similar graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8363602161407471
0 references
0.8172732591629028
0 references
0.8107895851135254
0 references
0.7958824038505554
0 references
0.7795969843864441
0 references
