Abstract
The Lovász theta function has attracted much attention for its connection with diverse issues such as communicating without errors and computing large cliques in graphs. Indeed, this function enjoys the remarkable property of being computable in polynomial time despite being sandwiched between clique and chromatic numbers, two well-known, hard to compute quantities. In this paper I provide a closed formula for the Lovász function of all the circulant graphs of degree 4 with even displacement, thus generalizing Lovász results on cycle graphs (circulant graphs of degree 2).
Sign-in/Register to access full text options 
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.
