Bounds on graph spectra (Q792343)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds on graph spectra |
scientific article; zbMATH DE number 3853119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on graph spectra |
scientific article; zbMATH DE number 3853119 |
Statements
Bounds on graph spectra (English)
0 references
1984
0 references
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the literature. Not nearly as much seems to be known about bounds on other eigenvalues of the spectrum. Several results are presented here toward that goal, first for the general class of simple graphs, then for triangle-free graphs and finally for the even more restricted class of bipartite graphs.
0 references
eigenvalues of graph spectrum
0 references
adjacency matrix
0 references
triangle-free graphs
0 references
0.8584814667701721
0 references
0.8488540053367615
0 references
0.8473068475723267
0 references
0.8363292217254639
0 references
0.8345212936401367
0 references
