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+\DeclareMathOperator{reg} (I(G))-2$. We also give a combinatorial characterization of unicyclic graphs with regularity $\nu (G)+1$ and $\nu (G)+2$, where $\nu (G)$ denotes the induced matching number of $G$.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.