Spectral extrema of graphs with bounded clique number and matching number (Q6046080)

In this paper, the authors prove that the extremal graph having the maximal spectral radius among the graphs on \(n\) vertices having clique number at most \(k\) and matching number at most \(s\) is the complete \(k\)-partite graph with one partition set of size \(n-s\) and the others having sizes as equal as possible. This result is a spectral version of the analogous result on the number of edges by \textit{N. Alon} and \textit{P. Frankl} [``Turán graphs with bounded matching number'', Preprint, \url{arXiv:2210.15076}]. The main technique of the proof is the Perron-Frobenius theorem.