Eigenvalue comparisons in graph theory (Q1358961)
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: Eigenvalue comparisons in graph theory |
scientific article; zbMATH DE number 1025794
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eigenvalue comparisons in graph theory |
scientific article; zbMATH DE number 1025794 |
Statements
Eigenvalue comparisons in graph theory (English)
0 references
23 June 1997
0 references
Let \(G\) be a finite graph with minimal degree \(k\), and \(\lambda_1\geq\lambda_2\geq\cdots\geq\lambda_n\) be its spectrum. In this paper, some lower bounds for the first eigenvalues \(\lambda_i\), in terms of \(k\) and the diameter of \(G\), are derived.
0 references
spectrum
0 references
bounds
0 references
eigenvalues
0 references
