Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
