INFORMAZIONI SU QUESTO ARTICOLO
Pubblicato online: 21 set 2017
Pagine: 149 - 158
Ricevuto: 04 feb 2015
Accettato: 02 mar 2015
DOI: https://doi.org/10.1515/auom-2016-0033
Parole chiave
© 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.