Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
Wocjan, Pawel · Janzing, Dominik · Beth, Thomas
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.