Nasrin Dehgardi

According to our database, Nasrin Dehgardi authored at least 10 papers between 2014 and 2024.

Collaborative distances:

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

2024

Lower bounds on the general first Zagreb index of graphs with low cyclomatic number.

Nasrin Dehgardi, Tomislav Doslic

Discret. Appl. Math., March, 2024

2023

Lower bounds on the irregularity of trees and unicyclic graphs.

Mahdieh Azari, Nasrin Dehgardi, Tomislav Doslic

Discret. Appl. Math., 2023

2022

The minus total k-domination numbers in graphs.

Jonecis A. Dayap, Nasrin Dehgardi, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami

Discret. Math. Algorithms Appl., 2022

2021

Domination, independent domination number and 2-independence number in trees.

Hamideh Aram, Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Lutz Volkmann

Discuss. Math. Graph Theory, 2021

2018

Independent Roman domination and 2-independence in trees.

Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Nasrin Dehgardi

Discret. Math. Algorithms Appl., 2018

2017

An introduction to the twin signed total <i>k</i>-domination numbers in directed graphs.

Masoud Atapour, Nasrin Dehgardi, Lutz Volkmann

RAIRO Oper. Res., 2017

A sufficient condition for large rainbow domination number.

Jafar Amjadi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami

Int. J. Comput. Math. Comput. Syst. Theory, 2017

Twin minus total domination numbers in directed graphs.

Maryam Atapour, Nasrin Dehgardi

Discuss. Math. Graph Theory, 2017

The k-rainbow reinforcement numbers in graphs.

Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann

Discret. Appl. Math., 2017

2014

The k-rainbow bondage number of a graph.

Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann

Discret. Appl. Math., 2014