Name
Abstract | ||
|---|---|---|
We compute the complexity of two infinite families of finite graphs: the Sierpinski graphs, which are finite approximations of the well-known Sierpinski 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.37236/503 | ELECTRONIC JOURNAL OF COMBINATORICS |
Keywords | Field | DocType |
schreier graph. 1,self-similar group,generating function,self-similar graph,weight function,. spanning tree,group theory,spanning tree | Generating function,Discrete mathematics,Combinatorics,Skew,Young tableau,Periodic graph (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
18.0 | 1.0 | 1077-8926 |
Citations | PageRank | References |
5 | 0.48 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniele D'Angeli | 1 | 29 | 7.01 |
| Alfredo Donno | 2 | 27 | 8.03 |