This paper studies the geometric structure of graph-directed sets from the point of view of Lipschitz equivalence. It is proved that if and are dust-like graph-directed sets satisfying the transitivity condition, then and are Lipschitz equivalent, and and are quasi-Lipschitz equivalent when they have the same Hausdorff dimension.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-sm194-2-6, author = {Ying Xiong and Lifeng Xi}, title = {Lipschitz equivalence of graph-directed fractals}, journal = {Studia Mathematica}, volume = {192}, year = {2009}, pages = {197-205}, zbl = {1178.28020}, language = {en}, url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm194-2-6} }
Ying Xiong; Lifeng Xi. Lipschitz equivalence of graph-directed fractals. Studia Mathematica, Tome 192 (2009) pp. 197-205. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm194-2-6/