2010/06/30 by Alfredo Donno, Donatella Iacono · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Graph theory and applications #Mathematical Dynamics and Fractals #math.CO #msc:05C15 #msc:05C30 #msc:05C31 #msc:05C38 #msc:20E08
paper · pdf · doi:10.1515/advgeom-2013-0017
published as Advances in Geometry, Vol. 13 (2013), Issue 4, 663-694 · 30 pages; title changed; revised exposition in the second version but results unchanged. arXiv admin note: substantial text overlap with arXiv:1010.2902
arxiv created 2012/06/17 · openalex publication_date 2013/10/01 · arxiv updated 2013/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Abstract We study the Tutte polynomial of two infinite families of finite graphs: the Sierpi´nski graphs, which are finite approximations of the well-known Sierpi´nski gasket, and the Schreier graphs of the Hanoi Towers group H (3) 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.