2000 character limit reached
On the binomial edge ideals of block graphs
Published 10 Feb 2014 in math.AC and math.CO | (1402.2041v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.