Interlacing eigenvalues and graphs (Q1899437)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 803763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interlacing eigenvalues and graphs |
scientific article; zbMATH DE number 803763 |
Statements
Interlacing eigenvalues and graphs (English)
0 references
12 February 1996
0 references
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.
0 references
coclique
0 references
regular graph
0 references
clique
0 references
eigenvalue interlacing
0 references
chromatic number
0 references
diameter
0 references
bandwidth
0 references
adjacency matrix
0 references
Laplacian matrix
0 references
block designs
0 references
0.8223275542259216
0 references
0.8014876842498779
0 references
0.8010063171386719
0 references
