Independent domination in subcubic graphs of girth at least six. - Gholamreza Abrishami; Michael A. Henning (Discret. Math., 2018)

Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs. - Gholamreza Abrishami; Freydoon Rahbarnia (Inf. Process. Lett., 2018)

A note on the smallest connected non-traceable cubic bipartite planar graph. - Gholamreza Abrishami; Freydoon Rahbarnia (Discret. Math., 2019)

On independent domination in planar, cubic graphs. - Gholamreza Abrishami; Michael A. Henning; Freydoon Rahbarnia (Discuss. Math. Graph Theory, 2019)

Local metric dimension for graphs with small clique numbers. - Gholamreza Abrishami; Michael A. Henning; Mostafa Tavakoli (Discret. Math., 2022)

An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six. - Gholamreza Abrishami; Michael A. Henning (Graphs Comb., 2022)

The dominant edge metric dimension of graphs. - Mostafa Tavakoli; Meysam Korivand; Ahmad Erfanian; Gholamreza Abrishami; Edy Tri Baskoro (Electron. J. Graph Theory Appl., 2023)

A note on Reed's conjecture for triangle-free graphs. - Gholamreza Abrishami; Ahmad Erfanian (Discret. Math., 2023)