Chordal circulant graphs and induced matching number

2018/11/15 by Romeo, Francesco
#Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.1811.06409

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 ν(G), the induced matching number of G. These latter are useful in bounding the Castelnuovo-Mumford regularity of the edge ring of G.

Related

• Some algebraic invariants of edge ideal of circulant graphs
• The regularity of edge rings and matching numbers
• Matchings in hypergraphs and Castelnuovo-Mumford regularity
• Regularity of bicyclic Graphs and their powers
• The ∘ operation and * operation of Cohen-Macaulay bipartite graphs