Maxima of the $Q$-index of 2 leaves-free graphs with given size
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915024616816640 |
|---|---|
| author | Liu, Yuxiang Wang, Ligong Jia, Xiaolong |
| author_facet | Liu, Yuxiang Wang, Ligong Jia, Xiaolong |
| contents | The $Q$-index of graph $G$ is the largest eigenvalue of the signless Laplacian matrix of $G$. Wang [Discrete Appl. Math. 356(2024)] proved the sharp upper bounds on the $Q$-index of leaf-free graphs with given size and characterized the corresponding extremal graphs. A graph is $2$ leaves-free if it has no two pendent vertices. In this paper, we give sharp upper bounds on the $Q$-index of 2 leaves-free graphs with given size and characterize the corresponding extremal graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_11557 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Maxima of the $Q$-index of 2 leaves-free graphs with given size Liu, Yuxiang Wang, Ligong Jia, Xiaolong Combinatorics The $Q$-index of graph $G$ is the largest eigenvalue of the signless Laplacian matrix of $G$. Wang [Discrete Appl. Math. 356(2024)] proved the sharp upper bounds on the $Q$-index of leaf-free graphs with given size and characterized the corresponding extremal graphs. A graph is $2$ leaves-free if it has no two pendent vertices. In this paper, we give sharp upper bounds on the $Q$-index of 2 leaves-free graphs with given size and characterize the corresponding extremal graphs. |
| title | Maxima of the $Q$-index of 2 leaves-free graphs with given size |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.11557 |