À propos de cet article
Publié en ligne: 21 sept. 2017
Pages: 149 - 158
Reçu: 04 févr. 2015
Accepté: 02 mars 2015
DOI: https://doi.org/10.1515/auom-2016-0033
Mots clés
© 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.