The least eigenvalue of the complements of graphs with given connectivity
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916926135992320 |
|---|---|
| author | Qiu, Huan Li, Keng Wang, Guoping |
| author_facet | Qiu, Huan Li, Keng Wang, Guoping |
| contents | The least eigenvalue of a graph $G$ is the least eigenvalue of adjacency matrix of $G$. In this paper we determine the graphs which attain the minimum least eigenvalue among all complements of connected simple graphs with given connectivity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_17143 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | The least eigenvalue of the complements of graphs with given connectivity Qiu, Huan Li, Keng Wang, Guoping Combinatorics 05C40, 05C50 The least eigenvalue of a graph $G$ is the least eigenvalue of adjacency matrix of $G$. In this paper we determine the graphs which attain the minimum least eigenvalue among all complements of connected simple graphs with given connectivity. |
| title | The least eigenvalue of the complements of graphs with given connectivity |
| topic | Combinatorics 05C40, 05C50 |
| url | https://arxiv.org/abs/2305.17143 |