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
| Originalsprache | englisch |
|---|---|
| Seiten (von - bis) | 267–277 |
| Fachzeitschrift | Utilitas Mathematica |
| Jahrgang | 105 |
| Publikationsstatus | Veröffentlicht - 2017 |
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Theoretical