Eigenvalues of graphs and a simple proof of a theorem of Greenberg (Q2496648): 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/j.laa.2005.12.020 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2012755367 / rank | |||
Normal rank |
Revision as of 02:30, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Eigenvalues of graphs and a simple proof of a theorem of Greenberg |
scientific article |
Statements
Eigenvalues of graphs and a simple proof of a theorem of Greenberg (English)
0 references
20 July 2006
0 references
Let \(\rho(\tilde X)\) be the spectral radius of the universal cover \(\widetilde X\) of a finite graph \(X\). The author shows that for a given \(\eta>0\), there exists a positive constant \(c=c(X,\eta)\) such that for each finite graph \(Y\) covered by \(X\) it holds that \(| \{\lambda\in\text{ spectrum of }Y: \lambda\geq\rho(X)-\eta\}| \geq c| V(Y)| \). This represents a slight improvement over the result of Greenberg who proved it for \(| \lambda| \geq\rho(X)-\eta\). A similar result regarding the smallest eigenvalue is also proved.
0 references
spectral radius
0 references
universal cover
0 references