文献类型：期刊文献

英文题名：The maximum spectral radius of wheel-free graphs

作者：Zhao, Yanhua[1];Huang, Xueyi[1];Lin, Huiqiu[1]

机构：[1]East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

年份：2021

卷号：344

期号：5

外文期刊名：DISCRETE MATHEMATICS

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

基金：The authors are indebted to the two anonymous referees for their valuable comments, and would like to thank S.M. Cioaba, Zhiwen Wang and Zhenzhen Lou for many helpful suggestions. This research was supported by the National Natural Science Foundation of China (Nos. 11901540, 11671344 and 11771141).

语种：英文

外文关键词：Wheel-free graph; Spectral radius; Extremal graph; Quotient matrix

摘要：A wheel graph is a graph formed by connecting a single vertex to all vertices of a cycle. A graph is called wheel-free if it does not contain any wheel graph as a subgraph. In 2010, Nikiforov proposed a Brualdi-Solheid-Turan type problem: what is the maximum spectral radius of a graph of order n that does not contain subgraphs of particular kind. In this paper, we study the Brualdi-Solheid-Turan type problem for wheel-free graphs, and we determine the maximum (signless Laplacian) spectral radius of a wheel-free graph of order n. Furthermore, we characterize the extremal graphs. (C) 2021 Elsevier B.V. All rights reserved.