default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNader Jafari Rad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j99]Elham Mohammadi, Nader Jafari Rad:
On the trees with maximum Cardinality-Redundance number. Comput. Sci. J. Moldova 32(1): 38-45 (2024)- 2023
- [j98]Noor A'lawiah Abd Aziz, Nader Jafari Rad, Hailiza Kamarulhaili:
Roman κ-domination revisited. RAIRO Oper. Res. 57(3): 1209-1217 (2023) - 2022
- [j97]Nader Jafari Rad, Hamid Reza Maimani, Mostafa Momeni, Farhad Rahimi Mahid:
On the double Roman bondage numbers of graphs. Discret. Math. Algorithms Appl. 14(8): 2250046:1-2250046:14 (2022) - [j96]Majid Hajian, Michael A. Henning, Nader Jafari Rad
:
A classification of cactus graphs according to their domination number. Discuss. Math. Graph Theory 42(2): 613-626 (2022) - [j95]Abolfazl Poureidi, Nader Jafari Rad:
Algorithmic aspects of the independent 2-rainbow domination number and independent Roman 2-domination number. Discuss. Math. Graph Theory 42(3): 709-726 (2022) - [j94]Mustapha Chellali, Nader Jafari Rad, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The Roman domatic problem in graphs and digraphs: a survey. Discuss. Math. Graph Theory 42(3): 861-891 (2022) - [j93]Farzaneh Azvin, Nader Jafari Rad:
Bounds on the double Italian domination number of a graph. Discuss. Math. Graph Theory 42(4): 1129-1137 (2022) - [j92]Noor A'lawiah Abd Aziz, Hailiza Kamarulhaili, Farzaneh Azvin, Nader Jafari Rad:
On the outer-independent double Italian domination number. Electron. J. Graph Theory Appl. 10(2): 365-374 (2022) - [j91]Noor A'lawiah Abd Aziz, Michael A. Henning, Nader Jafari Rad, Hailiza Kamarulhaili:
Improved Bounds on the k-tuple (Roman) Domination Number of a Graph. Graphs Comb. 38(3): 75 (2022) - [j90]Noor A'lawiah Abd Aziz, Nader Jafari Rad, Hailiza Kamarulhaili:
A note on the double domination number in maximal outerplanar and planar graphs. RAIRO Oper. Res. 56(5): 3367-3371 (2022) - 2021
- [j89]Ghazale Asemian, Nader Jafari Rad, Abolfazl Tehranian, Hamid Rasouli:
On the total Roman domination stability in graphs. AKCE Int. J. Graphs Comb. 18(3): 166-172 (2021) - [j88]Nader Jafari Rad:
Upper bounds on the global offensive alliances in graphs. Discret. Appl. Math. 289: 148-152 (2021) - [j87]Majid Hajian, Nader Jafari Rad:
Fair total domination number in cactus graphs. Discuss. Math. Graph Theory 41(2): 647-664 (2021) - [j86]Michael A. Henning, Nader Jafari Rad:
Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph. Graphs Comb. 37(1): 325-336 (2021) - 2020
- [j85]Mustapha Chellali, Nader Jafari Rad, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Varieties of Roman domination II. AKCE Int. J. Graphs Comb. 17(3): 966-984 (2020) - [j84]Abolfazl Poureidi, Nader Jafari Rad:
On algorithmic complexity of double Roman domination. Discret. Appl. Math. 285: 539-551 (2020) - [j83]Majid Hajian, Nader Jafari Rad:
A note on the fair domination number in outerplanar graphs. Discuss. Math. Graph Theory 40(4): 1085-1093 (2020) - [j82]Abolfazl Poureidi, Nader Jafari Rad:
Algorithmic and complexity aspects of problems related to total Roman domination for graphs. J. Comb. Optim. 39(3): 747-763 (2020)
2010 – 2019
- 2019
- [j81]Nader Jafari Rad:
Upper bounds on the k-tuple domination number and k-tuple total domination number of a graph. Australas. J Comb. 73: 280-290 (2019) - [j80]Majid Hajian, Nader Jafari Rad, Lutz Volkmann:
Bounds on the fair total domination number in trees and unicyclic graphs. Australas. J Comb. 74: 460-475 (2019) - [j79]Nader Jafari Rad:
New Probabilistic Upper Bounds on the Domination Number of a Graph. Electron. J. Comb. 26(3): 3 (2019) - [j78]Elahe Shabani, Nader Jafari Rad, Abolfazl Poureidi:
Graphs with Large Hop Roman Domination Number. Comput. Sci. J. Moldova 27(1): 3-22 (2019) - [j77]Nader Jafari Rad:
Author-Initiated Retraction: "A remark on the weak Turán's Theorem". Comput. Sci. J. Moldova 27(3): 368 (2019) - [j76]Majid Hajian, Nader Jafari Rad:
A new lower bound on the double domination number of a graph. Discret. Appl. Math. 254: 280-282 (2019) - [j75]Michael A. Henning, Nader Jafari Rad:
A characterization of double Roman trees. Discret. Appl. Math. 259: 100-111 (2019) - [j74]Michael A. Henning, Nader Jafari Rad:
A note on improved upper bounds on the transversal number of hypergraphs. Discret. Math. Algorithms Appl. 11(1): 1950004:1-1950004:6 (2019) - [j73]Nader Jafari Rad, Hadi Rahbani:
A Nordhaus-Gaddum bound for Roman domination. Discret. Math. Algorithms Appl. 11(5): 1950055:1-1950055:11 (2019) - [j72]Nader Jafari Rad, Hadi Rahbani:
Some progress on the double Roman domination in graphs. Discuss. Math. Graph Theory 39(1): 41-53 (2019) - [j71]Majid Hajian, Nader Jafari Rad:
Fair domination number in cactus graphs. Discuss. Math. Graph Theory 39(2): 489-503 (2019) - [j70]Nader Jafari Rad, Elahe Shabani:
On the complexity of some hop domination parameters. Electron. J. Graph Theory Appl. 7(1): 77-89 (2019) - [j69]Hadi Rahbani, Nader Jafari Rad, Seyed Masoud Mirrezaei:
Bounds on the Identifying Codes in Trees. Graphs Comb. 35(3): 599-609 (2019) - [j68]Majid Hajian, Michael A. Henning, Nader Jafari Rad:
A new lower bound on the domination number of a graph. J. Comb. Optim. 38(3): 721-738 (2019) - [j67]Nader Jafari Rad:
On the complexity of multiple bondage in graphs. Theor. Comput. Sci. 796: 180-186 (2019) - [j66]Hadi Rahbani, Nader Jafari Rad, Mohammad-Reza Sadeghi:
A note on the complexity of locating-total domination in graphs. Theor. Comput. Sci. 799: 32-39 (2019) - 2018
- [j65]Noor A'lawiah Abd Aziz, Nader Jafari Rad, Hailiza Kamarulhaili, Roslan Hasni:
Bounds for the Independence Number in k-Step Hamiltonian Graphs. Comput. Sci. J. Moldova 26(1): 15-28 (2018) - [j64]Nader Jafari Rad:
A note on the global offensive alliances in graphs. Discret. Appl. Math. 250: 373-376 (2018) - [j63]Nader Jafari Rad, Elahe Sharifi:
New bounds on the independence number of connected graphs. Discret. Math. Algorithms Appl. 10(5): 1850069:1-1850069:17 (2018) - [j62]Nader Jafari Rad, Hadi Rahbani:
Bounds on the locating Roman dominating number in trees. Discuss. Math. Graph Theory 38(1): 49-62 (2018) - [j61]Nader Jafari Rad, Hadi Rahbani:
Bounds on the locating-domination number and differentiating-total domination number in trees. Discuss. Math. Graph Theory 38(2): 455-462 (2018) - [j60]Angsuman Das, Renu C. Laskar, Nader Jafari Rad:
On α-Domination in Graphs. Graphs Comb. 34(1): 193-205 (2018) - 2017
- [j59]Nader Jafari Rad, Hailiza Kamarulhaili:
On the complexity of some bondage problems in graphs. Australas. J Comb. 68: 265-275 (2017) - [j58]Nader Jafari Rad:
Some notes on the isolate domination in graphs. AKCE Int. J. Graphs Comb. 14(2): 112-117 (2017) - [j57]Nader Jafari Rad:
Roman domination edge critical graphs having precisely two cycles. Ars Comb. 131: 355-372 (2017) - [j56]Nader Jafari Rad, Akbar Jahanbani, Roslan Hasni:
Pentacyclic Graphs with Maximal Estrada Index. Ars Comb. 133: 133-145 (2017) - [j55]Nader Jafari Rad, Elahe Sharifi:
Bounds on the independence number of a graph in terms of order, size and maximum degree. Discret. Appl. Math. 217: 210-219 (2017) - [j54]Nader Jafari Rad, Akbar Jahanbani, Doost Ali Mojdeh:
Tetracyclic graphs with maximal Estrada index. Discret. Math. Algorithms Appl. 9(3): 1750041:1-1750041:18 (2017) - [j53]Majid Hajian, Nader Jafari Rad:
On the Roman domination stable graphs. Discuss. Math. Graph Theory 37(4): 859-871 (2017) - [j52]Nader Jafari Rad:
A note on the edge Roman domination in trees. Electron. J. Graph Theory Appl. 5(1): 1-6 (2017) - [j51]Michael A. Henning, Nader Jafari Rad:
On 2-Step and Hop Dominating Sets in Graphs. Graphs Comb. 33(4): 913-927 (2017) - 2016
- [j50]Nader Jafari Rad:
On the complexity of strong and weak total domination in graphs. Australas. J Comb. 65: 53-58 (2016) - [j49]Elahe Sharifi, Nader Jafari Rad:
A note on the independence number in bipartite graphs. Australas. J Comb. 66: 344-349 (2016) - [j48]Nader Jafari Rad, Hadi Rahbani:
A note on the locating-total domination in trees. Australas. J Comb. 66: 420-424 (2016) - [j47]Nader Jafari Rad, Lutz Volkmann:
Total restrained reinforcement in graphs. AKCE Int. J. Graphs Comb. 13(1): 16-21 (2016) - [j46]Nader Jafari Rad, Sayyed Heidar Jafari:
A note on the intersection graph of subspaces of a vector space. Ars Comb. 125: 401407 (2016) - [j45]Nader Jafari Rad, Lutz Volkmann:
Matchings in 4-total restrained domination vertex critical graphs. Ars Comb. 128: 415-428 (2016) - [j44]Tayebe Balegh, Nader Jafari Rad:
Hat problem on graphs with exactly three cycles. Comput. Sci. J. Moldova 24(2): 243-254 (2016) - [j43]Nader Jafari Rad, Elahe Sharifi, Marcin Krzywkowski:
Domination stability in graphs. Discret. Math. 339(7): 1909-1914 (2016) - [j42]Abdollah Alimadadi, Nader Jafari Rad, Doost Ali Mojdeh:
Various bounds for liar's domination number. Discuss. Math. Graph Theory 36(3): 629-641 (2016) - [j41]Nader Jafari Rad:
On the complexity of reinforcement in graphs. Discuss. Math. Graph Theory 36(4): 877-887 (2016) - [j40]Mohammad Hadi Akhbari, Nader Jafari Rad:
Bounds on weak and strong total domination in graphs. Electron. J. Graph Theory Appl. 4(1): 111-118 (2016) - [j39]Nader Jafari Rad, Lutz Volkmann:
Edge-Removal and Edge-Addition in α-Domination. Graphs Comb. 32(3): 1155-1166 (2016) - [j38]Nader Jafari Rad, Lutz Volkmann:
Generalization of the total outer-connected domination in graphs. RAIRO Oper. Res. 50(2): 233-239 (2016) - 2015
- [j37]Nader Jafari Rad:
Properties of total restrained domination vertex critical graphs. Ars Comb. 122: 275-287 (2015) - [j36]Nader Jafari Rad, Elahe Sharifi:
Bounds on Global Total Domination in Graphs. Comput. Sci. J. Moldova 23(1): 3-10 (2015) - [j35]Mustapha Chellali, Nader Jafari Rad:
Trees with independent Roman domination number twice the independent domination number. Discret. Math. Algorithms Appl. 7(4): 1550048:1-1550048:8 (2015) - [j34]S. F. Forouhandeh, Nader Jafari Rad, R. Pandiyaraj, H. P. Patil, B. Vaqari Motlagh:
A note on total graphs. Discuss. Math. Graph Theory 35(3): 585-587 (2015) - [j33]Nader Jafari Rad:
NP-hardness of multiple bondage in graphs. J. Complex. 31(5): 754-761 (2015) - [i1]Marcin Krzywkowski, Nader Jafari Rad, Sayyed Heidar Jafari:
On the intersection graphs of subspaces of a vector space. CTW 2015: 289-291 - 2014
- [j32]Mustapha Chellali, Nader Jafari Rad:
Trees with unique Roman dominating functions of minimum weight. Discret. Math. Algorithms Appl. 6(3) (2014) - [j31]Changiz Eslahchi, Shahab Haghi, Nader Jafari Rad:
Characterization of cubic graphs G with irt(G)=IRt(G)=2. Discuss. Math. Graph Theory 34(3): 559-565 (2014) - [j30]Mustapha Chellali, Nader Jafari Rad, Suk Jai Seo, Peter J. Slater:
On open neighborhood locating-dominating in graphs. Electron. J. Graph Theory Appl. 2(2): 87-98 (2014) - [j29]Nader Jafari Rad, Joanna Raczek:
Some Progress on Total Bondage in Graphs. Graphs Comb. 30(3): 717-728 (2014) - 2013
- [j28]Mustapha Chellali, Nader Jafari Rad:
On 2-rainbow domination and Roman domination in graphs. Australas. J Comb. 56: 85-94 (2013) - [j27]Michael A. Henning, Nader Jafari Rad:
Bounds on neighborhood total domination in graphs. Discret. Appl. Math. 161(16-17): 2460-2466 (2013) - [j26]Nader Jafari Rad, Lutz Volkmann:
A note on the independent domination number in graphs. Discret. Appl. Math. 161(18): 3087-3089 (2013) - [j25]Nader Jafari Rad, Fatemeh Khosravi:
Limited Dominating Broadcast in graphs. Discret. Math. Algorithms Appl. 5(4) (2013) - [j24]Mustapha Chellali, Nader Jafari Rad:
Strong equality between the Roman domination and independent Roman domination numbers in trees. Discuss. Math. Graph Theory 33(2): 337-346 (2013) - [j23]Nader Jafari Rad, Lutz Volkmann:
Roman Domination Dot-critical Graphs. Graphs Comb. 29(3): 527-533 (2013) - [j22]Yunjian Wu, Nader Jafari Rad:
Bounds on the 2-Rainbow Domination Number of Graphs. Graphs Comb. 29(4): 1125-1133 (2013) - 2012
- [j21]M. Adabi, E. Ebrahimi Targhi, Nader Jafari Rad, M. Saied Moradi:
Properties of independent Roman domination in graphs. Australas. J Comb. 52: 11-18 (2012) - [j20]Mustapha Chellali, Nader Jafari Rad:
k-independence critical graphs. Australas. J Comb. 53: 289-298 (2012) - [j19]Nader Jafari Rad, Chun-Hung Liu:
Trees with strong equality between the Roman domination number and the unique response Roman domination number. Australas. J Comb. 54: 133-140 (2012) - [j18]Mustapha Chellali, Nader Jafari Rad, Abdollah Khodkar:
On 3-yt-vertex critical graphs of diameter three. Discret. Appl. Math. 160(4-5): 676-681 (2012) - [j17]Michael A. Henning, Nader Jafari Rad:
On α-total domination in graphs. Discret. Appl. Math. 160(7-8): 1143-1151 (2012) - [j16]Michael A. Henning, Nader Jafari Rad:
Locating-total domination in graphs. Discret. Appl. Math. 160(13-14): 1986-1993 (2012) - [j15]Abdollah Alimadadi, Changiz Eslahchi, Teresa W. Haynes, Michael A. Henning, Nader Jafari Rad, Lucas C. van der Merwe:
Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371]. Discret. Math. 312(5): 1076 (2012) - [j14]Johannes H. Hattingh, Nader Jafari Rad, Sayyed Heidar Jafari, Marc Loizeaux, John Matthews, Lucas C. van der Merwe:
Total edge critical graphs with leaves. Discret. Math. 312(24): 3482-3488 (2012) - 2011
- [j13]Nader Jafari Rad:
Critical concept for 2-rainbow domination in graphs. Australas. J Comb. 51: 49-60 (2011) - [j12]Michael A. Henning, Nader Jafari Rad:
Total domination dot-critical graphs. Discret. Appl. Math. 159(2-3): 104-111 (2011) - [j11]E. Ebrahimi Targhi, Nader Jafari Rad, Lutz Volkmann:
Unique response Roman domination in graphs. Discret. Appl. Math. 159(11): 1110-1117 (2011) - [j10]Michael A. Henning, Nader Jafari Rad, Joanna Raczek:
A note on total reinforcement in graphs. Discret. Appl. Math. 159(14): 1443-1446 (2011) - [j9]Nader Jafari Rad, Lutz Volkmann:
Roman bondage in graphs. Discuss. Math. Graph Theory 31(4): 763-773 (2011) - [j8]Nader Jafari Rad, Lutz Volkmann:
On the Roman Bondage Number of Planar Graphs. Graphs Comb. 27(4): 531-538 (2011) - 2010
- [j7]Nader Jafari Rad:
Characterization of total restrained domination edge critical unicyclic graphs. Australas. J Comb. 47: 77-82 (2010) - [j6]Nader Jafari Rad:
Bicritical total domination. Australas. J Comb. 47: 217-226 (2010)
2000 – 2009
- 2009
- [j5]Mustapha Chellali, Nader Jafari Rad:
Locating-total domination critical graphs. Australas. J Comb. 45: 227-234 (2009) - [j4]Nader Jafari Rad:
On the diameter of a domination dot-critical graph. Discret. Appl. Math. 157(7): 1647-1649 (2009) - [j3]Michael A. Henning, Nader Jafari Rad:
On total domination vertex critical graphs of high connectivity. Discret. Appl. Math. 157(8): 1969-1973 (2009) - 2006
- [j2]Doost Ali Mojdeh, Nader Jafari Rad, Abdollah Khodkar:
The defining numbers for vertex colorings of certain graphs. Australas. J Comb. 35: 17-30 (2006) - [j1]Doost Ali Mojdeh, Nader Jafari Rad:
On the total domination critical graphs. Electron. Notes Discret. Math. 24: 89-92 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-10 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
