arXiv Analytics

Sign in

arXiv:math/0702723 [math.CO]AbstractReferencesReviewsResources

Chromatic number and spectral radius

Vladimir Nikiforov

Published 2007-02-24, updated 2007-06-06Version 3

Let G be a graph, H be its chromatic number, L be the largest eigenvalue of its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then, complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M

Categories: math.CO
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:0709.3140 [math.CO] (Published 2007-09-20)
Some Relations between Rank, Chromatic Number and Energy of Graphs
arXiv:1110.1756 [math.CO] (Published 2011-10-08)
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
arXiv:1412.6349 [math.CO] (Published 2014-12-19)
The chromatic number of a signed graph

Links

Toolbox