Papers
Topics
Authors
Recent
Search
2000 character limit reached

Regularity of Powers of Unicyclic Graphs

Published 3 Feb 2017 in math.AC | (1702.00916v4)

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 \geq 1$ the regularity of $I(G)s$ is exactly $2s+\text{reg}(I(G))-2$. We also characterize the unicyclic graphs with regularity $\nu(G)+1$ and $\nu(G)+2$, where $\nu(G)$ denotes the induced matching number of $G$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.