Interlacing eigenvalues and graphs (Q1899437): Difference between revisions

A survey paper to various kinds of applications of eigenvalue interlacing to matrices associated with graphs. Bounds are obtained for characteristic numbers of graphs, such as the size of maximal (co)clique, the chromatic number, the diameter, and the bandwidth, in terms of the eigenvalues of the standard adjacency matrix or the Laplacian matrix. The paper also deals with inequalities and regularity results concerning the structure of graphs and block designs.