Skip to main content
SpringerLink
Log in

On the Lovász Number of Certain Circulant Graphs

  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1767))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alizadeh, F., Haeberly, J.-P. A., Nayakkankuppam, M., Overton, M., Schmieta, S.: SDPPACK User’s Guide. http://www.cs.nyu.edu/faculty/overton/sdppack/sdppack.html

  2. Alon, N.: On the Capacity of Digraphs. European J. Combinatorics, 19 (1998) 1–5

    Article  MATH  MathSciNet  Google Scholar 

  3. Alon, N., Orlitsky, A.: Repeated Communication and Ramsey Graphs. IEEE Trans. on Inf. Theory, 41 (1995) 1276–1289

    Article  MATH  MathSciNet  Google Scholar 

  4. Ashley, Siegel: A Note on the Shannon Capacity of Run-Length-Limited Codes. IEEE Trans. on Inf. Theory, 33 (1987)

    Google Scholar 

  5. Brimkov, V.E., Codenotti, B., Crespi, V., Leoncini, M.: Efficient Computation of the Lovász Number of Circulant Graphs. In preparation

    Google Scholar 

  6. Farber, M.: An Analogue of the Shannon Capacity of a Graph. SIAM J. on Alg. and Disc. Methods, 7 (1986) 67–72

    Article  MATH  MathSciNet  Google Scholar 

  7. Feige, U.: Randomized Graph Products, Chromatic Numbers, and the Lovász ϑ-Function. Proc. of the 27th STOC (1995) 635–640

    Google Scholar 

  8. Haemers, W.: An Upper Bound for the Shannon Capacity of a Graph. Colloq. Math. Soc. János Bolyai, 25 (1978) 267–72

    MathSciNet  Google Scholar 

  9. Haemers, W.: On Some Problems of Lovász Concerning the Shannon Capacity of Graphs. IEEE Trans. on Inf. Theory, 25 (1979) 231–232

    Article  MATH  MathSciNet  Google Scholar 

  10. Knuth, D.E.: The Sandwich Theorem. Electronic J. Combinatorics, 1 (1994)

    Google Scholar 

  11. Lovász, L.: On the Shannon Capacity of a Graph. IEEE Trans. on Inf. Theory, 25 (1979) 1–7

    Article  MATH  Google Scholar 

  12. O'Rourke, J.: Computational Geometry in C. Cambridge University Press (1994)

    Google Scholar 

  13. Rosenfeld, M.: On a Problem of Shannon. Proc. Amer. Math. Soc., 18 (1967) 315–319

    Article  MATH  MathSciNet  Google Scholar 

  14. Shannon, C.E.: The Zero-Error Capacity of a Noisy Channel. IRE Trans. Inform. Theory, IT-2 (1956) 8–19

    Article  MathSciNet  Google Scholar 

  15. Szegedy, M.: A Note on the ϑ Number of Lovász and the Generalized Delsarte Bound. Proc. of the 35th FOCS, (1994) 36–41

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Eastern Mediterranean University, Famagusta, TRNC

    Valentin E. Brimkov & Valentino Crespi

  2. Istituto di Matematica Computazionale del CNR, Via S. Maria 46, 56126, Pisa, Italy

    Bruno Codenotti & Mauro Leoncini

  3. Facoltà di Economia, Università di Foggia, Via IV Novembre 1, 71100, Foggia, Italy

    Mauro Leoncini

Authors
  1. Valentin E. Brimkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Codenotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Valentino Crespi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mauro Leoncini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rome “La Sapienza”, Via Salaria 113, 00198, Rome, Italy

    Giancarlo Bongiovanni  & Rossella Petreschi  & 

  2. Department of Mathematics, University of Rome “Tor Vergata”, Via della Ricerca Scientifica 1, 00133, Rome, Italy

    Giorgio Gambosi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brimkov, V.E., Codenotti, B., Crespi, V., Leoncini, M. (2000). On the Lovász Number of Certain Circulant Graphs. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-46521-9_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67159-6

  • Online ISBN: 978-3-540-46521-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation