Professional Documents
Culture Documents
Abstract
We first introduce the concept of interval-valued neutrosophic competition graphs. We then
discuss certain types, including k-competition interval-valued neutrosophic graphs, p-competition
interval-valued neutrosophic graphs and m-step interval-valued neutrosophic competition graphs.
Moreover, we present the concept of m-step interval-valued neutrosophic neighbouhood graphs.
1 Introduction
In 1975, Zadeh [26] introduced the notion of interval-valued fuzzy sets as an extension of fuzzy sets
[25] in which the values of the membership degrees are intervals of numbers instead of the numbers.
Interval-valued fuzzy sets provide a more adequate description of uncertainty than traditional fuzzy sets.
It is therefore important to use interval-valued fuzzy sets in applications, such as fuzzy control. One
of the computationally most intensive part of fuzzy control is defuzzification [13]. Atanassov [10] pro-
posed the extended form of fuzzy set theory by adding a new component, called, intuitionistic fuzzy sets.
Smarandache [19, 20] introduced the concept of neutrosophic sets by combining the non-standard analy-
sis. In neutrosophic set, the membership value is associated with three components: truth-membership
(t), indeterminacy-membership (i) and falsity-membership (f ), in which each membership value is a real
standard or non-standard subset of the non-standard unit interval ]0 , 1+ [ and there is no restriction on
their sum. Wang et al. [21] presented the notion of single-valued neutrosophic sets to apply neutrosophic
sets in real life problems more conveniently. In single-valued neutrosophic sets, three components are
independent and their values are taken from the standard unit interval [0, 1]. Wang et al. [22] pre-
sented the concept of interval-valued neutrosophic sets, which is more precise and more flexible than the
single-valued neutrosophic set. An interval-valued neutrosophic set is a generalization of the concept of
single-valued neutrosophic set, in which three membership (t, i, f ) functions are independent, and their
values belong to the unit interval [0, 1].
Kauffman [12] gave the definition of a fuzzy graph. Fuzzy graphs were narrated by Rosenfeld [15]. After
that, some remarks on fuzzy graphs were represented by Bhattacharya [11]. He showed that all the
concepts on crisp graph theory do not have similarities in fuzzy graphs. Wu [24] discussed fuzzy di-
graphs. The concept of fuzzy k-competition graphs and p-competition fuzzy graphs was first developed
by Samanta and Pal in [16], it was further studied in [9, 18, 14]. Samanta et al. [17] introduced the
generalization of fuzzy competition graphs, called m-step fuzzy competition graphs. Samanta et al. [17]
also introduced the concepts of fuzzy m-step neighbouthood graphs, fuzzy economic competition graphs,
and m-step economic competitions graphs. The concepts of bipolar fuzzy competition graphs and intu-
itionistic fuzzy competition graphs are discussed in [14, 18]. Akram and Shahzadi [8] studied properties
of single-valued neutrosophic graphs by level graphs. Akram et al. [1, 2, 3, 4] have introduced several
1
concepts on interval-valued fuzzy graphs and interval-valued neutrosophic graphs. Akram and Shahzadi
[6] introduced the notion of neutrosophic soft graphs with applications. Akram [7] introduced the notion
of single-valued neutrosophic planar graphs. Recently, Akram and Nasir [5] have discussed some concepts
of interval-valued neutrosophic graphs. In this paper, we first introduce the concept of interval-valued
neutrosophic competition graphs. We then discuss certain types, including k-competition interval-valued
neutrosophic graphs, p-competition interval-valued neutrosophic graphs and m-step interval-valued neu-
trosophic competition graphs. Moreover, we present the concept of m-step interval-valued neutrosophic
neighbouhood graphs.
b([
0 .6
,0
.8 ]
, [0
.3 ,
0 .8
b ], [
0 .2
) ) ,0
.7 ] , 0 .6 ] .9 ]
,0 [0.1 )
0 .6 0 .3 ]
,
], [ 0 .2 ,
0 .5 . 2 ], [
0 .3 , ([0 .1 , 0
], [
0 .4
5])
,
0 .2
, 0.
[ b
a(
[0.2
3],
, 0.
([0
[0.2
.
1,
0 .2
2],
], [
, 0.
0 .1
.1
,0
([0
.3 ]
])
, [0
0 .7
.2 ,
0. 3,
], [
0 .6
0 .4
])
.2 ,
b ] , [0
, 0 .2
0 .1
c([
Figure 1: IVN-digraph
2
Definition 2.4. Let G be an IVN-digraph then interval-valued neutrosophic out-neighbourhoods (IVN-
out-neighbourhoods) of a vertex x is an IVN-set
(l)+ (u)+ (l)+ (u)+ (l)+ (u)+
N+ (s) = (Xs+ , [ts , ts ], [is , is ], [fs , ts ]),
where,
Xs+ = {w|[tlB (s, w) > 0, tuB (s, w) > 0], [ilB (s, w) > 0, iuB (x, w) > 0], [fBl (s, w) > 0, fBu (s, w) > 0]},
(l)+ (l)+ (u)+ (u)+
such that ts : Xs+ [0, 1], defined by ts (w) = tlB (s, w), ts : Xs+ [0, 1], defined by ts (w) =
(l)+ (l)+ (u)+ (u)+
tuB (s, w), is : Xs+ [0, 1], defined by is (w) = ilB (s, w), is : Xs+ [0, 1], defined by is (w) =
(l)+ (l)+ (u)+ (u)+
iuB (s, w), fs : Xs+ [0, 1], defined by fs (w) = fBl (s, w), fs : Xs+ [0, 1], defined by fs (w) =
fBu (s, w).
Definition 2.5. Let G be an IVN-digraph then interval-valued neutrosophic in-neighbourhoods (IVN-
in-neighbourhoods) of a vertex x is an IVN-set
(l) (u) (l) (u) (l) (u)
N (s) = (Xs , [ts , ts ], [is , is ], [fs , ts ]),
where,
Xs = {w|[tlB (s, w) > 0, tuB (s, w) > 0], [ilB (s, w) > 0, iuB (s, w) > 0], [fBl (s, w) > 0, fBu (s, w) > 0]},
(l) (l) (u) (u)
such that ts : Xs [0, 1], defined by ts (w) = tlB (s, w), ts : Xs [0, 1], defined by ts (w) =
(l) (l) (u) (u)
tuB (s, w), is : Xs [0, 1], defined by is (w) = ilB (s, w), is : Xs [0, 1], defined by is (w) =
(l) (l) (u) (u)
iuB (s, w), fs : Xs [0, 1], defined by fs (w) = fBl (s, w), fs : Xs [0, 1], defined by fs (w) =
fBu (s, w).
Example 2.2. Consider an IVN-digraph G = (A, B ) on X = {a, b, c} as shown in Fig. 2.
a(
[0.
2,
0.4
b ], [
0.3
,0
.5]
([0
, [0.
.
6,
1,
0.7
([0
0
])
.2 ]
.1
,[
,0
0 .1
.2
], [
,0
0.
.3
2,
], [
0.
0.
3]
2,
, [0
0 .6
.1
,0
])
.6
])
b([0.6
c([ b
, 0.8],
0.1
,0
.2] ([0.1, 0.2],
, [0. [0.2, 0.3], [0 b
[0.3
2, .2, 0.5])
0.4
, 0.8],
], [
0.3
,0
.7]
[0.2,
)
0.9])
Figure 2: IVN-digraph
We have Table 1 and Table 2 representing interval-valued neutrosophic out and in-neighbourhoods,
respectively.
Table 1: IVN-out-neighbourhoods
s N+ (s)
a {(b, [0.1,0.2],[0.2,0.3],[0.1,0.6]), (c, [0.1,0.2],[0.1,0.3],[0.2,0.6])}
b
c {(b, [0.1,0.2],[0.2,0.3],[0.2,0.5])}
3
Table 2: IVN-in-neighbourhoods
s N (s)
a
b {(a, [0.1,0.2],[0.2,0.3],[0.1,0.6]), (c, [0.1,0.2],[0.2,0.3],[0.2,0.5])}
c {(a, [0.1,0.2],[0.1,0.3],[0.2,0.6])}
Definition 2.6. The height of IVN-set A = (s, [tlA , tuA ], [ilA , iuA ], [fAl , fAu ]) in universe of discourse X is
defined as,
h(A) = ([hl1 (A), hu1 (A)], [hl2 (A), hu2 (A)], [hl3 (A), hu3 (A)]),
= ([sup tlA (s), sup tuA (s)], [sup ilA (s), sup iuA (s)], [ inf fAl (s), inf fAu (s)]), for all s X.
sX sX sX sX sX sX
a([0
.2 , 0
.4 ],
b [0.3
, 0 .5
], [0
.6 , 0
([0 .7])
])
. 1,
, 0 .6
0 .2
], [
[0.2
0 .2
,0
.3 ],
.3 ]
, [0
.1 , 0
.1 ,
0 .6
], [0
])
, 0 .2
)
.9 ]
1
,0
([0.
0 .2
b
], [
0 .8
b
c([0 ([0.1, 0.2], [0.2,
, [0
.1 , 0
.8 ]
.2 ],
[0.2
,0
, 0 .4
0 .6
], [0
.3 , 0
b([
.7])
Figure 3: IVN-digraph
We have Table 3 and Table 4 representing interval-valued neutrosophic out and in-neighbourhoods,
respectively.
Table 3: IVN-out-neighbourhoods
s N+ (s)
a {(b, [0.1,0.2],[0.2,0.3],[0.1,0.6]), (c, [0.1,0.2],[0.1,0.3],[0.2,0.6])}
b
c {(b, [0.1,0.2],[0.2,0.3],[0.2,0.5])}
4
Table 4: IVN-in-neighbourhoods
s N (s)
a
b {(a, [0.1,0.2],[0.2,0.3],[0.1,0.6]), (c, [0.1,0.2],[0.2,0.3],[0.2,0.5])}
c {(a, [0.1,0.2],[0.1,0.3],[0.2,0.6])}
b
)
.7 ]
c(
[0
,0
.1
0 .6
,0
.2
], [
],
0 .5
[0
.2
.3 ,
,0
([0.01, 0.04], [0.04, 0.12], [0.06, 0.42])
.4
, [0
],
.4 ]
[0
b
.3
b
,0
,0
2
.7
[0.
])
a(
Figure 4: IVNC-graph
Definition 2.8. Consider an IVN-graph G = (A, B), where A = ([Al1 , Au1 ], [Al2 , Au2 ], [Al3 , Au3 )], and
B = ([B1l , B1u ], [B2l , B2u ], [B3l , B3u )] then, an edge (s, w), s, w X is called independent strong if
1 l 1 u
[A (s) Al1 (w)] < B1l (s, w), [A (s) Au1 (w)] < B1u (s, w),
2 1 2 1
1 l 1 u
[A (s) Al2 (w)] < B2l (s, w), [A (s) Au2 (w)] < B2u (s, w),
2 2 2 2
1 l 1 u
[A (s) Al3 (w)] > B3l (s, w), [A (s) Au3 (w)] > B3u (s, w).
2 3 2 3
Otherwise, it is called weak.
We state the following theorems without thier proofs.
Theorem 2.1. Suppose G is an IVN-digraph. If N+ (x) N+ (y) contains only one element of G , then
the edge (s, w) of C( G ) is independent strong if and only if
|[N+ (s) N+ (w)]|tl > 0.5, |[N+ (s) N+ (w)]|tu > 0.5,
|[N+ (s) N+ (w)]|il > 0.5, |[N+ (s) N+ (w)]|iu > 0.5,
|[N+ (s) N+ (w)]|f l < 0.5, |[N+ (s) N+ (w)]|f u < 0.5.
Theorem 2.2. If all the edges of an IVN-digraph G are independent strong, then
for all edges (s, w) in C( G ).
Definition 2.9. The interval-valued neutrosophic open-neighbourhood (IVN-open-neighbourhood) of a
vertex s of an IVN-graph G = (A, B) is IVN-set N(s) = (Xs , [tls , tus ], [ils , ius ], [fsl , fsu ]), where,
5
Xs = {w|[B1l (s, w) > 0, B1u (s, w) > 0], [B2l (s, w) > 0, B2u (s, w) > 0], [B3l (s, w) > 0, B3u (s, w) > 0]},
and tls : Xs [0, 1] defined by tls (w) = B1l (s, w), tus : Xs [0, 1] defined by tus (w) = B1u (s, w), ils : Xs
[0, 1] defined by ils (w) = B2l (s, w), ius : Xs [0, 1] defined by ius (w) = B2u (s, w), fsl : Xs [0, 1] defined
by fsl (w) = B3l (s, w), fsu : Xs [0, 1] defined by fsu (w) = B3u (s, w). For every vertex s X, the interval-
valued neutrosophic singleton set, As = (s, [Al1 , Au l u l u l
1 ], [A2 , A2 ], [A3 , A3 ) such that: A1 : {s} [0, 1],
u l u l u
A1 : {s} [0, 1], A2 : {s} [0, 1], A2 : {s} [0, 1], A3 : {s} [0, 1], A3 : {s} [0, 1], defined by
Al1 (s) = Al1 (s), Au u l l u u l l u
1 (s) = A1 (s), A2 (s) = A2 (s), A2 (s) = A2 (s), A3 (s) = A3 (s) and A3 (s) = A3 (s),
u
B1l (s, w) = [Al1 (s) Al1 (w)]hl1 (N(s) N(w)), B1u (s, w) = [Au1 (s) Au1 (w)]hu1 (N(s) N(w)),
B2l (s, w) = [Al2 (s) Al2 (w)]hl2 (N(s) N(w)), B2u (s, w) = [Au2 (s) Au2 (w)]hu2 (N(s) N(w)),
B3l (s, w) = [Al3 (s) Al3 (w)]hl3 (N(s) N(w)), B3u (s, w) = [Au3 (s) Au3 (w)]hu3 (N(s) N(w)), respectively.
B1l (s, w) = [Al1 (s) Al1 (w)]hl1 (N[s] N[w]), B1u (s, w) = [Au1 (s) Au1 (w)]hu1 (N[s] N[w]),
B2l (s, w) = [Al2 (s) Al2 (w)]hl2 (N[s] N[w]), B2u (s, w) = [Au2 (s) Au2 (w)]hu2 (N[s] N[w]),
B3l (s, w) = [Al3 (s) Al3 (w)]hl3 (N[s] N[w]), B3u (s, w) = [Au3 (s) Au3 (w)]hu3 (N[s] N[w]), respectively.
We now discuss the method of construction of interval-valued neutrospohic competition graph of the
Cartesian product of IVN-digraph in following theorem which can be proof using similar method as used
in [14], hence we omit its proof.
Theorem 2.3. Let C(G1 ) = (A1 , B1 ) and C(G2 ) = (A2 , B2 ) be two IVNC-graphs of IVN-digraphs
G1 = (A1 , L1 ) and G2 = (A2 , L2 ), respectively. Then C(G1 G2 ) = GC(
G1 ) C(G2 )
G where,
GC(
G1 ) C(G2 )
is an IVN-graph on the crisp graph (X1 X2 , EC(
E
G 1 )
), C(G1 ) and C(G2 ) are
C(G2 )
the crisp competition graphs of G1 and G2 , respectively. G is an IVN-graph on (X1 X2 , E ) such
that:
1. E = {(s1 , s2 )(w1 , w2 ) : w1 N (s1 ) , w2 N+ (s2 ) }
EC( E
G 1 )
C(G2 )
= {(s1 , s2 )(s1 , w2 ) : s1 X1 , s2 w2 EC(
} {(s1 , s2 )(w1 , s2 ) : s2 X2 , s1 w1
G 2 )
EC( }.
G )1
2. tlA1 A2 = tlA1 (s1 ) tlA2 (s2 ), ilA1 A2 = ilA1 (s1 ) ilA2 (s2 ), fAl 1 A2 = fAl 1 (s1 ) fAl 2 (s2 ),
tuA1 A2 = tuA1 (s1 ) tuA2 (s2 ), iuA1 A2 = iuA1 (s1 ) iuA2 (s2 ), fAu1 A2 = fAu1 (s1 ) fAu2 (s2 ).
3. tlB ((s1 , s2 )(s1 , w2 )) = [tlA1 (s1 ) tlA2 (s2 ) tlA2 (w2 )] a2 {tlA1 (s1 ) tl (s2 a2 ) tl (w2 a2 )},
L2 L2
(s1 , s2 )(s1 , w2 ) EC(
E
G 1 )
,
C(G2 )
a2 (N+ (s2 ) N+ (w2 )) .
4. ilB ((s1 , s2 )(s1 , w2 )) = [ilA1 (s1 ) ilA2 (s2 ) ilA2 (w2 )] a2 {ilA1 (s1 ) il (s2 a2 ) il (w2 a2 )},
L2 L2
(s1 , s2 )(s1 , w2 ) EC(
E
G 1 )
,
C(G2 )
a2 (N+ (s2 ) N+ (w2 )) .
6
5. fBl ((s1 , s2 )(s1 , w2 )) = [fAl 1 (s1 ) fAl 2 (s2 ) fAl 2 (w2 )] a2 {fAl 1 (s1 ) f
l l
(s2 a2 ) f
(w2 a2 )},
L2 L2
(s1 , s2 )(s1 , w2 ) EC(
E
G )
,
C(G )
a2 (N+ (s2 ) N+ (w2 )) .
1 2
6. tuB ((s1 , s2 )(s1 , w2 )) = [tuA1 (s1 ) tuA2 (s2 ) tuA2 (w2 )] a2 {tuA1 (s1 ) tu (s2 a2 ) tu (w2 a2 )},
L2 L2
(s1 , s2 )(s1 , w2 ) EC(
E
G 1 )
,
C(G2 )
a2 (N+ (s2 ) N+ (w2 )) .
7. iuB ((s1 , s2 )(s1 , w2 )) = [iuA1 (s1 ) iuA2 (s2 ) iuA2 (w2 )] a2 {iuA1 (s1 ) iu (s2 a2 ) iu (w2 a2 )},
L2 L2
(s1 , s2 )(s1 , w2 ) EC(
E
G 1 )
,
C(G2 )
a2 (N+ (s2 ) N+ (w2 )) .
8. fBu ((s1 , s2 )(s1 , w2 )) = [fAu1 (s1 ) fAu2 (s2 ) fAu2 (w2 )] a2 {fAu1 (s1 ) f
u u
(s2 a2 ) f
(w2 a2 )},
L2 L2
(s1 , s2 )(s1 , w2 ) EC(
E
G 1 )
,
C(G2 )
a2 (N+ (s2 ) N+ (w2 )) .
9. tlB ((s1 , s2 )(w1 , s2 )) = [tlA1 (s1 ) tlA1 (w1 ) tlA2 (s2 )] a1 {tlA2 (s2 ) tl (s1 a1 ) tl (w1 a1 )},
L1 L1
(s1 , s2 )(w1 , s2 ) EC(
E
G 1 )
,
C(G2 )
a1 (N+ (s1 ) N+ (w1 )) .
10. ilB ((s1 , s2 )(w1 , s2 )) = [ilA1 (s1 ) ilA1 (w1 ) ilA2 (s2 )] a1 {ilA2 (s2 ) il (s1 a1 ) il (w1 a1 )},
L1 L1
(s1 , s2 )(w1 , s2 ) EC(
E
G 1 )
,
C(G2 )
a1 (N+ (s1 ) N+ (w1 )) .
11. fBl ((s1 , s2 )(w1 , s2 )) = [fAl 1 (s1 ) fAl 1 (w1 ) fAl 2 (s2 )] a1 {tlA2 (s2 ) f
l l
(s1 a1 ) f
(w1 a1 )},
L1 L1
(s1 , s2 )(w1 , s2 ) EC(
E
G 1 )
,
C(G2 )
a1 (N+ (s1 ) N+ (w1 )) .
12. tuB ((s1 , s2 )(w1 , s2 )) = [tuA1 (s1 ) tuA1 (w1 ) tuA2 (s2 )] a1 {tuA2 (s2 ) tu (s1 a1 ) tu (w1 a1 )},
L1 L1
(s1 , s2 )(w1 , s2 ) EC(
E
G 1 )
,
C(G2 )
a1 (N+ (s1 ) N+ (w1 )) .
13. iuB ((s1 , s2 )(w1 , s2 )) = [iuA1 (s1 ) iuA1 (w1 ) iuA2 (s2 )] a1 {iuA2 (s2 ) iu (s1 a1 ) iu (w1 a1 )},
L1 L1
(s1 , s2 )(w1 , s2 ) EC(
E
G 1 )
,
C(G2 )
a1 (N+ (s1 ) N+ (w1 )) .
14. fBu ((s1 , s2 )(w1 , s2 )) = [fAu1 (s1 ) fAu1 (w1 ) fAu2 (s2 )] a1 {tuA2 (s2 ) f
u u
(s1 a1 ) f
(w1 a1 )},
L1 L1
(s1 , s2 )(w1 , s2 ) EC(
E
G )
,
C(G )
a1 (N+ (s1 ) N+ (w1 )) .
1 2
15. tlB ((s1 , s2 )(w1 , w2 )) = [tlA1 (s1 ) tlA1 (w1 ) tlA2 (s2 ) tlA2 (w2 )] [tlA1 (s1 ) tl (w1 s1 ) tlA2 (w2 )
L1
tl (s2 w2 )],
L2
(s1 , w1 )(s2 , w2 ) E .
16. ilB ((s1 , s2 )(w1 , w2 )) = [ilA1 (s1 ) ilA1 (w1 ) ilA2 (s2 ) ilA2 (w2 )] [ilA1 (s1 ) il (w1 s1 ) ilA2 (w2 )
L1
il (s2 w2 )],
L2
(s1 , w1 )(s2 , w2 ) E .
17. fBl ((s1 , s2 )(w1 , w2 )) = [fAl 1 (s1 ) fAl 1 (w1 ) fAl 2 (s2 ) fAl 2 (w2 )] [fAl 1 (s1 ) f
l l
(w1 s1 ) fA2 (w2 )
L1
l
(s2 w2 )],
f
L2
(s1 , w1 )(s2 , w2 ) E .
18. tuB ((s1 , s2 )(w1 , w2 )) = [tuA1 (s1 ) tuA1 (w1 ) tuA2 (s2 ) tuA2 (w2 )] [tuA1 (s1 ) tu (w1 s1 ) tuA2 (w2 )
L1
tu (s2 w2 )],
L2
(s1 , w1 )(s2 , w2 ) E .
19. iuB ((s1 , s2 )(w1 , w2 )) = [iuA1 (s1 ) iuA1 (w1 ) iuA2 (s2 ) iuA2 (w2 )] [iuA1 (s1 ) iu (w1 s1 ) iuA2 (w2 )
L1
iu (s2 w2 )],
L2
(s1 , w1 )(s2 , w2 ) E .
7
20. fBu ((s1 , s2 )(w1 , w2 )) = [fAu1 (s1 ) fAu1 (w1 ) fAu2 (s2 ) fAu2 (w2 )] [fAu1 (s1 ) f
u u
(w1 s1 ) fA2 (w2 )
L1
u
f (s2 w2 )],
L2
(s1 , w1 )(s2 , w2 ) E .
A. k-Competition Interval-Valued Neutrosophic Graphs
We now discuss an extension of IVNC-graphs, called k-competition IVN-graphs.
Definition 2.12. The cardinality of an IVN-set A is denoted by
|A| = |A|tl , |A|tu , |A|il , |A|iu , |A|f l , |A|f u .
Where |A|tl , |A|tu , |A|il , |A|iu and |A|f l , |A|f u represent the sum of truth-membership values,
indeterminacy-membership values and falsity-membership values, respectively, of all the elements of A.
Example 2.4. The cardinality of an IVN-set A = {(a, [0.5, 0.7], [0.2, 0.8], [0.1, 0.3]), (b, [0.1, 0.2], [0.1,
0.5], [0.7, 0.9]), (c, [0.3, 0.5], [0.3, 0.8], [0.6, 0.9])} in X = {a, b, c} is
|A| = |A|tl , |A|tu , |A|il , |A|iu , |A|f l , |A|f u
= ([0.9, 1.4], [0.6, 2.1], [1.4, 2.1]).
G and has an interval-valued neutrosophic edge between two vertices s, w X in Ck ( G ) if and only if
|(N+ (s) N+ (w))|tl > k, |(N+ (s) N+ (w))|tu > k, |(N+ (s) N+ (w))|il > k, |(N+ (s) N+ (w))|iu > k,
|(N+ (s) N+ (w))|f l > k and |(N+ (s) N+ (w))|f u > k. The interval-valued truth-membership value
kl k
of edge (s, w) in Ck ( G ) is tlB (s, w) = 1kl [tlA (s) tlA (w)]hl1 (N+ (s) N+ (w)), where k1l = |(N+ (s)
1
k1u k u
N+ (w))|tl and tuB (s, w) = tuA (w)]hu1 (N+ (s) N+ (w)), where k1u = |(N+ (s) N+ (w))|tu ,
k1u [tA (s)
kl k
the interval-valued indeterminacy-membership value of edge (s, w) in Ck ( G ) is ilB (s, w) = 2kl [ilA (s)
2
ku k
ilA (w)]hl2 (N+ (s)N+ (w)), where k2l = |(N+ (s)N+ (w))|il , and iuB (s, w) = 2ku [iuA (s)iuA (w)]hu2 (N+ (s)
2
N+ (w)), where k2u = |(N+ (s) N+ (w))|iu , the interval-valued falsity-membership value of edge (s, w) in
kl k
Ck ( G ) is fBl (s, w) = 3kl [fAl (s) fAl (w)]hl3 (N+ (s) N+ (w)), where k3l = |(N+ (s) N+ (w))|f l , and fBu (s,
3
k3u k u
w) = k3u [fA (s) fAu (w)]hu3 (N+ (s) N+ (w)), where k3u = |(N+ (s) N+ (w))|f u .
Example 2.5. Consider an IVN-digraph G = (A, B ) on X = {s, w, a, b, c}, such that A = {(s, [0.4, 0.5],
[0.5, 0.7], [0.8, 0.9]), (w, [0.6, 0.7], [0.4, 0.6], [0.2, 0.3]), (a, [0.2, 0.6], [0.3, 0.6], [0.2, 0.6]), (b, [0.2, 0.6],
[0.1, 0.6], [0.2, 0.6]), (c, [0.2, 0.7], [0.3, 0.5], [0.2, 0.6])}, and B = {((s, a), [0.1, 0.4], [0.3, 0.6], [0.2, 0.6]),
((s, b), [0.2, 0.4], [0.1, 0.5], [0.2, 0.6]), ((s, c), [0.2, 0.5], [0.3, 0.5], [0.2, 0.6]), ((w, a), [0.2, 0.5], [0.2, 0.5],
[0.2, 0.3]), ((w, b), [0.2, 0.6], [0.1, 0.6], [0.2, 0.3]), ((w, c), [0.2, 0.7], [0.3, 0.5], [0.2, 0.3])}, as shown in Fig. 5.
8
b a([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])
.2, 0.6])
], [0.3 , 0.6], [0
([ 0.1, 0.4
, 0.3])
b ], [0.2
s([0.4, 0.5], [0.5, 0.7], [0.8, 0.9]) ([0.2 .2, 0.5
, 0 .4 .2 , 0 .5], [0
([0 ], [0 ([0
.2 .1 , 0
,0 .5 ] ,
.5 [0.2
], [ , 0 .6])
0.
3,
0.
5]
, [0 b b([0.2, 0.6], [0.1, 0.6], [0.2, 0.6])
.2
,0
.6
])
])
, 0 .3
[0.2
, 0 . 6 ],
[0. 1
. 6 ],
2, 0
w([0.6, 0.7], [0.4, 0.6], [0.2, 0.3]) b ([0.
([0.2, 0
.7], [0.3
, 0.5], [0
.2, 0.3]) b c([0.2, 0.7], [0.3, 0.5], [0.2, 0.6])
Figure 5: IVN-digraph
We calculate N+ (s) = {(a, [0.1, 0.4], [0.3, 0.6], [0.2, 0.6]), (b, [0.2, 0.4], [0.1, 0.5], [0.2, 0.6]), (c, [0.2, 0.5],
[0.3, 0.5], [0.2, 0.6])} and N+ (w) = {(a, [0.2, 0.5], [0.2, 0.5], [0.2, 0.3]), (b, [0.2, 0.6], [0.1, 0.6], [0.2, 0.3]),
(c, [0.2, 0.7], [0.3, 0.5], [0.2, 0.3])}. Therefore, N+ (s) N+ (w) = {(a, [0.1, 0.4], [0.2, 0.5], [0.2, 0.3]), (b,
[0.2, 0.4], [0.1, 0.5], [0.2, 0.3]), (c, [0.2, 0.5], [0.3, 0.5], [0.2, 0.3)}. So, k1l = 0.5, k1u = 1.3, k2l = 0.6, k2u = 1.5,
k3l = 0.6 and k3u = 0.9. Let k = 0.4, then, tlB (s, w) = 0.02, tuB (s, w) = 0.56, ilB (s, w) = 0.06, iuB (s,
w) = 0.82, fBl (s, w) = 0.02 and fBu (s, w) = 0.11. This graph is depicted in Fig. 6.
a( b([ c([
[0. 0 .2 0 .2
2, ,0 ,0
0 .6 .6 ] .7 ]
], [ , [0 , [0
b
b
0 .3 .1 , .3 ,
,0 0 .6 0 .5
.6 ] ], [ ], [
, [0 0 .2 0 .2
.2 , ,0 ,0
0 .6 .6 ] .6 ]
]) ) )
])
s([ 0 .3
0 .4 ([0.02, 0.56], [0.06, 0.82], [0.02, 0.11])
[0 .2 ,
, 0.
5 ], 0. 6 ],
b
[0. 4,
b
5, 0
.7 ] ], [0.
, [0 0 .7
.8 , 6,
0 .9 [0.
]) w(
hl1 (N+ (s) N+ (w)) = 1, hl2 (N+ (s) N+ (w)) = 1, hl3 (N+ (s) N+ (w)) = 1,
hu1 (N+ (s) N+ (w)) = 1, hu2 (N+ (s) N+ (w)) = 1, hu3 (N+ (s) N+ (w)) = 1,
and
|(N+ (s) N+ (w))|tl > 2k, |(N+ (s) N+ (w))|il > 2k, |(N+ (s) N+ (w))|f l < 2k,
|(N+ (s) N+ (w))|tu > 2k, |(N+ (s) N+ (w))|iu > 2k, |(N+ (s) N+ (w))|f u < 2k,
Then the edge (s, w) is independent strong in Ck ( G ).
Proof. Let G = (A, B ) be an IVN-digraph. Let Ck ( G ) be the corresponding k-competition IVN-graph.
9
If hl1 (N+ (s) N+ (w)) = 1 and |(N+ (s) N+ (w))|tl > 2k, then k1l > 2k and therefore,
k1l k l
tlB (s, w) = [tA (s) tlA (w)]hl1 (N+ (s) N+ (w))
k1l
k1l k l
or, tlB (s, w) = [tA (s) tlA (w)]
k1l
tlB (s, w) k1l k
= > 0.5.
[tA (s) tlA (w)]
l k1l
If hu1 (N+ (s) N+ (w)) = 1 and |(N+ (s) N+ (w))|tu > 2k, then k1u > 2k and therefore,
k1u k u
tuB (s, w) = [tA (s) tuA (w)]hu1 (N+ (s) N+ (w))
k1u
ku k
or, tuB (s, w) = 1 u [tuA (s) tuA (w)]
k1
u u
tB (s, w) k k
= 1 u > 0.5.
[tuA (s) tuA (w)] k1
If hl2 (N+ (s) N+ (w)) = 1 and |(N+ (s) N+ (w))|il > 2k, then k2l > 2k and therefore,
k2l k l
ilB (s, w) = [iA (s) ilA (w)]hl2 (N+ (s) N+ (w))
k2l
k2l k l
or, ilB (s, w) = [iA (s) ilA (w)]
k2l
ilB (s, w) k2l k
= > 0.5.
[iA (s) ilA (w)]
l k2l
If hu2 (N+ (s) N+ (w)) = 1 and |(N+ (s) N+ (w))|iu > 2k, then k2u > 2k and therefore,
k2u k u
iuB (s, w) = [iA (s) iuA (w)]hu2 (N+ (s) N+ (w))
k2u
ku k
or, iuB (s, w) = 2 u [iuA (s) iuA (w)]
k2
iuB (s, w) k2u k
= > 0.5.
[iuA (s) iuA (w)] k2u
If hl3 (N+ (s) N+ (w)) = 1 and |(N+ (s) N+ (w))|f l < 2k, then k3l < 2k and therefore,
k3l k l
fBl (s, w) = [fA (s) fAl (w)]hl3 (N+ (s) N+ (w))
k3l
k3l k l
or, fBl (s, w) = [fA (s) fAl (w)]
k3l
fBl (s, w) k3l k
= < 0.5.
[fA (s) fAl (w)]
l k3l
If hu3 (N+ (s) N+ (w)) = 1 and |(N+ (s) N+ (w))|f u < 2k, then k3u < 2k and therefore,
k3u k u
fBu (s, w) = [fA (s) fAu (w)]hu3 (N+ (s) N+ (w))
k3u
ku k
or, fBu (s, w) = 3 u [fAu (s) fAu (w)]
k3
u u
fB (s, w) k k
= 3 u < 0.5.
[fAu (s) fAu (w)] k3
Hence, the edge (s, w) is independent strong in Ck ( G ).
10
B. p-Competition Interval-Valued Neutrosophic Graphs
We now define another extension of IVNC-graphs, called p-competition IVN-graphs.
Definition 2.14. The support of an IVN-set A = (s, [tlA , tuA ], [ilA , iuA ], [fAl , fAu ]) in X is the subset of X
defined by
supp(A) = {s X : [tlA (s) 6= 0, tuA (s) 6= 0], [ilA (s) 6= 0, iuA (s) 6= 0], [fAl (s) 6= 1, fAu (s) 6= 1]}
and |supp(A)| is the number of elements in the set.
Example 2.6. The support of an IVN-set A = {(a, [0.5, 0.7], [0.2, 0.8], [0.1, 0.3]), (b, [0.1, 0.2], [0.1,
0.5], [0.7, 0.9]), (c, [0.3, 0.5], [0.3, 0.8], [0.6, 0.9]), (d, [0, 0], [0, 0], [1, 1])} in X = {a, b, c, d} is
supp(A) = {a, b, c} and |supp(A)| = 3.
We now define p-competition IVN-graphs.
Definition 2.15. Let p be a positive integer. Then p-competition IVN-graph Cp ( G ) of the IVN-digraph
G = (A, B ) is an undirected IVN-graph G = (A, B) which has same IVN-set of vertices as in G
and has an interval-valued neutrosophic edge between two vertices s, w X in Cp ( G ) if and only if
|supp(N+ (s) N+ (w))| p. The interval-valued truth-membership value of edge (s, w) in Cp ( G ) is tlB (s,
w) = (ip)+1
i [tlA (s) tlA (w)]hl1 (N+ (s) N+ (w)), and tuB (s, w) = (ip)+1i [tuA (s) tuA (w)]hu1 (N+ (s) N+ (w)),
the interval-valued indeterminacy-membership value of edge (s, w) in Cp ( G ) is ilB (s, w) = (ip)+1 i [ilA (s)
l l + + u (ip)+1 u u u + +
iA (w)]h2 (N (s) N (w)), and iB (s, w) = i [iA (s) iA (w)]h2 (N (s) N (w)), the interval-valued
p
falsity-membership value of edge (s, w) in C ( G ) is fBl (s, w) = (ip)+1 i [fAl (s)fAl (w)]hl3 (N+ (s)N+ (w)),
(ip)+1
and fBu (s, w) = i [fAu (s) fAu (w)]hu3 (N+ (s) N+ (w)), where i = |supp(N+ (s) N+ (w))|.
Example 2.7. Consider an IVN-digraph G = (A, B ) on X = {s, w, a, b, c}, such that A = {(s, [0.4, 0.5],
[0.5, 0.7], [0.8, 0.9]), (w, [0.6, 0.7], [0.4, 0.6], [0.2, 0.3]), (a, [0.2, 0.6], [0.3, 0.6], [0.2, 0.6]), (b, [0.2, 0.6],
[0.1, 0.6], [0.2, 0.6]), (c, [0.2, 0.7], [0.3, 0.5], [0.2, 0.6])}, and B = {((s, a), [0.1, 0.4], [0.3, 0.6], [0.2, 0.6]),
((s, b), [0.2, 0.4], [0.1, 0.5], [0.2, 0.6]), ((s, c), [0.2, 0.5], [0.3, 0.5], [0.2, 0.6]), ((w, a), [0.2, 0.5], [0.2, 0.5],
[0.2, 0.3]), ((w, b), [0.2, 0.6], [0.1, 0.6], [0.2, 0.3]), ((w, c), [0.2, 0.7], [0.3, 0.5], [0.2, 0.3])}, as shown in Fig. 7.
0.9])
[0.8,
[0.5 , 0.7],
, 0.5], b
s([0.4
([0.
1 , 0 .4
], [0
([0
a([0
.3 , 0
([0.2,
.2 ,
. 6 ],
.2 , 0
[0.2
0 .4
, 0 .6
0.6], [0.2, 0.3])
], [
])
0.5], [0
.6 ],
0 .1
[0.3
,0
.5 ]
b
.3, 0.5
, 0 .6
, [0
.2 ,
], [0
([0
], [0.2,
.
0 .6
2,
w([0.6, 0.7], [0.4,
b
.2 , 0
0 .5
])
], [
0 .2
.6])
0.6])
([0.2, ,0
.5 ]
b([0
0.6], , [0
[0.1, .2 ,
0.6],
.2 , 0
[0.2, 0 .3
([0
0.3]) ])
.2
. 6 ],
b
,0
.7
[0.1
], [
0.
, 0 .6
3,
0.
5]
], [0
, [0
.2
.2 , 0
,0
.3
])
.6])
b .6])
.2 , 0
0 .5 ], [0
[ 0 .3 ,
. 7 ],
.2 , 0
c([0
Figure 7: IVN-digraph
We calculate N+ (s) = {(a, [0.1, 0.4], [0.3, 0.6], [0.2, 0.6]), (b, [0.2, 0.4], [0.1, 0.5], [0.2, 0.6]), (c, [0.2, 0.5],
[0.3, 0.5], [0.2, 0.6])} and N+ (w) = {(a, [0.2, 0.5], [0.2, 0.5], [0.2, 0.3]), (b, [0.2, 0.6], [0.1, 0.6], [0.2, 0.3]),
11
(c, [0.2, 0.7], [0.3, 0.5], [0.2, 0.3])}. Therefore, N+ (s) N+ (w) = {(a, [0.1, 0.4], [0.2, 0.5], [0.2, 0.3]), (b,
[0.2, 0.4], [0.1, 0.5], [0.2, 0.3]), (c, [0.2, 0.5], [0.3, 0.5], [0.2, 0.3)}. Now, i = |supp(N+ (s) N+ (w))| = 3. For
p = 3, we have, tlB (s, w) = 0.02, tuB (s, w) = 0.08, ilB (s, w) = 0.04, iuB (s, w) = 0.1, fBl (s, w) = 0.01 and
fBu (s, w) = 0.03. This graph is depicted in Fig. 8.
a( b([ c([
[0. 0 .2 0 .2
2, ,0 ,0
0 .6 .6 ] .7 ]
], [ , [0 , [0
b
0 .3 .1 , .3 ,
,0 0 .6 0 .5
.6 ] ], [ ], [
, [0 0 .2 0 .2
.2 , ,0 ,0
0 .6 .6 ] .6 ]
]) ) )
])
s([ 0 .3
0 .4 ([0.02, 0.08], [0.04, 0.1], [0.01, 0.03])
[0 .2 ,
, 0.
5 ], 0. 6 ],
b
[0. 4,
b
5, 0
.7 ] ], [0.
, [0 0 .7
.8 , 6,
0 .9 [0.
]) w(
hl1 (N+ (s) N+ (w)) = 1, hl2 (N+ (s) N+ (w)) = 1, hl3 (N+ (s) N+ (w)) = 0,
hu1 (N+ (s) N+ (w)) = 1, hu2 (N+ (s) N+ (w)) = 1, hu3 (N+ (s) N+ (w)) = 0,
i
in C[ 2 ] ( G ), then the edge (s, w) is strong, where i = |supp(N+ (s) N+ (w))|. (Note that for any real
number s, [s]=greatest integer not esceeding s.)
C. m-Step Interval-Valued Neutrosophic Competition Graphs
We now define another extension of IVNC-graph known as m-step IVNC-graph. We will use the following
notations:
m
Ps,w : An interval-valued neutrosophic path of length m from s to w.
m
Definition 2.16. Suppose G = (A, B ) is an IVN-digraph. The m-step IVN-digraph of G is denoted by
G m = (A, B), where IVN-set of vertices of G is same with IVN-set of vertices of G m and has an edge
between s and w in G m if and only if there exists an interval-valued neutrosophic directed path P m
s,w in
G.
Definition 2.17. The m-step interval-valued neutrosophic out-neighbourhood (IVN-out-neighbourhood)
of vertex s of an IVN-digraph G = (A, B ) is IVN-set
(l)+ (u)+ (l)+ (u)+ (l)+ (u)+
N+ +
m (s) = (Xs , [ts , ts ], [is , is ], [fs , fs ]), where
Xs+ = {w| there exists a directed interval-valued neutrosophic path of length m from s to w, P m
s,w },
(l)+ (u)+ (l)+ (u)+ (l)+ (u)+
ts : Xs+ [0, 1], ts : Xs+ [0, 1], is : Xs+ [0, 1], is : Xs+ [0, 1], fs : Xs+ [0, 1] fs :
12
(l)+
(u)+
Xs+ [0, 1] are defined by ts = min{tl (s1 , s2 ), (s1 , s2 ) is an edge of P m s,w }, ts = min{tu (s1 , s2 ),
(l)+
(u)+
(s1 , s2 ) is an edge of P ms,w }, is = min{il (s1 , s2 ), (s1 , s2 ) is an edge of P m s,w }, is = min{iu (s1 , s2 ),
(l)+
(u)+
(s1 , s2 ) is an edge of P m
s,w }, fs = min{f l (s1 , s2 ), (s1 , s2 ) is an edge of P m
s,w }, fs = min{f u (s1 , s2 ),
(s1 , s2 ) is an edge of P ms,w }, respectively.
Example 2.8. Consider an IVN-digraph G = (A, B ) on X = {s, w, a, b, c, d}, such that A = {(s,
[0.4, 0.5], [0.5, 0.7], [0.8, 0.9]), (w, [0.6, 0.7], [0.4, 0.6], [0.2, 0.3]), (a, [0.2, 0.6], [0.3, 0.6], [0.2, 0.6]), (b,
[0.2, 0.6], [0.1, 0.6], [0.2, 0.6]), (c, [0.2, 0.7], [0.3, 0.5], [0.2, 0.6]), d([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])}, and B =
{((s, a), [0.1, 0.4], [0.3, 0.6], [0.2, 0.6]), ((a, c), [0.2, 0.6], [0.3, 0.5], [0.2, 0.6]), ((a, d), [0.2, 0.6], [0.3, 0.5],
[0.2, 0.4]), ((w, b), [0.2, 0.6], [0.1, 0.6], [0.2, 0.3]), ((b, c), [0.2, 0.4], [0.1, 0.2], [0.1, 0.3]), ((b, d), [0.1, 0.3],
[0.1, 0.2], [0.2, 0.4])}, as shown in Fig. 9.
s([0.4, 0.5], [0.5, 0.7], [0.8, 0.9]) w([0.6, 0.7], [0.4, 0.6], [0.2, 0.3])
b
b
b([0.2
a([0
, 0.6],
.2, 0
.6], [0
[0.1
([0
b
])
b
. 2,
0 .3
, 0.6],
.3, 0
0 .6 1,
], [ 0.
0 ], [
.6], [0
.3 ,
])
.2
([0
[0.2,
,0
0 .4
0 .5
0 .1
.
2, 0
], [ ,[
.2 ,
.2, 0
0 .4 ]
0.6])
.2 ,
.6 ]
0 .4 0 ], [0
. 2,
, [0
.6])
]) ([0
0 .2
.3 ,
.1 ,
0 .5
, [0
], [
.3 ]
0 .2
1, 0
, 0.
.
6])
([0
b
c([0.2, 0.7], [0.3, 0.5], [0.2, 0.6]) d([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])
Figure 9: IVN-digraph
We calculate 2-step IVN-out-neighbourhoods as, N+ 2 (s) = {(c, [0.1, 0.4], [0.3, 0.5], [0.2, 0.6]), (d,
[0.1, 0.4], [0.3, 0.5], [0.2, 0.4])} and N+
2 (w) = {(c, [0.2, 0.4], [0.1, 0.2], [0.1, 0.3]), (d, [0.1, 0.3], [0.1, 0.2],
[0.2, 0.3])}.
Definition 2.18. The m-step interval-valued neutrosophic in-neighbourhood (IVN-in-neighbourhood)
of vertex s of an IVN-digraph G = (A, B ) is IVN-set
(l) (u) (l) (u) (l) (u)
N
m (s) = (Xs , [ts , ts ], [is , is ], [fs , fs ]), where
Xs = {w| there exists a directed interval-valued neutrosophic path of length m from s to w, P m
s,w },
(l) (u) (l) (u) (l) (u)
ts : Xs [0, 1], ts : Xs [0, 1], is : Xs [0, 1], is : Xs [0, 1], fs : Xs [0, 1] fs :
(l)
l
m (u) u
Xs [0, 1] are defined by ts = min{t (s1 , s2 ), (s1 , s2 ) is an edge of P s,w }, ts
= min{t (s1 , s2 ),
m
(l) l
m
(u)
(s1 , s2 ) is an edge of P s,w }, is = min{i (s1 , s2 ), (s1 , s2 ) is an edge of P s,w }, is = min{iu (s1 , s2 ),
(l)
(u)
(s1 , s2 ) is an edge of P m
s,w }, fs = min{f l (s1 , s2 ), (s1 , s2 ) is an edge of P m
s,w }, fs = min{f u (s1 , s2 ),
(s1 , s2 ) is an edge of P ms,w }, respectively.
Example 2.9. Consider an IVN-digraph G = (A, B ) on X = {s, w, a, b, c, d}, such that A = {(s,
[0.4, 0.5], [0.5, 0.7], [0.8, 0.9]), (w, [0.6, 0.7], [0.4, 0.6], [0.2, 0.3]), (a, [0.2, 0.6], [0.3, 0.6], [0.2, 0.6]), (b,
[0.2, 0.6], [0.1, 0.6], [0.2, 0.6]), (c, [0.2, 0.7], [0.3, 0.5], [0.2, 0.6]), d([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])}, and B =
{((s, a), [0.1, 0.4], [0.3, 0.6], [0.2, 0.6]), ((a, c), [0.2, 0.6], [0.3, 0.5], [0.2, 0.6]), ((a, d), [0.2, 0.6], [0.3, 0.5],
13
[0.2, 0.4]), ((w, b), [0.2, 0.6], [0.1, 0.6], [0.2, 0.3]), ((b, c), [0.2, 0.4], [0.1, 0.2], [0.1, 0.3]), ((b, d), [0.1, 0.3],
[0.1, 0.2], [0.2, 0.4])}, as shown in Fig. 10.
s([0.4, 0.5], [0.5, 0.7], [0.8, 0.9]) w([0.6, 0.7], [0.4, 0.6], [0.2, 0.3])
b b
b([0.2
a([0
, 0.6],
.2, 0
.6], [0
[0.1
b ([0 b
)
. 2, .3 ]
, 0.6],
.3, 0
0 .6 0
], [ 0 .1 ,
0 ], [
.6], [0
.3 ,
])
([0 0 .2
[0.2,
0 .5
0 .4
.2 1,
, 0. ], [ [0.
.2 ,
],
.2, 0
0.6])
.2 ,
0 .4
6 ],
], [0
0 .4 . 2,
.6])
]) ([0
[0.
0 .2
3 , 0.
.1 ,
5 ],
, [0
[0.
.3 ]
2
1, 0
, 0.
.
6])
([0
b b
c([0.2, 0.7], [0.3, 0.5], [0.2, 0.6]) d([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])
We calculate 2-step IVN-in-neighbourhoods as, N 2 (s) = {(c, [0.1,0.4], [0.3,0.5], [0.2,0.6]), (d, [0.1,0.4],
[0.3,0.5], [0.2,0.4])} and N
2 (w) = {(c, [0.2,0.4], [0.1,0.2], [0.1,0.3]), (d, [0.1,0.3], [0.1,0.2], [0.2,0.3])}.
Definition 2.19. Suppose G = (A, B ) is an IVN-digraph. The m-step IVNC-graph of IVN-digraph G
is denoted by Cm ( G ) = (A, B) which has same IVN-set of vertices as in G and has an edge between two
vertices s, w X in Cm ( G ) if and only if (N+ +
m (s) Nm (w)) is a non-empty IVN-set in G . The interval-
valued truth-membership value of edge (s, w) in Cm ( G ) is tlB (s, w) = [tlA (s) tlA (w)]hl1 (N+ +
m (s) Nm (w)),
u u u u + +
and tB (s, w) = [tA (s) tA (w)]h1 (Nm (s) Nm (w)), the interval-valued indeterminacy-membership value
of edge (s, w) in Cm ( G ) is ilB (s, w) = [ilA (s) ilA (w)]hl2 (N+ + u u
m (s) Nm (w)), and iB (s, w) = [iA (s)
iuA (w)]hu2 (N+ + l
m (s) Nm (w)), the interval-valued falsity-membership value of edge (s, w) in Cm ( G ) is fB (s,
l l l + + u u u u + +
w) = [fA (s) fA (w)]h3 (Nm (s) Nm (w)), and fB (s, w) = [fA (s) fA (w)]h3 (Nm (s) Nm (w)).
The 2step IVNC-graph is illustrated by the following example.
Example 2.10. Consider an IVN-digraph G = (A, B ) on X = {s, w, a, b, c, d}, such that A = {(s,
[0.4, 0.5], [0.5, 0.7], [0.8, 0.9]), (w, [0.6, 0.7], [0.4, 0.6], [0.2, 0.3]), (a, [0.2, 0.6], [0.3, 0.6], [0.2, 0.6]), (b,
[0.2, 0.6], [0.1, 0.6], [0.2, 0.6]), (c, [0.2, 0.7], [0.3, 0.5], [0.2, 0.6]), d([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])}, and B =
{((s, a), [0.1, 0.4], [0.3, 0.6], [0.2, 0.6]), ((a, c), [0.2, 0.6], [0.3, 0.5], [0.2, 0.6]), ((a, d), [0.2, 0.6], [0.3, 0.5],
[0.2, 0.4]), ((w, b), [0.2, 0.6], [0.1, 0.6], [0.2, 0.3]), ((b, c), [0.2, 0.4], [0.1, 0.2], [0.1, 0.3]), ((b, d), [0.1, 0.3],
[0.1, 0.2], [0.2, 0.4])}, as shown in Fig. 11.
14
s([0.4, 0.5], [0.5, 0.7], [0.8, 0.9]) w([0.6, 0.7], [0.4, 0.6], [0.2, 0.3])
b
b
([0.1, 0.4], [0.3, 0.6], [0.2, 0.6])
b([0.2
a([0
, 0.6],
.2, 0
.6], [0
[0.1
([0
b
)
b
. 2, .3 ]
, 0.6],
.3, 0
0 .6 ,0
], [
0 ,[0 .1
.2 ]
.6], [0
.3 ,
])
([0
[0.2,
0
0 .4
0 .5
.1 ,
.2
], [ , [0
, 0.
.2 ,
.2, 0
0 ]
0.6])
.2 , 0 .4
], [0
6 ],
0 .4 . 2,
.6])
]) ([0
[0.
0 .2
3 , 0.
.1 ,
5 ],
, [0
[0.
.3 ]
2
1, 0
, 0.
.
6])
([0
b
b
c([0.2, 0.7], [0.3, 0.5], [0.2, 0.6]) d([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])
We calculate N+ +
2 (s) = {(c, [0.1, 0.4], [0.3, 0.5], [0.2, 0.6]), (d, [0.1, 0.4], [0.3, 0.5], [0.2, 0.4])} and N2 (w) =
+ +
{(c, [0.2, 0.4], [0.1, 0.2], [0.1, 0.3]), (d, [0.1, 0.3], [0.1, 0.2], [0.2, 0.3])}. Therefore, N2 (s) N2 (w) = {(c,
[0.1, 0.4], [0.1, 0.2], [0.2, 0.6]), (d, [0.1, 0.3], [0.1, 0.2], [0.2, 0.4])}. Thus, tlB (s, w) = 0.04, tuB (s, w) = 0.20,
ilB (s, w) = 0.04, iuB (s, w) = 0.12, fBl (s, w) = 0.04 and fBu (s, w) = 0.12. This graph is depicted in Fig.
12.
s([0.4, 0.5], [0.5, 0.7], [0.8, 0.9]) w([0.6, 0.7], [0.4, 0.6], [0.2, 0.3])
b
b
6])
, 0.
.2 , 0
[0.2
. 6 ],
6 ],
[0.3
, 0.
b
b
, 0 .6
[0.1
6 ],
], [0
, 0.
.2 , 0
0 .2
.6])
b([
b
b
c([0.2, 0.7], [0.3, 0.5], [0.2, 0.6]) d([0.2, 0.6], [0.3, 0.6], [0.2, 0.6])
15
w X is strong prey if
B1l (ui , vi ) > 0.5, B2l (ui , vi ) > 0.5, B3l (ui , vi ) < 0.5,
B1u (ui , vi ) > 0.5, B2u (ui , vi ) > 0.5, B3u (ui , vi ) < 0.5, for all i = 1, 2, . . . , r.
The strength of the prey w can be measured by the mapping S : X [0, 1], such that:
( r r r
1 X X X
S(w) = [B1l (ui , vi )] + [B1u (ui , vi )] + [B2l (ui , vi )]
r i=1 i=1 i=1
r r r
)
X u
X l
X u
+ [B2 (ui , vi )] [B3 (ui , vi )] [B3 (ui , vi )] .
i=1 i=1 i=1
Example 2.11. Consider an IVN-digraph G = (A, B ) as shown in Fig. 11, the strength of the prey c
is equal to
(0.2 + 0.2) + (0.6 + 0.4) + (0.1 + 0.1) + (0.6 + 0.2) (0.2 + 0.1) (0.3 + 0.3)
= 1.5 > 0.5.
2
Hence, c is strong 2-step prey.
We state the following theorem without its proof.
Theorem 2.6. If a prey w of G = (A, B ) is strong, then the strength of w, S(w) > 0.5.
Remark: The converse of the above theorem is not true, i.e. if S(w) > 0.5, then all preys may not be
strong. This can be explained as:
Let S(w) > 0.5 for a prey w in G . So,
( r r r
1 X X X
S(w) = [B1l (ui , vi )] + [B1u (ui , vi )] + [B2l (ui , vi )]
r i=1 i=1 i=1
r r r
)
X u
X
l X u
+ [B2 (ui , vi )] [B3 (ui , vi )] [B3 (ui , vi )] .
i=1 i=1 i=1
Hence,
( r r r
X X X
[B1l (ui , vi )] + [B1u (ui , vi )] + [B2l (ui , vi )]
i=1 i=1 i=1
r r r
)
X
u
X l X r
+ [B2 (ui , vi )] [B3 (ui , vi )] [B3u (ui , vi )] > .
i=1 i=1 i=1
2
16
Nm (s) = (Xs , [tls , tus ], [ils , ius ], [fsl , fsu ]), where
Xs = {w| there exists a directed interval-valued neutrosophic path of length m from s to w, Pm s,w },
tls : Xs [0, 1], tus : Xs [0, 1], ils : Xs [0, 1], ius : Xs [0, 1], fsl : Xs [0, 1], fsu : Xs [0,
1], are defined by tls = min{tl (s1 , s2 ), (s1 , s2 ) is an edge of Pm u u
s,w }, ts = min{t (s1 , s2 ), (s1 , s2 ) is an
m l l m u u
edge of Ps,w }, is = min{i (s1 , s2 ), (s1 , s2 ) is an edge of Ps,w }, is = min{i (s1 , s2 ), (s1 , s2 ) is an edge
of Pm l l m u u
s,w }, fs = min{f (s1 , s2 ), (s1 , s2 ) is an edge of Ps,w }, fs = min{f (s1 , s2 ), (s1 , s2 ) is an edge of
m
Ps,w }, respectively.
Definition 2.22. Suppose G = (A, B) is an IVN-graph. Then m-step interval-valued neutrosophic
neighbouhood graph Nm (G) is defined by Nm (G) = (A, B) where A = ([Al1 , Au1 ], [Al2 , Au2 ], [Al3 , Au3 ]),
B = ([B1l , B1u ], [B2l , B2u ], [B3l , B3u ]), B1l : X X [0, 1], B1u : X X [0, 1], B2l : X X [0, 1],
B2u : X X [0, 1], B3l : X X [0, 1], and B3u : X X [0, 1] are such that:
B1l (s, w) = Al1 (s) Al1 (w)hl1 (Nm (s) Nm (w)), B1u (s, w) = Au1 (s) Au1 (w)hu1 (Nm (s) Nm (w)),
B2l (s, w) = Al2 (s) Al2 (w)hl2 (Nm (s) Nm (w)), B2u (s, w) = Au2 (s) Au2 (w)hu2 (Nm (s) Nm (w)),
B3l (s, w) = Al3 (s) Al3 (w)hl3 (Nm (s) Nm (w)), B3u (s, w) = Au3 (s) Au3 (w)hu3 (Nm (s) Nm (w)), respectively.
3 Conclusion
Graph theory is an enjoyable playground for the research of proof techniques in discrete mathematics.
There are many applications of graph theory in different fields. We have introduced IVNC-graphs and
k-competition IVN-graphs, p-competition IVN-graphs and m-step IVNC-graphs as the generalized struc-
tures of IVNC-graphs. We have described interval-valued neutrosophic open and closed-neighbourhood.
Also we have established some results related to them. We aim to extend our research work to (1) Interval-
valued fuzzy rough graphs; (2) Interval-valued fuzzy rough hypergraphs, (3) Interval-valued fuzzy rough
neutrosophic graphs, and (4) Decision support systems based on IVN-graphs.
References
[1] M. Akram and W.A. Dudek, Interval-valued fuzzy graphs, Computers Math. Appl., 61 (2011)
289-299.
[2] M. Akram, Interval-valued fuzzy line graphs, Neural Computing & Applications, 21 (2012) 145-150.
[3] M. Akram, N.O. Al-Shehrie and W.A. Dudek, Certain types of interval-valued fuzzy graphs, Journal
of Applied Mathematics, Volume 2013 Article ID 857070(2013) 11 pages.
[4] M. Akram, W.A. Dudek and M. Murtaza Yousaf, Self centered interval-valued fuzzy graphs, Afrika
Matematika, 26(5-6) (2015) 887-898.
17
[5] M. Akram and M. Nasir, Concepts of interval-valued neutrosophic graphs, International Journal
of Algebra and Statistics, 6(1-2) (2017) 22-41 DOI :10.20454/ijas.2017.1235.
[6] M. Akram and S. Shahzadi, Neutrosophic soft graphs with application, Journal of Intelligent &
Fuzzy Systems, 32(1) (2017) 841-858.
[7] M. Akram, Single-valued neutrosophic planar graphs, International Journal of Algebra and Statis-
tics, 5(2) (2016) 157-167.
[8] M. Akram and G. Shahzadi, Operations on single-valued neutrosophic graphs, Journal of Uncertain
System, 11(2) (2017) 1-26.
[9] N.O. Al-Shehrie and M. Akram, Bipolar fuzzy competition graphs, Ars Combinatoria, 121 (2015),
385-402.
[10] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy sets and Systems, 20 (1986) 87-96.
[11] P. Bhattacharya, Some remark on fuzzy graphs, Pattern Recognition Letters, 6 (1987) 297-302.
[12] A. Kauffman, Introduction a la theorie des sousemsembles flous, Masson et cie Paris, (1973).
[13] J.M. Mendel, Uncertain rule-based fuzzy logic systems: Introduction and new directions, Prentice-
Hall, Upper Saddle River, New Jersey, (2001).
[14] M. Nasir, S. Siddique and M. Akram, Novel properties of intuitionistic fuzzy competition graphs,
Journal of Uncertain Systems, 2(1) (2017) 49-67.
[15] A. Rosenfeld, Fuzzy graphs, Fuzzy Sets and their Application, Academic press New York, (1975)
77-95.
[16] S. Samanta and M. Pal, Fuzzy k-competition graphs and p-competition fuzzy graphs, Fuzzy Infor-
mation and Engineering, 5 (2013) 191-204.
[17] S. Samanta, M. Akram and M. Pal, m-step fuzzy competition graphs, Journal of Applied Mathe-
matics and Computing, 47 (2015) 461-472.
[18] M. Sarwar and M. Akram, Novel concepts of bipolar fuzzy competition graphs, Journal of Applied
Mathematics and Computing, (2016), DOI 10.1007/s12190-016-1021-z.
[19] F. Smarandache, A unifying field in logics. neutrosophy: neutrosophic probability, set and logic.
Rehoboth:, American Research Press, (1999).
[20] F. Smarandache, Neutrosophic set- a generalization of the intuitionistic fuzzy set, Granular Com-
puting. 2006 IEEE International Conference, (2006) 38-42 DOI: 10.1109/GRC.2006.1635754.
[21] H. Wang, F. Smarandache, Y.Q. Zhang and R. Sunderraman, Single-valued neutrosophic sets,
Multisspace and Multistruct, 4 (2010) 410-413.
[22] H. Wang, Y. Zhang and R. Sunderraman, Truth-value based interval neutrosophic
sets, Granular Computing, 2005 IEEE International Conference, 1 (2005) 274-277 DOI:
10.1109/GRC.2005.1547284.
[23] H. Wang, F. Smarandache, Y.Q. Zhang and R. Sunderram, An Interval neutrosophic sets and logic:
theory and applications in computing, Hexis Arizona, (2005).
[24] S.Y. Wu, The compositions of fuzzy digraphs, Journal of Research in Education Science, 31 (1986)
603-628.
[25] L.A. Zadeh, Fuzzy sets, Information and Control, 08(3) (1965) 338-353.
[26] L.A. Zadeh, The concept of a linguistic and application to approximate reasoning I, Information
Sci., 8 (1975) 199-249.
18