Saha, KamaleshKamaleshSahaSengupta, IndranathIndranathSengupta2025-08-282025-08-282021-04-01http://arxiv.org/abs/2104.14143http://repository.iitgn.ac.in/handle/IITG2025/20074In this paper, starting with an arbitrary graph G, we give a construction of a graph [G] with Cohen-Macaulay binomial edge ideal. We have extended this construction for clutters also. We also discuss unmixed and Cohen-Macaulay properties of binomial edge ideals of subgraphsen-USe-Printe-Print123456789/555