Extremal Q-index problem in outerplanar graphs

Discrete Optimization 2026 Open access

Read full text
Authors: Jin Cai, Leyou Xu, Bo Zhou
DOI: 10.1016/j.disopt.2026.100971
Cited by: 0
References: 26

Abstract

For connected outerplanar graphs on n vertices, we identify the unique graph that attains the maximum Q -index when cycles of a given length are forbidden for n ≥ 5 , and similarly when vertex-disjoint paths of a given length are forbidden for sufficiently large n .

Fields of Study & Subjects

Graph theory and applications Spectral Theory in Mathematical Physics Limits and Structures in Graph Theory

Publication details

Journal / source
Discrete Optimization
Volume
62
Pages
100971–100971
Publication date
18 September 2026
Language
EN