9 citations · 12 across the 9 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DM2018
Domination Cover Number of Graphs
M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1
A set for the graph is called a dominating set if any vertex has at least one neighbor in . 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…
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 be a graph. A subset is a dominating set of if every vertex not in is adjacent to a vertex in . A set of a graph $G…