The number of spanning trees of finite Sierpi´ nski graphs

The proof proceeds in two steps: First, we show that the number of spanning trees and two further quantities satisfy a 3-dimensional polynomial recursion using the self-similar structure. Secondly, it turns out, that the dynamical behavior of the recursion is given by a 2-dimensional polynomial map, whose iterates can be computed explicitly.