Abstract
We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo–Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by [Formula: see text], where [Formula: see text] is the number of minimal cut sets of the graph [Formula: see text] and obtain an improved upper bound for the regularity in terms of the number of maximal cliques and pendant vertices of [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
