About this article
Published Online: Sep 21, 2017
Page range: 149 - 158
Received: Feb 04, 2015
Accepted: Mar 02, 2015
DOI: https://doi.org/10.1515/auom-2016-0033
Keywords
© 2017
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
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.