Betti numbers of some circulant graphs
Let be the greatest odd integer less than or equal to . In this paper we provide explicit formulae to compute -graded Betti numbers of the circulant graphs . We do this by showing that this graph is the product (or join) of the cycle by itself, and computing Betti numbers of . We also discuss whether such a graph (more generally, ) is well-covered, Cohen-Macaulay, sequentially Cohen-Macaulay, Buchsbaum, or .