A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type (Q1969793): 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/s0012-365x(99)90280-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024841505 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type |
scientific article |
Statements
A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type (English)
0 references
27 July 2000
0 references
An upper bound for the sum of the largest eigenvalue of a graph \(G\) and of its complement \(\overline G\) is derived. The bound depends on the chromatic number of \(G\) and of \(\overline G\) as well as on the number of vertices of \(G\).
0 references
upper bound
0 references
eigenvalue
0 references
chromatic number
0 references
