Enlarging a connected graph while keeping entropy and spectral radius: self-similarity techniques
Combinatorics
2025-01-24 v1
Abstract
This work is about self-similar sequences of growing connected graphs. We explain how to construct such sequences and why they are important. We show for instance that all the connected graphs in a self-similar sequence have not only the same entropy, but also the same spectral radius.
Cite
@article{arxiv.2501.13701,
title = {Enlarging a connected graph while keeping entropy and spectral radius: self-similarity techniques},
author = {Alberto Seeger and David Sossa},
journal= {arXiv preprint arXiv:2501.13701},
year = {2025}
}