Extremal Q-index problem in outerplanar graphs
Abstract
Outerplanar Tur\'an 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.