Regularity of Powers of Unicyclic Graphs

Abstract

Let G be a finite simple graph and I(G) denote the corresponding edge ideal. In this paper we prove that if G is a unicyclic graph then for all s ≥ 1 the regularity of I(G)s is exactly 2s+reg(I(G))-2. We also characterize the unicyclic graphs with regularity (G)+1 and (G)+2, where (G) denotes the induced matching number 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.

Discussion (0)

Sign in to join the discussion.

Loading comments…