A structure theory for regular graphs with fixed smallest eigenvalue
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_ | 1866916097962278912 |
|---|---|
| author | Yang, Qianqian Koolen, Jack H. |
| author_facet | Yang, Qianqian Koolen, Jack H. |
| contents | In this paper we will give a structure theory for regular graphs with fixed smallest eigenvalue. As a consequence of this theory, we show that a $k$-regular graph with smallest eigenvalue $-λ$ has clique number linear in $k$ if $k$ is large with respect to $λ$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_10468 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A structure theory for regular graphs with fixed smallest eigenvalue Yang, Qianqian Koolen, Jack H. Combinatorics 05C50, 05C75 In this paper we will give a structure theory for regular graphs with fixed smallest eigenvalue. As a consequence of this theory, we show that a $k$-regular graph with smallest eigenvalue $-λ$ has clique number linear in $k$ if $k$ is large with respect to $λ$. |
| title | A structure theory for regular graphs with fixed smallest eigenvalue |
| topic | Combinatorics 05C50, 05C75 |
| url | https://arxiv.org/abs/2401.10468 |