Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.disc.2021.112341 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Wheel-free graph, Spectral radius, Extremal graph, Quotient matrix | Journal | 344 |
Issue | ISSN | Citations |
5 | 0012-365X | 1 |
PageRank | References | Authors |
0.37 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanhua Zhao | 1 | 1 | 0.71 |
| Xueyi Huang | 2 | 1 | 0.37 |
| Huiqiu Lin | 3 | 34 | 11.56 |