Abstract
Let G be a finite simple graph on n vertices and JG denote the corresponding binomial edge ideal in We compute the Castelnuovo-Mumford regularity of when JG is the binomial edge ideal of a Cohen-Macaulay bipartite graph. We achieve this by computing the regularity of certain bipartite subgraphs and some intermediate graphs, called k-fan graphs. In this process, we also obtain a class of graphs which satisfy the regularity conjecture of Saeedi Madani and Kiani.
Acknowledgments
We have extensively used SAGE [Citation9] and Macaulay 2 [Citation5] for computational purposes.