Geodesic
Weighted spanning trees on some self-similar graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 the spanning trees, associated with several natural labellings of the edge sets.
DOI : 10.37236/503
Classification : 05A15, 05C22, 20E08, 05C25, 05C05 
@article{10_37236_503,
     author = {Daniele D'Angeli and Alfredo Donno},
     title = {Weighted spanning trees on some self-similar graphs},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/503},
     zbl = {1229.05014},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/503/}
}
TY  - JOUR
AU  - Daniele D'Angeli
AU  - Alfredo Donno
TI  - Weighted spanning trees on some self-similar graphs
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/503/
DO  - 10.37236/503
ID  - 10_37236_503
ER  - 
%0 Journal Article
%A Daniele D'Angeli
%A Alfredo Donno
%T Weighted spanning trees on some self-similar graphs
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/503/
%R 10.37236/503
%F 10_37236_503
Daniele D'Angeli; Alfredo Donno. Weighted spanning trees on some self-similar graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/503

Cité par Sources :