A bound on the spectral radius of graphs (Q1109050)
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 4068920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound on the spectral radius of graphs |
scientific article; zbMATH DE number 4068920 |
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
0.9833155
0 references
0.9788525
0 references
0.9749539
0 references
0.9744755
0 references
0.9744372
0 references
0.9730189
0 references
0.9730189
0 references
0.9725338
0 references
0.9725338
0 references
0 references
