Horofunctions on Sierpiński type triangles

Abstract

We study an infinite set of graphs which are recursively constructed from an infinite word in a finite alphabet. These graphs are inspired by the construction of the Sierpiński gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case.

to appear in Utilitas Mathematica

References in corpus (2)

• Counting dimer coverings on self-similar Schreier graphs
• The Tutte polynomial of the Sierpinski and Hanoi graphs