default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDoost Ali Mojdeh
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j46]A. M. Ridha Abdulhasan, Doost Ali Mojdeh
:
Further results on (total) restrained Italian domination. Discret. Math. Algorithms Appl. 16(2): 2350017:1-2350017:16 (2024)- [j45]Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh:
Total vertex product irregularity strength of graphs. Discuss. Math. Graph Theory 44(4): 1261-1276 (2024) - [j44]Meysam Korivand, Doost Ali Mojdeh, Edy Tri Baskoro, Ahmad Erfanian:
Edge-locating coloring of graphs. Electron. J. Graph Theory Appl. 12(1): 55-73 (2024) - 2023
- [j43]Guoliang Hao, Parvin Jalilolghadr, Doost Ali Mojdeh:
Perfect double Italian domination of a graph. AKCE Int. J. Graphs Comb. 20(3): 247-257 (2023) - [j42]Babak Samadi, Nasrin Soltankhah, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Doost Ali Mojdeh, Seyed Mahmoud Sheikholeslami, Juan Carlos Valenzuela Tripodoro:
Restrained condition on double Roman dominating functions. Appl. Math. Comput. 438: 127554 (2023) - [j41]Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Global offensive k-alliances in digraphs. Bull. ICA 97: 67-82 (2023) - [j40]R. Jalaei, Doost Ali Mojdeh:
Outer independent double Italian domination: Complexity, characterization. Discret. Math. Algorithms Appl. 15(3): 2250085:1-2250085:13 (2023) - [j39]Doost Ali Mojdeh, Babak Samadi:
Total 2-domination number in digraphs and its dual parameter. Discuss. Math. Graph Theory 43(3): 587-606 (2023) - [j38]Doost Ali Mojdeh, Babak Samadi:
Further results on 2-distance coloring of graphs. J. Comb. Optim. 45(1): 7 (2023) - 2022
- [j37]Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Further results on packing related parameters in graphs. Discuss. Math. Graph Theory 42(2): 333-348 (2022) - [j36]Doost Ali Mojdeh, Iman Masoumi, Lutz Volkmann:
Restrained double Roman domination of a graph. RAIRO Oper. Res. 56(4): 2293-2304 (2022) - [j35]Doost Ali Mojdeh:
On the conjectures of neighbor locating coloring of graphs. Theor. Comput. Sci. 922: 300-307 (2022) - 2021
- [j34]Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero:
On three outer-independent domination related parameters in graphs. Discret. Appl. Math. 294: 115-124 (2021) - [j33]Abdollah Khodkar, Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Covering Italian domination in graphs. Discret. Appl. Math. 304: 324-331 (2021) - [j32]Doost Ali Mojdeh, Guoliang Hao, Iman Masoumi, Ali Parsian:
Unique response strong Roman dominating functions of graphs. Electron. J. Graph Theory Appl. 9(2): 469-484 (2021) - [j31]Babak Samadi, Morteza Alishahi, Iman Masoumi, Doost Ali Mojdeh:
Restrained Italian domination in graphs. RAIRO Oper. Res. 55(2): 319-332 (2021) - 2020
- [j30]Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann:
Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs. Contributions Discret. Math. 15(1): 154-162 (2020) - [j29]Doost Ali Mojdeh, Lutz Volkmann:
Roman {3}-domination (double Italian domination). Discret. Appl. Math. 283: 555-564 (2020) - [j28]Doost Ali Mojdeh, Babak Samadi:
Addendum: "The signed bad numbers in graphs". Discret. Math. Algorithms Appl. 12(02): 2092001 (2020) - [j27]Doost Ali Mojdeh, Ahmad Moradi, Omid Sharifi:
Roman 2-bondage number of a graph. Discuss. Math. Graph Theory 40(1): 255-268 (2020) - [j26]Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero:
(Open) packing number of some graph products. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j25]Doost Ali Mojdeh, Seyed Reza Musawi, Esmaeil Nazari:
On the distance domination number of bipartite graphs. Electron. J. Graph Theory Appl. 8(2): 353-364 (2020) - [j24]Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Global defensive k-alliances in directed graphs: combinatorial and computational issues. RAIRO Oper. Res. 54(4): 1027-1040 (2020) - [j23]Zehui Shao, Doost Ali Mojdeh, Lutz Volkmann:
Total Roman {3}-domination in Graphs. Symmetry 12(2): 268 (2020)
2010 – 2019
- 2019
- [j22]Doost Ali Mojdeh, Mohammad Habibi, Leila Badakhshian, Yongsheng Rao:
Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination. IEEE Access 7: 94143-94149 (2019) - [j21]Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Packing and domination parameters in digraphs. Discret. Appl. Math. 269: 184-192 (2019) - [j20]Doost Ali Mojdeh, Morteza Alishahi:
Outer independent global dominating set of trees and unicyclic graphs. Electron. J. Graph Theory Appl. 7(1): 121-145 (2019) - [j19]Doost Ali Mojdeh, Babak Samadi:
Packing parameters in graphs: new bounds and a solution to an open problem. J. Comb. Optim. 38(3): 739-747 (2019) - 2017
- [j18]Doost Ali Mojdeh, Babak Samadi, S. M. Hosseini Moghaddam:
Limited packing vs tuple domination in graphs. Ars Comb. 133: 155-161 (2017) - [j17]Doost Ali Mojdeh, Babak Samadi:
New and improved results on the signed (total) k-domination number of graphs. Discret. Math. Algorithms Appl. 9(2): 1750024:1-1750024:10 (2017) - [j16]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) - [j15]S. M. Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann:
On the signed 2-independence number of graphs. Electron. J. Graph Theory Appl. 5(1): 36-42 (2017) - [j14]Doost Ali Mojdeh, M. Ghanbari, M. Ramezani:
New bound on MIS and MIN-CDS for a unit ball graph. ICT Express 3(3): 115-118 (2017) - 2016
- [j13]Doost Ali Mojdeh, M. R. Sayed Salehi, Mustapha Chellali:
Neighborhood total domination of a graph and its complement. Australas. J Comb. 65: 37-44 (2016) - [j12]Doost Ali Mojdeh, Morteza Alishahi, Mustapha Chellali:
Trees with the same global domination number as their square. Australas. J Comb. 66: 288-309 (2016) - [j11]Abdollah Alimadadi, Mustapha Chellali, Doost Ali Mojdeh:
Liar's dominating sets in graphs. Discret. Appl. Math. 211: 204-210 (2016) - [j10]Seyyed Mehdi Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann:
New bounds on the signed total domination number of graphs. Discuss. Math. Graph Theory 36(2): 467-477 (2016) - [j9]Abdollah Alimadadi, Nader Jafari Rad, Doost Ali Mojdeh:
Various bounds for liar's domination number. Discuss. Math. Graph Theory 36(3): 629-641 (2016) - 2010
- [j8]Doost Ali Mojdeh, P. Firoozi, Roslan Hasni:
On connected (γ, k)-critical graphs. Australas. J Comb. 46: 25-36 (2010) - [j7]Doost Ali Mojdeh, Roslan Hasni:
On questions on (total) domination vertex critical graphs. Ars Comb. 96 (2010)
2000 – 2009
- 2009
- [j6]Doost Ali Mojdeh, Adel P. Kazemi:
Defining numbers in some of the Harary graphs. Appl. Math. Lett. 22(6): 922-926 (2009) - 2007
- [j5]Doost Ali Mojdeh, A. Ahmadi Haji, Hossein Abdollahzadeh Ahangar, Abdollah Khodkar:
Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3). Ars Comb. 84 (2007) - 2006
- [j4]Doostali Mojdeh:
On conjectures on the defining set of (vertex) graph colourings. Australas. J Comb. 34: 153-160 (2006) - [j3]Doost Ali Mojdeh, Nader Jafari Rad, Abdollah Khodkar:
The defining numbers for vertex colorings of certain graphs. Australas. J Comb. 35: 17-30 (2006) - [j2]Doostali Mojdeh:
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph. Discuss. Math. Graph Theory 26(1): 59-72 (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 2025-03-24 00:29 CET 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:
