M. R. Hooshmandasl

activity

20112021

most citedEntanglement dynamics and position-momentum entropic uncertainty relation of a

Λ

-type three-level atom interacting with a two-mode cavity field in the presence of nonlinearities

63 citations · 100 across the 13 of their papers we have counts for

collaborators

Showing cs.DMShow all

9 papers · 1 filter

cs.DM2018

On Mixed Domination in Generalized Petersen Graphs

M. Rajaati, M. R. Hooshmandasl, M. Alambardar Meybodi +1

Given a graph $G = (V, E)$ , a set $S \subseteq V \cup E$ of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in $S$ happens to be a…

cs.DM2018

Domination Cover Number of Graphs

M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1

A set $D \subseteq V$ for the graph $G = (V, E)$ is called a dominating set if any vertex $v \in V ∖ D$ has at least one neighbor in $D$ . Fomin et al.[9] gave an algorithm for…

cs.DM2018★ 1 cited

On the complexity of the outer-connected bondage and the outer-connected reinforcement problems

M. Hashemipour, M. R. Hooshmandasl, A. Shakiba

Let $G = (V, E)$ be a graph. A subset $S \subseteq V$ is a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$ . A set $D ~ \subseteq V$ of a graph $G…

cs.DM2017

An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs

M. Rajaati, P. Sharifani, A. Shakiba +2

A mixed dominating set $S$ of a graph $G = (V, E)$ is a subset $S \subseteq V \cup E$ such that each element $v \in (V \cup E) ∖ S$ is adjacent or incident to at least one ele…

cs.DM2017

Some Results on [1, k]-sets of Lexicographic Products of Graphs

P. Sharifani, M. R. Hooshmandasl

A subset $S \subseteq V$ in a graph $G = (V, E)$ is called a $[1, k]$ -set, if for every vertex $v \in V ∖ S$ , $1 \leq ∣ N_{G} (v) \cap S ∣ \leq k$ . The $[1, k]$ -domination numbe…

cs.DM2017★ 1 cited

On outer-connected domination for graph products

M. Hashemipour, M. R. Hooshmandasl, A. Shakiba

An outer-connected dominating set for an arbitrary graph $G$ is a set $D ~ \subseteq V$ such that $D ~$ is a dominating set and the induced subgraph $G [V \setminus \ti…

cs.DM2017

A Linear Algorithm for Computing $γ_{[1, 2]}$ -set in Generalized Series-Parallel Graphs

P. Sharifani, M. R. Hooshmandasl

For a graph $G = (V, E)$ , a set $S \subseteq V$ is a $[1, 2]$ -set if it is a dominating set for $G$ and each vertex $v \in V ∖ S$ is dominated by at most two vertices of $S$ , i…

cs.DM2017

An Explicit Construction of Optimal Dominating Sets in Grid

P. Sharifani, M. R. Hooshmandasl, M. Alambardar Meybodi

A dominating set in a graph $G$ is a subset of vertices $D$ such that every vertex in $V ∖ D$ is a neighbor of some vertex of $D$ . The domination number of $G$ is the minimu…

cs.DM2016★ 9 cited

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width

M. Rajaati, M. R. Hooshmandasl, M. J. Dinneen +1

A mixed dominating set for a graph $G = (V, E)$ is a set $S \subseteq V \cup E$ such that every element $x \in (V \cup E) \ S$ is either adjacent or incident to an element o…

On Mixed Domination in Generalized Petersen Graphs

Domination Cover Number of Graphs

On the complexity of the outer-connected bondage and the outer-connected reinforcement problems

An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs

Some Results on [1, k]-sets of Lexicographic Products of Graphs

On outer-connected domination for graph products

A Linear Algorithm for Computing γ[1,2]​-set in Generalized Series-Parallel Graphs

An Explicit Construction of Optimal Dominating Sets in Grid

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width

A Linear Algorithm for Computing $γ_{[1, 2]}$ -set in Generalized Series-Parallel Graphs