Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices u, v, w ∈ V (D), (u, v), (v, w) ∈ A(D) implies that (u,w) ∈ A(D). This concept can be generalized as follows: A digraph is k-transitive if for every u, v ∈ V (D), the existence of a uv-directed path of length k in D implies that (u, v) ∈...

This paper investigates roughness of fuzzy soft sets. A pair of fuzzy soft rough approximations is proposed and their properties are given. Based on fuzzy soft rough approximations, the concept of fuzzy soft rough sets is introduced. New types of fuzzy soft sets such as full, intersection complete and union complete fuzzy soft sets are defined and supported by some illustrative examples. We obt...

In this paper, we introduce soft sets over 2 where 2 is the power set of the universe U , propose some operations on soft sets over 2 and investigate some types of soft sets over 2 such as keeping intersection and keeping union. We obtain lattice and topological structures of soft sets over 2 . We consider soft rough approximations and soft rough sets, and obtain structures of soft rough sets. ...

The purpose of this research is to interpolate bipolarity into the definition vague soft set. This gives a new more applicable, flexible, and generalized extension set, fuzzy or even which bipolar In addition, types sets, as well some related concepts operations are established with examples. Moreover, properties sets including absorption, commutative, associative, distributive, De Morgan’s law...

Soft sets, as a mathematical tool for dealing with uncertainty, have recently gained considerable attention, including some successful applications in information processing, decision, demand analysis, and forecasting. To construct new soft sets from given soft sets, some operations on soft sets have been proposed. Unfortunately, such operations cannot keep all classical set-theoretic laws true...