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

Thumbnail Image

Date

Authors

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

Keywords

Discrete Mathematics, Quantum Physics, G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30953

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0112023
 http://arxiv.org/abs/cs/0112023

Collections

arXiv