“…Then the ideal J G generated by {x i y j − x j y i | (i, j) is an edge in G} is called the binomial edge ideal of G. This was introduced by Herzog et al, [8] and independently by Ohtani, [12]. Recently, there have been many results relating the combinatorial data of graphs with the algebraic properties of the corresponding binomial edge ideals, see [1], [2], [4], [11], [14], [15], [17]. In particular, there have been active research connecting algebraic invariants of the binomial edge ideals such as Castelnuovo-Mumford regularity, depth, Betti numbers etc., with combinatorial invariants associated with graphs such as length of maximal induced path, number of maximal cliques, matching number.…”