The spectral radius of subgraphs of regular graphs (Q1010592): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The spectral radius of subgraphs of regular graphs |
scientific article |
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
