Geodesic
The spectral radius and the maximum degree of irregular graphs
The electronic journal of combinatorics, Tome 14 (2007)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
Let $G$ be an irregular graph on $n$ vertices with maximum degree $\Delta$ and diameter $D$. We show that $$ \Delta-\lambda_1>{1\over nD}, $$ where $\lambda_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.
DOI : 10.37236/956
Classification : 05C50, 15A18 
Sebastian M. Cioabă. The spectral radius and the maximum degree of irregular graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/956
@article{10_37236_956,
     author = {Sebastian M. Cioab\u{a}},
     title = {The spectral radius and the maximum degree of irregular graphs},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/956},
     zbl = {1122.05056},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/956/}
}
TY  - JOUR
AU  - Sebastian M. Cioabă
TI  - The spectral radius and the maximum degree of irregular graphs
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/956/
DO  - 10.37236/956
ID  - 10_37236_956
ER  - 
%0 Journal Article
%A Sebastian M. Cioabă
%T The spectral radius and the maximum degree of irregular graphs
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/956/
%R 10.37236/956
%F 10_37236_956

Cité par Sources :