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.
-д хадгалсан:
| Үндсэн зохиолчид: | , , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Sciendo
2016-06-01
|
| Цуврал: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://doi.org/10.1515/auom-2016-0033 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|