Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
Discrete Mathematics
2007-05-23 v1 Quantum Physics
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0112023,
title = {Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices},
author = {Pawel Wocjan and Dominik Janzing and Thomas Beth},
journal= {arXiv preprint arXiv:cs/0112023},
year = {2007}
}
Comments
6 pages