Study of graphs via the spectra of their adjacency matrix A and Laplacian L = D − A. λ_2(L) (algebraic connectivity) controls expansion; Cheeger-type inequalities connect spectral and combinatorial properties.
Study of graphs via the spectra of their adjacency matrix A and Laplacian L = D − A. λ_2(L) (algebraic connectivity) controls expansion; Cheeger-type inequalities connect spectral and combinatorial properties.