Abstract
Outerplanar Turán problem has received considerable attention recently. We study the spectral version via -index. We determine the unique graph that maximizes the -index among all -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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.