Chromatic number and spectral radius
组合数学
2007-06-07 v3
摘要
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
引用
@article{arxiv.math/0702723,
title = {Chromatic number and spectral radius},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0702723},
year = {2007}
}