On the minimum number of distinct eigenvalues of triangle-free strongly regular graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929702423232512 |
|---|---|
| author | Egolf, Emily Furst, Veronika |
| author_facet | Egolf, Emily Furst, Veronika |
| contents | Among the seven known (non-degenerate) triangle-free strongly regular graphs, we prove that the Clebsch graph describes a matrix with exactly two distinct eigenvalues while five of the graphs do not. In showing that the minimum number of distinct eigenvalues of the Sims-Gewirtz graph is three, we answer a recently stated open question. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_05031 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the minimum number of distinct eigenvalues of triangle-free strongly regular graphs Egolf, Emily Furst, Veronika Combinatorics 05C50, 05E30 (Primary), 05C22, 15A18 (Secondary) Among the seven known (non-degenerate) triangle-free strongly regular graphs, we prove that the Clebsch graph describes a matrix with exactly two distinct eigenvalues while five of the graphs do not. In showing that the minimum number of distinct eigenvalues of the Sims-Gewirtz graph is three, we answer a recently stated open question. |
| title | On the minimum number of distinct eigenvalues of triangle-free strongly regular graphs |
| topic | Combinatorics 05C50, 05E30 (Primary), 05C22, 15A18 (Secondary) |
| url | https://arxiv.org/abs/2502.05031 |