in this work, we define a fuzzy soft set theory and its related properties. we then define fuzzy soft aggregation operator that allows constructing more efficient decision making method. finally, we give an example which shows that the method can be successfully applied to many problems that contain uncertainties.

The bijective connection graph encompasses a family of cube-based topologies, and $n$ -dimensional graphs include the hypercube almost all its variants with order notation="LaTeX">$2^{n}$ degree . Hence, it is important to design implement algorithms that work in grap...

‎Let $X$ be a real normed  space, then  $C(subseteq X)$  is  functionally  convex  (briefly, $F$-convex), if  $T(C)subseteq Bbb R $ is  convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$  is  functionally   closed (briefly, $F$-closed), if  $T(K)subseteq Bbb R $ is  closed  for all bounded linear transformations $Tin B(X,R)$. We improve the    Krein-Milman theorem  ...

In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.