The spectral radius of graphs with no odd wheels (Q2237854): Difference between revisions

The authors state and prove a variant of (a special case of) Turán's problem: The spectral radius of a graph is the largest eigenvalue of the graph's adjacency matrix. Denote by \(\lambda_n\) the maximal spectral radius of all graphs on \(n\) vertices which do not contain an odd ``wheel'' \(W_{2k+1}\) (such ``wheel'' has \(2k\) vertices forming a cycle, and an additional vertex which is adjacent to all vertices on this cycle). Then for \(k>5\) and \(n\) sufficiently large, the family of such \(W_{2k+1}\)-avoiding graphs on \(n\) vertices with spectral radius equal to \(\lambda_n\) can be characterised in a concise way.