2020/07/14 by Yanhua Zhao, Zhao, Yanhua, Xueyi Huang +3 · 1 citation
Mathematics · #Graph theory and applications #Limits and Structures in Graph Theory #Finite Group Theory Research
paper · pdf · doi:10.48550/arxiv.2007.06922
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.