Chordal circulant graphs and induced matching number

Abstract

Let $G=C_n(S)$ be a circulant graph on $n$ vertices. In this paper we characterize chordal circulant graphs and then we compute $\nu (G)$, the induced matching number of $G$. These latter are useful in bounding the Castelnuovo-Mumford regularity of the edge ring of $G$.