A bound on the shannon capacity via a linear programming variation
2017
We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We also show that our bound can be better than Lovasz theta number and Haemers minimum rank bound.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
21
References
4
Citations
NaN
KQI