The spectral radius and the maximum degree of irregular graphs
| dc.creator | Cioabă, Sebastian M. | |
| dc.date | 2007-02-22 | |
| dc.date.accessioned | 2026-07-07T07:48:12Z | |
| dc.date.available | 2026-07-07T07:48:12Z | |
| dc.description | Let $G$ be an irregular graph on $n$ vertices with maximum degree $Δ$ and diameter $D$. We show that Δ-λ_1>\frac{1}{nD} where $λ_1$ is the largest eigenvalue of the adjacency matrix of $G$. We also study the effect of adding or removing few edges on the spectral radius of a regular graph. | |
| dc.description | 10 pages, 1 figure, submitted to EJC on January 20, 2007 | |
| dc.identifier | https://arxiv.org/abs/math/0702627 | |
| dc.identifier | http://arxiv.org/abs/math/0702627 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/124413 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C50, 15A18 | |
| dc.title | The spectral radius and the maximum degree of irregular graphs | |
| dc.type | text |