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 2018Show all

8 papers · 1 filter

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…

math.CO2018

Bounds on the nonnegative signed domination number of graphs

Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann

The aim of this work is to investigate the nonnegative signed domination number $γ_{s}^{N N}$ with emphasis on regular, ( $r + 1$ )-clique-free graphs and trees. We give lower and upper b…

math.CO2018

Some notes on the signed bad number in bipartite graphs

Doost Ali Mojdeh, Babak Samadi

In this paper, we deal with the signed bad number and the negative decision number of graphs. We show that two upper bounds concerning these two parameters for bipartite graphs in…

math.CO2018★ 4 cited

Packing and domination parameters in digraphs

Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero

Given a digraph $D = (V, A)$ , a set $B \subset V$ is a packing set in $D$ if there are no arcs joining vertices of $B$ and for any two vertices $x, y \in B$ the sets of in-neighbors of $…

math.CO2018★ 3 cited

Domination Critical Knodel Graphs

D. A. Mojdeh, S. R. Musawi, E. Nazari

A set $D$ of vertices of a graph $G$ is a dominating set if each vertex of $V (G) ∖ D$ is adjacent to some vertex of $D$ . The domination number of $G$ , $γ (G)$ , is the minimum…

math.CO2018

On the distance domination number of bipartite graphs

D. A. Mojdeh, S. R. Musawi, E. Nazari

A subset $D \subseteq V (G)$ is called a $k$ -distance dominating set of $G$ if every vertex in $V (G) ∖ D$ is within distance $k$ from some vertex of $D$ . The minimum cardinali…