Bound for the regularity of binomial edge ideals of cactus graphs
Commutative Algebra
2020-10-23 v2
Abstract
In this article, we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique. As a consequence, we obtain an upper bound for the regularity of binomial edge ideal of a cactus graph. We also identify certain subclass attaining the upper bound.
Cite
@article{arxiv.2005.08594,
title = {Bound for the regularity of binomial edge ideals of cactus graphs},
author = {A. V. Jayanthan and Rajib Sarkar},
journal= {arXiv preprint arXiv:2005.08594},
year = {2020}
}
Comments
Minor corrections; To appear in Algebra Colloquium