Abstract
Let Pk be the path of order k. The square Pk2 of Pk is obtained by joining all pairs of vertices with distance no more than two in Pk. A graph is called H-free if it does not contain H as a subgraph. In this paper, we consider a Brualdi-Solheid-Turán type problem for P52-free graphs, and determine the maximum spectral radius among P52-free graphs of order n.
Original language | English |
---|---|
Article number | 126 |
Journal | Graphs and Combinatorics |
Volume | 38 |
Issue number | 4 |
DOIs | |
State | Published - Aug 2022 |
Keywords
- Extremal graph
- p-free graph
- Quotient matrix
- Spectral radius