Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
<|reference_start|>Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices: A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacency matrix and arbitrary Hermitian matrices.<|reference_end|>
@article{wocjan2001lower,
    title={Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency
  Matrices},
    author={Pawel Wocjan, Dominik Janzing, and Thomas Beth (Universitaet
  Karlsruhe)},
    journal={arXiv preprint arXiv:cs/0112023},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0112023},
    primaryClass={cs.DM quant-ph}
}