0% found this document useful (0 votes)

46 views

Soft Rough Neutrosophic Influence Graphs With Application

In this paper, we apply the notion of soft rough neutrosophic sets to graph theory. We develop certain new concepts, including soft rough neutrosophic graphs, soft rough neutrosophic influence graphs, soft rough neutrosophic influence cycles and soft rough neutrosophic influence trees. We illustrate these concepts with examples, and investigate some of their properties. We solve the decision-making problem by using our proposed algorithm.

Uploaded by

Science Direct

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

46 views

Soft Rough Neutrosophic Influence Graphs With Application

Uploaded by

Science Direct

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 37

mathematics

Article
Soft Rough Neutrosophic Influence
Graphs with Application
Hafsa Masood Malik 1 , Muhammad Akram 1, ∗ and Florentin Smarandache 2
1 Department of Mathematics, University of the Punjab, New Campus, Lahore 54590, Pakistan;
[email protected]
2 University of New Mexico Mathematics & Science Department 705 Gurley Ave., Gallup, NM 87301, USA;
[email protected]
* Correspondence: [email protected]

Received: 28 June 2018; Accepted: 15 July 2018; Published: 18 July 2018

Abstract: In this paper, we apply the notion of soft rough neutrosophic sets to graph theory.
We develop certain new concepts, including soft rough neutrosophic graphs, soft rough neutrosophic
influence graphs, soft rough neutrosophic influence cycles and soft rough neutrosophic influence
trees. We illustrate these concepts with examples, and investigate some of their properties. We solve
the decision-making problem by using our proposed algorithm.

Keywords: soft rough neutrosophic graphs; soft rough neutrosophic influence graphs; soft rough
neutrosophic influence cycles; soft rough neutrosophic influence trees

1. Introduction
Smarandache [1] introduced neutrosophic sets as a generalization of fuzzy sets and intuitionistic
fuzzy sets. A neutrosophic set has three constituents: truth-membership, indeterminacy-membership
and falsity-membership, in which each membership value is a real standard or non-standard subset of
the unit interval
]0− , 1+ [. In real-life problems, neutrosophic sets can be applied more appropriately by using
the single-valued neutrosophic sets defined by Smarandache [1] and Wang et al. [2]. Ye [3,4] and
Peng et al. [5] further extended the study of neutrosophic sets. Soft set theory [6] was proposed by
Molodtsov in 1999 to deal with uncertainty in a parametric manner. Babitha and Sunil discussed the
concept of soft set relation [7]. On the other hand, Pawlak [8] proposed the notion of rough sets. It is a
rigid appearance of modeling and processing partial information. It has been effectively connected
to decision analysis, machine learning, inductive reasoning, intelligent systems, pattern recognition,
signal analysis, expert systems, knowledge discovery, image processing, and many other fields [9–12].
In literature, rough theory has been applied in different field of mathematics [13–16]. Dubois and
Prade [17] developed two concepts called rough fuzzy sets and fuzzy rough sets and concluded that
these two theories are different approaches to handle vagueness. Feng et al. [18] combined soft sets
with fuzzy sets and rough sets. Meng et al. [19] dealt with soft rough fuzzy sets and soft fuzzy rough
sets. Broumi et al. [20] studied rough neutrosophic sets. Yang et al. [21] proposed single-valued
neutrosophic rough sets, and established an algorithm for decision-making problem based on single-
valued neutrosophic rough sets on two universes.
A graph is a convenient way of representing information involving relationship between objects.
The objects are represented by vertices and relations by edges. When there is vagueness in the
description of the objects or in its relationships or in both, it is natural that we need to design a fuzzy
graph model. Fuzzy models has vital role as their aspiration in decreasing the irregularity between the
traditional numerical models used in engineering and sciences and the symbolic models used in expert

Mathematics 2018, 6, 125; doi:10.3390/math6070125 www.mdpi.com/journal/mathematics

Mathematics 2018, 6, 125 2 of 37

systems. The fuzzy graph theory as a generalization of Euler’s graph theory was first introduced by
Kaufmann [22]. Later, Rosenfeld [23] considered fuzzy graphs and obtained analogs of several graph
theoretical concepts. Mordeson and Peng [24] defined some operations on fuzzy graphs. Mathew
and Sunitha [25,26] presented some new concepts on fuzzy graphs. Gani et al. [27–30] discussed
several concepts, including size, order, degree, regularity and edge regularity in fuzzy graphs and
intuitionistic fuzzy graphs. Parvathi and Karunambigai [31] described some operation on intuitionistic
fuzzy graph. Recently, Akram et al. [32–36] has introduced several extensions of fuzzy graphs with
applications. Denish [37] considered the idea of fuzzy incidence graph. Fuzzy incidence graphs were
further studied in [38,39]. Due to the limitation of humans knowledge to understand the complex
problems, it is very difficult to apply only a single type of uncertainty method to deal with such
problems. Therefore, it is necessary to develop hybrid models by incorporating the advantages of
many other different mathematical models dealing uncertainty. Recently, new hybrid models, including
rough fuzzy graphs [40,41], fuzzy rough graphs [42], intuitionistic fuzzy rough graphs [43,44], rough
neutrosophic graphs [45] and neutrosophic soft rough graphs [46] are constructed. For other notations
and definitions, the readers are refereed to [47–51]. In this paper, we apply the notion of soft rough
neutrosophic sets to graph theory. We develop certain new concepts, including soft rough neutrosophic
graphs, soft rough neutrosophic influence graphs, soft rough neutrosophic influence cycles and soft
rough neutrosophic influence trees. We illustrate these concepts with examples, and investigate some
of their properties. We solve decision-making problem by using our proposed algorithm.
This paper is organized as follows. In Section 2, some definitions and some properties of soft
rough neutrosophic graphs are given. In Section 3, soft rough neutrosophic influence graphs, soft rough
neutrosophic influence cycles and soft rough neutrosophic influence trees are discussed. In Section 4,
an application is presented. Finally, we conclude our contribution with a summary in Section 5 and an
outlook for the further research.

2. Soft Rough Neutrosophic Graphs

Definition 1. Let B be Boolean set and A a set of attributes. For an arbitrary full soft set S over B such
that Ss ( a)⊂ B, for some a∈ A, where Ss :A→P ( B) is a set-valued function defined as Ss ( a)={b∈ B|( a,b)∈S},
for all a∈ A. Let ( B,S) be a full soft approximation space. For any neutrosophic set N ={(b,TN (b),IN (b),FN (b))|
b∈ B}∈ N ( B), where N ( B) is neutrosophic power set of set B. The upper and lower soft rough neutrosophic
approximations of N w.r.t ( B,S), denoted by S( N ) and S( N ), respectively, are defined as follows:

S( N )={(b, TS( N ) (b), IS( N ) (b), FS( N ) (b)) | b ∈ B} ,

S( N )={(b, TS( N ) (b), IS( N ) (b), FS( N ) (b)) | b ∈ B},

where
^ _ _ ^
TS( N ) (b)= TN (t), TS( N ) (b) = TN (t),
b ∈ Ss ( a ) t ∈ Ss ( a ) b ∈ Ss ( a ) t ∈ Ss ( a )
_ ^ ^ _
IS( N ) (b) = IN (t) , IS( N ) (b) = I N ( t ), (1)
b ∈ Ss ( a ) t ∈ Ss ( a ) b ∈ Ss ( a ) t ∈ Ss ( a )
_ ^ ^ _
FS( N ) (b)= FN (t) , FS( N ) (b) = FN (t).
b ∈ Ss ( a ) t ∈ Ss ( a ) b ∈ Ss ( a ) t ∈ Ss ( a )

In other words,
_
^
TS( N ) (b) = (1 − S( a, b)) ∨ S( a, t) ∧ TN (t) ,
a∈ A t∈ B
^
_
TS( N ) (b) = S( a, b) ∧ (1 − S( a, t)) ∨ TN (t) ,
a∈ A t∈ B
Mathematics 2018, 6, 125 3 of 37

^
_
IS( N ) (b) = S( a, b) ∧ (1 − S( a, t)) ∨ IN (t) ,
a∈ A t∈ B
_
^
IS( N ) (b) = (1 − S( a, b)) ∨ S( a, t) ∧ IN (t) ,
a∈ A t∈ B
^
_
FS( N ) (b) = S( a, b) ∧ (1 − S( a, t)) ∨ FN (t) ,
a∈ A t∈ B
_
^
FS( N ) (b) = (1 − S( a, b)) ∨ S( a, t) ∧ FN (t) .
a∈ A t∈ B

The pair (S( N ),S( N )) is called soft rough neutrosophic set (SRNS) of N w.r.t ( B,S).

Example 1. Suppose N ={(b1 ,0.8,0.3,0.16),(b2 ,0.85,0.24,0.2),(b3 ,0.79,0.2,0.2),(b4 ,0.85,0.36,0.25),(b5 ,0.82,0.25,0.25)}

is a neutrosophic set on the universal set B={b1 ,b2 ,b3 ,b4 ,b5 } under consideration. Let A={ a1 ,a2 ,a3 } be a set of
parameter on B. A full soft set over B, denoted by S, is defined in Table 1.

Table 1. Full soft set S.

S b1 b2 b3 b4 b5
a1 0 0 1 0 1
a2 1 0 1 0 0
a3 0 1 1 1 1

A set-valued function Ss :A→P ( B) is defined as Ss ( a1 )={b3 ,b5 },Ss ( a2 )={b1 ,b3 },Ss ( a3 )={b2 ,b3 ,b4 ,b5 }.
From Equation (1) of Definition 1, we have
_
TS( A) (b1 ) = N (y)=∨{0.8, 0.79}=0.80,
y ∈ Ss ( a2 )
^
IS( N ) (b1 ) = N (y)=∧{0.3, 0.2} =0.20,
y ∈ Ss ( a2 )
^
FS( N ) (b1 ) = N (y)=∧{0.16, 0.2}=0.16;
y ∈ Ss ( a2 )
^
TS( N ) (b1 ) = N (y)=∧{0.8, 0.79}=0.79,
y ∈ Ss ( a2 )
_
IS( N ) (b1 ) = N (y)=∨{0.3, 0.2} =0.30,
y ∈ Ss ( a2 )
_
FS( N ) (b1 ) = N (y)=∨{0.16, 0.2}=0.20.
y ∈ Ss ( a2 )

Similarly,
TS( N ) (b2 ) = 0.85, IS( N ) (b2 ) = 0.20, FS( N ) (b2 ) = 0.20,

TS( N ) (b3 ) = 0.80, IS( N ) (b3 ) = 0.20, FS( N ) (b3 ) = 0.20,

TS( N ) (b4 ) = 0.85, IS( N ) (b4 ) = 0.20, FS( N ) (b4 ) = 0.20,

TS( N ) (b5 ) = 0.82, IS( N ) (b5 ) = 0.20, FS( N ) (b5 ) = 0.20;

TS( N ) (b2 ) = 0.79, IS( N ) (b2 ) = 0.36, FS( N ) (b2 ) = 0.25,

TS( N ) (b3 ) = 0.79, IS( N ) (b3 ) = 0.25, FS( N ) (b3 ) = 0.20,

TS( N ) (b4 ) = 0.79, IS( N ) (b4 ) = 0.36, FS( N ) (b4 ) = 0.25,

Mathematics 2018, 6, 125 4 of 37

TS( N ) (b5 ) = 0.79, IS( N ) (b5 ) = 0.25, FS( N ) (b5 ) = 0.25.

Thus, we obtain

S( N )={(b1 , 0.80, 0.20, 0.16), (b2 , 0.85, 0.20, 0.20), (b3 , 0.80, 0.20, 0.20),
(b4 , 0.85, 0.20, 0.20), (b5 , 0.82, 0.20, 0.20)},
S( N )={(b1 , 0.79, 0.30, 0.20), (b2 , 0.79, 0.36, 0.25), (b3 , 0.79, 0.25, 0.20),
(b4 , 0.79, 0.36, 0.25), (b5 , 0.79, 0.25, 0.25)}.

Definition 2. A soft rough neutrosophic relation(SRNR) ( R( M ),R( M )) on B̃= B× B is a soft rough

neutrosophic set, R: Ã( A× A)→P ( B̃) is a full soft set on B̃ and defined by

R( akl , bij ) ≤ min{S( ak , bi ), S( al , b j )},

for all ( akl ,bij )∈ R, such that Rs ( akl )⊂ B̃ for some akl ∈ Ã, where Rs : Ã→P ( B̃) is a set-valued function, for all
akl ∈ Ã, defined by
Rs ( akl ) = {bij ∈ B̃ | ( akl , bij ) ∈ R}, bij ∈ B̃.

For any neutrosophic set M ∈N ( B̃), the upper and lower soft rough neutrosophic approximation of M
w.r.t ( B̃,R) are defined as follows:

R( M)={(bij , TR( M) (bij ), IR( M) (bij ), FR( M) (bij )) | bij ∈ B̃} ,

R( M)={(bij , TR( M) (bij ), IR( M) (bij ), FR( M) (bij )) | bij ∈ B̃},

where
^ _ _ ^
TR( M) (bij )= TM (tij ), TR( M) (bij ) = TM (tij ),
bij ∈ Rs ( akl ) tij ∈ Rs ( akl ) bij ∈ Rs ( akl ) tij ∈ Rs ( akl )
_ ^ ^ _
IR( M) (bij ) = I M (tij ) , IR( M) (bij ) = I M (tij ), (2)
bij ∈ Rs ( akl ) tij ∈ Rs ( akl ) bij ∈ Rs ( akl ) tij ∈ Rs ( akl )
_ ^ ^ _
FR( M) (bij )= FM (tij ) , FR( M) (bij ) = FM (tij ).
bij ∈ Rs ( akl ) tij ∈ Rs ( akl ) bij ∈ Rs ( akl ) tij ∈ Rs ( akl )

In other words,
_
^
TR( M) (bij ) = (1 − R( akl , bij )) ∨ R( akl , tij ) ∧ TM (tij ) ,
akl ∈ A tij ∈ B
^
_
TR( M) (bij ) = R( akl , bij ) ∧ (1 − R( akl , tij )) ∨ TM (tij ) ,
akl ∈ A tij ∈ B
^
_
IR( M) (bij ) = R( akl , bij ) ∧ (1 − R( akl , tij )) ∨ IM (tij ) ,
akl ∈ A tij ∈ B
_
^
IR( M) (bij ) = (1 − R( akl , bij )) ∨ R( akl , tij ) ∧ I M (tij ) ,
akl ∈ A tij ∈ B
^
_
FR( M) (bij ) = R( akl , bij ) ∧ (1 − R( akl , tij )) ∨ FM (tij ) ,
akl ∈ A tij ∈ B
_
^
FR( M) (bij ) = (1 − R( akl , bij )) ∨ R( akl , tij ) ∧ FM (tij ) .
akl ∈ A tij ∈ B
Mathematics 2018, 6, 125 5 of 37

If R( M )= R( M ), then it is called induced soft rough neutrosophic relation on soft rough neutrosophic set,
otherwise, soft rough neutrosophic relation.

Remark 1. For a neutrosophic set M on B̃ and a neutrosophic set N on B, we have neutrosophic relation
as follow

TM (bij ) ≤min{ TN (bi )}, I M (bij )≤ min{ IN (bi )}, FM (bij )≤ min{ FN (bi )}.
i i i

From Definition 2, it follows that:

TR( M) (bij ) ≤min{ TS( N ) (bi ), TS( N ) (b j )}, TR( M) (bij ) ≤min{ TS( N ) (bi ), TS( N ) (b j )},
IR( M) (bij ) ≤ max{ IS( N ) (bi ), IS( N ) (b j )}, IR( M) (bij ) ≤ max{ IS( N ) (bi ), IS( N ) (b j )},
FR( M) (bij ) ≤max{ FS( N ) (bi ), FS( N ) (b j )}, FR( M) (bij ) ≤max{ FS( N ) (bi ), FS( N ) (b j )}.

Definition 3. In Definition 2 bij is called effective, if

TR( M) (bij )= TS( N ) (bi ) ∧ TSN (b j ), TR( M) (bij )= TS( N ) (bi ) ∧ TSN (b j ),
IR( M) (bij ) = IS( N ) (bi ) ∨ ISN (b j ), IR( M) (bij ) = IS( N ) (bi ) ∨ ISN (b j ),
FR( M) (bij )= FS( N ) (bi ) ∨ FSN (b j ), FR( M) (bij )= FS( N ) (bi ) ∨ FSN (b j ).

Definition 4. A soft rough neutrosophic influence (SRNI) is a relation from soft rough neutrosophic set to soft
rough neutrosophic relation, denoted by ( X ( Q),X ( Q)) on B̂= B× B̃, where X: Â( A× Ã)→P ( B̂) is a full soft
set on B̂ defined by
X ( al amn , bi b jk ) ≤ S( al , bi ) ∧ R( amn , b jk ),

for all ( al amn ,bi b jk )∈ X and for some i 6= j6=k and l 6=m6=n. Let Xs : Â→P ( B̂) be a set-valued function defined by

Xs ( al amn ) = {bi b jk ∈ B̂|( al amn , (bi , , b jk )) ∈ X }, ∀( a, lamn ) ∈ Â,

For any Q∈N ( B̂), the upper and lower soft rough neutrosophic approximation of Q w.r.t ( B̂,X ), for all
bi b jk ∈ B̂, are defined as follows:

X ( Q)={(bi b jk , TX (Q) (bi b jk ), IX (Q) (bi b jk ), FX (Q) (bi b jk ))},

where
^ _
TX (Q) (bi b jk )= TQ (ti t jk ) ,
bi b jk ∈ Xs ( al amn ) ti t jk ∈ Xs ( al amn )
_ ^
TX (Q) (bi b jk )= TQ (ti t jk ) ,
bi b jk ∈ Xs ( al amn ) ti t jk ∈ Xs ( al amn )
_ ^
IX (Q) (bi b jk ) = IQ (ti t jk ),
bi b jk ∈ Xs ( al amn ) ti t jk ∈ Xs ( al amn )
^ _
IX (Q) (bi b jk ) = IQ (ti t jk ) , (3)
bi b jk ∈ Xs ( al amn ) ti t jk ∈ Xs ( al amn )
_ ^
FX (Q) (bi b jk )= FQ (ti t jk ),
bi b jk ∈ Xs ( al amn ) ti t jk ∈ Xs ( al amn )
Mathematics 2018, 6, 125 6 of 37

^ _
FX (Q) (bi b jk )= FQ (ti t jk ) .
bi b jk ∈ Xs ( al amn ) ti t jk ∈ Xs ( al amn )

In other words,
_
^
TX (Q) (bi b jk ) = (1 − X ( al amn , bi b jk )) ∨ X ( al amn , ti t jk ) ∧ TQ (ti t jk ) ,
al amn ∈ A ti t jk ∈ B
^
_
TX (Q) (bi b jk ) = X ( al amn , bi b jk ) ∧ (1 − X ( al amn , ti t jk )) ∨ TQ (ti t jk ) ,
al amn ∈ A ti t jk ∈ B
^
_
IX (Q) (bi b jk ) = X ( al amn , bi b jk ) ∧ (1 − X ( al amn , ti t jk )) ∨ IQ (ti t jk ) ,
al amn ∈ A ti t jk ∈ B
_
^
IX (Q) (bi b jk ) = (1 − X ( al amn , bi b jk )) ∨ X ( al amn , ti t jk ) ∧ IQ (ti t jk ) ,
al amn ∈ A ti t jk ∈ B
^
_
FX (Q) (bi b jk ) = X ( al amn , bi b jk ) ∧ (1 − X ( al amn , ti t jk )) ∨ FQ (ti t jk ) ,
al amn ∈ A ti t jk ∈ B
_
^
FX (Q) (bi b jk ) = (1 − X ( al amn , bi b jk )) ∨ X ( al amn , ti t jk ) ∧ FQ (ti t jk ) .
al amn ∈ A ti t jk ∈ B

Remark 2. For a neutrosophic set Q on B̂ and a neutrosophic set N and M on B and B̃, respectively, we have
neutrosophic relation as follow

TQ (bi b jk ) ≤min{ TM (b jk )}, IQ (bi b jk ) ≤ min{ I M (b jk )}, FQ (bi b jk ) ≤min{ FM (b jk )}.

jk jk jk

From Definition 4, we have

TX (Q) (bi b jk ) ≤min{ TS( N ) (bi ), TR( M) (b jk )}, TX (Q) (bi b jk )≤ min{ TS( N ) (bi ), TR( M) (b jk )},
IX (Q) (bi b jk ) ≤ max{ IS( N ) (bi ), IR( M) (b jk )}, IX (Q) (bi b jk )≤ max{ IS( N ) (bi ), IR( M) (b jk )},
FX (Q) (bi b jk ) ≤max{ FS( N ) (bi ), FR( M) (b jk )}, FX (Q) (bi b jk )≤ max{ FS( N ) (bi ), FR( M) (b jk )}.

Definition 5. In Definition 4 bi b jk is called influence effective, if

TX (Q) (bi b jk )= TS( N ) (bi ) ∧ TRM (bij ), TX (Q) (bi b jk )= TS( N ) (bi ) ∧ TRM (bij ),
IX (Q) (bi b jk ) = IS( N ) (bi ) ∨ IRM (bij ), IX (Q) (bi b jk ) = IS( N ) (bi ) ∨ IRM (bij ),
FX (Q) (bi b jk )= FS( N ) (bi ) ∨ FRM (bij ), FX (Q) (bi b jk )= FS( N ) (bi ) ∨ FRM (bij ).

Example 2. Let a full soft set S on an universal set B={b1 ,b2 ,b3 ,b4 } with A={ a1 ,a2 ,a3 } a set of parameters
can be defined in tabular form as Table 2 as follows:

Table 2. Full soft set S.

S b1 b2 b3 b4
a1 1 1 0 1
a2 0 0 1 1
a3 1 1 1 1

Now, we can define set-valued function Ss such that

Ss ( a1 ) = {b1 , b2 , b4 }, Ss ( a2 ) = {b3 , b4 }, Ss ( a3 ) = {b1 , b2 , b3 , b4 }.

Mathematics 2018, 6, 125 7 of 37

Let N = {(b1 ,1.0,0.0,0.0),(b2 ,0.8,0.0,0.1),(b3 ,0.5,0.5,0.5),(b4 ,0.4,0.7,0.3)} be a neutrosophic set on B,

then by using Equation (1) of Definition 1, we have

S( N ) = {(b1 , 1.0, 0.0, 0.0), (b2 , 1.0, 0.0, 0.0), (b3 , 0.5, 0.5, 0.3), (b4 , 0.5, 0.5, 0.3)},

S( N ) = {(b1 , 0.4, 0.7, 0.3), (b2 , 0.4, 0.7, 0.3), (b3 , 0.4, 0.7, 0.5), (b4 , 0.4, 0.7, 0.3)}.

Hence (S( N ), S( N )) is soft rough neutrosophic set. Let a full soft set R on C ={b12 ,b22 ,b23 , b32 ,b42 }⊆ B̃
with L={ a13 ,a21 ,a32 }⊆ Ã can be defined in Table 3 (from L to C) as follows:

Table 3. Full soft set R.

R b12 b22 b23 b32 b42

a13 1 1 1 0 1
a21 0 0 0 1 0
a32 0 0 1 0 0

Now, we can define set-valued function Rs such that

Rs ( a13 ) = {b12 , b22 , b23 , b42 }, Rs ( a21 ) = {b32 }, Rs ( a32 ) = {b23 }.

and M = {(b12 ,0.4,0.0,0.0),(b22 ,0.4,0.0,0.0),(b23 ,0.4,0.0,0.0),(b32 ,0.4,0.0,0.0),(b42 ,0.4,0.0,0.0)} a neutrosophic

relation on B, then by using Equation (2) of Definition 2, we get

R( M )={(b12 , 0.4, 0.0, 0.0),(b22 , 0.4, 0.0, 0.0),(b23 , 0.4, 0.0, 0.0),(b32 , 0.4, 0.0, 0.0),(b42 , 0.4, 0.0, 0.0)},
R( M )={(b12 , 0.4, 0.0, 0.0),(b22 , 0.4, 0.0, 0.0),(b23 , 0.4, 0.0, 0.0),(b32 , 0.4, 0.0, 0.0),(b42 , 0.4, 0.0, 0.0)}.

Hence ( R( M ), R( M )) is an induced soft rough neutrosophic relation. Let a full soft set X on
D ={b1 b22 ,b1 b23 ,b1 b32 ,b1 b42 ,b3 b12 ,b3 b22 ,b3 b42 ,b4 b12 ,b4 b22 ,b4 b23 ,b4 b32 }⊆ B̂ with P={ a13 ,a21 ,a32 }⊆ Â can be
defined in Table 4 (from P to D) as follows:

Table 4. Full soft set X.

X b1 b22 b1 b23 b1 b32 b1 b42 b3 b12 b3 b22 b3 b42 b4 b12 b4 b22 b4 b23 b4 b32
a1 a32 0 1 0 0 0 0 0 0 0 1 0
a2 a13 0 0 0 0 0 1 1 1 1 1 1
a3 a21 0 1 0 0 0 0 0 0 0 0 1

Since X is not full soft set on D, therefore, soft rough neutrosophic influence cannot be defined on D.

Definition 6. A soft rough neutrosophic graph on a nonempty V is a 5-ordered tuple G =( A,S,SN,R,RM)

such that

(i) A is a set of attributes,

(ii) S is an arbitrary full soft set over V,
(iii) R is an arbitrary full soft set over E ⊆ Ṽ,
(vi) SN =(S( N ),S( N )) is a soft rough neutrosophic set of V,
(v) RM=( R( M ),R( M)) is a soft rough neutrosophic set on E ⊂ Ṽ,

In other words G =( G,G )=(SN,RM) is a soft rough neutrosophic graph(SRNG), where

G =(S( N ),R( M )) and G =(S( N ),R( M )) are lower soft rough neutrosophic approximate graphs (LSRNAGs)
and upper soft rough neutrosophic approximate graphs (USRNAGs), respectively, of G =(SN,RM).
Mathematics 2018, 6, 125 8 of 37

Example 3. Let V ={v1 ,v2 ,v3 ,v4 ,v5 ,v6 } be a vertex set and A={ a1 ,a2 ,a3 } a set of parameters. A full soft set
S from A on V can be defined in tabular form in Table 5 as follows:

Table 5. Full soft set S.

S v1 v2 v3 v4 v5 v6
a1 1 1 1 1 1 0
a2 0 0 1 1 1 1
a3 1 1 0 0 1 1

Let N ={(v1 ,0.8,0.6,0.4),(v2 ,0.9,0.4,0.45),(v3 ,0.7,0.4,0.35),(v4 ,0.6,0.3,0.5),(v5 ,0.4,0.7,0.6),(v6 ,0.5,0.5,0.5)}

be a neutrosophic set on V. Then from Equation (1) of Definition 1, we have

S( N )={(v1 , 0.9, 0.4, 0.4),(v2 , 0.9, 0.4, 0.4),(v3 , 0.7, 0.3, 0.5),(v4 , 0.7, 0.3, 0.5),(v5 , 0.7, 0.4, 0.5),
(v6 , 0.7, 0.4, 0.5)},
S( N )={(v1 , 0.4, 0.7, 0.6),(v2 , 0.4, 0.7, 0.6),(v3 , 0.4, 0.7, 1.0),(v4 , 0.4, 0.7, 1.0),(v5 , 0.4, 0.7, 0.6),
(v6 , 0.4, 0.7, 0.6)}.

Hence, SN =(S( N ),S( N )) is a soft rough neutrosophic set on V. Let E={v11 ,v15 ,v16 ,v23 ,v25 ,v34 ,v41 ,v43 ,
v56 ,v62 ,v63 }⊆Ṽ and L={ a12 ,a13 ,a21 ,a23 ,a31 }⊆ Ã. Then a full soft set R on E (from L to E) can be defined in
Table 6 as follows:

Table 6. Full soft set R.

R v11 v15 v16 v23 v25 v34 v41 v43 v56 v62 v63
a12 0 1 1 1 1 1 0 1 1 0 0
a13 1 1 1 0 1 0 1 0 1 0 0
a21 0 0 0 0 0 1 1 1 0 1 1
a23 0 0 0 0 0 0 1 0 1 1 0
a31 1 1 0 1 1 0 0 0 0 1 0

Let M ={(v11 ,0.4,0.3,0.35),(v15 ,0.3,0.3,0.2),(v16 ,0.3,0.2,0.25),(v23 ,0.4,0.1,0.1),(v25 ,0.4,0.2,0.0),(v34 ,0.3,

0.1,0.3),(v41 ,0.2,0.1,0.2),(v43 ,0.4,0.28,0.2),(v56 ,0.4,0.3,0.3),(v62 ,0.35,0.25,0.32),(v63 ,0.4,0.12,0.34)} be a
neutrosophic set on E. Then from Equation (2) of Definition 2, we have

R( M )={(v11 , 0.4, 0.1, 0.00), (v15 , 0.4, 0.10, 0.00), (v16 , 0.4, 0.10, 0.00), (v23 , 0.4, 0.10, 0.00),
(v25 , 0.4, 0.1, 0.00), (v34 , 0.4, 0.10, 0.20), (v41 , 0.4, 0.10, 0.30), (v43 , 0.4, 0.10, 0.20),
(v56 , 0.4, 0.1, 0.30), (v62 , 0.4, 0.10, 0.30), (v63 , 0.4, 0.10, 0.20)},
R( M )={(v11 , 0.3, 0.3, 0.35), (v15 , 0.3, 0.30, 0.35), (v16 , 0.3, 0.30, 1.00), (v23 , 0.3, 0.30, 0.35),
(v25 , 0.3, 0.3, 0.35), (v34 , 0.3, 0.28, 0.34), (v41 , 0.2, 0.28, 0.32), (v43 , 0.3, 0.28, 0.34),
(v56 , 0.3, 0.3, 0.32), (v62 , 0.3, 0.28, 0.32), (v63 , 0.2, 0.28, 0.34)}.

Hence, RM=( R( M ),R( M)) is soft rough neutrosophic set on E. Thus, G =(S( N ),R( M )) and
G =(S( N ),R( M)) are LSRNAG and USRNAG, respectively, as shown in Figure 1.
Mathematics 2018, 6, 125 9 of 37

(0 v1 (0.4, 0.7, 0.6) v) 3 (0.4, 0.7, 0.1)

.3
,0 v2 (0.4, 0.7, 0.6)
, 0 . 3 , 0 .3 5
.3 b b (0.3 b
,0
.3 34)
5) (0 8, 0.

(0.2,
(0.3, 0 , 0 . 2
.3 , .3 , 1 .0 (0.3
.32)
0 .3 )
, 0. (0.3

0
.2 8 , 0
35 , 0 .2
(0.2, 0.28, 0
‘ ) 8, 0
) .3 2 )
3 4 (0.3, 0.3, 0.35)

.3 4 )
, 0 .
8
, 0 .2 32)
(0.3 b
, 0 . 3, 0. b

v4 (0.4, 0.7, 0.1)

b
(0.3 v6 (0.4, 0.7, 0.6)
v5 (0.4, 0.7, 0.6)
(S(N ), R(M ))

(0 v1 (0.9, 0.4, 0.4) 0) v3 (0.7, 0.3, 0.5)

.4 v2 (0.9, 0.4, 0.4) 0 .1 , 0 .
,0
.1
b b (0.4, b

,0
.0 (0.4, )
) 0 .1 , 0 0 .2
(0.4, 0.1, 0.0)

(0.4,
(0.
4, 0 .0 ) , 0 .1 ,
)

4
(0(. 0.4
(0.4, 0.1, 0.3

.1 ,
0 .0

0
, 0 .1

.1 , 0 .
2) ) , 0 .3
. 1 , 0. )
4, 0

2)
(0. 3)
0 .1 , 0 .
b b
(0.4, b

v4 (0.7, 0.3, 0.5) v6 (0.7, 0.4, 0.5)

v5 (0.7, 0.4, 0.5)

(S(N ), R(M ))

Figure 1. Soft rough neutrosophic graph G = ( G, G ).

Figure 1: Soft rough neutrosophic graph G = (G, G)
Hence, G =( G,G ) is SRNG.

efinition 2.9.Definition
A strength 7. An of soft rough
underlying neutrosophic
graph(supporting ∗ =( G ∗ ,G ∗denoted
graph) Ggraph, by stren,
) of a soft rough is defined
neutrosophic graph as
∗ ∗ ∗
G =( G,G ) is of the form G ∗ =(V ∗ ,E∗ ) and G =(V ,E ),
^ ^ _
stren= (V =LowerTVertex
∗
R(M)Set(v={jkv))∈∧ TS( N ) (v) 6=T0,R(M)
V |( IS( N ) ((v 6= )),
v)jk 0, FS(( N ) (v) 6= 0I}R(M)
, (vjk ))∨
∗ ∗
Vvjk=∈E
Upper Vertex Set={v ∈ V | Tv (v) ∗6= 0, IS( N ) (v) 6= 0, FS(vNjk
N )∈E
S(jk
∈E ∗
) ( v ) 6 = 0},
_ Edge Set ={vij ∈ E|TR_
E∗ =Lower ( M) ( vij ) 6 = 0, IR( M) ( vij ) 6 = 0, FR_
( M) ( vij ) 6 = 0},
(∗
E =Upper Edge
IR(M) (vjk )), ( F R(M) (v jk )) ∨ (
Set ={vij ∈ E| TR( M) (vij ) 6= 0, IR( M) (vij ) 6= 0, FR( M) (vij ) 6=
FR(M) 0}.
(vjk )) .
∗ vjk ∈E ∗ ∗
vjk ∈E vjk ∈E
Definition 8. A soft rough neutrosophic graph has a walk if each approximation graph has an alternative
sequence of the form
v 0 , e0 , v 1 , e1 , v 2 , · · · , v n −1 , e n −1 , v n
efinition 2.10.
suchA
thatstrongest path joining any two vertices vi and vk is the soft rough neutrosophic p
E G (vi , vk ) or E ∞ (vi , vk ), is called stren
∗ ∗ ∗
ich has maximum strength from vi and vk ∈vV ek ∈ E∗ , vk by
k , , denoted ∈ VCON
, ek ∈ N
connectednesswhere
fromek =vvik(and vk .∀k=0,1,2,· · · ,n−1. If v0 = vn , then it is called closed walk. If the edges are distinct,
k +1) ∈ E,
then it is called a soft rough neutrosophic trail (SRN trail). If the vertices are distinct, then it is called a soft
efinition 2.11. Aneutrosophic
rough soft rough path neutrosophic
(SRN path). If a pathgraph is ais closed,
in a SRNG cyclethen
if and only
it is called if the underlying graphs of e
a cycle.
proximation is a cycle. A soft rough neutrosophic cycle is a soft rough neutrosophic graph if and on
∗
supporting graph of each approximation graph is a cycle and there exist vlm ,vij ∈E ∗ ,vlm ,vij ∈E
m 6=vij such that
^ ^
R(M )(vij ) = R(M )(vlm ), R(M )(vij ) = R(M )(vlm ).
vlm ∈E ∗ −vij vlm ∈E −vij
∗
Mathematics 2018, 6, 125 10 of 37

Definition 9. A strength of soft rough neutrosophic graph, denoted by stren, is defined as

^ ^ _
stren= ( TR( M) (v jk )) ∧ ( TR( M) (v jk )), ( IR( M) (v jk ))∨
v jk ∈ E∗ v jk ∈ E
∗ v jk ∈ E∗

_ _ _
( IR( M) (v jk )), ( FR( M) (v jk )) ∨ ( FR( M) (v jk )) .
∗ v jk ∈ E∗ ∗
v jk ∈ E v jk ∈ E

Definition 10. A strongest path joining any two vertices vi and vk is the soft rough neutrosophic path which has
maximum strength from vi and vk , denoted by CONNG (vi , vk ) or E∞ (vi , vk ), is called strength of connectedness
from vi and vk .

Definition 11. A soft rough neutrosophic graph is a cycle if and only if the underlying graphs of each
approximation is a cycle. A soft rough neutrosophic cycle is a soft rough neutrosophic graph if and only
∗
if the supporting graph of each approximation graph is a cycle and there exist vlm ,vij ∈ E∗ ,vlm ,vij ∈ E and
vlm 6=vij such that
^ ^
R( M)(vij ) = R( M)(vlm ), R( M)(vij ) = R( M)(vlm ).
vlm ∈ E∗ −vij ∗
vlm ∈ E −vij

Equivalently, each approximation graph is a cycle such that

^ _ _
R( M)(vij )= TR( M) (vlm ), IR( M) (vlm ), FR( M) (vlm ) ,
vlm ∈ E∗ −vij vlm ∈ E∗ −vij vlm ∈ E∗ −vij
^ _ _
R( M)(vij )= TR( M) (vlm ), IR( M) (vlm ), FR( M) (vlm ) .
∗ ∗ ∗
vlm ∈ E −vij vlm ∈ E −vij vlm ∈ E −vij

Example 4. Let V ={v1 ,v2 ,v3 ,v4 } be a vertex set and A={ a1 ,a2 ,a3 ,a4 } a set of parameters. A relation S over
A×V can be defined in tabular form in Table 7 as follows:

Table 7. Full soft set S.

S v1 v2 v3 v4
a1 1 1 1 1
a2 0 1 0 1
a3 1 0 1 1
a4 1 0 1 0

Let N ={(v1 ,0.3,0.4,0.6),(v2 ,0.4,0.5,0.1),(v3 ,0.9,0.6,0.4),(v4 ,1.0,0.2,0.1)} be a neutrosophic set on V.

Then from Equation (1) of Definition 1, we have

S( N ) = {(v1 , 0.9, 0.4, 0.4), (v2 , 1.0, 0.2, 0.1), (v3 , 0.9, 0.4, 0.4), (v4 , 1.0, 0.2, 0.1)},
S( N ) = {(v1 , 0.3, 0.6, 0.6), (v2 , 0.4, 0.5, 0.1), (v3 , 0.3, 0.6, 0.6), (v4 , 0.4, 0.5, 0.1)}.

Hence, SN = (S( N ), S( N )) is soft rough neutrosophic set on V. Let E={v13 ,v32 ,v24 ,v41 }⊆Ṽ and
L={ a13 ,a32 ,a43 }⊆ Ã. Then a full soft set R on E (from L to E) can be defined in Table 8 as follows:
ce, SN = (S(N ), S(N )) is soft rough neutrosophic set on V . Let E={v13 ,v32 ,v24 ,v41 }⊆Ṽ an
13 ,a32 ,a43 }⊆Ã. Then a full soft set R on E (from L to E) can be defined in Table 8 as follows:

Mathematics 2018, 6, 125 11 of 37

Table 8: Full soft set R
R v13 v32 v24 v41
Table 8. Full soft set R.
a13 1 0 1 1
a32 0R v13 1 v32 v024 v41 0
a43 1a13 1 0 0 01 1 0
a32 0 1 0 0
a43 1 0 0 0

M ={(v13 ,0.3,0.2,0.1),(v32 ,0.2,0.1,0.1),(v24 ,0.3,0.2,0.1),(v41,0.3,0.1,0.1)} be a neutrosophic set on E

Let M ={(v13 ,0.3,0.2,0.1),(v32 ,0.2,0.1,0.1),(v24 ,0.3,0.2,0.1),(v41 ,0.3,0.1,0.1)} be a neutrosophic set on E.
from the Equations 2.2 of Definition 2.2, we have
Then from Equation (2) of Definition 2, we have

R(M ) = {(v13 ,R0.3, 0.2,

( M) = {(v0.1), (v 0.1, )0.2,
13 , 0.3, 0.2,32 , (v320.1, 0.1),
, 0.2, 0.1, 0.1)(v
, (v24 , 0.3, 0.1, 0.1), (v41, 0.1
24 , 0.3, 0.1, 0.1), ( v41 , 0.3, 0.1,
0.3,
)}, 0.1, 0.1)},
R(M ) = {(v13 ,R0.3, 0.2,
( M) = {(v0.1), (v32
13 , 0.3, 0.2, , )0.2,
0.1 , (v320.1, 0.1),
, 0.2, 0.1, 0.1)(v 24 ,,0.3,
, (v24 0.3,0.2,0.2,
0.1),0.1), (v0.1,
(v41 , 0.2, 41 , 0.1
0.2,)}. 0.1, 0.1)}.

Hence, RM = ( R( M ), R( M)) is soft rough neutrosophic set on E. Thus, G = (S( N ), R( M)) and
ce, RM = (R(M G = (S),
( NR(M
), R( M)) is LSRNAG
)) are soft rough neutrosophic
and USRNAG, respectively, set on inE.
as shown Thus,
Figure GG =
2. Hence, (S(N
= ( G, G ) is ), R(M )) an
(S(N ), R(M ))SRNG
areand
LSRNAG and
it is also a soft USRNAG,
rough respectively, as shown in Figure 2. Hence, G = (G, G
neutrosophic cycle.

v1 (0.3, 0.6, 0.6)

b
v1 (0.9, 0.4, 0.4)
b
(0

(0
.3

.3
,0

,0
.2 ,

.2 ,
.1 )

.1 )
0 .1

0 .1
,0

,0
)

)
, 0 .1 )

, 0 .1 )
0 .1

0 .1
2,

v3 (0.9, 0.4, 0.4)

v3 (0.3, 0.6, 0.6)
(0.

(0.
4 , 0 .5

0 , 0 .2

b b b b
v 4(0.

v4 (1 .
(0

(0
.3

.3
)

)
,0

,0
0 .1

0 .1
.2 ,

.1 ,
.1 ,

.1 ,
0 .1

0 .1
,0

,0
)

)
.2

.2
(0

b b

v2 (0.4, 0.5, 0.1) v2 (1.0, 0.2, 0.1)

G = (S(N ), R(M )) G = (S(N ), R(M ))

Figure 2. Soft rough neutrosophic cycle G = ( G, G ).

Figure 2: Soft rough neutrosophic graph G = (G, G)
Definition 12. A soft rough neutrosophic subgraph H =(SN2 ,RM2 ) of a soft rough neutrosophic graph
NG and it is Galso
=(SNa1 ,RM
soft1 ),rough neutrosophic
if v∈ H such that cycle.
TS( N2 ) (v)≤ TS( N1 ) (v), IS( N2 ) (v)≥ IS( N1 ) (v), FS( N2 ) (v)≥ FS( N1 ) (v),
TS( N2 ) (v)≤ TS( N ) (v), IS( N2 )10
(v)≥ IS( N ) (v), FS( N2 ) (v)≥ FS( N ) (v),
1 1 1

and vij ∈ H,

TR( M2 ) (vij )≤ TR( M1 ) (vij ), IR( M2 ) (vij )≥ IR( M1 ) (vij ), FR( M2 ) (vij )≥ FR( M1 ) (vij ),
TR( M2 ) (vij )≤ TR( M1 ) (vij ), IR( M2 ) (vij )≥ IR( M1 ) (vij ), FR( M2 ) (vij )≥ FR( M1 ) (vij ).
Mathematics 2018, 6, 125 12 of 37

Definition 13. A H =(SN2 ,RM2 ) is called soft rough neutrosophic spanning subgraph of a soft rough
neutrosophic graph G =(SN1 ,RM1 ), if H is a soft rough neutrosophic subgraph such that

TS( N2 ) (v)= TS( N1 ) (v), IS( N2 ) (v)= IS( N1 ) (v), FS( N2 ) (v)= FS( N1 ) (v),
TS( N2 ) (v)= TS( N ) (v), IS( N2 ) (v)= IS( N ) (v), FS( N2 ) (v)= FS( N ) (v).
1 1 1

Definition 14. A soft rough neutrosophic graph is a forest if and only if each supporting approximation graph is
a forest. A soft rough neutrosophic graph G =(SN1 ,RM1 ) is a soft rough neutrosophic forest if and only if there
exist a soft rough neutrosophic spanning subgraph H =(SN1 ,RM2 ) is a forest such that vij ∈ G − H

TR( M1 ) (vij )< TCONNH (vi , v j ), IR( M1 ) (vij )> ICONNH (vi , v j ), FR( M1 ) (vij ) > FCONNH (vi , v j ),
TR( M1 ) (vij )< TCONNH (vi , v j ), IR( M1 ) (vij )> ICONNH (vi , v j ), FR( M1 ) (vij ) > FCONNH (vi , v j ).

A soft rough neutrosophic graph is a tree if and only if each supporting approximation graph is a tree.
A soft rough neutrosophic graph G =(SN1 ,RM1 ) is a soft rough neutrosophic tree if and only if there exist a soft
rough neutrosophic spanning subgraph H =(SN1 ,RM2 ) is a tree such that vij ∈ G − H

Definition 15. Let G =(SN,RM) be a soft rough neutrosophic graph, an edge vij is a bridge if the edge vij is a
bridge in both supporting graph of G and G, that is the removal of vij disconnects both the G and G. An edge vij
is a soft rough neutrosophic bridge in a soft rough neutrosophic graph G =(SN,RM), if vlm ∈ G

TCONNG −vij (vl , vm )< TCONNG (vl , vm ), TCONNG −vij (vl , vm )< TCONNG (vl , vm ),
ICONNG −vij (vl , vm ) > ICONNG (vl , vm ), ICONNG −vij (vl , vm ) > ICONNG (vl , vm ),
FCONNG−vij (vl , vm )> FCONNG (vl , vm ), FCONNG−v (vl , vm )> FCONNG (vl , vm ).
ij

Definition 16. Let G =(SN1 ,RM1 ) be a soft rough neutrosophic graph then a vertex vi in G is a
cutnode(cutvertex) if it is a cutnode in each supporting graph of G and G. That is, the deletion of vi from the
supporting graphs of G and G increase the components in the supporting graphs. A vertex vi is called soft rough
neutrosophic cutnode(cutvertex) in a soft rough neutrosophic graph if the removal of vi reduces the strength of
∗
the connectedness from nodes v j tovk ∈V ∗ ,V

TCONNG−v (v j , vk )< TCONNG (v j , vk ), TCONNG−v (v j , vk )< TCONNG (v j , vk ),

i i

ICONNG−v (v j , vk ) > ICONNG (v j , vk ), ICONNG−v (v j , vk ) > ICONNG (v j , vk ),

i i

FCONNG−v (v j , vk )> FCONNG (v j , vk ), FCONNG−v (v j , vk )> FCONNG (v j , vk ).

i i

Definition 17. An edge vij in soft rough neutrosophic graph G is called strong soft rough neutrosophic edge if

TR( M) (vij )≥ TCONNG−v (vi , v j ), TR( M) (vij ) ≥ TCONNG−v (vi , v j ),

ij ij

IR( M) (vij ) ≤ ICONNG−v (vi , v j ) , IR( M) (vij ) ≤ ICONNG−v (vi , v j ),

ij ij

FR( M) (vij )≤ FCONNG−v (vi , v j ) , FR( M) (vij ) ≤ FCONNG−v (vi , v j ).

ij ij
Mathematics 2018, 6, 125 13 of 37

Definition 18. An edge vij in soft rough neutrosophic graph G is called α−strong soft rough neutrosophic
edge if

TR( M) (vij )> TCONNG−v (vi , v j ), TR( M) (vij ) > TCONNG−v (vi , v j ),
ij ij

IR( M) (vij ) < ICONNG−v (vi , v j ) , IR( M) (vij ) < ICONNG−v (vi , v j ),
ij ij

FR( M) (vij )< FCONNG−v (vi , v j ) , FR( M) (vij ) < FCONNG−v (vi , v j ).
ij ij

Definition 19. An edge vij in soft rough neutrosophic graph G is called β−strong soft rough neutrosophic
edge if

TR( M) (vij )= TCONNG−v (vi , v j ), TR( M) (vij ) = TCONNG−v (vi , v j ),

ij ij

IR( M) (vij ) = ICONNG−v (vi , v j ) , IR( M) (vij ) = ICONNG−v (vi , v j ),

ij ij

FR( M) (vij )= FCONNG−v (vi , v j ) , FR( M) (vij ) = FCONNG−v (vi , v j ).

ij ij

Definition 20. An edge vij in soft rough neutrosophic graph G is called δ−strong soft rough neutrosophic
edge if

TR( M) (vij )< TCONNG−v (vi , v j ), TR( M) (vij ) < TCONNG−v (vi , v j ),
ij ij

IR( M) (vij ) > ICONNG−v (vi , v j ) , IR( M) (vij ) > ICONNG−v (vi , v j ),
ij ij

FR( M) (vij )> FCONNG−v (vi , v j ) , FR( M) (vij ) > FCONNG−v (vi , v j ).
ij ij

Example 5. Let V ={v1 ,v2 ,v3 ,v4 } be a vertex set and A={ a1 ,a2 ,a3 ,a4 } a set of parameters. A relation S over
A × V can be defined in tabular form in Table 9 as follows:

Table 9. Full soft set S.

S v1 v2 v3 v4
a1 1 1 1 1
a2 0 1 0 1
a3 1 0 1 1
a4 1 0 1 0

Let N ={(v1 ,0.3,0.4,0.6),(v2 ,0.4,0.5,0.1),(v3 ,0.9,0.6,0.4),(v4 ,1.0,0.2,0.1)} be a neutrosophic set on V.

Then from Equation (1) of Definition 1, we have

S( N ) = {(v1 , 0.9, 0.4, 0.4), (v2 , 1.0, 0.2, 0.1), (v3 , 0.9, 0.4, 0.4), (v4 , 1.0, 0.2, 0.1)},
S( N ) = {(v1 , 0.3, 0.6, 0.6), (v2 , 0.4, 0.5, 0.1), (v3 , 0.3, 0.6, 0.6), (v4 , 0.4, 0.5, 0.1)}.

Hence, SN =(S( N ),S( N )) is soft rough neutrosophic set on V. Let E={v13 ,v32 ,v43 }⊆Ṽ and
L={ a12 ,a24 ,a34 }⊆ Ã. Then a full soft set R on E (from L to E) can be defined in Table 10 as follows:

Table 10. Full soft set R.

R v13 v32 v43

a12 0 1 0
a24 1 0 1
a34 0 0 1
Hence, SN =(S(N ),S(N )) is soft rough neutrosophic set on V . Let E={v13 ,v32 ,v43 }⊆Ṽ and L={a12,a24 ,a34 }⊆Ã.
Then a full soft set R on E (from L to E) can be defined in Table 10 as follows:

Table 10: Full soft set R

Mathematics 2018, 6, 125 R v13 v32 v43 14 of 37
a12 0 1 0
a24 1 0 1
Let M={(v13 ,0.3,0.2,0.0),(v32 ,0.3,0.0,0.1),(v43 ,0.3,0.2,0.1)} be a neutrosophic set on E. Then from
a34 0 0 1
Equation (2) of Definition 2, we have

Let M ={(v13 ,0.3,0.2,0.0),(v ,0.3,0.0,0.1),(v

R( M )32= 0.0,0.3,0.2,0.1)}
{(v13 , 0.3, 0.2, 43 ), (v32 , 0.3, 0.0,be
0.1)a, (neutrosophic set, on E. Then from the
v43 , 0.3, 0.2, 0.1)}
Equations 2.2 of Definition
R( M2.2,
) = {(wev have
, 0.3, 0.2, 0.1), (v , 0.3, 0.0, 0.1), (v , 0.3, 0.2, 0.1)}.
13 32 43

R(M ) = {(v13 , 0.3, 0.2, 0.0), (v32, 0.3, 0.0, 0.1), (v43, 0.3, 0.2, 0.1)},
Hence, RM=( R( M ),R( M)) is soft rough neutrosophic set on E. Thus, G =(S( N ),R( M )) and
R(M
G =(S( N ),R( M)) ) = {(v13 ,and
are LSRNAG 0.3,USRNAG,
0.2, 0.1), (v32 , 0.3, 0.0,
respectively, as0.1),
shown(v43
in ,Figure
0.3, 0.2,
3. 0.1)}.
Hence, G = ( G, G ) is
SRNG and a tree. v13 is a bridge and v3 is a cute node
Hence, RM =(R(M ),R(M )) is soft rough neutrosophic set on E. Thus, G=(S(N ),R(M )) and G=(S(N ),R(M ))
are LSRNAG and USRNAG, respectively, as shown in Figure 3. Hence, G = (G, G) is SRNG and a tree.
b b
v1 (0.3, 0.6, 0.6) v1 (0.9, 0.4, 0.4)

(0.3, 0.2, 0.1) (0.3, 0.2, 0.0)

b
(0.3, 0.0, 0.1) b b
(0.3, 0.0, 0.1) b

v3 (0.3, 0.6, 0.6) v2 (0.4, 0.5, 0.1) v3 (0.9, 0.4, 0.4) v2 (1.0, 0.2, 0.1)
1) 1)
, 0 .2
, 0. 2, 0.
(0.3 .1) G = (S(N ), R(M )) (0.3, 0. ) G = (S(N ), R(M ))
.1
, 0 .5
,0 .2 , 0
.4 1 .0 , 0
v 4(0
b
b
v4(

Figure 3. Soft rough neutrosophic graph G = ( G, G ).

Figure 3: Soft rough neutrosophic graph G = (G, G)

We state
v13 is a bridge andthe
v3 following
is a cute Theorems
node without their proofs.

WeTheorem
state the
1. following Theorems
Let G =(SN without their proofs.
1 ,RM1 ) be a soft rough neutrosophic graph tree. An edge vij is the strongest edge if
vij is an
Theorem edgeLet
2.1. of its H =(SN
subgraph,RM
G=(SN 1 ,RM2 ).
1 1 ) be a soft rough neutrosophic graph tree. An edge vij is the strongest
edge if vij is an edge of its subgraph H=(SN1 ,RM2 ).
Theorem 2. If v is a common node of at least two soft rough neutrosophic bridges, then v is a soft rough
Theorem 2.2. Ifcutnode.
neutrosophic v is a common node of at least two soft rough neutrosophic bridges, then v is a soft
rough neutrosophic cutnode.
Theorem 3. If v is a soft rough neutrosophic bridge of G, then
Theorem 2.3. If vijij is a soft rough neutrosophic bridge of G, then
TR(v
TR(M) (vij )=
ij))=T
(M TCONN
CON
(v , v ), T ( M) (v(v
G −vij(vi i, vjj ), TRR(M)
NG−v ij )ij=
)T=T
CONN
CON
G −N
(vi , v(v
vijG−v j ),i , vj ),
ij ij

IR(M)IR(v (v=I
ij) )
(M ij ) CON
= ICONN
NG−v (v , v ) , I ( M) (v(v
vij(vii, vjj , IRR(M)
G −ij ij )ij=
)=ICONN
ICON
G −N
(vi , v(v
vijG−v j ),i , vj ),
ij

FR(v
FR(M) ( Mij) ()=F
vij )= FCONN
CON NG−v
G −ij
v
(v
(vii, vjj )),, FFRR(M)
( M) ( v(v ) =F
ij )ij= FCONN
CON N ( vi , v(v
G −v G−v j ).i , vj ).
ij ij ij

3. Soft Rough Neutrosophic Influence Graphs

3 Soft Rough Neutrosophic Influence Graphs
Definition 21. A soft rough neutrosophic influence graph G on a nonempty set V is a 7-ordered tuple
Definition 3.1. A soft rough
( A,S,SN,R,RM,X,XQ ) suchneutrosophic
that influence graph G on a nonempty set V is a 7-ordered tuple
(A,S,SN ,R,RM ,X,XQ) such that
(i) A is a set of parameters,
(ii) S is an arbitrary full soft set over V,
(iii) R is an arbitrary full soft set over E ⊆ V × V, 13
(iv) X is an arbitrary full soft set over I ⊆ V × E,
(v) SN =(S( N ),S( N )) is a soft rough neutrosophic set on V,
Mathematics 2018, 6, 125 15 of 37

(vi) RM=( R( M ),R( M)) is a soft rough neutrosophic set on E,

(vii) XQ=( X ( Q),X ( Q)) is a soft rough neutrosophic set on I,

Thus, G=(G,G)=(SN,RM,XQ) is a soft rough neutrosophic influence graph (SRNIG), where

G=(S( N ),R( M ),X ( Q)) and G=(S( N ),R( M ),X ( Q)) are lower and upper soft rough neutrosophic influence
approximation graphs (LSRNIAGs) and (USRNIAGs), respectively, of G.

Example 6. Let V ={v1 ,v2 ,v3 ,v4 ,v5 ,v6 } be a vertex set and A={ a1 ,a2 ,a3 ,a4 } a set of parameters. A full soft
set S over A × V can be defined in tabular form in Table 11 as follows:

Table 11. Full soft set S.

S v1 v2 v3 v4 v5 v6
a1 1 1 1 0 0 1
a2 0 1 0 0 1 1
a3 1 0 1 1 1 1
a4 1 1 1 1 1 1

Let N ={(v1 ,1.0,0.4,0.7),(v2 ,0.9,0.6,0.55),(v3 ,0.7,0.9,0.5),(v4 ,0.6,0.5,0.6), (v5 ,0.65,0.8,0.65),(v6 ,0.8,0.7,0.8)}

be a neutrosophic set on V. Then from Equation (1) of Definition 1, we have

S( N )={(v1 , 1.0, 0.4, 0.50), (v2 , 0.9, 0.6, 0.55), (v3 , 1.0, 0.4, 0.5), (v4 , 1.0, 0.4, 0.5), (v5 , 0.9, 0.6, 0.55),
(v6 , 0.9, 0.6, 0.55)},
S( N )={ (v1 , 0.7, 0.9, 0.80), (v2 , 0.7, 0.8, 0.80), (v3 , 0.7, 0.9, 0.8), (v4 , 0.6, 0.9, 0.8), (v5 , 0.65, 0.8, 0.8)
(v6 , 0.7, 0.8, 0.8)} .

Hence, SN =(S( N ),S( N )) is soft rough neutrosophic set on V. Let E={v12 ,v24 ,v32 ,v42 ,v52 ,v62 ,}⊆Ṽ and
L={ a13 ,a24 ,a34 ,a41 }⊆ Ã. Then a full soft set R on E (from L to E) can be defined in Table 12 as follows:

Table 12. Full soft set R.

R v12 v24 v32 v42 v52 v62

a13 0 1 0 0 0 1
a24 0 1 0 0 1 1
a34 1 0 1 1 1 1
a41 1 1 1 1 1 1

Let M={(v12 ,0.6,0.3,0.4),(v24 ,0.58,0.38,0.46),(v32 ,0.56,0.37,0.47),(v42 ,0.54,0.34,0.38), (v52 ,0.52,0.32,0.5),(v62 ,0.5,0.4,0.45)}

be a neutrosophic set on E. Then from Equation (2) of Definition 2, we have

R( M )={(v12 , 0.60, 0.30, 0.38), (v24 , 0.58, 0.38, 0.45), (v32 , 0.60, 0.30, 0.38), (v42 , 0.60, 0.30, 0.38),
(v52 , 0.58, 0.32, 0.45), (v62 , 0.58, 0.38, 0.45)},
R( M )={(v12 , 0.50, 0.40, 0.50), (v24 , 0.50, 0.40, 0.46), (v32 , 0.50, 0.40, 0.50), (v42 , 0.50, 0.40, 0.50),
(v52 , 0.50, 0.40, 0.50), (v62 , 0.50, 0.40, 0.46)}.

Hence, RM=( R( M ),R( M )) is soft rough neutrosophic set on E. Thus, G =(S( N ),R( M ))
and G =(S( N ),R( M )) are LSRNAG and USRNAG, respectively, as shown in
Figure 4. Hence, G =( G,G ) is SRNG. Let I ={v1 v24 ,v1 v32 ,v1 v42 ,v1 v52 ,v1 v62 ,v3 v12 ,v3 v24 ,
v3 v42 ,v3 v52 ,v3 v62 ,v4 v12 ,v4 v32 ,v4 v52 ,v4 v62 ,v5 v12 , v5 v24 ,v5 v32 ,v5 v42 ,v5 v62 ,v6 v12 ,v6 v24 ,v6 v32 ,v6 v42 ,v6 v52 }
⊆V × E and P={ a1 a24 ,a1 a34 ,a2 a13 ,a2 a34 ,a2 a41 ,a3 a24 ,a3 a41 ,a4 a13 }⊆ Â. Then and Q a neutrosophic set on I
and a full soft set X on I (from P to I) can be defined in Table 13, respectively as follows:
Mathematics 2018, 6, 125 16 of 37

(v4 , 0.6, 0.9, 0.8)

b
(v3 , 0.7, 0.9, 0.8) (v5 , 0.65, 0.8, 0.8)

)
(0.50, 0.40, 0.46)
(0.50, 0.40, 0.50
b b

(v1 , 0.7, 0.9, 0.8) (v6 , 0.7, 0.8, 0.8)

(0
b b
5

.
0.

50
0,

,0
.4

.4
(0.
,0 )

0,
5 0, 0 0 .4 6

0.
.4 0 .5 ,0
.4 0

50
, 0. (0 0, 0

)
50) 5
b (0.
(v2 , 0.7, 0.8, 0.8)

G = (S(N ), R(M ))

(v4 , 1.0, 0.4, 0.5)

(v3 , 1.0,b 0.4, 0.5) (v5 , 0.9, 0.6, 0.55)

45)
)

b
(0.60, 0.30, 0.38
(0.58, 0.38, 0.

(v1 , 1.0, 0.4, 0.5) ) (v6 , 0.9, 0.6, 0.55)

45
b b
.

.
60

,0
,0

32
.3

(0. 0.
45)
0,

6 0, 0 ,
58 , 0.
0.

.3 0 . 38
38

, 0. (0 , 0.
)

38) 5 8
b(0.
(v2 , 0.9, 0.6, 0.55)

G = (S(N ), R(M ))

Figure 4. Soft rough neutrosophic graph G = ( G, G ).

Figure 4: Soft rough neutrosophic graph G = (G, G)
Table 13. Full soft set X.

Hence, RM =(R(M ),R(M )) is soft rough neutrosophic set on E. Thus, G=(S(N ),R(M )) and
v1 v24 v1 v32 v1 v42 v1 v52 v1 v62 v3 v12 v3 v24 v3 v42 v3 v52 v3 v62 v4 v12 v4 v32
G=(S(N ),R(M X )) are
v4 v52LSRNAG
v4 v62 v5andv12 USRNAG,
v5 v24 v5 v32 respectively,
v5 v42 v5 v62 as
v6 vshown
12 v6 vin
24
Figure
v6 v32 4.
v6 v42Hence,
v6 v52 G=(G,G) is
SRNG. Let I={v1 v24 ,v v 1 ,v1 v421,v1 v521,v1 v62 ,v
1 1 32
v ,v v , v v ,v v ,v v ,v v ,v v ,v v ,v v ,v v ,
1 3 12 03 24 0 3 42 03 52 03 62 40 12 40 32 4 052 4 62 5 12
a a
v5 v24 ,v5 v32 ,v5 v42 ,v5 v062 ,v6 v012 ,v6 v24
1 24
0 ,v6 v420,v6 v52 }
0 ,v6 v32 0 ⊆V ×E
0 and0P ={a11 a24 ,a01 a34 ,a20a13 ,a21a34 ,a2 a41 ,a3 a24 ,
a3 a41 ,a4 a13 }⊆ Â.
a1 a34 Then
0 and0 Q a 1neutrosophic
1 1 set on 0 I and
0 a full0 soft 0set X 0on I (from
0 P
0 to I) can be
0 0 0 0 0 0 0 1 0 0 1 1
defined in Table 13, respectively as follows:
0 0 0 0 0 0 0 0 0 0 0 0
a2 a13
0 0 0 1 0 0 1 0 1 0 1 0
Q={(v1 v24 , 0.42,00.3, 0.38),
0 (v10v32 , 0.43,
0 0.28,
0 0.37),
0 (v1v42
0 , 0.49,0 0.26, 00.33), (v
0 1v52 ,10.47, 0.29,
1 0.32),
a2 a34
(v1 v62 , 0.46,10.28, 0.36),
1 (v1 3v12 , 0.4,
0 1 0.37),
0.29, 1 (v3v24
1 , 0.45,1 0.24, 00.36), (v
1 3v42 ,10.48, 0.29,
1 0.35),
0 0 0 0 0 0 0 0 0 0 0 0
(v3av252a41, 0.41, 0.24, 0.36), (v v , 0.42, 0.26, 0.34), (v v , 0.5, 0.25, 0.3), (v v , 0.44, 0.27, 0.32),
0 0 1 3 62 1 1 1 14 12 1 1 1 4 32 1 1
1 0 0 1 1 0 0 0 0 0 0 0
(v4 va52
3 a,240.45, 0.23, 0.31), (v4v62 , 0.48, 0.23, 0.38), (v5v12 , 0.46, 0.24, 0.3), (v5v24 , 0.47, 0.26, 0.34),
1 1 0 1 0 0 1 0 1 0 0 1
(v 5
a3 a41
v 32 , 0.4,
1 0.3,10.36), 1(v5 v42 ,10.48, 0.29,
1 0.38),
1 (v15v62 , 0.49,
1 0.3,
1 0.37),1 (v6v121, 0.49,10.3, 0.37),
1 1 1 1 1 1 1 1 1 1 1 1
(v6 v24 , 0.4,0 0.28, 00.35), (v
0 6v32 ,00.47, 0.27,
1 0.34),
0 (v61v42 , 0.46,
0 0.29, 0 0.33),1 (v6v520 , 0.49,0 0.3, 0.32)}
a4 a13
0 1 0 1 0 0 1 0 1 0 0 0
Then the lower and upper soft rough neutrosophic approximation is directly calculated using the Equa-
tions 2.3 of Definition 2.4, we have

Q={(v1 v24 , 0.42, 0.3, 0.38), (v1 v32 , 0.43, 0.28, 0.37), (v1 v42 , 0.49, 0.26, 0.33), (v1 v52 , 0.47, 0.29, 0.32),
(v1 v62 , 0.46, 0.28, 0.36), (v3 v12 , 0.4, 0.29, 0.37), (v3 v24 , 0.45, 0.24, 0.36), (v3 v42 , 0.48, 0.29, 0.35),
(v3 v52 , 0.41, 0.24, 0.36), (v3 v62 , 0.42, 0.26, 0.34), (v4 v12 , 0.5, 0.25, 0.3), (v4 v32 , 0.44, 0.27, 0.32),
(v4 v52 , 0.45, 0.23, 0.31), (v4 v62 , 0.48, 0.23, 0.38), (v5 v12 , 0.46, 0.24, 0.3), (v5 v24 , 0.47, 0.26, 0.34),
(v5 v32 , 0.4, 0.3, 0.36), (v5 v42 , 0.48, 0.29, 0.38), (v5 v62 , 0.49, 0.3, 0.37), (v6 v12 , 0.49, 0.3, 0.37),
(v6 v24 , 0.4, 0.28, 0.35), (v6 v32 , 0.47, 0.27, 0.34), (v6 v42 , 0.46, 0.29, 0.33), (v6 v52 , 0.49, 0.3, 0.32)}

Then the lower and upper soft rough neutrosophic approximation is directly calculated using Equation (3) of
Definition 4, we have

X ( Q)={(v1 v24 , 0.49, 0.26, 0.32), (v1 v32 , 0.49, 0.26, 0.32), (v1 v42 , 0.49, 0.26, 0.32), (v1 v52 , 0.49, 0.26,
0.32), (v1 v62 , 0.49, 0.26, 0.34), (v3 v12 , 0.5, 0.23, 0.3), (v3 v24 , 0.49, 0.23, 0.34), (v3 v42 , 0.5,
0.23, 0.3), (v3 v52 , 0.5, 0.23, 0.3), (v3 v62 , 0.49, 0.23, 0.3), (v4 v12 , 0.5, 0.23, 0.38), (v4 v32 ,
0.5, 0.23, 0.3), (v4 v52 , 0.49, 0.23, 0.31), (v4 v62 , 0.49, 0.23, 0.34), (v5 v12 , 0.49, 0.24, 0.3),
(v5 v24 , 0.49, 0.26, 0.34), (v5 v32 , 0.49, 0.24, 0.3), (v5 v42 , 0.49, 0.24, 0.3), (v5 v62 , 0.49, 0.26,
0.34), (v6 v12 , 0.49, 0.26, 0.32), (v6 v24 , 0.49, 0.26, 0.34), (v6 v32 , 0.49, 0.24, 0.3), (v6 v42 , 0.49,
0.26, 0.33), (v6 v52 , 0.49, 0.26, 0.32)};
X ( Q)={(v1 v24 , 0.4, 0.3, 0.38), (v1 v32 , 0.4, 0.3, 0.38), (v1 v42 , 0.46, 0.3, 0.37), (v1 v52 , 0.46, 0.3, 0.37),
(v1 v62 , 0.46, 0.3, 0.37), (v3 v12 , 0.4, 0.3, 0.38), (v3 v24 , 0.4, 0.3, 0.38), (v3 v42 , 0.4, 0.3, 0.38),
(v3 v52 , 0.4, 0.3, 0.38), (v3 v62 , 0.4, 0.3, 0.38), (v4 v12 , 0.4, 0.3, 0.38), (v4 v32 , 0.4, 0.3, 0.38),
(v4 v52 , 0.4, 0.3, 0.38), (v4 v62 , 0.4, 0.3, 0.38), (v5 v12 , 0.4, 0.3, 0.38), (v5 v24 , 0.4, 0.3, 0.37),
(v5 v32 , 0.4, 0.3, 0.38), (v5 v42 , 0.4, 0.3, 0.38), (v5 v62 , 0.4, 0.3, 0.37), (v6 v12 , 0.46, 0.3, 0.37),
(v6 v24 , 0.4, 0.3, 0.37), (v6 v32 , 0.4, 0.3, 0.38), (v6 v42 , 0.46, 0.3, 0.37), (v6 v52 , 0.46, 0.3, 0.37)}.

Thus, G=(S( N ),R( M ),X ( Q)) and G=(S( N ),R( M ),X( Q)) are LSRNIAG and USRNIAG, respectively,
as shown in Figures 5 and 6. Hence, G =(G,G) is SRNIG.

v1 (0.7, 0.9, 0.8)

b
8)
0 .3
.3 ,

(1.
,0

(0.46, 0.3, 0.37)

2
.4

, 0.
(0

3, 0
)

.3 8
0 .8

)
.9 ,

(0.4, 0.3, 0.38)

b
.6
(0
v4

(0
(0

.
.4

5,
.8 )
,0

0.
(0.4, 0.3, 0.38)
)
.3 8

4,
8, 0
.3 ,

0.
(0.46

3, 0

46
0 .3

, 0.

)
8)

, 0.
0 .7

(0.5, 0.4, 0.5)

,
0.3, 0

4
v2 (

(0.
7)

b
.5 )
, 0 .3

4, 0
.37)

, 0.
(0.5
, 0 .3

(0 (0
(0.5, 0.4, 0.46)

.
(0.4, 0.3, 0.38)

4, .
.38)

5,
6

0.
(0.4

(0.4 3, 0.
7)

4,
0.3, 0

, 0. (0.4 (0. 0. 0.
, 0 .3

3, 0 , 0 .3 , 4 , 0. 38 5)
.3 8 0 .3 8 3, 0 )
)
, 0 .3

) .3 8
(0.4,

0.38) )
(0.4, 0

3,
(0.4, 0.
(0.4 3, 0.37)
(0.4

b
)

)
38

v3 (0.7, 0.9, 0.8)

.3 8
, 0.3

,0
.0

.3
3,

,0 7)
, 0.3

(0 . 4 ( 0 .4 6 0 .3
4,

b
, 0. .3 ,
.

6, 0
(0
8)

v5 (0.65, 0.8, 0.8) 3, 0 4

.3 7
) (0.
(0.4, 0.3, 0.38) b

v6 (0.7, 0.8, 0.8)

(0.46, 0.03, 0.38)

Figure 5. Figure
Lower 5: Soft
Lowerrough
Soft rough neutrosophic graph
neutrosophic graph GG
= (S(N
= (S),(R(M
N ),),RX(Q))
( M), X ( Q)).
such that
vk ∈ V∗ , ek ∈ E∗ , ik , i′k ∈ I∗ ,
∗ ∗ ∗
vk ∈ V , ek ∈ E , ik , i′k ∈ I .
′
where ik =(vk uv), ek =uv, ik =(vwvk+1 ) and ∀k=0,1,2,· · · ,n−1. If v0
= vn , then it is called closed. If the
pairs are distinct, then it is called a soft rough neutrosophic influence trail (SRNI trail). If the edges
are distinct, then it is called a soft rough neutrosophic trail (SRN trail). If the vertices are distinct in
SRN trail, then it is called a soft rough neutrosophic path (SRN path). If the vertices, edge and pairs are
distinct in a walk of SRNIG, then it is called a soft rough neutrosophic influence path (SRNI path). A
Mathematics 2018, 6, 125 18 of 37

v1 (1.0, 0.4, 0.7)

2)
0 .3
6,
0 .2

(0.
(0.49, 0.26, 0.32)
9,

6
.4

, 0.
(0

3, 0
)

.3 8
0 .5

)
.4 ,
(0.5, 0.23, 0.38)

,0
b

.0
(1
v4

(0
(0
.

.4
58

)
9,
,0

32
(0.5, 0.23, 0.3)
0 .2
.3

, 0.
8,

3,
0.

.2 6
45

0 .3
(0.49

(0.6, 0.3, 0.38) )

9, 0
4)

4
.3 2 )
,

(0.
45)
0 .2 6 ,

b
6, 0
32 , 0. v2 (0.9, 0.6, 0.55)
8 , 0.
, 0 .2

(0.5
0 .3 4 )

(0.58, 0.38, 0.45)

(0 (0
(0.49, 0.23, 0.31)
, 0.3)

. 5, . 6,
9
)

0. 0.
(0.4
0 .3 4

(0. 23 3,
, 0.24

(0.5 4 ,0 0.
, 0 .2 3 9, 0 .3 38
.2 6 ,

, 0 .3 .2 3 ) )
) , 0.
6, 0.34
(0.49

)
9, 0

3)
(0.49,

.2
(0.49, 0
(0.4 .26, 0.34)

(0.5, 0.2
(0.4

3, 0.3) b

.3 )
9, 0.

v3 (1.0, 0.4, 0.5)

0
0

4,
4,

0 .2
.2
23, 0

)
, 34
,0

49 (0.4 , 0.
(0.
49

b
9, 0 26
, 0.
.3 4 )

.2 6
(0

v5 (0.9, 0.6, 0.55) , 0. 4 9

32) (0.
(0.49, 0.24, 0.3) b

v6 (0.9, 0.6, 0.55)

(0.49, 0.26, 0.32)

Figure
Figure UpperSoft
6: 6.Upper Soft rough
rough neutrosophic
neutrosophicgraph GG
graph = (=S((S(N
N ), R),
(M ), X (),
R(M )).
QX(Q))

∗
_G∗ =(G ,G ) of a
∗
Definition 22. An underlying
_ influence graph(supporting
_ influence graph) soft rough
I (v v )), ( ∗ FR(M)
∗ (v∗ i v∗jk ) ∨ ∗ ∗F ∗ ∗ (v v )) .
neutrosophic influence graph G=(R(M)
G,G) is of the form G =(V ,E ,I ) and G =(V ,ER(M)
i jk ,I ), where
i jk
∗ vi vjk ∈I ∗ ∗
vi vjk ∈I vi vjk ∈E
V∗ =Lower Vertex Set ={v ∈ V | TS( N ) (v) 6= 0, IS( N ) (v) 6= 0, FS( N ) (v) 6= 0},

∗
V =Upper Vertex Set={v ∈ V | TS( N ) (v) 6= 0, IS( N ) (v) 6= 0, FS( N ) (v) 6= 0},
Definition 3.6. In a soft rough neutrosophic influence graph G, if in each approximation graph
E∗ =Lower Edge ∞ Set ={vij ∈ E| TRα( M) (vij ) 6= 0, IR( M) (vij ) 6= 0, FR(∞ M ) ( vij ) 6 = 0}, α
CON N ∗ G (vi , vk ) = E (vi , vk ) = ∨α {E (vi , vk )}, CON NG (vi , vk ) = E (vi , vk ) = ∨α {E (vi , vk )}.
E =Upper Edge Set ={vij ∈ E| TR( M) (vij ) 6= 0, IR( M) (vij ) 6= 0, FR( M) (vij ) 6= 0},
where
I∗ =Lower Influence ={v v ∈ I | TX (Q) (vi v jk ) 6= jk ) 6 =
α 0, IX ( Q) ( vi vα−1 0, F ( v v ) 6 = 0},
Eα (vi , vk ) = i(Ejkα−1 ◦ E)(v i , vk ), E (vi , vk ) = (E ◦ E)(vXi(,Qv)k ),i jk
∗
and I =Upper Influence ={vi v jk ∈ I | TX (Q) (vi v jk ) 6= 0, IX (Q) (vi v jk ) 6= 0, FX (Q) (vi v jk ) 6= 0}.
_ ^
◦ ∗ ∗ ) ∧ Tedge
(E E)(v , v )=
Definition 23. If vij ∈ E (E ), then
i k (TR(M)
vij is(v
a ijlower (vjk ))),edge) of(Ithe
R(M)(upper R(M)soft ij ) ∨ IR(M)
(vrough (vjk )), influence
neutrosophic
∗ ∗ vj ∈V∗ vj ∈V∗ ∗ ∗
graph. If vi v jk ∈ I (I ), then vi v jk is lower pairs (upper pair). If^v jk ∈ E (E ) and vi v jk , is not lower pairs
(upper pairs), then it is a lower non-influence edge (upper non-influence(Fedge). R(M) (vij ) ∨ FR(M) (vjk )) ,
vj ∈V∗
_
Definition(E24. A soft
◦ E)(v rough neutrosophic
(TR(M) (vinfluence graph has a^ walk if each
(vijapproximation graph has an
i , vk )= ij ) ∧ TR(M) (vjk )), (IR(M) ) ∨ IR(M) (vjk )),
alternative sequence of the form
vj ∈V
∗
vj ∈V
∗

^
0 0
(F (v ) ∨ F (v )) .
v0 , i0 , e0 , i0 , v1 , · · · , vn−1 , in−1 , en−1 , in−R(M)
1 , vn ij R(M) jk
∗
vj ∈V
such that
vk ∈ V∗ , ek ∈ 18
E∗ , ik , ik0 ∈ I∗ ,
∗ ∗ ∗
vk ∈ V , ek ∈ E , ik , ik0 ∈ I .
Mathematics 2018, 6, 125 19 of 37

where ik =(vk uv), ek =uv, ik0 =(vwvk+1 ) and ∀k =0,1,2,· · · ,n−1. If v0 = vn , then it is called closed. If the
pairs are distinct, then it is called a soft rough neutrosophic influence trail (SRNI trail). If the edges are distinct,
then it is called a soft rough neutrosophic trail (SRN trail). If the vertices are distinct in SRN trail, then it is
called a soft rough neutrosophic path (SRN path). If the vertices, edge and pairs are distinct in a walk of SRNIG,
then it is called a soft rough neutrosophic influence path (SRNI path). A path is a trail and an influence trail.
If a path in a soft rough neutrosophic influence graph is closed, then it is called a cycle.

Definition 25. A strength of soft rough neutrosophic influence graph, denoted by stren, is defined as

^ ^ _
stren= ( TR( M) (v jk )) ∧ ( TR( M) (v jk )), ( IR( M) (v jk ))∨
v jk ∈E∗ v jk ∈E
∗ v jk ∈E∗

_ _ _
( IR( M) (v jk )), ( FR( M) (v jk )) ∨ ( FR( M) (v jk )) .
∗ v jk ∈E∗ ∗
v jk ∈E v jk ∈E

An influence strength of soft rough neutrosophic influence graph, denoted by In stren, is defined as

^ ^ _
In stren= ( TX (Q) (vi v jk ) ∧ TX (Q) (vi v jk )), ( IR( M) (vi v jk )∨
vi v jk ∈ I ∗ vi v jk ∈ I
∗ (vi v jk )∈ I ∗

_ _ _
IR( M) (vi v jk )), ( FR( M) (vi v jk ) ∨ FR( M) (vi v jk )) .
∗ vi v jk ∈ I ∗ ∗
vi v jk ∈ I vi v jk ∈ E

Definition 26. In a soft rough neutrosophic influence graph G, if in each approximation graph
∞
CONNG (vi , vk ) = E∞ (vi , vk ) = ∨α {Eα (vi , vk )}, CONNG (vi , vk ) = E (vi , vk ) = ∨α {E (vi , vk )}.
α

where
α −1
Eα (vi , vk ) = (Eα−1 ◦ E)(vi , vk ), E (vi , vk ) = (E
α
◦ E)(vi , vk ),
and
_ ^
(E ◦ E)(vi , vk )= ( TR( M) (vij ) ∧ TR( M) (v jk )), ( IR( M) (vij ) ∨ IR( M) (v jk )),
v j ∈V∗ v j ∈V∗
^
( FR( M) (vij ) ∨ FR( M) (v jk )) ,
v j ∈V∗
_ ^
(E ◦ E)(vi , vk )= ( TR( M) (vij ) ∧ TR( M) (v jk )), ( IR( M) (vij ) ∨ IR( M) (v jk )),
∗ ∗
v j ∈V v j ∈V
^
( FR( M) (vij ) ∨ FR( M) (v jk )) .
∗
v j ∈V

Thus it is the strength of strongest path from vi to vk in G.

In a soft rough neutrosophic influence graph G, if in each approximation graph
∞
ICONNG (vi , vk ) = I∞ (vi , vk ) = ∨α {Iα (vi , vk )}, ICONNG (vi , vk ) = I (vi , vk ) = ∨α {I (vi , vk )}.
α

where
α −1
Iα (vi , vk ) = (Iα−1 ◦ I)(vi , vk ), I (vi , vk ) = (I
α
◦ I)(vi , vk ),
Mathematics 2018, 6, 125 20 of 37

and
_ ^
(I ◦ I)(vi , vk )= ( TX (Q) (vi vlm ) ∧ TX (Q) (vm v pk )), ( IX (Q) (vi vlm ) ∨ IX (Q) (vm v pk )),
v m ∈V∗ v m ∈V∗
^
( FX (Q) (vi vlm ) ∨ FX (Q) (vm v pk )) ,
v m ∈V∗
_ ^
(I ◦ I)(vi , vk )= ( TX (Q) (vi vlm ) ∧ TX (Q) (vm v pk )), ( IX (Q) (vi vlm ) ∨ IX (Q) (vm v pk )),
∗ ∗
v m ∈V v m ∈V
^
( FX (Q) (vi vlm ) ∨ FX (Q) (vm v pk )) .
∗
v m ∈V

Thus it is the strength of strongest path from vi to vk in G.

Definition 27. A SRNIG is called connected if each two vertex v j and vk are joined by a SRN (SRNI) path.
Maximal connected partial subgraphs in each approximation subgraph are called component.

Definition 28. A soft rough neutrosophic influence graph is a cycle if and only if the underlying graphs of each
approximation is a cycle. A soft rough neutrosophic influence graph is a soft rough neutrosophic cycle if and only
∗
if the underlying graphs of each approximations is a cycle and there exist vlm ,vij ∈ E∗ ,vlm ,vij ∈ E and vlm 6=vij ,
such that
^ _ _
R( M )(vij )= TR( M) (vlm ), IR( M) (vlm ), FR( M) (vlm ) ,
vlm ∈E∗ −vij vlm ∈E∗ −vij vlm ∈E∗ −vij
^ _ _
R( M )(vij )= TR( M) (vlm ), IR( M) (vlm ), FR( M) (vlm ) .
∗ ∗ ∗
vlm ∈E −vij vlm ∈E −vij vlm ∈E −vij

A soft rough neutrosophic influence graph is a soft rough neutrosophic influence cycle if and only if
∗
the graphs is soft rough neutrosophic cycle and there exist vl vmn ,vi v jk ∈ I ∗ ,vl vmn ,vi v jk ∈ I and vl vmn 6=vi v jk ,
such that
^ _ _
X ( Q)(vi v jk )= TX (Q) (vl vmn ), IX (Q) (vl vmn ), FX (Q) (vl vmn ) ,
vl vmn ∈I∗ −vi v jk vl vmn ∈I∗ −vi v jk vl vmn ∈I∗ −vi v jk
^ _ _
X ( Q)(vi v jk )= TX (Q) (vl vmn ), IX (Q) (vl vmn ), FX (Q) (vl vmn ) .
∗ ∗ ∗
vl vmn ∈I −vi v jk vl vmn ∈I −vi v jk vl vmn ∈I −vi v jk

Example 7. Considering Example 4. Let I ={v1 v32 ,v1 v24 ,v2 v13 ,v3 v24 ,v3 v41 ,v4 v13 ,v4 v32 } ⊆V̂ and
P={ a1 a32 ,a2 a43 ,a4 a13 }⊆ Â. Then a full soft set X on I (from P to I) can be defined in Table 14 as follows:

Table 14. Full soft set X.

X v1 v32 v1 v24 v2 v13 v3 v24 v3 v41 v4 v13 v4 v32

a1 a32 1 0 0 0 0 0 1
a2 a43 0 0 1 0 0 1 0
a4 a13 0 1 0 1 1 0 0
Mathematics 2018, 6, 125 21 of 37

Let Q={(v1 v32 ,0.2,0.1,0.0),(v1 v24 ,0.1,0.0,0.1),(v2 v13 ,0.2,0.1,0.0),(v3 v24 ,0.2,0.1,0.0),(v4 v13 ,0.1,0.1,0.0),
(v4 v32 ,0.0,0.1,0.0)} be a neutrosophic set on I. Then from Equation (3) of Definition 4, we have
Table 14: Full soft set X
X v v 320.0), (1vvv24 , 0.1,v0.0,
X ( Q)={(v1 v32 , 0.2,10.1,
v 2 v13 v v24, 0.2,v0.1,
0.0), (v32 v13 3 v0.0
41 ), (vv4vv13 v4 v32
1 24 3 24 , 0.1, 0.0, 0.0),
a1 a32 1 0 0 0 0 0 1
(v3 v41 , 0.1, 0.0, 0.0), (v4 v13 , 0.1, 0.1, 0.0), (v4 v32 , 0.2, 0.1, 0.0)},
a2 a
X ( Q)={( v143
0 0 1 0 0 1 0
v32 , 0.0, 0.1, 0.0), (v1 v24 , 0.1, 0.1, 0.1), (v2 v13 , 0.1, 0.1, 0.1), (v3 v24 , 0.0, 0.1, 0.1),
a4 a13 0 1 0 1 1 0 0
(v3 v41 , 0.1, 0.1, 0.1), (v4 v13 , 0.1, 0.1, 0.1), (v4 v32 , 0.0, 0.1, 0.0)}.

Thus, G = (S( N ), R( M), X ( Q)) and G = (S( N ), R( M ), X( Q)) are LSRNIAG and USRNIAG,
X(Q)={(v 1 v32
respectively, as ,shown
0.0, in
0.1, 0.0),
Figure (v1v24G,=0.1,
7. Hence, (G,0.1,
G) is0.1), (vThe
SRNIG. 2 v13 , 0.1, 0.1,
underlying 0.1),
graph G∗ =((vG3v∗ ,G
24∗,)0.0,
such 0.1,
that 0.1),
∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗
G =(V ,E ,I ), G =(V ,E ,I ) where (v3 vV41 ,=0.1,
V =V0.1, = E=E(vand
, E 0.1), 4 v13I ,= I =I 0.1,
0.1, 0.1),
. v13 ,v 32 ,v24(v
,v441vare
32 ,the
0.0, 0.1, 0.0)}.
lower
edge and upper edge and v1 v32 ,v4 v32 is a lower pair and upper pair. v2 v41 is both lower and upper non-influence
edge. P(v1 , v4 ) is a path of the sequence of the form v1 ,v1 v24 ,v24 ,v2 v13 ,v3 ,v3 v41 ,v41 ,v1 v32 ,v2 ,v2 v13 ,v3 v24 ,v4 .
Thus, G By
= (S(Ndirect),calculations,
R(M ), X(Q)) the strength
and and
G = influence
(S(Nstrength
), R(Mof),this path are
X(Q))
respec are(0.2,0.2,0.1
LSRNIAG ) and (and 0.0,0.1,0.1 ),
USRNIAG,
respectively. G is cycle, soft rough neutrosophic cycle and soft rough neutrosophic influence cycle. ∗ ∗ ∗
tively, as shown in Figure 7. Hence, G = (G, G) is SRNIG. The underlying graph G =(G ,G ) such tha
v1 (0.3, 0.6, 0.6)
b
v1 (0.9, 0.4, 0.4)
b
(0

(0
.0)
0 .0 )
.0)
.3
0 .1 )

.3
,0

,0
0
0

.2 ,

.2 ,
0 .0 ,

(0.2, 0.1,
,

(0.0, 0.1,
, 0 .1

.1 )
)

0 .1
0 .1

0 .1
,0

,
)

(0.1

)
.1 ,

(0.1

, 0 .1 )

0 .1
)
.5 , 0 .1

(0.1, (0.1,
2

v3 (0.9, 0.4, 0.4)

v3 (0.3, 0.6, 0.6)

0)
1)

(0.
(0.

0 .1 , 0 0 .0 , 0
0 , 0 .2

.1 ) .1 ) .0 ) .0 )

.1 , 0 .
.1 , 0 .

, 0 , 0
4, 0

, 0 . 1 , 0 . 1
b
0
( (. 1 b b
(0.1 b
.

(0.
v 4(0.

0 .0
0
0

2, 0
(

, 0.
(0.2,
(0.1,

1, 0 .1 ,
.0 ) 0 .0
(0

)
.3

) )
0 .1 0 .0 )
,0

,0
)

0 .1
0 .1

, ,
.2 ,

.1 ,

0. 1 0. 0
.1 ,
.1 ,

.0 , .1 ,
0 .1

0 .1

(0
,0

(0
,0
)

.2
.2

(0
(0

b b
v2 (0.4, 0.5, 0.1) v2 (1.0, 0.2, 0.1)
G = (S(N ), R(M ), X(Q)) G = (S(N ), R(M ), X(Q))

Figure 7. Soft rough neutrosophic influence graph G = (G, G).

Figure 7: Soft rough neutrosophic influence graph G = (G, G)
∗ 29. ∗A soft
Definition ∗ ∗rough neutrosophic influence
∗ subgraph ∗H=(SN2 ,RM2 ,XQ∗2 ) of a soft rough
G∗ =(V∗ ,E∗ ,I ∗
), G =(V
neutrosophic ,E ,I
influence ) where
graph G=(SN1V
∗
,RM =V =V , E∗ =E=E and I∗ =I=I . v13 ,v32 ,v24 ,v41 are the lowe
1 ,XQ1 ), if v ∈ H such that
edge and upper edge and v1 v32 ,v4 v32 is a lower pair and upper pair. v2 v41 is both lower and upper non
N2 ) ( v )≤
influence edge. P (v1 , v4 ) is TaS(path ofTthe (v), IS( N2 ) (vof
S( N1 )sequence )≥the ) ( v ), Fv
IS( N1form S(1N,v (v)≥ FS(24
2 ) 1 v24 ,v
(v2)v, 13 ,v3 ,v3 v41 ,v41 ,v1 v32 ,v2 ,v2 v13
N1 ),v
v3 v24 ,v4 . By direct calculations,
TS( N2 ) (v)≤ the
TS( Nstrength
1)
(v), IS( N2 ) (and
v)≥ ISinfluence
( N1 ) ( v ), FS( Nstrength
2)
(v)≥ FS( N1of) ( v )this
, path are (0.2,0.2,0.1) an
(0.0,0.1,0.1), respectively. G is cycle, soft rough neutrosophic cycle and soft rough neutrosophic influenc
vij ∈ H,
cycle.
Definition 3.9. A soft M2 ) ( vij )≤
TR(rough TR( M1 ) (vij ), IR( M
neutrosophic (vij )≥ IR( M
influence
2)
(vij ), FR( M
subgraph
1) H=(SN
2)
(vij )≥ FR,RM ( v ),
2 ( M1 ) 2ij,XQ2 ) of a soft rough neu
trosophic influence graph
TR( MG=(SN
2)
(vij )≤ TR1(,RM
M1 ) ( vij1),XQ
, IR( M12 )),
(vijif)≥
v∈H
IR( M1 )such
(vij ), Fthat
R( M2 ) ( vij )≥ FR( M1 ) ( vij ),

and vi v jk ∈ T
H,
S(N2 ) (v)≤TS(N1 ) (v), IS(N2 ) (v)≥IS(N1 ) (v), FS(N2 ) (v)≥FS(N1 ) (v),
TXT(Q
S(N 2
(v)≤T Q ) (v1i)v(v),
) ( v2i)v jk )≤ TX (S(N
I Q ) (2v)i v(v)≥I
jk ), IX (S(N 1 jk )≥ IXS(N
(v), F (Q ) (2v)ij(v)≥F
( Q ) (1v)i v jk ), FXS(N
2
)≥ FX (QS(N
1
(v),
) ( vi1v)jk ), 2 1

vij ∈H,
TR(M2 ) (vij )≤TR(M1 ) (vij ), IR(M2 ) (vij )≥IR(M1 ) (vij ), FR(M2 ) (vij )≥FR(M1 ) (vij ),
TR(M ) (vij )≤TR(M ) (vij ), IR(M ) (vij )≥IR(M ) (vij ), FR(M ) (vij )≥FR(M ) (vij ),
Mathematics 2018, 6, 125 22 of 37

TX (Q2 ) (vi v jk )≤ TX (Q1 ) (vi v jk ), IX (Q2 ) (vi v jk )≥ IX (Q1 ) (vi v jk ), FX (Q2 ) (vij )≥ FX (Q1 ) (vi v jk ).

Definition 30. A H=(SN2 ,RM2 ,XQ2 ) is called soft rough neutrosophic influence spanning subgraph of a soft
rough neutrosophic influence graph G=(SN1 ,RM1 ,XQ1 ), if H is a soft rough neutrosophic influence subgraph
such that

TS( N2 ) (v)= TS( N1 ) (v), IS( N2 ) (v)= IS( N1 ) (v), FS( N2 ) (v)= FS( N1 ) (v),
TS( N2 ) (v)= TS( N ) (v), IS( N2 ) (v)= IS( N ) (v), FS( N2 ) (v)= FS( N ) (v).
1 1 1

Definition 31. A soft rough neutrosophic influence graph is a forest if and only if each supporting approximation
graph is a forest. A soft rough neutrosophic influence graph G =(SN1 ,RM1 ,XQ1 ) is a soft rough neutrosophic
forest if and only if there exist a soft rough neutrosophic spanning subgraph H=(SN1 ,RM2 ,XQ2 ) is a forest
such that vij ∈G−H

A soft rough neutrosophic influence graph G=(SN1 ,RM1 ,XQ1 ) is a soft rough neutrosophic influence
forest if and only if there exist a soft rough neutrosophic spanning subgraph H=(SN1 ,RM1 ,XQ2 ) is a forest
such that vi v jk ∈G−H

TX (Q1 ) (vi v jk )< TICONNH (vi , vk ), TX (Q1 ) (vi v jk )< TICONNH (vi , vk ),
IX (Q1 ) (vi v jk ) > I ICONNH (vi , vk ), IX (Q1 ) (vi v jk ) > I ICONNH (vi , vk ),
FX (Q1 ) (vi v jk )> FICONNH (vi , vk ), FX (Q1 ) (vi v jk )> FICONNH (vi , vk ).

Definition 32. A soft rough neutrosophic influence graph is a tree if and only if each supporting approximation
graph is a tree. A soft rough neutrosophic influence graph G =(SN1 ,RM1 ,XQ1 ) is a soft rough neutrosophic tree
if and only if there exist a soft rough neutrosophic spanning subgraph H=(SN1 ,RM2 ,XQ2 ) is a tree such that
vij ∈G−H

A soft rough neutrosophic influence graph G=(SN1 ,RM1 ,XQ1 ) is a soft rough neutrosophic influence tree
if and only if there exist a soft rough neutrosophic spanning subgraph H=(SN1 ,RM1 ,XQ2 ) is a tree such that
vi v jk ∈G−H

Definition 33. Let G=(SN,RM,XQ) be a soft rough neutrosophic influence graph, an edge vij is a bridge if
edge vij is a bridge in both underlying graphs of G and G. Let G=(SN,RM,XQ) be a soft rough neutrosophic
influence graph, an edge vij is a soft rough neutrosophic bridge if vlm ∈G
Mathematics 2018, 6, 125 23 of 37

TCONNG−v (vl , vm )< TCONNG (vl , vm ), TCONNG−v (vl , vm )< TCONNG (vl , vm ),
ij ij

ICONNG−v (vl , vm ) > ICONNG (vl , vm ), ICONNG−v (vl , vm ) > ICONNG (vl , vm ),
ij ij

FCONNG−v (vl , vm )> FCONNG (vl , vm ), FCONNG−v (vl , vm )> FCONNG (vl , vm ),
ij ij

Let G=(SN,RM,XQ) be a soft rough neutrosophic influence graph, an edge vij is an soft rough
neutrosophic influence bridge if vlm ∈G

TICONNG−v (vl , vm )< TICONNG (vl , vm ), TICONNG−v (vl , vm )< TICONNG (vl , vm ),
ij ij

I ICONNG−v (vl , vm ) > I ICONNG (vl , vm ), ;I ICONNG−v (vl , vm ) > I ICONNG (vl , vm ),
ij ij

FICONNG−v (vl , vm )> FICONNG (vl , vm ), FICONNG−v (vl , vm )> FICONNG (vl , vm ),
ij ij

Definition 34. Let G=(SN,RM,XQ) be a soft rough neutrosophic influence graph, a vertex is a cutnode if a
vertex vi is a cutnode in underlying graphs of G and G. Let G=(SN,RM,XQ) be a soft rough neutrosophic
influence graph then a vertex vi in G is a soft rough neutrosophic cutnode if the deletion of vi from G reduces the
∗
strength of the connectedness from nodes v j →vk ∈V∗ ,V

TCONNG−v (v j , vk )< TCONNG (v j , vk ), TCONNG−v (v j , vk )< TCONNG (v j , vk ),

i i

ICONNG−v (v j , vk ) > ICONNG (v j , vk ), ICONNG−v (v j , vk ) > ICONNG (v j , vk ),

i i

FCONNG−v (v j , vk )> FCONNG (v j , vk ), FCONNG−v (v j , vk )> FCONNG (v j , vk ).

i i

Let G=(SN,RM,XQ) be a soft rough neutrosophic influence graph then a vertex vi in G is an neutrosophic
influence cutnode if the deletion of vi from G reduces the influence strength of the connectedness from
∗
v j →vk ∈V∗ ,V

TICONNG−v (v j , vk )< TICONNG (v j , vk ), TICONNG−v (v j , vk )< TICONNG (v j , vk ),

i i

I ICONNG−v (v j , vk ) > I ICONNG (v j , vk ), I ICONNG−v (v j , vk ) > I ICONNG (v j , vk ),

i i

FICONNG−v (v j , vk )> FICONNG (v j , vk ), FICONNG−v (v j , vk )> FICONNG (v j , vk ),

i i

Definition 35. Let G=(SN,RM,XQ) be a soft rough neutrosophic influence graph. A pair vi v jk is called a
cutpair if and only if vi v jk is a cutpair in both supporting influence graph of G and G. That is after removing the
pair vi v jk there is no path from vi to vk in both supporting influence graph of G and G. Let G=(SN,RM,XQ)
be a soft rough neutrosophic influence graph. A pair vi v jk is called a soft rough neutrosophic cutpair if and
only if if deleting the pair vi v jk reduces the connectedness from vi to vk in both graph G and G. That is,

TCONNG−v v (vi , vk )< TCONNG (vi , vk ), TICONNG−v v (vi , vk )< TICONNG (vi , vk ),
i jk i jk

ICONNG−v v (vi , vk ) > ICONNG (vi , vk ), I ICONNG−v v (vi , vk ) > I ICONNG (vi , vk ),
i jk i jk

FCONNG−v v (vi , vk )> FCONNG (vi , vk ), FICONNG−v v (vi , vk )> FICONNG (vi , vk ),
i jk i jk
Mathematics 2018, 6, 125 24 of 37

A soft rough neutrosophic influence cutpair vi v jk is a pair in a soft rough neutrosophic influence graph
G=(SN,RM,XQ) if there is spanning influence subgraph H = G − vi v jk reduces the strength of the influence
connectedness from vi to vk . That is,

TICONNG−v v (vi , vk )< TICONNG (vi , vk ), TICONNG−v v (vi , vk )< TICONNG (vi , vk ),
i jk i jk

I ICONNG−v v (vi , vk ) > I ICONNG (vi , vk ), I ICONNG−v v (vi , vk ) > I ICONNG (vi , vk ),
i jk i jk

FICONNG−v v (vi , vk )> FICONNG (vi , vk ), FICONNG−v v (vi , vk )> FICONNG (vi , vk ),
i jk i jk

Definition 36. An edge vij in soft rough neutrosophic influence graph G is called strong soft rough neutrosophic
edge if

TR( M) (vij )≥ TCONNG−v (vi , v j ), TR( M) (vij ) ≥ TCONNG−v (vi , v j ),

ij ij

IR( M) (vij ) ≤ ICONNG−v (vi , v j ) , IR( M) (vij ) ≤ ICONNG−v (vi , v j ),

ij ij

FR( M) (vij )≤ FCONNG−v (vi , v j ) , FR( M) (vij ) ≤ FCONNG−v (vi , v j ).

ij ij

A pair vi v jk in soft rough neutrosophic influence graph G is called strong pair if

TX (Q) (vi v jk )≥ TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) ≥ TICONNG−v v (vi , vk ),

i jk i jk

IX (Q) (vi v jk ) ≤ I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) ≤ I ICONNG−v v (vi , vk ),

i jk i jk

FX (Q) (vi v jk )≤ FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) ≤ FICONNG−v v (vi , vk ).

i jk i jk

Definition 37. An edge vij in soft rough neutrosophic influence graph G is called α−strong soft rough
neutrosophic edge if

TR( M) (vij )> TCONNG−v (vi , v j ), TR( M) (vij ) > TCONNG−v (vi , v j ),
ij ij

IR( M) (vij ) < ICONNG−v (vi , v j ) , IR( M) (vij ) < ICONNG−v (vi , v j ),
ij ij

FR( M) (vij )< FCONNG−v (vi , v j ) , FR( M) (vij ) < FCONNG−v (vi , v j ).
ij ij

A pair vi v jk in soft rough neutrosophic influence graph G is called α−strong pair if

TX (Q) (vi v jk )> TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) > TICONNG−v v (vi , vk ),
i jk i jk

IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ),
i jk i jk

FX (Q) (vi v jk )< FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) < FICONNG−v v (vi , vk ).
i jk i jk

Definition 38. An edge vij in soft rough neutrosophic influence graph G is called β−strong soft rough
neutrosophic edge if

TR( M) (vij )= TCONNG−v (vi , v j ), TR( M) (vij ) = TCONNG−v (vi , v j ),

ij ij

IR( M) (vij ) = ICONNG−v (vi , v j ) , IR( M) (vij ) = ICONNG−v (vi , v j ),

ij ij

FR( M) (vij )= FCONNG−v (vi , v j ) , FR( M) (vij ) = FCONNG−v (vi , v j ).

ij ij
Mathematics 2018, 6, 125 25 of 37

A pair vi v jk in soft rough neutrosophic influence graph G is called β−strong pair if

TX (Q) (vi v jk )= TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) = TICONNG−v v (vi , vk ),

i jk i jk

IX (Q) (vi v jk ) = I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) = I ICONNG−v v (vi , vk ),

i jk i jk

FX (Q) (vi v jk )= FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) = FICONNG−v v (vi , vk ).

i jk i jk

Definition 39. An edge vij in soft rough neutrosophic influence graph G is called δ−strong soft rough
neutrosophic edge if

TR( M) (vij )< TCONNG−v (vi , v j ), TR( M) (vij ) < TCONNG−v (vi , v j ),
ij ij

IR( M) (vij ) > ICONNG−v (vi , v j ) , IR( M) (vij ) > ICONNG−v (vi , v j ),
ij ij

FR( M) (vij )> FCONNG−v (vi , v j ) , FR( M) (vij ) > FCONNG−v (vi , v j ).
ij ij

A pair vi v jk in soft rough neutrosophic influence graph G is called δ−strong pair if

TX (Q) (vi v jk )< TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) < TICONNG−v v (vi , vk ),
i jk i jk

IX (Q) (vi v jk ) > I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) > I ICONNG−v v (vi , vk ),
i jk i jk

FX (Q) (vi v jk )> FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) > FICONNG−v v (vi , vk ).
i jk i jk

Definition 40. A δ−strong soft rough neutrosophic edge vij is called a δ∗ −strong soft rough neutrosophic
edge if
^ ^
TR( M) (vij )> TR( M) (vlm ), TR( M) (vij )> TR( M) (vlm ),
vlm ∈ E∗ vlm ∈ E
∗
^ ^
IR( M) (vij ) < IR( M) (vlm ), IR( M) (vij ) < IR( M) (vlm ),
vlm ∈ E∗ vlm ∈ E
∗
^ ^
FR( M) (vij )< FR( M) (vlm ), FR( M) (vij )< FR( M) (vlm ).
vlm ∈ E∗ vlm ∈ E
∗

A δ−strong pair vi v jk is called a δ∗ −strong pair if

^ ^
TR( M) (vij )> TR( M) (vlm ), TR( M) (vij )> TR( M) (vlm ),
vlm ∈E∗ vlm ∈E
∗
^ ^
IR( M) (vij ) < IR( M) (vlm ), IR( M) (vij ) < IR( M) (vlm ),
vlm ∈E∗ vlm ∈E
∗
^ ^
FR( M) (vij )< FR( M) (vlm ), FR( M) (vij )< FR( M) (vlm ).
vlm ∈E∗ vlm ∈E
∗

A δ−strong pair vi v jk is called a δ∗ −strong pair if vi v jk 6=vl vmn

^ ^
TX (Q) (vi v jk )> TX (Q) (vl vmn ), TX (Q) (vi v jk )> TX (Q) (vl vmn ),
vl vmn ∈I∗ vl vmn ∈I
∗
^ ^
IX (Q) (vi v jk ) < IX (Q) (vl vmn ), IX (Q) (vi v jk ) < IX (Q) (vl vmn ),
vl vmn ∈I∗ vl vmn ∈I∗
^ ^
FX (Q) (vi v jk )< FX (Q) (vl vmn ), FX (Q) (vi v jk )< FX (Q) (vl vmn ).
vl vmn ∈I∗ vl vmn ∈I∗
Mathematics 2018, 6, 125 26 of 37

Definition 41. A soft rough neutrosophic influence graph is said to be a soft rough neutrosophic influence block
if it has no soft rough neutrosophic influence cutnodes.

Example 8. Consider Example 5 Let I ={v1 v32 ,v1 v43 ,v2 v13 ,v3 v32 ,v4 v13 }⊆V̂ and P={ a1 a34 ,a3 a24 ,a4 a12 }⊆ Â.
Then a full soft set X on I (from P to I) can be defined in Table 15 as follows:

Table 15. Full soft set X.

X v1 v32 v1 v43 v2 v13 v3 v32 v4 v13

a1 a34 0 1 1 0 1
a3 a24 0 1 0 0 0
a4 a12 1 0 0 1 0

Let Q={(vv32 ,0.3,0.0,0.0),(vv43 ,0.2,0.0,0.0),(v2 v13 ,0.1,0.0,0.0),(v3 v32 ,0.2,0.0,0.0),(v4 v13 ,0.3,0.0,0.0}
be a neutrosophic set on I. Then from Equation (3) of Definition 4, we have

X ( Q)={(v1 v32 , 0.3, 0.0, 0.0), (v1 v43 , 0.2, 0.0, 0.0), (v2 v13 , 0.3, 0.0, 0.0), (v3 v32 , 0.3, 0.0, 0.0),
(v4 v13 , 0.3, 0.0, 0.0)},
X ( Q)={(v1 v32 , 0.2, 0.0, 0.0), (v1 v43 , 0.2, 0.0, 0.0), (v2 v13 , 0.1, 0.0, 0.0), (v3 v32 , 0.2, 0.0, 0.0),
X(Q)={(v1 v32 , 0.2, 0.0, 0.0), (v1v43 , 0.2, 0.0, 0.0), (v2v13 , 0.1, 0.0, 0.0), (v3v32 , 0.2, 0.0, 0.0),
(v4 v13 , 0.1, 0.0, 0.0)}.
(v4 v13 , 0.1, 0.0, 0.0)}.
Thus, G=(S( N ),R( M ),X ( Q)) and G=(S( N ),R( M ),X( Q)) are LSRNIAG and USRNIAG, respectively,
Thus, in Figure),R(M
as shownG=(S(N 8. Hence, G=(G,G
),X(Q)) ) is G=(S(N
and ),R(M
SRNIG. Hence G is),X(Q))
a tree, v3are
is a LSRNIAG
cutvertex, v13and USRNIAG, respecti
is a bridge,
v v is
as3 shown
32 a cutpair.
in Figure 8. Hence, G=(G,G) is SRNIG. Hence G is a tree, v3 is a cutvertex, v13 is a bri
b
v1 (0.3, 0.6, 0.6)
(0.2,0.0
.0 )
(0.3,0.2,0.1)
0 .0 ,0

,0.0)
( 0 .2 ,

( 0 .1 ,
0 .0 ,0
.0 )
(0.3,0.0,0.0)
)
.0 ,0 .0 b
(0.3,0.0,0.1) b

(0 .1 ,0 v3 (0.3, 0.6, 0.6) v2 (0.4, 0.5, 0.1)

G = (S(N ), R(M ), X(Q))
0 .1 )
. 3 , 0 .2 , b
v1 (0.9, 0.4, 0.4)
( 0 , 0 .)
.5
.4 , 0
v 4(0
b
(0.3,0.0
.0 )
(0.3,0.2,0.0)
0 .0 ,0

,0.0)
( 0 .2 ,

( 0 .3 ,
0 .0 ,0
.0 )
(0.3, 0.0 ,0. 0)
)
.0 ,0 .0 b
(0.3,0.0,0.0) b

(0 .3 ,0 v3 (0.9, 0.4, 0.4) v2 (0.9, 0.4, 0.4)

,0 . 1) G = (S(N ), R(M ), X(Q))
,0 .2
( 0 .3 )
, 0 .4
b
.9 , 0 .4
v 4(0

Figure 8. Soft rough neutrosophic influence graph G = (G, G).

Figure 8: Soft rough neutrosophic influence graph G = (G, G)

v3 v32 is a cutpair
Theorem 3.1. G is a soft rough neutrosophic influence forest if and only if in any cycle of G, there
pair v v such that
Mathematics 2018, 6, 125 27 of 37

Theorem 4. G is a soft rough neutrosophic influence forest if and only if in any cycle of G, there is a pair vi v jk
such that

TX (Q) (vi v jk )< TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) < TICONNG−v v (vi , vk ),
i jk i jk

IX (Q) (vi v jk ) > I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) > I ICONNG−v v (vi , vk ),
i jk i jk

FX (Q) (vi v jk )> FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) > FICONNG−v v (vi , vk ).
i jk i jk

Proof. The proof is obvious.

Theorem 5. A soft rough neutrosophic graph G is a soft rough neutrosophic influence forest if there is at most
one path with the most influence strength.

Proof. Let G be not a soft rough neutrosophic influence forest. Then by Theorem 4, there exist a cycle
C in G such that

TX (Q) (vi v jk )≥ TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) ≥ TICONNG−v v (vi , vk ),

i jk i jk

IX (Q) (vi v jk ) ≤ I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) ≤ I ICONNG−v v (vi , vk ),

i jk i jk

FX (Q) (vi v jk )≤ FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) ≤ FICONNG−v v (vi , vk ),

i jk i jk

for every pair vi v jk of C.

Therefore, vi v jk is the path within the most influence strength from vi to vk . Let vi v jk be a pair
such that
^ ^
TX (Q) (vi v jk )> TX (Q) (vl vmn ), TX (Q) (vi v jk )> TX (Q) (vl vmn ),
vl vmn ∈I∗ vl vmn ∈I
∗
^ ^
IX (Q) (vi v jk ) < IX (Q) (vl vmn ), IX (Q) (vi v jk ) < IX (Q) (vl vmn ),
vl vmn ∈I∗ vl vmn ∈I∗
^ ^
FX (Q) (vi v jk )< FX (Q) (vl vmn ), FX (Q) (vi v jk )< FX (Q) (vl vmn ),
vl vmn ∈I∗ vl vmn ∈I∗

in C. Then remaining part of C is a path with the most influence strength from vi to v jk . This is a
contradiction to the the fact there is at most one path with the most influence strength. Hence, G is a
soft rough neutrosophic influence forest.

Theorem 6. Assume that G is a cycle. Then G is not a soft rough neutrosophic influence tree if and only if
G is a soft rough neutrosophic influence cycle.

Proof. Let G=(SN,RM,XQ1 ) be a soft rough neutrosophic influence cycle. Then there exist at least
two distinct edge and two distinct pair such that
Mathematics 2018, 6, 125 28 of 37

^ _ _
R( M)(vij ) = TR( M) (vlm ), IR( M) (vlm ), FR( M) (vlm ) ,
vlm ∈E∗ −vij vlm ∈E∗ −vij vlm ∈E∗ −vij
^ _ _
R( M)(vij ) = TR( M) (vlm ), IR( M) (vlm ), FR( M) (vlm ) ,
∗ ∗ ∗
vlm ∈E −vij vlm ∈E −vij vlm ∈E −vij
^ _ _
X ( Q)(vi v jk )= TX (Q) (vl vmn ), IX (Q) (vl vmn ), FX (Q) (vl vmn ) ,
vl vmn ∈I∗ −vi v jk vl vmn ∈I∗ −vi v jk vl vmn ∈I∗ −vi v jk
^ _ _
X ( Q)(vi v jk )= TX (Q) (vl vmn ), IX (Q) (vl vmn ), FX (Q) (vl vmn ) .
∗ ∗ ∗
vl vmn ∈I −vi v jk vl vmn ∈I −vi v jk vl vmn ∈I −vi v jk

Let H=(SN,RM,XQ2 ) be a spanning soft rough neutrosophic influence tree in G. Then there
exists a path from vi to vk not involving vi v jk such that E1∗ −E2∗ ={(vi v jk )}. Hence there does not exist a
path in H from vi to vk such that

TX (Q2 ) (vi v jk )≤ TICONNG (vi , vk ), TX (Q2 ) (vi v jk ) ≤ TICONNG (vi , vk ),

IX (Q2 ) (vi v jk ) ≥ I ICONNG (vi , vk ) , IX (Q2 ) (vi v jk ) ≥ I ICONNG (vi , vk ),
FX (Q2 ) (vi v jk )≥ FICONNG (vi , vk ) , FX (Q2 ) (vi v jk ) ≥ FICONNG (vi , vk ).

Thus G is not a soft rough neutrosophic influence tree.

Conversely, suppose that G is not a soft rough neutrosophic influence tree. Since, G is a soft
∗
rough neutrosophic influence cycle. So for all vi v jk ∈I∗ and vi v jk ∈I , we have a soft rough neutrosophic
spanning influence subrgraph H=(SN,RM,XQ2 ) which is tree and X ( Q2 )(vi v jk )=0, X ( Q2 )(vi v jk )=0
such that ∀vi vlm 6= vl vmn

TX (Q2 ) (vi v jk )≤ TICONNH (vi , vk ), TX (Q2 ) (vi v jk ) ≤ TICONNG (vi , vk ),

IX (Q2 ) (vi v jk ) ≥ I ICONNG (vi , vk ) , IX (Q2 ) (vi v jk ) ≥ I ICONNG (vi , vk ),
FX (Q2 ) (vi v jk )≥ FICONNG (vi , vk ) , FX (Q2 ) (vi v jk ) ≥ FICONNG (vi , vk ),

∗
∀vl vmn ∈ I∗ − vi v jk and vl vmn ∈ I − vi v jk
^ ^
TX (Q2 ) (vi v jk )= TX (Q1 ) (vl vmn ), TX (Q2 ) (vi v jk )= TX (Q1 ) (vl vmn ),
vl vmn ∈I∗ vl vmn ∈I
∗
^ ^
IX (Q2 ) (vi v jk ) = IX (Q1 ) (vl vmn ), IX (Q2 ) (vi v jk ) = IX (Q1 ) (vl vmn ),
vl vmn ∈I∗ vl vmn ∈I∗
^ ^
FX (Q2 ) (vi v jk )= FX (Q1 ) (vl vmn ), FX (Q2 ) (vi v jk )= FX (Q1 ) (vl vmn ).
vl vmn ∈I∗ vl vmn ∈I∗

Therefore,
^ _ _
X ( Q)(vi v jk )= TX (Q) (vl vmn ), IX (Q) (vl vmn ), FX (Q) (vl vmn ) ,
vl vmn ∈I∗ −vi v jk vl vmn ∈I∗ −vi v jk vl vmn ∈I∗ −vi v jk
^ _ _
X ( Q)(vi v jk )= TX (Q) (vl vmn ), IX (Q) (vl vmn ), FX (Q) (vl vmn ) .
∗ ∗ ∗
vl vmn ∈I −vi v jk vl vmn ∈I −vi v jk vl vmn ∈I −vi v jk

where vi v jk 6= vl vmn not uniquely. Therefore G is a soft rough neutrosophic influence cycle.
Mathematics 2018, 6, 125 29 of 37

Theorem 7. If

TX (Q) (vi v jk )> TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) > TICONNG−v v (vi , vk ),
i jk i jk

IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ),
i jk i jk

FX (Q) (vi v jk )< FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) < FICONNG−v v (vi , vk ),
i jk i jk

in a soft rough neutrosophic graph. Then vi v jk is a cutpair in soft rough neutrosophic influence graph G.

Proof. Suppose vi v jk is not a cutapir in soft rough neutrosophic influence graph, then

TICONNG−v ,v (vi , vk )= TICONNG (vi , vk ), TICONNG−v ,v (vi , vk )= TICONNG (vl vmn ),

i k i k

I ICONNG−v ,v (vi , vk ) = I ICONNG (vi , vk ), I ICONNG−v ,v (vi , vk ) = I ICONNG (vl vmn ),

i k i k

FICONNG−v ,v (vi , vk )= FICONNG (vi , vk ), FICONNG−v ,v (vi , vk )= FICONNG (vl vmn ).

i k i k

Since,

TX (Q) (vi , vk )≤ TICONNG (vi , vk ), TX (Q) (vi , vk )≤ TICONNG (vl vmn ),

IX (Q) (vi , vk ) ≥ I ICONNG (vi , vk ), IX (Q) (vi , vk ) ≥ I ICONNG (vl vmn ),
FX (Q) (vi , vk )≥ FICONNG (vi , vk ), FX (Q) (vi , vk )≥ FICONNG (vl vmn ).

Therefore,

TICONNG−v ,v (vi , vk )≥ TX (Q) (vi , vk ), TICONNG−v ,v (vi , vk )≥ TX (Q) ((vi , vk )),

i k i k

I ICONNG−v ,v (vi , vk ) ≤ IX (Q) (vi , vk ), I ICONNG−v ,v (vi , vk ) ≤ IX (Q) ((vi , vk )),

i k i k

FICONNG−v ,v (vi , vk )≤ FX (Q) (vi , vk ), FICONNG−v ,v (vi , vk )≤ FX (Q) ((vi , vk )),

i k i k

which is a contradiction. Hence, it is proved.

Theorem 8. If

TX (Q) (vi v jk )> TX (Q) (vl vmn ), TX (Q) (vi v jk ) > TX (Q) (vl vmn ),
IX (Q) (vi v jk ) < IX (Q) (vl vmn ) , IX (Q) (vi v jk ) < IX (Q) (vl vmn ),
FX (Q) (vi v jk )< FX (Q) (vl vmn ) , FX (Q) (vi v jk ) < FX (Q) (vl vmn ),

for some vi v jk among all cycles in soft rough neutrosophic influence graph G. Then

TX (Q) (vi v jk )> TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) > TICONNG−v v (vi , vk ),
i jk i jk

IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ),
i jk i jk

FX (Q) (vi v jk )< FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) < FICONNG−v v (vi , vk ).
i jk i jk
Mathematics 2018, 6, 125 30 of 37

Proof. Since

TICONNG−v v (vi v jk )≥ TICONNG (vi v jk ), TICONNG−v v (vi v jk )≥ TICONNG ((vi v jk )),

i jk i jk

I ICONNG−v v (vi v jk ) ≤ I ICONNG (vi v jk ), I ICONNG−v v (vi v jk ) ≤ I ICONNG ((vi v jk )),

i jk i jk

FICONNG−v v (vi v jk )≤ FICONNG (vi v jk ), FICONNG−v v (vi v jk )≤ FICONNG ((vi v jk )).

i jk i jk

Therefore, there exists a path from vi to vk not involving (vi v jk ) such that

TICONNG−v v (vi v jk )≥ TX (Q) (vi v jk ), TICONNG−v v (vi v jk )≥ TX (Q) ((vi v jk )),

i jk i jk

I ICONNG−v v (vi v jk ) ≤ IX (Q) (vi v jk ), I ICONNG−v v (vi v jk ) ≤ IX (Q) ((vi v jk )),

i jk i jk

FICONNG−v v (vi v jk )≤ FX (Q) (vi v jk ), FICONNG−v v (vi v jk )≤ FX (Q) ((vi v jk )),

i jk i jk

This along with vi v jk is a cycle and vi v jk is least value.

Theorem 9. If vi v jk is a soft rough neutrosophic influence cutpair in soft rough neutrosophic influence
graph G. Then

for some vi v jk among all cycles of G.

Proof. Suppose on contrary in a cycle, we

Then any path involving it can be converted into a path not involving it with influence strength
greater than and equal to the value of XQ for previously deleted pairs. So vi v jk is not a cutpair. This is a
contradiction to our assumption. Hence vi v jk is not a pair with the least value among all cycle.

Theorem 10. If G=(SN1 ,RM1 ,XQ1 ) is a soft rough neutrosophic forest, then the pairs of neutrosophic
spanning subgraph H =(SN1 ,RM1 ,XQ2 ) such that

are exactly the cutpairs of G.

Theorem 11. A soft rough neutrosophic influence graph G is a cycle. Then an edge v jk is a soft rough
neutrosophic influence bridge if and only if it is an edge common to atmost two cutpair.

Theorem 12. Let G be a soft rough neutrosophic influence graph. Then the following conditions are equivalent.
Mathematics 2018, 6, 125 31 of 37

∗
1. For a pair vi v jk ∈I∗ ∩ I

TX (Q) (vi v jk )> TICONNG−v v (vi , vk ), TX (Q) (vi v jk ) > TICONNG−v v (vi , vk ),
i jk i jk

IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ) , IX (Q) (vi v jk ) < I ICONNG−v v (vi , vk ),
i jk i jk

FX (Q) (vi v jk )< FICONNG−v v (vi , vk ) , FX (Q) (vi v jk ) < FICONNG−v v (vi , vk ).
i jk i jk

2. vi v jk is an influence cutpair

4. Application to Decision-Making
Decision making is a process that plays an important role in our daily lives. Decision making
process can help us make more purposeful, thoughtful decisions by systemizing relevant information
step by step. The process of decision making involves making a choice among different alternatives,
it starts when we do not know what to do.
The selection of the right path for transferring goods from one state to another states illegally.
Every state has different polices within or out side the state, there are several factors to take into
consideration for selecting the right path. Whether the economy of a country is good, having job
opportunity or a safety.
Suppose a trader wants to extend his business to the countries C1 ,C2 ,C3 ,C4 ,C5 and C6 . Initially,
he takes C1 and extends his business one by one. Assume A is set of the parameters, consisting of
element a1 = job, a2 = economy above average, a3 = safety, a4 = other.
Let S be a full soft set from A to parameter set V, as shown in Table 16.

Table 16. Soft Neutrosophic Set S.

S C1 C2 C3 C4 C5 C6
a1 1 1 1 0 1 1
a2 0 0 1 1 1 1
a3 1 1 1 0 0 1
a3 1 1 1 1 1 1

Suppose N ={(C1 ,0.8,0.6, 0.7),(C2 ,0.9,0.5,0.65),(C3 ,0.75,0.6,0.65),(C4 ,1.0,0.55,0.85),(C5 ,0.95,0.63,0.8),

(C6 ,0.85,0.65,0.95)} is most favorable object describes membership of suitable countries foreign polices
corresponding to the boolean set V, which is a neutrosophic set on the set V under consideration.
SN = (S( N ), S( N )) is a full soft rough set in full soft approximation space (V, S) where

S( N )={(C1 , 0.90, 0.50, 0.65), (C2 , 0.90, 0.50, 0.65), (C3 , 0.90, 0.55, 0.65), (C4 , 1.00, 0.55, 0.65),
(C5 , 0.95, 0.55, 0.65), (C6 , 0.9, 0.55, 0.65)},
S( N )={(C1 , 0.75, 0.65, 0.95), (C2 , 0.75, 0.65, 0.95), (C3 , 0.75, 0.65, 0.95), (C4 , 0.75, 0.65, 0.95),
(C5 , 0.75, 0.65, 0.95), (C6 , 0.75, 0.65, 0.95)} .

Let E={C12 ,C14 ,C15 ,C23 ,C26 ,C34 ,C35 ,C45 ,C46 ,C56 }⊆Ṽ = V × V and L={ a14 , a21 , a34 , a42 }⊆ Ã = A × A.
A full soft relation R on E (from L to E) can be defined as shown in Table 17.

Table 17. Full soft set R.

R C12 C14 C15 C23 C26 C34 C35 C45 C46 C56
a14 1 1 1 1 1 1 1 0 0 1
a21 0 0 0 0 0 0 1 1 1 1
a34 1 1 1 1 1 1 1 0 0 0
a42 0 1 1 1 1 1 1 1 1 1
Mathematics 2018, 6, 125 32 of 37

Let M={(C12 ,0.74,0.5,0.62),(C14 ,0.75,0.45,0.63),(C15 ,0.74,0.54,0.61),(C23 ,0.72,0.48,0.65),(C26 ,0.71,

0.49,0.64),(C34 ,0.72,0.53,0.64),(C35 ,0.73,0.52,0.63),(C45 ,0.7,0.51,0.61),(C46 ,0.74,0.55,0.6),(C56 ,0.73,0.47,
0.64)} be most favorable object describes membership of countries foreign polices toward
others countries corresponding to the boolean set E, which is a neutrosophic set on the set V
under consideration.
RM = ( RM, RM) is a soft neutrosophic rough relation, where

RM={(C12 , 0.75, 0.45, 0.61), (C14 , 0.75, 0.45, 0.61), (C15 , 0.75, 0.45, 0.61), (C23 , 0.75, 0.45, 0.61),
(C26 , 0.75, 0.45, 0.61), (C34 , 0.75, 0.45, 0.61), (C35 , 0.74, 0.47, 0.61), (C45 , 0.74, 0.47, 0.6),
(C46 , 0.74, 0.47, 0.6), (C56 , 0.74, 0.47, 0.61)},
RM ={(C12 , 0.71, 0.54, 0.65), (C14 , 0.71, 0.54, 0.65), (C15 , 0.71, 0.54, 0.65), (C23 , 0.71, 0.54, 0.65),
(C26 , 0.71, 0.54, 0.65), (C34 , 0.71, 0.54, 0.65), (C35 , 0.71, 0.54, 0.64), (C45 , 0.70, 0.55, 0.64),
(C46 , 0.70, 0.55, 0.64), (C56 , 0.71, 0.54, 0.64)}.

Let I ={C1 C15 ,C1 C23 ,C1 C35 ,C2 C34 ,C3 C14 ,C3 C26 ,C3 C45 ,C4 C23 ,C4 C45 ,C4 C46 ,C5 C23 ,C5 C34 , C5 C46 ,
C6 C12 ,C6 C15 }⊆V̂ = V × E and F ={ a1 a42 ,a2 a14 ,a3 a34 ,a4 a21 ,a4 a42 }⊆ Â = A × L.
A full soft relation X on I (from F to I) can be defined in Table 18 as follows:

Table 18. Full soft set X.

C1 C15 C1 C23 C1 C35 C2 C34 C3 C14 C3 C26 C3 C45 , C4 C23

X
C4 C45 C4 C46 C5 C23 C5 C34 C5 C46 C6 C12 C6 C15
1 1 1 1 1 1 1 0
e1 e42
0 0 1 1 1 0 1
0 0 0 0 1 1 0 0
e2 e14
0 0 1 1 0 1 1
0 0 0 0 0 0 0 1
e2 e34
0 0 0 0 0 0 0
1 1 1 1 1 1 0 0
e3 e34
0 0 0 0 0 1 1
0 0 1 0 0 0 1 0
e4 e21
1 1 0 0 1 0 0
1 1 1 1 1 1 1 0
e4 e42
1 1 1 1 1 0 1

Let Q = {(C1 C15 , 0.7, 0.43, 0.58), (C1 C23 , 0.65, 0.39, 0.54), (C1 C35 , 0.66, 0.37, 0.56), (C2 C34 , 0.68, 0.38,
0.59), (C3 C14 , 0.6, 0.4, 0.6), (C3 C26 , 0.62, 0.42, 0.58), (C3 C45 , 0.64, 0.45, 0.54), (C4 C23 , 0.7, 0.45, 0.60), (C4 C45 ,
0.7, 0.36, 0.48), (C4 C46 , 0.68, 0.35, 0.5), (C5 C23 , 0.69, 0.45, 0.54), (C5 C34 , 0.65, 0.42, 0.58), (C5 C46 , 0.64, 0.41,
0.59), (C6 C12 , 0.63, 0.4, 0.6), (C6 C15 , 0.62, 0.39, 0.5)} be most favorable object describes membership of
countries impact toward others countries regarding trade corresponding to the boolean set I, which is
a neutrosophic set on the set I under consideration.
XQ = ( XQ, XQ) is a soft neutrosophic rough influence, where
Mathematics 2018, 6, 125 33 of 37

XQ={(C1 C15 , 0.70, 0.37, 0.50), (C1 C23 , 0.70, 0.37, 0.50), (C1 C35 , 0.70, 0.37, 0.50), (C2 C34 , 0.70, 0.37, 0.50),
(C3 C14 , 0.69, 0.39, 0.50), (C3 C26 , 0.69, 0.39, 0.50), (C3 C45 , 0.70, 0.37, 0.50), (C4 C23 , 0.7, 0.45, 0.60),
(C4 C45 , 0.70, 0.35, 0.48), (C4 C46 , 0.70, 0.35, 0.48), (C5 C23 , 0.69, 0.39, 0.50), (C5 C34 , 0.69, 0.39, 0.50),
(C5 C46 , 0.70, 0.37, 0.50), (C6 C12 , 0.69, 0.39, 0.50), (C6 C15 , 0.69, 0.39, 0.50)},
XQ={(C1 C15 , 0.60, 0.43, 0.60), (C1 C23 , 0.60, 0.43, 0.60), (C1 C35 , 0.64, 0.43, 0.59), (C2 C34 , 0.60, 0.43, 0.60),
(C3 C14 , 0.60, 0.43, 0.60), (C3 C26 , 0.60, 0.43, 0.60), (C3 C45 , 0.64, 0.45, 0.59), (C4 C23 , 0.7, 0.45, 0.60),
(C4 C45 , 0.64, 0.45, 0.59), (C4 C46 , 0.64, 0.45, 0.59), (C5 C23 , 0.60, 0.45, 0.60), (C5 C34 , 0.60, 0.45, 0.60),
(C5 C46 , 0.64, 0.45, 0.59), (C6 C12 , 0.60, 0.43, 0.60), (C6 C15 , 0.60, 0.43, 0.60)}.

Thus, G = (G, G) is a soft neutrosophic rough influence graph as shown in Figure 9. He finds the
strength of each path from C1 to C6 . The paths are

P1 : C1 , C5 , C2 , C3 , C6 ,

P2 : C1 , C4 , C5 , C6 ,

P3 : C1 , C3 , C5 , C2 , C6

with their influence strength as (0.6,0.45,0.5), respectively.

) (0
.9 5 .6
,0 4,
0 .65 (0.71, 0.54, 0.65) 0.
45 C3 (0.75, 0.65, 0.95)
, ( b
(0.71, 0

. 7 5 0 .7 1 ,0
b

( 0 , 0 .5 5 .5
(0

9) (0
)

C4 , 0 .6 .6 ,
, 0 .6
.7

C6 (0.75, 0.65, 0.95)

4) 0 .4
1,

5)
C1 (0.75, 0.65, 0.95)

.54, 0.6

3,
0 .5

0 .4 3

. 6 , 0.6 ) 0 .6
0 .4 3
5,

, (0.6, 0 )
(0.64, (0.6, 0

4
(0.64, 0.45, 0.59)
0 .6

.5
59)
,
(0.6

,0
4)

71
, 0.

. 0.6)
(0 (0. ,
0.45, 0 .45

6, 0 (0.6, 0.43
.4 5
(0.7

) b
.4 3 .43, 0.6
4, 0

(0.6, 0
b
, 0.
(0

, 0.

(0.

(0.7 6)
6
.

.59) , 0.6 )
71

1, 0
(0.

6
45,

, 0.

.5 4
,0

, 0. .6 )
.5

0 .6

65) ,0
4,

(0.6 (0
.4 3
, 0.

.
0.

4 , 0 .4 6, 0
65

0.
.6 ,
6

3, 0 45
)

.5 9 ) ,0 (0
.6
5)

)
5)
0 .6

0 .6
4,

65)
0 .5

0 .5

, 0.
.5 4
1,

0
.7

71,
(0

(0.
(0

b b

C2 (0.75, 0.65, 0.95) C5 (0.75, 0.65, 0.95)

G = (S(N ), R(M ), X(Q))

C2 (0.9, 0.5, 0.65) b
(0.75, 0.45, 0.61) C3 (0.9, 0.55, 0.65) b

,0 .5 )
5)

.3 9
(0.75, 0.45, 0.61)

0
(0.7, 0.37, 0.

1) (0. 69,
.5 )
C1 (0.9, 0.5, 0.65)

.6
5 ,0 .3 7, 0
.4
C6 (0.9, 0.55, 0.65)

,0 7, 0
75 (0.
. (0.7
(0 5 , 0 .4
5, 0.
.6 )

(0.7 ) (0.69, 0 61)

(0.6

.5 .39, 0.5
5, 0

.5)

b , 0 .3 0 )
7, 0 9,
9
, 0 .4

.3
.37, 0

b
.5 )
, 0 .3

0 .5)
9, 0.39, 0 1) 61)
(0

(0.7
.6 (0.69,
(0.7

,
.6

0 .3 7 (0 0 .6 , 0 .
9, 0

0
(0.

,
9,

, 0 .5 4 5
(0.7,

.
) 5, 0 .4 5
0 .3
7

.5 )

(0.7 ,0
5, 0

9,
)

.7 5
61

0 .5

0
.4 5

(
0.

0 .5
)
5,
, 0.

48) (0.7
.4

37,

5, 0.
61)

5, 0
, 0 .3
75

, 0.

(0.7 .4 5
, 0.
.
(0

61)
(0.

(0.75, 0.45,
b
0.61) b

0.65) 0.65)
C4 (1.0, 0.55, C5 (0.95, 0.55,

(0.7, 0.35, 0.48)

G = (S(N ), R(M ), X(Q))

Figure 9: Soft
Figure roughrough
9. Soft neutrosophic influence
neutrosophic graph Ggraph
influence = (G,G
G)= (G, G).

with their influence strength as (0.6,0.45,0.5), respectively.

Since, there is more than one path, therefore, the trader calculates the score function which is formulated
in equation 4.1:

Score Function(Ci )= TS(N ) (Ci ) + TS(N ) (Ci ) + TR(M) (Cij ) + TR(M) (Cij ) + TX(Q) (Ci Cjk )+
Mathematics 2018, 6, 125 34 of 37

Since, there is more than one path, therefore, the trader calculates the score function which is
formulated in Equation (4):

Score Function(Ci )= TS( N ) (Ci ) + TS( N ) (Ci ) + TR( M) (Cij ) + TR( M) (Cij ) + TX (Q) (Ci Cjk )+

TX (Q) (Ci Cjk ), IS( N ) (Ci ) IS( N ) (Ci ) + IR( M) (Cij ) IR( M) (Cij )+ (4)
IX (Q) (Ci Cjk ) IX (Q) (Ci Cjk ), FS( N ) (Ci ) FS( N ) (Ci )+

FR( M) (Cij ) FR( M) (Cij ) + FX (Q) (Ci Cjk ) FX (Q) (Ci Cjk ) .

For each Ci , the score values of Ci is calculated directly and as shown in Table 19.

Table 19. Score Function.

V Score Values
C1 (9.97,1.054,2.702)
C2 (5.87,1.2979,1.7105)
C3 (8.48,1.3562,2.2994)
C4 (6.73,1.392,2.3119)
C5 (7.07,1.3673,1.9029)
C6 (4.23,0.6929,1.2175)

So, he chooses the path P3 :C1 ,C3 ,C5 ,C2 ,C6 . The Algorithm 1 of the application is also be given in
Algorithm 1. The flow chart is given in Figure 10.

Algorithm 1: Influence strength of each path in rough neutrosophic influence graph

1. Input the universal sets C and P.
2. Input the full soft set S and neutrosophic set N on V.
3. Calculate the Soft rough neutrosophic sets on V.
4. Input the universal sets E and L.
5. Input the full soft set R and neutrosophic set M on E.
6. Calculate the Soft rough neutrosophic sets on E.
7. Input the universal sets I and F.
8. Input the full soft set X and neutrosophic set Q on I.
9. Calculate the Soft rough neutrosophic sets on I.
10. Find the number of path and calculate their influence strength of
each path from C1 to Cn .
11. Choose that path which has maximum membership, minimum
indeterminacy and falsity value. If i > 1, than calculate the
score values of each Ci , choose that Ci which has maximum
membership and come immediately after C1 in one of the paths.

5. Conclusions
Graph theory has been applied widely in various areas of engineering, computer science, database
theory, expert systems, neural networks, artificial intelligence, signal processing, pattern recognition,
robotics, computer networks, and medical diagnosis. Present research has shown that two or more
theories can be combined into a more flexible and expressive framework for modeling and processing
incomplete information in information systems. Various mathematical models that combine rough sets,
soft sets and neutrosophic sets have been introduced. A soft rough neutrosophic set is a hybrid tool for
handling indeterminate, inconsistent and uncertain information that exist in real life. We have applied
this concept to graph theory. We have presented certain concepts, including soft rough neutrosophic
graphs, soft rough neutrosophic influence graphs, soft rough neutrosophic influence cycles, soft rough
Mathematics 2018, 6, 125 35 of 37

neutrosophic influence trees. We also have considered an application of soft rough neutrosophic
influence graph in decision-making to illustrate the best path in the business. In the future, we
will study, (1) Neutrosophic rough hypergraphs, (2) Bipolar neutrosophic rough hypergraphs, (3)
Neutrosophic soft rough hypergraphs, (4) Decision support systems based on soft rough neutrosophic
information.

Start

Input C,P ,S,N

V W
TS(N ) (b) = TN (t),
b∈Ss (a) t∈Ss (a)
W V
TS(N ) (b) = TN (t),
b∈Ss (a) t∈Ss (a)
W V
IS(N ) (b) = IN (t),
b∈Ss (a) t∈Ss (a)
V W
IS(N ) (b) = IN (t),
b∈Ss (a) t∈Ss (a)
W V
FS(N ) (b) = FN (t),
b∈Ss (a) t∈Ss (a)
V W
FS(N ) (b) = FN (t).
b∈Ss (a) t∈Ss (a)

No If S(N ) 6= S(N ) Yes Input E,L,R,M

V W
TR(M) (bij ) = TM (tij ),
bij ∈Rs (alm ) tij ∈Rs (alm )
W V
TR(M) (bij ) = TM (tij ),
bij ∈RsW
(alm ) tij ∈RsV
(alm )
IR(M) (bij ) = IM (tij ),
bij ∈Rs (alm ) tij ∈Rs (alm )
V W
IR(M) (bij ) = IM (tij ),
bij ∈Rs (alm ) tij ∈Rs (alm )
W V
FR(M) (bij ) = FM (tij ),
bij ∈Rs (alm ) tij ∈Rs (alm )
V W
FR(M) (bij ) = FM (tij ).
bij ∈Rs (alm ) tij ∈Rs (alm )

Input I,F ,X,Q Yes If R(M ) 6= R(M ) No

V W
TX(Q) (bi bjk ) = TQ (ti tjk ),
bi bjk ∈Xs (al amn ) ti tjk ∈Xs (al amn )
W V
TX(Q) (bi bjk ) = TQ (ti tjk ),
bi bjk ∈Xs (a
Wl amn ) ti tjk ∈Xs (aVl amn )
IX(Q) (bi bjk ) = IQ (ti tjk ),
bi bjk ∈Xs (al amn ) ti tjk ∈Xs (al amn ) No
V W If X(Q) 6= X(Q)
IX(Q) (bi bjk ) = IQ (ti tjk ),
bi bjk ∈Xs (al amn ) ti tjk ∈Xs (al amn )
W V
FX(Q) (bi bjk ) = FQ (ti tjk ),
bi bjk ∈Xs (al amn ) ti tjk ∈Xs (al amn ) Yes
V W Calculate the influence strength In stren
FX(Q) (bi bjk ) = FQ (ti tjk ).
bi bjk ∈Xs (al amn ) ti tjk ∈Xs (al amn ) of each path from C1 to Cn

Yes Take that path which has

Calculate the score value of each Ci if there is more
than one path maximium influence strength
Choose that Ci ’s which has maximium membership value
after C1 and is in the paths No

Yes
if there is more Choose any path
than one Ci
No
Stop

Figure 10: The flow chart of the application

Figure 10. The flow chart of the application.

33
Mathematics 2018, 6, 125 36 of 37

Author Contributions: H.M.M., M.A. and F.S. conceived and designed the experiments; M.A. and F.S. analyzed
the data; H.M.M. wrote the paper.
Conflicts of Interest: The authors declare no conflict of interest.

References
1. Smarandache, F. Neutrosophy Neutrosophic Probability, Set, and Logic; Amer Res Press: Rehoboth, MA,
USA, 1998.
2. Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single-valued neutrosophic sets. Multispace
Multistruct. 2010, 4, 410–413.
3. Ye, J. Multicriteria decision-making method using the correlation coefficient under single-valued
neutrosophic environment. Int. J. Gen. Syst. 2013, 42, 386–394.
4. Ye, J. Improved correlation coefficients of single valued NSs and interval NSs for multiple attribute decision
making. J. Intell. Fuzzy Syst. 2014, 27, 2453–2462.
5. Qeng, J.J.; Wang, J.Q.; Zhang, H.Y.; Chen, X.H. An outranking approach for multi-criteria decision-making
problems with simplified neutrosophic sets. Appl. Soft Comput. 2014, 25, 336–346.
6. Molodtsov, D.A. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31.
7. Babitha, K.V.; Sunil, J.J. Soft set relations and functions. Comput. Math. Appl. 2010, 60, 1840–1849.
8. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356.
9. Pawlak, Z. Rough Sets-Theoretical Aspects to Reasoning about Data; Kluwer Academic Publisher: Boston, MA,
USA, 1991.
10. Pawlak, Z.; Skowron, A. Rudiments of rough sets. Inf. Sci. 2007, 177, 3–27.
11. Pawlak, Z.; Skowron, A. Rough sets: Some extensions. Inf. Sci. 2007, 177, 28–40.
12. Pawlak, Z.; Skowron, A. Rough sets and Boolean reasoning. Inf. Sci. 2007, 177, 41–73.
13. Biswas, R.; Nanda, S. Rough groups and rough subgroups. Bull. Polish Acad. Sci. 2000, 42, 247–251.
14. Davvaz, B. Roughness in rings. Inf. Sci. 2004, 164, 147–163.
15. Kuroki, N. Rough ideal in semigroup. Inf. Sci. 1997, 100, 139–163.
16. Shahzamanian, M.H.; Shirmohammadi, M.; Davvaz, B. Roughness in Cayley graphs. Inf. Sci. 2010, 180,
3362–3372.
17. Dubios, D.; Prade, H. Rough fuzzy, fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–209.
18. Feng, F.; Li, C.; Davvaz, B.; Ali, M.I. Soft sets combined with fuzzy sets and rough sets: A tentative approach.
Soft Comput. 2010, 14, 899–911.
19. Meng, D.; Zhang, X.; Qin, K. Soft rough fuzzy sets and soft fuzzy rough sets. Comput. Math. Appl. 2011, 62,
4635–4645.
20. Broumi, S.; Smarandache, F.; Dhar, M. Rough neutrosophic sets. Neutrosophic Sets Syst. 2014, 3, 62–67.
21. Yang, H.L.; Zhang, C.L.; Guo, Z.L.; Liu, Y.L.; Liao, X. A hybrid model of single valued neutrosophic
sets and rough sets: Single valued neutrosophic rough set model. Soft Comput. 2016, 21, 6253–6267,
doi:10.1007/s00500-016-2356-y.
22. Kauffmann, A. Introduction a la Theorie Des Sous-Emsembles Flous; Masson et Cie: Paris, France, 1973; Volume 1.
23. Rosenfeld, A. Fuzzy graphs. In Fuzzy Sets and Their Applications; Zadeh, L.A., Fu, K.S., Shimura, M., Eds.;
Elsevier: New York, NY, USA, 1975; pp. 77–95.
24. Mordeson, J.N.; Peng, C.S. Operations on fuzzy graphs. Inf. Sci. 1994, 79, 159–170.
25. Mathew, S.; Sunitha, M. Types of arcs in a fuzzy graph. Inf. Sci. 2009, 179, 1760–1768.
26. Mathew, S.; Sunitha, M. Strongest strong cycles, fuzzy graphs. IEEE Trans. Fuzzy Syst. 2013, 21, 1096–1104.
27. Gani, A.N.; Latha, S.R. On irregular fuzzy graphs. Appl. Math. Sci. 2012, 6, 517–523.
28. Gani, A.N.; Radha, K. On regular fuzzy graphs. J. Phys. Sci. 2008, 12, 33–40.
29. Gani, A.N.; Radha, K. The degree of a vertex in some fuzzy graphs. Int. J. Algorithms Comput. Math. 2009, 2,
107–116.
30. Gani, A.N.; Begum, S.S. Degree, order, size in intuitionistic fuzzy graphs. Int. J. Algorithms Comput. Math.
2010, 3, 11–16.
31. Parvathi, R.; Karunambigai, M.G.; Atanassov, K.T. Operations on intuitionistic fuzzy graphs.
In Proceedings of the FUZZ-IEEE 2009 IEEE International Conference on Fuzzy Systems, Jeju Island, Korea,
20–24 August 2009.
Mathematics 2018, 6, 125 37 of 37

32. Akram, M.; Ashraf, A.; Sarwar, M. Novel applications of intuitionistic fuzzy digraphs in decision support
systems. Sci. World J. 2014, doi:10.1155/2014/904606.
33. Akram, M.; Nawaz, S. Fuzzy soft graphs with applications. J. Intell. Fuzzy Syst. 2016, 30, 3619–3632.
34. Akram, M.; Shahzadi, S. Novel intuitionistic fuzzy soft multiple-attribute decision-making methods.
Neural Comput. Appl. 2016, doi:10.1007/s00521-016-2543-x.
35. Akram, M.; Alshehri, N.; Davvaz, B.; Ashraf, A. Bipolar fuzzy digraphs in decision support systems.
J. Multiple-Valued Logic Soft Comput. 2016, 27, 531–551.
36. Akram, M.; Dudek, W.A. Regular bipolar fuzzy graphs. Neural Comput. Appl. 2012, 21, 197–205.
37. Dinesh, T. Fuzzy incidence graph and introduction. Adv. Fuzzy Sets Syst. 2016, 21, 33–48.
38. Mordeson, J.N. Fuzzy incidence graphs. Adv. Fuzzy Sets Syst. 2016, 21, 1–13.
39. Mathew, S.; Mordeson, J.N. Fuzzy influence graphs. New Math. Nat. Comput. 2017, 13, 311–325
40. Zafar, F.; Akram, M. A novel decision-making method based on rough fuzzy information. Int. J. Fuzzy Syst.
2018, 20, 1000–1014.
41. Akram, M.; Zafar, F. Rough fuzzy digraphs with application. J. Appl. Math. Comput. 2018,
doi:10.1007s12190-018-1171-2.
42. Akram, M.; Shumaiza; Arshad, M. A new approach based on fuzzy rough digraphs for decision-making.
J. Intell. Fuzzy Syst. 2018, doi:10.3233/JIFS-172069.
43. Malik, H.M.; Akram, M. A new approach based on intuitionistic fuzzy rough graphs for decision-making.
J. Intell. Fuzzy Syst. 2018, 34, 2325–2342.
44. Zhan, J.; Malik, H.M.; Akram, M. Novel decision-making algorithms based on intuitionistic fuzzy rough
environment. Int. J. Mach. Learn. Cybern. 2018, doi:10.1007/s13042-018-0827-4.
45. Ishfaq, N.; Sayed, S.; Akram, M.; Smarandache, F. Notions of rough neutrosophic digraphs. Mathematics
2018, 6, doi:10.3390/math6020018.
46. Akram, M.; Malik, H.M.; Shahzadi, S.; Smarandache, F. Neutrosophic soft rough graphs with application.
Axioms 2018, 7, 14, doi:10.3390/axioms7010014.
47. Zhang, X.; Dai, J.; Yu, Y. On the union and intersection operations of rough sets based on various
approximation spaces. Inf. Sci. 2015, 292, 214–229.
48. Bao, Y.L.; Yang, H.L. On single valued neutrosophic refined rough set model and its application. J. Intell.
Fuzzy Syst. 2017, 33, 1235–1248, doi:10.3233/JIFS-17094.
49. Maji, Q.K. Neutrosophic soft set. Ann. Fuzzy Math. Inform. 2013, 5, 157–168.
50. Broumi, S.; Smarandache, F. Interval-valued neutrosophic soft rough sets. Int. J. Comput. Math. 2015,
doi:10.1155/2015/232919.
51. Akram, M.; Shahzadi, S.; Smarandache, F. Multi-attribute decision-making method based on neutrosophic
soft rough information. Axioms 2018, 7, 19.

c 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license (http://creativecommons.org/licenses/by/4.0/).

CS2351 - Artificial Intelligence-2 Marks
100% (1)
CS2351 - Artificial Intelligence-2 Marks
16 pages
Problem For Chapter 3
No ratings yet
Problem For Chapter 3
3 pages
A Novel Approach To Neutrosophic Hypersoft Graphs With Properties
No ratings yet
A Novel Approach To Neutrosophic Hypersoft Graphs With Properties
20 pages
Intuitionistic Neutrosphic Soft Set Over Rings
No ratings yet
Intuitionistic Neutrosphic Soft Set Over Rings
7 pages
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
No ratings yet
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
20 pages
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Second volume
No ratings yet
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Second volume
520 pages
Pessimistic Multigranulation Roughness of A Fuzzy
No ratings yet
Pessimistic Multigranulation Roughness of A Fuzzy
21 pages
Where can buy Soft Sets: Theory and Applications Sunil Jacob John ebook with cheap price
100% (3)
Where can buy Soft Sets: Theory and Applications Sunil Jacob John ebook with cheap price
52 pages
Determinant Theory For Fuzzy Neutrosophic Soft Matrices
No ratings yet
Determinant Theory For Fuzzy Neutrosophic Soft Matrices
18 pages
Mappings On Neutrosophic Soft Classes
No ratings yet
Mappings On Neutrosophic Soft Classes
6 pages
0003 - Nikfar Domination in Neutrosophic Graphs
No ratings yet
0003 - Nikfar Domination in Neutrosophic Graphs
9 pages
Computation Neutro So Phic 36
No ratings yet
Computation Neutro So Phic 36
23 pages
On Neutrosophic Normal Soft Groups
No ratings yet
On Neutrosophic Normal Soft Groups
20 pages
On Neutrosophic Normal Soft Groups
No ratings yet
On Neutrosophic Normal Soft Groups
20 pages
Neutrosophic Soft Filters
No ratings yet
Neutrosophic Soft Filters
12 pages
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Third volume
No ratings yet
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Third volume
196 pages
71720035847 (1)
No ratings yet
71720035847 (1)
12 pages
η U η:T → (0,1) t ∈ T η (t) t η η (t) t η η η η η= (η η η η=
No ratings yet
η U η:T → (0,1) t ∈ T η (t) t η η (t) t η η η η η= (η η η η=
3 pages
Study On Single-Valued Neutrosophic Graph With Application in Shortest Path Problem
No ratings yet
Study On Single-Valued Neutrosophic Graph With Application in Shortest Path Problem
6 pages
Npn-Soft Sets Theory and Their Applications
No ratings yet
Npn-Soft Sets Theory and Their Applications
16 pages
Neutrosophic Hypersoft Expert Set: Theory and Applications
No ratings yet
Neutrosophic Hypersoft Expert Set: Theory and Applications
28 pages
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Fourth volume: HyperUncertain Set (Collected Papers)
No ratings yet
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Fourth volume: HyperUncertain Set (Collected Papers)
316 pages
Ijrdet 0521 01
No ratings yet
Ijrdet 0521 01
9 pages
Soft B-Separation Axioms in Neutrosophic Soft Topological Structures
No ratings yet
Soft B-Separation Axioms in Neutrosophic Soft Topological Structures
13 pages
Math 09 05 548
No ratings yet
Math 09 05 548
14 pages
A New Fuzzy Parameterized Intuitionistic Fuzzy Soft Multiset Theory and Group Decision-Making
No ratings yet
A New Fuzzy Parameterized Intuitionistic Fuzzy Soft Multiset Theory and Group Decision-Making
21 pages
Rough Sets: An Approach To Vagueness: Rough Sets As A Tool For Reasoning About Vague Concepts
No ratings yet
Rough Sets: An Approach To Vagueness: Rough Sets As A Tool For Reasoning About Vague Concepts
7 pages
journal_44-2_21
No ratings yet
journal_44-2_21
10 pages
Journal Rough Set
No ratings yet
Journal Rough Set
42 pages
Bipolar Neutrosophic Minimum Spanning Tree
No ratings yet
Bipolar Neutrosophic Minimum Spanning Tree
6 pages
Soft Set Theory
No ratings yet
Soft Set Theory
16 pages
Neutrosophic Hypergraphs
No ratings yet
Neutrosophic Hypergraphs
16 pages
Neutrosophic SuperHyperSoft Sets
No ratings yet
Neutrosophic SuperHyperSoft Sets
13 pages
Two Types of Single Valued Neutrosophic Covering Rough Sets and An Application To Decision Making
No ratings yet
Two Types of Single Valued Neutrosophic Covering Rough Sets and An Application To Decision Making
20 pages
IJFS Volume 14 Issue 2 Page 127-154
No ratings yet
IJFS Volume 14 Issue 2 Page 127-154
28 pages
On Neutrosophic Soft Topological Space
No ratings yet
On Neutrosophic Soft Topological Space
13 pages
Some Operations On Neutrosophic Fuzzy Graphs
No ratings yet
Some Operations On Neutrosophic Fuzzy Graphs
6 pages
Soft Lattice in Approximation Space
No ratings yet
Soft Lattice in Approximation Space
3 pages
Single-Valued Neutrosophic Ideal Approximation Spaces
No ratings yet
Single-Valued Neutrosophic Ideal Approximation Spaces
17 pages
Interval Valued, M-Polar and M-Polar Interval Valued Neutrosophic Hypersoft Sets
No ratings yet
Interval Valued, M-Polar and M-Polar Interval Valued Neutrosophic Hypersoft Sets
11 pages
Development of Set Theory
No ratings yet
Development of Set Theory
6 pages
1 s2.0 S0898122110001914 Main
No ratings yet
1 s2.0 S0898122110001914 Main
7 pages
Concentric Plithogenic Hypergraph Based On Plithogenic Hypersoft Sets - A Novel Outlook
No ratings yet
Concentric Plithogenic Hypergraph Based On Plithogenic Hypersoft Sets - A Novel Outlook
14 pages
Exploring Concepts of HyperFuzzy, HyperNeutrosophic, and HyperPlithogenic Sets (II)
No ratings yet
Exploring Concepts of HyperFuzzy, HyperNeutrosophic, and HyperPlithogenic Sets (II)
61 pages
A Short Note On Some Properties of Rough Groups
No ratings yet
A Short Note On Some Properties of Rough Groups
6 pages
Paper+1.+JIRMCS+Amir+Mehwish+DP+PyFRSS+15!08!2023 Final+v1
No ratings yet
Paper+1.+JIRMCS+Amir+Mehwish+DP+PyFRSS+15!08!2023 Final+v1
17 pages
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Fifth volume: Various SuperHyperConcepts (Collected Papers)
No ratings yet
Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Fifth volume: Various SuperHyperConcepts (Collected Papers)
655 pages
RoughSetsRep29 PDF
No ratings yet
RoughSetsRep29 PDF
51 pages
RoughSetsRep29-1-5
No ratings yet
RoughSetsRep29-1-5
5 pages
Transforming Neutrosophic Fuzzy Set Into Fuzzy Set by Imprecision Method
No ratings yet
Transforming Neutrosophic Fuzzy Set Into Fuzzy Set by Imprecision Method
8 pages
Determinant and Adjoint of Fuzzy Neutrosophic Soft Matrices
No ratings yet
Determinant and Adjoint of Fuzzy Neutrosophic Soft Matrices
17 pages
Accessible Single-Valued Neutrosophic Graphs
No ratings yet
Accessible Single-Valued Neutrosophic Graphs
26 pages
Research Article: Double-Framed Soft Sets With Applications in BCK/BCI-Algebras
No ratings yet
Research Article: Double-Framed Soft Sets With Applications in BCK/BCI-Algebras
16 pages
Accessible Single-Valued Neutrosophic Graphs
No ratings yet
Accessible Single-Valued Neutrosophic Graphs
26 pages
Special Types of Bipolar Single Valued Neutrosophic Graphs
No ratings yet
Special Types of Bipolar Single Valued Neutrosophic Graphs
19 pages
On Neutrosophic Soft Prime Ideal
No ratings yet
On Neutrosophic Soft Prime Ideal
22 pages
C, M. "R S: L F ": The Future of Rough Sets
No ratings yet
C, M. "R S: L F ": The Future of Rough Sets
37 pages
Gra Based Multi Criteria Decision Making in Generalized Neutrosophic Soft Set Environment
No ratings yet
Gra Based Multi Criteria Decision Making in Generalized Neutrosophic Soft Set Environment
16 pages
Neutrosophic Hypersoft Matrices With Application To Solve Multiattributive Decision-Making Problems
No ratings yet
Neutrosophic Hypersoft Matrices With Application To Solve Multiattributive Decision-Making Problems
17 pages
Topology Essentials
From Everand
Topology Essentials
Emil G. Milewski
5/5 (1)
A First Course in Functional Analysis
From Everand
A First Course in Functional Analysis
Martin Davis
No ratings yet
Matrix Representations of Groups
From Everand
Matrix Representations of Groups
Morris Newman
No ratings yet
Nidus Idearum. Scilogs, XIII: Structure / NeutroStructure / AntiStructure
No ratings yet
Nidus Idearum. Scilogs, XIII: Structure / NeutroStructure / AntiStructure
98 pages
Nidus Idearum. Scilogs, XIV: SuperHyperAlgebra
No ratings yet
Nidus Idearum. Scilogs, XIV: SuperHyperAlgebra
101 pages
Neutrosophy Transcends Binary Oppositions in Mythology and Folklore
No ratings yet
Neutrosophy Transcends Binary Oppositions in Mythology and Folklore
23 pages
Theory of Distances in NeutroGeometry
No ratings yet
Theory of Distances in NeutroGeometry
11 pages
Empowering Artificial Intelligence Techniques With Soft Computing of Neutrosophic Theory in Mystery Circumstances For Plant Diseases
No ratings yet
Empowering Artificial Intelligence Techniques With Soft Computing of Neutrosophic Theory in Mystery Circumstances For Plant Diseases
13 pages
An Evidence-Based Approach To Set Theory Paradoxism: From Set Boundary To Mixed-Fermion-Boson Condensate Hypothesis
No ratings yet
An Evidence-Based Approach To Set Theory Paradoxism: From Set Boundary To Mixed-Fermion-Boson Condensate Hypothesis
5 pages
Graphical Method For Solving Neutrosophical Nonlinear Programming Models
No ratings yet
Graphical Method For Solving Neutrosophical Nonlinear Programming Models
7 pages
Upside-Down Logics: Falsification of The Truth and Truthification of The False
No ratings yet
Upside-Down Logics: Falsification of The Truth and Truthification of The False
7 pages
Assuming Photon As Extended Point Particle in The HyperSoft Topological Space and Other Hypotheses: Issues and Trend Analysis
No ratings yet
Assuming Photon As Extended Point Particle in The HyperSoft Topological Space and Other Hypotheses: Issues and Trend Analysis
10 pages
Neutrosophic Discrete Geometric Distribution
No ratings yet
Neutrosophic Discrete Geometric Distribution
23 pages
Numerical Solution of Hybrid Nanofluid and Its Stability Over Permeable Wedge Sheet With Heat Transfer Analysis
No ratings yet
Numerical Solution of Hybrid Nanofluid and Its Stability Over Permeable Wedge Sheet With Heat Transfer Analysis
13 pages
Another Way To Divide Two Complex Numbers: Identification Method
No ratings yet
Another Way To Divide Two Complex Numbers: Identification Method
2 pages
Neutrosophic Insights Into Military Interventions: Assessing Legitimacy and Consequences in International Law
No ratings yet
Neutrosophic Insights Into Military Interventions: Assessing Legitimacy and Consequences in International Law
12 pages
Row-Column Designs: A Novel Approach For Analyzing Imprecise and Uncertain Observations
No ratings yet
Row-Column Designs: A Novel Approach For Analyzing Imprecise and Uncertain Observations
15 pages
A Single-Valued Pentagonal Neutrosophic Geometric Programming Approach To Optimize Decision Maker's Satisfaction Level
No ratings yet
A Single-Valued Pentagonal Neutrosophic Geometric Programming Approach To Optimize Decision Maker's Satisfaction Level
11 pages
Similarity Measure of Plithogenic Cubic Vague Sets: Examples and Possibilities
No ratings yet
Similarity Measure of Plithogenic Cubic Vague Sets: Examples and Possibilities
9 pages
Research Article
No ratings yet
Research Article
10 pages
Simulating Chi-Square Data Through Algorithms in The Presence of Uncertainty
No ratings yet
Simulating Chi-Square Data Through Algorithms in The Presence of Uncertainty
14 pages
Brain Tumor Classification Using Convolutional Neural Network With Neutrosophy, Super-Resolution and SVM
No ratings yet
Brain Tumor Classification Using Convolutional Neural Network With Neutrosophy, Super-Resolution and SVM
24 pages
Measuring The Similarity of Charts in Graphical Statistics
No ratings yet
Measuring The Similarity of Charts in Graphical Statistics
16 pages
Exploring The Algebraic Structures of Q-Complex Neutrosophic Soft Fields
No ratings yet
Exploring The Algebraic Structures of Q-Complex Neutrosophic Soft Fields
14 pages
On Geometry of Equiform Smarandache Ruled Surfaces Via Equiform Frame in Minkowski 3-Space
No ratings yet
On Geometry of Equiform Smarandache Ruled Surfaces Via Equiform Frame in Minkowski 3-Space
14 pages
Investigation of Special Type-Π Smarandache Ruled Surfaces Due to Rotation Minimizing Darboux Frame
No ratings yet
Investigation of Special Type-Π Smarandache Ruled Surfaces Due to Rotation Minimizing Darboux Frame
19 pages
Local Search Algorithms & Optimization Problems: Artificial Intelligence COSC-3112 Ms. Humaira Anwer
No ratings yet
Local Search Algorithms & Optimization Problems: Artificial Intelligence COSC-3112 Ms. Humaira Anwer
27 pages
Formal Languages and Automata: Lab 4. Exercises
No ratings yet
Formal Languages and Automata: Lab 4. Exercises
2 pages
Constraint Satisfaction Problem: Teknik Elektro Fakultas Informatika Dan Teknik Elektro Institut Teknologi Del
No ratings yet
Constraint Satisfaction Problem: Teknik Elektro Fakultas Informatika Dan Teknik Elektro Institut Teknologi Del
55 pages
BLAST Analysis and Algorythim
No ratings yet
BLAST Analysis and Algorythim
11 pages
Chapter Five
No ratings yet
Chapter Five
39 pages
Propositional Logic
100% (1)
Propositional Logic
74 pages
Pivoting
No ratings yet
Pivoting
6 pages
Dhghomon: Easy - Rust
No ratings yet
Dhghomon: Easy - Rust
174 pages
Chuong 0 AI Course Outline
No ratings yet
Chuong 0 AI Course Outline
15 pages
DATA STRUCTURES LAB_3
No ratings yet
DATA STRUCTURES LAB_3
3 pages
Data Mining: Ensemble Techniques Introduction To Data Mining, 2 Edition by Tan, Steinbach, Karpatne, Kumar
No ratings yet
Data Mining: Ensemble Techniques Introduction To Data Mining, 2 Edition by Tan, Steinbach, Karpatne, Kumar
11 pages
DSA Sheet by Shradha Didi & Aman Bhaiya - Google Drive
No ratings yet
DSA Sheet by Shradha Didi & Aman Bhaiya - Google Drive
2 pages
Toc Pyq
No ratings yet
Toc Pyq
11 pages
West Bengal University of Technolog MCSE-402B: N m-4th M 402B 2015
No ratings yet
West Bengal University of Technolog MCSE-402B: N m-4th M 402B 2015
3 pages
Capital University of Science and Technology Department of Computer Science CS 3163: Design and Analysis of Algorithms (3) : Fall 2020
No ratings yet
Capital University of Science and Technology Department of Computer Science CS 3163: Design and Analysis of Algorithms (3) : Fall 2020
4 pages
Immediate download (Ebook) Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills by Christoph Dürr, Jill-Jênn Vie ISBN 9781108591928, 9781108716826, 1108591922, 1108716822 ebooks 2024
100% (9)
Immediate download (Ebook) Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills by Christoph Dürr, Jill-Jênn Vie ISBN 9781108591928, 9781108716826, 1108591922, 1108716822 ebooks 2024
54 pages
Searching Algorithms
No ratings yet
Searching Algorithms
6 pages
AI Python Lab Report CSIT 4th Semester Part II
No ratings yet
AI Python Lab Report CSIT 4th Semester Part II
28 pages
DESY Qiskit Intro Kuehn
100% (1)
DESY Qiskit Intro Kuehn
59 pages
Math 2400 First Midterm Exam: Pete L. Clark
No ratings yet
Math 2400 First Midterm Exam: Pete L. Clark
2 pages
Unit 1
No ratings yet
Unit 1
4 pages
Matrix-Matrix Operations: 5.1 Opening Remarks
No ratings yet
Matrix-Matrix Operations: 5.1 Opening Remarks
44 pages
Daa R20 Unit 2
No ratings yet
Daa R20 Unit 2
19 pages
C++ new FINAL II B COM CA
No ratings yet
C++ new FINAL II B COM CA
65 pages
Complexity of Chemical Graphs in Terms of Size, Branching, and Cyclicity
No ratings yet
Complexity of Chemical Graphs in Terms of Size, Branching, and Cyclicity
38 pages
Quantum Computing Lecture Notes
No ratings yet
Quantum Computing Lecture Notes
25 pages
Q2 Performance Task 1
No ratings yet
Q2 Performance Task 1
3 pages
Efficient Algorithm Comparison To Solve Sudoku Puzzle
No ratings yet
Efficient Algorithm Comparison To Solve Sudoku Puzzle
5 pages