An extremal problem for the spectral radius of a graph (Q1201245)
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 97496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extremal problem for the spectral radius of a graph |
scientific article; zbMATH DE number 97496 |
Statements
An extremal problem for the spectral radius of a graph (English)
0 references
17 January 1993
0 references
A real valuation of an undirected graph is an assignment of probabilities (called values) to its edges. The spectral radius is defined as the maximum of the moduli of all eigenvalues of the valuation matrix. Lower bounds for the spectral radius are derived.
0 references
extremal problem
0 references
eigenvalues
0 references
valuation matrix
0 references
bounds
0 references
spectral radius
0 references
0.7873649597167969
0 references
0.7843498587608337
0 references
