4 papers
Fort Abundance in Zero Forcing
Aida Abiad, Sina Ghasemi Nezhad
This paper paper concerns the study of forts, the sets that obstruct zero forcing. We show that every block graph on vertices has at least minimal forts, extending a rece…
Fast FPT Algorithms for Grundy Number on Dense Graphs
Sina Ghasemi Nezhad, Maryam Moghaddas, Fahad Panolan
In this paper, we investigate the \textsc{Grundy Coloring} problem for graphs with a cluster modulator, a structure commonly found in dense graphs. The Grundy chromatic number, rep…
On Calculating the Chromatic Symmetric Function
Nima Amoei Mobaraki, Yasaman Gerivani, Sina Ghasemi Nezhad
This paper investigates methods for calculating the chromatic symmetric function (CSF) of a graph in chromatic-bases and the -basis. Our key contributions include a novel appr…
Lower bounds for the Randić index in terms of matching number
Saieed Akbari, Sina Ghasemi Nezhad, Reyhane Ghazizadeh +2
We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small exce…