Pith. sign in

REVIEW

Regularity of Powers of Unicyclic Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1702.00916 v4 pith:HOK7OG7P submitted 2017-02-03 math.AC

classification math.AC
keywords regularityunicyclicgraphgraphscharacterizecorrespondingdenotedenotes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Pith tools