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

3 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.AI2018★ 1 cited

A note on belief structures and S-approximation spaces

Ali Shakiba, Amir Kafshdar Goharshady, MohammadReza Hooshmandasl +1

We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempster's multivalued mappings and lower and upper probabi…