arXiv · 1601.01086
Regularity of Binomial Edge Ideals of Certain Block Graphs
Abstract
We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper and lower bounds for the regularity of binomial edge ideals of a class of trees called lobsters. We also obtain precise expressions for the regularities of binomial edge ideals of certain classes of trees and block graphs.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. V. Jayanthan, N. Narayanan, B. V. Raghavendra Rao. 2018-04-27. Regularity of Binomial Edge Ideals of Certain Block Graphs. https://arxiv.org/abs/1601.01086
Cite the original work for its findings. Save a collection to share your selection of sources.