Weighted spanning trees on some self-similar graphs

zbMATH Open1229.05014arXiv1007.0021MaRDI QIDQ625378FDOQ625378

Authors: Daniele D'Angeli, Alfredo Donno 

Publication date: 17 February 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We compute the complexity of two infinite families of finite graphs: the Sierpi'{n}ski graphs, which are finite approximations of the well-known Sierpi'nsky 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.

Full work available at URL: https://arxiv.org/abs/1007.0021

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Spanning trees of finite Sierpiński graphs
• The number of spanning trees in self-similar graphs
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• Counting dimer coverings on self-similar Schreier graphs
• Spanning trees on the Sierpinski gasket

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Signed and weighted graphs (05C22) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Groups acting on trees (20E08)

Cited In (12)

• The critical group of a clique-inserted graph
• Schreier spectrum of the Hanoi Towers group on three pegs
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• A survey and classification of Sierpiński-type graphs
• Complexity of the circulant foliation over a graph
• Spanning trees of finite Sierpiński graphs
• Counting dimer coverings on self-similar Schreier graphs
• Enumeration of spanning trees on Apollonian networks
• Tutte polynomial of the Apollonian network
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• Enumeration of spanning trees in the sequence of Dürer graphs
• Counting spanning trees in prism and anti-prism graphs

This page was built for publication: Weighted spanning trees on some self-similar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625378)