Self-similar dendrites with finite boundary and P-sprouts
arXiv:2605.11833
Abstract
Each self-similar dendrite K with a finite self-similar boundary defines a finite acyclic edge-labeled bipartite graph G, called the sprout of K. The paper shows that the sprout G determines the combinatorial properties of the dendrite K and its topological structure.
22 pages, 10 figures