On the binomial edge ideals of block graphs

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.

Keywords

• binomial edge ideals
• regularity
• depth
• 13d02
• 05e40