Spectral Radius and maximum degree of connected graphs
| dc.creator | Nikiforov, Vladimir | |
| dc.date | 2006-02-01 | |
| dc.date.accessioned | 2026-07-07T07:03:02Z | |
| dc.date.available | 2026-07-07T07:03:02Z | |
| dc.description | We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of Stevanovic, Zhang, and Alon and Sudakov. | |
| dc.identifier | https://arxiv.org/abs/math/0602028 | |
| dc.identifier | http://arxiv.org/abs/math/0602028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/108823 | |
| dc.subject | Combinatorics | |
| dc.subject | 15A42 | |
| dc.title | Spectral Radius and maximum degree of connected graphs | |
| dc.type | text |