Manav Das Department of Mathematics University of Louisville Louisville, KY 40292 U.S.A.manav@louisville.edu |
G. A. Edgar Department of Mathematics The Ohio State University Columbus, OH 43210 U.S.A.edgar@math.ohio-state.edu |
(Version of September, 2003)
Examples of "separation properties" for iterated function systems of similitudes include: the open set condition, the weak separation property, finite type. Alternate descriptions for these properties and relations among these properties have been worked out. Here we consider the same situation for "graph-directed" iterated function systems, and provide the definitions and proofs for that setting. We deal with the case of strongly connected graphs. In many cases the definitions (and proofs) are much like the one-node case. But sometimes we have found changes were needed.