Spectral gap of $G(n,\hat{I}\pm n,\hat{I}{\pm }^{2}n)$ graphs and the giant component theorem

M. Koshelev, A. Raigorodskii

The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of t…