A Lower Bound for the Laplacian Eigenvalues of a Graph-Proof of a Conjecture by Guo
| Year of publication: |
[2008]
|
|---|---|
| Authors: | Brouwer, Andries E. |
| Other Persons: | Haemers, Willem H. (contributor) |
| Publisher: |
[2008]: [S.l.] : SSRN |
| Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
| Description of contents: |
We show that the j-th largest Laplacian eigenvalue of a connected graph on n vertices is at least dj-j+2 (j=1,...,n), where dj is the j-th largest degree. This settles a conjecture due to Guo
|
freely available
| Extent: | 1 Online-Ressource (6 p) |
|---|---|
| Series: | CentER Discussion Paper ; No. 2008-27 |
| Type of publication: | Book / Working Paper |
| Language: | English |
| Notes: | Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments March 2008 erstellt |
| Other identifiers: | 10.2139/ssrn.1104962 [DOI] |
| Classification: | C0 - Mathematical and Quantitative Methods. General |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012725132