All Questions

Let $\theta(G)$ denote the Shannon zero error capacity of graph $G$ and $\vartheta(G)$ be the Lovász upper bound for $\theta(G)$. Let $C_{2n+1}$ denote the cycle graph with $2n+1$ nodes. We know the ...

Let $G$ be a cirulant graph with no loops at vertices and vertex degree $d$. Is the Lovasz theta function of this graph given by: $\vartheta(G) = \max_{i}\frac{-N\epsilon_{i}}{-\epsilon_{i}+d-1}$? ...