10 citations · 28 across the 18 of their papers we have counts for
24 papers
Castelnuovo-Mumford regularity of generalized binomial edge ideals of graphs
Dariush Kiani, Sara Saeedi Madani, Guangjun Zhu
In this paper, we mainly study the Castelnuovo-Mumford regularity of the generalized binomial edge ideals of graphs. We show that this number can be any integer number from to…
Combinatorial upper bounds for the smallest eigenvalue of a graph
Aryan Esmailpour, Sara Saeedi Madani, Dariush Kiani
Let be a graph, and let denote the smallest eigenvalue of . First, we provide an upper bound for based on induced bipartite subgraphs of . Consequently, we…
Hankel edge ideals of trees and (semi-)Hamiltonian graphs
Dariush Kiani, Sara Saeedi Madani, Saeed Tafazolian
In this paper, we study the Hankel edge ideals of graphs. We determine the minimal prime ideals of the Hankel edge ideal of labeled Hamiltonian and semi-Hamiltonian graphs, and we…
On the depth of binomial edge ideals of graphs
Mohammad Rouzbahani Malayeri, Sara Saeedi Madani, Dariush Kiani
Let be a graph on the vertex set and the associated binomial edge ideal in the polynomial ring . In this paper we inves…
Binomial edge ideals of small depth
Mohammad Rouzbahani Malayeri, Sara Saeedi Madani, Dariush Kiani
Let be a graph on and be the binomial edge ideal of in the polynomial ring . In this paper we investigate some topo…
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 , we define the invariant as the maximum size of a clique disjoint edge s…