Chordal circulant graphs and induced matching number
Abstract
Let G=Cn(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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.