On the Lovász Number of Certain Circulant Graphs

Authors:
Valentin E. Brimkov;Bruno Codenotti;Valentino Crespi;Mauro Leoncini
Affiliations:
-;-;-;-
Venue:
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Year:
2000

Citing 7
Cited 2

An analogue of the shannon capacity of a graph

SIAM Journal on Algebraic and Discrete Methods
A note on the Shannon capacity of run-length-limited codes

IEEE Transactions on Information Theory
Computational geometry in C

Computational geometry in C
Randomized graph products, chromatic numbers, and Lovasz j-function

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the capacity of digraphs

European Journal of Combinatorics
A note on the /spl theta/ number of Lovasz and the generalized Delsarte bound

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Repeated communication and Ramsey graphs

IEEE Transactions on Information Theory

Efficient computation of the lovász theta function for a class of circulant graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On the theta number of powers of cycle graphs

Combinatorica

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theta function of a graph, also known as the Lovász number, has the remarkable property of being computable in polynomial time, despite being "sandwiched" between two hard to compute integers, i.e., clique and chromatic number. Very little is known about the explicit value of the theta function for special classes of graphs. In this paper we provide the explicit formula for the Lovász number of the union of two cycles, in two special cases, and a practically efficient algorithm, for the general case.