All normalized anti-monotonic overlap graph measures are bounded
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
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).