M. A. Meybodi

collaborators

3 papers

cs.CC2021

W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs

Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba

A set $D \subseteq V$ of a graph $G = (V, E)$ is called an outer-connected dominating set of $G$ if every vertex $v$ not in $D$ is adjacent to at least one vertex in $D$ , and the in…

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…