Bounds on graph eigenvalues (Q909674): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(89)90541-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031986374 / rank | |||
Normal rank | |||
Revision as of 23:44, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on graph eigenvalues |
scientific article |
Statements
Bounds on graph eigenvalues (English)
0 references
1989
0 references
This note is a nice, condensed survey on recent results in finding upper and lower estimates for the maximum of the k-th eigenvalue of a graph as function of the number of vertices or edges. For connected graphs, some new bounds in terms of the number of vertices are derived.
0 references
survey
0 references
upper and lower estimates
0 references
eigenvalue of a graph
0 references
number of vertices
0 references
