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 binomia...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.展开更多
文摘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.
