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.
On the binomial edge ideals of block graphs
Faryal Chaudhry,Ahmet Dokuyucu,Rida Irfan
Published 2014 in Analele Universitatii "Ovidius" Constanta - Seria Matematica
ABSTRACT
PUBLICATION RECORD
- Publication year
2014
- Venue
Analele Universitatii "Ovidius" Constanta - Seria Matematica
- Publication date
2014-02-10
- Fields of study
Mathematics
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-16 of 16 references · Page 1 of 1
CITED BY
Showing 1-19 of 19 citing papers · Page 1 of 1