Bound for the Regularity of Binomial Edge Ideals of Cactus Graphs
-
Published:2022-07-26
Issue:03
Volume:29
Page:443-452
-
ISSN:1005-3867
-
Container-title:Algebra Colloquium
-
language:en
-
Short-container-title:Algebra Colloq.
Author:
Jayanthan A.V.1,
Sarkar Rajib1
Affiliation:
1. Department of Mathematics, Indian Institute of Technology Madras, Chennai 600036, India
Abstract
In this article, we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique. As a consequence, we obtain an upper bound for the regularity of binomial edge ideal of a cactus graph. We also identify a certain subclass attaining the upper bound.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Applied Mathematics,Algebra and Number Theory