Revisiting two classical results on graph spectra (Q870073)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Revisiting two classical results on graph spectra |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisiting two classical results on graph spectra |
scientific article |
Statements
Revisiting two classical results on graph spectra (English)
0 references
12 March 2007
0 references
Summary: Let \(\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) if \(H\) is a proper subgraph of a connected graph \(G\) of order \(n\) and diameter \(D\), then \(\mu(G) -\mu(H) > 1/(\mu(G)^{2D}n)\), and (ii) if \(G\) is a connected nonbipartite graph of order \(n\) and diameter \(D\), then \(\mu(G) +\mu_{\min}(G) > 2/(\mu(G)^{2D}n).\) For large \(\mu\) and \(D\) these bounds are close to the best possible ones.
0 references
