Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...

We consider inhomogeneous Erdős–Rényi graphs. We suppose that the maximal mean degree d satisfies d ≪ logn. We characterise the asymptotic behaviour of the n1–o(1) largest eigenvalues of the adjacency ...