Interlacing eigenvalues and graphs

Research output: Book/ReportReport

1340 Downloads (Pure)


We give several old and some new applications of eigenvalue interlacing to matrices associated to graphs. Bounds are obtained for characteristic numbers of graphs, such as the size of a 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. We also deal with inequalities and regularity results concerning the structure of graphs and block designs.
Original languageEnglish
PublisherUnknown Publisher
VolumeFEW 675
Publication statusPublished - 1994

Publication series

NameResearch memorandum / Tilburg University, Department of Economics
VolumeFEW 675


  • Graphs
  • Eigenvalues
  • mathematics


Dive into the research topics of 'Interlacing eigenvalues and graphs'. Together they form a unique fingerprint.

Cite this