PlumX Metrics
Embed PlumX Metrics

On the Lovász number of certain circulant graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 1767, Page: 291-305
2000
  • 10
    Citations
  • 0
    Usage
  • 6
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    10
    • Citation Indexes
      10
  • Captures
    6

Book Chapter Description

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.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know