Some remarks concerning the attractors of iterated function systems

Abstract

The aim of this article is to establish some conditions under which the attractors of iterated function systems become dendrites. We associate to an attractor of an iterated function system a graph and we prove that, for a large class of iterated function systems, their attractors are dendrites if and only if the associated graph is a tree. We also give some examples of such sets.