On cospectral graphons
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929599048318976 |
|---|---|
| author | Hladký, Jan Iľkovič, Daniel León, Jared Shu, Xichao |
| author_facet | Hladký, Jan Iľkovič, Daniel León, Jared Shu, Xichao |
| contents | In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectra, by equality of cycle densities, and by a unitary transformation. We also give an example of two cospectral graphons that cannot be approximated by two sequences of cospectral graphs in the cut distance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_13229 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On cospectral graphons Hladký, Jan Iľkovič, Daniel León, Jared Shu, Xichao Combinatorics In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectra, by equality of cycle densities, and by a unitary transformation. We also give an example of two cospectral graphons that cannot be approximated by two sequences of cospectral graphs in the cut distance. |
| title | On cospectral graphons |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.13229 |