Neutrosophic Parameterized Soft Relations and Their Applications

25
Neutrosophic Sets and Systems, Vol. 4, 2014
Neutrosophic Parameterized Soft Relations and Their

Applications
Irfan Deli1, Yunus toktas2 and Said Broumi3
a
b
c
Muallim Rfat Faculty of Education, Kilis 7 Aralk University, 79000 Kilis, Turkey, irfandeli@kilis.edu.tr
Muallim Rfat Faculty of Education, Kilis 7 Aralk University, 79000 Kilis, Turkey, yunus_1540@hotmail.com
Faculty of Arts and Humanities, Hay El Baraka Ben M'sik Casablanca B.P. 7951, Hassan II Mohammedia-Casablanca University,
Morocco, broumisaid78@gmail.com
Abstract. The aim of this paper is to introduce the concept of re-
with proofs and examples. Finally the notions of symmetric,
lation on neutrosophic parameterized soft set (NP- soft sets) theo-
transitive, reflexive, and equivalence neutrosophic parameterized
ry. We have studied some related properties and also put forward
soft set relations have been established in our work. Finally a de-
some propositions on neutrosophic parameterized soft relation
cision making method on NP-soft sets is presented.
Keywords: Soft set, neutrosophic parameterized soft set, NP-soft relations.
1.
Introduction
ideas of fuzzy sets, intuitionistic fuzzy sets, neutrosophic
Neutrosophic set theory was introduced in 1995 with the

study of Smarandache [21] as mathematical tool for handling problem involving imprecise, indeterminacy and inconsistent data. The concept of neutrosophic set generalizes the concept of fuzzy sets [22], intuitionistic fuzzy sets [1]
and so on. In neutrosophic set, indeterminacy is quantified
explicitly and truth-membership, indeterminacy membership and falsity-membership are independent. Neutrosophic set theory has successfully used in logic, economics,
computer science, decision making process and so on.
The concept of soft set theory is another mathematical theory dealing with uncertainty and vagueness, developed by
Russian researcher [20]. The soft set theory is free from the
parameterization inadequacy syndrome of fuzzy set theory,
rough set theory, probability theory. Many interesting re-
sets and so on. For example; fuzzy soft sets [3,9,17], on intuitionistic fuzzy soft set theory [10,18], on possibility intuitionistic fuzzy soft set [2], on neutrosophic soft set [19],
on intuitionistic neutrosophic soft set [4,7], on generalized
neutrosophic soft set [5], on interval-valued neutrosophic
soft set [6], on fuzzy parameterized soft set theory
[14,15,16], on intuitionistic fuzzy parameterized soft set
theory [12], on IFPfuzzy soft set theory [13], on fuzzy
parameterized fuzzy soft set theory [11].
Later on, Broumi et al. [8] defined the neutrosophic parameterized soft sets (NP-soft sets) which is a generalization of fuzzy parameterized soft sets (FP-soft sets) and intuitionistic fuzzy parameterized soft sets (IFP-soft sets).
In this paper our main objective is to extend the concept relations on FP-soft sets[14] to the case of NP-soft sets. The
sults of soft set theory have been studied by embedding the

I. Deli, Y. Tokta and S. Broumi, Neutrosophic Parameterized Soft Relations and Their Applications
26
paper is structured as follows. In Section 2, some basic
Then,
definition and preliminary results are given which will be
1.
used in the rest of the paper. In Section 3, we define relations on NP-soft sets and some of its algebraic properties
ANS BNS if and only if
A ( x) B ( x), A ( x) B ( x)
are studied. In section 4, we present decision making
A ( x) B ( x).
method on NP-soft relations. Finally we conclude the pa-
2.
per.
2.
and
ANS BNS if and only if,
A ( x) B ( x), A ( x) B ( x), A ( x) B ( x)
Preliminaries
any
x X .
3.
The complement of
for
Throughout this paper, let U be a universal set and E be the

set of all possible parameters under consideration with respect to U, usually, parameters are attributes, characteristics, or properties of objects in U.
and is de-
fined by
A NS x, A ( x),1 A ( x), A ( x) x X
We now recall some basic notions of neutrosophic set, soft

set and neutrosophic parameterized soft set. For more de-
is denoted by
4.
A B
x, min
( x), B ( x) ,
tails, the reader could refer to [8,20,21].
, max A ( x), A ( x) ,
Definition 2.1. [21] Let U be a universe of discourse then
max A ( x), B ( x) : x X
the neutrosophic set A is an object having the form

A = {< x:
where the functions
A(x),
A(x),
, ,
A(x)>,x
U},
5.
A B x, min A ( x), B ( x) , max A ( x), A ( x) ,
: U] 0,1 [ define respec+
max A ( x), B ( x) : x X
tively the degree of membership, the degree of indeterminacy, and the degree of non-membership of the element x
As an illustration, let us consider the following example.
X to the set A with the condition.
A(x)+
A(x) +
A(x)3
(1)
From philosophical point of view, the neutrosophic set

takes the value from real standard or non-standard subsets
of ]0,1+[. So instead of ]0,1+[ we need to take the interval [0,1] for technical applications, because ]0,1+[ will be
difficult to apply in the real applications such as in scientific and engineering problems.
Example 2.2. Assume that the universe of discourse

U= x1 , x2 , x3 . It may be further assumed that the values
of x1, x2 and
are in [0, 1] Then, A is a neutrosophic set
(NS) of U, such that,
A x1 , 0.7, 0.5, 0.2 , x2 , 0.4, 0.5, 0.5 ,

x3 , 0.4, 0.5, 0.6
For two NS,
ANS x, A ( x), A ( x), A ( x) x X
Definition 2.3.[8] Let U be an initial universe, P (U) be the
And
power set of U, E be a set of all parameters and K be a ne
BNS x, B ( x), B ( x), B ( x) x X

27
f K L ( x, y) f K ( x) f L ( y )
trosophic set over E. Then a neutrosophic parameterized

soft sets
and
K x, K ( x), K ( x), K ( x) ,
( x, y ) min K ( x), L ( y )
KxL
( x, y ) max K ( x), L ( y )
f K ( x ) : x E
K L
:E
and
[0, 1],
:E
:E
P(U)
such
[0, 1],
:E
that
if
Here
.
Here, the function
and
called membership
function, indeterminacy function and non-membership

function of neutrosophic parameterized soft set (NP-soft
set), respectively.
Example 2.4. Assume that
set and
U u1 , u2 , u3 is a universal
E x1 , x2 is a set of parameters. If
K x1 , 0.7, 0.3, 0.4 , x2 , 0.7, 0.5, 0.4
( x, y ) max K ( x), L ( y )
KxL
[0, 1]
Example 3.2. Let
U u1 , u2 , u3 , u4 , u5 , u6 , u7 , u8 ,
u9 , u10 , u11 , u12 , u13 , u14 , u15
E x1 , x2 , x3 , x4 , x5 , x6 , x7 , x8
K x2 , 0.5, 0.6, 0.3 , x3 , 0.3, 0.2, 0.9 ,
and
L x1 , 0.5, 0.6, 0.3 , x2 , 0.5, 0.6, 0.3 ,
f K ( x1 ) u2 , u5 , f K ( x2 ) U .
is written
by
x , 0.7, 0.3, 0.4 ,u , u , x , 0.7, 0.5,

1
be to neutrosophic sets of E. Suppose that
K x2 ,0.5,0.6,0.3 , u1 , u2 , u4 , u5 , u7 , u8 , u10 , u12 , u14 , u15 ,
x ,0.3,0.2,0.9 ,u , u , u , u , u ,
x ,0.6,0.7,0.3 ,u , u , u , u , u , u , u , u ,
x ,0.1,0.4,0.6 ,u , u , u , u , u , u ,
x ,0.7,0.5,0.3 , u , u , u , u , u , u , u
0.4 , U
3. Relations on the NP-Soft Sets
In this section, after given the cartesian products of two
NP- soft sets, we define a relations on NP- soft sets and
Definition 3.1. Let K , L NPS (U ). Then, a Carte-
K and L ,
L , is
denoted by K
defined as;
K L ( x, y ) , K L ( x, y ) , K L ( x, y ),
K L ( x, y ) , f K L ( x, y ) : ( x, y ) E E
11
15
10
11
12
15
12
13
15
and
study their desired properties.
sian product of
x4 , 0.9, 0.8, 0.1 , x8 , 0.3, 0.2, 0.9
Then a neutrosophic parameterized soft set
Where
is a t-norm.
x5 , 0.6, 0.7, 0.3 , x6 , 0.1, 0.4, 0.6 , x7 , 0.7, 0.5, 0.3
and
( x, y), ( x, y), ( x, y)
KxL
KxL
KxL
x ,0.7,0.4,0.6 ,u , u , u , u , u
1
10
, u13 ,
x ,0.5,0.6,0.3 ,u , u , u , u , u , u , u , u
x ,0.9,0.8,0.1 ,u , u , u , u , u , u ,
x ,0.4,0.7,0.2 ,u , u , u , u , u , u
2
10
10
11
14
10
12
14
12
, u14 , u15 ,
Then, the Cartesian product of K and L is obtained as

follows;
28
K x L ( x2 , x1 ),0.5,0.6,0.6 , u1 , u5 , u10 ,
and
( x , x ),0.5,0.6,0.3 ,
2
u1 , u2 , u4 , u5 , u7 , u8 , u10 , u12 , u14 , u15

( x2 , x4 ),0.5,0.8,0.3 , u2 , u5 , u10 , u14 ,
( x2 , x8 ), 0.4,0.7,0.3 , u2 , u5 , u8 , u10 , u12 , u14 ,
( x3 , x1 ),0.3,0.4,0.9 , u5 ,
( x3 , x2 ),0.3,0.6,0.9 , u2 , u5 , u8 , u15 ,
( x3 , x4 ),0.3,0.8,0.9 , u2 , u5 , u11 ,
( x3 , x8 ),0.3,0.7,0.9 , u2 , u5 , u8 ,
( x , x ),0.6,0.7,0.6 , ,
( x , x )0.5,0.7,0.3 ,u , u , u , u , u
5
12
, u15 ,
11
10
10
10
13
15
( x, y), x ( x, y), x ( x, y),

K L
10
Where f K L ( x, y ) f K ( x) f L ( y ) .
Example 3.4. Let us consider the Example 3.2. Then, we

define a NP-soft relation, from
K to L ,
as follows
RN ( xi , y j ), ( xi , y j ), ( xi , y j ),
KxL
KxL
( xi , y j ) , f ( xi , y j ) (1 i, j 8)
KxL
KxL
Such that
( xi , y j ) 0.7
K xL
Then
12
relation from K to L , denoted by RN , is a NP-soft
K x L
K L
12
L . Any NP-soft subset of

subset of K x
K L
( x, y) , f ( x, y) RN
KxL
KxL
12
Definition 3.3. Let K , L NPS (U ). Then, a NP-soft
is
called a NP-soft relation on K .

Note that if
RN
( xi , y j ) 0.3
KxL
( xi , y j ) 0.5
( x , x ), 0.6, 0.8, 0.3 , u , u ,

( x , x ), 0.4, 0.7, 0.3 , u , u , u ,
( x , x ), 0.1, 0.4, 0.6 , u , u ,
( x , x ), 0.1, 0.6, 0.6 , u , u , u , u , u ,
( x , x ), 0.1, 0.8, 0.6 , u , u ,
( x , x ), 0.1, 0.7, 0.6 , u , u , u ,
( x , x ), 0.7, 0.5, 0.6 , u , u , u , u ,
( x , x ), 0.5, 0.6, 0.3 , u , u , u , u ,
( x , x ), 0.7, 0.8, 0.3 , u , u , u ,
( x , x ), 0.4, 0.7, 0.3 , u , u , u
5
y, L ( y), L ( y ), L ( y) , f L ( y) L , then
( x , x ), 0.5, 0.6, 0.6 , u , u , u ,

2
10
( x2 , x2 ), 0.5, 0.6, 0.3 ,
u1 , u2 , u4 , u5 , u7 , u8 , u10 , u12 , u14 , u15

( x2 , x4 ), 0.5, 0.8, 0.3 , u2 , u5 , u10 , u14 ,
( x2 , x8 ), 0.4, 0.7, 0.3 , u2 , u5 , u8 , u10 , u12 , u14 ,
( x5 , x2 ), 0.5, 0.7, 0.3 , u2 , u4 , u7 , u8 , u12 , u15 ,
( x5 , x4 ), 0.6, 0.8, 0.3 , u2 , u11 ,
( x5 , x8 ), 0.4, 0.7, 0.3 , u2 , u8 , u12 ,
( x7 , x1 ), 0.7, 0.5, 0.6 , u5 , u6 , u9 , u13 ,
( x7 , x2 ), 0.5, 0.6, 0.3 , u2 , u5 , u8 , u15 ,
( x7 , x4 ), 0.7, 0.8, 0.3 , u2 , u5 , u9 ,
( x7 , x8 ), 0.4, 0.7, 0.3 , u2 , u5 , u8 .
x, K ( x), K ( x), K ( x) , f K ( x) K
29
Definition
3.5. Let
K , L NPS (U )
and RN be
RN 1
( x , x ),0.5,0.6,0.6 ,u , u , u ,
1
10
NP-soft relation from K to L . Then domain and range
( ( x2 , x2 ),0.5,0.6,0.3
of RN respectively is defined as;
, u1 , u2 , u4 , u5 , u7 , u8 , u10 , u12 , u14 , u15 )
( x , x ),0.5,0.8,0.3 , u , u , u , u ,
( x , x ),0.4,0.7,0.3 , u , u , u , u , u , u ,
( x , x ),0.5,0.7,0.3 , u , u , u , u , u , u ,
( x , x ),0.6,0.8,0.3 , u , u ,
( x , x ),0.4,0.7,0.3 , u , u , u ,
( x , x ),0.7,0.5,0.6 , u , u , u , u ,
( x , x ),0.5,0.6,0.3 , u , u , u , u ,
( x , x ),0.7,0.8,0.3 , u , u , u ,
( x , x ),0.4,0.7,0.3 , u , u , u .
D( RN ) K : RN
R( RN ) L : RN .
Example 3.6. Let us consider the Example 3.4
D( RN )
x ,0.5,0.6,0.3 ,
2
u1 , u2 , u4 , u5 , u7 , u8 , u10 , u12 , u14 , u15 ,

x3 ,0.3,0.2,0.9 , u2 , u5 , u8 , u11, u15 ,
x5 ,0.6,0.7,0.3 , u2 , u3 , u4 , u7 , u8 , u11, u12 , u15 ,
x6 ,0.1, 0.4,0.6 ,u2 , u4 , u6 , u7 , u10 , u12 ,
x7 ,0.7,0.5,0.3 , u2 , u5 , u6 , u8 , u9 , u13 , u15
R ( RN )
x1 , 0.7, 0.4, 0.6 , u1 , u5 , u6 , u9 , u10 , u13 ,
x2 , 0.5, 0.6, 0.3 ,
10
10
11
12
13
15
Proposition 3.9. Let R
and R
N1
14
12
14
12
15
be two NP-soft relaN2
tion. Then
1
u1 , u2 , u4 , u5 , u7 , u8 , u10 , u12 , u14 , u15 ,

x4 , 0.9, 0.8, 0.1 , u2 , u5 , u9 , u10 , u11, u14 ,
x8 , 0.4, 0.7, 0.2 , u2 , u5 , u8 , u10 , u12 , u14
1. R 1 R
N1
N1
2. R R R
N1
N2
N1
N2
Proof:
Definition 3.7. Let RN be a NP-soft relation
K to L . Then, inverse of RN , RN
from
from K to L
is a NP-soft relation defined as;
1. RN
N1
N1
2. R R R
N1
RN 1 RN
N2
N1
N2
N1
Example 3.8. Let us consider the Example 4.4. Then
RN 1 is from K to L is obtained by
Definition 3.10. If R
N1
and R
N2
are two NP- soft relaN2
tion from K to L , then a compostion of two NP-soft

relations R
N1
and R
is defined by
N2
R R aR R
N
N
N
N
30
Proposition 3.11. Let R
N1
and R
be two NP-soft relaN2
RN , K .
Definition 3.15. A NP-soft relation RN on K is said to
tion from K to L .
be a NP-soft equivalence
1
R 1
Then, R R R
N
N
N
N1
1
2
2
relation if it is symmetric,
transitive and reflexive.
Proof:
Example 3.16. Let
U u1 , u2 , u3 , u4 , u5 , u6 , u7 , u8 ,
R R R R
If
N1
N2
N1
N2
= R R
N1 N 2
= R R
N 2 N1
= R 1 R 1
N2
N1
= R 1 R 1
N1
N2
E x1 , x2 , x3 , x4 , x5 , x6 , x7 , x8 and
X x1 ,0.5,0.4,0.7 , x2 ,0.6,0.8,0.4 ,
x3 0.2,0.5,0.1 .
Suppose that
K x1 , 0.5, 0.4, 0.7 , u2 , u3 , u5 , u6 , u7 , u8 ,
x2 0.6, 0.8, 0.4 , u2 , u6 , u8 ,
x3 , 0.2, 0.5, 0.1 , u1 , u2 , u4 , u5 , u7 , u8
Therefore we obtain
Then, a cartesian product on K is obtained as follows.
R R R 1 R 1
N
N2
N1
1 N2
Definition 3.12. A NP soft relation R
said to be a NP-soft symmetric
If
K x K ( x1 , x1 ),0.5,0.4,0.7 , u2 , u3 , u5 , u6 , u7 , u8 ,
on K is
relation
R R , , K .
N1
N1

said to be a NP-soft transitive
on K is
relation
if RN RN RN ,
that is,
RN and RN RN , , , K .
is said to be a NP-soft reflexive
on K
( x , x ),0.5,0.8,0.7 ,u , u , u ,
( x , x ),0.2,0.5,0.7 ,u , u , u , u ,
( x , x ),0.5,0.8,0.7 ,u , u , u ,
( x , x ),0.6,0.8,0.4 , u , u , u ,
( x , x ),0.2,0.8,0.4 ,u , u ,
( x , x ),0.2,0.5,0.7 ,u , u , u , u ,
( x , x ),0.2,0.8,0.4 ,u , u ,
( x , x ),0.2,0.5, 0.1 ,u , u , u , u , u , u
1
Then, we get a neutrosophic parameterized soft relation

RN on K as follows
relation
31
R
N
( x , y ), x ( x , y ), x ( x , y ),
i
K L
K L
Conversely, if RN
( xi , y j ) , f ( xi , y j ) (1 i, j 8)
KxL
KxL
RN , then
RN RN 1 RN .
So, RN is symmetric .
Where
Proposition 3.19. If
( xi , y j ) 0.3
KxL
( xi , y j ) 0.5
RN1 and RN2 are symmetric rela-
tions on K , then RN RN is symmetric on K if and

1
2
K L
( xi , y j ) 0.7
K xL
only if
RN1 RN2 RN2 RN1
Then
RN
( x , x ), 0.5, 0.4, 0.7 , u , u , u , u , u , u ,

1
( x , x ), 0.5, 0.8, 0.7 , u , u , u ,

( x , x ), 0.5, 0.8, 0.7 , u , u , u ,
( x , x ), 0.6, 0.8, 0.4 , u , u , u .
1
RN1 and RN2 are symmetric, then it im-
Proof: If
plies RN1
N1
Then
RN
RN1 and RN2 1 RN2 . We have
RN2 1 RN1 1.
RN1 RN2 is symmetric. It implies
RN on K is an NP-soft equivalence relation because it
RN1 RN2 RN1 RN2
is symmetric, transitive and reflexive.
Conversely,
Proposition 3.17. If RN is symmetric, if and only if RN
is so.
N1
So,
Proof: If RN is symmetric, then
RN2 1 RN1 1 RN2 RN1 .
RN2 1 RN1 1 RN2 RN1 RN1 RN2 .
RN1 RN2 is symmetric.
Corollary 3.20. If RN is symmetric, then R
aRN RN RN RN . So, RN
1
is
metric
for
all
positive
integer
RN 1 is symmetric,
Proposition 3.21. If RN is transitive, then
RN 1 ( RN 1 )1 ( RN 1 ) ( RN 1 ) RN
transitive.
So, RN is symmetric.
n,
is symwhere
RN 1 RN RN RN
RN RN
RN .
RN RN
RN 1 RN 1
Proof: If RN is symmetric, then
RN 1 RN RN .
RN 1 is also
Proof:
Proposition 3.18. RN is symmetric if and only

1
n times
then
if RN
R n N RN RN .... RN .
symmetric.
Conversely, if
RN
So, RN
RN 1 RN 1
RN .
So, RN
RN 1 RN 1.
The proof is completed.
32
Definition 4.1. Let K NPS (U ) and RN be a NPProposition 3.22. If RN is reflexive, then RN

Proof: aRN
is so.
RN RN RN and
soft relation on K . The neutrosophication operator, de-
RN aRN RN RN .
1
noted by sRN , is defined by
sRN : RN F U , sRN X X ,U u , RN (u ), RN (u ),
The proof is completed.
RN (u) , u U
Proposition 3.23. If RN is symmetric and transitive, then
Where
R (u )
RN is reflexive.
Proof: Its clearly.
R (u )
N
K NPS (U ), RN be an
NP soft equivalence relation on K and RN .
Then, an equivalence class of , denoted by
is
R ,
Definition
3.24.
R (u )
Let
1
XX
1
XX
1
XX
RN
( xi , x j ) (u )
RN
( xi , x j ) (u )
RN
( xi , x j ) (u )
and where
defined as
1, u f RN ( xi , x j )
0, u f RN ( xi , x j )
RN : RN .
(u )
Example 3.25. Let us consider the Example 3. 16 Then an

equivalence class of
Note that
X X is the cardinality of X X .
will be as folNP-soft set and sRN a neutro-
lows.
Definition 4.2. Let
x1 , 0.5, 0.4, 0.7 , u2 , u3 , u5 , u6 , u7 , u8

RN
sophication operator, then a reduced fuzzy set of K is a
x1 , 0.5, 0.4, 0.7 , u2 , u3 , u5 , u6 , u7 , u8 ,

x2 0.6, 0.8, 0.4 , u2 , u6 , u8 ,
x3 , 0.2, 0.5, 0.1 , u1 , u2 , u4 , u5 , u7 , u8

4.
Decision Making Method
fuzzy set over U denoted by
sRN (u )
K (u )
: u U
u
Where
(u )
sRN
sRN
: U 0,1 and
K (u ) K (u ) K (u )
2
In this section, we construct a soft neutrosophication operator and a decision making method on NP soft relations.
Now; we can construct a decision making method on
NP soft relation by the following algorithem;
33
(The car must be a over middle class, it means the

1.
construct a feasible neutrosophic subset X over E,
2.
construct a NP soft set
3.
membership degrees are over 0.5 ),
K over U ,
RN
construct a NP soft relation RN over K ac-
calculate the neutrosophication operator
sRN over RN ,
5.
calculate the reduced fuzzy set K
6.
select the objects from K , which have the largest
( x , x ), 0.4, 0.6, 0.7 , u , u , u ,

( x , x ), 0.2, 0.5, 0.7 , u , u , u , u ,
( x , x ), 0.4, 0.6, 0.7 , u , u , u
( x , x ), 0.6, 0.8, 0.4 , u , u , u ,
( x , x ), 0.2, 0.8, 0.4 , u , u ,
( x , x ), 0.2, 0.5, 0.7 , u , u , u , u ,
( x , x ), 0.2, 0.8, 0.4 , u , u ,
( x , x ), 0.2, 0.5, 0.1 , u , u , u , u , u , u
cording to the requests,

4.
( x , x ), 0.4, 0.6, 0.7 , u , u , u , u , u , u ,
membership value.
Example 4.3. A customer, Mr. X, comes to the auto gallery

agent to buy a car which is over middle class. Assume that
4.
an auto gallery agent has a set of different types of car
U u1 , u2 , u3 , u4 , u5 , u6 , u7 , u8 , which may be characterized by a set of parameters
i 1, 2,3, 4
the
E x1 , x2 , x3 , x4 . For
parameters
xi
stand
The soft neutrosophication operator

calculated as follows
sRN u1 , 0.022, 0.055, 0.011 ,

u2 , 0.311, 0.633, 0.533 , u3 , 0.044, 0.066, 0.077 ,
u4 , 0.022, 0.055, 0.011 , u5 , 0.111, 0.233, 0.244 ,
for
u6 , 0.2, 0.288, 0.277 , u7 , 0.133, 0.322, 0.288 ,
ty, cheap, modern and large, respectively. If Mr. X
u8 , 0.311, 0.633, 0.533
has to consider own set of parameters, then we select a car

on the basis of the set of customer parameters by using the
sRN over RN
5.
Reduced fuzzy set K calculated as follows
algorithm as follows.
1.
Mr. X constructs a neutrosophic set X over E,
0.033 0.205 0.016 0.033 0.05

,
,
,
,
,
u2
u3
u4
u5
u1
K (u )
0.105 0.083 0.205

,
,
; u U
u6
u7
u8
X= {<x1,0.5, 0.4 ,0.7>,<x2,0.6, 0.8 ,0.4>,<x3,0.2, 0.5

,0.1>}
2.
Mr. X constructs a NP soft set K over U ,

K x1 , 0.5, 0.4, 0.7 , u2 , u3 , u5 , u6 , u7 , u8 ,
3.
x2 , 0.6, 0.8, 0.4 , u2 , u6 , u8 ,
6.
Now, Mr. X select the optimum car u2 and u8 which

have the biggest membership degree 0.205 among the
other cars.
x3 , 0.2, 0.5, 0.1 , u1 , u2 , u4 , u5 , u7 , u8
5.
Conclusion
The neutrosophic parameterized soft relation RN over
In this work, we have defined relation on NP-soft sets and
studied some of their properties. We also defined symmet-
is calculated according to the Mr Xs request
ric, transitive, reflexive and equivalence relations on the

34
NP-soft sets. Finally, we construct a decision making
[16] N. aman, I. Deli, Means of FP-Soft Sets and its
method and gave an application which shows that this
Applications, Hacettepe Journal of Mathematics and

Statistics, 41/5 ( 2012) 615625.
method successfully works. In future work, we will extend
[17] P. K. Maji, A. R. Roy and R. Biswas, Fuzzy soft sets, Jour-
this concept to interval valued neutrosophic parameterized

soft sets.
3.
nal of Fuzzy Mathematics, 9/3 (2001) 589-602.
[18] P. K. Maji, R. Biswas and A. R. Roy, Intuitionistic fuzzy

soft sets, The Journal of Fuzzy Mathematics, 9/3 (2001)
677-692.
References
[1] K. Atanassov. Intuitionistic Fuzzy Sets, Fuzzy Sets and

Systems 20 (1986) 87-96.
[2] M. Bashir, A. R. Salleh, and S. Alkhazaleh, Possibility Intuitionistic Fuzzy Soft Set, Advances in Decision Sciences,
doi:10.1155/2012/404325.
[3] M. Borah, T. J. Neog and D. K. Sut, A Study on Some Operations of Fuzzy Soft Sets, International Journal of Modern
Engineering Research, 2/ 2 (2012) 157-168.
[19] P. K. Maji, Neutrosophic Soft Set, Annals of Fuzzy Mathematics and Informatics, 5/ 1 (2013) 2287-623.
[20] D. A. Molodtsov, Soft Set Theory First Result, Computers

and Mathematics with Applications 37 (1999) 19-31.
[21] F. Smarandache, A Unifying Field in Logics. Neutrosophy:

Neutrosophic Probability, Set and Logic. Rehoboth: American Research Press, 1999.
[22] L. A. Zadeh, Fuzzy sets, Information and Control, 8 (1965)

338-353.
[4] S. Broumi and F. Smarandache, Intuitionistic Neutrosophic

Soft Set, Journal of Information and Computing Science 8/
2 (2013) 130-140.
[5] S. Broumi, Generalized Neutrosophic Soft Set, Internation-
Received: June 20, 2014. Accepted: July 2, 2014.
al Journal of Computer Science, Engineering and Information Technology 3/2 (2013) 17-30.
[6] S. Broumi, I. Deli, and F. Smarandache, Relations on Interval Valued Neutrosophic Soft Sets, Journal of New Results
in Science 5 (2014) 1-20.
[7] S. Broumi, F. Smarandache, More on Intuitionistic Neutrosophic Soft Sets, Computer Science and Information Technology 1/4 (2013) 257-268.
[8] S. Broumi, I. Deli, F. Smarandache, Neutrosophic Parameterized Soft Set theory and its decision making problem,
Italian Journal of Pure and Applied Mathematics 32 (2014)
1-12.
[9] N. aman, S. Enginolu, F. tak, Fuzzy Soft Set Theory

and Its Applications. Iran J. Fuzzy Syst. 8/3 (2011) 137-147.
[10] N. aman, S. Karata, Intuitionistic fuzzy soft set theory

and its decision making, Journal of Intelligent and Fuzzy
Systems DOI:10.3233/IFS-2012-0601.
[11] N. aman, F tak , S. Enginolu, Fuzzy parameterized

fuzzy soft set theory and its applications, Turkish Journal of
Fuzzy System 1/1 (2010) 21-35.
[12] N. aman, I. Deli, Intuitionistic fuzzy parameterized soft

set theory and its decision making, Submitted.
[13] N. aman, F. Karaaslan, IFP fuzzy soft set theory and its
applications, Submitted.
[14] N. aman, I. Deli, Relations on FP-Soft Sets Applied to

Decision Making Problems, Submitted.
[15] N. aman, I. Deli, Product of FP-Soft Sets and its

Applications, Hacettepe Journal of Mathematics and
Statistics, 41/3 (2012) 365 - 374.

Neutrosophic Parameterized Soft Relations and Their Applications

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Neutrosophic Parameterized Soft Relations and Their Applications

Enviado por

Direitos autorais:

Formatos disponíveis

25

Neutrosophic Sets and Systems, Vol. 4, 2014