The maximum spectral radius of wheel-free graphs

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 tha...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2021-05, Vol.344 (5), p.112341, Article 112341
Main Authors: Zhao, Yanhua, Huang, Xueyi, Lin, Huiqiu
Format: Article
Language:English
Subjects:
Extremal graph
Quotient matrix
Spectral radius
Wheel-free graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2021.112341