An Algebraic Upper Bound on the Independence Number of a Graph

Research output: Contribution to journalArticle


Abstract: This upper bound on the independence number of a graph has been introduced to study the so-called Shannon capacity. It is defined by linear algebra and eigenvalue techniques. in this talk we discuss some other aspects including a new characterization of perfect graphs.

Original languageEnglish
Number of pages1
JournalAnnals of Discrete Mathematics
Issue numberC
Publication statusPublished - Dec 1 1980


ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this