The Chromatic Number and the Least Eigenvalue of a Graph
Copyright policy )The Chromatic Number and the Least Eigenvalue of a Graph
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.
- Anhui University China (People's Republic of)
Coloring of graphs and hypergraphs, Eigenvalues, singular values, and eigenvectors, minimal least eigenvalue, Graphs and linear algebra (matrices, eigenvalues, etc.)
Coloring of graphs and hypergraphs, Eigenvalues, singular values, and eigenvectors, minimal least eigenvalue, Graphs and linear algebra (matrices, eigenvalues, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!