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 Sierpinski gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case
| Original language | English |
|---|---|
| Pages (from-to) | 267–277 |
| Journal | Utilitas Mathematica |
| Volume | 105 |
| Publication status | Published - 2017 |
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Theoretical