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 (IFS) some graphs and we prove that for a large class of IFSs their attractors are dendrites if the associated graphs are trees. We also give some examples of such sets.
