Gholamreza Abrishami

According to our database, Gholamreza Abrishami authored at least 9 papers between 2018 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

On non-traceable 3-connected planar cubic graphs of minimum order.

Gholamreza Abrishami, Freydoon Rahbarnia, Nico Van Cleemput

Discret. Math., 2026

2023

A note on Reed's conjecture for triangle-free graphs.

Gholamreza Abrishami, Ahmad Erfanian

Discret. Math., December, 2023

The dominant edge metric dimension of graphs.

Mostafa Tavakoli, Meysam Korivand, Ahmad Erfanian, Gholamreza Abrishami, Edy Tri Baskoro

Electron. J. Graph Theory Appl., 2023

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

Local metric dimension for graphs with small clique numbers.

Gholamreza Abrishami, Michael A. Henning, Mostafa Tavakoli

Discret. Math., 2022

2019

On independent domination in planar, cubic graphs.

Gholamreza Abrishami, Michael A. Henning, Freydoon Rahbarnia

Discuss. Math. Graph Theory, 2019

A note on the smallest connected non-traceable cubic bipartite planar graph.

Gholamreza Abrishami, Freydoon Rahbarnia

Discret. Math., 2019

2018

Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs.

Gholamreza Abrishami, Freydoon Rahbarnia

Inf. Process. Lett., 2018

Independent domination in subcubic graphs of girth at least six.

Gholamreza Abrishami, Michael A. Henning

Discret. Math., 2018