New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix
The purpose of this article is to improve existing lower bounds on the chromatic number χ. Let μ[subscript 1],...,μ[subscript n] be the eigenvalues of the adjacency matrix sorted in non-increasing order. First, we prove the lower bound χ ≥ 1 + max[subscript m]{∑[m over i=1]μ[subscript i]/ − ∑[m over...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Electronic Journal of Combinatorics,
2014-09-18T17:26:51Z.
|
| Subjects: | |
| Online Access: | Get fulltext |