Geodesic
The spectral radius of subgraphs of regular graphs
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) Let $G$ be a regular graph of order $n$ and finite diameter $D.$ If $H$ is a proper subgraph of $G,$ then $$ \mu\left( G\right) -\mu\left( H\right) >{1\over nD}. $$ (ii) If $G$ is a regular nonbipartite graph of order $n$ and finite diameter $D$, then $$ \mu\left( G\right) +\mu_{\min}\left( G\right) >{1\over nD}. $$
DOI : 10.37236/1021
Classification : 05C50
Mots-clés : smallest eigenvalue, largest eigenvalue, diameter, connected graph 
@article{10_37236_1021,
     author = {Vladimir Nikiforov},
     title = {The spectral radius of subgraphs of regular graphs},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/1021},
     zbl = {1157.05313},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1021/}
}
TY  - JOUR
AU  - Vladimir Nikiforov
TI  - The spectral radius of subgraphs of regular graphs
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1021/
DO  - 10.37236/1021
ID  - 10_37236_1021
ER  - 
%0 Journal Article
%A Vladimir Nikiforov
%T The spectral radius of subgraphs of regular graphs
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/1021/
%R 10.37236/1021
%F 10_37236_1021
Vladimir Nikiforov. The spectral radius of subgraphs of regular graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1021

Cité par Sources :