Abstract
The Shannon capacity of a graph is an important graph invariant in information theory that is extremely difficult to compute. The Lovasz number, which is based on semidefinite programming relaxation, is a well-known upper bound for the Shannon capacity. To improve this upper bound, previous research tried to generalize the Lovasz number using the ideas from the sum-of-squares optimization. In this paper, we consider the possibility of developing general conic programming upper bounds for the Shannon capacity, which include the previous attempts as special cases, and show that it is impossible to find better upper bounds for the Shannon capacity along this way.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
