Punjab University

Journal of Mathematics (ISSN 1016-2526)

Vol. 50(1)(2018) pp. 113-137

Interval-Valued Neutrosophic Graph Structures

Muhammad Akram
Department of Mathematics,
University of the Punjab,
New Campus, Lahore, Pakistan.
Email: m.akram@pucit.edu.pk

Muzzamal Sitara
Department of Mathematics,
University of the Punjab,
New Campus, Lahore, Pakistan.
Email: muzzamalsitara@gmail.com

Received: 16 May, 2017 / Accepted: 11 October, 2017 / Published online: 16

November, 2017

Abstract. In this research article, we introduce certain notions of

interval-valued neutrosophic graph structures. We elaborate the
concepts of interval-valued neutrosophic graph structures with
examples. Moreover, we discuss the concept of ϕ-complement
of an interval-valued neutrosophic graph structure. Finally, we
present some related properties, including ϕ-complement, totally-
self complementary and totally-strong-self complementary, of interval-
valued neutrosophic graph structures.

AMS (MOS) Subject Classification Codes: 35S29, 40S70, 25U09

Key Words: Graph structure, Interval-valued neutrosophic graph structure, ϕ-
complement.

1. I NTRODUCTION
Zadeh [33] introduced interval-valued fuzzy set theory which is an extension of
fuzzy set theory [32]. Membership degrees in an interval-valued fuzzy set are
intervals rather than numbers and uncertainty is reflected by length of interval
membership degree. Zhan et al. [35, 36] applied the concept of interval-valued
fuzzy sets to algebraic structures. For representing vagueness and uncertainty
Atanassov [10] proposed an extension of fuzzy sets by adding a new component,
called intuitionistic fuzzy sets. The concept of intuitionistic fuzzy sets is more
meaningful and inventive due to the presence of degree of truth, indeterminacy

113
114 M. Akram and M. Sitara

and falsity membership. The intuitionistic fuzzy sets have more describing possi-
bilities as compared to fuzzy sets. The hesitation margin of an intuitionistic fuzzy
set is its uncertainty by default and sum of truth-membership degree and falsity-
membership degree does not exceeds unity. In many phenomenons like informa-
tion fusion, uncertainty and indeterminacy is doubtlessly quantified. Smarandache
[24, 25] proposed the idea of neutrosophic sets, he mingled tricomponent logic,
non-standard analysis, and philosophy. “It is a branch of philosophy which studies
the origin, nature and scope of neutralities as well as their interactions with differ-
ent ideational spectra”. For convenient and advantageous usage of neutrosophic
sets in science and engineering, Wang et al. [29] proposed the notion of single-
valued neutrosophic(SVNS)sets, whose three independent components have val-
ues in standard unit interval [0, 1]. Neutrosophic set theory being a generalization
of fuzzy set theory and intuitionistic fuzzy set theory, is more practical, advanta-
geous and applicable in various fields, including medical diagnosis, control theory,
topology, decision-making problems and in many more real-life problems. Wang
et al. [30] proposed the notion of interval-valued neutrosophic sets, which is more
precise and flexible than the single-valued neutrosophic sets. An interval-valued
neutrosophic set is a generalization of the notion of single-valued neutrosophic
set, in which three independent components (t, i, f ) are intervals which are sub-
sets of standard unit interval [0, 1].
On the basis of Zadeh’s fuzzy relations [35] Kaufmann proposed fuzzy graph
[18]. Rosenfeld [22] discussed fuzzy analogue of various graph-theoretic ideas.
Later on, Bhattacharya [11] gave some remarks on fuzzy graphs, and some op-
erations on fuzzy graphs were introduced by Mordeson and Peng [19]. Morde-
son and Nair presented a valuable contribution on fuzzy graphs as well as fuzzy
hypergraphs in [20]. Mathew and Sunitha [26, 27] discussed arcs and strong cy-
cles in fuzzy graphs. On the other hand, Dinesh and Ramakrishnan [14] defined
fuzzy graph structures and discussed its properties. Akram and Akmal [7] pro-
posed the notion of bipolar fuzzy graph structures. Akram et al. [1, 2, 3, 4] have
introduced several concepts on interval-valued fuzzy graphs and interval-valued
neutrosophic graphs. Akram and Shahzadi [8] introduced the notion of neutro-
sophic soft graphs with applications. Recently, Akram and Nasir [5, 6] considered
interval-valued neutrosophic graphs. In this research article, we introduce certain
notions of interval-valued neutrosophic graph structures. We elaborate the con-
cepts of interval-valued neutrosophic graph structures with examples. Moreover,
we discuss the concept of ϕ-complement of an interval-valued neutrosophic graph
structure.

2. I NTERVAL -VALUED N EUTROSOPHIC G RAPH S TRUCTURES

Sampathkumar [23] introduced the graph structure which is a generalization of
undirected graph and is quite useful in studying some structures, including, graphs,
signed graphs, labelled graphs and edge colored graphs.
Definition 2.1. [23] A graph structure G = (U, R1 , . . . , Rt ) consists of a non-
empty set U together with relations R1 , R2 , . . . , Rt on U which are mutually dis-
joint such that each Rj , 1 ≤ j ≤ t, is symmetric and irreflexive.
Interval-Valued Neutrosophic Graph Structures 115

One can represent a graph structure G = (U, R1 , . . . , Rt ) in the plane just like a
graph where each edge is labelled as Rj , 1 ≤ j ≤ t.

Example 2.2. Let U = {r1 , r2 , r3 , r4 , r5 }. Let R1 = {(r1 , r2 ), (r3 , r4 ), (r1 , r4 )},

R2 = {(r1 , r3 ), (r1 , r5 )}, R3 = {(r2 , r3 ), (r4 , r5 )} be mutually disjoint, symmetric
and irreflexive relations on set U . Thus G = (U, R1 , R2 , R3 ) is a graph structure
and is represented in plane as a graph where each edge is labelled as R1 , R2 or
R3 .

r1
b

R1 R2

b b r5
r2 R2 R1

R3 R3

b b
r3 R1 r4

F IGURE 1. Graph structure G = (U, R1 , R2 , R3 )

Definition 2.3. [30, 31] The interval-valued neutrosophic set I on set U is defined
by
I = {(r, [t− (r), t+ (r)], [i− (r), i+ (r)], [f − (r), f + (r)]) : r ∈ U },
where, t− , t+ , i− , i+ , f − , and f + are functions from U to [0, 1] such that:
t− (r) ≤ t+ (r), i− (r) ≤ i+ (r) and f − (r) ≤ f + (r) for all r ∈ U .

Definition 2.4. Ǧiv = (I, I1 , I2 , . . . , It ) is called an interval-valued neutrosophic

graph structure(IVNGS) of graph structure G = (U, R1 , R2 , . . . , Rt ) if
I = {(r, [t− (r), t+ (r)], [i− (r), i+ (r)], [f − (r), f + (r)]) : r ∈ U }
+ + +
and Ij = { ((r, s), [t− − −
j (r, s), tj (r, s)], [ij (r, s), ij (r, s)], [fj (r, s), fj (r, s)]) : (r, s) ∈
Rj } are interval-valued neutrosophic(IVN) sets on U and Rj , respectively, such
that:
(1) t− − −
j (r, s) ≤ min{t (r), t (s)}, t+ + +
j (r, s) ≤ min{t (r), t (s)},
(2) i− − −
j (r, s) ≤ min{i (r), i (s)}, i+ + +
j (r, s) ≤ min{i (r), i (s)},
− +
(3) fj (r, s) ≤ min{f (r), f (s)}, fj (r, s) ≤ min{f (r), f + (s)},
− − +

+ − + +
where, t− −
j , tj , ij , ij , fj , and fj are functions from Rj to [0, 1] such that
tj (r, s) ≤ tj (r, s), ij (r, s) ≤ i+
− + − − +
j (r, s) and fj (r, s) ≤ fj (r, s) for all (r, s) ∈
Rj .
In this paper we will use rs in place of ordered pair (r, s) which represents an
edge between vertices r and s.
116 M. Akram and M. Sitara

r2 ([0.2, 0.3], [0.4, 0.5], [0.3, 0.4])

I1 (
[0.

b
2, 0
.3 ] r1
, [0 ([0
.4

0 . 4 ])
I2 ([0.2, 0.3], [0.4, 0.5], [0.2, 0.3])
, 0. . 2,
5 ],

0 . 3 ])
[0. 0 .3
3, 0 ], [

[0 . 3 ,
.4 ] 0 .5

[0 . 2 ,
) ,0
.6 ]

0 .5 ] ,
, [0

b
0 .5 ],
I2 ([0.2, 0.3], [0.4, 0.5
], [0.3, 0.4]) .4, 0

b
0 .4 ,
.5 ]
) )

0 .4 ,
.4 ]

.4 ] , [
0
.3 ,

.4 ], [
, [0

.3 , 0
]
0 .6

.3 , 0
5,

r4 ([0
[0.

I1 ([0
,
.3 ]
.2 ,0
([0
I1

b
r3 ([0.3, 0.4], [0.6, 0.7], [0.3, 0.4])

F IGURE 2. Interval-valued neutrosophic graph structure

Example 2.5. Consider the graph structure G = (U, R1 , R2 ) such that U =

{r1 , r2 , r3 , r4 }, R1 = {r1 r3 , r1 r2 , r3 r4 }, R2 = {r1 r4 , r2 r3 }. By defining interval-
valued neutrosophic sets I, I1 and I2 on U , R1 and R2 , respectively, we draw an
IVNGS as shown in Fig. 2.

Definition 2.6. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS of graph structure(GS)

G = (U, R1 , R2 , . . . , Rt ). If Ȟiv = (I ′ , I1′ , I2′ , . . . , It′ ) is an IVNGS of G such that

t′− (r) ≤ t− (r), i′− (r) ≤ i− (r), f ′− (r) ≤ f − (r),

t′+ (r) ≤ t+ (r), i′+ (r) ≤ i+ (r), f ′+ (r) ≤ f + (r) ,

t′− − ′− − ′−
j (rs) ≤ tj (rs), ij (rs) ≤ ij (rs), fj (rs) ≤ fj (rs),
−
′+ + ′+ + ′+ +
tj (rs) ≤ tj (rs), ij (rs) ≤ ij (rs), fj (rs) ≤ fj (rs),
for all r ∈ U and rs ∈ Rj , j = 1, 2, . . . , t.

Then Ȟiv is called an interval-valued neutrosophic(IVN) subgraph-structure of

IVNGS Ǧiv .

Example 2.7. Consider an IVNGS Ȟiv = (I ′ , I1′ , I2′ ) of graph structure G =

(U, R1 , R2 ) as illustrated in Fig. 3. Through direct calculations, it is shown that
Ȟiv is an IVN subgraph-structure of IVNGS Ǧiv shown in Fig. 2.
Interval-Valued Neutrosophic Graph Structures 117

r2 ([0.2, 0.3], [0.4, 0.5], [0.3, 0.4])

I1′(
[0.

b
2, 0
.3 ]

r1 ([0.2, 0.3], [0.5, 0.6], [0.4, 0.5])

, [0
.4 , 0.

I2′ ([0.2, 0.3], [0.4, 0.5], [0.2, 0.3])

5 ],
[0.
3, 0
.4 ]
)

b
])
0 .4
3,
], [0.
, 0 .6
,[0 .5
0 .3 ]
0 .2 ,
′ ([
I1

b
r3 ([0.3, 0.4], [0.6, 0.7], [0.3, 0.4])

F IGURE 4. IVN induced subgraph-structure

r2 ([0.1, 0.2], [0.3, 0.4], [0.2, 0.3])

I1′(
[0.
b

1, 0
.2 ] r1
, [0 ([0
.3
0.3])
I2′ ([0.1, 0.2], [0.3, 0.4], [0.1, 0.2])

, 0. . 1,
4 ],
0.2])

[0. 0 .2
2, 0 ], [
[0.2,

.3 ] 0 .4
[0.1,

) ,0
.5 ]
0 .4 ] ,

, [0
b

I2′ ([0.1, 0.2], [0.3, 0.4

0 .4 ],

], [0.2, 0.3]) .3, 0

b
0 .3 ,

.4 ]
) )
0 .3 ,

.3 ]
.3 ] , [

0
.2 ,
.3 ], [

, [0
.2 , 0

]
0 .5
.2 , 0

4,
r4 ([0

0.
], [
I1′ ([0

0 .2
. 1,
′ ([0
I 1
b

r3 ([0.2, 0.3], [0.5, 0.6], [0.2, 0.3])

F IGURE 3. Interval-valued neutrosophic subgraph-structure

Definition 2.8. An IVNGS Ȟiv = (I ′ , I1′ , I2′ , . . . , It′ ) is called an IVN induced
subgraph-structure of IVNGS Ǧiv by Q ⊆ U if
t′− (r) = t− (r), i′− (r) = i− (r), f ′− (r) = f − (r),
t′+ (r) = t+ (r), i′+ (r) = i+ (r), f ′+ (r) = f + (r),
+
t′− − ′− − ′− − ′+
j (rs) = tj (rs), ij (rs) = ij (rs), fj (rs) = fj (rs), tj (rs) = tj (rs),
′+ + ′+ +
ij (rs) = ij (rs), fj (rs) = fj (rs), for all r, s ∈ Q, j = 1, 2, . . . , t.

Example 2.9. An IVNGS Ȟiv = (I ′ , I1′ , I2′ ) of graph structure G = (U, R1 , R2 )

shown in Fig. 4 is an IVN induced subgraph-structure of IVNGS Ǧiv = (I, I1 , I2 )
represented in Fig. 2.
Definition 2.10. An IVNGS Ȟiv = (I ′ , I1′ , I2′ , . . . , It′ ) is called IVN spanning
subgraph-structure of IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) if I ′ = I and
t′− − ′− − ′−
j (rs) ≤ tj (rs), ij (rs) ≤ ij (rs), fj (rs) ≤ fj (rs),
−
118 M. Akram and M. Sitara

0 . 3 ])
.2 , 0 . 5
])
, [0 4,
. 4 ] [0 .
])

, 0 6 ],
.4
,0

0 .3 0 .
])

.3
0 .3

], [ . 5 ,
, [0

b
.2 ,

0 . 2 ] , [0
[0

5]
.4 ],

.3
0.
,0
[0.3

([0 2, 0
4,

])
.2 ],

0.

′ ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3

.
1, 0

([0
], [

.1 ,
′ [0.

.3

r1
I 1(

I1
′ ([0
,0

r4

I2 ′
.2

([0
([0

.2, b 4], [0
b

.3 ,
r2

0 .3
0.

], [
I2 ′

])
0 .3 . 5 ] ,
([0

0 .4
. 1,

.4 ,

,0
0 .2

.3 ,
.4 ] . 3 ,
0
], [

], [0
, [0 0 . 4
0 .3

[0
,0

.1 ,

0 .7
.4 ]

0 .2
, [0

.6 ,
.1 ,

])

3, 0 I 1
, [0
])
0 .2
])

.4 ]
b
[0.
r3 (
F IGURE 5. IVN spanning subgraph-structure

+ + +
t′+ ′+ ′+
j (rs) ≤ tj (rs), ij (rs) ≤ ij (rs), fj (rs) ≤ fj (rs), j = 1, 2, . . . , t.

Example 2.11. An IVNGS Ȟiv = (I ′ , I1′ , I2′ ) shown in Fig. 5 is an IVN spanning
subgraph-structure of IVNGS Ǧiv = (I, I1 , I2 ) represented in Fig. 2.
Definition 2.12. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS. Then edge rs ∈ Ij is
called an IVN Ij -edge or in short an Ij -edge if
+ +
t− − −
j (rs) > 0 or ij (rs) > 0 or fj (rs) > 0 or tj (rs) > 0 or ij (rs) > 0 or
+
fj (rs) > 0
or all of conditions are satisfied. Hence support of Ij is defined as;
supp(Ij ) =
{rs ∈ Ij : t− − −
j (rs) > 0} ∪ {rs ∈ Ij : ij (rs) > 0} ∪ {rs ∈ Ij : fj (rs) > 0} ∪
{rs ∈ Ij : tj (rs) > 0} ∪ {rs ∈ Ij : ij (rs) > 0} ∪ {rs ∈ Ij : fj+ (rs) > 0},
+ +

j = 1, 2, . . . , t.
Definition 2.13. An Ij -path in an IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is a sequence
r1 , r2 , . . . , rt of distinct vertices (except rt = r1 ) in U such that rj−1 rj is an IVN
Ij -edge for all j = 2, 3, . . . , t.
Definition 2.14. An IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is Ij -strong for any j ∈
{1, 2, . . . , t} if
t− − − − − −
j (rs) = min{t (r), t (s)}, ij (rs) = min{i (r), i (s)},
fj− (rs) = min{f − (r), f − (s)}, t+ + +
j (rs) = min{t (r), t (s)},
+ + + + + +
ij (rs) = min{i (r), i (s)}, fj (rs) = min{f (r), f (s)},
for all rs ∈ supp(Ij ). If Ǧiv is Ij -strong for all j ∈ {1, 2, . . . , t}, then Ǧiv is
called a strong IVNGS.
Interval-Valued Neutrosophic Graph Structures 119

r2 ([0.3, 0.4], [0.6, 0.7], [0.3, 0.4]) r1 ([0.4, 0.5], [0.6, 0.7], [0.4, 0.5])

0.4])

])
0.5

])
0.5
.4,
0.3,

, [0

4,
([0 I2 ([0.3, 0.4], [0.6, 0.7], [0.3, 0.4])
I1

, [0 I3 ([0.2, 0.3], [0.6, 0.7], [0.3, 0.4]) , [0.

[

.7]
0.7],
b .2, b

,0

.7]
0.3

0.6

0
], [

0.6,

,
0.6
], [
0.6

r 3(

0.4
,0

[
[

,
.7]

0.3],

.4]
[0.

3,
, [0

0
.
.3.

([0

3,

r5 ([0.2, 0.3], [0.7, 0.8], [0.3, 0.4])

0.4

,0

0.2,

.
([0
r4
])

.3 ]

I2
I3 ([
b b

, [0
I3 ([0.2, 0.3], [0.6, 0.7], [0.4, 0.5])

.7 ,
0 .8

I1
([0

I2 ([0.1, 0.2], [0.5, 0.6], [0.4, 0.5])

], [

.1
,0
0 .5
b

.2

])
],
,0

0.4
[0
.6 ]

.5

.3,
,0
)

.6
],
[0

.6]
.4

,0
,0

0.5
.5
])

], [
0.2
b

1, .
([0
I2
r6 ([0.1, 0.2], [0.5, 0.6], [0.4, 0.5])

F IGURE 6. Strong IVNGS

Example 2.15. Consider an IVNGS Ǧiv = (I, I1 , I2 , I3 ) as shown in Fig. 6. Ǧiv

is a strong IVNGS, since it is I1 , I2 and I3 strong.
Definition 2.16. An IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is called complete IVNGS,
if
(1) Ǧiv is a strong IVNGS.
(2) Supp(Ij ) 6= ∅, for all j = 1, 2, . . . , t.
(3) For all r, s ∈ U , rs is an Ij − edge for some j.

Example 2.17. Let Ǧiv = (I, I1 , I2 , I3 ) be an IVNGS of graph structure G =

(U, R1 , R2 , R3 ) and it is shown in Fig.7. Where, U = {r1 , r2 , r3 , r4 , r5 , r6 },
R1 = {r1 r6 , r1 r2 , r2 r4 , r2 r5 , r2 r6 ,
r4 r5 }, R2 = {r4 r3 , r5 r6 , r1 r4 }, R3 = {r1 r5 , r5 r3 , r2 r3 , r1 r3 , r4 r6 }. By direct
calculations, we can show that Ǧiv is a strong IVNGS. Moreover, supp(I1 ) 6= ∅,
supp(I2 ) 6= ∅, supp(I3 ) 6= ∅ and each pair rj rk of nodes in U , is either an
I1 − edge or I2 −edge or I3 − edge. Hence Ǧiv is a complete IVNGS, that is,
I1 I2 I3 −complete IVNGS.
Definition 2.18. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS. The truth strength
[t− .PIj , t+ .PIj ], indeterminacy strength [i− .PIj , i+ .PIj ] and falsity strength
[f − .PIj , f + .PIj ] of an Ij -path, PIj = r1 , r2 , . . . , rn are defined as:
V
n Vn
[t− .PIj , t+ .PIj ] = [ [t− Ij (rk−1 rk )], [t+
Ij (rk−1 rk )]],
k=2 k=2
V
n V
n
[i− .PIj , i+ .PIj ] = [ [i−
Ij (rk−1 rk )], [i+
Ij (rk−1 rk )]],
k=2 k=2
120 M. Akram and M. Sitara

r1 ([0.2, 0.3], [0.3, 0.4], [0.5, 0.6]) r2 ([0.3, 0.4], [0.3, 0.4], [0.5, 0.6])
I1 (
[0.

])
2, 0

.4
I3 . 3], I1 ([0.2, 0.3], [0.3, 0.4], [0.5, 0.6]) )
([0 0.5]

,0
. [ 0.1 0.4,

.3
2, b .4], [

[0
0.3 , 0.2 b
.3, 0

I3 ([0.2, 0.3], [0.3, 0.4], [0.4, 0.5])

]

],
, [0 ] , [0 3], [0

.2
.3, .3, , 0.

,0
([0.2

.5])
0.4 0.4

.1
] ] ) I1

[0
, [0

.4, 0

],
.4,

r4 ([0.2, 0.3], [0.3, 0.4], [0.4, 0.5])

.4
0.5

,0
]

r3 ([0.2, 0.3], [0.4, 0.5], [0.4, 0.5])

], [0
)

.3
([0
, 0.4
I3 ([0.2, 0.3], [0.1, 0.2], [0.3, 0.4])

I1
b b
I2 ([0
.2, 0.3r6 ([0.3, 0.4], [0.1, 0.2], [0.3, 0.4])

[0.3
I1 ], [0.3
([0 , 0.4],

,
0.3]
.2 [0.4,
,0 0.5])
.3

0.2,
], [
0.
2,

I 3(
I2 ([ 0. b

I2 ([0.2, 0.3], [0.1, 0.2], [0.3, 0.4])

3]

[0.2

])
0.4])
, [0

0.4
.3
,0

, 0.3

.3,
.4

[0.3,
])

], [0
], [0

, 0.3],

0.3
.2, 0

.2,
.3],
b

], [0.2

, [0
[0.3

.3]
2, 0
.2, 0.3
, 0.4

[0.
])

I3 (
I1 ([0
r5 ([0.2, 0.3], [0.2, 0.3], [0.3, 0.4])

F IGURE 7. Complete IVNGS

r2 ([0.3, 0.4], [0.4, 0.5], [0.3, 0.4])
I1

])
r3
([0

5
0.
([0
.3

4,
,0

.3
.
, [0
,0
.4

] b
], [

,0
.4 .4 I2 ([0.3, 0.4], [0.1, 0.2], [0.3, 0.4])
], [
])

0.

3
0 .3

0.
1,

0.
], [ 4,
b
0.
I1 ([0.1, 0.2], [0.3, 0.4], [0.2, 0.3])

.2 ,

b
0.
2]

.3
5]
, [0

, [0

0
. 2, , [0
.3
.5 ]

])

([0 .3
,0

.4
,0

,0
,0
.4

r1
0 .4

.4
])

.3

])
, [0
], [

5]
0 .2

0.
1,

4,

])
.
I2

0.
([0

0 .4
], [
([0
r4

I1

.4
.2

.3 ,
([0

,0
,0

, [0
.1

.3
.3
,0

([0
], [

.2 ]

b b
.2

b
0.

,0
I2
], [

3,

0 .1
0.

0.
4,

4]

], [
0.

, [0

0 .4
5]

.3
, [0

3,
,0
.2

.
.4

([0
,0

])
.3

r6

r5 ([0.3, 0.4], [0.4, 0.5], [0.3, 0.4])

])

F IGURE 8. IVNGS Ǧiv = (I, I1 , I2 )

V
n V
n
[f − .PIj , f + .PIj ] = [ [fI−j (rk−1 rk )], [fI+j (rk−1 rk )]].
k=2 k=2

Example 2.19. Consider an IVNGS Ǧiv = (I, I1 , I2 ) of Graph structure G =

(U, R1 , R2 ) as shown in Fig. 8. For I2 -path PI2 = r1 , r5 , r3 , r6 , [t− .PI2 , t+ .PI2 ]
= [0.2, 0.3], [i− .PI2 , i+ .PI2 ] = [0.1, 0.2] and [f − .PI2 , f + .PI2 ] = [0.3, 0.4].
Definition 2.20. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS. Then
Interval-Valued Neutrosophic Graph Structures 121

• Ij - Truth strength of connectedness between two nodes r and s is defined

by: W −i W +i
+∞
[t−∞
Ij (rs), tIj (rs)] = [ {tIj (rs)}, {tIj (rs)}] such that
i≥1 i≥1
+i −(i−1) −(1) +(i−1) +(1)
[t−i
Ij (rs), tIj (rs)] = [(tIj ◦tIj )(rs), (tIj ◦tIj )(rs)] for i ≥ 2
−2 +2 −1 −1 +1
and [tIj (rs), tIj (rs)] = [(tIj ◦ tIj )(rs), (tIj ◦ t+1 Ij )(rs)]
W W +1 +1
= [ (t−1Ij (ry) ∧ t −1
Ij (ys)), (t Ij (ry) ∧ t Ij (ys))].
y y
• Ij - Indeterminacy strength of connectedness between two nodes r and s
is defined by: W −i W +i
+∞
[i−∞
Ij (rs), iIj (rs)] = [ {iIj (rs)}, {iIj (rs)}] such that
i≥1 i≥1
−i +i −(i−1) −(1) +(i−1) +(1)
[iIj (rs), iIj (rs)] = [(iIj ◦iIj )(rs), (iIj ◦iIj )(rs)] for i ≥ 2
+2 +1 +1
and [i−2 (rs), i (rs)] = [(i −1
◦ i −1
)(rs), (i ◦ i Ij )(rs)]
W I−1j Ij
−1 W Ij
+1
Ij
+1
Ij
= [ (iIj (ry) ∧ iIj (ys)), (iIj (ry) ∧ iIj (ys))].
y y
• Ij - Falsity strength of connectedness between two nodes r and s is de-
fined by: W W +i
[fI−∞
j
(rs), fI+∞
j
(rs)] = [ {fI−ij
(rs)}, {fIj (rs)}] such that
i≥1 i≥1
−(i−1) −(1) +(i−1) +(1)
[fI−i
j
(rs), fI+i
j
(rs)] = [(fIj ◦ fIj )(rs), (fIj ◦ fIj )(rs)] for
i ≥ 2 and [fIj (rs), fIj (rs)] = [(fIj ◦ fIj )(rs), (fIj ◦ fI+1
−2 +2 −1 −1 +1
)(rs)]
W −1 −1 W +1 +1
j

= [ (fIj (ry) ∧ fIj (ys)), (fIj (ry) ∧ fIj (ys))].

y y

Definition 2.21. An IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is called an Ij -cycle if (supp(I),

supp(I1 ),supp(I2 ), . . . , supp(It )) is an Ij − cycle.

Definition 2.22. An IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is an IVN fuzzy Ij -cycle

(for some j) if Ǧiv is an Ij -cycle and no unique Ij -edge rs exists in Ǧiv such that:
+
[t− −
Ij (rs), tIj (rs)] = [min{tIj (uv) : uv ∈ Ij = supp(Ij )},
+
min{tIj (uv) : uv ∈ Ij = supp(Ij )}] or
+
[i− −
Ij (rs), iIj (rs)] = [min{iIj (uv) : uv ∈ Ij = supp(Ij )},
+
min{iIj (uv) : uv ∈ Ij = supp(Ij )}] or
[fI−j (rs), fI+j (rs)] = [min{fI−j (uv) : uv ∈ Ij = supp(Ij )},
min{fI+j (uv) : uv ∈ Ij = supp(Ij )}].

Example 2.23. Consider an IVNGS Ǧiv = (I, I1 , I2 ) of graph structure G =

(U, R1 , R2 ) as shown in Fig. 9.
122 M. Akram and M. Sitara

r4 ([0.2, 0.3], [0.2, 0.3], [0.4, 0.5])

5]) I2 ([0
, 0. .2 ,
[0.4

b
r3 ([0.10.2], [0.4, 0.5], [0.5, 0.6])
0 .3

I2 ([0.2, 0.3], [0.2, 0.3], [0.3, 0.4])

] ,

r1 ([0.3, 0.4], [0.4, 0.5], [0.5, 0.6])

3
. 2 , 0. ], [
0 .2
] , [0 ,0
,0 .2 .3 ], [
[0.1 0 .4
I 1( ,0
.5 ]
I2 ( )
[0.

b
1, ])
0.4

b
0.2
], [ [0 .3,
0.3 ],
,0 0.4 ])
.4] .3, 0.4
, [0
.3, .3], [0 [0.3,
,
0.4 2, 0 , 0.4]
[0.
]) I 1( [0.3
.3],
. 2,0

b
r2 ([0

I2 ([0.1, 0.2], [0.4, 0.5], [0.5, 0.6])

F IGURE 9. Interval-valued neutrosophic fuzzy I2 -cycle

This IVNGS Ǧiv is an I2 -cycle, that is, r1 − r4 − r2 − r3 − r1 and no unique

I2 -edge rs exists in Ǧiv satisfying following condition:
+
[t− −
I2 (rs), tI2 (rs)] = [min{tI2 (uv) : uv ∈ I2 = supp(I2 )},
+
min{tI2 (uv) : uv ∈ I2 = supp(I2 )}] or
+
[i− −
I2 (rs), iI2 (rs)] = [min{iI2 (uv) : uv ∈ I2 = supp(I2 )},
min{i+ I2 (uv) : uv ∈ I2 = supp(I2 )}] or
[fI−2 (rs), fI+2 (rs)] = [min{fI−2 (uv) : uv ∈ I2 = supp(I2 )},
min{fI+2 (uv) : uv ∈ I2 = supp(I2 )}].
Definition 2.24. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS and ‘r’ be a vertex of
Ǧiv . If (I ′ , I1′ , I2′ , . . . , It′ ) is an IVN subgraph-structure of Ǧiv induced by U \{r}
such that for all u 6= r, v 6= r
t− − − − − −
I ′ (r) = iI ′ (r) = fI ′ (r) = tI ′ (ru) = iI ′ (ru) = fI ′ (ru) = 0, j j j

t+ + + + + +
I ′ (r) = iI ′ (r) = fI ′ (r) = tI ′ (ru) = iI ′ (ru) = fI ′ (ru) = 0, j j j
+ + + +
[t− −
I ′ (u), tI ′ (u)] = [tI (u), tI (u)], [i− −
I ′ (u), iI ′ (u)] = [iI (u), iI (u)],
− + − +
[fI ′ (u), fI ′ (u)] = [fI (u), fI (u)],
+ + + +
[t−′
Ij (uv), t ′
Ij (uv)] = [t− − −
Ij (uv), tIj (uv)], [iIj′ (uv), iIj′ (uv)] = [iIj (uv), iIj (uv)],
[fI−′ (uv), fI+′ (uv)] = [fI−j (uv), fI+j (uv)].
j j

for all edges ru, uv ∈ Ǧiv , then vertex r is an IVN fuzzy Ij cut-vertex, if
+∞ +∞ +∞
(1) t−∞ −∞ −∞
Ij (uv) > tI ′ (uv), tIj (uv) > tI ′ (uv), [tIj (uv), tIj (uv)] ∩
j j
+∞
[t−∞
I ′ (uv), tI ′ (uv)] = ∅
j j
+∞ +∞ +∞
(2) i−∞ −∞ −∞
Ij (uv) > iI ′ (uv), iIj (uv) > iI ′ (uv), [iIj (uv), iIj (uv)] ∩
j j
+∞
[i−∞
I ′ (uv), iI ′ (uv)] = ∅
j j

(3) fI−∞
j
(uv) > fI−∞
′ (uv), fI+∞
j
(uv) > fI+∞
′ (uv), [fI−∞
j
(uv), fI+∞
j
(uv)] ∩
j j

[fI−∞
′ (uv), fI+∞
′ (uv)] = ∅
j j

for some u, v ∈ U \ {r}. Note that vertex r is an

Interval-Valued Neutrosophic Graph Structures 123

+∞ +∞
• IVN fuzzy Ij −t cut-vertex, if t−∞ −∞
Ij (uv) > tI ′ (uv), tIj (uv) > tI ′ (uv), j j
+∞ +∞
[t−∞ −∞
Ij (uv), tIj (uv)]∩ [tI ′ (uv), tI ′ (uv)] = ∅ j j
+∞ +∞
• IVN fuzzy Ij −i cut-vertex, if i−∞ −∞
Ij (uv) > iI ′ (uv), iIj (uv) > iI ′ (uv), j j
+∞ +∞
[i−∞ −∞
Ij (uv), iIj (uv)]∩ [iI ′ (uv), iI ′ (uv)] = ∅ j j

• IVN fuzzy Ij −f cut-vertex, if fI−∞

j
(uv) > fI−∞
′ (uv), fI+∞
j
(uv) > fI+∞
′ (uv),
j j

[fI−∞
j
(uv), fI+∞
j
(uv)]∩ [fI−∞
′ (uv), fI+∞
′ (uv)] = ∅
j j

Example 2.25. Consider an IVNGS Ǧiv = (I, I1 , I2 ) of graph structure G =

(U, R1 , R2 ) as represented in Fig. 10.

r1 ([0.3, 0.4], [0.6, 0.7], [0.4, 0.5])

I1 ([0.4, 0.5], [0.5, 0.6], [0.4, 0.5])

])
0.4
.3,

])
0.4
r2 ([0.4, 0.5], [0.7, 0.8], [0.5, 0.6])

, [0
I1 b

.3,
.3]
([0 b

, [0
.3, I2 ([0.3, 0.4], [0.6, 0.7], [0.4, 0.5])
0.4 ,0
r5 ([0.4, 0, 5], [0.5, 0.6], [0.6, 0.7])

0.2

.5]
], [

I2 ([0.2, 0.3], [0.3, 0.4], [0.4, 0.5])

0.5 ,0
], [

4
,0
0.4

[0.

.6]
, [0
.3,

] ,
0.4

.4,
([0

0,
.3,

5])
I1

b
([0

b
r3 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.6])
r6

I2 ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3])

I2 ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3])
I1

[0.5, 0.6])
([0
.3
,0

b
.4
],
[0
.3

5, 0 r4 ([0.5, 0.6], [0.7, 0.9],

,0
.4
],

6])
[0
.4

, 0.
,0

0.5
.5
])

], [
0.8

b
.7,
, [0
.6]
[0.
I1 (

F IGURE 10. IVNGS Ǧiv = (I, I1 , I2 )

Ȟiv = (I ′ , I1′ , I2′ ) is an IVN subgraph-structure of IVNGS Ǧiv , which is obtained

by deleting vertex r2 and shown in Fig. 11.
124 M. Akram and M. Sitara

0.4 )
5]
, [0 4, 0.

])
.
, [0

.3,
.7]
,0
) I2′ ([0.2, 0.3], [0.3, 0.4], [0.4, 0.5]) 0.3]
b

0.6

,
], [

. 2
0.5 r3 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.6]) ], [0
0.4
.3,

. 4
,0
([0
0.3
r1

1 ([
I′
r5 ([0.4, 0, 5], [0.5, 0.6], [0.6, 0.7])
b b
I2′ ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3])

r6 ([0.3, 0.4], [0.4, 0.5], [0.3, 0.4])

I1

I2′ ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3])

′ ([
0.
3,
0.
b

4]
[0 ,
.3
,0
.4
],
r4

.6]
[0
([0

.4

,0
,0
.5,

.5
])
0.6

], [
0.8
], [
0.7
b

.7,
,0

, [0
.9]

]
0.6
, [0
.5,

. 5,
1 [0
0.6

I ′(
])
F IGURE 11. IVNGS Ȟiv = (I ′ , I1′ , I2′ )

The vertex r2 is an IVN fuzzy I1 − i cut-vertex. Since

+∞ +∞
i−∞ −∞
I ′ (r4 r5 ) = 0.3, iI1 (r4 r5 ) = 0.5, iI ′ (r4 r5 ) = 0.4, iI1 (r4 r5 ) = 0.6.
1 1
+∞ +∞
Clearly i−∞ −∞
I1 (r4 r5 ) = 0.5 > 0.3 = iI ′ (r4 r5 ), iI1 (r4 r5 ) = 0.6 > 0.4 = iI ′ (r4 r5 ),
1 1
+∞ +∞
[i−∞ −∞
I1 (r4 r5 ), iI1 (r4 r5 )] ∩ [iI ′ (r4 r5 ), iI ′ (r4 r5 )] = [0.5, 0.6] ∩ [0.3, 0.4] = ∅.
1 1

Definition 2.26. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS and rs be an Ij −edge.

If (I ′ , I1′ , I2′ , . . . , It′ ) is an IVN fuzzy spanning subgraph-structure of Ǧiv , such
that
+ + +
t− − −
I ′ (rs) = iI ′ (rs) = fI ′ (rs) = 0, tI ′ (rs) = iI ′ (rs) = fI ′ (rs) = 0,
j j j j j j
+ + +
[t− − − −
I ′ (wx), tI ′ (wx)] = [tIj (wx), tIj (wx)], [iI ′ (wx), iI ′ (wx)] = [iIj (wx),
j j j j

i+
Ij (wx)],
[fI ′ (wx), fI+′ (wx)] = [fI−j (wx), fI+j (wx)],
−
j j

for all edges wx 6= rs, then edge rs is an IVN fuzzy Ij -bridge if

+∞ +∞ +∞
(1) t−∞ −∞ −∞
Ij (uv) > tI ′ (uv), tIj (uv) > tI ′ (uv), [tIj (uv), tIj (uv)]∩
j j
+∞
[t−∞
I ′ (uv), tI ′ (uv)] = ∅
j j
+∞ +∞ +∞
(2) i−∞ −∞ −∞
Ij (uv) > iI ′ (uv), iIj (uv) > iI ′ (uv), [iIj (uv), iIj (uv)]∩
j j
+∞
[i−∞
I ′ (uv), iI ′ (uv)] = ∅
j j

(3) fI−∞
j
(uv) > fI−∞
′ (uv), fI+∞
j
(uv) > fI+∞
′ (uv), [fI−∞
j
(uv), fI+∞
j
(uv)]∩
j j

[fI−∞
′ (uv), fI+∞
′ (uv)] = ∅
j j

for some u, v ∈ U . Note that edge rs is an

Interval-Valued Neutrosophic Graph Structures 125

0.7])

])
0.5
[0.5,

)
.4]
.4,

,0
0.6],

, [0

0.3
.7]
r2 ([0.8, 0.9], [0.7, 0.8], [0.5, 0.7])

], [
[0.5,

,0
b

0.5 r3 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.7]) .6

b

0.6

0
I2 ([0.3, 0.4], [0.6, 0.7], [0.4, 0.5])

4,
I1

], [
],

[0.
([0

.7, 0.8

0.4
.2,

.7, I2 ([0.2, 0.3], [0.4, 0.5], [0.3, 0.4]) ],

0.3
0.3

3,
], [

.
([0

,
I1 ([0

2
0.5

.
([0
r1
,0
.
r5 ([0.7, 0.8], [0.5, 0.6], [0.6, 0.7]) 6], [

I1
b 0.3 b
,
I2 ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3]) 0.4]
)

I2 ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3])

I1
([0

r6 ([0.3, 0.4], [0.4, 0.6], [0.4, 0.5])

.2
,0
.3
b

],
[0
.3

)
,0

.6]
.4

,0
r4

],
[0
([0

.3
.5

], [
,0
,0

.4

0.8
.6

])
],
[0
.7

, [0
,0
b

]
0.6
.9
],
[0

5,
.5

.
([0
,0
.7

I1
])
F IGURE 12. IVNGS Ǧiv = (I, I1 , I2 )

+∞ +∞
• IVN fuzzy Ij − t bridge, if t−∞ −∞
Ij (uv) > tI ′ (uv), tIj (uv) > tI ′ (uv), j j
+∞ +∞
[t−∞ −∞
Ij (uv), tIj (uv)]∩ [tI ′ (uv), tI ′ (uv)] = ∅ j j
+∞ +∞
• IVN fuzzy Ij − i bridge, if i−∞ −∞
Ij (uv) > iI ′ (uv), iIj (uv) > iI ′ (uv), j j
+∞ +∞
[i−∞ −∞
Ij (uv), iIj (uv)]∩ [iI ′ (uv), iI ′ (uv)] = ∅ j j

• IVN fuzzy Ij −f bridge, if fI−∞

j
(uv) > fI−∞
′ (uv), fI+∞
j
(uv) > fI+∞
′ (uv),
j j

[fI−∞
j
(uv), fI+∞
j
(uv)]∩ [fI−∞
′ (uv), fI+∞
′ (uv)] = ∅
j j

Example 2.27. Consider an IVNGS Ǧiv = (I, I1 , I2 ) of graph structure G =

(U, R1 , R2 ) as shown in Fig. 12. Ȟiv = (I ′ , I1′ , I2′ ) is an IVN spanning subgraph-
structure of IVNGS Ǧiv obtained by deleting an I1 -edge r2 r5 and shown in Fig.
13. The edge r2 r5 is an IVN fuzzy I1 − bridge since

+∞ +∞
• t−∞ −∞
I ′ (r2 r5 ) = 0.2, tI1 (r2 r5 ) = 0.7, tI ′ (r2 r5 ) = 0.3, tI1 (r2 r5 ) =
1 1
0.8. t−∞ −∞
I1 (r2 r5 ) = 0.7 > 0.2 = tI ′ (r2 r5 ), t+∞
I1 (r2 r5 ) = 0.8 > 0.3 =
1
t+∞
I1′ (r2 r5 ), [t−∞
I1 (r2 r5 ), t+∞
I1 (r2 r5 )] ∩ [tI ′ (r2 r5 ), t+∞
−∞
I1′ (r2 r5 )]= [0.7,
1
0.8] ∩ [0.2, 0.3] = ∅.
+∞ +∞
• i−∞ −∞
I ′ (r2 r5 ) = 0.3, iI1 (r2 r5 ) = 0.5, iI ′ (r2 r5 ) = 0.4, iI1 (r2 r5 ) =
1 1
0.6. i−∞ −∞
I1 (r2 r5 ) = 0.5 > 0.3 = iI ′ (r2 r5 ), i+∞
I1 (r2 r5 ) = 0.6 > 0.4 =
1
i+∞
I1′ (r2 r5 ),
+∞ +∞
[i−∞
I1 (r2 r5 ), iI1 (r2 r5 )] ∩ [i−∞
I ′ (r2 r5 ), iI ′ (r2 r5 )]= [0.5, 0.6] ∩ [0.3,
1 1
0.4] = ∅.
126 M. Akram and M. Sitara

])
0.5

)
.4]
.4,

,0
, [0
I′

0.3
1 ([

.7]
0. r2 ([0.8, 0.9], [0.7, 0.8], [0.5, 0.7])

], [
2,

,0
0.3 b b

0.5 r3 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.7]) .6

0.6

0
], [ I ′ ([0.3, 0.4], [0.6, 0.7], [0.4, 0.5])

4,
0.5 2

], [

[0.
,0

0.4
.6]

.7, I2 ([0.2, 0.3], [0.4, 0.5], [0.3, 0.4]) ],

0.3
, [0

.3,
.3,

([0

,
0.2
0.4
])

r1

1 ([
I′
r5 ([0.7, 0.8], [0.5, 0.6], [0.6, 0.7])
b b
I2′ ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3])

I2′ ([0.1, 0.2], [0.4, 0.5], [0.2, 0.3])

I1
′ ([

r6 ([0.3, 0.4], [0.4, 0.6], [0.4, 0.5])

0.
2,
0.
3]
b

, [0
.3

)
,0

.6]
.4

,0
r4

],
[0
([0

.3
.5

], [
,0
,0

.4

0.8
.6

])
],
[0
.7

, [0
,0
b

]
0.6
.9
],
[0

5,
.5

0.
,0

1 ([
I′
.7
])
F IGURE 13. IVNGS Ȟiv = (I ′ , I1′ , I2′ )

• fI−∞
′ (r2 r5 ) = 0.3, fI−∞
1
(r2 r5 ) = 0.5, fI+∞
′ (r2 r5 ) = 0.4, fI+∞
1
(r2 r5 ) =
1 1
0.7. fI−∞
1
(r2 r5 ) = 0.5 > 0.3 = fI−∞
′ (r2 r5 ), fI+∞
1
(r2 r5 ) = 0.7 > 0.4 =
1
fI+∞
′ (r2 r5 ), [fI−∞
1
(r2 r5 ), fI+∞
1
(r2 r5 )] ∩ [fI−∞
′ (r2 r5 ), fI+∞
′ (r2 r5 )] =
1 1 1
[0.5, 0.7] ∩ [0.3, 0.4] = ∅.
Definition 2.28. An IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is an Ij -tree if (supp(I), supp(I1 ),
supp(I2 ), . . . , supp(It )) is an Ij − tree. Alternatively, Ǧiv is an Ij -tree, if Ǧiv
has a subgraph induced by supp(Ij ) that forms a tree.
Definition 2.29. An IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is an IVN fuzzy Ij -tree if
Ǧiv has an IVN fuzzy spanning subgraph-structure Ȟiv = (I ′′ , I1′′ , I2′′ , . . . , It′′ )
such that for all Ij -edges rs not in Ȟiv ,
Ȟiv is an Ij′′ -tree and
+ +∞ +
(1) t− −∞ −
Ij (rs) < tI ′′ (rs), tIj (rs) < tI ′′ (rs), [tIj (rs), tIj (rs)] ∩
j j
+∞
[t−∞
I ′′ (rs), tI ′′ (rs)] = ∅
j j
+ +∞ +
(2) i− −∞ −
Ij (rs) < iI ′′ (rs), iIj (rs) < iI ′′ (rs), [iIj (rs), iIj (rs)] ∩
j j
+∞
[i−∞
I ′′ (rs), iI ′′ (rs)] = ∅
j j
+ +∞ +
(3) fI−j (rs) < fI−∞ j
−
′′ (rs), fI (rs) < fI ′′ (rs), [fI (rs), fI (rs)] ∩
j j
j j
+∞
[fI−∞
′′ (rs), fI ′′ (rs)] = ∅
j j

In particular,
+ +∞
• Ǧiv is an IVN fuzzy Ij −t tree if t− −∞
Ij (rs) < tI ′′ (rs), tIj (rs) < tI ′′ (rs), j j
+ +∞
[t− −∞
Ij (rs), tIj (rs)] ∩ [tI ′′ (rs), tI ′′ (rs)] = ∅
j j
Interval-Valued Neutrosophic Graph Structures 127

I2 ([0.1, 0.2], [0.4, 0.5], [0.1, 0.2])

r4 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.6])
] )
0.5
b

I1

.4,
([0

, [0
.3
,0

]
0.5
.4
],
[0

.4,
.4

r3 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.6])

, [0
,0
.5

]
],

0.6
[0
.5

5,
b ,0

[0.
.6

I2 ([0.2, 0.3], [0.4, 0.5], [0.4, 0.5])

])

I1 (
I1
([0 I ([0.1, 0.2], [0.4, 0.5], [0.4, 0.5])
.3, 2 b
0.5 0.7])
], [ r5 ([0.4, 0.5], [0.5, 0.6], [0.6,
b
r6
([ 0 0.4

0.6])
.3, ,0

4])
0.4 .5]

0.
], [ , [0

[0.5,
0.4 .4,

3,
0.5

[0.
,0
.5] ])

3],

0.3],
,[ 0.4

0.
, 0.5
2,
b

[0.2,
] )
b 0.
I2 ([0.2, 0.3], [0.6, 0.7], [0.2, 0.3])
], [
.4

],
.1, 0.2
,0
.3
([ 0

I1 ([0
I2

r1 ([0.3, 0.4], [0.6, 0.7], [0.5, 0.6])

r2 ([0.4, 0.5], [0.7, 0.8], [0.5, 0.6])

F IGURE 14. Ǧiv = (I, I1 , I2 )

+ +∞
• Ǧiv is an IVN fuzzy Ij −i tree if i− −∞
Ij (rs) < iI ′′ (rs), iIj (rs) < iI ′′ (rs), j j
+ +∞
[i− −∞
Ij (rs), iIj (rs)] ∩ [iI ′′ (rs), iI ′′ (rs)] = ∅ j j
+
• Ǧiv is an IVN fuzzy Ij − f tree if fI−j (rs) < fI−∞
′′ (rs), fI (rs) <
j j

fI+∞ −
j
+
j
−∞ +∞
′′ (rs), [fI (rs), fI (rs)] ∩ [fI ′′ (uv), fI ′′ (uv)] = ∅
j j j

Example 2.30. Consider an IVNGS Ǧiv = (I, I1 , I2 ) of graph structure G =

(U, R1 , R2 ) as shown in Fig. 14. This IVNGS is I2 -tree, not I1 -tree. But it is
IVN fuzzy I1 − t tree, since it has an IVN fuzzy spanning subgraph-structure Ȟiv
= (I ′′ , I1′′ , I2′′ ) as an I1′′ -tree, which is obtained by deleting I1 -edge r2 r5 from Ǧiv
and shown in Fig. 15. By direct calculations, we found that
+∞ +
t−∞ −
I ′′ (r2 r5 ) = 0.3, tI ′′ (r2 r5 ) = 0.5, tI1 (r2 r5 ) = 0.1, tI1 (r2 r5 ) = 0.2,
1 1
+ +∞
t− −∞
I1 (r2 r5 ) = 0.1 < 0.3 = tI ′′ (r2 r5 ), tI1 (r2 r5 ) = 0.2 < 0.5 = tI ′′ (r2 r5 ), 1 1
+∞ +
[t−∞ −
I ′′ (r2 r5 ), tI ′′ (r2 r5 )] ∩ [tI1 (r2 r5 ), tI1 (r2 r5 )] = [0.3, 0.5] ∩ [0.1, 0.2] = ∅.
1 1

Definition 2.31. An IVNGS Ǧiv1 = (I1 , I11 , I12 , . . . , I1t ) of graph structure G1
= (U1 , R11 , R12 , . . . , R1t ) is isomorphic to IVNGS Ǧiv2 = (I2 , I21 , I22 , . . . , I2t )
of graph structure G2 = (U2 , R21 , R22 , . . . , R2t ), if there is a pair (f, ϕ), where
f : U1 → U2 is bijection and ϕ is a permutation on set {1, 2, . . . , t} such that:
+ + + +
[t− − − −
I1 (r), tI1 (r)] = [tI2 (f (r)), tI2 (f (r))], [iI1 (r), iI1 (r)] = [iI2 (f (r)), iI2 (f (r))],
[fI−1 (r), fI+1 (r)] = [fI−2 (f (r)), fI+2 (f (r))],
+ +
[t− −
I1j (rs), tI1j (rs)] = [tI2ϕ(j) (f (r)f (s)), tI2ϕ(j) (f (r)f (s))],
+ +
[i− −
I1j (rs), iI1j (rs)] = [iI2ϕ(j) (f (r)f (s)), iI2ϕ(j) (f (r)f (s))],

[fI−1j (rs), fI+1j (rs)] = [fI−2ϕ(j) (f (r)f (s)), fI+2ϕ(j) (f (r)f (s))],
128 M. Akram and M. Sitara

I2′′ ([0.1, 0.2], [0.4, 0.5], [0.1, −0.2])

r4 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.6])
)]
0.5
b

.4,
I ′
1 ′(

, [0
[0
.3

]
,0

0.5
.4
],

,
0.4
[0
.4

r3 ([0.5, 0.6], [0.7, 0.8], [0.5, 0.6])

[
,0

6],
.5
],

.
5, 0
[0
.5
,0

.
b

([0
.6

I2′′ ([0.2, 0.3], [0.4, 0.5], [0.4, 0.5])

])

I1′′
I ′′
1 ([
0.3 I2 ([0.1, 0.2], [0.4, 0.5], [0.4, 0.5])
′′
b
b ,0
r6 .5] r5 ([0.4, 0.5], [0.5, 0.6], [0.6, 0.7])
([ 0 , [0

4])
.3, .4,
0.4 0.5

0.
], [ ], [

3,
0.4 0.4

[0.
,0 ,0
.5] .5]

3],
, [0 )

0.
. 4,
0

2,
0.3]) .5])
I2′′ ([0.2, 0.3], [0.6, 0.7], [0.2,
b
0.
], [
b
0.6])
r2 ([0.4, 0.5], [0.7, 0.8], [0.5,
.4
,0

r1 ([0.3, 0.4], [0.6, 0.7], [0.5, 0.6])

.3
([ 0
′′
2
I

F IGURE 15. Ȟiv = (I ′′ , I1′′ , I2′′ )

r4 ([0.3, 0.4], [0.2, 0.3], [0.5, 0.6])

b

I2 (
I2 [0.2
([0 , 0.

r2 ([0.6, 0.7], [0.5, 0.6], [0.5, 0.6])

. 3, 3 ],
0.4 [0.2
I1 ([0.3, 0.4], [0.2, 0.3], [0.4, 0.5])

] , [0 , 0.
.2, 3 ],
0.3 [0.5
] , [0 , 0.
.5, 6])
0.6
]
])

)
.6
,0
.5
b
])

b
[0
.5

],
,0

.8
.4

,0
[0

)
.7

.5 ]
],

[0
.4

4, 0
],
,0

.
.4

], [0
.3

,0

0 .4
[0

.3

.3 ,
],

([0
.4

, [0
,0

.3 ]
r3
.3

2, 0
([0

[0.
I 1(
I1
b

r1 ([0.4, 0.5], [0.3, 0.4], [0.4, 0.5])

F IGURE 16. IVNGS Ǧiv1 = (I, I1 , I2 )

for all r ∈ U1 , rs ∈ I1j , j ∈ {1, 2, . . . , t}.

Example 2.32. Let Ǧiv1 = (I, I1 , I2 ) and Ǧiv2 = (I ′ , I1′ , I2′ ) be two IVNGSs of
two GSs G1 = (U, R1 , R2 ) and G2 = (U ′ , R1′ , R2′ ) as shown in Fig. 16 and Fig.
17, respectively.
Ǧiv1 and Ǧiv2 are isomorphic under (f, ϕ), where f : U → U ′ is bijection and
ϕ is permutation on set {1, 2} defined as ϕ(1) = 2, ϕ(2) = 1, such that:

+ +
[t− −
I (ri ), tI (ri )] = [tI ′ (f (ri )), tI ′ (f (ri ))],
Interval-Valued Neutrosophic Graph Structures 129

s1 ([0.4, 0.5], [0.3, 0.4], [0.4, 0.5])

b
I ′ I2 ([0
′
2 ([
0. .3 ,

s3 ([0.3, 0.4], [0.7, 0.8], [0.5, 0.6])

2, 0 .4
], [0

I2′ ([0.3, 0.4], [0.2, 0.3], [0.4, 0.5])

0.
3]
, [0 .3 ,
0 .4
.3
,0 ], [0
.4 .4 ,
], [ 0 .5
0.
4,
])
0. ])
5] 6
)
, 0.
.5

])
b
[0

b
.6
],

,0
6
0.

.5
[0
,
.5 ])

],
[0 0 .6

.3
], .5 ,

,0
7 [0
0.

.2
3 ],

[0
, .
.6
2, 0

],
([0

.3
[0.

,0
s2 ] ,
0 .4

.2
3,

([0
′ [0
.

I1 ′
I 1(

s4 ([0.3, 0.4], [0.2, 0.3], [0.5, 0.6]) b

F IGURE 17. IVNGS Ǧiv2 = (I ′ , I1′ , I2′ )

+ +
[i− −
I (ri ), iI (ri )] = [iI ′ (f (ri )), iI ′ (f (ri ))],

[fI− (ri ), fI+ (ri )] = [fI−′ (f (ri )), fI+′ (f (ri ))],
+ +
[t− −
Ij (ri rk ), tIj (ri rk )] = [tIϕ(j) (f (ri )f (rk )), tIϕ(j) (f (ri )f (rk ))],
+ +
[i− −
Ij (ri rk ), iIj (ri rk )] = [iIϕ(j) (f (ri )f (rk )), iIϕ(j) (f (ri )f (rk ))],

[fI−j (ri rk ), fI+j (ri rk )] = [fI−ϕ(j) (f (ri )f (rk )), fI+ϕ(j) (f (ri )f (rk ))],

for all ri ∈ U , ri rk ∈ Ij , j ∈ {1, 2} and i, k ∈ {1, 2, 3, 4}.

Definition 2.33. An IVNGS Ǧiv1 = (I1 , I11 , I12 , . . . , I1t ) of graph structure G1
= (U1 , R11 , R12 , . . . , R1t ) is identical to IVNGS Ǧiv2 = (I2 , I21 , I22 , . . . , I2t ) of
graph structure G2 = (U2 , R21 , R22 , . . . , R2t ) if f : U1 → U2 is a bijection, such
that
+ + + +
[t− − − −
I1 (r), tI1 (r)] = [tI2 (f (r)), tI2 (f (r))], [iI1 (r), iI1 (r)] = [iI2 (f (r)), iI2 (f (r))],
[fI−1 (r), fI+1 (r)] = [fI−2 (f (r)), fI+2 (f (r))],
+ +
[t− −
I1j (rs), tI1j (rs)] = [tI2j (f (r)f (s)), tI2j (f (r)f (s))],
+ +
[i− −
I1j (rs), iI1j (rs)] = [iI2j (f (r)f (s)), iI2j (f (r)f (s))],

[fI−1j (rs), fI+1j (rs)] = [fI−2j (f (r)f (s)), fI+2j (f (r)f (s))],
for all r ∈ U1 , rs ∈ U1j , j ∈ {1, 2, . . . , t}.

Example 2.34. Let Ǧiv1 = (I, I1 , I2 ) and Ǧiv2 = (I ′ , I1′ , I2′ ) be two IVNGSs of
the graph structures G1 = (U, R1 , R2 ) and G2 = (U ′ , R1′ , R2′ ), respectively as
shown in Fig. 18 and Fig. 19, respectively.
130 M. Akram and M. Sitara

I2 ([0.3, 0.4], [0.3, 0.4], [0.4, 0.5])

r6 ([0.5, 0.6], [0.5, 0.6], [0.5, 0.6]) r3 ([0.6, 0.7], [0.4, 0.5], [0.6, 0.7])

r5 ([0.6, 0.7], [0.6, 0.7], [0.5, 0.6])

r2 ([0.4, 0.5], [0.4, 0.5], [0.5, 0.6])
)

b
] ) ) I2 (
0.6 .6] .5]

b
[0.
0. 5, ,0 ,0 6,
], [ 0.5 0.4 0.7
], [ ], [ ]
0.4 0.3 0.3
, [0
.4,
.3, , ,
, [0 0.2 0.2 0.
.3] ], [ ], [ I2 ([0.4, 0.5], [0.3, 0.4], [0.5, 0.6]) 5], [0
,0 0.5 0.4 .5,
0.2 .4, . 3, 0.6
([ ([0 ([0 ] )
I2 I1 I1
I1 ([0.3, 0.4], [0.3, 0.4], [0.4, 0.5]) b

b
r1 ([0.6, 0.7], [0.6, 0.7], [0.8, 0.9]) r7 ([0.6, 0.7], [0.6, 0.7], [0.6,
b
0.7])

b
I1 ]) ]) )
([0
0.7 0.4 .6]
. 4,
.6, .3, ,0
0.5
] , [0 , [0 ,[ 0.5
, [0
.4, .4] .3] 0.6
]
,0 ,0 .5,
0.5 0.3 0.2 , [0
] , [0 ], [ ], [ ]
.2, 0.6 0.3 0.7
0.3 . 5, . 2, . 6,
] ) ([0 ([0 ([0
I 2 I 2 I 2

b
r8 ([0.5, 0.6], [0.6, 0.7], [0.6, 0.7]) r4 ([0.7, 0.8], [0.5, 0.6], [0.7, 0.8])

F IGURE 18. IVNGS Ǧiv1

s3 ([0.7, 0.8], [0.5, 0.6], [0.7, 0.8]) s6 ([0.5, 0.6], [0.6, 0.7], [0.6, 0.7])
)
) .4] I ′(
b

.6] ,0 ]) 2 [0

b
,0 0.3 0.3 5, .

s7 ([0.6, 0.7], [0.6, 0.7], [0.6, 0.7])

0.5 .2,
s5 ([0.6, 0.7], [0.6, 0.7], [0.5, 0.6])

,[ ], [ 0.6
.6] 0.3 ] , [0 ], [
0.3
,0 .2, 0. 5
0.5 ] , [0 . 4, ,0
.4]
] ,[ 0.3 ] , [ 0 , [0
0.7 2, 5 ′ ([0.3,
. 0. I 0.4], [0.3, 0.4], [0.4, 0.5]) .6,
.6, ′ ([0
1 0.7
([0 I2 .4, ]
′ ′ ([0 )
I2 I1
I2′ ([0.4, 0.5], [0.3, 0.4], [0.5, 0.6])
I1′ ([0.3, 0.4], [0.3, 0.4], [0.4, 0.5]) b
s1 ([0.4, 0.5], [0.4, 0.5], [0.5, 0.6]) s2 ([0.6, 0.7], [0.6, 0.7], [0.8,
b
b

0.9])
b

I′ ]) )
2 ([0 . 5]) 0.6 .6]
. 6, ,0 .5, ,0
0.7 0.4 , [0 ,[ 0.5
] , [0 ], [ .4] ]
.4, 0.3 ,0 0.3
0.5 .2, 0.3 .2,
] , [0 ] , [0 ] ,[ ] , [0
.5, 0.4 0.3 0.5
0.6 . 3, . 2, . 4,
] ) ′ ([0 ′ ([0 ′ ([0
I1 I2 I1
b

s4 ([0.6, 0.7], [0.4, 0.5], [0.6, 0.7]) s8 ([0.5, 0.6], [0.5, 0.6], [0.5, 0.6])

F IGURE 19. IVNGS Ǧiv2

IVNGS Ǧiv1 is identical to Ǧiv2 under f : U → U ′ defined as :

f (r1 ) = s2 , f (r2 ) = s1 , f (r3 ) = s4 , f (r4 ) = s3 , f (r5 ) = s5 , f (r6 ) = s8 ,
f (r7 ) = s7 , f (r8 ) = s6 . Moreover,
+ +
[t− −
I (ri ), tI (ri )] = [tI ′ (f (ri )), tI ′ (f (ri ))],
+ +
[i− −
I (ri ), iI (ri )] = [iI ′ (f (ri )), iI ′ (f (ri ))],
[fI− (ri ), fI+ (ri )] = [fI−′ (f (ri )), fI+′ (f (ri ))],
+ +
[t− −
Ij (ri rk ), tIj (ri rk )] = [tI ′ (f (ri )f (rk )), tI ′ (f (ri )f (rk ))], j j
+ +
[i− −
Ij (ri rk ), iIj (ri rk )] = [iI ′ (f (ri )f (rk )), iI ′ (f (ri )f (rk ))], j j

[fI−j (ri rk ), fI+j (ri rk )] = [fI−′ (f (ri )f (rk )), fI+′ (f (ri )f (rk ))],
j j

for all ri ∈ U , ri rk ∈ Rj , j ∈ {1, 2}, i, k ∈ {1, 2, . . . , 8}.

Interval-Valued Neutrosophic Graph Structures 131

Definition 2.35. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS and ϕ be a permuta-

tion on {I1 , I2 , . . . , It } and also on the set {1, 2, . . . , t}, that is, ϕ(Ij ) = Il iff
ϕ(j) = l for all j. If rs ∈ Ij and
W −
[t− Ijϕ
(rs), t+ Ijϕ
(rs)] = [t− −
I (r) ∧ tI (s) − tϕ(Il ) (rs),
l6=j
W
t+ +
I (r) ∧ tI (s) − t+ − +
ϕ(Il ) (rs)], [iIjϕ (rs), iIjϕ (rs)] =
l6=j
W − W +
[i− −
I (r) ∧ iI (s) − iϕ(Il ) (rs), i+ +
I (r) ∧ iI (s) − iϕ(Il ) (rs)],
l6=j l6=j
[fI−ϕ (rs), fI+ϕ (rs)] =
W j j
W
[fI− (r) ∧ fI− (s) − −
fϕ(Il)
(rs), fI+ (r) ∧ fI+ (s) − +
fϕ(Il)
(rs)],
l6=j l6=j
j = 1, 2, . . . , t, then rs ∈ Iuϕ , where u is selected, such that
+ + +
• t− −
I Iu I
−
Iu Iu
−
ϕ (rs) ≥ t ϕ (rs), t ϕ (rs) ≥ t ϕ (rs), [t ϕ (rs), t ϕ (rs)] ∩ [ t ϕ (rs),
Iu I
j j j

t+
Iϕ
(rs)] = ∅
j
+ + +
• i− −
I Iu I
−
Iu Iu
−
ϕ (rs) ≥ i ϕ (rs), i ϕ (rs) ≥ i ϕ (rs), [i ϕ (rs), i ϕ (rs)] ∩ [ i ϕ (rs),
Iu I
j j j

i+
Iϕ
(rs)] = ∅
j

• fI−uϕ (rs) ≥ fI−ϕ (rs), fI+uϕ (rs) ≥ fI+ϕ (rs), [fI−uϕ (rs), fI+uϕ (rs)] ∩ [ fI−ϕ (rs),
j j j

fI+ϕ (rs)] = ∅
j

for all j. Then IVNGS (I, I1ϕ , I2ϕ , . . . , Itϕ ) is said to be ϕ-complement of IVNGS
Ǧiv and denoted by Ǧϕc
iv .

Example 2.36. Let I = {(r1 , [0.4, 0.5], [0.4, 0.5], [0.7, 0.8]), (r2, [0.6, 0.7], [0.6, 0.7],
[0.4, 0.5]), (r3 , [0.8, 0.9], [0.5, 0.6], [0.3, 0.4])}, I1 = {(r1 r3 , [0.4, 0.5], [0.4, 0.5], [0.3, 0.4])},
I2 = {(r2 r3 , [0.6, 0.7], [0.4, 0.5], [0.3, 0.4])}, I3 = {(r1 r2 , [0.4, 0.5], [0.3, 0.4], [0.4, 0.5])}
be IVN subsets of U = {r1 , r2 , r3 }, R1 = {r1 r3 }, R2 = {r2 r3 }, R3 =
{r1 r2 }, respectively. Obviously, Ǧiv = (I, I1 , I2 , I3 ) is an IVNGS of GS G =
(U, R1 , R2 , R3 ) as shown in Fig. 20

r2 ([0.6, 0.7], [0.6, 0.7], [0.4, 0.5]) r3 ([0.8, 0.9], [0.5, 0.6], [0.3, 0.4])
I2 ([0.6, 0.7], [0.4, 0.5], [0.3, 0.4])
b

b
) ]
0.4
I3
([0

.3,
4,.

, [0
0.5

]
0.5
] , [0

4,
.3,

[0.
0.4

5],
] , [0

.
4, 0
.4,

[0.
0.5

I1 (
]

b
)

r1 ([0.4, 0.5], [0.4, 0.5], [0.7, 0.8])

F IGURE 20. Ǧiv = (I, I1 , I2 , I3 )

132 M. Akram and M. Sitara

Simple calculations of edges r1 r3 , r2 r3 , r1 r2 ∈ I1 , I2 , I3 , respectively, show that

r1 r3 ∈ I3ϕ , r2 r3 ∈ I1ϕ , r1 r2 ∈ I2ϕ . So, Ǧϕc ϕ ϕ ϕ
iv =(I, I1 , I2 , I3 ) is ϕ-complement of
IVNGS Ǧiv as shown in Fig. 21.

r2 ([0.6, 0.7], [0.6, 0.7], [0.4, 0.5])

I1
ϕ
5])
b

([0

r3 ([0.8, 0.9], [0.5, 0.6], [0.3, 0.4])

, 0.
r1 ([0.4, 0.5], [0.4, 0.5], [0.7, 0.8])

.6,
[0.4

0.7
]
],

, [0
0.5

.5,
,
[0.4

0.6
], [0
5],
, 0.

.3,
0.4
[0.4

] )
I2ϕ(

b
b
I3ϕ ([0.4, 0.5], [0.4, 0.5], [0.3, 0.4])

F IGURE 21. Ǧiv = (I, I1ϕ , I2ϕ , I3ϕ )

Proposition 2.37. ϕ-complement of an IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is a strong

IVNGS. Moreover, if ϕ(j) = u, where j, u ∈ {1, 2, . . . , t}, then all Iu -edges in
IVNGS (I, I1 , I2 , . . . , It ) become Ijϕ -edges in (I, I1ϕ , I2ϕ , . . . , Itϕ ).
Proof. By definition of ϕ-complement,
_ _
[t−
Iϕ
(rs), t+
Iϕ
(rs)] = [t− −
I (r) ∧ tI (s) − t− + +
ϕ(Il ) (rs), tI (r) ∧ tI (s) − t+
ϕ(Il ) (rs)],(2. 1)
j j
l6=j l6=j
_ _
[i−
Iϕ
(rs), i+
Iϕ
(rs)] = [i− −
I (r) ∧ iI (s) − i− + +
ϕ(Il ) (rs), iI (r) ∧ iI (s) − i+
ϕ(Il ) (rs)],(2. 2)
j j
l6=j l6=j
_ _
[fI−ϕ (rs), fI+ϕ (rs)] = [fI− (r) ∧ fI− (s) − −
fϕ(Il)
(rs), fI+ (r) ∧ fI+ (s) − +
fϕ(Il)
(rs)],(2. 3)
j j
l6=j l6=j

for j ∈ {1, 2, . . . , t}. For expression of truth membership

W − value: W
+ +
As t−I (r) ∧ t −
I (s) ≥ 0, t I (r) ∧ t I (s) ≥ 0 and t ϕ(Il ) (rs) ≥ 0, t+
ϕ(Il ) (rs) ≥
l6=j l6=j
+ + +
0. Since t− (rs) ≤ t− −
I (r) ∧ tI (s), tIj (rs) ≤ tI (r) ∧ tI (s), for all Ij . This
WIj − W +
implies − −
tϕ(Il ) (rs) ≤ tI (r) ∧ tI (s) and tϕ(Il ) (rs) ≤ t+ +
I (r) ∧ tI (s). It
l6=j l6=j
W − W +
shows that t− −
I (r) ∧ tI (r) − tϕ(Il ) (rs) ≥ 0, t+
I (r) − tϕ(Il ) (rs) ≥ 0. Hence
l6=j l6=j
t−
Ijϕ
(rs) ≥ 0 and t+
Ijϕ
(rs) ≥ 0, for all j. Furthermore, t− Ijϕ
(rs) and t+Ijϕ
(rs) obtain
W − W +
maximum value when tϕ(Il ) (rs) and tϕ(Il ) (rs) are zero. Obviously, when
l6=j l6=j
W − W +
ϕ(Ij ) = Iu and rs is an Iu -edge then tϕ(Il ) (rs) and tϕ(Il ) (rs) acquire
l6=j l6=j
zero value. Hence
[t−
Iϕ
(rs), t+
Iϕ
(rs)] = [t− − + +
I (r) ∧ tI (s), tI (r) ∧ tI (s)], f or (rs) ∈ Iu , ϕ(Ij ) = Iu .(2. 4)
j j
Interval-Valued Neutrosophic Graph Structures 133

For expression of indeterminacy membership value:

W − W +
+ +
As i− −
I (r) ∧ iI (s) ≥ 0, iI (r) ∧ iI (s) ≥ 0 and iϕ(Il ) (rs) ≥ 0, iϕ(Il ) (rs) ≥
l6=j l6=j
+ + +
0. Since i− (rs) ≤ i− −
I (r) ∧ iI (s), iIj (rs) ≤ iI (r) ∧ iI (s), for all Ij . This
WIj − W +
implies − −
iϕ(Il ) (rs) ≤ iI (r) ∧ iI (s) and iϕ(Il ) (rs) ≤ i+ +
I (r) ∧ iI (s). It
l6=j l6=j
W − W +
shows that i− −
I (r) ∧ iI (r) − iϕ(Il ) (rs) ≥ 0, i+
I (r) − iϕ(Il ) (rs) ≥ 0. Hence
l6=j l6=j
i−
Ijϕ
(rs) ≥ 0 and i+
Ijϕ
(rs) ≥ 0, for all j. Furthermore, i− Ijϕ
(rs) and i+
Ijϕ
(rs) achieve
W − W +
maximum value when iϕ(Il ) (rs) and iϕ(Il ) (rs) are zero. Obviously, when
l6=j l6=j
W W +
ϕ(Ij ) = Iu and rs is an Iu -edge then i−
ϕ(Il ) (rs) and iϕ(Il ) (rs) get zero
l6=j l6=j
value. Hence
[i−
Iϕ
(rs), i+
Iϕ
(rs)] = [i− − + +
I (r) ∧ iI (s), iI (r) ∧ iI (s)], f or (rs) ∈ Iu , ϕ(Ij ) = Iu .(2. 5)
j j

For expression of falsity membership value: W W +

As fI− (r)∧fI− (s) ≥ 0, fI+ (r)∧fI+ (s) ≥ 0 and −
fϕ(Il)
(rs) ≥ 0, fϕ(Il ) (rs) ≥
l6=j l6=j
0. Since fI−j (rs) ≤ fI− (r) ∧ fI− (s), fI+j (rs) ≤ fI+ (r) ∧ fI+ (s), for all Ij . This
W − W +
implies fϕ(Il ) (rs) ≤ fI− (r) ∧ fI− (s) and fϕ(Il ) (rs) ≤ fI+ (r) ∧ fI+ (s). It
l6=j l6=j
W − W +
shows that fI− (r)∧fI− (r)− fϕ(I l)
(rs) ≥ 0, fI+ (r)− fϕ(I l)
(rs) ≥ 0. Hence
l6=j l6=j
fI−ϕ (rs) ≥ 0 and fI+ϕ (rs) ≥ 0, for all j. Furthermore, fI−ϕ (rs) and fI+ϕ (rs) obtain
j j
W − W + j j

maximum value when fϕ(Il ) (rs) and fϕ(Il ) (rs) are zero. Obviously, when
l6=j l6=j
W − W +
ϕ(Ij ) = Iu and rs is an Iu -edge then fϕ(Il)
(rs) and fϕ(Il ) (rs) acquire
l6=j l6=j
zero value. Hence
[fI−ϕ (rs), fI+ϕ (rs)] = [fI− (r) ∧ fI− (s), fI+ (r) ∧ fI+ (s)], f or (rs) ∈ Iu , ϕ(Ij ) = Iu .(2. 6)
j j

From expressions (2.4), (2.5) and (2.6), it is clear that

t− − − − − −
j (rs) = min{t (r), t (d)}, ij (rs) = min{i (r), i (s)},
− +
fj (rs) = min{f (−), f (s)}, tj (rs) = min{t (r), t+ (s)},
− − +

i+ + + + + +
j (rs) = min{i (r), i (s)}, fj (rs) = min{f (r), f (s)},

Hence Ǧiv is a strong IV N GS and all Iu -edges in IVNGS (I, I1 , I2 , . . . , It )

become Ijϕ -edges in (I, I1ϕ , I2ϕ , . . . , Itϕ ). 

Definition 2.38. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS and ϕ be a permuta-

tion on {1, 2, . . . , t}. Then
(i) Ǧiv is self complementary IVNGS if Ǧiv is isomorphic to Ǧϕc iv .
(ii) Ǧiv is strong-self complementary IVNGS if Ǧiv is identical to Ǧϕc iv .

Definition 2.39. Let Ǧiv = (I, I1 , I2 , . . . , It ) be an IVNGS. Then

(i) Ǧiv is totally-self complementary IVNGS if Ǧiv is isomorphic to Ǧϕc
iv ,
for all permutations ϕ on {1, 2, . . . , t}.
134 M. Akram and M. Sitara

(ii) Ǧiv is totally-strong-self complementary IVNGS if Ǧiv is identical to

Ǧϕc
iv , for all permutations ϕ on {1, 2, . . . , t}.

Example 2.40. An IVNGS Ǧiv = (I, I1 , I2 , I3 ) shown in Fig. 22 is identical to

ϕ−complement for all permutations ϕ on set {1, 2, 3}. Hence it is totally-strong-
self complementary IVNGS.

r 4([

6])
.5, 0.
0.5,

)
.5]

.7]
r2

5], [0
0.6]

4, 0

,0
([0

0.6
r3

.6])

[0.
, [0.
.5,

I 2([

.4, 0.

5, 5])
([0

], [
4],
0.6

0.5, 0
.3

5, 0.

[0. , 0.
0.6
0.5,

, 0.
,0

], [

4], [0
I1

6], 0.4
.4

0.3
6], [
0.5
([0
],

0.6]

.5], [

, 0 ], [
b
[0

], [
.5,

,0

.3, 0.
b

0.5 0.4
.3

0.5,
b b

, [0.4
b

0.4
.6]
,0

0.6

0.4, 0

.
0. r6 ([ 0.3,
.

,
4]

])
0.6]
], [

r5 ([0

3,
[0.
I1

,[

.6
, 0.5

[0.

[
0.4 ])
([0

0.

6,

,0
.4], [

] ,
)
4,

0.4
r7 (
.3

.5
0.7
,0

], [0.
0
,0

, [0
.
.5]

.3, 0
5

3,
])
.4

4]
[0.
, [0
],

5, 0.
[0

(
.5,

I2 ([0

3,
.3

I3

0.
,0

6])

], [
.6]
.4

.4
],

)
[0

,0
.4

.3
,0

([0
.5

I3
])

r1 ([0.8, 0.9], [0.4, 0.5], [0.5, 0.6])

F IGURE 22. Totally-strong-self complementary IVNGS

Theorem 2.41. An IVNGS is totally-self complementary if and only if it is a strong

IVNGS.
Proof. Consider a strong IVNGS Ǧiv and permutation ϕ on {1,2, . . . , t}. By
proposition 2.37, ϕ-complement of IVNGS Ǧiv = (I, I1 , I2 , . . . , It ) is a strong
IVNGS. Moreover, if ϕ−1 (u) = j, where j, u ∈ {1, 2, . . . , t}, then all Iu -edges
in IVNGS (I, I1 , I2 , . . . , It ) become Ijϕ -edges in (I, I1ϕ , I2ϕ , . . . , Itϕ ), this leads
t− − − − − − − −
Iu (rs)=tI (r) ∧ tI (s)=tI ϕ (rs), iIu (rs)=iI (r) ∧ iI (s)=iI ϕ (rs), j j

fI−u (rs)=fI− (r) ∧ fI− (s)=fI−ϕ (rs), t+ + + +

Iu (rs)=tI (r) ∧ tI (s)=tI ϕ (rs), j j

i+ + + + + + + +
Iu (rs)=iI (r) ∧ iI (s)=iI ϕ (rs), fIu (rs)=fI (r) ∧ fI (s)=fI ϕ (rs). j j

Therefore, under f : U → U (identity mapping), Ǧiv and Ǧϕ

iv are isomorphic
such that:
t− − − − − −
I (r) = tI (f (r)), iI (r) = iI (f (r)), fI (r) = fI (f (r)),
+ + + + + +
tI (r) = tI (f (r)), iI (r) = iI (f (r)), fI (r) = fI (f (r)).
+ + +
t− − −
Iu (rs) = tI ϕ (f (r)f (s)) = tI ϕ (rs), tIu (rs) = tI ϕ (f (r)f (s)) = tI ϕ (rs),
j j j j

i−
Iu (rs) = i−
Ijϕ
(f (r)f (s)) = i−
Ijϕ
(rs), i+
Iu (rs) = i+
Ijϕ
(f (r)f (s)) = i+
Ijϕ
(rs),

fI−u (rs) = fI−ϕ (f (r)f (s)) = fI−ϕ (rs), fI+u (rs) = fI+ϕ (f (r)f (s)) = fI+ϕ (rs),
j j j j
Interval-Valued Neutrosophic Graph Structures 135

for all rs ∈ Iu , for ϕ−1 (u) = j; j, u = 1, 2, . . . , t.

This holds for every permutation ϕ on {1, 2, . . . , t}. Hence Ǧiv is totally-self
complementary IVNGS. Conversely, let Ǧiv is isomorphic to Ǧϕ iv for each permu-
tation ϕ on {1, 2, . . . , t}. Moreover, according to the definitions of isomorphism
of IVNGSs and ϕ-complement of an IVNGS
t− − − − − −
Iu (rs) = tI ϕ (f (r)f (s)) = tI (f (r)) ∧ tI (f (s)) = tI (r) ∧ tI (s),
j

t+ + + + + +
Iu (rs) = tI ϕ (f (r)f (s)) = tI (f (r)) ∧ tI (f (s)) = tI (r) ∧ tI (s),
j

i−
Iu (rs) = i−
Ijϕ
(f (r)f (s)) = i− − − −
I (f (r)) ∧ iI (f (s)) = iI (r) ∧ iI (s),
i+
Iu (rs) = +
iI ϕ (f (r)f (s)) = i+ + + +
I (f (r)) ∧ iI (f (s)) = iI (r) ∧ iI (s),
j

fI−u (rs) = fI−ϕ (f (r)f (s)) = fI− (f (r)) ∧ fI− (f (s)) = fI− (r) ∧ fI− (s),
j

fI+u (rs) = fI+ϕ (f (r)f (s)) = fI+ (f (r)) ∧ fI+ (f (s)) = fI+ (r) ∧ fI+ (s),
j

for all rs ∈ Iu , u = 1, 2, . . . , t. Hence Ǧiv is a strong IVNGS. 

Remark. Every self complementary IVNGS is totally-self complementary.
Theorem 2.42. If G = (U, R1 , R2 , . . . , Rt ) is a totally-strong-self complemen-
tary graph structure and
+ − + + − + + +
I = ([t− − − −
I , tI ], [iI , iI ], [fI , fI ]) is an IVN subset of U where tI , iI , fI , tI , iI , fI
are constant functions, then every strong IVNGS of G with IVN vertex set I is a
totally-strong-self complementary IVNGS.
Proof. Let a, a′ ∈ [0, 1], b, b′ ∈ [0, 1] and c, c′ ∈ [0, 1] be six constants and
+ ′ + +
t− − − ′ ′
I (r) = a, iI (r) = b, fI (r) = c, tI (r) = a , iI (r) = b , fI (r) = c ,
for all r ∈ U .
Since G is a totally-strong-self complementary GS, so for every permutation ϕ−1
on {1, 2, . . . , t} there is a bijection f : U → U , such that for every Iu −edge (rs),
−1
(f(r)f(s)) [an Ij -edge in G ] is an Iu -edge in Gs ϕ c . Thus for every Iu -edge (rs),
ϕ−1 c
(f(r)f(s)) [an Ij -edge in Ǧiv ] is an I ϕ -edge in Gˇiv
u .
Moreover, Ǧiv is a strong IVNGS, so
t− − − −
I (r) = a = tI (f (r)), iI (r) = b = iI (f (r)), fI− (r) = c = fI− (f (r)),
tI (r) = a = tI (f (r)), iI (r) = b = i+
+ ′ + + ′
I (f (r)), fI+ (r) = c′ = fI+ (f (r)),
for all r ∈ U , and
t− − − − − −
Iu (rs) = tI (r) ∧ tI (s) = tI (f (r)) ∧ tI (f (s)) = tI ϕ (f (r)f (s)),
j

i− − − − − −
Iu (rs) = iI (r) ∧ iI (s) = iI (f (r)) ∧ iI (f (s)) = iI ϕ (f (r)f (s)),
j

fI−u (rs) = fI− (r) ∧ i− − − −

I (s) = fI (f (r)) ∧ fI (f (s)) = fI ϕ (f (r)f (s)),
j

t+ + + + + +
Iu (rs) = tI (r) ∧ tI (s) = tI (f (r)) ∧ tI (f (s)) = tI ϕ (f (r)f (s)),
j

i+ + + + + +
Iu (rs) = iI (r) ∧ iI (s) = iI (f (r)) ∧ iI (f (s)) = iI ϕ (f (r)f (s)),
j

fI+u (rs) = fI+ (r) ∧ i+ + + +

I (s) = fI (f (r)) ∧ fI (f (s)) = fI ϕ (f (r)f (s)),
j
136 M. Akram and M. Sitara

for all rs ∈ Ij , j = 1, 2, . . . , t.
This shows Ǧiv is a strong-self complementary IVNGS. This satisfies for each
permutation ϕ and ϕ−1 on set {1, 2, . . . , t}, thus Ǧiv is a totally-strong-self com-
plementary IVNGS. This completes the proof. 
Remark. Converse of theorem 2.42 may not true, for example a IVNGS depicted
in Fig. 22 is totally-strong-self complementary IVNGS, it is also strong IVNGS
with a totally-strong-self complementary underlying graph structure but t− −
I , iI ,
− + + +
fI ,tI , iI , fI are not the constant functions.

3. C ONCLUSIONS
Interval-valued fuzzy set theory has numerous applications in various fields of sci-
ence and technology, including, fuzzy control, artificial intelligence, operations
research and decision-making. An interval-valued neutrosophic graph constitutes
a generalization of the notion interval-valued fuzzy graph. In this research paper,
we have introduced the notion of interval-valued neutrosophic graph structures
and discussed many relevant notions with appropriate examples. We have also
discussed some interesting properties of these notions.
Conflict of interest. The authors declare that they have no conflict of interest.
Acknowledgment. The authors are highly thankful to the referees for their valu-
able comments and suggestions.

R EFERENCES
[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, 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.
[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 M. Nasir, Interval-valued neutrosophic competition graphs, Annals of Fuzzy
Mathematics and Informatics, 14(1),(2017) 99-120.
[7] M. Akram and R. Akmal, Application of bipolar fuzzy sets in graph structures, Applied Compu-
tational Intelligence and Soft Computing, 2016(2016), Article ID 5859080, 13 pages.
[8] M. Akram and S. Shahzadi, Neutrosophic soft graphs with application, Journal of Intelligent &
Fuzzy Systems, 32(1),(2017) 841-858.
[9] M. Akram and G. Shahzadi, Certain characterization of m-polar fuzzy graphs by level graphs,
Punjab University Journal of Mathematics, 49(1)(2017), 1-12.
[10] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy sets and Systems, 20,(1986) 87-96.
[11] P. Bhattacharya, Some remarks on fuzzy graphs, Pattern Recognition Letter, 6,(1987) 297-302.
[12] S. Broumi, M. Talea, A. Bakali and F. Smarandache, Interval valued neutrosophic graphs, Criti-
cal Review, 12,(2016) 5 − 33.
[13] T. Dinesh, A study on graph structures, incidence algebras and their fuzzy ana-
logues[Ph.D.thesis], Kannur University, Kannur, India, (2011).
[14] T. Dinesh and T.V. Ramakrishnan, On generalised fuzzy graph structures, Applied Mathematical
Sciences, 5(4),(2011) 173 − 180.
[15] M.B. Gorzalczany, A method of inference in approximate reasoning based on interval-valued
fuzzy sets, Fuzzy Sets Syst., 21,(1987) 1-17.
Interval-Valued Neutrosophic Graph Structures 137

[16] M.B. Gorzalczany, An interval-valued fuzzy inference method some basic properties, Fuzzy Sets
Syst., 31,(1989) 243-251.
[17] J. Hongmei and W. Lianhua, Interval-valued fuzzy subsemigroups and subgroups sssociated by
intervalvalued suzzy graphs, 2009 WRI Global Congress on Intelligent Systems, (2009) 484-487.
[18] A. Kaufmann, Introduction a la Thiorie des Sous-Ensemble Flous, Masson et Cie, 1,(1973).
[19] J.N. Mordeson and P. Chang-Shyh, Operations on fuzzy graphs, Information Sciences,
79,(3)(1994), 159-170.
[20] J.N. Mordeson and P.S. Nair, Fuzzy graphs and fuzzy hypergraphs, Physica Verlag, Heidelberg
1998; Second Edition, (2001).
[21] H. A. Othman, On fuzzy infra-semiopen sets, Punjab Univ. J. Math., 48, No. 2 (2016) 1-10.
[22] A. Rosenfeld, Fuzzy graphs, Fuzzy Sets and Their Applications, Academic Press, New York,
(1975) 77-95.
[23] E. Sampathkumar, Generalized graph structures, Bulletin of Kerala Mathematics Association,
3(2), (2006) 65 − 123.
[24] F. Smarandache, A unifying field in logics. neutrosophy: neutrosophic probability, set and logic.
Rehoboth:, American Research Press, (1999).
[25] 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.
[26] S. Mathew and M. Sunitha, Types of arcs in a fuzzy graph, Information Sciences, 179,(2009),
1760-1768.
[27] S. Mathew and M. Sunitha, Strongest strong cycles and fuzzy graphs, Fuzzy Systems, IEEE
Transactions on, 21,(2013), 1096-1104.
[28] I. Turksen, Interval valued fuzzy sets based on normal forms, Fuzzy Sets and Systems, 20,(1986)
191-210.
[29] H. Wang, F. Smarandache, Y.Q. Zhang and R. Sunderraman, Single-valued neutrosophic sets,
Multisspace and Multistruct, 4,(2010) 410-413.
[30] 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.
[31] H. Wang, F. Smarandache, Y.Q. Zhang and R. Sunderram, An Interval neutrosophic sets and
logic: theory and applications in computing, Hexis Arizona, (2005).
[32] L.A. Zadeh, Fuzzy sets, Information Control, 8,(1965) 338-353.
[33] L.A. Zadeh, The concept of a linguistic and application to approximate reasoning I, Information
Sci., 8, (1975) 199-249.
[34] L.A. Zadeh, Similarity relations and fuzzy orderings, Information Sciences, 3(2), (1971) 177 −
200.
[35] J. Zhan, W. A. Dudek and Y.B. Jun, Interval valued (∈, ∈ ∨q)-fuzzy filters of pseudo BL-
algebras, Soft Computing, 13, (2009) 13-21.
[36] J. Zhan, B. Davvaz and K. P. Shum, A new view of fuzzy hypernear-rings, Inform Sciences,
178,(2008) 425-438.