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
. 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.
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 ,,,, and . Initially, he takes and extends his business one by one. Assume A is set of the parameters, consisting of element job, economy above average, safety, other.
Let
S be a full soft set from
A to parameter set
V, as shown in
Table 16.
Suppose N={(,,, ),(,,,),(,,,),(,,,),(,,,),
(,,, 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.
is a full soft rough set in full soft approximation space
where
Let E={,,,,,,,,,}⊆ and L={}⊆.
A full soft relation
R on
E (from
L to
E) can be defined as shown in
Table 17.
Let M={(,,,),(,,,),(,,,),(,,,),(,,,),(,,,),(,,,),(,,,),(,,,),(,,,
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.
,
) is a soft neutrosophic rough relation, where
Let I={,,,,,,,,,,,, ,,}⊆ and F={,,,,}⊆.
A full soft relation
X on
I (from
F to
I) can be defined in
Table 18 as follows:
Let 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.
is a soft neutrosophic rough influence, where
Thus,
is a soft neutrosophic rough influence graph as shown in
Figure 9. He finds the strength of each path from
to
. The paths are
with their influence strength as (
,
,
), respectively.
Since, there is more than one path, therefore, the trader calculates the score function which is formulated in Equation (
4):
For each
, the score values of
is calculated directly and as shown in
Table 19.
So, he chooses the path
:
,
,
,
,
. 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 to . |
11. Choose that path which has maximum membership, minimum |
indeterminacy and falsity value. If , than calculate the |
score values of each , choose that which has maximum |
membership and come immediately after in one of the paths. |