M. A. Meybodi

activity

20162026

most citedA note on belief structures and S-approximation spaces

1 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2024

On $[1, 2]$ -Domination in Interval and Circle Graphs

Mohsen Alambardar Meybodi, Abolfazl Poureidi

A subset $S$ of vertices in a graph $G = (V, E)$ is a Dominating Set if each vertex in $V (G) ∖ S$ is adjacent to at least one vertex in $S$ . Chellali et al. in 2013, by restri…

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…

On [1,2]-Domination in Interval and Circle Graphs

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

On $[1, 2]$ -Domination in Interval and Circle Graphs