文献类型：期刊文献

英文题名：A complete solution to the Cvetkovic-Rowlinson conjecture

作者：Lin, Huiqiu[1];Ning, Bo[2]

机构：[1]East China Univ Sci & Technol, Dept Math, Shanhai, Peoples R China;[2]Nankai Univ, Coll Comp Sci, Tianjin 300071, Peoples R China

年份：2021

卷号：97

期号：3

起止页码：441

外文期刊名：JOURNAL OF GRAPH THEORY

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000624354500001)】；

基金：National Natural Science Foundation of China; NSFC, Grant/Award Numbers: 11771141, 11971346

语种：英文

外文关键词：minor; outerplanar graphs; planar graphs; spectral radius

摘要：In 1990, Cvetkovic and Rowlinson conjectured that among all outerplanar graphs on n vertices, K 1 proves 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.