N. Alon, The number of spanning trees in regular graphs, Random Structures and Algorithms, vol.95, issue.2, pp.175-181, 1990.
DOI : 10.1002/rsa.3240010204

B. Bollobás, Modern graph theory, Graduate Texts in Mathematics, vol.184, 1998.
DOI : 10.1007/978-1-4612-0619-4

D. M. Bressoud, Proofs and confirmations. MAA Spectrum, 1999.
DOI : 10.1017/cbo9780511613449

R. Burton and R. Pemantle, Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances, The Annals of Probability, vol.21, issue.3, pp.1329-1371, 1993.
DOI : 10.1214/aop/1176989121

S. Chaiken, A Combinatorial Proof of the All Minors Matrix Tree Theorem, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.3, pp.319-329, 1982.
DOI : 10.1137/0603033

S. Chaiken and D. J. Kleitman, Matrix Tree Theorems, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.377-381, 1978.
DOI : 10.1016/0097-3165(78)90067-5

S. Chang, L. Chen, and W. Yang, Spanning Trees on the Sierpinski Gasket, Journal of Statistical Physics, vol.36, issue.3, pp.649-667, 2007.
DOI : 10.1007/s10955-006-9262-0

URL : https://hal.archives-ouvertes.fr/hal-00993549

P. Chebotarev, Spanning forests and the golden ratio, Discrete Applied Mathematics, vol.156, issue.5, pp.813-821, 2008.
DOI : 10.1016/j.dam.2007.08.030

P. G. Doyle and J. L. Snell, Random walks and electric networks, Carus Mathematical Monographs. Mathematical Association of America, vol.22, 1984.
DOI : 10.5948/UPO9781614440222

G. R. Kirchhoff, ¨ Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem, vol.72, issue.4, pp.497-508, 1847.

B. Leclerc, On Identities Satisfied by Minors of a Matrix, Advances in Mathematics, vol.100, issue.1, pp.101-132, 1993.
DOI : 10.1006/aima.1993.1030

R. P. Lewis, The number of spanning trees of a complete multipartite graph. Discrete Math, 16th British Combinatorial Conference, pp.537-541, 1997.

R. Lyons, Asymptotic Enumeration of Spanning Trees, Combinatorics, Probability and Computing, vol.14, issue.4, pp.491-522, 2005.
DOI : 10.1017/S096354830500684X

R. Lyons and Y. Peres, Probability on trees and networks, 2009.
DOI : 10.1017/9781316672815

J. W. Moon, Some determinant expansions and the matrix-tree theorem, Discrete Mathematics, vol.124, issue.1-3, pp.163-171, 1990.
DOI : 10.1016/0012-365X(92)00059-Z

E. Teufl and S. Wagner, The number of spanning trees of finite sierpinski graphs, Fourth Colloquium on Mathematics and Computer Science, volume AG of DMTCS Proceedings, pp.411-414, 2006.

E. Teufl and S. Wagner, The number of spanning trees in self-similar graphs. preprint, 2008.