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.
Recommendations
Cited in
(15)- Binomial edge ideals of unicyclic graphs
- On the generalized binomial edge ideals of generalized block graphs
- On the extremal Betti numbers of the binomial edge ideal of closed graphs
- Regularity of binomial edge ideals of certain block graphs
- On \(m\)-closed graphs
- On the extremal Betti numbers of binomial edge ideals of block graphs
- An upper bound for the regularity of binomial edge ideals of trees
- Binomial edge ideals of small depth
- Regularity of binomial edge ideals of chordal graphs
- Gorenstein binomial edge ideals
- Binomial edge ideals of regularity 3
- Krull dimension and regularity of binomial edge ideals of block graphs
- Binomial edge ideals of generalized block graphs
- Regularity bound of generalized binomial edge ideal of graphs
- Bound for the Regularity of Binomial Edge Ideals of Cactus Graphs
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)