The Spectral Radius of Subgraphs of Regular Graphs

  • Vladimir Nikiforov

Abstract

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}. $$

Published
2007-10-05
Article Number
N20