On the binomial edge ideals of block graphs

From MaRDI portal
Publication:4589677




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.









This page was built for publication: On the binomial edge ideals of block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589677)