Extreme eigenvalues of nonregular graphs (Q875951): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.07.006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2016808872 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bipartite Subgraphs and the Smallest Eigenvalue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2716030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The largest eigenvalue of nonregular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eigenvectors and eigenvalues of non-regular graphs / rank | |||
Normal rank |
Latest revision as of 17:25, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extreme eigenvalues of nonregular graphs |
scientific article |
Statements
Extreme eigenvalues of nonregular graphs (English)
0 references
16 April 2007
0 references
This paper deals with the greatest eigenvalue of a nonregular graph. Let \(G\) be a connected graph with vertex set \(\{1,2,\dots,n\}\), maximum degree \(\Delta\) and minimum degree \(\delta\). Let \(\lambda_1\) be the largest eigenvalue of the adjacency matrix \(A\) of \(G\). The authors obtain a lower bound of \(\Delta - \lambda_1\). Specifically, they prove for a connected nonregular graph with diameter \(D\), that \[ \Delta-\lambda_1 > \frac{n\Delta-2m}{n(D(n\Delta-2m)+1)}, \] where \(m\) is the number of edges; and hence \[ \Delta-\lambda_1 > \frac{n\Delta-2m}{n(D(n\Delta-2m)+1)}\geq \frac{1}{n(D+1)}. \]
0 references
spectral radius
0 references
nonregular graph
0 references
eigenvalues
0 references