On the binomial edge ideals of block graphs

From MaRDI portal
Publication:4589677

DOI10.1515/AUOM-2016-0033zbMATH Open1389.13043arXiv1402.2041OpenAlexW2964208070MaRDI QIDQ4589677FDOQ4589677


Authors: Faryal Chaudhry, A. Dokuyucu, Rida Irfan Edit this on Wikidata


Publication date: 10 November 2017

Published in: Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1402.2041




Recommendations





Cited In (15)





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)