Weighted Spanning Trees on some Self-Similar Graphs
Weighted Spanning Trees on some Self-Similar Graphs
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 âŠ