Weighted spanning trees on some self-similar graphs

From MaRDI portal
Publication:625378

zbMATH Open1229.05014arXiv1007.0021MaRDI QIDQ625378FDOQ625378

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




Cited In (8)





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)