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.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics