Eigenvalues and forbidden subgraphs. I. (Q869937)

Let \(G\) be a graph with \(n\) vertices, \(m\) edges and \(t\) triangles. Let \(\lambda_n(G)\) be the largest eigenvalue of the Laplacian matrix of \(G\) and \(\mu_n(G)\) be the smallest eigenvalue of its adjacency matrix. The author shows that \[ \lambda_n(G)\geq\frac{2m^2-3nt}{m\left(n^2-2m\right)}n \quad\text{and}\quad\mu_n(G)\leq\frac{3n^3t-4m^3}{nm(n^2-2m)}, \] with equality if and only if \(G\) is a regular complete multipartite graph. In case \(G\) is \(K_{r+1}\)-free, we have \[ \lambda_n(G)\geq\frac{2mn}{(r-1)(n^2-2m)}, \] with equality if and only if \(G\) is a regular complete \(r\)-partite graph.