Upper bounds on the independence and the clique covering number

被引：0
|
作者：
Cyriel Van Nuffelen
Kristel Van Rompay
机构：
[1] University of Antwerp,
来源：
Quarterly Journal of the Belgian, French and Italian Operations Research Societies | 2003年 / 1卷
关键词：
Adjacency Matrix; Independence Number; Covering Number; Clique Covering; Clique Covering Number;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
New upper bounds for the independence number and for the clique covering number of a graph are given in terms of the rank, respectively the eigenvalues, of the adjacency matrix. We formulate a conjecture concerning an upper bound of the clique covering number. This upper bound is related to an old conjecture of Alan J. Hoffman which is shown to be false.
引用
收藏
页码：43 / 50
页数：7
相关论文
共 50 条
12345