D. Mojdeh

activity

20152026

most citedOn three outer-independent domination related parameters in graphs

16 citations · 73 across the 33 of their papers we have counts for

collaborators

Showing math.COShow all

34 papers · 1 filter

math.CO2026

Pollyanna and Polynomially \c{hi}-Bounded Graph Classes

Narjes Rahimi, D. A. Mojdeh

A hereditary graph class is called polynomially $χ$ -bounded if there exists a polynomial function $f$ such that $χ (G) \leq f (ω (G))$ for every induced subgraph $G$ . A class $\mathcal…

math.CO2025

Towards Esperet's Conjecture: Polynomial $χ$ -Bounds for Structured Graph Classes

N. Rahimi, D. A. Mojdeh

In this paper, we establish that the class of ${P_{6}, (2, 2) -broom}$ -free graphs contains a subclass $L_{i}$ , defined by certain cutset conditions, whose chromatic n…

math.CO2025

On the analogue of Esperet's conjecture: Characterizing hereditary classes

N. Rahimi, D. A. Mojdeh

In the paper [J. Graph Theory (2023) 102:458-471, the Esperet's conjecture has been posed: Every $χ$ -bounded hereditary class is poly- $χ$ -bounded]. This conjecture was first posed…

math.CO2025

Total perfect codes in Cayley sum graphs of cyclic groups

Masoumeh Koohestani, Doost Ali Mojdeh, Mohsen Ghasemi

We consider Cayley sum graphs over the cyclic group $Z_{n}$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these…

math.CO2025

Global coalitions in graphs

Nazli Besharati, Doost Ali Mojdeh, Mohammad Reza Samadzadeh +1

Let $G = (V, E)$ be a graph. A subset $S \subseteq V$ is called a global dominating set of $G$ if it is a dominating set of both $G$ and its complement $G$ . Two disjoint s…

math.CO2025

Some results on perfect codes in Cayley sum graphs

Masoumeh Koohestani, Doost Ali Mojdeh, Mohsen Ghasemi +1

We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.

math.CO2024

Perfect coalition in graphs

Doost Ali Mojdeh, Mohammad Reza Samadzadeh

\noindent A perfect dominating set in a graph $G = (V, E)$ is a subset $S \subseteq V$ such that each vertex in $V ∖ S$ has exactly one neighbor in $S$ . A perfect coalition in…

math.CO2024

e-injective coloring: injective and 2-distance colorings conjectures

Shahrzad Sadat Mirdamad, Doost Ali Mojdeh

An injective coloring of a given graph G = (V, E) is a vertex coloring of G such that any two vertices with common neighbor receive distinct colors. An e-injective coloring of a gr…

math.CO2024

Paired coalition in graphs

Mohammad Reza Samadzadeh, Doost Ali Mojdeh, Reza Nadimi

\noindent A paired coalition in a graph $G = (V, E)$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$ , neither of which is a paired dominating set but whose union $V_1 \cup V…

math.CO2023

Independent coalition in graphs: existence and characterization

Mohammad Reza Samadzadeh, Doost Ali Mojdeh

An independent coalition in a graph $G$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$ neither of which is an independent dominating set but whose union $V_{1} \cup V_{2}$ i…

math.CO2022

Majority dominator colorings of graphs

Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

Let $G$ be a simple graph of order $n$ . A majority dominator coloring of a graph $G$ is proper coloring in which each vertex of the graph dominates at least half of one color class…

math.CO2021

Revisiting $k$ -tuple dominating sets with emphasis on small values of $k$

Babak Samadi, Nasrin Soltankhah, Doost Ali Mojdeh

For any graph $G$ of order $n$ with degree sequence $d_{1} \geq \dots \geq d_{n}$ , we define the double Slater number $s ℓ_{\times 2} (G)$ as the smallest integer $t$ such that $t+d_…

math.CO2021★ 5 cited

Restrained condition on double Roman dominating functions

Babak Samadi, Nasrin Soltankhah, H. Abdollahzadeh Ahangar +4

We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double…

math.CO2021

Restrained double Roman domination of a graph

Doost Ali Mojdeh, Iman Masoumi, Lutz Volkmann

For a graph G=(V,E), a restrained double Roman dominating function is a function f:V\rightarrow\{0,1,2,3\} having the property that if f(v)=0, then the vertex v must have at least…

math.CO2020★ 15 cited

Restrained Italian domination in graphs

Babak Samadi, Morteza Alishahi, Iman Masoumi +1

For a graph $G = (V (G), E (G))$ , an Italian dominating function (ID function) $f : V (G) \to {0, 1, 2}$ has the property that for every vertex $v \in V (G)$ with $f (v) = 0$ , either $v$ …

math.CO2020★ 7 cited

Covering Italian domination in graphs

Abdollah Khodkar, Doost Ali Mojdeh, Babak Samadi +1

For a graph $G = (V (G), E (G))$ , an Italian dominating function (ID function) of $G$ is a function $f : V (G) \to {0, 1, 2}$ such that for each vertex $v \in V (G)$ with $f (v) = 0$ , $f…

math.CO2019

Total vertex product irregularity strength of graphs

Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

Consider a simple graph $G$ . We call a labeling $w : E (G) \cup V (G) \to {1, 2, \dots, s}$ (\textit{total vertex}) \textit{product-irregular}, if all product degrees $p d_{G} (v)$ …

math.CO2019

On the upper Bound of double Roman dominating function

Atieh Teimourzadeh, Doost Ali Mojdeh

A double Roman Dominating function on a graph $G$ is a function $f : V \to {0, 1, 2, 3}$ such that the following conditions hold. If $f (v) = 0$ , then vertex $v$ must have at lea…

math.CO2019

The Laplacian eigenvalue 2 of bicyclic graphs

Doost Ali Mojdeh, Mohammad Habibi, Masoumeh Farkhondeh

If $G$ is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs $G_{1}$ and $G_{2}$ i…

math.CO2019★ 1 cited

Double domination and total $2$ -domination in digraphs and their dual problems

Doost Ali Mojdeh, Babak Samadi

A subset $S$ of vertices of a digraph $D$ is a double dominating set (total $2$ -dominating set) if every vertex not in $S$ is adjacent from at least two vertices in $S$ , and every…

math.CO2019★ 1 cited

Global offensive $k$ -alliances in digraphs

Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero

In this paper, we initiate the study of global offensive $k$ -alliances in digraphs. Given a digraph $D = (V (D), A (D))$ , a global offensive $k$ -alliance in a digraph $D$ is a subset $S…

math.CO2019

Independent double Roman domination in graphs

Doost Ali Mojdeh, Zhila Mansouri

An independent double Roman dominating function (IDRDF) on a graph $G = (V, E)$ is a function $f : V (G) \to {0, 1, 2, 3}$ having the property that if $f (v) = 0$ , then the vertex $v$ …

math.CO2019★ 1 cited

(Open) packing number of some graph products

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1

The packing number of a graph $G$ is the maximum number of closed neighborhoods of vertices in $G$ with pairwise empty intersections. Similarly, the open packing number of $G$ is t…

math.CO2018★ 16 cited

On three outer-independent domination related parameters in graphs

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1

Let $G$ be a graph and let $S \subseteq V (G)$ . The set $S$ is a double outer-independent dominating set of $G$ if $∣ N [v] \cap D ∣ \geq 2$ , for all $v \in V (G)$ , and $V (G) ∖ S$ is…

Pollyanna and Polynomially \c{hi}-Bounded Graph Classes

Towards Esperet's Conjecture: Polynomial χ-Bounds for Structured Graph Classes

On the analogue of Esperet's conjecture: Characterizing hereditary classes

Total perfect codes in Cayley sum graphs of cyclic groups

Global coalitions in graphs

Some results on perfect codes in Cayley sum graphs

Perfect coalition in graphs

e-injective coloring: injective and 2-distance colorings conjectures

Paired coalition in graphs

Independent coalition in graphs: existence and characterization

Majority dominator colorings of graphs

Revisiting k-tuple dominating sets with emphasis on small values of k

Restrained condition on double Roman dominating functions

Restrained double Roman domination of a graph

Restrained Italian domination in graphs

Covering Italian domination in graphs

Total vertex product irregularity strength of graphs

On the upper Bound of double Roman dominating function

The Laplacian eigenvalue 2 of bicyclic graphs

Double domination and total 2-domination in digraphs and their dual problems

Global offensive k-alliances in digraphs

Independent double Roman domination in graphs

(Open) packing number of some graph products

On three outer-independent domination related parameters in graphs

Towards Esperet's Conjecture: Polynomial $χ$ -Bounds for Structured Graph Classes

Revisiting $k$ -tuple dominating sets with emphasis on small values of $k$

Double domination and total $2$ -domination in digraphs and their dual problems

Global offensive $k$ -alliances in digraphs