Next Article in Journal
Eccentricity Based Topological Indices of an Oxide Network
Previous Article in Journal
Decomposition of Dynamical Signals into Jumps, Oscillatory Patterns, and Possible Outliers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Soft Rough Neutrosophic Influence Graphs with Application

1
Department of Mathematics, University of the Punjab, New Campus, Lahore 54590, Pakistan
2
University of New Mexico Mathematics & Science Department 705 Gurley Ave., Gallup, NM 87301, USA
*
Author to whom correspondence should be addressed.
Mathematics 2018, 6(7), 125; https://doi.org/10.3390/math6070125
Submission received: 28 June 2018 / Revised: 13 July 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.

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 ] 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,10,11,12]. In literature, rough theory has been applied in different field of mathematics [13,14,15,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 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,28,29,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,33,34,35,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,48,49,50,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 S s (a)⊂B, for some a∈A, where S s :A→ P ( B ) is a set-valued function defined as S s (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, T N ( b ) , I N ( b ) , F N ( 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 , T S ¯ ( N ) ( b ) , I S ¯ ( N ) ( b ) , F S ¯ ( N ) ( b ) ) | b B } , S ̲ ( N ) = { ( b , T S ̲ ( N ) ( b ) , I S ̲ ( N ) ( b ) , F S ̲ ( N ) ( b ) ) | b B } ,
where
T S ¯ ( N ) ( b ) = b S s ( a ) t S s ( a ) T N ( t ) , T S ̲ ( N ) ( b ) = b S s ( a ) t S s ( a ) T N ( t ) , I S ¯ ( N ) ( b ) = b S s ( a ) t S s ( a ) I N ( t ) , I S ̲ ( N ) ( b ) = b S s ( a ) t S s ( a ) I N ( t ) , F S ¯ ( N ) ( b ) = b S s ( a ) t S s ( a ) F N ( t ) , F S ̲ ( N ) ( b ) = b S s ( a ) t S s ( a ) F N ( t ) .
In other words,
T S ¯ ( N ) ( b ) = a A ( 1 S ( a , b ) ) t B S ( a , t ) T N ( t ) , T S ̲ ( N ) ( b ) = a A S ( a , b ) t B ( 1 S ( a , t ) ) T N ( t ) , I S ¯ ( N ) ( b ) = a A S ( a , b ) t B ( 1 S ( a , t ) ) I N ( t ) , I S ̲ ( N ) ( b ) = a A ( 1 S ( a , b ) ) t B S ( a , t ) I N ( t ) , F S ¯ ( N ) ( b ) = a A S ( a , b ) t B ( 1 S ( a , t ) ) F N ( t ) , F S ̲ ( N ) ( b ) = a A ( 1 S ( a , b ) ) t B S ( a , t ) F N ( t ) .
The pair ( S ̲ ( N ) , S ¯ ( N ) ) is called soft rough neutrosophic set (SRNS) of N w.r.t (B,S).
Example 1.
Suppose N = {( b 1 , 0.8 , 0.3 , 0.16 ) ,( b 2 , 0.85 , 0.24 , 0.2 ),( b 3 , 0.79 , 0.2 , 0.2 ),( b 4 , 0.85 , 0.36 , 0.25 ),( b 5 , 0.82 , 0.25 , 0.25 )} is a neutrosophic set on the universal set B={ b 1 , b 2 , b 3 , b 4 , b 5 } under consideration. Let A={ a 1 , a 2 , a 3 } be a set of parameter on B. A full soft set over B, denoted by S, is defined in Table 1.
A set-valued function S s :A→ P ( B ) is defined as S s ( a 1 )={ b 3 , b 5 }, S s ( a 2 )={ b 1 , b 3 }, S s ( a 3 )={ b 2 , b 3 , b 4 , b 5 }. From Equation (1) of Definition 1, we have
T S ¯ ( A ) ( b 1 ) = y S s ( a 2 ) N ( y ) = { 0.8 , 0.79 } = 0.80 , I S ¯ ( N ) ( b 1 ) = y S s ( a 2 ) N ( y ) = { 0.3 , 0.2 } = 0.20 , F S ¯ ( N ) ( b 1 ) = y S s ( a 2 ) N ( y ) = { 0.16 , 0.2 } = 0.16 ; T S ̲ ( N ) ( b 1 ) = y S s ( a 2 ) N ( y ) = { 0.8 , 0.79 } = 0.79 , I S ̲ ( N ) ( b 1 ) = y S s ( a 2 ) N ( y ) = { 0.3 , 0.2 } = 0.30 , F S ̲ ( N ) ( b 1 ) = y S s ( a 2 ) N ( y ) = { 0.16 , 0.2 } = 0.20 .
Similarly,
T S ¯ ( N ) ( b 2 ) = 0.85 , I S ¯ ( N ) ( b 2 ) = 0.20 , F S ¯ ( N ) ( b 2 ) = 0.20 ,
T S ¯ ( N ) ( b 3 ) = 0.80 , I S ¯ ( N ) ( b 3 ) = 0.20 , F S ¯ ( N ) ( b 3 ) = 0.20 ,
T S ¯ ( N ) ( b 4 ) = 0.85 , I S ¯ ( N ) ( b 4 ) = 0.20 , F S ¯ ( N ) ( b 4 ) = 0.20 ,
T S ¯ ( N ) ( b 5 ) = 0.82 , I S ¯ ( N ) ( b 5 ) = 0.20 , F S ¯ ( N ) ( b 5 ) = 0.20 ;
T S ̲ ( N ) ( b 2 ) = 0.79 , I S ̲ ( N ) ( b 2 ) = 0.36 , F S ̲ ( N ) ( b 2 ) = 0.25 ,
T S ̲ ( N ) ( b 3 ) = 0.79 , I S ̲ ( N ) ( b 3 ) = 0.25 , F S ̲ ( N ) ( b 3 ) = 0.20 ,
T S ̲ ( N ) ( b 4 ) = 0.79 , I S ̲ ( N ) ( b 4 ) = 0.36 , F S ̲ ( N ) ( b 4 ) = 0.25 ,
T S ̲ ( N ) ( b 5 ) = 0.79 , I S ̲ ( N ) ( b 5 ) = 0.25 , F S ̲ ( N ) ( b 5 ) = 0.25 .
Thus, we obtain
S ¯ ( N ) = { ( b 1 , 0.80 , 0.20 , 0.16 ) , ( b 2 , 0.85 , 0.20 , 0.20 ) , ( b 3 , 0.80 , 0.20 , 0.20 ) , ( b 4 , 0.85 , 0.20 , 0.20 ) , ( b 5 , 0.82 , 0.20 , 0.20 ) } , S ̲ ( N ) = { ( b 1 , 0.79 , 0.30 , 0.20 ) , ( b 2 , 0.79 , 0.36 , 0.25 ) , ( b 3 , 0.79 , 0.25 , 0.20 ) , ( b 4 , 0.79 , 0.36 , 0.25 ) , ( b 5 , 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 ( a k l , b i j ) min { S ( a k , b i ) , S ( a l , b j ) } ,
for all ( a k l , b i j )∈R, such that R s ( a k l )⊂ B ˜ for some a k l A ˜ , where R s : A ˜ P ( B ˜ ) is a set-valued function, for all a k l A ˜ , defined by
R s ( a k l ) = { b i j B ˜ | ( a k l , b i j ) R } , b i j 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 ) = { ( b i j , T R ¯ ( M ) ( b i j ) , I R ¯ ( M ) ( b i j ) , F R ¯ ( M ) ( b i j ) ) | b i j B ˜ } , R ̲ ( M ) = { ( b i j , T R ̲ ( M ) ( b i j ) , I R ̲ ( M ) ( b i j ) , F R ̲ ( M ) ( b i j ) ) | b i j B ˜ } ,
where
T R ¯ ( M ) ( b i j ) = b i j R s ( a k l ) t i j R s ( a k l ) T M ( t i j ) , T R ̲ ( M ) ( b i j ) = b i j R s ( a k l ) t i j R s ( a k l ) T M ( t i j ) , I R ¯ ( M ) ( b i j ) = b i j R s ( a k l ) t i j R s ( a k l ) I M ( t i j ) , I R ̲ ( M ) ( b i j ) = b i j R s ( a k l ) t i j R s ( a k l ) I M ( t i j ) , F R ¯ ( M ) ( b i j ) = b i j R s ( a k l ) t i j R s ( a k l ) F M ( t i j ) , F R ̲ ( M ) ( b i j ) = b i j R s ( a k l ) t i j R s ( a k l ) F M ( t i j ) .
In other words,
T R ¯ ( M ) ( b i j ) = a k l A ( 1 R ( a k l , b i j ) ) t i j B R ( a k l , t i j ) T M ( t i j ) , T R ̲ ( M ) ( b i j ) = a k l A R ( a k l , b i j ) t i j B ( 1 R ( a k l , t i j ) ) T M ( t i j ) , I R ¯ ( M ) ( b i j ) = a k l A R ( a k l , b i j ) t i j B ( 1 R ( a k l , t i j ) ) I M ( t i j ) , I R ̲ ( M ) ( b i j ) = a k l A ( 1 R ( a k l , b i j ) ) t i j B R ( a k l , t i j ) I M ( t i j ) , F R ¯ ( M ) ( b i j ) = a k l A R ( a k l , b i j ) t i j B ( 1 R ( a k l , t i j ) ) F M ( t i j ) , F R ̲ ( M ) ( b i j ) = a k l A ( 1 R ( a k l , b i j ) ) t i j B R ( a k l , t i j ) F M ( t i j ) .
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
T M ( b i j ) min i { T N ( b i ) } , I M ( b i j ) min i { I N ( b i ) } , F M ( b i j ) min i { F N ( b i ) } .
From Definition 2, it follows that:
T R ¯ ( M ) ( b i j ) min { T S ¯ ( N ) ( b i ) , T S ¯ ( N ) ( b j ) } , T R ̲ ( M ) ( b i j ) min { T S ̲ ( N ) ( b i ) , T S ̲ ( N ) ( b j ) } , I R ¯ ( M ) ( b i j ) max { I S ¯ ( N ) ( b i ) , I S ¯ ( N ) ( b j ) } , I R ̲ ( M ) ( b i j ) max { I S ̲ ( N ) ( b i ) , I S ̲ ( N ) ( b j ) } , F R ¯ ( M ) ( b i j ) max { F S ¯ ( N ) ( b i ) , F S ¯ ( N ) ( b j ) } , F R ̲ ( M ) ( b i j ) max { F S ̲ ( N ) ( b i ) , F S ̲ ( N ) ( b j ) } .
Definition 3.
In Definition 2 b i j is called effective, if
T R ̲ ( M ) ( b i j ) = T S ̲ ( N ) ( b i ) T S ̲ N ( b j ) , T R ¯ ( M ) ( b i j ) = T S ¯ ( N ) ( b i ) T S ¯ N ( b j ) , I R ̲ ( M ) ( b i j ) = I S ̲ ( N ) ( b i ) I S ̲ N ( b j ) , I R ¯ ( M ) ( b i j ) = I S ¯ ( N ) ( b i ) I S ¯ N ( b j ) , F R ̲ ( M ) ( b i j ) = F S ̲ ( N ) ( b i ) F S ̲ N ( b j ) , F R ¯ ( M ) ( b i j ) = F S ¯ ( N ) ( b i ) F S ¯ N ( 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 ( a l a m n , b i b j k ) S ( a l , b i ) R ( a m n , b j k ) ,
for all ( a l a m n , b i b j k )∈X and for some i≠j≠k and l≠m≠n. Let X s : A ^ P ( B ^ ) be a set-valued function defined by
X s ( a l a m n ) = { b i b j k B ^ | ( a l a m n , ( b i , b j k ) ) X } , ( a , l a m n ) A ^ ,
For any Q∈ N ( B ^ ), the upper and lower soft rough neutrosophic approximation of Q w.r.t ( B ^ ,X), for all b i b j k B ^ , are defined as follows:
X ¯ ( Q ) = { ( b i b j k , T X ¯ ( Q ) ( b i b j k ) , I X ¯ ( Q ) ( b i b j k ) , F X ¯ ( Q ) ( b i b j k ) ) } , X ̲ ( Q ) = { ( b i b j k , T X ̲ ( Q ) ( b i b j k ) , I X ̲ ( Q ) ( b i b j k ) , F X ̲ ( Q ) ( b i b j k ) ) } ,
where
T X ¯ ( Q ) ( b i b j k ) = b i b j k X s ( a l a m n ) t i t j k X s ( a l a m n ) T Q ( t i t j k ) , T X ̲ ( Q ) ( b i b j k ) = b i b j k X s ( a l a m n ) t i t j k X s ( a l a m n ) T Q ( t i t j k ) , I X ¯ ( Q ) ( b i b j k ) = b i b j k X s ( a l a m n ) t i t j k X s ( a l a m n ) I Q ( t i t j k ) , I X ̲ ( Q ) ( b i b j k ) = b i b j k X s ( a l a m n ) t i t j k X s ( a l a m n ) I Q ( t i t j k ) , F X ¯ ( Q ) ( b i b j k ) = b i b j k X s ( a l a m n ) t i t j k X s ( a l a m n ) F Q ( t i t j k ) , F X ̲ ( Q ) ( b i b j k ) = b i b j k X s ( a l a m n ) t i t j k X s ( a l a m n ) F Q ( t i t j k ) .
In other words,
T X ¯ ( Q ) ( b i b j k ) = a l a m n A ( 1 X ( a l a m n , b i b j k ) ) t i t j k B X ( a l a m n , t i t j k ) T Q ( t i t j k ) , T X ̲ ( Q ) ( b i b j k ) = a l a m n A X ( a l a m n , b i b j k ) t i t j k B ( 1 X ( a l a m n , t i t j k ) ) T Q ( t i t j k ) , I X ¯ ( Q ) ( b i b j k ) = a l a m n A X ( a l a m n , b i b j k ) t i t j k B ( 1 X ( a l a m n , t i t j k ) ) I Q ( t i t j k ) , I X ̲ ( Q ) ( b i b j k ) = a l a m n A ( 1 X ( a l a m n , b i b j k ) ) t i t j k B X ( a l a m n , t i t j k ) I Q ( t i t j k ) , F X ¯ ( Q ) ( b i b j k ) = a l a m n A X ( a l a m n , b i b j k ) t i t j k B ( 1 X ( a l a m n , t i t j k ) ) F Q ( t i t j k ) , F X ̲ ( Q ) ( b i b j k ) = a l a m n A ( 1 X ( a l a m n , b i b j k ) ) t i t j k B X ( a l a m n , t i t j k ) F Q ( t i t j k ) .
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
T Q ( b i b j k ) min j k { T M ( b j k ) } , I Q ( b i b j k ) min j k { I M ( b j k ) } , F Q ( b i b j k ) min j k { F M ( b j k ) } .
From Definition 4, we have
T X ¯ ( Q ) ( b i b j k ) min { T S ¯ ( N ) ( b i ) , T R ¯ ( M ) ( b j k ) } , T X ̲ ( Q ) ( b i b j k ) min { T S ̲ ( N ) ( b i ) , T R ̲ ( M ) ( b j k ) } , I X ¯ ( Q ) ( b i b j k ) max { I S ¯ ( N ) ( b i ) , I R ¯ ( M ) ( b j k ) } , I X ̲ ( Q ) ( b i b j k ) max { I S ̲ ( N ) ( b i ) , I R ̲ ( M ) ( b j k ) } , F X ¯ ( Q ) ( b i b j k ) max { F S ¯ ( N ) ( b i ) , F R ¯ ( M ) ( b j k ) } , F X ̲ ( Q ) ( b i b j k ) max { F S ̲ ( N ) ( b i ) , F R ̲ ( M ) ( b j k ) } .
Definition 5.
In Definition 4 b i b j k is called influence effective, if
T X ̲ ( Q ) ( b i b j k ) = T S ̲ ( N ) ( b i ) T R ̲ M ( b i j ) , T X ¯ ( Q ) ( b i b j k ) = T S ¯ ( N ) ( b i ) T R ¯ M ( b i j ) , I X ̲ ( Q ) ( b i b j k ) = I S ̲ ( N ) ( b i ) I R ̲ M ( b i j ) , I X ¯ ( Q ) ( b i b j k ) = I S ¯ ( N ) ( b i ) I R ¯ M ( b i j ) , F X ̲ ( Q ) ( b i b j k ) = F S ̲ ( N ) ( b i ) F R ̲ M ( b i j ) , F X ¯ ( Q ) ( b i b j k ) = F S ¯ ( N ) ( b i ) F R ¯ M ( b i j ) .
Example 2.
Let a full soft set S on an universal set B={ b 1 , b 2 , b 3 , b 4 } with A={ a 1 , a 2 , a 3 } a set of parameters can be defined in tabular form as Table 2 as follows:
Now, we can define set-valued function S s such that
S s ( a 1 ) = { b 1 , b 2 , b 4 } , S s ( a 2 ) = { b 3 , b 4 } , S s ( a 3 ) = { b 1 , b 2 , b 3 , b 4 } .
Let N = { ( b 1 , 1.0 , 0.0 , 0.0 ),( b 2 , 0.8 , 0.0 , 0.1 ),( b 3 , 0.5 , 0.5 , 0.5 ),( b 4 , 0.4 , 0.7 , 0.3 )} be a neutrosophic set on B, then by using Equation (1) of Definition 1, we have
S ¯ ( N ) = { ( b 1 , 1.0 , 0.0 , 0.0 ) , ( b 2 , 1.0 , 0.0 , 0.0 ) , ( b 3 , 0.5 , 0.5 , 0.3 ) , ( b 4 , 0.5 , 0.5 , 0.3 ) } ,
S ̲ ( N ) = { ( b 1 , 0.4 , 0.7 , 0.3 ) , ( b 2 , 0.4 , 0.7 , 0.3 ) , ( b 3 , 0.4 , 0.7 , 0.5 ) , ( b 4 , 0.4 , 0.7 , 0.3 ) } .
Hence ( S ̲ ( N ) , S ¯ ( N ) ) is soft rough neutrosophic set. Let a full soft set R on C={ b 12 , b 22 , b 23 , b 32 , b 42 }⊆ B ˜ with L={ a 13 , a 21 , a 32 }⊆ A ˜ can be defined in Table 3 (from L to C) as follows:
Now, we can define set-valued function R s such that
R s ( a 13 ) = { b 12 , b 22 , b 23 , b 42 } , R s ( a 21 ) = { b 32 } , R s ( a 32 ) = { b 23 } .
and M = { ( b 12 , 0.4 , 0.0 , 0.0 ),( b 22 , 0.4 , 0.0 , 0.0 ),( b 23 , 0.4 , 0.0 , 0.0 ),( b 32 , 0.4 , 0.0 , 0.0 ),( b 42 , 0.4 , 0.0 , 0.0 )} a neutrosophic relation on B, then by using Equation (2) of Definition 2, we get
R ¯ ( M ) = { ( b 12 , 0.4 , 0.0 , 0.0 ) , ( b 22 , 0.4 , 0.0 , 0.0 ) , ( b 23 , 0.4 , 0.0 , 0.0 ) , ( b 32 , 0.4 , 0.0 , 0.0 ) , ( b 42 , 0.4 , 0.0 , 0.0 ) } , R ̲ ( M ) = { ( b 12 , 0.4 , 0.0 , 0.0 ) , ( b 22 , 0.4 , 0.0 , 0.0 ) , ( b 23 , 0.4 , 0.0 , 0.0 ) , ( b 32 , 0.4 , 0.0 , 0.0 ) , ( b 42 , 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={ b 1 b 22 , b 1 b 23 , b 1 b 32 , b 1 b 42 , b 3 b 12 , b 3 b 22 , b 3 b 42 , b 4 b 12 , b 4 b 22 , b 4 b 23 , b 4 b 32 }⊆ B ^ with P = { a 13 , a 21 , a 32 }⊆ A ^ can be defined in Table 4 (from P to D) as follows:
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, S N ,R, R M ) 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)
S N = ( S ̲ ( N ) , S ¯ ( N ) ) is a soft rough neutrosophic set of V,
(v)
R M = ( R ̲ ( M ) , R ¯ ( M ) ) is a soft rough neutrosophic set on E V ˜ ,
In other words G = ( G ̲ , G ¯ )=( S N , R M ) 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 = ( S N , R M ).
Example 3.
Let V={ v 1 , v 2 , v 3 , v 4 , v 5 , v 6 } be a vertex set and A={ a 1 , a 2 , a 3 } a set of parameters. A full soft set S from A on V can be defined in tabular form in Table 5 as follows:
Let N = {( v 1 , 0.8 , 0.6 , 0.4 ) ,( v 2 , 0.9 , 0.4 , 0.45 ),( v 3 , 0.7 , 0.4 , 0.35 ),( v 4 , 0.6 , 0.3 , 0.5 ),( v 5 , 0.4 , 0.7 , 0.6 ),( v 6 , 0.5 , 0.5 , 0.5 )} be a neutrosophic set on V. Then from Equation (1) of Definition 1, we have
S ¯ ( N ) = { ( v 1 , 0.9 , 0.4 , 0.4 ) , ( v 2 , 0.9 , 0.4 , 0.4 ) , ( v 3 , 0.7 , 0.3 , 0.5 ) , ( v 4 , 0.7 , 0.3 , 0.5 ) , ( v 5 , 0.7 , 0.4 , 0.5 ) , ( v 6 , 0.7 , 0.4 , 0.5 ) } , S ̲ ( N ) = { ( v 1 , 0.4 , 0.7 , 0.6 ) , ( v 2 , 0.4 , 0.7 , 0.6 ) , ( v 3 , 0.4 , 0.7 , 1.0 ) , ( v 4 , 0.4 , 0.7 , 1.0 ) , ( v 5 , 0.4 , 0.7 , 0.6 ) , ( v 6 , 0.4 , 0.7 , 0.6 ) } .
Hence, S N = ( S ̲ ( N ) , S ¯ ( N ) ) is a soft rough neutrosophic set on V. Let E={ v 11 , v 15 , v 16 , v 23 , v 25 , v 34 , v 41 , v 43 , v 56 , v 62 , v 63 }⊆ V ˜ and L= { a 12 , a 13 , a 21 , a 23 , a 31 }⊆ A ˜ . Then a full soft set R on E (from L to E) can be defined in Table 6 as follows:
Let M = {( v 11 , 0.4 , 0.3 , 0.35 ) ,( v 15 , 0.3 , 0.3 , 0.2 ),( v 16 , 0.3 , 0.2 , 0.25 ),( v 23 , 0.4 , 0.1 , 0.1 ),( v 25 , 0.4 , 0.2 , 0.0 ),( v 34 , 0.3 , 0.1 , 0.3 ),( v 41 , 0.2 , 0.1 , 0.2 ),( v 43 , 0.4 , 0.28 , 0.2 ),( v 56 , 0.4 , 0.3 , 0.3 ),( v 62 , 0.35 , 0.25 , 0.32 ),( v 63 , 0.4 , 0.12 , 0.34 )} be a neutrosophic set on E. Then from Equation (2) of Definition 2, we have
R ¯ ( M ) = { ( v 11 , 0.4 , 0.1 , 0.00 ) , ( v 15 , 0.4 , 0.10 , 0.00 ) , ( v 16 , 0.4 , 0.10 , 0.00 ) , ( v 23 , 0.4 , 0.10 , 0.00 ) , ( v 25 , 0.4 , 0.1 , 0.00 ) , ( v 34 , 0.4 , 0.10 , 0.20 ) , ( v 41 , 0.4 , 0.10 , 0.30 ) , ( v 43 , 0.4 , 0.10 , 0.20 ) , ( v 56 , 0.4 , 0.1 , 0.30 ) , ( v 62 , 0.4 , 0.10 , 0.30 ) , ( v 63 , 0.4 , 0.10 , 0.20 ) } , R ̲ ( M ) = { ( v 11 , 0.3 , 0.3 , 0.35 ) , ( v 15 , 0.3 , 0.30 , 0.35 ) , ( v 16 , 0.3 , 0.30 , 1.00 ) , ( v 23 , 0.3 , 0.30 , 0.35 ) , ( v 25 , 0.3 , 0.3 , 0.35 ) , ( v 34 , 0.3 , 0.28 , 0.34 ) , ( v 41 , 0.2 , 0.28 , 0.32 ) , ( v 43 , 0.3 , 0.28 , 0.34 ) , ( v 56 , 0.3 , 0.3 , 0.32 ) , ( v 62 , 0.3 , 0.28 , 0.32 ) , ( v 63 , 0.2 , 0.28 , 0.34 ) } .
Hence, R M = ( 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.
Hence, G = ( G ¯ , G ̲ ) is SRNG.
Definition 7.
An underlying graph(supporting graph) G = ( G ̲ , G ¯ ) of a soft rough neutrosophic graph G = ( G ̲ , G ¯ ) is of the form G ̲ = ( V ̲ , E ̲ ) and G ¯ = ( V ¯ , E ¯ ),
V ̲ = L o w e r V e r t e x S e t = { v V | T S ̲ ( N ) ( v ) 0 , I S ̲ ( N ) ( v ) 0 , F S ̲ ( N ) ( v ) 0 } , V ¯ = U p p e r V e r t e x S e t = { v V | T S ¯ ( N ) ( v ) 0 , I S ¯ ( N ) ( v ) 0 , F S ¯ ( N ) ( v ) 0 } , E ̲ = L o w e r E d g e S e t = { v i j E | T R ̲ ( M ) ( v i j ) 0 , I R ̲ ( M ) ( v i j ) 0 , F R ̲ ( M ) ( v i j ) 0 } , E ¯ = U p p e r E d g e S e t = { v i j E | T R ̲ ( M ) ( v i j ) 0 , I R ̲ ( M ) ( v i j ) 0 , F R ̲ ( M ) ( v i j ) 0 } .
Definition 8.
A soft rough neutrosophic graph has a walk if each approximation graph has an alternative sequence of the form
v 0 , e 0 , v 1 , e 1 , v 2 , , v n 1 , e n 1 , v n
such that
v k V ̲ , e k E ̲ , v k V ¯ , e k E ¯
where e k = v k ( k + 1 ) E , ∀k=0,1, 2 , ⋯,n−1. If v 0 = v n , then it is called closed walk. If the edges are distinct, then it is called a soft rough neutrosophic trail (SRN trail). If the vertices are distinct, then it is called a soft rough neutrosophic path (SRN path). If a path in a SRNG is closed, then it is called a cycle.
Definition 9.
A strength of soft rough neutrosophic graph, denoted by stren, is defined as
s t r e n = ( ( v j k E ̲ T R ̲ ( M ) ( v j k ) ) ( v j k E ¯ T R ¯ ( M ) ( v j k ) ) , ( v j k E ̲ I R ̲ ( M ) ( v j k ) ) ( v j k E ¯ I R ¯ ( M ) ( v j k ) ) , ( v j k E ̲ F R ̲ ( M ) ( v j k ) ) ( v j k E ¯ F R ¯ ( M ) ( v j k ) ) ) .
Definition 10.
A strongest path joining any two vertices v i and v k is the soft rough neutrosophic path which has maximum strength from v i and v k , denoted by C O N N G ( v i , v k ) or E ( v i , v k ) , is called strength of connectedness from v i and v k .
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 v l m , v i j E ̲ , v l m , v i j E ¯ and v l m v i j such that
R ̲ ( M ) ( v i j ) = v l m E ̲ v i j R ̲ ( M ) ( v l m ) , R ¯ ( M ) ( v i j ) = v l m E ¯ v i j R ¯ ( M ) ( v l m ) .
Equivalently, each approximation graph is a cycle such that
R ̲ ( M ) ( v i j ) = ( v l m E ̲ v i j T R ̲ ( M ) ( v l m ) , v l m E ̲ v i j I R ̲ ( M ) ( v l m ) , v l m E ̲ v i j F R ̲ ( M ) ( v l m ) ) , R ¯ ( M ) ( v i j ) = ( v l m E ¯ v i j T R ¯ ( M ) ( v l m ) , v l m E ¯ v i j I R ¯ ( M ) ( v l m ) , v l m E ¯ v i j F R ¯ ( M ) ( v l m ) ) .
Example 4.
Let V={ v 1 , v 2 , v 3 , v 4 } be a vertex set and A={ a 1 , a 2 , a 3 , a 4 } a set of parameters. A relation S over A × V can be defined in tabular form in Table 7 as follows:
Let N = {( v 1 , 0.3 , 0.4 , 0.6 ) ,( v 2 , 0.4 , 0.5 , 0.1 ),( v 3 , 0.9 , 0.6 , 0.4 ),( v 4 , 1.0 , 0.2 , 0.1 )} be a neutrosophic set on V. Then from Equation (1) of Definition 1, we have
S ¯ ( N ) = { ( v 1 , 0.9 , 0.4 , 0.4 ) , ( v 2 , 1.0 , 0.2 , 0.1 ) , ( v 3 , 0.9 , 0.4 , 0.4 ) , ( v 4 , 1.0 , 0.2 , 0.1 ) } , S ̲ ( N ) = { ( v 1 , 0.3 , 0.6 , 0.6 ) , ( v 2 , 0.4 , 0.5 , 0.1 ) , ( v 3 , 0.3 , 0.6 , 0.6 ) , ( v 4 , 0.4 , 0.5 , 0.1 ) } .
Hence, S N = ( S ̲ ( N ) , S ¯ ( N ) ) is soft rough neutrosophic set on V. Let E={ v 13 , v 32 , v 24 , v 41 }⊆ V ˜ and L= { a 13 , a 32 , a 43 }⊆ A ˜ . Then a full soft set R on E (from L to E) can be defined in Table 8 as follows:
Let M = {( v 13 , 0.3 , 0.2 , 0.1 ),( v 32 , 0.2 , 0.1 , 0.1 ),( v 24 , 0.3 , 0.2 , 0.1 ),( v 41 , 0.3 , 0.1 , 0.1 )} be a neutrosophic set on E. Then from Equation (2) of Definition 2, we have
R ¯ ( M ) = { ( v 13 , 0.3 , 0.2 , 0.1 ) , ( v 32 , 0.2 , 0.1 , 0.1 ) , ( v 24 , 0.3 , 0.1 , 0.1 ) , ( v 41 , 0.3 , 0.1 , 0.1 ) } , R ̲ ( M ) = { ( v 13 , 0.3 , 0.2 , 0.1 ) , ( v 32 , 0.2 , 0.1 , 0.1 ) , ( v 24 , 0.3 , 0.2 , 0.1 ) , ( v 41 , 0.2 , 0.1 , 0.1 ) } .
Hence, R M = ( 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 2. Hence, G = ( G ̲ , G ¯ ) is SRNG and it is also a soft rough neutrosophic cycle.
Definition 12.
A soft rough neutrosophic subgraph H = ( S N 2 , R M 2 ) of a soft rough neutrosophic graph G = ( S N 1 , R M 1 ), if v∈H such that
T S ̲ ( N 2 ) ( v ) T S ̲ ( N 1 ) ( v ) , I S ̲ ( N 2 ) ( v ) I S ̲ ( N 1 ) ( v ) , F S ̲ ( N 2 ) ( v ) F S ̲ ( N 1 ) ( v ) , T S ¯ ( N 2 ) ( v ) T S ¯ ( N 1 ) ( v ) , I S ¯ ( N 2 ) ( v ) I S ¯ ( N 1 ) ( v ) , F S ¯ ( N 2 ) ( v ) F S ¯ ( N 1 ) ( v ) ,
and v i j ∈H,
T R ̲ ( M 2 ) ( v i j ) T R ̲ ( M 1 ) ( v i j ) , I R ̲ ( M 2 ) ( v i j ) I R ̲ ( M 1 ) ( v i j ) , F R ̲ ( M 2 ) ( v i j ) F R ̲ ( M 1 ) ( v i j ) , T R ¯ ( M 2 ) ( v i j ) T R ¯ ( M 1 ) ( v i j ) , I R ¯ ( M 2 ) ( v i j ) I R ¯ ( M 1 ) ( v i j ) , F R ¯ ( M 2 ) ( v i j ) F R ¯ ( M 1 ) ( v i j ) .
Definition 13.
A H = ( S N 2 , R M 2 ) is called soft rough neutrosophic spanning subgraph of a soft rough neutrosophic graph G = ( S N 1 , R M 1 ), if H is a soft rough neutrosophic subgraph such that
T S ̲ ( N 2 ) ( v ) = T S ̲ ( N 1 ) ( v ) , I S ̲ ( N 2 ) ( v ) = I S ̲ ( N 1 ) ( v ) , F S ̲ ( N 2 ) ( v ) = F S ̲ ( N 1 ) ( v ) , T S ¯ ( N 2 ) ( v ) = T S ¯ ( N 1 ) ( v ) , I S ¯ ( N 2 ) ( v ) = I S ¯ ( N 1 ) ( v ) , F S ¯ ( N 2 ) ( v ) = F S ¯ ( N 1 ) ( v ) .
Definition 14.
A soft rough neutrosophic graph is a ditree if and only if each supporting approximation graph is a ditree. A soft rough neutrosophic graph G = ( S N 1 , R M 1 ) is a soft rough neutrosophic ditree if and only if there exists a soft rough neutrosophic spanning subgraph H = ( S N 1 , R M 2 ) is a ditree such that v i j ∈G−H
T R ̲ ( M 1 ) ( v i j ) < T C O N N H ̲ ( v i , v j ) , I R ̲ ( M 1 ) ( v i j ) > I C O N N H ̲ ( v i , v j ) , F R ̲ ( M 1 ) ( v i j ) > F C O N N H ̲ ( v i , v j ) , T R ¯ ( M 1 ) ( v i j ) < T C O N N H ¯ ( v i , v j ) , I R ¯ ( M 1 ) ( v i j ) > I C O N N H ¯ ( v i , v j ) , F R ¯ ( M 1 ) ( v i j ) > F C O N N H ¯ ( v i , v j ) .
Definition 15.
Let G = ( S N , R M ) be a soft rough neutrosophic graph, an edge v i j is a bridge if the edge v i j is a bridge in both supporting graph of G ̲ and G ¯ , that is the removal of v i j disconnects both the G ̲ and G ¯ . An edge v i j is a soft rough neutrosophic bridge in a soft rough neutrosophic graph G = ( S N , R M ), if v l m ∈G
T C O N N G ̲ v i j ( v l , v m ) < T C O N N G ̲ ( v l , v m ) , T C O N N G ¯ v i j ( v l , v m ) < T C O N N G ¯ ( v l , v m ) , I C O N N G ̲ v i j ( v l , v m ) > I C O N N G ̲ ( v l , v m ) , I C O N N G ¯ v i j ( v l , v m ) > I C O N N G ¯ ( v l , v m ) , F C O N N G ̲ v i j ( v l , v m ) > F C O N N G ̲ ( v l , v m ) , F C O N N G ¯ v i j ( v l , v m ) > F C O N N G ¯ ( v l , v m ) .
Definition 16.
Let G = ( S N 1 , R M 1 ) be a soft rough neutrosophic graph then a vertex v i in G is a cutnode(cutvertex) if it is a cutnode in each supporting graph of G ̲ and G ¯ . That is, the deletion of v i from the supporting graphs of G ̲ and G ¯ increase the components in the supporting graphs. A vertex v i is called soft rough neutrosophic cutnode(cutvertex) in a soft rough neutrosophic graph if the removal of v i reduces the strength of the connectedness from nodes v j t o v k V ̲ , V ¯
T C O N N G ̲ v i ( v j , v k ) < T C O N N G ̲ ( v j , v k ) , T C O N N G ¯ v i ( v j , v k ) < T C O N N G ¯ ( v j , v k ) , I C O N N G ̲ v i ( v j , v k ) > I C O N N G ̲ ( v j , v k ) , I C O N N G ¯ v i ( v j , v k ) > I C O N N G ¯ ( v j , v k ) , F C O N N G ̲ v i ( v j , v k ) > F C O N N G ̲ ( v j , v k ) , F C O N N G ¯ v i ( v j , v k ) > F C O N N G ¯ ( v j , v k ) .
Definition 17.
An edge v i j in soft rough neutrosophic graph G is called strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) F C O N N G ¯ v i j ( v i , v j ) .
Definition 18.
An edge v i j in soft rough neutrosophic graph G is called α strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) > T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) > T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) < I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) < I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) < F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) < F C O N N G ¯ v i j ( v i , v j ) .
Definition 19.
An edge v i j in soft rough neutrosophic graph G is called β strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) = T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) = T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) = I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) = I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) = F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) = F C O N N G ¯ v i j ( v i , v j ) .
Definition 20.
An edge v i j in soft rough neutrosophic graph G is called δ strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) < T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) < T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) > I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) > I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) > F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) > F C O N N G ¯ v i j ( v i , v j ) .
Example 5.
Let V={ v 1 , v 2 , v 3 , v 4 } be a vertex set and A={ a 1 , a 2 , a 3 , a 4 } a set of parameters. A relation S over A × V can be defined in tabular form in Table 9 as follows:
Let N = {( v 1 , 0.3 , 0.4 , 0.6 ) ,( v 2 , 0.4 , 0.5 , 0.1 ),( v 3 , 0.9 , 0.6 , 0.4 ),( v 4 , 1.0 , 0.2 , 0.1 )} be a neutrosophic set on V. Then from Equation (1) of Definition 1, we have
S ¯ ( N ) = { ( v 1 , 0.9 , 0.4 , 0.4 ) , ( v 2 , 1.0 , 0.2 , 0.1 ) , ( v 3 , 0.9 , 0.4 , 0.4 ) , ( v 4 , 1.0 , 0.2 , 0.1 ) } , S ̲ ( N ) = { ( v 1 , 0.3 , 0.6 , 0.6 ) , ( v 2 , 0.4 , 0.5 , 0.1 ) , ( v 3 , 0.3 , 0.6 , 0.6 ) , ( v 4 , 0.4 , 0.5 , 0.1 ) } .
Hence, S N = ( S ̲ ( N ) , S ¯ ( N ) ) is soft rough neutrosophic set on V. Let E={ v 13 , v 32 , v 43 }⊆ V ˜ and L= { a 12 , a 24 , a 34 }⊆ A ˜ . Then a full soft set R on E (from L to E) can be defined in Table 10 as follows:
Let M = {( v 13 , 0.3 , 0.2 , 0.0 ),( v 32 , 0.3 , 0.0 , 0.1 ),( v 43 , 0.3 , 0.2 , 0.1 )} be a neutrosophic set on E. Then from Equation (2) of Definition 2, we have
R ¯ ( M ) = { ( v 13 , 0.3 , 0.2 , 0.0 ) , ( v 32 , 0.3 , 0.0 , 0.1 ) , ( v 43 , 0.3 , 0.2 , 0.1 ) } , R ̲ ( M ) = { ( v 13 , 0.3 , 0.2 , 0.1 ) , ( v 32 , 0.3 , 0.0 , 0.1 ) , ( v 43 , 0.3 , 0.2 , 0.1 ) } .
Hence, R M = ( 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. v 13 is a bridge and v 3 is a cute node.
We state the following Theorems without their proofs.
Theorem 1.
Let G = ( S N 1 , R M 1 ) be a soft rough neutrosophic graph tree. An edge v i j is the strongest edge if v i j is an edge of its subgraph H = ( S N 1 , R M 2 ).
Theorem 2.
If 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 i j is a soft rough neutrosophic bridge of G, then
T R ̲ ( M ) ( v i j ) = T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) = T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) = I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) = I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) = F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) = F C O N N G ¯ v i j ( v i , v j ) .

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 (A,S, S N ,R, R M ,X, X Q ) 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 ,
(iv)
X is an arbitrary full soft set over I V × E ,
(v)
S N = ( S ̲ ( N ) , S ¯ ( N ) ) is a soft rough neutrosophic set on V,
(vi)
R M = ( R ̲ ( M ) , R ¯ ( M ) ) is a soft rough neutrosophic set on E,
(vii)
X Q = ( X ̲ ( Q ) , X ¯ ( Q ) ) is a soft rough neutrosophic set on I,
Thus, G = ( G ̲ , G ¯ )=( S N , R M , X Q ) 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={ v 1 , v 2 , v 3 , v 4 , v 5 , v 6 } be a vertex set and A={ a 1 , a 2 , a 3 , a 4 } a set of parameters. A full soft set S over A × V can be defined in tabular form in Table 11 as follows:
Let N = {( v 1 , 1.0 , 0.4 , 0.7 ) ,( v 2 , 0.9 , 0.6 , 0.55 ),( v 3 , 0.7 , 0.9 , 0.5 ),( v 4 , 0.6 , 0.5 , 0.6 ), ( v 5 , 0.65 , 0.8 , 0.65 ),( v 6 , 0.8 , 0.7 , 0.8 )} be a neutrosophic set on V. Then from Equation (1) of Definition 1, we have
S ¯ ( N ) = { ( v 1 , 1.0 , 0.4 , 0.50 ) , ( v 2 , 0.9 , 0.6 , 0.55 ) , ( v 3 , 1.0 , 0.4 , 0.5 ) , ( v 4 , 1.0 , 0.4 , 0.5 ) , ( v 5 , 0.9 , 0.6 , 0.55 ) , ( v 6 , 0.9 , 0.6 , 0.55 ) } , S ̲ ( N ) = { ( v 1 , 0.7 , 0.9 , 0.80 ) , ( v 2 , 0.7 , 0.8 , 0.80 ) , ( v 3 , 0.7 , 0.9 , 0.8 ) , ( v 4 , 0.6 , 0.9 , 0.8 ) , ( v 5 , 0.65 , 0.8 , 0.8 ) ( v 6 , 0.7 , 0.8 , 0.8 ) } .
Hence, S N = ( S ̲ ( N ) , S ¯ ( N ) ) is soft rough neutrosophic set on V. Let E={ v 12 , v 24 , v 32 , v 42 , v 52 , v 62 ,}⊆ V ˜ and L= { a 13 , a 24 , a 34 , a 41 }⊆ A ˜ . Then a full soft set R on E (from L to E) can be defined in Table 12 as follows:
Let M = {( v 12 , 0.6 , 0.3 , 0.4 ) ,( v 24 , 0.58 , 0.38 , 0.46 ),( v 32 , 0.56 , 0.37 , 0.47 ),( v 42 , 0.54 , 0.34 , 0.38 ), ( v 52 , 0.52 , 0.32 , 0.5 ),( v 62 , 0.5 , 0.4 , 0.45 )} be a neutrosophic set on E. Then from Equation (2) of Definition 2, we have
R ¯ ( M ) = { ( v 12 , 0.60 , 0.30 , 0.38 ) , ( v 24 , 0.58 , 0.38 , 0.45 ) , ( v 32 , 0.60 , 0.30 , 0.38 ) , ( v 42 , 0.60 , 0.30 , 0.38 ) , ( v 52 , 0.58 , 0.32 , 0.45 ) , ( v 62 , 0.58 , 0.38 , 0.45 ) } , R ̲ ( M ) = { ( v 12 , 0.50 , 0.40 , 0.50 ) , ( v 24 , 0.50 , 0.40 , 0.46 ) , ( v 32 , 0.50 , 0.40 , 0.50 ) , ( v 42 , 0.50 , 0.40 , 0.50 ) , ( v 52 , 0.50 , 0.40 , 0.50 ) , ( v 62 , 0.50 , 0.40 , 0.46 ) } .
Hence, R M = ( 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 = { v 1 v 24 , v 1 v 32 , v 1 v 42 , v 1 v 52 , v 1 v 62 , v 3 v 12 , v 3 v 24 , v 3 v 42 , v 3 v 52 , v 3 v 62 , v 4 v 12 , v 4 v 32 , v 4 v 52 , v 4 v 62 , v 5 v 12 , v 5 v 24 , v 5 v 32 , v 5 v 42 , v 5 v 62 , v 6 v 12 , v 6 v 24 , v 6 v 32 , v 6 v 42 , v 6 v 52 }⊆ V × E and P= { a 1 a 24 , a 1 a 34 , a 2 a 13 , a 2 a 34 , a 2 a 41 , a 3 a 24 , a 3 a 41 , a 4 a 13 }⊆ 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:
Q = { ( v 1 v 24 , 0.42 , 0.3 , 0.38 ) , ( v 1 v 32 , 0.43 , 0.28 , 0.37 ) , ( v 1 v 42 , 0.49 , 0.26 , 0.33 ) , ( v 1 v 52 , 0.47 , 0.29 , 0.32 ) , ( v 1 v 62 , 0.46 , 0.28 , 0.36 ) , ( v 3 v 12 , 0.4 , 0.29 , 0.37 ) , ( v 3 v 24 , 0.45 , 0.24 , 0.36 ) , ( v 3 v 42 , 0.48 , 0.29 , 0.35 ) , ( v 3 v 52 , 0.41 , 0.24 , 0.36 ) , ( v 3 v 62 , 0.42 , 0.26 , 0.34 ) , ( v 4 v 12 , 0.5 , 0.25 , 0.3 ) , ( v 4 v 32 , 0.44 , 0.27 , 0.32 ) , ( v 4 v 52 , 0.45 , 0.23 , 0.31 ) , ( v 4 v 62 , 0.48 , 0.23 , 0.38 ) , ( v 5 v 12 , 0.46 , 0.24 , 0.3 ) , ( v 5 v 24 , 0.47 , 0.26 , 0.34 ) , ( v 5 v 32 , 0.4 , 0.3 , 0.36 ) , ( v 5 v 42 , 0.48 , 0.29 , 0.38 ) , ( v 5 v 62 , 0.49 , 0.3 , 0.37 ) , ( v 6 v 12 , 0.49 , 0.3 , 0.37 ) , ( v 6 v 24 , 0.4 , 0.28 , 0.35 ) , ( v 6 v 32 , 0.47 , 0.27 , 0.34 ) , ( v 6 v 42 , 0.46 , 0.29 , 0.33 ) , ( v 6 v 52 , 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 ) = { ( v 1 v 24 , 0.49 , 0.26 , 0.32 ) , ( v 1 v 32 , 0.49 , 0.26 , 0.32 ) , ( v 1 v 42 , 0.49 , 0.26 , 0.32 ) , ( v 1 v 52 , 0.49 , 0.26 , 0.32 ) , ( v 1 v 62 , 0.49 , 0.26 , 0.34 ) , ( v 3 v 12 , 0.5 , 0.23 , 0.3 ) , ( v 3 v 24 , 0.49 , 0.23 , 0.34 ) , ( v 3 v 42 , 0.5 , 0.23 , 0.3 ) , ( v 3 v 52 , 0.5 , 0.23 , 0.3 ) , ( v 3 v 62 , 0.49 , 0.23 , 0.3 ) , ( v 4 v 12 , 0.5 , 0.23 , 0.38 ) , ( v 4 v 32 , 0.5 , 0.23 , 0.3 ) , ( v 4 v 52 , 0.49 , 0.23 , 0.31 ) , ( v 4 v 62 , 0.49 , 0.23 , 0.34 ) , ( v 5 v 12 , 0.49 , 0.24 , 0.3 ) , ( v 5 v 24 , 0.49 , 0.26 , 0.34 ) , ( v 5 v 32 , 0.49 , 0.24 , 0.3 ) , ( v 5 v 42 , 0.49 , 0.24 , 0.3 ) , ( v 5 v 62 , 0.49 , 0.26 , 0.34 ) , ( v 6 v 12 , 0.49 , 0.26 , 0.32 ) , ( v 6 v 24 , 0.49 , 0.26 , 0.34 ) , ( v 6 v 32 , 0.49 , 0.24 , 0.3 ) , ( v 6 v 42 , 0.49 , 0.26 , 0.33 ) , ( v 6 v 52 , 0.49 , 0.26 , 0.32 ) } ; X ̲ ( Q ) = { ( v 1 v 24 , 0.4 , 0.3 , 0.38 ) , ( v 1 v 32 , 0.4 , 0.3 , 0.38 ) , ( v 1 v 42 , 0.46 , 0.3 , 0.37 ) , ( v 1 v 52 , 0.46 , 0.3 , 0.37 ) , ( v 1 v 62 , 0.46 , 0.3 , 0.37 ) , ( v 3 v 12 , 0.4 , 0.3 , 0.38 ) , ( v 3 v 24 , 0.4 , 0.3 , 0.38 ) , ( v 3 v 42 , 0.4 , 0.3 , 0.38 ) , ( v 3 v 52 , 0.4 , 0.3 , 0.38 ) , ( v 3 v 62 , 0.4 , 0.3 , 0.38 ) , ( v 4 v 12 , 0.4 , 0.3 , 0.38 ) , ( v 4 v 32 , 0.4 , 0.3 , 0.38 ) , ( v 4 v 52 , 0.4 , 0.3 , 0.38 ) , ( v 4 v 62 , 0.4 , 0.3 , 0.38 ) , ( v 5 v 12 , 0.4 , 0.3 , 0.38 ) , ( v 5 v 24 , 0.4 , 0.3 , 0.37 ) , ( v 5 v 32 , 0.4 , 0.3 , 0.38 ) , ( v 5 v 42 , 0.4 , 0.3 , 0.38 ) , ( v 5 v 62 , 0.4 , 0.3 , 0.37 ) , ( v 6 v 12 , 0.46 , 0.3 , 0.37 ) , ( v 6 v 24 , 0.4 , 0.3 , 0.37 ) , ( v 6 v 32 , 0.4 , 0.3 , 0.38 ) , ( v 6 v 42 , 0.46 , 0.3 , 0.37 ) , ( v 6 v 52 , 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 Figure 5 and Figure 6. Hence, G = ( G ¯ , G ̲ ) is SRNIG.
Definition 22.
An underlying influence graph(supporting influence graph) G = ( G ̲ , G ¯ ) of a soft rough neutrosophic influence graph G = ( G ̲ , G ¯ ) is of the form G ̲ = ( V ̲ , E ̲ , I ̲ ) and G ¯ = ( V ¯ , E ¯ , I ¯ ), where
V ̲ = Lower Vertex Set = { v V | T S ̲ ( N ) ( v ) 0 , I S ̲ ( N ) ( v ) 0 , F S ̲ ( N ) ( v ) 0 } , V ¯ = Upper Vertex Set = { v V | T S ¯ ( N ) ( v ) 0 , I S ¯ ( N ) ( v ) 0 , F S ¯ ( N ) ( v ) 0 } , E ̲ = Lower Edge Set = { v i j E | T R ̲ ( M ) ( v i j ) 0 , I R ̲ ( M ) ( v i j ) 0 , F R ̲ ( M ) ( v i j ) 0 } , E ¯ = Upper Edge Set = { v i j E | T R ̲ ( M ) ( v i j ) 0 , I R ̲ ( M ) ( v i j ) 0 , F R ̲ ( M ) ( v i j ) 0 } , I ̲ = Lower Influence = { v i v j k I | T X ̲ ( Q ) ( v i v j k ) 0 , I X ̲ ( Q ) ( v i v j k ) 0 , F X ̲ ( Q ) ( v i v j k ) 0 } , I ¯ = Upper Influence = { v i v j k I | T X ¯ ( Q ) ( v i v j k ) 0 , I X ¯ ( Q ) ( v i v j k ) 0 , F X ¯ ( Q ) ( v i v j k ) 0 } .
Definition 23.
If v i j E ̲ ( E ¯ ), then v i j is a lower edge (upper edge) of the soft rough neutrosophic influence graph. If v i v j k I ̲ ( I ¯ ), then v i v j k is lower pairs (upper pair). If v j k E ̲ ( E ¯ ) and v i v j k , is not lower pairs (upper pairs), then it is a lower non-influence edge (upper non-influence edge).
Definition 24.
A soft rough neutrosophic influence graph has a walk if each approximation graph has an alternative sequence of the form
v 0 , i 0 , e 0 , i 0 , v 1 , , v n 1 , i n 1 , e n 1 , i n 1 , v n
such that
v k V ̲ , e k E ̲ , i k , i k I ̲ ,
v k V ¯ , e k E ¯ , i k , i k I ¯ .
where i k = ( v k u v ), e k = u v , i k = ( v w v k + 1 ) and ∀k=0,1, 2 , ⋯,n−1. If v 0 = v n , 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
s t r e n = ( ( v j k E ̲ T R ̲ ( M ) ( v j k ) ) ( v j k E ¯ T R ¯ ( M ) ( v j k ) ) , ( v j k E ̲ I R ̲ ( M ) ( v j k ) ) ( v j k E ¯ I R ¯ ( M ) ( v j k ) ) , ( v j k E ̲ F R ̲ ( M ) ( v j k ) ) ( v j k E ¯ F R ¯ ( M ) ( v j k ) ) ) .
An influence strength of soft rough neutrosophic influence graph, denoted by In stren, is defined as
I n s t r e n = ( ( v i v j k I ̲ T X ̲ ( Q ) ( v i v j k ) v i v j k I ¯ T X ¯ ( Q ) ( v i v j k ) ) , ( ( v i v j k ) I ̲ I R ̲ ( M ) ( v i v j k ) v i v j k I ¯ I R ¯ ( M ) ( v i v j k ) ) , ( v i v j k I ̲ F R ̲ ( M ) ( v i v j k ) v i v j k E ¯ F R ¯ ( M ) ( v i v j k ) ) ) .
Definition 26.
In a soft rough neutrosophic influence graph G , if in each approximation graph
C O N N G ̲ ( v i , v k ) = E ̲ ( v i , v k ) = α { E ̲ α ( v i , v k ) } , C O N N G ¯ ( v i , v k ) = E ¯ ( v i , v k ) = α { E ¯ α ( v i , v k ) } .
where
E ̲ α ( v i , v k ) = ( E ̲ α 1 E ̲ ) ( v i , v k ) , E ¯ α ( v i , v k ) = ( E ¯ α 1 E ¯ ) ( v i , v k ) ,
and
( E ̲ E ̲ ) ( v i , v k ) = ( v j V ̲ ( T R ̲ ( M ) ( v i j ) T R ̲ ( M ) ( v j k ) ) , v j V ̲ ( I R ̲ ( M ) ( v i j ) I R ̲ ( M ) ( v j k ) ) , v j V ̲ ( F R ̲ ( M ) ( v i j ) F R ̲ ( M ) ( v j k ) ) ) , ( E ¯ E ¯ ) ( v i , v k ) = ( v j V ¯ ( T R ¯ ( M ) ( v i j ) T R ¯ ( M ) ( v j k ) ) , v j V ¯ ( I R ¯ ( M ) ( v i j ) I R ¯ ( M ) ( v j k ) ) , v j V ¯ ( F R ¯ ( M ) ( v i j ) F R ¯ ( M ) ( v j k ) ) ) .
Thus it is the strength of strongest path from v i to v k in G .
In a soft rough neutrosophic influence graph G , if in each approximation graph
I C O N N G ̲ ( v i , v k ) = I ̲ ( v i , v k ) = α { I ̲ α ( v i , v k ) } , I C O N N G ¯ ( v i , v k ) = I ¯ ( v i , v k ) = α { I ¯ α ( v i , v k ) } .
where
I ̲ α ( v i , v k ) = ( I ̲ α 1 I ̲ ) ( v i , v k ) , I ¯ α ( v i , v k ) = ( I ¯ α 1 I ¯ ) ( v i , v k ) ,
and
( I ̲ I ̲ ) ( v i , v k ) = ( v m V ̲ ( T X ̲ ( Q ) ( v i v l m ) T X ̲ ( Q ) ( v m v p k ) ) , v m V ̲ ( I X ̲ ( Q ) ( v i v l m ) I X ̲ ( Q ) ( v m v p k ) ) , v m V ̲ ( F X ̲ ( Q ) ( v i v l m ) F X ̲ ( Q ) ( v m v p k ) ) ) , ( I ¯ I ¯ ) ( v i , v k ) = ( v m V ¯ ( T X ¯ ( Q ) ( v i v l m ) T X ¯ ( Q ) ( v m v p k ) ) , v m V ¯ ( I X ¯ ( Q ) ( v i v l m ) I X ¯ ( Q ) ( v m v p k ) ) , v m V ¯ ( F X ¯ ( Q ) ( v i v l m ) F X ¯ ( Q ) ( v m v p k ) ) ) .
Thus it is the strength of strongest path from v i to v k in G .
Definition 27.
A SRNIG is called connected if each two vertex v j and v k 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 v l m , v i j E ̲ , v l m , v i j E ¯ and v l m v i j , such that
R ̲ ( M ) ( v i j ) = ( v l m E ̲ v i j T R ̲ ( M ) ( v l m ) , v l m E ̲ v i j I R ̲ ( M ) ( v l m ) , v l m E ̲ v i j F R ̲ ( M ) ( v l m ) ) , R ¯ ( M ) ( v i j ) = ( v l m E ¯ v i j T R ¯ ( M ) ( v l m ) , v l m E ¯ v i j I R ¯ ( M ) ( v l m ) , v l m E ¯ v i j F R ¯ ( M ) ( v l m ) ) .
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 v l v m n , v i v j k I ̲ , v l v m n , v i v j k I ¯ and v l v m n v i v j k , such that
X ̲ ( Q ) ( v i v j k ) = ( v l v m n I ̲ v i v j k T X ̲ ( Q ) ( v l v m n ) , v l v m n I ̲ v i v j k I X ̲ ( Q ) ( v l v m n ) , v l v m n I ̲ v i v j k F X ̲ ( Q ) ( v l v m n ) ) , X ¯ ( Q ) ( v i v j k ) = ( v l v m n I ¯ v i v j k T X ¯ ( Q ) ( v l v m n ) , v l v m n I ¯ v i v j k I X ¯ ( Q ) ( v l v m n ) , v l v m n I ¯ v i v j k F X ¯ ( Q ) ( v l v m n ) ) .
Example 7.
Considering Example 4. Let I = { v 1 v 32 , v 1 v 24 , v 2 v 13 , v 3 v 24 , v 3 v 41 , v 4 v 13 , v 4 v 32 }⊆ V ^ and P = { a 1 a 32 , a 2 a 43 , a 4 a 13 }⊆ A ^ . Then a full soft set X on I (from P to I) can be defined in Table 14 as follows:
Let Q = {( v 1 v 32 , 0.2 , 0.1 , 0.0 ),( v 1 v 24 , 0.1 , 0.0 , 0.1 ),( v 2 v 13 , 0.2 , 0.1 , 0.0 ),( v 3 v 24 , 0.2 , 0.1 , 0.0 ),( v 4 v 13 , 0.1 , 0.1 , 0.0 ),( v 4 v 32 , 0.0 , 0.1 , 0.0 )} be a neutrosophic set on I. Then from Equation (3) of Definition 4, we have
X ¯ ( Q ) = { ( v 1 v 32 , 0.2 , 0.1 , 0.0 ) , ( v 1 v 24 , 0.1 , 0.0 , 0.0 ) , ( v 2 v 13 , 0.2 , 0.1 , 0.0 ) , ( v 3 v 24 , 0.1 , 0.0 , 0.0 ) , ( v 3 v 41 , 0.1 , 0.0 , 0.0 ) , ( v 4 v 13 , 0.1 , 0.1 , 0.0 ) , ( v 4 v 32 , 0.2 , 0.1 , 0.0 ) } , X ̲ ( Q ) = { ( v 1 v 32 , 0.0 , 0.1 , 0.0 ) , ( v 1 v 24 , 0.1 , 0.1 , 0.1 ) , ( v 2 v 13 , 0.1 , 0.1 , 0.1 ) , ( v 3 v 24 , 0.0 , 0.1 , 0.1 ) , ( v 3 v 41 , 0.1 , 0.1 , 0.1 ) , ( v 4 v 13 , 0.1 , 0.1 , 0.1 ) , ( v 4 v 32 , 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, respectively, as shown in Figure 7. Hence, G = ( G ¯ , G ̲ ) is SRNIG. The underlying graph G = ( G ̲ , G ¯ ) such that G ̲ = ( V ̲ , E ̲ , I ̲ ), G ¯ = ( V ¯ , E ¯ , I ¯ ) where V ̲ =V= V ¯ , E ̲ =E= E ¯ and I ̲ =I= I ¯ . v 13 , v 32 , v 24 , v 41 are the lower edge and upper edge and v 1 v 32 , v 4 v 32 is a lower pair and upper pair. v 2 v 41 is both lower and upper non-influence edge. P ( v 1 , v 4 ) is a path of the sequence of the form v 1 , v 1 v 24 , v 24 , v 2 v 13 , v 3 , v 3 v 41 , v 41 , v 1 v 32 , v 2 , v 2 v 13 , v 3 v 24 , v 4 . By direct calculations, the strength and influence strength of this path are ( 0.2 , 0.2 , 0.1 ) and ( 0.0 , 0.1 , 0.1 ), respectively. G is cycle, soft rough neutrosophic cycle and soft rough neutrosophic influence cycle.
Definition 29.
A soft rough neutrosophic influence subgraph H = ( S N 2 , R M 2 , X Q 2 ) of a soft rough neutrosophic influence graph G = ( S N 1 , R M 1 , X Q 1 ), if v∈H such that
T S ̲ ( N 2 ) ( v ) T S ̲ ( N 1 ) ( v ) , I S ̲ ( N 2 ) ( v ) I S ̲ ( N 1 ) ( v ) , F S ̲ ( N 2 ) ( v ) F S ̲ ( N 1 ) ( v ) , T S ¯ ( N 2 ) ( v ) T S ¯ ( N 1 ) ( v ) , I S ¯ ( N 2 ) ( v ) I S ¯ ( N 1 ) ( v ) , F S ¯ ( N 2 ) ( v ) F S ¯ ( N 1 ) ( v ) ,
v i j ∈H,
T R ̲ ( M 2 ) ( v i j ) T R ̲ ( M 1 ) ( v i j ) , I R ̲ ( M 2 ) ( v i j ) I R ̲ ( M 1 ) ( v i j ) , F R ̲ ( M 2 ) ( v i j ) F R ̲ ( M 1 ) ( v i j ) , T R ¯ ( M 2 ) ( v i j ) T R ¯ ( M 1 ) ( v i j ) , I R ¯ ( M 2 ) ( v i j ) I R ¯ ( M 1 ) ( v i j ) , F R ¯ ( M 2 ) ( v i j ) F R ¯ ( M 1 ) ( v i j ) ,
and v i v j k ∈H,
T X ̲ ( Q 2 ) ( v i v j k ) T X ̲ ( Q 1 ) ( v i v j k ) , I X ̲ ( Q 2 ) ( v i v j k ) I X ̲ ( Q 1 ) ( v i v j k ) , F X ̲ ( Q 2 ) ( v i j ) F X ̲ ( Q 1 ) ( v i v j k ) , T X ¯ ( Q 2 ) ( v i v j k ) T X ¯ ( Q 1 ) ( v i v j k ) , I X ¯ ( Q 2 ) ( v i v j k ) I X ¯ ( Q 1 ) ( v i v j k ) , F X ¯ ( Q 2 ) ( v i j ) F X ¯ ( Q 1 ) ( v i v j k ) .
Definition 30.
A H = ( S N 2 , R M 2 , X Q 2 ) is called soft rough neutrosophic influence spanning subgraph of a soft rough neutrosophic influence graph G = ( S N 1 , R M 1 , X Q 1 ), if H is a soft rough neutrosophic influence subgraph such that
T S ̲ ( N 2 ) ( v ) = T S ̲ ( N 1 ) ( v ) , I S ̲ ( N 2 ) ( v ) = I S ̲ ( N 1 ) ( v ) , F S ̲ ( N 2 ) ( v ) = F S ̲ ( N 1 ) ( v ) , T S ¯ ( N 2 ) ( v ) = T S ¯ ( N 1 ) ( v ) , I S ¯ ( N 2 ) ( v ) = I S ¯ ( N 1 ) ( v ) , F S ¯ ( N 2 ) ( v ) = F S ¯ ( N 1 ) ( v ) .
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 = ( S N 1 , R M 1 , X Q 1 ) is a soft rough neutrosophic forest if and only if there exist a soft rough neutrosophic spanning subgraph H = ( S N 1 , R M 2 , X Q 2 ) is a forest such that v i j G H
T R ̲ ( M 1 ) ( v i j ) < T C O N N H ̲ ( v i , v j ) , I R ̲ ( M 1 ) ( v i j ) > I C O N N H ̲ ( v i , v j ) , F R ̲ ( M 1 ) ( v i j ) > F C O N N H ̲ ( v i , v j ) , T R ¯ ( M 1 ) ( v i j ) < T C O N N H ¯ ( v i , v j ) , I R ¯ ( M 1 ) ( v i j ) > I C O N N H ¯ ( v i , v j ) , F R ¯ ( M 1 ) ( v i j ) > F C O N N H ¯ ( v i , v j ) .
A soft rough neutrosophic influence graph G = ( S N 1 , R M 1 , X Q 1 ) is a soft rough neutrosophic influence forest if and only if there exist a soft rough neutrosophic spanning subgraph H = ( S N 1 , R M 1 , X Q 2 ) is a forest such that v i v j k G H
T X ̲ ( Q 1 ) ( v i v j k ) < T I C O N N H ̲ ( v i , v k ) , T X ¯ ( Q 1 ) ( v i v j k ) < T I C O N N H ¯ ( v i , v k ) , I X ̲ ( Q 1 ) ( v i v j k ) > I I C O N N H ̲ ( v i , v k ) , I X ¯ ( Q 1 ) ( v i v j k ) > I I C O N N H ¯ ( v i , v k ) , F X ̲ ( Q 1 ) ( v i v j k ) > F I C O N N H ̲ ( v i , v k ) , F X ¯ ( Q 1 ) ( v i v j k ) > F I C O N N H ¯ ( v i , v k ) .
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 = ( S N 1 , R M 1 , X Q 1 ) is a soft rough neutrosophic tree if and only if there exist a soft rough neutrosophic spanning subgraph H = ( S N 1 , R M 2 , X Q 2 ) is a tree such that v i j G H
T R ̲ ( M 1 ) ( v i j ) < T C O N N H ̲ ( v i , v j ) , I R ̲ ( M 1 ) ( v i j ) > I C O N N H ̲ ( v i , v j ) , F R ̲ ( M 1 ) ( v i j ) > F C O N N H ̲ ( v i , v j ) , T R ¯ ( M 1 ) ( v i j ) < T C O N N H ¯ ( v i , v j ) , I R ¯ ( M 1 ) ( v i j ) > I C O N N H ¯ ( v i , v j ) , F R ¯ ( M 1 ) ( v i j ) > F C O N N H ¯ ( v i , v j ) .
A soft rough neutrosophic influence graph G = ( S N 1 , R M 1 , X Q 1 ) is a soft rough neutrosophic influence tree if and only if there exist a soft rough neutrosophic spanning subgraph H = ( S N 1 , R M 1 , X Q 2 ) is a tree such that v i v j k G H
T X ̲ ( Q 1 ) ( v i v j k ) < T I C O N N H ̲ ( v i , v k ) , T X ¯ ( Q 1 ) ( v i v j k ) < T I C O N N H ¯ ( v i , v k ) , I X ̲ ( Q 1 ) ( v i v j k ) > I I C O N N H ̲ ( v i , v k ) , I X ¯ ( Q 1 ) ( v i v j k ) > I I C O N N H ¯ ( v i , v k ) , F X ̲ ( Q 1 ) ( v i v j k ) > F I C O N N H ̲ ( v i , v k ) , F X ¯ ( Q 1 ) ( v i v j k ) > F I C O N N H ¯ ( v i , v k ) .
Definition 33.
Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph, an edge v i j is a bridge if edge v i j is a bridge in both underlying graphs of G ̲ and G ¯ . Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph, an edge v i j is a soft rough neutrosophic bridge if v l m G
T C O N N G ̲ v i j ( v l , v m ) < T C O N N G ̲ ( v l , v m ) , T C O N N G ¯ v i j ( v l , v m ) < T C O N N G ¯ ( v l , v m ) , I C O N N G ̲ v i j ( v l , v m ) > I C O N N G ̲ ( v l , v m ) , I C O N N G ¯ v i j ( v l , v m ) > I C O N N G ¯ ( v l , v m ) , F C O N N G ̲ v i j ( v l , v m ) > F C O N N G ̲ ( v l , v m ) , F C O N N G ¯ v i j ( v l , v m ) > F C O N N G ¯ ( v l , v m ) ,
Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph, an edge v i j is an soft rough neutrosophic influence bridge if v l m G
T I C O N N G ̲ v i j ( v l , v m ) < T I C O N N G ̲ ( v l , v m ) , T I C O N N G ¯ v i j ( v l , v m ) < T I C O N N G ¯ ( v l , v m ) , I I C O N N G ̲ v i j ( v l , v m ) > I I C O N N G ̲ ( v l , v m ) , ; I I C O N N G ¯ v i j ( v l , v m ) > I I C O N N G ¯ ( v l , v m ) , F I C O N N G ̲ v i j ( v l , v m ) > F I C O N N G ̲ ( v l , v m ) , F I C O N N G ¯ v i j ( v l , v m ) > F I C O N N G ¯ ( v l , v m ) ,
Definition 34.
Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph, a vertex is a cutnode if a vertex v i is a cutnode in underlying graphs of G ̲ and G ¯ . Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph then a vertex v i in G is a soft rough neutrosophic cutnode if the deletion of v i from G reduces the strength of the connectedness from nodes v j v k V ̲ , V ¯
T C O N N G ̲ v i ( v j , v k ) < T C O N N G ̲ ( v j , v k ) , T C O N N G ¯ v i ( v j , v k ) < T C O N N G ¯ ( v j , v k ) , I C O N N G ̲ v i ( v j , v k ) > I C O N N G ̲ ( v j , v k ) , I C O N N G ¯ v i ( v j , v k ) > I C O N N G ¯ ( v j , v k ) , F C O N N G ̲ v i ( v j , v k ) > F C O N N G ̲ ( v j , v k ) , F C O N N G ¯ v i ( v j , v k ) > F C O N N G ¯ ( v j , v k ) .
Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph then a vertex v i in G is an neutrosophic influence cutnode if the deletion of v i from G reduces the influence strength of the connectedness from v j v k V ̲ , V ¯
T I C O N N G ̲ v i ( v j , v k ) < T I C O N N G ̲ ( v j , v k ) , T I C O N N G ¯ v i ( v j , v k ) < T I C O N N G ¯ ( v j , v k ) , I I C O N N G ̲ v i ( v j , v k ) > I I C O N N G ̲ ( v j , v k ) , I I C O N N G ¯ v i ( v j , v k ) > I I C O N N G ¯ ( v j , v k ) , F I C O N N G ̲ v i ( v j , v k ) > F I C O N N G ̲ ( v j , v k ) , F I C O N N G ¯ v i ( v j , v k ) > F I C O N N G ¯ ( v j , v k ) ,
Definition 35.
Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph. A pair v i v j k is called a cutpair if and only if v i v j k is a cutpair in both supporting influence graph of G ̲ and G ¯ . That is after removing the pair v i v j k there is no path from v i to v k in both supporting influence graph of G ̲ and G ¯ . Let G = ( S N , R M , X Q ) be a soft rough neutrosophic influence graph. A pair v i v j k is called a soft rough neutrosophic cutpair if and only if if deleting the pair v i v j k reduces the connectedness from v i to v k in both graph G ̲ and G ¯ . That is,
T C O N N G ̲ v i v j k ( v i , v k ) < T C O N N G ̲ ( v i , v k ) , T I C O N N G ¯ v i v j k ( v i , v k ) < T I C O N N G ¯ ( v i , v k ) , I C O N N G ̲ v i v j k ( v i , v k ) > I C O N N G ̲ ( v i , v k ) , I I C O N N G ¯ v i v j k ( v i , v k ) > I I C O N N G ¯ ( v i , v k ) , F C O N N G ̲ v i v j k ( v i , v k ) > F C O N N G ̲ ( v i , v k ) , F I C O N N G ¯ v i v j k ( v i , v k ) > F I C O N N G ¯ ( v i , v k ) ,
A soft rough neutrosophic influence cutpair v i v j k is a pair in a soft rough neutrosophic influence graph G = ( S N , R M , X Q ) if there is spanning influence subgraph H = G v i v j k reduces the strength of the influence connectedness from v i to v k . That is,
T I C O N N G ̲ v i v j k ( v i , v k ) < T I C O N N G ̲ ( v i , v k ) , T I C O N N G ¯ v i v j k ( v i , v k ) < T I C O N N G ¯ ( v i , v k ) , I I C O N N G ̲ v i v j k ( v i , v k ) > I I C O N N G ̲ ( v i , v k ) , I I C O N N G ¯ v i v j k ( v i , v k ) > I I C O N N G ¯ ( v i , v k ) , F I C O N N G ̲ v i v j k ( v i , v k ) > F I C O N N G ̲ ( v i , v k ) , F I C O N N G ¯ v i v j k ( v i , v k ) > F I C O N N G ¯ ( v i , v k ) ,
Definition 36.
An edge v i j in soft rough neutrosophic influence graph G is called strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) F C O N N G ¯ v i j ( v i , v j ) .
A pair v i v j k in soft rough neutrosophic influence graph G is called strong pair if
T X ̲ ( Q ) ( v i v j k ) T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) F I C O N N G ¯ v i v j k ( v i , v k ) .
Definition 37.
An edge v i j in soft rough neutrosophic influence graph G is called α strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) > T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) > T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) < I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) < I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) < F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) < F C O N N G ¯ v i j ( v i , v j ) .
A pair v i v j k in soft rough neutrosophic influence graph G is called α strong pair if
T X ̲ ( Q ) ( v i v j k ) > T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) > T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) < I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) < I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) < F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) < F I C O N N G ¯ v i v j k ( v i , v k ) .
Definition 38.
An edge v i j in soft rough neutrosophic influence graph G is called β strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) = T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) = T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) = I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) = I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) = F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) = F C O N N G ¯ v i j ( v i , v j ) .
A pair v i v j k in soft rough neutrosophic influence graph G is called β strong pair if
T X ̲ ( Q ) ( v i v j k ) = T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) = T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) = I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) = I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) = F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) = F I C O N N G ¯ v i v j k ( v i , v k ) .
Definition 39.
An edge v i j in soft rough neutrosophic influence graph G is called δ strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) < T C O N N G ̲ v i j ( v i , v j ) , T R ¯ ( M ) ( v i j ) < T C O N N G ¯ v i j ( v i , v j ) , I R ̲ ( M ) ( v i j ) > I C O N N G ̲ v i j ( v i , v j ) , I R ¯ ( M ) ( v i j ) > I C O N N G ¯ v i j ( v i , v j ) , F R ̲ ( M ) ( v i j ) > F C O N N G ̲ v i j ( v i , v j ) , F R ¯ ( M ) ( v i j ) > F C O N N G ¯ v i j ( v i , v j ) .
A pair v i v j k in soft rough neutrosophic influence graph G is called δ strong pair if
T X ̲ ( Q ) ( v i v j k ) < T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) < T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) > I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) > I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) > F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) > F I C O N N G ¯ v i v j k ( v i , v k ) .
Definition 40.
A δ strong soft rough neutrosophic edge v i j is called a δ strong soft rough neutrosophic edge if
T R ̲ ( M ) ( v i j ) > v l m E ̲ T R ̲ ( M ) ( v l m ) , T R ¯ ( M ) ( v i j ) > v l m E ¯ T R ¯ ( M ) ( v l m ) , I R ̲ ( M ) ( v i j ) < v l m E ̲ I R ̲ ( M ) ( v l m ) , I R ¯ ( M ) ( v i j ) < v l m E ¯ I R ¯ ( M ) ( v l m ) , F R ̲ ( M ) ( v i j ) < v l m E ̲ F R ̲ ( M ) ( v l m ) , F R ¯ ( M ) ( v i j ) < v l m E ¯ F R ¯ ( M ) ( v l m ) .
A δ strong pair v i v j k is called a δ strong pair if
T R ̲ ( M ) ( v i j ) > v l m E ̲ T R ̲ ( M ) ( v l m ) , T R ¯ ( M ) ( v i j ) > v l m E ¯ T R ¯ ( M ) ( v l m ) , I R ̲ ( M ) ( v i j ) < v l m E ̲ I R ̲ ( M ) ( v l m ) , I R ¯ ( M ) ( v i j ) < v l m E ¯ I R ¯ ( M ) ( v l m ) , F R ̲ ( M ) ( v i j ) < v l m E ̲ F R ̲ ( M ) ( v l m ) , F R ¯ ( M ) ( v i j ) < v l m E ¯ F R ¯ ( M ) ( v l m ) .
A δ strong pair v i v j k is called a δ strong pair if v i v j k v l v m n
T X ̲ ( Q ) ( v i v j k ) > v l v m n I ̲ T X ̲ ( Q ) ( v l v m n ) , T X ¯ ( Q ) ( v i v j k ) > v l v m n I ¯ T X ¯ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < v l v m n I ̲ I X ̲ ( Q ) ( v l v m n ) , I X ¯ ( Q ) ( v i v j k ) < v l v m n I ̲ I X ¯ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < v l v m n I ̲ F X ̲ ( Q ) ( v l v m n ) , F X ¯ ( Q ) ( v i v j k ) < v l v m n I ̲ F X ¯ ( Q ) ( v l v m n ) .
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 = { v 1 v 32 , v 1 v 43 , v 2 v 13 , v 3 v 32 , v 4 v 13 }⊆ V ^ and P = { a 1 a 34 , a 3 a 24 , a 4 a 12 }⊆ A ^ . Then a full soft set X on I (from P to I) can be defined in Table 15 as follows:
Let Q = {( v v 32 , 0.3 , 0.0 , 0.0 ),( v v 43 , 0.2 , 0.0 , 0.0 ),( v 2 v 13 , 0.1 , 0.0 , 0.0 ),( v 3 v 32 , 0.2 , 0.0 , 0.0 ),( v 4 v 13 , 0.3 , 0.0 , 0.0 } be a neutrosophic set on I. Then from Equation (3) of Definition 4, we have
X ¯ ( Q ) = { ( v 1 v 32 , 0.3 , 0.0 , 0.0 ) , ( v 1 v 43 , 0.2 , 0.0 , 0.0 ) , ( v 2 v 13 , 0.3 , 0.0 , 0.0 ) , ( v 3 v 32 , 0.3 , 0.0 , 0.0 ) , ( v 4 v 13 , 0.3 , 0.0 , 0.0 ) } , X ̲ ( Q ) = { ( v 1 v 32 , 0.2 , 0.0 , 0.0 ) , ( v 1 v 43 , 0.2 , 0.0 , 0.0 ) , ( v 2 v 13 , 0.1 , 0.0 , 0.0 ) , ( v 3 v 32 , 0.2 , 0.0 , 0.0 ) , ( v 4 v 13 , 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, as shown in Figure 8. Hence, G = ( G ¯ , G ̲ ) is SRNIG. Hence G is a tree, v 3 is a cutvertex, v 13 is a bridge, v 3 v 32 is a cutpair.
Theorem 4.
G is a soft rough neutrosophic influence forest if and only if in any cycle of G , there is a pair v i v j k such that
T X ̲ ( Q ) ( v i v j k ) < T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) < T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) > I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) > I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) > F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) > F I C O N N G ¯ v i v j k ( v i , v k ) .
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
T X ̲ ( Q ) ( v i v j k ) T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) F I C O N N G ¯ v i v j k ( v i , v k ) ,
for every pair v i v j k of C.
Therefore, v i v j k is the path within the most influence strength from v i to v k . Let v i v j k be a pair such that
T X ̲ ( Q ) ( v i v j k ) > v l v m n I ̲ T X ̲ ( Q ) ( v l v m n ) , T X ¯ ( Q ) ( v i v j k ) > v l v m n I ¯ T X ¯ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < v l v m n I ̲ I X ̲ ( Q ) ( v l v m n ) , I X ¯ ( Q ) ( v i v j k ) < v l v m n I ̲ I X ¯ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < v l v m n I ̲ F X ̲ ( Q ) ( v l v m n ) , F X ¯ ( Q ) ( v i v j k ) < v l v m n I ̲ F X ¯ ( Q ) ( v l v m n ) ,
in C. Then remaining part of C is a path with the most influence strength from v i to v j k . 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 = ( S N , R M , X Q 1 ) be a soft rough neutrosophic influence cycle. Then there exist at least two distinct edge and two distinct pair such that
R ̲ ( M ) ( v i j ) = v l m E ̲ v i j T R ̲ ( M ) ( v l m ) , v l m E ̲ v i j I R ̲ ( M ) ( v l m ) , v l m E ̲ v i j F R ̲ ( M ) ( v l m ) , R ¯ ( M ) ( v i j ) = v l m E ¯ v i j T R ¯ ( M ) ( v l m ) , v l m E ¯ v i j I R ¯ ( M ) ( v l m ) , v l m E ¯ v i j F R ¯ ( M ) ( v l m ) , X ̲ ( Q ) ( v i v j k ) = v l v m n I ̲ v i v j k T X ̲ ( Q ) ( v l v m n ) , v l v m n I ̲ v i v j k I X ̲ ( Q ) ( v l v m n ) , v l v m n I ̲ v i v j k F X ̲ ( Q ) ( v l v m n ) , X ¯ ( Q ) ( v i v j k ) = v l v m n I ¯ v i v j k T X ¯ ( Q ) ( v l v m n ) , v l v m n I ¯ v i v j k I X ¯ ( Q ) ( v l v m n ) , v l v m n I ¯ v i v j k F X ¯ ( Q ) ( v l v m n ) .
Let H = ( S N , R M , X Q 2 ) be a spanning soft rough neutrosophic influence tree in G . Then there exists a path from v i to v k not involving v i v j k such that E 1 E 2 ={( v i v j k )}. Hence there does not exist a path in H from v i to v k such that
T X ̲ ( Q 2 ) ( v i v j k ) T I C O N N G ̲ ( v i , v k ) , T X ¯ ( Q 2 ) ( v i v j k ) T I C O N N G ¯ ( v i , v k ) , I X ̲ ( Q 2 ) ( v i v j k ) I I C O N N G ̲ ( v i , v k ) , I X ¯ ( Q 2 ) ( v i v j k ) I I C O N N G ¯ ( v i , v k ) , F X ̲ ( Q 2 ) ( v i v j k ) F I C O N N G ̲ ( v i , v k ) , F X ¯ ( Q 2 ) ( v i v j k ) F I C O N N G ¯ ( v i , v k ) .
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 v i v j k I ̲ and v i v j k I ¯ , we have a soft rough neutrosophic spanning influence subrgraph H = ( S N , R M , X Q 2 ) which is tree and X ̲ ( Q 2 ) ( v i v j k )=0, X ¯ ( Q 2 ) ( v i v j k )=0 such that v i v l m v l v m n
T X ̲ ( Q 2 ) ( v i v j k ) T I C O N N H ̲ ( v i , v k ) , T X ¯ ( Q 2 ) ( v i v j k ) T I C O N N G ¯ ( v i , v k ) , I X ̲ ( Q 2 ) ( v i v j k ) I I C O N N G ̲ ( v i , v k ) , I X ¯ ( Q 2 ) ( v i v j k ) I I C O N N G ¯ ( v i , v k ) , F X ̲ ( Q 2 ) ( v i v j k ) F I C O N N G ̲ ( v i , v k ) , F X ¯ ( Q 2 ) ( v i v j k ) F I C O N N G ¯ ( v i , v k ) ,
v l v m n I ̲ v i v j k and v l v m n I ¯ v i v j k
T X ̲ ( Q 2 ) ( v i v j k ) = v l v m n I ̲ T X ̲ ( Q 1 ) ( v l v m n ) , T X ¯ ( Q 2 ) ( v i v j k ) = v l v m n I ¯ T X ¯ ( Q 1 ) ( v l v m n ) , I X ̲ ( Q 2 ) ( v i v j k ) = v l v m n I ̲ I X ̲ ( Q 1 ) ( v l v m n ) , I X ¯ ( Q 2 ) ( v i v j k ) = v l v m n I ̲ I X ¯ ( Q 1 ) ( v l v m n ) , F X ̲ ( Q 2 ) ( v i v j k ) = v l v m n I ̲ F X ̲ ( Q 1 ) ( v l v m n ) , F X ¯ ( Q 2 ) ( v i v j k ) = v l v m n I ̲ F X ¯ ( Q 1 ) ( v l v m n ) .
Therefore,
X ̲ ( Q ) ( v i v j k ) = ( v l v m n I ̲ v i v j k T X ̲ ( Q ) ( v l v m n ) , v l v m n I ̲ v i v j k I X ̲ ( Q ) ( v l v m n ) , v l v m n I ̲ v i v j k F X ̲ ( Q ) ( v l v m n ) ) , X ¯ ( Q ) ( v i v j k ) = ( v l v m n I ¯ v i v j k T X ¯ ( Q ) ( v l v m n ) , v l v m n I ¯ v i v j k I X ¯ ( Q ) ( v l v m n ) , v l v m n I ¯ v i v j k F X ¯ ( Q ) ( v l v m n ) ) .
where v i v j k v l v m n not uniquely. Therefore G is a soft rough neutrosophic influence cycle.
Theorem 7.
If
T X ̲ ( Q ) ( v i v j k ) > T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) > T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) < I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) < I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) < F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) < F I C O N N G ¯ v i v j k ( v i , v k ) ,
in a soft rough neutrosophic graph. Then v i v j k is a cutpair in soft rough neutrosophic influence graph G .
Proof. 
Suppose v i v j k is not a cutapir in soft rough neutrosophic influence graph, then
T I C O N N G ̲ v i , v k ( v i , v k ) = T I C O N N G ̲ ( v i , v k ) , T I C O N N G ¯ v i , v k ( v i , v k ) = T I C O N N G ¯ ( v l v m n ) , I I C O N N G ̲ v i , v k ( v i , v k ) = I I C O N N G ̲ ( v i , v k ) , I I C O N N G ¯ v i , v k ( v i , v k ) = I I C O N N G ¯ ( v l v m n ) , F I C O N N G ̲ v i , v k ( v i , v k ) = F I C O N N G ̲ ( v i , v k ) , F I C O N N G ¯ v i , v k ( v i , v k ) = F I C O N N G ¯ ( v l v m n ) .
Since,
T X ̲ ( Q ) ( v i , v k ) T I C O N N G ̲ ( v i , v k ) , T X ¯ ( Q ) ( v i , v k ) T I C O N N G ¯ ( v l v m n ) , I X ̲ ( Q ) ( v i , v k ) I I C O N N G ̲ ( v i , v k ) , I X ¯ ( Q ) ( v i , v k ) I I C O N N G ¯ ( v l v m n ) , F X ̲ ( Q ) ( v i , v k ) F I C O N N G ̲ ( v i , v k ) , F X ¯ ( Q ) ( v i , v k ) F I C O N N G ¯ ( v l v m n ) .
Therefore,
T I C O N N G ̲ v i , v k ( v i , v k ) T X ̲ ( Q ) ( v i , v k ) , T I C O N N G ¯ v i , v k ( v i , v k ) T X ¯ ( Q ) ( ( v i , v k ) ) , I I C O N N G ̲ v i , v k ( v i , v k ) I X ̲ ( Q ) ( v i , v k ) , I I C O N N G ¯ v i , v k ( v i , v k ) I X ¯ ( Q ) ( ( v i , v k ) ) , F I C O N N G ̲ v i , v k ( v i , v k ) F X ̲ ( Q ) ( v i , v k ) , F I C O N N G ¯ v i , v k ( v i , v k ) F X ¯ ( Q ) ( ( v i , v k ) ) ,
which is a contradiction. Hence, it is proved. ☐
Theorem 8.
If
T X ̲ ( Q ) ( v i v j k ) > T X ̲ ( Q ) ( v l v m n ) , T X ̲ ( Q ) ( v i v j k ) > T X ̲ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < I X ̲ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < I X ̲ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < F X ̲ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < F X ̲ ( Q ) ( v l v m n ) ,
for some v i v j k among all cycles in soft rough neutrosophic influence graph G . Then
T X ̲ ( Q ) ( v i v j k ) > T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) > T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) < I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) < I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) < F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) < F I C O N N G ¯ v i v j k ( v i , v k ) .
Proof. 
Since
T I C O N N G ̲ v i v j k ( v i v j k ) T I C O N N G ̲ ( v i v j k ) , T I C O N N G ¯ v i v j k ( v i v j k ) T I C O N N G ¯ ( ( v i v j k ) ) , I I C O N N G ̲ v i v j k ( v i v j k ) I I C O N N G ̲ ( v i v j k ) , I I C O N N G ¯ v i v j k ( v i v j k ) I I C O N N G ¯ ( ( v i v j k ) ) , F I C O N N G ̲ v i v j k ( v i v j k ) F I C O N N G ̲ ( v i v j k ) , F I C O N N G ¯ v i v j k ( v i v j k ) F I C O N N G ¯ ( ( v i v j k ) ) .
Therefore, there exists a path from v i to v k not involving ( v i v j k ) such that
T I C O N N G ̲ v i v j k ( v i v j k ) T X ̲ ( Q ) ( v i v j k ) , T I C O N N G ¯ v i v j k ( v i v j k ) T X ¯ ( Q ) ( ( v i v j k ) ) , I I C O N N G ̲ v i v j k ( v i v j k ) I X ̲ ( Q ) ( v i v j k ) , I I C O N N G ¯ v i v j k ( v i v j k ) I X ¯ ( Q ) ( ( v i v j k ) ) , F I C O N N G ̲ v i v j k ( v i v j k ) F X ̲ ( Q ) ( v i v j k ) , F I C O N N G ¯ v i v j k ( v i v j k ) F X ¯ ( Q ) ( ( v i v j k ) ) ,
This along with v i v j k is a cycle and v i v j k is least value. ☐
Theorem 9.
If v i v j k is a soft rough neutrosophic influence cutpair in soft rough neutrosophic influence graph G . Then
T X ̲ ( Q ) ( v i v j k ) > T X ̲ ( Q ) ( v l v m n ) , T X ̲ ( Q ) ( v i v j k ) > T X ̲ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < I X ̲ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < I X ̲ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < F X ̲ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < F X ̲ ( Q ) ( v l v m n ) ,
for some v i v j k among all cycles of G .
Proof. 
Suppose on contrary in a cycle, we
T X ̲ ( Q ) ( v i v j k ) > T X ̲ ( Q ) ( v l v m n ) , T X ̲ ( Q ) ( v i v j k ) > T X ̲ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < I X ̲ ( Q ) ( v l v m n ) , I X ̲ ( Q ) ( v i v j k ) < I X ̲ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < F X ̲ ( Q ) ( v l v m n ) , F X ̲ ( Q ) ( v i v j k ) < F X ̲ ( Q ) ( v l v m n ) .
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 X Q for previously deleted pairs. So v i v j k is not a cutpair. This is a contradiction to our assumption. Hence v i v j k is not a pair with the least value among all cycle. ☐
Theorem 10.
If G = ( S N 1 , R M 1 , X Q 1 ) is a soft rough neutrosophic forest, then the pairs of neutrosophic spanning subgraph H = ( S N 1 , R M 1 , X Q 2 ) such that
T X ̲ ( Q 1 ) ( v i v j k ) < T I C O N N H ̲ ( v i , v k ) , T X ¯ ( Q 1 ) ( v i v j k ) < T I C O N N H ¯ ( v i , v k ) , I X ̲ ( Q 1 ) ( v i v j k ) > I I C O N N H ̲ ( v i , v k ) , I X ¯ ( Q 1 ) ( v i v j k ) > I I C O N N H ¯ ( v i , v k ) , F X ̲ ( Q 1 ) ( v i v j k ) > F I C O N N H ̲ ( v i , v k ) , F X ¯ ( Q 1 ) ( v i v j k ) > F I C O N N H ¯ ( v i , v k ) ,
are exactly the cutpairs of G .
Theorem 11.
A soft rough neutrosophic influence graph G is a cycle. Then an edge v j k 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.
1
For a pair v i v j k I ̲ I ¯
T X ̲ ( Q ) ( v i v j k ) > T I C O N N G ̲ v i v j k ( v i , v k ) , T X ¯ ( Q ) ( v i v j k ) > T I C O N N G ¯ v i v j k ( v i , v k ) , I X ̲ ( Q ) ( v i v j k ) < I I C O N N G ̲ v i v j k ( v i , v k ) , I X ¯ ( Q ) ( v i v j k ) < I I C O N N G ¯ v i v j k ( v i , v k ) , F X ̲ ( Q ) ( v i v j k ) < F I C O N N G ̲ v i v j k ( v i , v k ) , F X ¯ ( Q ) ( v i v j k ) < F I C O N N G ¯ v i v j k ( v i , v k ) .
2
v i v j k 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 C 1 , C 2 , C 3 , C 4 , C 5 and C 6 . Initially, he takes C 1 and extends his business one by one. Assume A is set of the parameters, consisting of element a 1 = job, a 2 = economy above average, a 3 = safety, a 4 = other.
Let S be a full soft set from A to parameter set V, as shown in Table 16.
Suppose N={( C 1 , 0.8 , 0.6 , 0.7 ),( C 2 , 0.9 , 0.5 , 0.65 ),( C 3 , 0.75 , 0.6 , 0.65 ),( C 4 , 1.0 , 0.55 , 0.85 ),( C 5 , 0.95 , 0.63 , 0.8 ),
( C 6 , 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.
S N = ( S ̲ ( N ) , S ¯ ( N ) ) is a full soft rough set in full soft approximation space ( V , S ) where
S ¯ ( N ) = { ( C 1 , 0.90 , 0.50 , 0.65 ) , ( C 2 , 0.90 , 0.50 , 0.65 ) , ( C 3 , 0.90 , 0.55 , 0.65 ) , ( C 4 , 1.00 , 0.55 , 0.65 ) , ( C 5 , 0.95 , 0.55 , 0.65 ) , ( C 6 , 0.9 , 0.55 , 0.65 ) } , S ̲ ( N ) = { ( C 1 , 0.75 , 0.65 , 0.95 ) , ( C 2 , 0.75 , 0.65 , 0.95 ) , ( C 3 , 0.75 , 0.65 , 0.95 ) , ( C 4 , 0.75 , 0.65 , 0.95 ) , ( C 5 , 0.75 , 0.65 , 0.95 ) , ( C 6 , 0.75 , 0.65 , 0.95 ) } .
Let E={ C 12 , C 14 , C 15 , C 23 , C 26 , C 34 , C 35 , C 45 , C 46 , C 56 }⊆ V ˜ = V × V and L={ a 14 , a 21 , a 34 , a 42 }⊆ A ˜ = A × A .
A full soft relation R on E (from L to E) can be defined as shown in Table 17.
Let M={( C 12 , 0.74 , 0.5 , 0.62 ),( C 14 , 0.75 , 0.45 , 0.63 ),( C 15 , 0.74 , 0.54 , 0.61 ),( C 23 , 0.72 , 0.48 , 0.65 ),( C 26 , 0.71 , 0.49 , 0.64 ),( C 34 , 0.72 , 0.53 , 0.64 ),( C 35 , 0.73 , 0.52 , 0.63 ),( C 45 , 0.7 , 0.51 , 0.61 ),( C 46 , 0.74 , 0.55 , 0.6 ),( C 56 , 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.
R M = ( R ̲ M , R ¯ M ) is a soft neutrosophic rough relation, where
R ¯ M = { ( C 12 , 0.75 , 0.45 , 0.61 ) , ( C 14 , 0.75 , 0.45 , 0.61 ) , ( C 15 , 0.75 , 0.45 , 0.61 ) , ( C 23 , 0.75 , 0.45 , 0.61 ) , ( C 26 , 0.75 , 0.45 , 0.61 ) , ( C 34 , 0.75 , 0.45 , 0.61 ) , ( C 35 , 0.74 , 0.47 , 0.61 ) , ( C 45 , 0.74 , 0.47 , 0.6 ) , ( C 46 , 0.74 , 0.47 , 0.6 ) , ( C 56 , 0.74 , 0.47 , 0.61 ) } , R ̲ M = { ( C 12 , 0.71 , 0.54 , 0.65 ) , ( C 14 , 0.71 , 0.54 , 0.65 ) , ( C 15 , 0.71 , 0.54 , 0.65 ) , ( C 23 , 0.71 , 0.54 , 0.65 ) , ( C 26 , 0.71 , 0.54 , 0.65 ) , ( C 34 , 0.71 , 0.54 , 0.65 ) , ( C 35 , 0.71 , 0.54 , 0.64 ) , ( C 45 , 0.70 , 0.55 , 0.64 ) , ( C 46 , 0.70 , 0.55 , 0.64 ) , ( C 56 , 0.71 , 0.54 , 0.64 ) } .
Let I={ C 1 C 15 , C 1 C 23 , C 1 C 35 , C 2 C 34 , C 3 C 14 , C 3 C 26 , C 3 C 45 , C 4 C 23 , C 4 C 45 , C 4 C 46 , C 5 C 23 , C 5 C 34 , C 5 C 46 , C 6 C 12 , C 6 C 15 }⊆ V ^ = V × E and F={ a 1 a 42 , a 2 a 14 , a 3 a 34 , a 4 a 21 , a 4 a 42 }⊆ A ^ = A × L .
A full soft relation X on I (from F to I) can be defined in Table 18 as follows:
Let Q = { ( C 1 C 15 , 0.7 , 0.43 , 0.58 ) , ( C 1 C 23 , 0.65 , 0.39 , 0.54 ) , ( C 1 C 35 , 0.66 , 0.37 , 0.56 ) , ( C 2 C 34 , 0.68 , 0.38 , 0.59 ) , ( C 3 C 14 , 0.6 , 0.4 , 0.6 ) , ( C 3 C 26 , 0.62 , 0.42 , 0.58 ) , ( C 3 C 45 , 0.64 , 0.45 , 0.54 ) , ( C 4 C 23 , 0.7 , 0.45 , 0.60 ) , ( C 4 C 45 , 0.7 , 0.36 , 0.48 ) , ( C 4 C 46 , 0.68 , 0.35 , 0.5 ) , ( C 5 C 23 , 0.69 , 0.45 , 0.54 ) , ( C 5 C 34 , 0.65 , 0.42 , 0.58 ) , ( C 5 C 46 , 0.64 , 0.41 , 0.59 ) , ( C 6 C 12 , 0.63 , 0.4 , 0.6 ) , ( C 6 C 15 , 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.
X Q = ( X ̲ Q , X ¯ Q ) is a soft neutrosophic rough influence, where
X ¯ Q = { ( C 1 C 15 , 0.70 , 0.37 , 0.50 ) , ( C 1 C 23 , 0.70 , 0.37 , 0.50 ) , ( C 1 C 35 , 0.70 , 0.37 , 0.50 ) , ( C 2 C 34 , 0.70 , 0.37 , 0.50 ) , ( C 3 C 14 , 0.69 , 0.39 , 0.50 ) , ( C 3 C 26 , 0.69 , 0.39 , 0.50 ) , ( C 3 C 45 , 0.70 , 0.37 , 0.50 ) , ( C 4 C 23 , 0.7 , 0.45 , 0.60 ) , ( C 4 C 45 , 0.70 , 0.35 , 0.48 ) , ( C 4 C 46 , 0.70 , 0.35 , 0.48 ) , ( C 5 C 23 , 0.69 , 0.39 , 0.50 ) , ( C 5 C 34 , 0.69 , 0.39 , 0.50 ) , ( C 5 C 46 , 0.70 , 0.37 , 0.50 ) , ( C 6 C 12 , 0.69 , 0.39 , 0.50 ) , ( C 6 C 15 , 0.69 , 0.39 , 0.50 ) } , X ̲ Q = { ( C 1 C 15 , 0.60 , 0.43 , 0.60 ) , ( C 1 C 23 , 0.60 , 0.43 , 0.60 ) , ( C 1 C 35 , 0.64 , 0.43 , 0.59 ) , ( C 2 C 34 , 0.60 , 0.43 , 0.60 ) , ( C 3 C 14 , 0.60 , 0.43 , 0.60 ) , ( C 3 C 26 , 0.60 , 0.43 , 0.60 ) , ( C 3 C 45 , 0.64 , 0.45 , 0.59 ) , ( C 4 C 23 , 0.7 , 0.45 , 0.60 ) , ( C 4 C 45 , 0.64 , 0.45 , 0.59 ) , ( C 4 C 46 , 0.64 , 0.45 , 0.59 ) , ( C 5 C 23 , 0.60 , 0.45 , 0.60 ) , ( C 5 C 34 , 0.60 , 0.45 , 0.60 ) , ( C 5 C 46 , 0.64 , 0.45 , 0.59 ) , ( C 6 C 12 , 0.60 , 0.43 , 0.60 ) , ( C 6 C 15 , 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 C 1 to C 6 . The paths are
P 1 : C 1 , C 5 , C 2 , C 3 , C 6 ,
P 2 : C 1 , C 4 , C 5 , C 6 ,
P 3 : C 1 , C 3 , C 5 , C 2 , C 6
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):
Score Function ( C i ) = ( T S ̲ ( N ) ( C i ) + T S ¯ ( N ) ( C i ) + T R ̲ ( M ) ( C i j ) + T R ¯ ( M ) ( C i j ) + T X ̲ ( Q ) ( C i C j k ) + T X ¯ ( Q ) ( C i C j k ) , I S ̲ ( N ) ( C i ) I S ¯ ( N ) ( C i ) + I R ̲ ( M ) ( C i j ) I R ¯ ( M ) ( C i j ) + I X ̲ ( Q ) ( C i C j k ) I X ¯ ( Q ) ( C i C j k ) , F S ̲ ( N ) ( C i ) F S ¯ ( N ) ( C i ) + F R ̲ ( M ) ( C i j ) F R ¯ ( M ) ( C i j ) + F X ̲ ( Q ) ( C i C j k ) F X ¯ ( Q ) ( C i C j k ) ) .
For each C i , the score values of C i is calculated directly and as shown in Table 19.
So, he chooses the path P 3 : C 1 , C 3 , C 5 , C 2 , C 6 . 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 C 1 to C n .
11.  Choose that path which has maximum membership, minimum
      indeterminacy and falsity value. If i > 1 , than calculate the
      score values of each C i , choose that C i which has maximum
      membership and come immediately after C 1 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 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.

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. [Google Scholar]
  2. Wang, H.; Smarandache, F.; Zhang, Y.; Sunderraman, R. Single-valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
  3. Ye, J. Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment. Int. J. Gen. Syst. 2013, 42, 386–394. [Google Scholar] [CrossRef]
  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. [Google Scholar]
  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. [Google Scholar]
  6. Molodtsov, D.A. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  7. Babitha, K.V.; Sunil, J.J. Soft set relations and functions. Comput. Math. Appl. 2010, 60, 1840–1849. [Google Scholar] [CrossRef]
  8. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  9. Pawlak, Z. Rough Sets-Theoretical Aspects to Reasoning about Data; Kluwer Academic Publisher: Boston, MA, USA, 1991. [Google Scholar]
  10. Pawlak, Z.; Skowron, A. Rudiments of rough sets. Inf. Sci. 2007, 177, 3–27. [Google Scholar] [CrossRef]
  11. Pawlak, Z.; Skowron, A. Rough sets: Some extensions. Inf. Sci. 2007, 177, 28–40. [Google Scholar] [CrossRef] [Green Version]
  12. Pawlak, Z.; Skowron, A. Rough sets and Boolean reasoning. Inf. Sci. 2007, 177, 41–73. [Google Scholar] [CrossRef] [Green Version]
  13. Biswas, R.; Nanda, S. Rough groups and rough subgroups. Bull. Polish Acad. Sci. 2000, 42, 247–251. [Google Scholar]
  14. Davvaz, B. Roughness in rings. Inf. Sci. 2004, 164, 147–163. [Google Scholar] [CrossRef]
  15. Kuroki, N. Rough ideal in semigroup. Inf. Sci. 1997, 100, 139–163. [Google Scholar] [CrossRef]
  16. Shahzamanian, M.H.; Shirmohammadi, M.; Davvaz, B. Roughness in Cayley graphs. Inf. Sci. 2010, 180, 3362–3372. [Google Scholar] [CrossRef] [Green Version]
  17. Dubios, D.; Prade, H. Rough fuzzy, fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  19. Meng, D.; Zhang, X.; Qin, K. Soft rough fuzzy sets and soft fuzzy rough sets. Comput. Math. Appl. 2011, 62, 4635–4645. [Google Scholar] [CrossRef]
  20. Broumi, S.; Smarandache, F.; Dhar, M. Rough neutrosophic sets. Neutrosophic Sets Syst. 2014, 3, 62–67. [Google Scholar]
  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. [Google Scholar] [CrossRef]
  22. Kauffmann, A. Introduction a la Theorie Des Sous-Emsembles Flous; Masson et Cie: Paris, France, 1973; Volume 1. [Google Scholar]
  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. [Google Scholar]
  24. Mordeson, J.N.; Peng, C.S. Operations on fuzzy graphs. Inf. Sci. 1994, 79, 159–170. [Google Scholar] [CrossRef]
  25. Mathew, S.; Sunitha, M. Types of arcs in a fuzzy graph. Inf. Sci. 2009, 179, 1760–1768. [Google Scholar] [CrossRef]
  26. Mathew, S.; Sunitha, M. Strongest strong cycles, fuzzy graphs. IEEE Trans. Fuzzy Syst. 2013, 21, 1096–1104. [Google Scholar] [CrossRef]
  27. Gani, A.N.; Latha, S.R. On irregular fuzzy graphs. Appl. Math. Sci. 2012, 6, 517–523. [Google Scholar]
  28. Gani, A.N.; Radha, K. On regular fuzzy graphs. J. Phys. Sci. 2008, 12, 33–40. [Google Scholar]
  29. Gani, A.N.; Radha, K. The degree of a vertex in some fuzzy graphs. Int. J. Algorithms Comput. Math. 2009, 2, 107–116. [Google Scholar]
  30. Gani, A.N.; Begum, S.S. Degree, order, size in intuitionistic fuzzy graphs. Int. J. Algorithms Comput. Math. 2010, 3, 11–16. [Google Scholar]
  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. [Google Scholar]
  32. Akram, M.; Ashraf, A.; Sarwar, M. Novel applications of intuitionistic fuzzy digraphs in decision support systems. Sci. World J. 2014. [Google Scholar] [CrossRef] [PubMed]
  33. Akram, M.; Nawaz, S. Fuzzy soft graphs with applications. J. Intell. Fuzzy Syst. 2016, 30, 3619–3632. [Google Scholar] [CrossRef]
  34. Akram, M.; Shahzadi, S. Novel intuitionistic fuzzy soft multiple-attribute decision-making methods. Neural Comput. Appl. 2016. [Google Scholar] [CrossRef]
  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. [Google Scholar]
  36. Akram, M.; Dudek, W.A. Regular bipolar fuzzy graphs. Neural Comput. Appl. 2012, 21, 197–205. [Google Scholar] [CrossRef]
  37. Dinesh, T. Fuzzy incidence graph and introduction. Adv. Fuzzy Sets Syst. 2016, 21, 33–48. [Google Scholar] [CrossRef]
  38. Mordeson, J.N. Fuzzy incidence graphs. Adv. Fuzzy Sets Syst. 2016, 21, 1–13. [Google Scholar] [CrossRef]
  39. Mathew, S.; Mordeson, J.N. Fuzzy influence graphs. New Math. Nat. Comput. 2017, 13, 311–325. [Google Scholar] [CrossRef]
  40. Zafar, F.; Akram, M. A novel decision-making method based on rough fuzzy information. Int. J. Fuzzy Syst. 2018, 20, 1000–1014. [Google Scholar] [CrossRef]
  41. Akram, M.; Zafar, F. Rough fuzzy digraphs with application. J. Appl. Math. Comput. 2018. [Google Scholar] [CrossRef]
  42. Akram, M.; Shumaiza; Arshad, M. A new approach based on fuzzy rough digraphs for decision-making. J. Intell. Fuzzy Syst. 2018. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  44. Zhan, J.; Malik, H.M.; Akram, M. Novel decision-making algorithms based on intuitionistic fuzzy rough environment. Int. J. Mach. Learn. Cybern. 2018. [Google Scholar] [CrossRef]
  45. Ishfaq, N.; Sayed, S.; Akram, M.; Smarandache, F. Notions of rough neutrosophic digraphs. Mathematics 2018, 6, 18. [Google Scholar] [CrossRef]
  46. Akram, M.; Malik, H.M.; Shahzadi, S.; Smarandache, F. Neutrosophic soft rough graphs with application. Axioms 2018, 7, 14. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  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. [Google Scholar] [CrossRef]
  49. Maji, Q.K. Neutrosophic soft set. Ann. Fuzzy Math. Inform. 2013, 5, 157–168. [Google Scholar]
  50. Broumi, S.; Smarandache, F. Interval-valued neutrosophic soft rough sets. Int. J. Comput. Math. 2015. [Google Scholar] [CrossRef]
  51. Akram, M.; Shahzadi, S.; Smarandache, F. Multi-attribute decision-making method based on neutrosophic soft rough information. Axioms 2018, 7, 19. [Google Scholar] [CrossRef]
Figure 1. Soft rough neutrosophic graph G = ( G ̲ , G ¯ ) .
Figure 1. Soft rough neutrosophic graph G = ( G ̲ , G ¯ ) .
Mathematics 06 00125 g001
Figure 2. Soft rough neutrosophic cycle G = ( G ̲ , G ¯ ) .
Figure 2. Soft rough neutrosophic cycle G = ( G ̲ , G ¯ ) .
Mathematics 06 00125 g002
Figure 3. Soft rough neutrosophic graph G = ( G ̲ , G ¯ ) .
Figure 3. Soft rough neutrosophic graph G = ( G ̲ , G ¯ ) .
Mathematics 06 00125 g003
Figure 4. Soft rough neutrosophic graph G = ( G ̲ , G ¯ ) .
Figure 4. Soft rough neutrosophic graph G = ( G ̲ , G ¯ ) .
Mathematics 06 00125 g004
Figure 5. Lower Soft rough neutrosophic graph G ̲ = ( S ̲ ( N ) , R ̲ ( M ) , X ̲ ( Q ) ) .
Figure 5. Lower Soft rough neutrosophic graph G ̲ = ( S ̲ ( N ) , R ̲ ( M ) , X ̲ ( Q ) ) .
Mathematics 06 00125 g005
Figure 6. Upper Soft rough neutrosophic graph G ¯ = ( S ¯ ( N ) , R ¯ ( M ) , X ¯ ( Q ) ) .
Figure 6. Upper Soft rough neutrosophic graph G ¯ = ( S ¯ ( N ) , R ¯ ( M ) , X ¯ ( Q ) ) .
Mathematics 06 00125 g006
Figure 7. Soft rough neutrosophic influence graph G = ( G ̲ , G ¯ ) .
Figure 7. Soft rough neutrosophic influence graph G = ( G ̲ , G ¯ ) .
Mathematics 06 00125 g007
Figure 8. Soft rough neutrosophic influence graph G = ( G ̲ , G ¯ ) .
Figure 8. Soft rough neutrosophic influence graph G = ( G ̲ , G ¯ ) .
Mathematics 06 00125 g008
Figure 9. Soft rough neutrosophic influence graph G = ( G ̲ , G ¯ ) .
Figure 9. Soft rough neutrosophic influence graph G = ( G ̲ , G ¯ ) .
Mathematics 06 00125 g009
Figure 10. The flow chart of the application.
Figure 10. The flow chart of the application.
Mathematics 06 00125 g010
Table 1. Full soft set S.
Table 1. Full soft set S.
S b 1 b 2 b 3 b 4 b 5
a 1 00101
a 2 10100
a 3 01111
Table 2. Full soft set S.
Table 2. Full soft set S.
S b 1 b 2 b 3 b 4
a 1 1 1 0 1
a 2 0 0 1 1
a 3 1 1 1 1
Table 3. Full soft set R.
Table 3. Full soft set R.
R b 12 b 22 b 23 b 32 b 42
a 13 1 1 1 0 1
a 21 0 0 0 1 0
a 32 0 0 1 0 0
Table 4. Full soft set X.
Table 4. Full soft set X.
X b 1 b 22 b 1 b 23 b 1 b 32 b 1 b 42 b 3 b 12 b 3 b 22 b 3 b 42 b 4 b 12 b 4 b 22 b 4 b 23 b 4 b 32
a 1 a 32 0 1 0 0 0 0 0 0 0 1 0
a 2 a 13 0 0 0 0 0 1 1 1 1 1 1
a 3 a 21 0 1 0 0 0 0 0 0 0 0 1
Table 5. Full soft set S.
Table 5. Full soft set S.
S v 1 v 2 v 3 v 4 v 5 v 6
a 1 111110
a 2 001111
a 3 110011
Table 6. Full soft set R.
Table 6. Full soft set R.
R v 11 v 15 v 16 v 23 v 25 v 34 v 41 v 43 v 56 v 62 v 63
a 12 01111101100
a 13 11101010100
a 21 00000111011
a 23 00000010110
a 31 11011000010
Table 7. Full soft set S.
Table 7. Full soft set S.
S v 1 v 2 v 3 v 4
a 1 1111
a 2 0101
a 3 1011
a 4 1010
Table 8. Full soft set R.
Table 8. Full soft set R.
R v 13 v 32 v 24 v 41
a 13 1011
a 32 0100
a 43 1000
Table 9. Full soft set S.
Table 9. Full soft set S.
S v 1 v 2 v 3 v 4
a 1 1111
a 2 0101
a 3 1011
a 4 1010
Table 10. Full soft set R.
Table 10. Full soft set R.
R v 13 v 32 v 43
a 12 010
a 24 101
a 34 001
Table 11. Full soft set S.
Table 11. Full soft set S.
S v 1 v 2 v 3 v 4 v 5 v 6
a 1 111001
a 2 010011
a 3 101111
a 4 111111
Table 12. Full soft set R.
Table 12. Full soft set R.
R v 12 v 24 v 32 v 42 v 52 v 62
a 13 010001
a 24 010011
a 34 101111
a 41 111111
Table 13. Full soft set X.
Table 13. Full soft set X.
X v 1 v 24 v 1 v 32 v 1 v 42 v 1 v 52 v 1 v 62 v 3 v 12 v 3 v 24 v 3 v 42 v 3 v 52 v 3 v 62 v 4 v 12 v 4 v 32
v 4 v 52 v 4 v 62 v 5 v 12 v 5 v 24 v 5 v 32 v 5 v 42 v 5 v 62 v 6 v 12 v 6 v 24 v 6 v 32 v 6 v 42 v 6 v 52
a 1 a 24 111110000000
000000001001
a 1 a 34 001110000000
000000010011
a 2 a 13 000000000000
000100101010
a 2 a 34 000000000011
111011110111
a 2 a 41 000000000000
001111111111
a 3 a 24 100110000000
110100101001
a 3 a 41 111111111111
111111111111
a 4 a 13 000010100100
010100101000
Table 14. Full soft set X.
Table 14. Full soft set X.
X v 1 v 32 v 1 v 24 v 2 v 13 v 3 v 24 v 3 v 41 v 4 v 13 v 4 v 32
a 1 a 32 1000001
a 2 a 43 0010010
a 4 a 13 0101100
Table 15. Full soft set X.
Table 15. Full soft set X.
X v 1 v 32 v 1 v 43 v 2 v 13 v 3 v 32 v 4 v 13
a 1 a 34 01101
a 3 a 24 01000
a 4 a 12 10010
Table 16. Soft Neutrosophic Set S.
Table 16. Soft Neutrosophic Set S.
S C 1 C 2 C 3 C 4 C 5 C 6
a 1 111011
a 2 001111
a 3 111001
a 3 111111
Table 17. Full soft set R.
Table 17. Full soft set R.
R C 12 C 14 C 15 C 23 C 26 C 34 C 35 C 45 C 46 C 56
a 14 1111111001
a 21 0000001111
a 34 1111111000
a 42 0111111111
Table 18. Full soft set X.
Table 18. Full soft set X.
X C 1 C 15 C 1 C 23 C 1 C 35 C 2 C 34 C 3 C 14 C 3 C 26 C 3 C 45 , C 4 C 23
C 4 C 45 C 4 C 46 C 5 C 23 C 5 C 34 C 5 C 46 C 6 C 12 C 6 C 15
e 1 e 42 11111110
0011101
e 2 e 14 00001100
0011011
e 2 e 34 00000001
0000000
e 3 e 34 11111100
0000011
e 4 e 21 00100010
1100100
e 4 e 42 11111110
1111101
Table 19. Score Function.
Table 19. Score Function.
VScore Values
C 1 (9.97,1.054,2.702)
C 2 (5.87,1.2979,1.7105)
C 3 (8.48,1.3562,2.2994)
C 4 (6.73,1.392,2.3119)
C 5 (7.07,1.3673,1.9029)
C 6 (4.23,0.6929,1.2175)

Share and Cite

MDPI and ACS Style

Masood Malik, H.; Akram, M.; Smarandache, F. Soft Rough Neutrosophic Influence Graphs with Application. Mathematics 2018, 6, 125. https://doi.org/10.3390/math6070125

AMA Style

Masood Malik H, Akram M, Smarandache F. Soft Rough Neutrosophic Influence Graphs with Application. Mathematics. 2018; 6(7):125. https://doi.org/10.3390/math6070125

Chicago/Turabian Style

Masood Malik, Hafsa, Muhammad Akram, and Florentin Smarandache. 2018. "Soft Rough Neutrosophic Influence Graphs with Application" Mathematics 6, no. 7: 125. https://doi.org/10.3390/math6070125

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop