Saha, KamaleshKamaleshSahaSengupta, IndranathIndranathSengupta2025-08-282025-08-282021-04-01http://arxiv.org/abs/2104.11464https://d8.irins.org/handle/IITG2025/20068In this paper, we introduce the notion of binomial edge ideals of a clutter and obtain results similar to those obtained for graphs by Rauf \& Rinaldo in \cite(raufrin). We also answer a question posed in their paper.en-USe-Printe-Print123456789/555