A complete solution to the Cvetković–Rowlinson conjecture

In 1990, Cvetković and Rowlinson conjectured that among all outerplanar graphs on n vertices, K 1 ∨ P n − 1 attains the maximum spectral radius. In 2017, Tait and Tobin confirmed the conjecture for sufficientlty large values of n. In this article, we show the conjecture is true for all n ≥ 2 except...

Full description

Saved in:
Bibliographic Details
Published inJournal of graph theory Vol. 97; no. 3; pp. 441 - 450
Main Authors Lin, Huiqiu, Ning, Bo
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc 01.07.2021
Subjects
Apexes
minor
outerplanar graphs
planar graphs
spectral radius
Online AccessGet full text

Cover

More Information
Summary:In 1990, Cvetković and Rowlinson conjectured that among all outerplanar graphs on n vertices, K 1 ∨ P n − 1 attains the maximum spectral radius. In 2017, Tait and Tobin confirmed the conjecture for sufficientlty large values of n. In this article, we show the conjecture is true for all n ≥ 2 except for n = 6.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.22667