M. R. Malayeri

most citedA proof for a conjecture on the regularity of binomial edge ideals

2 citations · 2 across the 1 of their papers we have counts for

collaborators

3 papers

math.AC2021

On the depth of binomial edge ideals of graphs

Mohammad Rouzbahani Malayeri, Sara Saeedi Madani, Dariush Kiani

Let $G$ be a graph on the vertex set $[n]$ and $J_{G}$ the associated binomial edge ideal in the polynomial ring $S = K [x_{1}, \dots, x_{n}, y_{1}, \dots, y_{n}]$ . In this paper we inves…

math.AC2020

Binomial edge ideals of small depth

Mohammad Rouzbahani Malayeri, Sara Saeedi Madani, Dariush Kiani

Let $G$ be a graph on $[n]$ and $J_{G}$ be the binomial edge ideal of $G$ in the polynomial ring $S = K [x_{1}, \dots, x_{n}, y_{1}, \dots, y_{n}]$ . In this paper we investigate some topo…

math.AC2020★ 2 cited

A proof for a conjecture on the regularity of binomial edge ideals

M. Rouzbahani Malayeri, S. Saeedi Madani, D. Kiani

In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph $G$ , we define the invariant $η (G)$ as the maximum size of a clique disjoint edge s…