The spectral radius of subgraphs of regular graphs (Q1010592): Difference between revisions

Summary: \(\mu(G)\) and \(\mu_{\min}(G)\) 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(G)-\mu(H) > \frac{1}{nD} \] (ii) If \(G\) is a regular nonbipartite graph of order \(n\) and finite diameter \(D\), then \[ \mu(G) +\mu_{\min}( G) > \frac{1}{nD}. \]