Exact formulae for the Lovász theta function of sparse circulant graphs

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 4, 2004, Pages 670-674

  Crespi, Valentino ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Circulant graph; Linear programming; Lov sz theta function

Indexed keywords

CIRCULANT GRAPHS; CLIQUE NUMBERS; COMMUNICATION ISSUE; LOVASZ THETA FUNCTION;

COMPUTATIONAL METHODS; ERROR ANALYSIS; FUNCTIONS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS;

GRAPH THEORY;

EID: 9744229931     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548010241852X     Document Type: Article

References (6)

1. V. CRESPI, Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs, Technical report TR2002-438, Computer Science Department, Dartmouth College, Hanover, NH, 2002.
2. V. E. BRIMKOV, B. CODENOTTI, V. CRESPI, AND M. LEONCINI, On the Lovász number of certain circulant graphs, in Algorithms and Complexity, Lecture Notes in Comput. Sci. 1767, G. Bongiovanni, G. Gambosi, and R. Petreschi, eds., Springer-Verlag, Berlin, New York, 2000, pp. 291-305.
3. V. E. BRIMKOV, B. CODENOTTI, V. CRESPI, R. P. BARNEVA, AND M. LEONCINI, Efficient Computation of the Lovász Theta, Function for a Class of Circulant Graphs, manuscript.
4. D. E. KNUTH, The sandwich theorem, Electron. J. Combin., 1 (1994), pp. 1-48.
5. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
6. C. E. SHANNON, The zero-error capacity of a noisy channel, Institute of Radio Engineers Transactions on Information Theory, IT-2 (1956), pp. 8-19.