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

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

2001-12-21

arxiv.org/abs/cs/0112023v1

Computer Science

Discrete Mathematics

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175252