3 citations · 4 across the 9 of their papers we have counts for
3 papers · 1 filter
Shellable and Cohen-Macaulay complete t-partite graphs
Seyyede Masoome Seyyedi, Farhad Rahmati, Mahdis Saeedi
Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equiv…
Toricness of Binomial Edge Ideals
Mahdis Saeedi, Farhad Rahmati, Seyyede Masoome Seyyedi
Let G be a finite simple graph. In this paper we will show that the binomial edge ideal of G, JG is toric if and only if each connected component of G is complete and in this case…
Modification of the Elite Ant System in Order to Avoid Local Optimum Points in the Traveling Salesman Problem
Majid Yousefikhoshbakht, Farzad Didehvar, Farhad Rahmati
This article presents a new algorithm which is a modified version of the elite ant system (EAS) algorithm. The new version utilizes an effective criterion for escaping from the loc…