Abstract
We extend the clique-coclique inequality, previously known to hold for graphs in association schemes and vertex-transitive graphs, to graphs in homogeneous coherent configurations and 1-walk regular graphs. We further generalize it to a stronger inequality involving the Lovász theta number of such graph, and some theta variants, including characterizations of the equality.
Original language | English |
---|---|
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 346 |
Pages (from-to) | 275-283 |
ISSN | 1571-0661 |
DOIs | |
Publication status | Published - 1 Jan 2019 |
Event | 10th Latin and American Algorithms, Graphs and Optimization Symposium, - Belo Horizonte, Brazil Duration: 2 Jun 2019 → 7 Jun 2019 Conference number: 10 |
Conference
Conference | 10th Latin and American Algorithms, Graphs and Optimization Symposium, |
---|---|
Number | 10 |
Country/Territory | Brazil |
City | Belo Horizonte |
Period | 02/06/2019 → 07/06/2019 |
Keywords
- Clique-coclique inequality
- Coherent configuration
- Lovász theta function
- Matrix-algebra