The smallest eigenvalue of \(K_{r}\)-free graphs (Q2488937)

Let \(G\) be a \(K_{r+1}\)-free graph of order \(n\) and size \(m\) with \(r\geq 2\). The author proves \[ \lambda_n(G)<-\frac{2^{r+1}m^r}{rn^{2r-1}}, \] where \(\lambda_n(G)\) is the smallest eigenvalue of the adjacency matrix of \(G\). This implies that if \(G\) is a \(d\)-regular graph of order \(n\) and independence number \(r\), then the second eigenvalue satisfies \[ \lambda_2(G)\geq -1+\frac{2}{r}\frac{(n-1-d)^r}{n^{r-1}}. \]