Bound for the Regularity of Binomial Edge Ideals of Cactus Graphs  

作　　者：A.V.Jayanthan Rajib Sarkar 

机构地区：[1]Department of Mathematics,Indian Institute of Technology Madras Chennai 600036,India

出　　处：《Algebra Colloquium》2022年第3期443-452,共10页代数集刊（英文版）

基　　金：funded by University Grants Commission,India.

摘　　要：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.

关 键 词：binomial edge ideal cactus graph Cohen-Macaulayness REGULARITY 

分 类 号：O15[理学—数学]