The Tutte polynomial of the Sierpinski and Hanoi graphs
Combinatorics
2013-10-08 v2
Abstract
We study the Tutte polynomial of two infinite families of finite graphs: the Sierpi\'{n}ski graphs, which are finite approximations of the well-known Sierpi\'{n}ski gasket, and the Schreier graphs of the Hanoi Towers group acting on the rooted ternary tree. For both of them, we recursively describe the Tutte polynomial and we compute several special evaluations of it, giving interesting results about the combinatorial structure of these graphs.
Keywords
Cite
@article{arxiv.1006.5333,
title = {The Tutte polynomial of the Sierpinski and Hanoi graphs},
author = {Alfredo Donno and Donatella Iacono},
journal= {arXiv preprint arXiv:1006.5333},
year = {2013}
}
Comments
30 pages; title changed; revised exposition in the second version but results unchanged. arXiv admin note: substantial text overlap with arXiv:1010.2902