The chromatic number and the least eigenvalue of a graph (Q426804): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 00:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromatic number and the least eigenvalue of a graph |
scientific article |
Statements
The chromatic number and the least eigenvalue of a graph (English)
0 references
12 June 2012
0 references
Summary: In this paper we get a structural property for a graph having the minimal least eigenvalue among all graphs of fixed order and given chromatic number, and characterize such graphs under the condition that the chromatic number is not larger than half the order of the graph. As a result, we obtain a lower bound on the least eigenvalue in terms of the chromatic number, and an upper bound on the chromatic number in terms of the least eigenvalue of a graph.
0 references
minimal least eigenvalue
0 references
