Upper bounds on the independence and the clique covering number
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.
Key words: adjacency matrix, eigenvalues, independence number, clique covering number.
AMS classification: 05C.
KeywordsAdjacency Matrix Independence Number Covering Number Clique Covering Clique Covering Number
Unable to display preview. Download preview PDF.