Enlarging a connected graph while keeping entropy and spectral radius: self-similarity techniques
Year: 2025
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Seeger, Alberto, Sossa, David
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4406793416