Hadi Rahbani

According to our database, Hadi Rahbani authored at least 12 papers between 2016 and 2026.

Collaborative distances:

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

2026

On weak double Roman domination in graphs.

S. Soltani, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Hadi Rahbani, Seyed Mahmoud Sheikholeslami

Discret. Appl. Math., 2026

New upper bounds on Zagreb indices with given domination number.

Hadi Rahbani, Hossein Abdollahzadeh Ahangar, Michael A. Henning

Appl. Math. Comput., 2026

2025

New bounds on Zagreb connection indices for trees with fixed domination number.

Hadi Rahbani, Hossein Abdollahzadeh Ahangar, Michael A. Henning

AKCE Int. J. Graphs Comb., 2025

2022

Strong equality of Roman and perfect Roman Domination in trees.

Zehui Shao, Saeed Kosari, Hadi Rahbani, Mehdi Sharifzadeh, Seyed Mahmoud Sheikholeslami

RAIRO Oper. Res., 2022

2019

A note on the complexity of locating-total domination in graphs.

Hadi Rahbani, Nader Jafari Rad, Mohammad-Reza Sadeghi

Theor. Comput. Sci., 2019

On perfect Roman domination number in trees: complexity and bounds.

Mahsa Darkooti, Abdollah Alhevaz, Sadegh Rahimi, Hadi Rahbani

J. Comb. Optim., 2019

Bounds on the Identifying Codes in Trees.

Hadi Rahbani, Nader Jafari Rad, Seyed Masoud Mirrezaei

Graphs Comb., 2019

Some progress on the double Roman domination in graphs.

Nader Jafari Rad, Hadi Rahbani

Discuss. Math. Graph Theory, 2019

A Nordhaus-Gaddum bound for Roman domination.

Nader Jafari Rad, Hadi Rahbani

Discret. Math. Algorithms Appl., 2019

2018

Bounds on the locating-domination number and differentiating-total domination number in trees.

Nader Jafari Rad, Hadi Rahbani

Discuss. Math. Graph Theory, 2018

Bounds on the locating Roman dominating number in trees.

Nader Jafari Rad, Hadi Rahbani

Discuss. Math. Graph Theory, 2018

2016

A note on the locating-total domination in trees.

Nader Jafari Rad, Hadi Rahbani

Australas. J Comb., 2016