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

Simple item page
dc.creatorWocjan, Pawel
dc.creatorJanzing, Dominik
dc.creatorBeth, Thomas
dc.date2001-12-21
dc.date.accessioned2026-07-07T03:18:02Z
dc.date.available2026-07-07T03:18:02Z
dc.descriptionA 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/cs/0112023
dc.identifierhttp://arxiv.org/abs/cs/0112023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30953
dc.subjectDiscrete Mathematics
dc.subjectQuantum Physics
dc.subjectG.2.2
dc.titleLower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
dc.typetext

Files

Collections

arXiv