Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
6 pages
6 pages