Geodesic
Revisiting two classical results on graph spectra
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $\mu\left( G\right) $ and $\mu_{\min}\left( G\right) $ be the largest and smallest eigenvalues of the adjacency matrix of a graph $G$. Our main results are: (i) If $H$ is a proper subgraph of a connected graph $G$ of order $n$ and diameter $D$, then $$ \mu\left( G\right) -\mu\left( H\right) >{1\over\mu\left( G\right) ^{2D}n}. $$ (ii) If $G$ is a connected nonbipartite graph of order $n$ and diameter $D$, then $$ \mu\left( G\right) +\mu_{\min}\left( G\right) >{2\over\mu\left( G\right) ^{2D}n}. $$ For large $\mu $ and $D$ these bounds are close to the best possible ones.
DOI : 10.37236/932
Classification : 05C50 
@article{10_37236_932,
     author = {Vladimir Nikiforov},
     title = {Revisiting two classical results on graph spectra},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/932},
     zbl = {1111.05062},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/932/}
}
TY  - JOUR
AU  - Vladimir Nikiforov
TI  - Revisiting two classical results on graph spectra
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/932/
DO  - 10.37236/932
ID  - 10_37236_932
ER  - 
%0 Journal Article
%A Vladimir Nikiforov
%T Revisiting two classical results on graph spectra
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/932/
%R 10.37236/932
%F 10_37236_932
Vladimir Nikiforov. Revisiting two classical results on graph spectra. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/932

Cité par Sources :