Extremal Q-index problem in outerplanar graphs
Open access0 citations
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 .
// Source
Authors: Jin Cai, Leyou Xu, Bo Zhou
Institutions: Minzu University of China, South China Normal University