A bound on the spectral radius of graphs (Q1109050): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90183-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094349588 / rank | |||
Normal rank | |||
Revision as of 00:11, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound on the spectral radius of graphs |
scientific article |
Statements
A bound on the spectral radius of graphs (English)
0 references
1988
0 references
Let G be a simple connected graph with n vertices and m edges. Let A be the adjacency matrix of G. The spectral radius \(\rho\) (A) of A satisfies \(\rho (A)\leq \sqrt{2m-n+1}\) with equality if and only if G is isomorphic to one of the following two graphs: (a) star \(K_{1,n-1}\); (b) the complete graph \(K_ n\).
0 references
adjacency matrix
0 references
spectral radius
0 references
