A set S âŠ† V of the graph G = (V,E) is called a [1, 2]-set of G if any vertex which is not in S has at least one but no more than two neighbors in S. A set Sï¿½ âŠ† V is called a [1, 2]-total set of G ifâ€¦ (More)

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 probabilities and haveâ€¦ (More)