加载中…
2001-12-21
Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
Pawel WocjanDominik JanzingThomas Beth
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本