The chromatic number and the least eigenvalue of a graph (Q426804)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The chromatic number and the least eigenvalue of a graph |
scientific article; zbMATH DE number 6045663
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromatic number and the least eigenvalue of a graph |
scientific article; zbMATH DE number 6045663 |
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
