Nader Jafari Rad
Orcid: 0000-0001-7406-1859
According to our database1,
Nader Jafari Rad authored at least 104 papers
between 2006 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2026
Discret. Math., 2026
2025
An alternative proposed single error detection algorithm for the single parity check algorithm.
J. Supercomput., May, 2025
Discret. Math. Algorithms Appl., January, 2025
2024
Comput. Sci. J. Moldova, 2024
2023
2022
RAIRO Oper. Res., September, 2022
Graphs Comb., 2022
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
Discuss. Math. Graph Theory, 2022
Discuss. Math. Graph Theory, 2022
Discuss. Math. Graph Theory, 2022
2021
2020
Algorithmic and complexity aspects of problems related to total Roman domination for graphs.
J. Comb. Optim., 2020
Discuss. Math. Graph Theory, 2020
2019
Theor. Comput. Sci., 2019
Electron. J. Graph Theory Appl., 2019
Discuss. Math. Graph Theory, 2019
Discret. Math. Algorithms Appl., 2019
Discret. Appl. Math., 2019
Comput. Sci. J. Moldova, 2019
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
Australas. J Comb., 2019
2018
Bounds on the locating-domination number and differentiating-total domination number in trees.
Discuss. Math. Graph Theory, 2018
Discuss. Math. Graph Theory, 2018
Discret. Math. Algorithms Appl., 2018
Comput. Sci. J. Moldova, 2018
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
2016
RAIRO Oper. Res., 2016
Electron. J. Graph Theory Appl., 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
Australas. J Comb., 2016
2015
Trees with independent Roman domination number twice the independent domination number.
Discret. Math. Algorithms Appl., 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
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
Discret. Math. Algorithms Appl., 2014
2013
Strong equality between the Roman domination and independent Roman domination numbers in trees.
Discuss. Math. Graph Theory, 2013
2012
Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371].
Discret. Math., 2012
Discret. Appl. Math., 2012
Trees with strong equality between the Roman domination number and the unique response Roman domination number.
Australas. J Comb., 2012
2011
2010
Australas. J Comb., 2010
2009
Discret. Appl. Math., 2009
2006
Australas. J Comb., 2006