Punjab University Journal of Mathematics (2021),53(7),511-526

https://doi.org/10.52280/pujm.2021.530705

Theory of Bijective Hypersoft Set with Application in Decision Making

Atiqe Ur Rahman 1 , Muhammad Saeed 2,∗ , Abida Hafeez 3

1,2,3
Department of Mathematics,
University of Management and Technology, Lahore, Pakistan,
Email: aurkhb@gmail.com 1 , muhammad.saeed@umt.edu.pk 2,∗ ,
f2019109046@umt.edu.pk 3

Received: 06 March,2021 / Accepted: 17 June, 2021 / Published online:27 July, 2021

Abstract.: Hypersoft set (an extension of soft set) is a new mathemati-

cal tool to tackle the inadequacy of soft set for attribute-valued sets. In
this study, concept of bijective hypersoft set is proposed and some of its
set theoretic operations like restricted-AND and relaxed-AND, are char-
acterized. Moreover, new operations of bijective hypersoft set such as de-
pendency, decision system, significance of decision system, reduced de-
cision system and decision rules in decision system, are discussed with
illustrated examples. A decision making algorithm and application are
discussed with the support of these proposed operations.

AMS (MOS) Subject Classification Codes: 91B06; 93E25

Key Words: Soft set, Bijective soft set, Hypersoft set, Bijective hypersoft set, Bijective
hypersoft decision system.

1. I NTRODUCTION
In 1999, Molodtsov [19] developed a new structure known as soft set in literature to
address the shortcoming of the existing structures (i.e. fuzzy set, intuitionistic fuzzy etc.)
dealing with uncertain and vague data of information. He provided a strong basis for para-
meterized interpretation of hesitant information through the introduction of this structure.
Later on, Maji et al. [17] investigated different elementary essentials i.e. properties, set
theoretic operations, laws and results of soft set for its further implementation in certain
disciplines. In 2005, Pei et al. [22] illustrated the relational concept between soft sets and
information systems. They confirmed the validity of the soft set as a parameterized family
of special information system. The researchers Ali et al. [2], Babitha et al. [3, 4], Sezgin et
al. [39], Ge et al. [6] and Li [16] studied soft set professionally and extended the concept
with the introduction of certain new features i.e. restrictedness on operations, set relation
and function. Saeed et al. [29] explored the concept of soft elements and soft members un-
der soft set environment. Kamacı et al. [9, 10, 11, 12] developed bijective soft matrix theory
with multi-bijective linguistic soft decision, investigated difference operations of soft ma-
trices with applications in decision making system, introduced N -soft algebraic structures,

511
512 A.U.Rahman, M.Saeed and A.Hafeez

and discussed bipolar N -soft set theory with applications respectively. Petchimuthu et al.
[23] made valuable discussion on the row-products of inverse soft matrices with application
in multicriteria decision making. Many researchers [14, 5, 15, 21, 1, 43] expanded soft set
theory with the development of soft-like hybrids to have useful results as well as utilization
in decision making problems. Gong et al. [7] introduced the concept of bijective soft set
and investigated its some properties.
In 2018, Smarandache [40] developed a new structure hypersoft set (HSS) to adequate the
soft set for multi attribute-valued functions. In 2020, Saeed et al. [30, 31] characterized
the necessary basic axioms, properties, laws and set theoretic operations of HSS with the
help of appropriate examples. In 2020, Rahman et al. [24, 25] enhanced the study of HSS
to develop fuzzy-like structures with complex sets and also studied certain properties of
convexity under HSS-environment. In 2021, Rahman et al. [26, 27, 28] studied decision
making applications based on neutrosophic parameterized hypersoft Set, fuzzy parameter-
ized hypersoft set and rough hypersoft set. Saeed et al. [32, 33, 34, 35] discussed decision
making techniques for mappings on hypersoft classes, neutrosophic hypersoft mapping and
complex multi-fuzzy hypersoft set. They also developed hypersoft graphs with some prop-
erties. Ihsan et al. [8] investigated hypersoft expert set with application in decision making
for the best selection of product. Yolcu et al. [41, 42] conceptualized the theories of fuzzy
and intuitionistic fuzzy hypersoft sets with their employment in decision making. Ozturk
et al. [20] introduced neutrosophic hypersoft topological spaces and discussed their impor-
tant properties. Saqlain et al. [36, 37, 38] developed single and multi-valued neutrosophic
hypersoft sets along with calculation of tangent similarity measure of single valued neutro-
sophic hypersoft sets, characterized aggregate operators of neutrosophic hypersoft set and
employed TOPSIS method for neutrosophic hypersoft sets using accuracy function with
application. Martin et al. [18] investigated concentric plithogenic hypergraph based on
plithogenic hypersoft sets. Kamacı [13] made very valuable research on the hybrid struc-
tures of hypersoft sets and rough sets.
In many real life situations, distinct attributes are further partitioned into disjoint attribute-
valued sets. Decision makers may suffer some kind of inclination and penchant while
ignoring such partitioning of attributes during the judgment. The existing soft set theory
is not projected for such sets. Therefore a new structure demands its place in literature for
addressing such impediment, so hypersoft set theory is conceptualized to tackle such situ-
ations. This novel structure has increased the flexibility and reliability of decision making
process. It not only addresses the inadequacy of existing soft-like structures for multi-
argument approximate functions but also helps the decision makers to decide the matters
with deep observation. In this study, a new type of hypersoft set, bijective hypersoft set
(BHSS), is characterized which assigns the disjoint approximate sets to each tuple in the
cartesian product of attribute-valued sets. Moreover, certain elementary properties are in-
vestigated with supporting examples. A decision system is developed based on set theoretic
operations of BHSS and is applied in decision making with illustrated example.
The rest of the paper is organized as:
In section 2, some fundamental definitions and terms are recalled from already published
relevant literature, section 3 formulates the theory of bijective hypersoft set and its deci-
sion system, section 4 proposes a decision-making algorithm with application for the best
Theory of Bijective Hypersoft Set with Application in Decision Making 513

selection of an appropriate product and finally, section 5 concludes the paper with future
directions.

2. P RELIMINARIES
In this section, we present some basic terminologies for proper understanding of the
proposed work. Throughout the paper, U denotes the universe of discourse.
Definition 1. [19]
A pair (ζS , Λ) is called a soft set over U, where ζS : Λ → P(U) and Λ be a set of attributes
of U.
Definition 2. [17]
A soft set (ζS1 , Λ1 ) is a soft subset of another soft set (ζS2 , Λ2 ) if
(i) Λ1 ⊆ Λ2 , and
(ii) ζS1 (ω) ⊆ ζS2 (ω) for all ω ∈ Λ1 .
Definition 3. [17]
Union of two soft sets (ζS1 , Λ1 ) and (ζS2 , Λ2 ) is a soft set (ζS3 , Λ3 ) with Λ3 = Λ1 ∪ Λ2
and for ω ∈ Λ3 ,

 ζS1 (ω) ω ∈ (Λ1 \ Λ2 )
ζS3 (ω) = ζS2 (ω) ω ∈ (Λ2 \ Λ1 )

ζS1 (ω) ∪ ζS2 (ω) ω ∈ (Λ1 ∩ Λ2 )
Definition 4. [17]
Intersection of two soft sets (ζS1 , Λ1 ) and (ζS2 , Λ2 ) is a soft set (ζS3 , Λ3 ) with Λ3 =
Λ1 ∩ Λ2 and for ω ∈ Λ3 ,
ζS3 (ω) = ζS1 (ω) ∩ ζS2 (ω)
Definition 5. [17]
AND operation of two soft sets (ζS1 , Λ1 ) and (ζS2 , Λ2 ), denoted by (ζS1 , Λ1 ) ∧ (ζS2 , Λ2 ),
is a soft set (ζS3 , Λ3 ) with Λ3 = Λ1 × Λ2 and for ω ∈ Λ3 ,
ζS3 (ω) = ζS1 (ω) ∩ ζS2 (ω)
For more details on soft set, see [19, 17, 22, 2, 3, 4, 39, 6, 16]
Definition 6. [7]
A soft set (ζS , Λ) is said to be a bijective soft set, if
(i) ∪²∈Λ ζS (²) = U
(ii)For any two parameters ²i , ²j ∈ Λ, ²i 6= ²j , ζS (²i ) ∩ ζS (²j ) = ∅

3. B IJECTIVE H YPERSOFT S ET (BHS- SET )

In this section, we start with definition of hypersoft set with example then we character-
ize the theory of bijective hypersoft set.
Definition 7. [40]
The pair (F, G) is called a hypersoft set over U, where G is the cartesian product of n disjoint
attribute-valued sets G1 , G2 , G3 , ...., Gn corresponding to n distinct attributes g1 , g2 , g3 , ...., gn
respectively and F : G → P(U). The collection of all hypersoft sets is denoted by Ω(F,G) .
514 A.U.Rahman, M.Saeed and A.Hafeez

Example 3.1. Suppose that Mr. Smith wants to buy a mobile from a mobile market. There
are sixteen kinds of mobiles (options) which form the set of discourse
U = {m1 , m2 , m3 , m4 , m5 , ......, m16 }
. The best selection may be evaluated by observing the attributes i.e. g1 = Camera Resolu-
tion, g2 = storage, and g3 = Battery power. The attribute-valued sets corresponding to these
attributes are:
G1 = {g11 , g12 }
G2 = {g21 , g22 }
G3 = {g31 , g32 }
then G = G1 × G2 × G3
G = {δ1 , δ2 , δ3 , δ4 , ....., δ8 } where each δi , i = 1, 2, ..., 8, is a 3-tuple element.
The hypersoft set (F, G) is given as
 

 (δ1 , {m1 , m2 , m9 , m14 , m16 }) , (δ2 , {m1 , m2 , m3 , m10 , m12 }) , 


 (δ3 , {m2 , m3 , m4 , m9 , m13 , m14 }) , (δ4 , {m4 , m5 , m6 , m10 , m15 , m16 }) , 

 
(F, G) = (δ5 , {m6 , m7 , m8 , m10 , m12 }) , (δ6 , {m2 , m3 , m4 , m7 , m9 }) ,

 


 (δ7 , {m1 , m3 , m5 , m6 , m8 , m10 , m12 , m14 , m16 }) , 

 
(δ8 , {m2 , m3 , m6 , m7 , m9 , m11 , m13 , m15 })
and tabular representation of (F, G) is given in TABLE 1 where if mi ∈ F(δi ) then 1
otherwise 0.

.... F(δ1 ) F(δ2 ) F(δ3 ) F(δ4 ) F(δ5 ) F(δ6 ) F(δ7 ) F(δ8 )

m1 1 1 0 0 0 0 1 0
m2 1 1 1 0 0 1 0 1
m3 0 1 1 0 0 1 1 1
m4 0 0 1 1 0 1 0 0
m5 0 0 0 1 0 0 1 0
m6 0 0 0 1 1 0 1 1
m7 0 0 0 0 1 1 0 1
m8 0 0 0 0 1 0 1 0
m9 1 0 1 0 0 1 0 1
m10 0 1 0 1 1 0 1 0
m11 0 0 0 0 0 0 0 1
m12 0 1 0 0 1 0 1 0
m13 0 0 1 0 0 0 0 1
m14 1 0 1 0 0 0 1 0
m15 0 0 0 1 0 0 0 1
m16 1 0 0 1 0 0 1 0
TABLE 1. The table form of hypersoft set (F, G)

Definition 8. A hypersoft set (F, G) is said to be bijective hypersoft set if

S
(i) F(δ) = U
δ∈G
Theory of Bijective Hypersoft Set with Application in Decision Making 515

(ii) For any two δi , δj ∈ G, δi 6= δj , F(δi ) ∩ F(δj ) = ∅

Alternatively, a mapping F : G → P(U) can be transformed to a bijective function F :
G → P1 , where P1 ⊆ P(U) having disjoint sets F(ei ) as elements. The collection of all
bijective hypersoft sets over U is denoted by ΩBHSS .
Example 3.2. Consider Example 3.1, we have bijective hypersoft set
½ ¾
(δ1 , {m1 , m2 }) , (δ2 , {m3 , m10 }) , (δ3 , {m4 , m14 }) , (δ4 , {m5 , m15 }) ,
(F, G) =
(δ5 , {m6 , m12 }) , (δ6 , {m7 , m9 }) , (δ7 , {m8 , m16 }) , (δ8 , {m11 , m13 })
and its tabular representation is given in TABLE 2.

.... F(δ1 ) F(δ2 ) F(δ3 ) F(δ4 ) F(δ5 ) F(δ6 ) F(δ7 ) F(δ8 )

m1 1 0 0 0 0 0 0 0
m2 1 0 0 0 0 0 0 0
m3 0 1 0 0 0 0 0 0
m4 0 0 1 0 0 0 0 0
m5 0 0 0 1 0 0 0 0
m6 0 0 0 0 1 0 0 0
m7 0 0 0 0 0 1 0 0
m8 0 0 0 0 0 0 1 0
m9 0 0 0 0 0 1 0 0
m10 0 1 0 0 0 0 0 0
m11 0 0 0 0 0 0 0 1
m12 0 0 0 0 1 0 0 0
m13 0 0 0 0 0 0 0 1
m14 0 0 1 0 0 0 0 0
m15 0 0 0 1 0 0 0 0
m16 0 0 0 0 0 0 1 0
TABLE 2. The table form of bijective hypersoft set (F, G)

DefinitionV 9. AND operation of two hypersoft sets (F1 , G1 ) and (F2 , G2 ), denoted by
(F1 , G1 ) (F2 , G2 ), is a hypersoft set (F3 , G3 )) with G3 = G1 × G2 and for δ ∈ G3 ,
F3 (δ) = F1 (δ) ∩ F2 (δ)
V
Theorem 3.3. If (F1 , H1 ), (F2 , H2 ) ∈ ΩBHSS then (F1 , H1 ) (F2 , H2 ) ∈ ΩBHSS
Proof. According to Definition 9, we have
(F1 , H1 ) ∧ (F2 , H2 ) = (F3 , H3 ), where H3 = H1 × H2 and F3 (h1 , h2 ) = F1 (h1 ) ∩
F2 (h2 ), ∀ (h1 , h2 ) ∈ H3 . Consider ε ∈ H3 is a parameter of (F3 , H3 ) then
F3 (ε) = F1 (h1 ) ∩ F2 (h2 )
à !
S S S T S T S
∴ F3 (ε) = F1 (h1 ) F2 (h2 ) = F1 (h1 ) F2 (h2 ) =
ε∈H2
S T h1 ∈H1 h2 ∈H2 h1 ∈H1 h2 ∈H2
F1 (h1 ) U = U. Let εi , εj ∈ H3 , εi 6= εj , εi = α1 × β1 , α1 ∈ H1 , β1 ∈ H2 , εj =
h1 ∈H1
516 A.U.Rahman, M.Saeed and A.Hafeez

α2 × β2 , α2 ∈ H1 , β2 ∈ H2 . Then
\ \ \ \
F3 (εi ) F3 (εj ) = (F1 (α1 ) F2 (β1 )) (F1 (α2 ) F2 (β2 )) = ∅.
V
Hence (F3 , H3 ) = (F1 , H1 ) (F2 , H2 ) is a bijective hypersoft set. ¤

Definition 10. A hypersoft set (F, G) is called a null hypersoft set, denoted by (F, G)Φ , if
F(δ) = ∅, for all δ ∈ G.
Definition 11. Union of two hypersoft sets (F1 , G1 ) and (F2 , G2 ) , denoted by (F1 , G1 ) ∪
(F2 , G2 ), is a hypersoft set (F3 , G3 ) with G3 = G1 ∪ G2 and for δ ∈ G3 ,

 F1 (δ) δ ∈ (G1 \ G2 )
F3 (δ) = F2 (δ) δ ∈ (G2 \ G1 )

F1 (δ) ∪ F2 (δ) δ ∈ (G1 ∩ G2 )
Theorem 3.4. If (F, H) ∈ ΩBHSS then (F, H) ∪ (F, H)Φ ∈ ΩBHSS .
Proof. Let (F, H)Φ = (FΦ , H1 ), then from Definition 10 and Definition 11, we have
(F2, H2 ) = (F, H) ∪ (FΦ , H1 )
 F(²) ; ² ∈ H − H1
= FΦ (²) = ∅ ; ² ∈ H1 − H = (F, H ∪ H1 )

F(²) ∪ FΦ (²) = F(²) ∪ ∅ ; ² ∈ F ∩ F1
where ² ∈ H2 and (F, H1 ) ⊂ (F, H ∪ H1 ) is a Null hypersoft set, implies
(F2 , H2 ) = (F, H ∪ H1 ) is a bijective hypersoft set over U.
¤

Definition 12. Let U1 ⊂

V U and (F, H) ∈ ΩBHSS . The operation of (F, H) restricted AND
U1 , denoted by (F, H) R U1 , is defined as
[
{F(δ) : F(δ) ⊆ U1 }.
δ∈H

Example 3.5. Let U = {u1 , u2 , u3 , ...., u8 } and U1 = {u1 , u2 , u3 , u4 }. If (F, H) ∈

ΩBHSS with
© ª
(F, H) = (δ1 , {u1 , u2 }) , (δ2 , {u3 , u4 }) , (δ3 , {u5 , u6 }) , (δ4 , {u7 , u8 })
then ^
(F, H) U1 = {u1 , u2 } ∪ {u3 , u4 } = {u1 , u2 , u3 , u4 }
R

Definition 13. Let U1 V

⊂ U and (F, H) ∈ ΩBHSS . The operation of (F, H) relaxed AND
U1 , denoted by (F, H) Rel U1 , is defined as
[
{F(δ) : F(δ) ∩ U1 6= ∅}.
δ∈H

Example 3.6. Let U = {u1 , u2 , u3 , ...., u8 } and U1 = {u1 , u2 , u3 , u4 }. If (F, H) ∈

ΩBHSS with
© ª
(F, H) = (δ1 , {u1 , u8 }) , (δ2 , {u3 , u7 }) , (δ3 , {u2 , u6 }) , (δ4 , {u4 , u5 })
Theory of Bijective Hypersoft Set with Application in Decision Making 517

then
^
(F, H) U1 = {u1 , u8 }∪{u3 , u7 }∪{u2 , u6 }∪{u4 , u5 } = {u1 , u2 , u3 , u4 , u5 , u6 , u7 , u8 } = U
Rel

Definition 14. If (F, H) ∈ ΩBHSS then its boundary region with respect to U1 ⊂ U,
denoted by (F, H)• , is defined as
à ! à !
^ ^
(F, H)• = (F, H) U1 \ (F, H) U1
Rel R

Example 3.7. Consider U and U1 as in Example 3.6, we have

© ª
(F, H) = (δ1 , {u1 }) , (δ2 , {u3 , u4 }) , (δ3 , {u2 , u6 }) , (δ4 , {u7 , u5 })
. Now
^
(F, H) U1 = {u1 } ∪ {u3 , u4 } ∪ {u2 , u6 } = {u1 , u2 , u3 , u4 , u6 }
Rel
and ^
(F, H) U1 = {u1 } ∪ {u3 , u4 } = {u1 , u3 , u4 }
R
therefore
(F, H)• = {u2 , u6 }
Definition 15. If (F1 , H1 ), (F2 , H2 ) ∈ ΩBHSS with H1 ∩ H2 = ∅ then (F1 , H1 ) is said
to depend on (F2 , H2 ) to a degree κ ∈ [0, 1], denoted by (F1 , H1 ) ⇒ (F2 , H2 ), if
κ

¯ ¯
¯ S V ¯
¯ ¯
¯ {(F1 , H1 ) R F2 (δ)}¯
¯δ∈H2 ¯
κ = Γ((F1 , H1 ), (F2 , H2 )) =
|U|
where | · | = cardinality of a set.
Note:
(i) If κ = 1 then (F1 , H1 ) is full depended on (F2 , H2 ).
(ii) If κ = 0 then (F1 , H1 ) is not depended on (F2 , H2 ).
Example 3.8. Consider U as in Example 3.6, we have
½ ¾
(δ1 , {u1 }) , (δ2 , {u3 }) , (δ3 , {u6 }) , (δ4 , {u7 }) ,
(F1 , H1 ) =
(δ5 , {u5 }) , (δ6 , {u8 }) , (δ7 , {u2 }) , (δ8 , {u4 })
and
© ª
(F2 , H2 ) = (δ9 , {u1 , u2 }) , (δ10 , {u3 , u4 }) , (δ11 , {u5 }) , (δ12 , {u7 , u8 })
Now ^
(F1 , H1 ) F2 (δ9 ) = {u1 } ∪ {u2 } = {u1 , u2 }
R
^
(F1 , H1 ) F2 (δ10 ) = {u3 } ∪ {u4 } = {u3 , u4 }
R
518 A.U.Rahman, M.Saeed and A.Hafeez

^
(F1 , H1 ) F2 (δ11 ) = {u5 }
R
^
(F1 , H1 ) F2 (δ12 ) = {u7 } ∪ {u8 } = {u7 , u8 }
R
therefore
[ ^
{(F1 , H1 ) F2 (δ)} = {u1 , u2 , u3 , u4 , u5 , u7 , u8 }
δ∈H2 R

with
7
κ= = 0.875
8
Definition 16. Let (F, H), (L, G) ∈ ΩBHSS . The triple ((F, H), (L, G), U) is said to form
a bijective hypersoft decision system over U, denoted by DBH , if
S
n
(i) there exists a condition hypersoft set (F, H) = (Fi , Hi ) for all (Fi , Hi ) ∈
i=1
ΩBHSS
with Hi ∩ Hj = ∅, i 6= j
(ii) there exists a decision hypersoft set (L, G) for which G ∩ Hi = ∅.
Example 3.9. Consider U as in Example 3.6, we have
© ª
(F1 , H1 ) = (δ1 , {u1 }) , (δ2 , {u2 }) , (δ3 , {u3 })
© ª
(F2 , H2 ) = (δ4 , {u1 , u2 }) , (δ5 , {u3 , u4 }) , (δ6 , {u5 , u6 })
© ª
(F3 , H3 ) = (δ7 , {u1 , u2 , u3 }) , (δ8 , {u4 , u5 , u6 }) , (δ9 , {u7 , u8 })
and
© ª
(L, G) = (δ10 , {u1 , u3 , u5 }) , (δ11 , {u2 , u4 , u8 }) , (δ12 , {u6 , u7 })
therefore
3
[
DBH = ( (Fi , Hi ), (L, G), U)
i=1
V V V
Definition 17. The bijective hypersoft dependency between (F1 , H1 ) (F2 , H2 ) .... (Fn , Hn )
and (L, G)µis called bijective hypersoft
¶ decision system dependency of DBH and defined
Vn
by κ = Γ (Fi , Hi ), (L, G) .
i=1

Example 3.10. Considering the U from Example 3.6, Let we have

© ª
(F1 , H1 ) = (δ1 , {u1 , u4 , u6 }) , (δ2 , {u2 , u5 , u7 })
© ª
(F2 , H2 ) = (δ3 , {u1 , u5 , u6 }) , (δ4 , {u4 , u7 , u8 })
© ª
(F3 , H3 ) = (δ5 , {u1 , u2 , u4 }) , (δ6 , {u3 , u5 , u6 }) , (δ7 , {u7 , u8 })
© ª
(L, G) = (δ8 , {u1 , u4 , u5 , u6 }) , (δ9 , {u2 , u3 , u7 , u8 })
Theory of Bijective Hypersoft Set with Application in Decision Making 519

then V V
(F, H) = (F1 , H1 ) (F2 , H2 ) (F3 , H3 ) =
 

 (ε1 = (δ1 , δ3 , δ5 ), {u1 }) , (ε2 = (δ1 , δ3 , δ6 ), {u6 }) , (ε3 = (δ1 , δ3 , δ7 ), ∅) 

 
(ε4 = (δ1 , δ4 , δ5 ), {u4 }) , (ε5 = (δ1 , δ4 , δ6 ), ∅) , (ε6 = (δ1 , δ4 , δ7 ), ∅)
.

 (ε7 = (δ2 , δ3 , δ5 ), ∅) , (ε8 = (δ2 , δ3 , δ6 ), {u5 }) , (ε9 = (δ2 , δ3 , δ7 ), ∅) 

 
(ε10 = (δ2 , δ4 , δ5 ), ∅) , (ε11 = (δ2 , δ4 , δ6 ), ∅) , (ε12 = (δ2 , δ4 , δ7 ), {u7 })
V V
The tabular representation of (F1 , H1 ) (F2 , H2 ) (F3 , H3 ) is depicted in TABLE 3.
Now
µ 3 ¶
V V
(Fi , Hi ) R (L, G) = {u1 , u4 , u5 , u6 , u7 }
i=1
therefore
µ 3 ¶
V 5
κ=Γ (Fi , Hi ), (L, G) = 8 = 0.625
i=1

.... u1 u2 u3 u4 u5 u6 u7 u8
F(ε1 ) 1 0 0 0 0 0 0 0
F(ε2 ) 0 0 0 0 0 1 0 0
F(ε3 ) 0 0 0 0 0 0 0 0
F(ε4 ) 0 0 0 1 0 0 0 0
F(ε5 ) 0 0 0 0 0 0 0 0
F(ε6 ) 0 0 0 0 0 0 0 0
F(ε7 ) 0 0 0 0 0 0 0 0
F(ε8 ) 0 0 0 0 1 0 0 0
F(ε9 ) 0 0 0 0 0 0 0 0
F(ε10 ) 0 0 0 0 0 0 0 0
F(ε11 ) 0 0 0 0 0 0 0 0
F(ε12 ) 0 0 0 0 0V 0 V 1 0
TABLE 3. The table form of (F1 , H1 ) (F2 , H2 ) (F3 , H3 )

n
Theorem 3.11. Let DBH = ((F, H), (L, G), U), where (F, H) = ∪ (Fi , Hi ) and (Fi , Hi ) ∈
µ n ¶ µm i=1 ¶
V V
ΩBHSS . If κ = γ (Fi , Hi ), (L, G) and κ1 = γ (Fi , Hi ), (L, G) with m ≤ n
i=1 i=1
then κ1 ≤ κ.
Vn Vm
Proof. Suppose that (P, C) = i=1 (Fi , Hi ), (J, K)
= i=1 (Fi , Hi ) then we have
¯ ¯ ¯ ¯
à ! ¯ V ¯ ¯ ¯
n ¯ ∪ (P, C) L(ε)¯ ¯ ∪ ∪ {P(α) : P(α) ⊆ L(ε)}¯
^ ¯ε∈G R ¯ ¯ε∈G α∈C ¯
κ=γ (Fi , Hi ), (L, G) = =
i=1
|U| |U|
¯ ¯ ¯ ¯
Ãm ! ¯ V ¯ ¯ ¯
¯ ∪ (J, K) ¯ ¯ ∪ ∪ {J(α) : J(α) ⊆ L(ε)}¯
^ ¯ε∈G R L(ε)¯ ¯ε∈G α∈K ¯
κ1 = γ (Fi , Hi ), (L, G) = = .
i=1
|U| |U|
520 A.U.Rahman, M.Saeed and A.Hafeez

From Definition 2.6,

P(ε1 , ε2 , .., εn ) = F1 (ε1 )∩F2 (ε2 )∩··∩Fm (εm )∩··∩Fn (εn ), ∀(ε1 , ε2 , .., εn ) ∈ H1 ×H2 ×···×Hn
J(ε1 , ε2 , .., εm ) = F1 (ε1 )∩F2 (ε2 )∩·· ∩Fm (εm ), ∀(ε1 , ε2 , .., εm ) ∈ H1 ×H2 × · · · ×Hm
n>m

P(ε1 , ε2 , .., εn ) ⊇ J(ε1 , ε2 , .., εm )

and

∪ P(ε) = U, ∪ J(ε) = U.
ε∈C ε∈K
Therefore,
¯ ¯ ¯ ¯
¯ ¯ ¯ ¯
¯ ∪ {P(ε) : P(ε) ⊆ G(ε)}¯ ≥ ¯ ∪ {J(ε) : J(ε) ⊆ G(ε)}¯ .
¯ε∈C ¯ ¯ε∈K ¯
Ãm !
^
γ (Fi , Hi ), (L, G) ≤ κ.
i=1
¤
n m
Definition 18. Let DBH = ((F, H), (L, G), U), where (F, H) = ∪ (Fi , Hi ) and ∪ (Fi , Hi ) ⊂
µ n ¶ µm ¶i=1 i=1
V V m
(F, H). If γ (Fi , Hi ), (L, G) = γ (Fi , Hi ), (L, G) = κ then ∪ (Fi , Hi ) is
i=1 i=1 i=1
called a reduct of DBH .
Example 3.12. Considering the U from Example 3.6 and sets from Example 3.10, let we
have
© ª
(F1 , H1 ) = (δ1 , {u1 , u4 , u6 }) , (δ2 , {u2 , u5 , u7 })
© ª
(F2 , H2 ) = (δ3 , {u1 , u5 , u6 }) , (δ4 , {u4 , u7 , u8 })
© ª
(F3 , H3 ) = (δ5 , {u1 , u2 , u4 }) , (δ6 , {u3 , u5 , u6 }) , (δ7 , {u7 , u8 })
© ª
(L, G) = (δ8 , {u1 , u4 , u5 , u6 }) , (δ9 , {u2 , u3 , u7 , u8 })
then
^ ½ ¾
(ε1 = (δ1 , δ3 ), {u1 , u6 }) , (ε2 = (δ1 , δ4 ), {u4 }) ,
(F1 , H1 ) (F2 , H2 ) = .
(ε3 = (δ2 , δ3 ), {u5 }) (ε4 = (δ2 , δ4 ), {u7 }))
Now
µ 2 ¶
V V
(Fi , Hi ) R (L, G) = {u1 , u4 , u5 , u6 , u7 }
i=1
therefore
µ 2 ¶ µ ¶
V 5
V
3
κ=Γ (Fi , Hi ), (L, G) = 8 = 0.625 which is same as of Γ (Fi , Hi ), (L, G)
i=1 i=1
calculated in Example 3.10. Hence (F1 , H1 ) ∪ (F2 , H2 ) is a reduct of DBH .
Theory of Bijective Hypersoft Set with Application in Decision Making 521

n
Definition 19. Let DBH = ( ∪ (Fi , Hi ), (L, G), U). The significance of BHSS to decision
i=1
n
hypersoft set, denoted ∆((Fj , Hj ), ∪ (Fi , Hi ), (L, G)), is defined as
i=1
n
∆((Fj , Hj ), ∪ (Fi , Hi ), (L, G)) = κ − Γ((P, C), (L, G)),
i=1
Vn
where (P, C) = i=1 (Fi , Hi )(i 6= j).
Example
µ 33.13. Since from ¶ Example 3.10, we have
V
κ=Γ (Fi , Hi ), (L, G) = 58 = 0.625 and
i=1
^ ½ ¾
(ε1 = (δ3 , δ5 ), {u1 }) , (ε2 = (δ3 , δ6 ), {u5 , u6 }) , (ε3 = (δ3 , δ7 ), {})
(F2 , H2 ) (F3 , H3 ) = .
(ε4 = (δ4 , δ5 ), {u4 }) , (ε5 = (δ4 , δ6 ), {}) , (ε6 = (δ4 , δ7 ), {u7 , u8 }))
Now
µ 3 ¶
V V
(Fi , Hi ) R (L, G) = {u1 , u4 , u5 , u6 , u7 , u8 }
i=2
therefore
µ 3 ¶
V 6
Γ (Fi , Hi ), (L, G) = 8 = 0.75 hence
i=2
à 3
!
∼3 ^
∆((F1 , H1 ), ∪ (Fi , Hi ), (L, G)) = κ−Γ (Fi , Hi ), (L, G) = 0.625−0.75 = −0.125
i=1
i=2

Definition 20. A BHSS (P, C) is said to be a core BHSS of DBH if it belongs to every
reduct of DBH .
n m
Definition 21. Let DBH = ((F, H), (L, G), U), where (F, H) = ∪ (Fi , Hi ) and ∪ (Fi , Hi ) ⊂
Vm i=1 i=1
(F, H) is a reduct of DBH . Let (P, C) = i=1 (Fi , Hi ). We say
µ ¶
|P(ei )|
if ei then ej
|L(ej )|
m |P(ei )|
a decision rule induced by ∪ (Fi , Hi ) where ei ∈ C, L(ej ) ⊇ P(ei ), ej ∈ G and |L(ej )|
i=1
denotes the coverage proportion of rule.
Example 3.14. Since from Example 3.12, we have
(F1 , H1 ) ∪ (F2 , H2 ) is a reduct of DBH and

^ ½ ¾
(ε1 = (δ1 , δ3 ), {u1 , u6 }) , (ε2 = (δ1 , δ4 ), {u4 }) ,
(F1 , H1 ) (F2 , H2 ) = .
(ε3 = (δ2 , δ3 ), {u5 }) (ε4 = (δ2 , δ4 ), {u7 }))
Now
(i) If ε1 then δ8 (2/4)
(ii) If ε2 then δ8 (1/4)
(iii) If ε3 then δ8 (1/4)
(iv) If ε4 then δ9 (1/4)
522 A.U.Rahman, M.Saeed and A.Hafeez

4. A N APPLICATION OF BIJECTIVE H YPERSOFT SET

In this section, we present an application of bijective hypersoft set to establish decision
rules which further help to have right decision regarding best selection of certain mate-
rial/product. Suppose we have 16 kinds of laptops that form the universe of discourse
U = {l1 , l2 , ......, l16 }. The most feasible laptop is expected to be selected by considering
the attributes a1 = Size, a2 = Colour, a3 = Processor, a4 = RAM and a5 = Price. The
attribute-valued sets corresponding to these attributes are:
A = {small = α1 , medium = α2 , large = α3 }
B = {Silver = β1 , Black = β2 }
C = {2.60 GHz = γ1 }
D = {4.0 GB = δ1 , 5.0 GB = δ2 }
E = {normal = ε1 }.
Now we construct hypersoft set (Ψ, J) where
J=A×B×C×D×E
 

 j1 = (α1 , β1 , γ1 , δ1 , ε1 ), j2 = (α1 , β1 , γ1 , δ2 , ε1 ), j3 = (α1 , β2 , γ1 , δ1 , ε1 ),  
 
j4 = (α1 , β2 , γ1 , δ2 , ε1 ), j5 = (α2 , β1 , γ1 , δ1 , ε1 ), j6 = (α2 , β1 , γ1 , δ2 , ε1 ),
J=

 j7 = (α2 , β2 , γ1 , δ1 , ε1 ), j8 = (α2 , β2 , γ1 , δ2 , ε1 ), j9 = (α3 , β1 , γ1 , δ1 , ε1 ),  
 
j10 = (α3 , β1 , γ1 , δ2 , ε1 ), j11 = (α3 , β2 , γ1 , δ1 , ε1 ), j12 = (α3 , β2 , γ1 , δ2 , ε1 )
and
 

 (j1 , {l1 , l2 , l9 , l14 , l16 }) , (j2 , {l1 , l2 , l3 , l10 , l12 }) , (j3 , {l2 , l3 , l4 , l9 , l13 , l14 }) , 


 

 (j4 , {l4 , l5 , l6 , l10 , l15 , l16 }) , (j5 , {l6 , l7 , l8 , l10 , l12 }) , (j6 , {l2 , l3 , l4 , l7 , l9 }) , 
(Ψ, J) = (j7 , {l1 , l3 , l5 , l6 , l8 , l10 , l12 , l14 , l16 }) , (j8 , {l2 , l3 , l6 , l7 , l9 , l11 , l13 , l15 }) , .

 

 (j9 , {l5 , l7 , l8 , l9 , l11 , l13 , l16 }) , (j10 , {l2 , l4 , l6 , l8 , l10 , l12 , l14 }) ,
 

 
(j11 , {l3 , l5 , l7 , l9 , l11 }) , (j12 , {l1 , l4 , l7 , l10 , l13 , l16 })
Now we propose an algorithm of bijective hypersoft sets to establish decision rules.

ALGORITHM
n
Step 1 Construct DBH = ( ∪ (Wi , Vi ), (L, J ), U)
i=1
Step 2 Calculate κi = ΓÃ((Wi , Vi ), (L, J )) for!i = 1, 2, ..., n
V
n
Step 3 Calculate κ = Γ (Wj , Vj ), (L, J )
j=1
Step 4 Find reduct bijective hypersoft sets w.r.t. DBH
Step 5 Determine decision rules
n
[descriptive diagram] Step 1,Construct DBH = ( ∪ (Wi , Vi ), (L, J ), U), Step 2,
i=1 Ã !
V
n
Calculate κi = Γ ((Wi , Vi ), (L, J )), Step 3, Calculate κ = Γ (Wj , Vj ), (L, J ) ,
j=1
Step 4, Find reduct bijective hypersoft sets w.r.t. DBH , Step 5, Determine decision rules
Step 1
Let we have bijective hypersoft sets
© ª
(W1 , V1 ) = (j1 , {l1 , l4 , l6 }) , (j2 , {l2 , l5 , l7 })
Theory of Bijective Hypersoft Set with Application in Decision Making 523

© ª
(W2 , V2 ) = (j3 , {l1 , l5 , l6 }) , (j4 , {l4 , l7 , l8 })
© ª
(W3 , V3 ) = (j5 , {l1 , l2 , l4 }) , (j6 , {l3 , l5 , l6 }) , (j7 , {l7 , l8 })
© ª
(L, J ) = (j8 , {l1 , l4 , l5 , l6 }) , (j9 , {l2 , l3 , l7 , l8 })
3
which form DBH = ( ∪ (Wi , Vi ), (L, J ), U) and Vi , J ⊆ J.
i=1
Step 2
Since
^ ½ ¾
(θ1 = (j1 , j3 ), {l1 , l6 }) , (θ2 = (j1 , j4 ), {l4 }) ,
(W1 , V1 ) (W2 , V2 ) =
(θ3 = (j2 , j3 ), {l5 }) (θ4 = (j2 , j4 ), {l7 })
and
^ ½ ¾
(θ5 = (j3 , j5 ), {l1 }) , (θ6 = (j3 , j6 ), {l5 , l6 }) , (θ7 = (j3 , j7 ), ∅)
(W2 , V2 ) (W3 , V3 ) =
(θ8 = (j4 , j5 ), {l4 }) , (θ9 = (j4 , j6 ), ∅) , (θ10 = (j4 , j7 ), {l7 , l8 })
and
^ ½ ¾
(θ11 = (j1 , j5 ), {l1 , l4 }) , (θ12 = (j1 , j6 ), {l6 }) , (θ13 = (j1 , j7 ), ∅)
(W1 , V1 ) (W3 , V3 ) =
(θ14 = (j2 , j5 ), {l2 }) , (θ15 = (j2 , j6 ), {l5 }) , (θ16 = (j2 , j7 ), {l7 })
Now
3
κ1 = Γ ((W1 , V1 ), (L, J )) = 16 = 0.1875
3
κ2 = Γ ((W2 , V2 ), (L, J )) = 16 = 0.1875
2
κ3 = Γ ((W3 , V3 ), (L, J )) = 16 = 0.125
V 5
κ4 = Γ ((W1 , V1 ) (W2 , V2 ), (L, J )) = 16 = 0.3125
V 6
κ5 = Γ ((W2 , V2 ) (W3 , V3 ), (L, J )) = 16 = 0.375
V 6
κ6 = Γ ((W1 , V1 ) (W3 , V3 ), (L, J )) = 16 = 0.375
Step 3 V V
(W1 , V1 ) (W2 , V2 ) (W3 , V3 ) =
 

 (η1 = (j1 , j3 , j5 ), {l1 }) , (η2 = (j1 , j3 , j6 ), {l6 }) , (η3 = (j1 , j3 , j7 ), ∅) 

 
(η4 = (j1 , j4 , j5 ), {l4 }) , (η5 = (j1 , j4 , j6 ), ∅) , (η6 = (j1 , j4 , j7 ), ∅)
.

 (η7 = (j2 , j3 , j5 ), ∅) , (η8 = (j2 , j3 , j6 ), {l5 }) , (η9 = (j2 , j3 , j7 ), ∅) 

 
(η10 = (j2 , j4 , j5 ), ∅) , (η11 = (j2 , j4 , j6 ), ∅) , (η12 = (j2 , j4 , j7 ), {l7 })
therefore
µ 3 ¶
V 5
κ=Γ (Wi , Vi ), (L, J ) = 16 = 0.3125
i=1
Step 4
As à !
³ ^ ´ 3
^
Γ (W1 , V1 ) (W2 , V2 ), (L, J ) = 0.3125 = Γ (Wi , Vi ), (L, J )
i=1
therefore (W1 , V1 ) ∪ (W2 , V2 ) is a reduct of DBH .
Step 5
Since (W1 , V1 ) ∪ (W2 , V2 ) is a reduct of DBH therefore we have the following decision
rules w.r.t. DBH
(i) If θ1 then j8 (2/4)
(ii) If θ2 then j8 (1/4)
524 A.U.Rahman, M.Saeed and A.Hafeez

(iii) If θ3 then j8 (1/4)

(iv) If θ4 then j9 (1/4)
Hence we have two elements j8 and j9 in our decision set and j8 is more preferable than
j9 in this set for further evaluation.
4.1. Comparative study. In this subsection, we compare our propose structure with the
existing studies.
Authors Structures Remarks
H. Kamacı et al. [9] Bijective soft matrix
theory • Single set of attribute is
employed to develop deci-
sion system via bijection
on matrix theory
• Multi-bijective linguistic
soft decision system is
established

Gong et al. [7] The bijective soft set

• Single set of attribute is
employed to develop deci-
sion system

Proposed structure Bijective hypersoft

set • Attributes are further
classified into disjoint
attribute-valued sets
• Decision system is de-
veloped via employment
of multi-argument approx-
imate functions.

5. C ONCLUSION
In this study, the concept of bijective hypersoft set is developed and its some set aggrega-
tion operations such as restricted-AND and relaxed-AND, are discussed. Decision making
algorithm and its application are discussed with the support of new proposed operations
of bijective hypersoft set like dependency, decision system, significance of decision sys-
tem, reduced decision system and decision rules in decision system. In order to adequate
the existing soft-like structures for multi-argument functions, future work may include the
hybridized study of proposed work with the following structures:
• Fuzzy Set
• Intuitionistic Fuzzy Set
• Interval-Valued Fuzzy Set
• Pythagorean Fuzzy Set
• q-rung Orthopair Fuzzy Set
• Rough Set
Theory of Bijective Hypersoft Set with Application in Decision Making 525

• Complex Set
• Neutrosophic Set etc.
and their applications in decision making.

R EFERENCES
[1] M. Akram, G. Ali, J.C.R. Alcantud, New decision-making hybrid model : intuitionistic fuzzy N-soft rough
sets, Soft Computing, 23, No.20 (2019) 9853-9868.
[2] M.I. Ali, F. Feng, X. Liu, W.K. Min, M. Sabir, On some new operations in soft set theory, Computers and
Mathematics with Applications 57 (2009) 1547-1553.
[3] K.V. Babitha, J.J. Sunil, Soft set relations and functions, Computers and Mathematics with Applications 60
(2010) 1840-1849.
[4] K.V. Babitha, J.J. Sunil, Transitive closure and ordering in soft set, Computers and Mathematics with Ap-
plications 61 (2011) 2235-2239.
[5] F. Feng, C. Li, B. Davvaz, M.I. Ali, Soft sets combined with fuzzy sets and rough sets : a tentative approach,
Soft Computing 14, No.9 (2010) 899-911.
[6] X. Ge, S. Yang, Investigations on some operations of soft sets, World Academy of Science Engineering and
Technology 75 (2011) 1113-1116.
[7] K. Gong, X. Zhi, Z. Xia, The bijective soft set with its operations, Computers Mathematics with Applications
60, No. 8 (2010) 2270-2278.
[8] M. Ihsan, A.U. Rahman, M. Saeed, Hypersoft Expert Set With Application in Decision Making for Recruit-
ment Process, Neutrosophic Sets and Systems 42 (2021) 191-207.
[9] H. Kamacı, A.O. Atagün, E. Toktaş, Bijective soft matrix theory and multi-bijective linguistic soft decision
system, Filomat, 32, No.11 (2018) 3799-3814
[10] H. Kamacı, A.O. Atagün, E. Aygün, Difference operations of soft matrices with applications in decision
making, Punjab Uni. j. math. 51, No.3 (2019) 1-21.
[11] H. Kamacı, Introduction to N -soft algebraic structures, Turkish Journal of Mathematics, 44, No.6 (2020)
2356-2379.
[12] H. Kamacı, S. Petchimuthu, Bipolar N-soft set theory with applications, Soft Computing, 24, No.22 (2020)
16727-16743.
[13] H. Kamacı, On hybrid structures of hypersoft sets and rough sets, International Journal of Modern Science
and Technology, 6, No.4 (2021) 69-82.
[14] A. Khalid, M. Abbas, Distance measures and operations in intuitionistic and interval-valued intuitionistic
fuzzy soft set theory, International Journal of Fuzzy Systems, 17, No.3 (2005) 490-497.
[15] A.Z. Khameneh, A. Kilicman, Parameter reduction of fuzzy soft sets : An adjustable approach based on the
three-way decision, International Journal of Fuzzy Systems, 20, No.3 (2018) 928-942.
[16] F. Li, Notes on soft set operations, ARPN Journal of systems and softwares 1, No.6 (2011) 205-208.
[17] P.K. Maji, R. Biswas, A.R. Roy, Soft Set Theory, Computers and Mathematics with Applications, 45, (2003)
555-562.
[18] N. Martin, F. Smarandache, Concentric Plithogenic Hypergraph based on Plithogenic Hypersoft Sets- A
Novel Outlook, Neutrosophic Sets and Systems, 33, (2020) 78-91.
[19] D. Molodtsov, Soft Set Theory - First Results, Computers and Mathematics with Applications, 37, (1999)
19-31.
[20] T.Y. Ozturk, A. Yolcu, On Neutrosophic Hypersoft Topological spaces, Theory and Application of Hypersoft
Set, Pons Publishing House, Brussel, (2021) 215-234.
[21] B. Paik, S.K. Mondal, A distance-similarity method to solve fuzzy sets and fuzzy soft sets based decision-
making problems, Soft Computing, 24, No.7 (2020) 5217-5229.
[22] D. Pei, D. Miao, From soft set to information system, In international conference of granular computing,
IEEE, 2, (2005) 617-621.
[23] S. Petchimuthu, H. Kamacı, The row-products of inverse soft matrices in multicriteria decision making,
Journal of Intelligent and Fuzzy Systems, 36, No. 6 (2019) 6425-6441.
526 A.U.Rahman, M.Saeed and A.Hafeez

[24] A.U. Rahman, M. Saeed, F. Smarandache, M.R. Ahmad, Development of Hybrids of Hypersoft Set with
Complex Fuzzy Set, Complex Intuitionistic Fuzzy set and Complex Neutrosophic Set, Neutrosophic Sets and
Systems, 38, (2020) 335-354.
[25] A.U. Rahman, M. Saeed, F. Smarandache, Convex and Concave Hypersoft Sets with Some Properties, Neu-
trosophic Sets and Systems, 38, (2020) 497-508.
[26] A.U. Rahman, M. Saeed, A. Dhital, Decision Making Application Based on Neutrosophic Parameterized
Hypersoft Set Theory, Neutrosophic Sets and Systems, 41, (2021) 1-14.
[27] A.U. Rahman, M. Saeed, S. Zahid, Application in Decision Making Based on Fuzzy Parameterized Hypersoft
Set Theory, Asia Mathematika, 5, No.1 (2021) 19-27.
[28] A.U. Rahman, A. Hafeez, M. Saeed, M.R. Ahmad, U. Farwa, Development of Rough Hypersoft Set with
Application in Decision Making for the Best Choice of Chemical Material, In Theory and Application of
Hypersoft Set, Pons Publication House, Brussel, (2021) 192-202.
[29] M. Saeed, M. Hussain, A.A. Mughal, A Study of Soft Sets with Soft Members and Soft Elements: A New
Approach, Punjab Univ. j.math.52, No.8 (2020) 1-15.
[30] M. Saeed, M. Ahsan, M.K. Siddique, A.R. Ahmad, A Study of the Fundamentals of Hypersoft Set Theory,
International Journal of Scientific and Engineering Research, 11, No.1 (2020) 320-329.
[31] M. Saeed, A.U. Rahman, M. Ahsan, F. Smarandache, An Inclusive Study on Fundamentals of Hypersoft Set,
In Theory and Application of Hypersoft Set, Pons Publishing House, Brussel, (2021) 1-23.
[32] M. Saeed, M. Ahsan, A.U. Rahman, A novel approach to mappings on hypersoft classes with application,
In Theory and Application of Hypersoft Set, Pons Publication House, Brussel, (2021) 175-191.
[33] M. Saeed, M. Ahsan, M. H. Saeed, A. Mehmood, T. Abdeljawad, An Application of Neutrosophic Hypersoft
Mapping to Diagnose Hepatitis and Propose Appropriate Treatment, IEEE Access, 9, (2021) 70455-70471.
[34] M. Saeed, M. Ahsan, T. Abdeljawad, A Development of Complex Multi-Fuzzy Hypersoft Set With Application
in MCDM Based on Entropy and Similarity Measure, IEEE Access, 9, (2021) 60026-60042.
[35] M. Saeed, M.K. Siddique, M. Ahsan, M.R. Ahmad, A.U. Rahman, A Novel Approach to the Rudiments of
Hypersoft Graphs, In Theory and Application of Hypersoft Set, Pons Publication House, Brussel, (2021)
203-214.
[36] M. Saqlain, N. Jafar, S. Moin, M. Saeed, S. Broumi, Single and Multi-valued Neutrosophic Hypersoft Set and
Tangent Similarity Measure of Single valued Neutrosophic Hypersoft Sets, Neutrosophic Sets and Systems,
32, (2020) 317-329.
[37] M. Saqlain, S. Moin, N. Jafar, M. Saeed, F. Smarandache, Aggregate Operators of Neutrosophic Hypersoft
Sets, Neutrosophic Sets and Systems, 32, (2020) 294-306.
[38] M. Saqlain, M. Saeed, M.R. Ahmad, F. Smarandache, Generalization of TOPSIS for Neutrosophic Hypersoft
Sets using Accuracy Function and its Application, Neutrosophic Sets and Systems, 27, (2019) 131-137.
[39] A. Sezgin, A.O. Atagün, On operations of soft sets, Computers and Mathematics with Applications, 61,
No.5 (2011) 1457-1467.
[40] F. Smarandache, Extension of Soft Set of Hypersoft Set, and then to Plithogenic Hypersoft Set, Neutrosophic
Sets and Systems 22 (2018) 168-170.
[41] A. Yolcu, T.Y. Ozturk, Fuzzy Hypersoft Sets and Its Application to Decision-Making, In Theory and Appli-
cation of Hypersoft Set, Pons Publishing House, Brussel, (2021) 50-64.
[42] A. Yolcu, F. Smarandache, T.Y. Ozturk, Intuitionistic fuzzy hypersoft sets, Communications Faculty of Sci-
ences University of Ankara Series A1 Mathematics and Statistics, 70, No.1 (2021) 443-455.
[43] J. Zhang, X. Wu, R. Lu, Decision Analysis Methods Combining Quantitative Logic and Fuzzy Soft Sets,
International Journal of Fuzzy Systems, 22, No.6 (2020) 1801-1814.