Extremal $Q$-index problem in outerplanar graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911352674582528 |
|---|---|
| author | Cai, Jin Xu, Leyou Zhou, Bo |
| author_facet | Cai, Jin Xu, Leyou Zhou, Bo |
| contents | Outerplanar Turán problem has received considerable attention recently. We study the spectral version via $Q$-index. We determine the unique graph that maximizes the $Q$-index among all $n$-vertex connected outerplanar graphs which are respectively forbidden to contain: (i) a fixed cycle; and (ii) the disjoint union of paths of a given order. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_01164 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Extremal $Q$-index problem in outerplanar graphs Cai, Jin Xu, Leyou Zhou, Bo Combinatorics Outerplanar Turán problem has received considerable attention recently. We study the spectral version via $Q$-index. We determine the unique graph that maximizes the $Q$-index among all $n$-vertex connected outerplanar graphs which are respectively forbidden to contain: (i) a fixed cycle; and (ii) the disjoint union of paths of a given order. |
| title | Extremal $Q$-index problem in outerplanar graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2601.01164 |