On the theta number of powers of cycle graphs
Combinatorics
2011-10-27 v1
Abstract
We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is computable in polynomial time. We also derive an asymptotic estimate for this theta number.
Keywords
Cite
@article{arxiv.1103.0444,
title = {On the theta number of powers of cycle graphs},
author = {Christine Bachoc and Arnaud Pêcher and Alain Thiéry},
journal= {arXiv preprint arXiv:1103.0444},
year = {2011}
}
Comments
17 pages