Lower bound of the asymptotic complexity of self-similar fractal graphs
classification
🧮 math.CO
math.SP
keywords
asymptoticcomplexityboundconstantfractalgraphslowerself-similar
read the original abstract
We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal $K$. We show how full symmetry implies existence of the asymptotic complexity constant and obtain a sharp lower bound thereby answering two conjectures by Anema.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.