Enlarging a connected graph while keeping entropy and spectral radius: self-similarity techniques
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916579963305984 |
|---|---|
| author | Seeger, Alberto Sossa, David |
| author_facet | Seeger, Alberto Sossa, David |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13701 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Enlarging a connected graph while keeping entropy and spectral radius: self-similarity techniques Seeger, Alberto Sossa, David Combinatorics 05C50, 15A42 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. |
| title | Enlarging a connected graph while keeping entropy and spectral radius: self-similarity techniques |
| topic | Combinatorics 05C50, 15A42 |
| url | https://arxiv.org/abs/2501.13701 |