Chordal circulant graphs and induced matching number

Francesco Romeo

Chordal circulant graphs and induced matching number

Combinatorics 2018-11-16 v1 Commutative Algebra

Authors: Francesco Romeo

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$ .

Keywords

circulant graphs chordal graphs induced matching number edge ring castelnuovo-mumford regularity

Cite

@article{arxiv.1811.06409,
  title  = {Chordal circulant graphs and induced matching number},
  author = {Francesco Romeo},
  journal= {arXiv preprint arXiv:1811.06409},
  year   = {2018}
}

Related papers

View all related →