On the binomial edge ideals of block graphs
Commutative Algebra
2014-02-11 v1 Combinatorics
Abstract
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.
Cite
@article{arxiv.1402.2041,
title = {On the binomial edge ideals of block graphs},
author = {Faryal Chaudhry and Ahmet Dokuyucu and Rida Irfan},
journal= {arXiv preprint arXiv:1402.2041},
year = {2014}
}