Binomial Edge Ideals of Generalized block graphs
Commutative Algebra
2021-12-07 v2
Abstract
We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo-Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by , where is the number of minimal cut sets of the graph and obtain an improved upper bound for the regularity in terms of the number of maximal cliques and pendant vertices of .
Cite
@article{arxiv.1910.06787,
title = {Binomial Edge Ideals of Generalized block graphs},
author = {Arvind Kumar},
journal= {arXiv preprint arXiv:1910.06787},
year = {2021}
}
Comments
Few examples, figures are added. Also, the proof of Theorem 4.5 has been corrected. Accepted for publication in International Journal of Algebra and Computation