The spectral radius of subgraphs of regular graphs (Q1010592)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The spectral radius of subgraphs of regular graphs |
scientific article; zbMATH DE number 5540820 |
Statements
The spectral radius of subgraphs of regular graphs (English)
0 references
7 April 2009
0 references
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}. \]
0 references
smallest eigenvalue
0 references
largest eigenvalue
0 references
diameter
0 references
connected graph
0 references
0.8671242594718933
0 references
0.8296470046043396
0 references
0.8167020678520203
0 references
0.7973570823669434
0 references
0.7960097193717957
0 references
