Doost Ali Mojdeh

Orcid: 0000-0001-9373-3390

According to our database1, Doost Ali Mojdeh authored at least 46 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Further results on (total) restrained Italian domination.
Discret. Math. Algorithms Appl., February, 2024

Edge-locating coloring of graphs.
Electron. J. Graph Theory Appl., 2024

Total vertex product irregularity strength of graphs.
Discuss. Math. Graph Theory, 2024

2023
Outer independent double Italian domination: Complexity, characterization.
Discret. Math. Algorithms Appl., April, 2023

Further results on 2-distance coloring of graphs.
J. Comb. Optim., 2023

Total 2-domination number in digraphs and its dual parameter.
Discuss. Math. Graph Theory, 2023

Global offensive k-alliances in digraphs.
Bull. ICA, 2023

Restrained condition on double Roman dominating functions.
Appl. Math. Comput., 2023

Perfect double Italian domination of a graph.
AKCE Int. J. Graphs Comb., 2023

2022
On the conjectures of neighbor locating coloring of graphs.
Theor. Comput. Sci., 2022

Restrained double Roman domination of a graph.
RAIRO Oper. Res., 2022

Further results on packing related parameters in graphs.
Discuss. Math. Graph Theory, 2022

2021
Restrained Italian domination in graphs.
RAIRO Oper. Res., 2021

Unique response strong Roman dominating functions of graphs.
Electron. J. Graph Theory Appl., 2021

On three outer-independent domination related parameters in graphs.
Discret. Appl. Math., 2021

Covering Italian domination in graphs.
Discret. Appl. Math., 2021

2020
Total Roman {3}-domination in Graphs.
Symmetry, 2020

Global defensive <i>k</i>-alliances in directed graphs: combinatorial and computational issues.
RAIRO Oper. Res., 2020

On the distance domination number of bipartite graphs.
Electron. J. Graph Theory Appl., 2020

(Open) packing number of some graph products.
Discret. Math. Theor. Comput. Sci., 2020

Roman 2-bondage number of a graph.
Discuss. Math. Graph Theory, 2020

Addendum: "The signed bad numbers in graphs".
Discret. Math. Algorithms Appl., 2020

Roman {3}-domination (double Italian domination).
Discret. Appl. Math., 2020

Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs.
Contributions Discret. Math., 2020

2019
Packing parameters in graphs: new bounds and a solution to an open problem.
J. Comb. Optim., 2019

Outer independent global dominating set of trees and unicyclic graphs.
Electron. J. Graph Theory Appl., 2019

Packing and domination parameters in digraphs.
Discret. Appl. Math., 2019

Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination.
IEEE Access, 2019

2017
New bound on MIS and MIN-CDS for a unit ball graph.
ICT Express, 2017

On the signed 2-independence number of graphs.
Electron. J. Graph Theory Appl., 2017

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

New and improved results on the signed (total) k-domination number of graphs.
Discret. Math. Algorithms Appl., 2017

Limited packing vs tuple domination in graphs.
Ars Comb., 2017

2016
New bounds on the signed total domination number of graphs.
Discuss. Math. Graph Theory, 2016

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

Liar's dominating sets in graphs.
Discret. Appl. Math., 2016

Neighborhood total domination of a graph and its complement.
Australas. J Comb., 2016

Trees with the same global domination number as their square.
Australas. J Comb., 2016

2010
On questions on (total) domination vertex critical graphs.
Ars Comb., 2010

On connected (γ, k)-critical graphs.
Australas. J Comb., 2010

2009
Defining numbers in some of the Harary graphs.
Appl. Math. Lett., 2009

2007
Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3).
Ars Comb., 2007

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

Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph.
Discuss. Math. Graph Theory, 2006

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

On conjectures on the defining set of (vertex) graph colourings.
Australas. J Comb., 2006


  Loading...