An extremal problem for the spectral radius of a graph (Q1201245): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A minimax problem for graphs and its relation to generalized doubly stochastic matrices / rank | |||
Normal rank | |||
Latest revision as of 12:03, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extremal problem for the spectral radius of a graph |
scientific article |
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
