文献类型：期刊文献

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

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

机构：[1] Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China

年份：2020

外文期刊名：arXiv

收录：EI(收录号：20200562467)

语种：英文

外文关键词：Astrophysics - Wheels

摘要：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-Turán 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-Turán 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.MSC Codes 05C50. Copyright ? 2020, The Authors. All rights reserved.