文献类型：期刊文献

英文题名：Spectral extrema of Ks,t-minor free graphs - On a conjecture of M. Tait

作者：Zhai, Mingqing[1];Lin, Huiqiu[2]

机构：[1]Chuzhou Univ, Sch Math & Finance, Chuzhou 239012, Anhui, Peoples R China;[2]East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China

年份：2022

卷号：157

起止页码：184

外文期刊名：JOURNAL OF COMBINATORIAL THEORY SERIES B

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

基金：Supported by the National Natural Science Foundation of China (Nos. 12171066 and 12011530064), Anhui Provincial Natural Science Foundation (No. 2108085MA13) and Natural Science Foundation of Shanghai (No. 22ZR1416300).

语种：英文

外文关键词：K-s,K-t-minor; Spectral radius; Extremal graph; Majorization

摘要：Minors play a key role in graph theory, and extremal problems on forbidding minors have attracted appreciable amount of interest in the past decades. In this paper, we focus on spectral extrema of K-s,K-t-minor free graphs, and determine extremal graphs with maximum spectral radius over all K-s,K-t-minor free graphs of sufficiently large order. This generalizes and improves several previous results. For t >= s >= 2, our result completely solves Tait's conjecture. For t >= s = 1, our result gives a spectral analogue of a theorem due to Ding, Johnson and Seymour, which determines the maximum number of edges in K-1,K-t-minor free connected graphs. Some spectral and structural tools, such as, local edge maximality, local degree sequence majorization and double eigenvectors transformation, are used to characterize structural properties of extremal graphs. (C) 2022 Elsevier Inc. All rights reserved.