Advances and Applications in Mathematical Sciences

Volume 20, Issue 4, February 2021, Pages 561-575

© 2021 Mili Publications

ON INTERVAL VALUED NEUTROSOPHIC FUZZY

MATRICES

R. VIDHYA and R. IRENE HEPZIBAH

Department of Mathematics
E.G.S. Pillay Engineering College
Nagapattinam, Tamil Nadu, India
E-mail: [email protected]

Department of Mathematics
T.B.M.L College
(Affiliated to Bharathidasan University)
Porayar, Tamilnadu, India
E-mail: [email protected]

Abstract

Matrices play significant roles in various areas in science and engineering. The problems
involving various types of uncertainties cannot be solved by the classical matrix theory.
Neutrosophic sets theory was proposed by Florentin Smarandache in 1999, where each element
had three associated essential functions, namely the membership function (T), the non-
membership (F) function and the indeterminacy function (I) defined on the universe of discourse
X, the three functions are entirely independent. In this paper, the interval-valued neutrosophic
fuzzy matrix (IVNFM) is introduced. Some fundamental operations are also presented. The need
of the interval-valued neutrosophic fuzzy matrix (IVNFM) is explained by an illustration.
Illumination of some of the operators are given with the help of the example.

1. Introduction

Academics in economics, sociology, medical science, industrial,

atmosphere science and many other numerous fields agree with the vague,
imprecise and infrequently lacking information of exhibiting inexact data. As
a result, fuzzy set theory was introduced by L. A. Zadeh [15]. Then, the
intuitionistic fuzzy sets was developed by K. A. Atanassov [1, 2]. Estimation
2010 Mathematics Subject Classification: 03E72; 03E99.
Keywords: neutrosophic fuzzy matrix, interval-valued neutrosophic fuzzy matrix.
Received January 15, 2020; Accepted May 13, 2020
562 R. VIDHYA and R. IRENE HEPZIBAH

of non-membership values is also not constantly possible for the identical

reason as in case of membership values and so, there exists an
indeterministic part upon which hesitation persists. As a result,
Smarandache et al. [8, 9] has introduced the concept of Neutrosophic Set (NS)
which is a generalization of conventional sets, fuzzy set, intuitionistic fuzzy
set etc.

The problems concerning various types of hesitations cannot solved by

the classical matrix theory. That type of problems are solved by using fuzzy
matrix [13, 14]. Fuzzy matrix deals with only membership values. These
matrices cannot deal non membership values. Intuitionistic fuzzy matrices
(IFMs) introduced first time by Khan, Shyamal and Pal [12]. But, essentially
it is difficult to measure the membership or non membership value as a point.
So, we consider the membership value as an interval and also in the case of
non membership values, it is not nominated as a point, it can be considered
as an interval. Interval valued Intuitionistic fuzzy matrices was considered
by Madhumangal pal et al [13]. But, the indeterminate values cannot be
considered by the Intuitionistic fuzzy matrices. Hence, the concept is
extended to interval valued neutrosophic fuzzy matrices (IVNFMs) and some
basic operators on IVNFMs are introduced. The interval-valued neutrosophic
fuzzy determinant (IVNFD) is also defined. A real life problem on IVNFM is
presented. Interpretation of some of the operators are given with the help of
this example.

In this work, some definitions are discussed in section 2. Section 3 dealt

with the operations of interval valued neutrosophic matrices. Properties of
interval valued neutrosophic matrices are given in section 4. The importance
of IVNFM is discussed in section 5. Concluding remarks are given in section
6.

2. Definition and Preliminaries

In this section, we first define the neutrosophic fuzzy matrix (NFM) based
on the definition of neutrosophic fuzzy sets introduced by Smarandache [8, 9].
The intuitionistic fuzzy matrices are introduced by M. Pal et al. [13]. The
same concept is extended to neutrosophic fuzzy matrices here.

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
 ON INTERVAL VALUED NEUTROSOPHIC FUZZY  563

Definition 1. Neutrosophic fuzzy matrix (NFM): An neutrosophic fuzzy

matrix (NFM) A of order m  n is defined as A = X ij , aij , aij , aijv mn ,
where aij , aij , aijv are called truth, indeterminacy and falsity of X ij in A,

which maintaining the condition 0  aij + aij + aijv  3. For simplicity, we

write A = X ij , aij mn or simply aij m n where aij = aij , aij , aijv .

Using the concept of neutrosophic fuzzy sets and interval valued fuzzy
sets, we define interval valued neutrosophic fuzzy matrices as follows:

Definition 2. Interval-valued neutrosophic fuzzy matrix (IVNFM): An

interval valued neutrosophic fuzzy matrix (IVNFM) A of order m  n is
defined as A = X ij , aij , aij , aijv mn , where aij , aij and aijv are the
subsets of 0, 1 which are denoted by aij = aijL , aijU  ,

aij = aijL , aijU  and aijv = aijL , aijvU  which maintaining the condition

0  sup aij + sup aij + sup aijv  3 for i = 1, 2,  , m and j = 1, 2,  , n.

Definition 3. Interval-valued neutrosophic fuzzy determinant (IVIFD):

An interval valued neutrosophic fuzzy determinant (IVNFD) function
f : M → F is a function on the set M (of all n  n IVNFMs) to the set F,
where F is the set of elements of the form
aL , aU , aL , aU , avL , avU  , maintaining the condition
0  aU + aU + avU  3, 0  aL  aU  1 and 0  aL + aU  1,

0  avL  avU  1 such that A  M then f ( A ) or A or det ( A ) belongs

to F and is given by

n
A =  a
sn i =1
i (i )L , ai(i )U , ai(i )L , ai(i )U , ai(i )vL , ai(i )vU 

and sn denotes the symmetric group of all permutations of the symbols

1, 2,  , n.

Definition 4. The adjoint IVNFM of an IVNFM: The adjoint IVNFM of

an IVNFM A of order n  n, is denoted by adj. A and is defined by adj.
A =  A ji  where A ji is the determinant of the IVNFM A of order

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
564 R. VIDHYA and R. IRENE HEPZIBAH

(n − 1)  (n − 1) formed by suppressing row j and column i of the IVNFM A. In

other words, A ji can be written in the form

 sni n j  tn j
at(t )L , at(t )U , at(t )L , at(t )U , at(t )vL , at(t )vU 

where, n j = 1, 2,  , n\ j and snin j is the set of all permutations of set n j

over the set ni . Depending on the values of diagonal elements, the unit
IVNFM are classified into two types: (i) a-unit IVNFM and (ii) r-unit IV
NFM.

Definition 5. Acceptance unit IVNFM (a-unit IVNFM): A square IVNFM

is a-unit IVNFM if all diagonal elements are 1, 1, 0, 0, 0, 0 and all
remaining elements are 0, 0, 1, 1, 1, 1 and it is denoted by
I 0, 0 , 1, 1 , 1, 1 .

Definition 6. Rejection unit IVNFM (r-unit IVNFM): A square IVNFM is

a r-unit IVNFM if all diagonal elements are 0, 0, 1, 1, 1, 1 and all
remaining elements are 1, 1, 0, 0, 0, 0 and it is denoted by
I 1, 1 , 0, 0 , 0, 0 . Similarly, three types of null IVNFMs are defined on its

elements.

Definition 7. Complete null IVNFM (c-null IVNFM): An IVNFM is a c-

null IVNFM if all the elements are 0, 0 , 0, 0 , 0, 0 .

Definition 8. Acceptance null IVNFM (a-null IVNFM): An IVNFM is a

a-null IVNFM if all the elements are 0, 0 , 1, 1 , 1, 1 .

Definition 9. Rejection null IVNFM (r-null IVNFM): An IVNFM is a r-

null IVNFM if all the elements are 1, 1 , 0, 0 , 0, 0 .

3. Some operations on IVNFMs

Let A =  aijL , aijU , aijL , aijU , aijvL , aijvU  , B =  bijL , bijU ,

bijL , bijU , bijvL , bijvU  , be two IVNFMs. Then,

(i) aijL , aijU , aijL , aijU , aijvL , aijvU  + bijL , bijU , bijL , bijU ,

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
 ON INTERVAL VALUED NEUTROSOPHIC FUZZY  565

bijvL , bijvU  = max (aijL , aijL ), max (aijU , aijU )

min (aijL , bijL ), min (aijU , bijU ) min (aijvL , bijvL ), min (aijvU , bijvU )

(ii) aijL , aijU , aijL , aijU , aijvL , aijvU   bijL , bijU , bijL , bijU ,
bijvL , bijvU  = max (aijL , bijL ), max (aijU , bijU )
min (aijL , bijL ), min (aijU , bijU ) min (aijvL , aijL ), min (aijvU , aijvU )
max (aijL , bijL ), max (aijU , bijU ),

(iii) A+B = min (aijL , bijL ), min (aijU , bijU ) , min (aijvL , bijL ),
min (aijvU , bijvU ) , max (aijL , bijL ), max (aijU , bijU )

(iv) AB = min (aijL , bijL ), min (aijU , bijU ) , min (aijvL , bijL ),
min (aijvU , bijvU ) ,

(v) A =  aijvL , aijvU , 1 −aijL , 1 − aijU , aijL , aijU  . (complement

of A)

(vi) A T = a jiL , a jiU , a jiL , a jiU , a jivL , a jivU  nm (Transpose of

A)

(vii) A  B = a jiL + b jiL − aijL  bijL , aijU + bijU − aijU  bijU  ,

aijL  bijL , aijU  bijU  aijvL  bijvL , aijvU  bijvU 

 aijL  bijL , aijU  bijU  

 
(viii) A  B =  aijL + bijL − aijL  bijL , aijU + bijU − aijU  bijU  
 aijvL + bijvL − aijvL  bijvL , aijvU + bijvU − aijvU  bijvU  

  aijL + bijL aijU + bijU  

  ,  
 2 2 
 
  aijL + bijL aijU + bijU  
(ix) A @ B =   ,  
 2 2 
 
  aijvL + bijvL aijvU + bijvU  
  ,  
  2 2  

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
566 R. VIDHYA and R. IRENE HEPZIBAH

  aijL + bijL , aijU + bijU  

 
(x) A$B =   aijL + bijL , aijU + bijU  
  aijvL + bijvL , aijvU + bijvU  


  2aijL  bijL 2aijU  bijU  

 a ,
 ijL + bijL aijU + bijU  
 
  2aijL  bijL 2aijU  bijU  
(xi) A # B =  a ,
 ijL + bijL aijU + bijU  
 
  2aijvL  bijvL 2aijvU  bijvU  
a ,

  ijvL + bijvL aijvU + bijvU  


  aijL + bijL aijU + bijU  

  2(a , 
 ijL  bijL + 1) 2(aijU  bijU + 1)  
  aijL + bijL aijU + bijU  
(xii) A  B =   ,
2(aijL  bijL + 1) 2(aijU  bijU + 1)  
 
  aijvL + bijvL , aijvU + bijvU  
  2(aijvL  bijvL + 1) 2(aijvU  bijvU + 1)  
 

(xiii) A  B iff aijL  bijL , aijU  bijU , aijL  bijL ,

aijU  bijU , aijvL  bijvL , aijvU  bijvU

(xiv) A = B iff A  B and B  A.

In the following section, we consider a daily life problem which can be

studied using IVNFMs in better way.

4. Importance of Interval Valued Neutrosophic Fuzzy Matrices

(IVNFMs)

A network consisting of four important cities (vertices) in a country is

considered. They are connected by highways (edges). The number
neighboring to an edge characterizes the distance between the cities
(vertices). The above network can be represented with the help of a classical
matrix A = aij  , i, j = 1, 2,  , n, where, n is the total number of nodes. The
ijth element aij of A is defined as

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
 ON INTERVAL VALUED NEUTROSOPHIC FUZZY  567

 0, if i = j

aij = , the verticesi and j are not directly connected by an adge
 wij , wij is the distance of the road connecting i and j


Thus the adjacent matrix of the network of is

0 15 20 35
15 0 55 40
 
20 55 0 75
 
35 40 75 0

Since the distance between two vertices is identified, precisely, so the

above matrix is obviously a conventional matrix. Generally, the distance
between two cities are crisp value, so the corresponding matrix is crisp
matrix. Now, we study the crowdness of the roads connecting cities. It is clear
that the crowdness of a road clearly, is a fuzzy quantity. The amount of
crowdness depends on the decision makers temperament, practices,
environments, etc. i.e., finally depends on the decision maker. The
measurement of crowdness as a point is a difficult task for the decision
maker. So, here we consider the amount of crowdness as an interval instead
of a point. The aloneness is considered as an interval and also the
indeterminacy is considered as an interval. The crowdness, indeterminacy
and the aloneness of a network cannot be represented as a crisp matrix, it
can be represented appropriately by a matrix which we designate by interval-
valued neutrosophic fuzzy matrices (IVNFMs). The matrix representation of
the traffic crowdness, indeterminacy and aloneness of the network of is
shown in the following IVNFM.

 0, 0, 1,1, 1,1 .1, .3, .2, .4, .2, .5 .2, .4.3, .5, .1, .5 .3, .4, .2, .5, .5, .6 
 .1, .3, .2, .4, .2, .5 0, 0, 1,1, 1,1 .7, .8, .2, .4, 0, .1 .3, .5, .3, .6, .4, .5 
 .
 .2, .4, .3, .5, .1, .5 .7, .8, .2, .4, 0, .1 0, 0, 1,1, 1,1 .5, .6, .1, .3, .2, .3 

 .3, .4, .2, .5, .5, .6 .3, .5, .3, .6, .4, .5 .5, .6, .1, .3, .2, .3 0, 0, 1,1, 1,1 

To explain the meaning of the operators defined earlier we consider two

IVNFMs A and B. Let A and B represent respectively the crowdness,
indeterminacy and loneliness of the network at two time instances t1 and t2 .
Now, the IVNFM A+B represents the maximum amount of traffic
crowdness, the minimum of indeterminacy and the minimum amount of

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
568 R. VIDHYA and R. IRENE HEPZIBAH

aloneness of the network between the time instances t1 and t2 . A  B

represents the minimum amount of traffic crowdness, minimum amount of
indeterminacy and the maximum amount of loneliness of the network. A
matrix represents the aloneness, confidence and crowdness of the network.
A @ B , A$B and A# B reveals the arithmetic mean, geometric mean and
harmonic mean of the crowdness, indeterminacy and aloneness in between
the two time instances t1 and t2 of the network. To illustrate the operators
A  B , A + B and A , we consider a network consisting two vertices and
two edges. The crowdness, indeterminacy and aloneness of the network are
observed at two different time instances t1 and t2 . The matrices A t1 and
At2 represent the status of the network at t1 and at t2 . The number

adjacent to the sides represents the crowdness, indeterminacy and aloneness

of the roads at two different instances of the same network.

Let

 0, 0, 1, 1, 1, 1 .1, .3, .2, .4, .2, .5 
At1 = 
 .1, .3, .2, .4, .2, .5 0, 0, 1, 1, 1, 1 
and

 0, 0, 1,1, 1,1 .2, .4, .3, .5, .1, .5 
At2 =  .
 .2, .4, .3, 5, .1, .5 0, 0, 1,1, 1,1 
 0, 0, 1,1, 1,1 .2, .4, .2, .4, .1, .5 
Then At1 + At2 =  and
 .2, .4, .2, .4, .1, .5 0, 0, 1,1, 1,1 
 0, 0, 1,1, 1,1 .1, .3, .3, .5, .2, .5 
At1  At2 = 
 .1, .3, .3, .5, .2, .5 0, 0, 1,1, 1,1 
At1 = 0, 0 , 1, 1, 1, 1  0, 0 , 1, 1, 1, 1 + .1, .3 , .2, .4 , .2, .5

.1, .3, .2, .4, .2, .5 = 0, 0, 1,1, 1,1 + .1, .3, .2, .4, .2, .5 = .1, .3, .2, .4, .2, .5 .

5. Properties of Interval Valued Neutrosophic Fuzzy Matrices

(IVNFMs)

In this section some properties of IVNFMs are presented. IVNFMs satisfy

the commutative and associative properties over the operators +,  , and ⊙.
The operator ‘.’ is distributed over ‘+’ in left and right but the left and right

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
 ON INTERVAL VALUED NEUTROSOPHIC FUZZY  569

distribution laws do not hold for the operators ⊕ and ⊙.

(1) A + B = B + A
(2) A + (B + C ) = ( A + B ) + C

(3) A  B = B  A

(4) A  (B  C ) = ( A  B )  C

(5) (i) A  (B + C ) = A  B + A  C

(ii) (B + C )  A = B  A + A  C

(6) A  B = B  A

(7) A  (B  C ) = ( A  B )  C

(8) A  B = B  A

(9) A  (B  C ) = ( A  B )  C

(10) (i) A  (B  C )  ( A  B )  ( A  C )

(ii) (B  C )  A  (B  A )  (C  A )

Proof.

(1) Let A =  aijL , aijU , aijL , aijU , aijvL , aijvU  ,

B =  bijL , bijU , bijL , bijU , bijvL , bijvU   and
C =  cijL , cijU , cijL , cijU , cijvL , cijvU  .

max (aijL , bijL ) , max (aijU , bijU ),

A + B = min (aijL , bijL ) , min (aijvU , bijvU )

min (aijvL , bijL ) , min (aijvU , bijvU )

max (bijL , aijL ) , max (bijU , aijU ),

B+ A = min (bijL , aijL ) , min (bijU , aijU ) ,

min (bijvL , aijL ) , min (bijvU , aijvU )

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
570 R. VIDHYA and R. IRENE HEPZIBAH

Therefore, A + B = B + A. Similarly, (2), (3), (4), (5), (6), (7), (8) and (9)
can be proved.

bijL + cijL − bijL  cijL , bijU + cijU − bijU  cijU  ,

 
(10) B  C =  bijL  cijL , bijU  cijU  , 
 bijvL  cijvL , bijvU  cijvU  

 aijL  (bijL + cijL − bijL  cijL ), aijU  (bijU + cijU − bijU  cijU ) 
A  (B  C ) =  aijL + bijL  cijL − aijL  bijL  cijL , aijU + bijU  cijU − aijU  bijU  cijU ) 
 
 aijvL + bijU  cijU − aijvL  bijvL , aijvU + bijvU  cijvU − aijvU  bijvU  cijvU  

 aijL  bijL , aijU  bijU , 

 
A  B =  aijL + bijL − aijL  bijL , aijU + bijU − aijU  bijU   ,
 aijvL + bijvL − aijvL  bijvL , aijvU + bijvU − aijvU  bijvU  

 aijL  cijL , aijU  cijU , 

 
A  C =  aijL + cijL − aijL  cijL , aijU + cijU − aijU  cijU   .
 aijvL + cijvL − aijvL  cijvL + cijvU − aijvU  cijvU  

Now,

 aijL (bijL + cijL ) − aij2L  bijL  cijL , 

 
 aijU (bijU + cijU ) − aij2U  bijU  cijU  , 
 
 (aijvL + bijvL − aijvL  bijvL )  (aijL + cijL − aijL  cijL ), 
( A  B )  ( A C ) =  .
(a + bijU − aijU  bijU )  (aijU + cijU − aijU  cijU ) 
 ijU 
 (aijvL + bijvL − aijvL  bijvL )  (aijvL + cijvL − aijvL  cijvL ), 
 
 (aijvU + bijvU − aijvU  bijvU )  (aijvU + bijvU − aijvU  bijvU ) 
 

So, A  (B  C )  ( A  B )  ( A  C ). Similarly, (B  C )  A  (B  A )
 (C  A ) can be proved.

Property 1. Let A be an IVNFM of any order then, A + A = A.

Proof. Let A =  aijL , aijU , aijL , aijU , aijvL , aijvU  .

max (aijL , aijL ), max (aijU , aijU ),

Then, A + B = min (aijL , aijL ), min (aijU , aijU ) =  aijL , aijU  ,

aijL , aijU , aijvL , aijvU   = A

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
 ON INTERVAL VALUED NEUTROSOPHIC FUZZY  571

min (aijvL , aijL ), min (aijvU , aijvU ).

Property 2 If A be an IVNFM of any order then,

A + I 0, 0 , 0, 0 , 0, 0  A where, I 0, 0 , 0, 0 , 0, 0 is the null IVNFM of

same order.

Proof. Let A =  aijL , aijU , aijL , aijU , aijvL , aijvU   and

I 0, 0 , 0, 0 , 0, 0 = 0, 0, 0, 0, 0, 0 .

max (aijL , 0), max (aijU , 0),

Then, A + I 0, 0 , 0, 0 , 0, 0 = min (aijL , 0 ), min (aijU , 0 ) =

 aijL , aijU 0, 0, 0, 0  min (aijvL , 0 ), min (aijvU , 0 ).

Therefore, A + I 0, 0 , 0, 0 , 0, 0  A.

Some more properties on determinant and adjoint of IVNFM are

presented below.

Property 3. If A be a square IVNFM then A = AT .

Proof. Let A =  aijL , aijU , aijL , aijU , aijvL , aijvU  . Then

AT =  a jiL , a jiU , a jiL , a jiU , a jivL , a jivU  .

a(1)1L , a(1)1U , a(1)1L , a(1)1U , a(1)1vL , a(1)1vU  .

Now,
A T
=  sn
a(2)2L , a(2)2U , a(2)2L , a(2)2U , a(2)2vL , a(2)2vU 
 a (n )nL , a (n )nU  , a (n )nL , a (n )nU , a (n )nvL , a (n )nvU  .

Let  be the permutation of 1, 2,  , n such that   = I , the identity

permutation. Then  =  − 1. As  runs over the whole set of permutations,

so does . Let (i ) = j, i =  −1 ( j ) =  ( j ).

Therefore, a (i )iL = a j ( j )L , a(i )iU = a(i )iU , a (i )i L = a j ( j )L ,

a (i )iL = a j ( j )L , a(i )ivL = a j ( j )vL , a (i )ivL = a j ( j )vL . As i goes over the set

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
572 R. VIDHYA and R. IRENE HEPZIBAH

1, 2,  , n, j does so.

Now, a(1)1L , a(1)1U , a(1)1L , a(1)1U , a(1)1vL , a(1)1vU 

a(2)2L , a(2)2U , a(2)2L , a(2)2U , a(2)2vL , a(2)2vU  
a(n )nL , a(n )nU , a(n )nL , a(n )nU , a(n )nvL , a(n )nvU 

a1(1)L , a1(1)1U , a1 (1)L , a (1)1U , a1 (1)vL , a1 (1)vU 

= a2 (2)L , a2 (2 )U  , a2 (2 )L , a2 (2)U  , a2 (2 )vL , a2 (2 )vU  

an(n )L , an(n )U , an (n )L , an (n )U , an (n )vL , an (n )vU 

a(1)1L , a(1)1U , a(1)1L , a(1)1U , a(1)1vL , a(1)1vU 

Therefore, AT =  sn a(2)2L , a(2)2U , a(2)2L , a(2)2U ,

a(2)2vL , a(2)2vU   = a(n )nL , a(n )nU , a(n )nL , a(n )nU , a(n )nvL , a(n )nvU 

a1(1)L , a1(1)1U , a1 (1)L , a1 (1)1U , a1 (1)vL , a1 (1)vU 

 sn
a2(2)L , a2(2)U , a2 (2)L , a2 (2)U , a2 (2)vL , a2 (2)vU  
A = an(n )L , an(n )U , an (n )L , an (n )U , an (n )vL , an (n )vU  .

Property 4. If A and B be two square IVNFMs and A  B , then, adj

A  adj B.

Proof. Let C =  cijL , cijU , cijL , cijU , cijvL , cijvU   = A,

D =  dijL , dijU , dijL , dijU , dijvL , dijvU   = adj B.

where,
cijL , cijU , cijL , cijU , cijvL , cijvU  =  sni n j  tn j
at (t )L , at(t )U ,

at  (t )L , at(t )U , at  (t )vL , at (t )vU 

and
dijL , dijU , dijL , dijU , dijvL , dijvU  =  sni n j  tn j
bt (t )L , bt(t )U ,

bt (t )L , bt(t )U , bt  (t )vL , bt(t )vU 

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
 ON INTERVAL VALUED NEUTROSOPHIC FUZZY  573

It is clear that cijL , cijU , cijL , cijU , cijvL , cijvU   dijL , dijU ,
dijL , dijU , dijvL , dijvU  . Since, at (t )L  bt (t )L , at (t ) L  bt (t )U ,

at (t )L  bt (t )L , at (t )L  at (t )U and at (t )vL  bt (t )vU for all
t  j, (t )  ( j ).

Therefore C  D , i.e., adj A  adj B.

Property 5. For a square IVNFM A, adj ( A T ) = (adj A )T .

Proof. Let B = adj A, C = adj A T .

Therefore,
bijL , bijU , bijL , bijU , bijvL , bijvU  =  sni n j  tn j
at (t )L , at(t )U ,

at  (t )L , at(t )U , at  (t )vL , at (t )vU  and

cijL , cijU , cijL , cijU , cijvL , cijvU  =  sni n j  tn j

at (t )L , at(t )U ,

at (t )L , at(t )U , at (t )nL , at(t )vU  = bijL , bijU , bijL , bijU , bijvL , bijvU  .

Therefore, adj ( A T ) = (adj A )T .

Property 6. For an IVNFM A , A = adj A .

Proof. A =   AijL , AijU ,  AijL , AijU ,  AijvL , AijvU   where,

  AijL , AijU ,  AijL , AijU ,  AijvL , AijvU   is the cofactor of the element
 aijL , aijU , aijL , aijU , aijvL , aijvU   in the IVNFM A. Therefore,

 A1(1)L , A1(1)U ,  A1(1)L , A1(1)U ,  A1(1)vL , A1(1)vU 

adj A =  sn
 A2(2)L , A2(2)U , A2(2)L , A2(2)U , A2(2)vL , A2(2)vU  
 An(n )L , An(n )U ,  An(n )L , An (n )U ,  An(n )vL , An(n )vU 

 
n
=  Ai(i )L , Ai(i )U ,  Ai(i )L , Ai(i )U , Ai(i )vL , Ai(i )vU 
sn i =1

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
574 R. VIDHYA and R. IRENE HEPZIBAH

 s  i=1  s  tn

n
= at(t )L , at(t )U , at(t )L , at(t )U , at(t )vL , at(t )vU 
n nin(i ) j

=  sn
(  tn1
at1 (t )L , at1 (t )U , at1 (t )L , at1 (t )U , at1 (t )vL , at1 (t )vU  )


(
tn2
at2 (t )L , at2 (t )U , at2 (t )L , at2 (t )U , at2 (t )vL , at2 (t )vU  )

 tn
(
n
atn (t )L , atn (t )U , atn (t )L , atn (t )U , atn (t )vL , atn (t )vU  )

=  sn
( a21 (2)L , a21 (2)U , a21 (2)L , a21 (2)U , a21 (2)vL , a21 (2)vU 

a31 (3)L , a31 (3)U , a31 (3)L , a31 (3)U , a31 (3)vL , a31 (3)vU 

an1 (n )L , an1 (n )U , an1 (n )L , an1 (n )U , an1 (n )vL , an1 (n )vU  )

a12 (1)L , a12 (1)U , a12 (1)L , a12 (1)U , a12 (1)vL , a12 (1)vU 

a32 (3)L , a32 (3)U , a32 (3)L , a32 (3)U , a32 (3)vL , a32 (3)vU 

an2 (n )L , an2 (n )U , an2 (n )L , an2 (n )U , an2 (n )vL , an2 (n )vU  ) 

( a1n (1)L , a1n (1)U , a1n (1)L , a1n (1)U , a1n (1)vL , a1n (1)vU  

a2n (2)L , a22 (2)U , a2n (2)L , a2n (2)U , a2n (2)vL , a2n (2)vU 

an−12 (n−1)L , an−12 (n−1)U , an−12 (n−1)L , an−12 (n−1)U , an−12 (n−1)vL ,
an −12 (n −1)vU  ) where, fˆ   1, 2,  , n\ˆ , ˆ = 1, 2,  , n.

But since,

aˆ fˆ (ˆ )L , aˆ fˆ (ˆ )U , aˆ fˆ (ˆ )L , aˆ fˆ (ˆ )U , aˆ fˆ (ˆ )vL , aˆ fˆ (ˆ )vU 
     

= an (n )L , an (n )U , an  (n )L , an (n )U , an  (n )vL , an (n )vU  .

Therefore

a1(1)L , a1(1)U , a1(1)L , a1(1)U , a1(1)vL , a1(1)vU 

adj A =  sn
a2(2)L , a2(2)U , a2(2)L , a2(2)U , a2(2)vL , a2(2)vU 

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
 ON INTERVAL VALUED NEUTROSOPHIC FUZZY  575

an (n )L , an (n )U , an (n )L , an (n )U , an (n )vL , an (n )vU  = A .

Conclusion

In this work, Interval valued neutrosophic fuzzy matrices are introduced

based on M. Pal et al. [13]. Then the operations on Interval valued
neutrosophic fuzzy matrices are discussed. Some properties on them are
conferred with the real time example. The same operations and properties
can be extended to various Neutrosophic numbers.

References

[1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20 (1986), 87-96.

[2] K. Atanassov, Operations over interval-valued intuitionistic fuzzy sets, Fuzzy Sets and
Systems 64 (1994), 159-174.
[3] H. Hashimoto, Canonical form of a transitive matrix, Fuzzy Sets and Systems 11 (1983),
157-162.
[4] R. Hemasinha, N. R. Pal and J. C. Bezdek, Iterates of fuzzy circulant matrices, Fuzzy
Sets and Systems 60 (1993), 199-206.

[5] S. K. Khan and M. Pal, Some operations on intuitionistic fuzzy matrices, Acta Ciencia
Indica, XXXII M (2) (2006), 515-524.

[6] K. H. Kim and F. W. Roush, Generalised fuzzy matrices, Fuzzy Sets and Systems 4
(1980), 293-315.
[7] W. Kolodziejczyk, Canonical form of a strongly transitive fuzzy matrix, Fuzzy Sets and
Systems 22 (1987), 292-302.

[8] S. Broumi, F. Smarandache and M. Dhar, On fuzzy soft matrix based on reference
function, Information Engineering and Electronic Business 2 (2013), 52-59.

[9] F. Smarandache, Neutrosophic set, A generalisation of the intuitionistic fuzzy sets, Inter.
J. Pure Appl. Math. 24 (2005), 287-297.
[10] J. B. Kim, Determinant theory for fuzzy and boolean matrices, Congressus Numerantium
(1988), 273-276.

[11] M. Pal, Intuitionistic fuzzy determinant, V. U. J. Physical Sciences 7 (2001), 87-93.

[12] M. Pal, S. K. Khan and A. K. Shyamal, Intuitionistic fuzzy matrices, Notes on
Intuitionistic Fuzzy Sets 8(2) (2002), 51-62.

[13] Madhumangal Pal and Susanta K. Khan, Interval valued intuitionistic fuzzy matrices,
NIFS 11 (2005), 16-27.

[14] M. Z. Ragab and E. G. Emam, The determinant and adjoint of a square fuzzy matrix,
Fuzzy Sets and Systems 61 (1994), 297-307.

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021
576 R. VIDHYA and R. IRENE HEPZIBAH

[15] M. G. Ragab and E. G. Emam, On the min-max composition of fuzzy matrices, Fuzzy Sets
and Systems 75 (1995), 83-92.
[16] L. A. Zadeh, Fuzzy sets, Information and Control 8 (1965), 338-353.

Advances and Applications in Mathematical Sciences, Volume 20, Issue 4, February 2021