Regularity of Powers of Unicyclic Graphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HOK7OG7Precord.jsonopen to challenge →
classification
math.AC
keywords
regularityunicyclicgraphgraphscharacterizecorrespondingdenotedenotes
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.