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
classification
math.AC
keywords
regularityunicyclicgraphgraphscharacterizecorrespondingdenotedenotes
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.