文献类型：期刊文献

英文题名：A Complete Solution to the Cvetkovi?-Rowlinson Conjecture

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

机构：[1] Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China; [2] College of Computer Science, Nankai University, Tianjin, 300071, China

年份：2019

外文期刊名：arXiv

收录：EI(收录号：20200195643)

语种：英文

外文关键词：Graph theory - Graphic methods - Machine learning - Matrix algebra

摘要：In 1990, Cvetkovi? and Rowlinson [The largest eigenvalue of a graph: a survey, Linear Multilinear Algebra 28(1-2) (1990), 3–33] conjectured that among all outerplanar graphs on n vertices, K1 ∨ Pn?1 attains the maximum spectral radius. In 2017, Tait and Tobin [Three conjectures in extremal spectral graph theory, J. Combin. Theory, Ser. B 126 (2017) 137-161] confirmed the conjecture for sufficiently large values of n. In this article, we show the conjecture is true for all n ≥ 2 except for n = 6.MSC Codes 05C50 Copyright ? 2019, The Authors. All rights reserved.