Loading...
Interlacing eigenvalues and graphs
Haemers,W.H.
Haemers,W.H.
Abstract
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.
Description
Pagination: 19, viii
Date
1994
Journal Title
Journal ISSN
Volume Title
Publisher
Unknown Publisher
Files
Loading...
675.pdf
Adobe PDF, 470.11 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Graphs, Eigenvalues, mathematics
Citation
Haemers, W H 1994, Interlacing eigenvalues and graphs. Research memorandum / Tilburg University, Department of Economics, vol. FEW 675, vol. FEW 675, Unknown Publisher.