Eigenvalues and extremal degrees in graphs
| dc.creator | Nikiforov, Vladimir | |
| dc.date | 2006-05-02 | |
| dc.date | 2006-05-02 | |
| dc.date.accessioned | 2026-07-07T07:13:51Z | |
| dc.date.available | 2026-07-07T07:13:51Z | |
| dc.description | We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs. | |
| dc.identifier | https://arxiv.org/abs/math/0605071 | |
| dc.identifier | http://arxiv.org/abs/math/0605071 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/112634 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C50 | |
| dc.title | Eigenvalues and extremal degrees in graphs | |
| dc.type | text |