Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30953A 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 pagesDiscrete MathematicsQuantum PhysicsG.2.2Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matricestext