On the binomial edge ideals of block graphs
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.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2016-06-01
|
| Series: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/auom-2016-0033 |