Nader Jafari Rad

Orcid: 0000-0001-7406-1859

According to our database1, Nader Jafari Rad authored at least 100 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the trees with maximum Cardinality-Redundance number.
Comput. Sci. J. Moldova, 2024

2023
Roman <i>κ</i>-domination revisited.
RAIRO Oper. Res., May, 2023

2022
A note on the double domination number in maximal outerplanar and planar graphs.
RAIRO Oper. Res., September, 2022

Improved Bounds on the k-tuple (Roman) Domination Number of a Graph.
Graphs Comb., 2022

On the outer-independent double Italian domination number.
Electron. J. Graph Theory Appl., 2022

Algorithmic aspects of the independent 2-rainbow domination number and independent Roman 2-domination number.
Discuss. Math. Graph Theory, 2022

A classification of cactus graphs according to their domination number.
Discuss. Math. Graph Theory, 2022

The Roman domatic problem in graphs and digraphs: a survey.
Discuss. Math. Graph Theory, 2022

Bounds on the double Italian domination number of a graph.
Discuss. Math. Graph Theory, 2022

On the double Roman bondage numbers of graphs.
Discret. Math. Algorithms Appl., 2022

2021
Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph.
Graphs Comb., 2021

Fair total domination number in cactus graphs.
Discuss. Math. Graph Theory, 2021

Upper bounds on the global offensive alliances in graphs.
Discret. Appl. Math., 2021

On the total Roman domination stability in graphs.
AKCE Int. J. Graphs Comb., 2021

2020
Algorithmic and complexity aspects of problems related to total Roman domination for graphs.
J. Comb. Optim., 2020

A note on the fair domination number in outerplanar graphs.
Discuss. Math. Graph Theory, 2020

On algorithmic complexity of double Roman domination.
Discret. Appl. Math., 2020

Varieties of Roman domination II.
AKCE Int. J. Graphs Comb., 2020

2019
A note on the complexity of locating-total domination in graphs.
Theor. Comput. Sci., 2019

On the complexity of multiple bondage in graphs.
Theor. Comput. Sci., 2019

A new lower bound on the domination number of a graph.
J. Comb. Optim., 2019

Bounds on the Identifying Codes in Trees.
Graphs Comb., 2019

On the complexity of some hop domination parameters.
Electron. J. Graph Theory Appl., 2019

Some progress on the double Roman domination in graphs.
Discuss. Math. Graph Theory, 2019

Fair domination number in cactus graphs.
Discuss. Math. Graph Theory, 2019

A Nordhaus-Gaddum bound for Roman domination.
Discret. Math. Algorithms Appl., 2019

A note on improved upper bounds on the transversal number of hypergraphs.
Discret. Math. Algorithms Appl., 2019

A characterization of double Roman trees.
Discret. Appl. Math., 2019

A new lower bound on the double domination number of a graph.
Discret. Appl. Math., 2019

Graphs with Large Hop Roman Domination Number.
Comput. Sci. J. Moldova, 2019

Author-Initiated Retraction: "A remark on the weak Turán's Theorem".
Comput. Sci. J. Moldova, 2019

New Probabilistic Upper Bounds on the Domination Number of a Graph.
Electron. J. Comb., 2019

Upper bounds on the k-tuple domination number and k-tuple total domination number of a graph.
Australas. J Comb., 2019

Bounds on the fair total domination number in trees and unicyclic graphs.
Australas. J Comb., 2019

2018
On α-Domination in Graphs.
Graphs Comb., 2018

Bounds on the locating-domination number and differentiating-total domination number in trees.
Discuss. Math. Graph Theory, 2018

Bounds on the locating Roman dominating number in trees.
Discuss. Math. Graph Theory, 2018

New bounds on the independence number of connected graphs.
Discret. Math. Algorithms Appl., 2018

A note on the global offensive alliances in graphs.
Discret. Appl. Math., 2018

Bounds for the Independence Number in k-Step Hamiltonian Graphs.
Comput. Sci. J. Moldova, 2018

2017
On 2-Step and Hop Dominating Sets in Graphs.
Graphs Comb., 2017

A note on the edge Roman domination in trees.
Electron. J. Graph Theory Appl., 2017

On the Roman domination stable graphs.
Discuss. Math. Graph Theory, 2017

Tetracyclic graphs with maximal Estrada index.
Discret. Math. Algorithms Appl., 2017

Bounds on the independence number of a graph in terms of order, size and maximum degree.
Discret. Appl. Math., 2017

Pentacyclic Graphs with Maximal Estrada Index.
Ars Comb., 2017

Roman domination edge critical graphs having precisely two cycles.
Ars Comb., 2017

Some notes on the isolate domination in graphs.
AKCE Int. J. Graphs Comb., 2017

On the complexity of some bondage problems in graphs.
Australas. J Comb., 2017

2016
Generalization of the total outer-connected domination in graphs.
RAIRO Oper. Res., 2016

Edge-Removal and Edge-Addition in α-Domination.
Graphs Comb., 2016

Bounds on weak and strong total domination in graphs.
Electron. J. Graph Theory Appl., 2016

On the complexity of reinforcement in graphs.
Discuss. Math. Graph Theory, 2016

Various bounds for liar's domination number.
Discuss. Math. Graph Theory, 2016

Domination stability in graphs.
Discret. Math., 2016

Hat problem on graphs with exactly three cycles.
Comput. Sci. J. Moldova, 2016

Matchings in 4-total restrained domination vertex critical graphs.
Ars Comb., 2016

A note on the intersection graph of subspaces of a vector space.
Ars Comb., 2016

Total restrained reinforcement in graphs.
AKCE Int. J. Graphs Comb., 2016

A note on the independence number in bipartite graphs.
Australas. J Comb., 2016

A note on the locating-total domination in trees.
Australas. J Comb., 2016

On the complexity of strong and weak total domination in graphs.
Australas. J Comb., 2016

2015
NP-hardness of multiple bondage in graphs.
J. Complex., 2015

A note on total graphs.
Discuss. Math. Graph Theory, 2015

Trees with independent Roman domination number twice the independent domination number.
Discret. Math. Algorithms Appl., 2015

Bounds on Global Total Domination in Graphs.
Comput. Sci. J. Moldova, 2015

Properties of total restrained domination vertex critical graphs.
Ars Comb., 2015

On the intersection graphs of subspaces of a vector space.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Some Progress on Total Bondage in Graphs.
Graphs Comb., 2014

On open neighborhood locating-dominating in graphs.
Electron. J. Graph Theory Appl., 2014

Characterization of cubic graphs <i>G</i> with <i>ir<sub>t</sub></i>(<i>G</i>)=<i>IR<sub>t</sub></i>(<i>G</i>)=2.
Discuss. Math. Graph Theory, 2014

Trees with unique Roman dominating functions of minimum weight.
Discret. Math. Algorithms Appl., 2014

2013
Bounds on the 2-Rainbow Domination Number of Graphs.
Graphs Comb., 2013

Roman Domination Dot-critical Graphs.
Graphs Comb., 2013

Strong equality between the Roman domination and independent Roman domination numbers in trees.
Discuss. Math. Graph Theory, 2013

Limited Dominating Broadcast in graphs.
Discret. Math. Algorithms Appl., 2013

A note on the independent domination number in graphs.
Discret. Appl. Math., 2013

Bounds on neighborhood total domination in graphs.
Discret. Appl. Math., 2013

On 2-rainbow domination and Roman domination in graphs.
Australas. J Comb., 2013

2012
Total edge critical graphs with leaves.
Discret. Math., 2012

Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371].
Discret. Math., 2012

Locating-total domination in graphs.
Discret. Appl. Math., 2012

On α-total domination in graphs.
Discret. Appl. Math., 2012

On 3-y<sub>t</sub>-vertex critical graphs of diameter three.
Discret. Appl. Math., 2012

Trees with strong equality between the Roman domination number and the unique response Roman domination number.
Australas. J Comb., 2012

k-independence critical graphs.
Australas. J Comb., 2012

Properties of independent Roman domination in graphs.
Australas. J Comb., 2012

2011
On the Roman Bondage Number of Planar Graphs.
Graphs Comb., 2011

Roman bondage in graphs.
Discuss. Math. Graph Theory, 2011

Unique response Roman domination in graphs.
Discret. Appl. Math., 2011

A note on total reinforcement in graphs.
Discret. Appl. Math., 2011

Total domination dot-critical graphs.
Discret. Appl. Math., 2011

Critical concept for 2-rainbow domination in graphs.
Australas. J Comb., 2011

2010
Bicritical total domination.
Australas. J Comb., 2010

Characterization of total restrained domination edge critical unicyclic graphs.
Australas. J Comb., 2010

2009
On the diameter of a domination dot-critical graph.
Discret. Appl. Math., 2009

On total domination vertex critical graphs of high connectivity.
Discret. Appl. Math., 2009

Locating-total domination critical graphs.
Australas. J Comb., 2009

2006
On the total domination critical graphs.
Electron. Notes Discret. Math., 2006

The defining numbers for vertex colorings of certain graphs.
Australas. J Comb., 2006


  Loading...