The defining numbers for vertex colorings of certain graphs. - Doost Ali Mojdeh; Nader Jafari Rad; Abdollah Khodkar (Australas. J Comb., 2006)

On the total domination critical graphs. - Doost Ali Mojdeh; Nader Jafari Rad (Electron. Notes Discret. Math., 2006)

Locating-total domination critical graphs. - Mustapha Chellali; Nader Jafari Rad (Australas. J Comb., 2009)

On total domination vertex critical graphs of high connectivity. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2009)

On the diameter of a domination dot-critical graph. - Nader Jafari Rad (Discret. Appl. Math., 2009)

Characterization of total restrained domination edge critical unicyclic graphs. - Nader Jafari Rad (Australas. J Comb., 2010)

Bicritical total domination. - Nader Jafari Rad (Australas. J Comb., 2010)

Critical concept for 2-rainbow domination in graphs. - Nader Jafari Rad (Australas. J Comb., 2011)

Total domination dot-critical graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2011)

A note on total reinforcement in graphs. - Michael A. Henning; Nader Jafari Rad; Joanna Raczek (Discret. Appl. Math., 2011)

Unique response Roman domination in graphs. - E. Ebrahimi Targhi; Nader Jafari Rad; Lutz Volkmann (Discret. Appl. Math., 2011)

Roman bondage in graphs. - Nader Jafari Rad; Lutz Volkmann (Discuss. Math. Graph Theory, 2011)

On the Roman Bondage Number of Planar Graphs. - Nader Jafari Rad; Lutz Volkmann (Graphs Comb., 2011)

Properties of independent Roman domination in graphs. - M. Adabi; E. Ebrahimi Targhi; Nader Jafari Rad; M. Saied Moradi (Australas. J Comb., 2012)

k-independence critical graphs. - Mustapha Chellali; Nader Jafari Rad (Australas. J Comb., 2012)

Trees with strong equality between the Roman domination number and the unique response Roman domination number. - Nader Jafari Rad; Chun-Hung Liu (Australas. J Comb., 2012)

On 3-yt-vertex critical graphs of diameter three. - Mustapha Chellali; Nader Jafari Rad; Abdollah Khodkar (Discret. Appl. Math., 2012)

On α-total domination in graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2012)

Locating-total domination in graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2012)

Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371]. - Abdollah Alimadadi; Changiz Eslahchi; Teresa W. Haynes; Michael A. Henning; Nader Jafari Rad; Lucas C. van der Merwe (Discret. Math., 2012)

Total edge critical graphs with leaves. - Johannes H. Hattingh; Nader Jafari Rad; Sayyed Heidar Jafari; Marc Loizeaux; John Matthews; Lucas C. van der Merwe (Discret. Math., 2012)

On 2-rainbow domination and Roman domination in graphs. - Mustapha Chellali; Nader Jafari Rad (Australas. J Comb., 2013)

Bounds on neighborhood total domination in graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2013)

A note on the independent domination number in graphs. - Nader Jafari Rad; Lutz Volkmann (Discret. Appl. Math., 2013)

Limited Dominating Broadcast in graphs. - Nader Jafari Rad; Fatemeh Khosravi (Discret. Math. Algorithms Appl., 2013)

Strong equality between the Roman domination and independent Roman domination numbers in trees. - Mustapha Chellali; Nader Jafari Rad (Discuss. Math. Graph Theory, 2013)

Roman Domination Dot-critical Graphs. - Nader Jafari Rad; Lutz Volkmann (Graphs Comb., 2013)

Bounds on the 2-Rainbow Domination Number of Graphs. - Yunjian Wu; Nader Jafari Rad (Graphs Comb., 2013)

Trees with unique Roman dominating functions of minimum weight. - Mustapha Chellali; Nader Jafari Rad (Discret. Math. Algorithms Appl., 2014)

Characterization of cubic graphs G with irt(G)=IRt(G)=2. - Changiz Eslahchi; Shahab Haghi; Nader Jafari Rad (Discuss. Math. Graph Theory, 2014)

On open neighborhood locating-dominating in graphs. - Mustapha Chellali; Nader Jafari Rad; Suk Jai Seo; Peter J. Slater (Electron. J. Graph Theory Appl., 2014)

Some Progress on Total Bondage in Graphs. - Nader Jafari Rad; Joanna Raczek (Graphs Comb., 2014)

On the intersection graphs of subspaces of a vector space. - Marcin Krzywkowski; Nader Jafari Rad; Sayyed Heidar Jafari (CTW, 2015)

Properties of total restrained domination vertex critical graphs. - Nader Jafari Rad (Ars Comb., 2015)

Bounds on Global Total Domination in Graphs. - Nader Jafari Rad; Elahe Sharifi (Comput. Sci. J. Moldova, 2015)

Trees with independent Roman domination number twice the independent domination number. - Mustapha Chellali; Nader Jafari Rad (Discret. Math. Algorithms Appl., 2015)

A note on total graphs. - S. F. Forouhandeh; Nader Jafari Rad; R. Pandiyaraj; H. P. Patil; B. Vaqari Motlagh (Discuss. Math. Graph Theory, 2015)

NP-hardness of multiple bondage in graphs. - Nader Jafari Rad (J. Complex., 2015)

On the complexity of strong and weak total domination in graphs. - Nader Jafari Rad (Australas. J Comb., 2016)

A note on the locating-total domination in trees. - Nader Jafari Rad; Hadi Rahbani (Australas. J Comb., 2016)

A note on the independence number in bipartite graphs. - Elahe Sharifi; Nader Jafari Rad (Australas. J Comb., 2016)

Total restrained reinforcement in graphs. - Nader Jafari Rad; Lutz Volkmann (AKCE Int. J. Graphs Comb., 2016)

A note on the intersection graph of subspaces of a vector space. - Nader Jafari Rad; Sayyed Heidar Jafari (Ars Comb., 2016)

Matchings in 4-total restrained domination vertex critical graphs. - Nader Jafari Rad; Lutz Volkmann (Ars Comb., 2016)

Hat problem on graphs with exactly three cycles. - Tayebe Balegh; Nader Jafari Rad (Comput. Sci. J. Moldova, 2016)

Domination stability in graphs. - Nader Jafari Rad; Elahe Sharifi; Marcin Krzywkowski (Discret. Math., 2016)

Various bounds for liar's domination number. - Abdollah Alimadadi; Nader Jafari Rad; Doost Ali Mojdeh (Discuss. Math. Graph Theory, 2016)

On the complexity of reinforcement in graphs. - Nader Jafari Rad (Discuss. Math. Graph Theory, 2016)

Bounds on weak and strong total domination in graphs. - Mohammad Hadi Akhbari; Nader Jafari Rad (Electron. J. Graph Theory Appl., 2016)

Edge-Removal and Edge-Addition in α-Domination. - Nader Jafari Rad; Lutz Volkmann (Graphs Comb., 2016)

Generalization of the total outer-connected domination in graphs. - Nader Jafari Rad; Lutz Volkmann (RAIRO Oper. Res., 2016)

On the complexity of some bondage problems in graphs. - Nader Jafari Rad; Hailiza Kamarulhaili (Australas. J Comb., 2017)

Some notes on the isolate domination in graphs. - Nader Jafari Rad (AKCE Int. J. Graphs Comb., 2017)

Roman domination edge critical graphs having precisely two cycles. - Nader Jafari Rad (Ars Comb., 2017)

Pentacyclic Graphs with Maximal Estrada Index. - Nader Jafari Rad; Akbar Jahanbani; Roslan Hasni (Ars Comb., 2017)

Bounds on the independence number of a graph in terms of order, size and maximum degree. - Nader Jafari Rad; Elahe Sharifi (Discret. Appl. Math., 2017)

Tetracyclic graphs with maximal Estrada index. - Nader Jafari Rad; Akbar Jahanbani; Doost Ali Mojdeh (Discret. Math. Algorithms Appl., 2017)

On the Roman domination stable graphs. - Majid Hajian; Nader Jafari Rad (Discuss. Math. Graph Theory, 2017)

A note on the edge Roman domination in trees. - Nader Jafari Rad (Electron. J. Graph Theory Appl., 2017)

On 2-Step and Hop Dominating Sets in Graphs. - Michael A. Henning; Nader Jafari Rad (Graphs Comb., 2017)

Bounds for the Independence Number in k-Step Hamiltonian Graphs. - Noor A'lawiah Abd Aziz; Nader Jafari Rad; Hailiza Kamarulhaili; Roslan Hasni (Comput. Sci. J. Moldova, 2018)

A note on the global offensive alliances in graphs. - Nader Jafari Rad (Discret. Appl. Math., 2018)

New bounds on the independence number of connected graphs. - Nader Jafari Rad; Elahe Sharifi (Discret. Math. Algorithms Appl., 2018)

Bounds on the locating Roman dominating number in trees. - Nader Jafari Rad; Hadi Rahbani (Discuss. Math. Graph Theory, 2018)

Bounds on the locating-domination number and differentiating-total domination number in trees. - Nader Jafari Rad; Hadi Rahbani (Discuss. Math. Graph Theory, 2018)

On α-Domination in Graphs. - Angsuman Das; Renu C. Laskar; Nader Jafari Rad (Graphs Comb., 2018)

Bounds on the fair total domination number in trees and unicyclic graphs. - Majid Hajian; Nader Jafari Rad; Lutz Volkmann (Australas. J Comb., 2019)

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

New Probabilistic Upper Bounds on the Domination Number of a Graph. - Nader Jafari Rad (Electron. J. Comb., 2019)

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

Graphs with Large Hop Roman Domination Number. - Elahe Shabani; Nader Jafari Rad; Abolfazl Poureidi (Comput. Sci. J. Moldova, 2019)

A new lower bound on the double domination number of a graph. - Majid Hajian; Nader Jafari Rad (Discret. Appl. Math., 2019)

A characterization of double Roman trees. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2019)

A note on improved upper bounds on the transversal number of hypergraphs. - Michael A. Henning; Nader Jafari Rad (Discret. Math. Algorithms Appl., 2019)

A Nordhaus-Gaddum bound for Roman domination. - Nader Jafari Rad; Hadi Rahbani (Discret. Math. Algorithms Appl., 2019)

Fair domination number in cactus graphs. - Majid Hajian; Nader Jafari Rad (Discuss. Math. Graph Theory, 2019)

Some progress on the double Roman domination in graphs. - Nader Jafari Rad; Hadi Rahbani (Discuss. Math. Graph Theory, 2019)

On the complexity of some hop domination parameters. - Nader Jafari Rad; Elahe Shabani (Electron. J. Graph Theory Appl., 2019)

Bounds on the Identifying Codes in Trees. - Hadi Rahbani; Nader Jafari Rad; Seyed Masoud Mirrezaei (Graphs Comb., 2019)

A new lower bound on the domination number of a graph. - Majid Hajian; Michael A. Henning; Nader Jafari Rad (J. Comb. Optim., 2019)

On the complexity of multiple bondage in graphs. - Nader Jafari Rad (Theor. Comput. Sci., 2019)

A note on the complexity of locating-total domination in graphs. - Hadi Rahbani; Nader Jafari Rad; Mohammad-Reza Sadeghi 001 (Theor. Comput. Sci., 2019)

Varieties of Roman domination II. - Mustapha Chellali; Nader Jafari Rad; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (AKCE Int. J. Graphs Comb., 2020)

On algorithmic complexity of double Roman domination. - Abolfazl Poureidi; Nader Jafari Rad (Discret. Appl. Math., 2020)

A note on the fair domination number in outerplanar graphs. - Majid Hajian; Nader Jafari Rad (Discuss. Math. Graph Theory, 2020)

Algorithmic and complexity aspects of problems related to total Roman domination for graphs. - Abolfazl Poureidi; Nader Jafari Rad (J. Comb. Optim., 2020)

On the total Roman domination stability in graphs. - Ghazale Asemian; Nader Jafari Rad; Abolfazl Tehranian; Hamid Rasouli (AKCE Int. J. Graphs Comb., 2021)

Upper bounds on the global offensive alliances in graphs. - Nader Jafari Rad (Discret. Appl. Math., 2021)

Fair total domination number in cactus graphs. - Majid Hajian; Nader Jafari Rad (Discuss. Math. Graph Theory, 2021)

Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph. - Michael A. Henning; Nader Jafari Rad (Graphs Comb., 2021)

On the double Roman bondage numbers of graphs. - Nader Jafari Rad; Hamid Reza Maimani; Mostafa Momeni; Farhad Rahimi Mahid (Discret. Math. Algorithms Appl., 2022)

Bounds on the double Italian domination number of a graph. - Farzaneh Azvin; Nader Jafari Rad (Discuss. Math. Graph Theory, 2022)

The Roman domatic problem in graphs and digraphs: a survey. - Mustapha Chellali; Nader Jafari Rad; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discuss. Math. Graph Theory, 2022)

A classification of cactus graphs according to their domination number. - Majid Hajian; Michael A. Henning; Nader Jafari Rad (Discuss. Math. Graph Theory, 2022)

Algorithmic aspects of the independent 2-rainbow domination number and independent Roman 2-domination number. - Abolfazl Poureidi; Nader Jafari Rad (Discuss. Math. Graph Theory, 2022)

On the outer-independent double Italian domination number. - Noor A'lawiah Abd Aziz; Hailiza Kamarulhaili; Farzaneh Azvin; Nader Jafari Rad (Electron. J. Graph Theory Appl., 2022)

Improved Bounds on the k-tuple (Roman) Domination Number of a Graph. - Noor A'lawiah Abd Aziz; Michael A. Henning; Nader Jafari Rad; Hailiza Kamarulhaili (Graphs Comb., 2022)

A note on the double domination number in maximal outerplanar and planar graphs. - Noor A'lawiah Abd Aziz; Nader Jafari Rad; Hailiza Kamarulhaili (RAIRO Oper. Res., 2022)

Roman κ-domination revisited. - Noor A'lawiah Abd Aziz; Nader Jafari Rad; Hailiza Kamarulhaili (RAIRO Oper. Res., 2023)

On the trees with maximum Cardinality-Redundance number. - Elham Mohammadi; Nader Jafari Rad (Comput. Sci. J. Moldova, 2024)

On the harmonic index in cactus graphs. - Nader Jafari Rad; Roslan Hasni; Hailiza Kamarulhaili (Discret. Math. Algorithms Appl., 2025)

An alternative proposed single error detection algorithm for the single parity check algorithm. - Parviz Gharehbagheri; Hamid Haj Seyyed Javadi; Nader Jafari Rad; Hamidreza Bakhshi (J. Supercomput., 2025)

New probabilistic upper bounds on the domination number of a graph: II. - Michael A. Henning; Nader Jafari Rad (Discret. Math., 2026)