Bull. Comput. Appl. Math., Vol.6, No.

2, 2018

ISSN 2244-8659
www. ompama. o.usb.ve

Complex neutrosophi graphs

12 3
Naveed Yaqoob , Muhammad Akram

CompAMa Vol.6, No.2, pp.85-109, 2018 - A epted De ember 22, 2018

Abstra t
In this resear h arti le, we introdu e the notion of omplex neutrosophi graphs
(cn-graphs, for short) and dis uss some basi operations related to cn-graphs. We
des ribe these operations with some examples. We also present energy of omplex
neutrosophi graphs.
Keywords: Complex neutrosophi sets, omplex neutrosophi graphs, energy.

1 Introdu tion
Fuzzy set theory was introdu ed by Zadeh [1℄. Appli ations of these sets
have been broadly studied in other aspe ts su h as ontrol [2℄, reasoning
[1℄, pattern re ognition [2℄, engineering [3℄, et . Atanassov [4℄ proposed the
extended form of fuzzy set by adding a new omponent, alled intuitionisti
fuzzy sets (IFSs). The idea of IFSs is more meaningful as well as intensive
due to the presen e of degree of truth and falsity membership. Smaranda he
[5, 6℄ introdu ed the thought of neutrosophi sets by ombining the non-
standard analysis. Neutrosophi set theory is applied to image segmentation
[7℄, topology [8℄, de ision making [9℄, roboti s [10℄, physi s [11℄ and in many
more real life problems. See also [1216℄.

1
Department of Mathemati s, College of S ien e Al-Zul, Majmaah University, Al-
Zul, Saudi Arabia (na.yaqoobmu.edu.sa, nayaqoobymail. om).
2
Corresponding author.
3
Department of Mathemati s, University of the Punjab, New Campus, Lahore, Pakis-
tan (m.akrampu it.edu.pk).

85
Complex neutrosophi graphs 86

Bu kley [17℄ and Nguyen et al. [18℄ ombined omplex numbers with
fuzzy sets. On the other hand, Ramot et al. [19, 20℄ extended the range
of membership to unit ir le in the omplex plane, unlike the others who
limited the range to [0, 1]. Further this on ept has been studied in IFSs [21℄
and Samaranda he's neutrosophi sets [22℄.
A graph is a mathemati al obje t ontaining points (verti es) and onne -
tions (edges), and is a onvenient way of interpreting information involving
the relationship between dierent obje ts. However, due to some reasons,
in pra ti al appli ations of graph theory, dierent types of un ertainties are
frequently en ountered. To handle these un ertainties, Kaufmann [23℄ intro-
du ed the theory of fuzzy graphs based on Zadeh's fuzzy relations. Later,
Rosenfeld [24℄ put forward another elaborated denition of fuzzy graph with
fuzzy vertex and fuzzy edges and developed the stru ture of fuzzy graphs.
Mordeson and Peng [25℄ dened some operations on fuzzy graphs. All the
on epts on risp graph theory do not have similarities in fuzzy graphs.
Dhavaseelan et al. [26℄ dened strong neutrosophi graphs. Akram and
Shahzadi [27℄ rst studied single-valued neutrosophi graphs. Further several
new on epts on neutrosophi graphs with their appli ations were dis ussed
in [2831℄. On the other hand, Akram and Shahzadi [29℄ have shown that
there are some aws in Broumi et al. [30℄'s denitions. His denitions are
not useful for the study of applied network models. Re ently, Akram and
Naz [32℄ determined the energy of Pythagorean fuzzy graphs. In this pa-
per, we provide the new on ept of omplex neutrosophi graphs with some
fundamental operations. We also des ribe energy of omplex neutrosophi
graphs.

2 Preliminaries and basi denitions

Denition 1. [19℄ Let U 6= ∅. A omplex fuzzy set (CFS) A, is an obje t
of the form

A = {(x, µA (x)) : x ∈ U} = {(x, uA (x)eiωA (x) ) : x ∈ U},

√
where i = −1, uA (x) ∈ [0, 1] and 0 < ωA (x) < 2π.
Denition 2. [22℄ Let U 6= ∅. A omplex neutrosophi set (cn-set) A, is an
obje t of the form

A = {(x, TA (x), IA (x), FA (x)) : x ∈ U}

= {(x, sA (x)eiαA (x) , tA (x)eiβA (x) , uA (x)eiγA (x) ) : x ∈ U},
87 Yaqoob, Akram

√
where i = −1, sA (x), tA (x), uA (x) ∈ [0, 1], αA (x), βA (x), γA (x) ∈ [0, 2π]
and 0− ≤ sA (x) + tA (x) + uA (x) ≤ 3+ .
Denition 3. [22℄ Let A and B be two cn-sets in X, where

A = {(x, TA (x), IA (x), FA (x)) : x ∈ X }

and B = {(x, TB (x), IB (x), FB (x)) : x ∈ X }.

Then for all x ∈ X,

(1) A⊂B if and only if sA (x) < sB (x), tA (x) > tB (x), uA (x) > uB (x) for
amplitude terms and αA (x) < αB (x), βA (x) > βB (x), γA (x) > γB (x)
for phase terms.

(2) A=B if and only if sA (x) = sB (x), tA (x) = tB (x), uA (x) = uB (x) for
amplitude terms and αA (x) = αB (x), βA (x) = βB (x), γA (x) = γB (x)
for phase terms.

(3) A ∪ B = {(x, TA∪B (x), IA∪B (x), FA∪B (x)) : x ∈ X }

where

TA∪B (x) = sA∪B (x)eiαA∪B (x) = max{sA (x), sB (x)}ei max{αA (x),αB (x)} ,
IA∪B (x) = tA∪B (x)eiβA∪B (x) = min{tA (x), tB (x)}ei min{βA (x),βB (x)} ,
FA∪B (x) = uA∪B (x)eiγA∪B (x) = min{uA (x)uB (x)}ei min{γA (x),γB (x)} .

(4) A ∩ B = {(x, TA∩B (x), IA∩B (x), FA∩B (x)) : x ∈ X }

where

TA∩B (x) = sA∩B (x)eiαA∩B (x) = min{sA (x), sB (x)}ei min{αA (x),αB (x)} ,
IA∩B (x) = tA∩B (x)eiβA∩B (x) = max{tA (x), tB (x)}ei max{βA (x),βB (x)} ,
FA∩B (x) = uA∩B (x)eiγA∩B (x) = max{uA (x)uB (x)}ei max{γA (x),γB (x)} .

Denition 4. Let A and B be two cn-sets in X , where

A = {(x, TA (x), IA (x), FA (x)) : x ∈ X } and
B = {(x, TB (x), IB (x), FB (x)) : x ∈ X }.
Then TA (x) ≤ TB (x), IA (x) ≥ IB (x), FA (x) ≥ FB (x) if and only if
|TA (x)| ≤ |TB (x)|, |IA (x)| ≥ |IB (x)|, |FA (x)| ≥ |FB (x)| and
αA (x) ≤ αB (x), βA (x) ≥ βB (x), γA (x) ≥ γB (x).
Complex neutrosophi graphs 88

3 Complex neutrosophi graphs

Denition 5. cn-relation on X =
A 6 ∅, is a cn-subset of X × X of the form
B = {(xy, TB (xy), IB (xy), FB (xy)) : xy ∈ X × X } su h that

TB (xy) = sB (xy)eiαB (xy) , IB (xy) = tB (xy)eiβB (xy) , FB (xy) = uB (xy)eiγB (xy)

for all x, y ∈ X .
Denition 6. A cn-graph on X = 6 ∅, is a pair G = (A, B) where, A is a
cn-set on X and B is a cn-relation in X su h that

sB (xy)eiαB (xy) ≤ min{sA (x), sA (y)}ei min{αA (x),αA (y)} ,

tB (xy)eiβB (xy) ≤ min{tA (x), tA (y)}ei min{βA (x),βA (y)} ,
uB (xy)eiγB (xy) ≤ max{uA (x), uA (y)}ei max{γA (x),γA (y)}

for all x, y ∈ X . A and B are alled the omplex neutrosophi vertex set and
the omplex neutrosophi edge set of G, respe tively. Here B is the omplex
neutrosophi relation on A.
Example 1. G∗ = (V, E) su h that X = {a, b, c}, E =
Consider a graph
{ab, bc, ac}. Let A be a cn-subset of X and let B be a cn-subset of E ⊆ X ×X ,
as given:
!
(0.2ei π/2 ,0.4ei 2π/5 ,0.5ei π/4 ) i 3π/4 ,0.6ei π/2 ,0.1ei π/8 )
, (0.5e ,
A= a
(0.4ei π/2 ,0.5ei π ,0.2ei π/3 )
b .
c
!
(0.1ei π/2 ,0.4ei π/3 ,0.3ei π/6 ) i 2π/5 ,0.4ei 2π/5 ,0.1ei π/4 )
, (0.2e ,
B= ab
(0.1ei π/4 ,0.3ei π/4 ,0.4ei 2π/7 )
bc .
ac
By routine al ulations, it an be observed that the graph shown in Fig. 1 is
a cn-graph.
Denition 7. The Cartesian produ t G1 × G2 of two cn-graphs is dened as
a pair G1 × G2 = (A1 × A2 , B1 × B2 ), su h that:

1. sA1 ×A2 (x1 , x2 )eiαA1 ×A2 (x1 ,x2 ) = min{sA1 (x1 ), sA2 (x2 ))}ei min{αA1 (x1 ),αA2 (x2 )} ,
tA1 ×A2 (x1 , x2 )eiβA1 ×A2 (x1 ,x2 ) = min{tA1 (x1 ), tA2 (x2 ))}ei min{βA1 (x1 ),βA2 (x2 )} ,
uA1 ×A2 (x1 , x2 )eiγA1 ×A2 (x1 ,x2 ) = max{uA1 (x1 ), uA2 (x2 ))}ei max{γA1 (x1 ),γA2 (x2 )} ,
for all x1 , x2 ∈ X ,
89 Yaqoob, Akram

Fig. 1: cn-graph

2. sB1 ×B2 ((x, x2 )(x, y2 ))eiαB1 ×B2 ((x,x2 )(x,y2 ))

= min{sA1 (x), sB2 (x2 y2 ))}ei min{αA1 (x),αB2 (x2 y2 )} ,
tB1 ×B2 ((x, x2 )(x, y2 ))eiβB1×B2 ((x,x2 )(x,y2 ))
= min{tA1 (x), tB2 (x2 y2 ))}ei min{βA1 (x),βB2 (x2 y2 )} ,
uB1 ×B2 ((x, x2 )(x, y2 ))eiγB1 ×B2 ((x,x2 )(x,y2 ))
= max{uA1 (x), uB2 (x2 y2 ))}ei max{γA1 (x),γB2 (x2 y2 )},
for all x ∈ X1 , and x2 y2 ∈ E2 ,

3. sB1 ×B2 ((x1 , z)(y1 , z))eiαB1 ×B2 ((x1 ,z)(y1 ,z))

= min{sB1 (x1 y1 ), sA2 (z))}ei min{αB1 (x1 y1 ),αA2 (z)} ,
tB1 ×B2 ((x1 , z)(y1 , z))eiβB1 ×B2 ((x1 ,z)(y1 ,z))
= min{tB1 (x1 y1 ), tA2 (z))}ei min{βB1 (x1 y1 ),βA2 (z)} ,
uB1 ×B2 ((x1 , z)(y1 , z))eiγB1 ×B2 ((x1 ,z)(y1 ,z))
= max{uB1 (x1 y1 ), uA2 (z))}ei max{γB1 (x1 y1 ),γA2 (z)},
for all z ∈ X2 , and x1 y1 ∈ E1 .

Example 2. Consider the two cn-graphs, as shown in Fig. 2. Then, their

orresponding Cartesian produ t G1 × G2 is shown in Fig. 3.

Proposition 1. The Cartesian produ t of two cn-graphs is a cn-graph.

Complex neutrosophi graphs 90

Fig. 2: cn-graphs G1 and G2

Fig. 3: cn-graph G1 × G2
91 Yaqoob, Akram

Proof: The onditions for A1 × A2 are obvious, therefore, we verify only

onditions for B1 × B2 .
Let x ∈ X1 , and x2 y2 ∈ E2 . Then

sB1 ×B2 ((x, x2 )(x, y2 ))eiαB1 ×B2 ((x,x2 )(x,y2 ))

= min{sA1 (x), sB2 (x2 y2 ))}ei min{αA1 (x),αB2 (x2 y2 )}
≤ min{sA1 (x), min{sA2 (x2 ), sA2 (y2)}}ei min{αA1 (x),min{αA2 (x2 ),αA2 (y2 )}}
 
 min{αA1 (x), αA2 (x2 )}, 
  i min
min{sA1 (x), sA2 (x2 )}, min{αA1 (x), αA2 (y2 )}
= min e
 
min{sA1 (x), sA2 (y2 )}
= min{sA1 ×A2 (x, x2 ), sA1 ×A2 (x, y2 )}ei min{αA1 ×A2 (x,x2 ),αA1 ×A2 (x,y2 )} ,

tB1 ×B2 ((x, x2 )(x, y2 ))eiβB1 ×B2 ((x,x2 )(x,y2 ))

= min{tA1 (x), tB2 (x2 y2 ))}ei min{βA1 (x),βB2 (x2 y2 )}
≤ min{tA1 (x), min{tA2 (x2 ), tA2 (y2 )}}ei min{βA1 (x),min{βA2 (x2 ),βA2 (y2 )}}
 
 min{βA1 (x), βA2 (x2 )}, 
  i min
min{tA1 (x), tA2 (x2 )}, min{βA1 (x), βA2 (y2 )}
= min e
 
min{tA1 (x), tA2 (y2 )}
= min{tA1 ×A2 (x, x2 ), tA1 ×A2 (x, y2 )}ei min{βA1 ×A2 (x,x2 ),βA1 ×A2 (x,y2 )} ,

uB1 ×B2 ((x, x2 )(x, y2 ))eiγB1 ×B2 ((x,x2 )(x,y2 ))

= max{uA1 (x), uB2 (x2 y2 ))}ei max{γA1 (x),γB2 (x2 y2 )}
≤ max{uA1 (x), max{uA2 (x2 ), uA2 (y2 )}}ei max{γA1 (x),max{γA2 (x2 ),γA2 (y2 )}}
 
 max{γA1 (x), γA2 (x2 )}, 
  i max
max{uA1 (x), uA2 (x2 )}, max{γA1 (x), γA2 (y2 )}
= max e
 
max{uA1 (x), uA2 (y2 )}
= max{uA1 ×A2 (x, x2 ), uA1 ×A2 (x, y2 )}ei max{γA1 ×A2 (x,x2 ),γA1 ×A2 (x,y2 )} ,

Similarly, we an prove it for z ∈ X2 , and x1 y1 ∈ E1 . ✷

Denition 8. The omposition G1 ◦ G2 of two cn -graphs is dened as a pair
G1 ◦ G2 = (A1 ◦ A2 , B1 ◦ B2 ), su h that:

1. sA1 ◦A2 (x1 , x2 )eiαA1 ◦A2 (x1 ,x2 ) = min{sA1 (x1 ), sA2 (x2 ))}ei min{αA1 (x1 ),αA2 (x2 )} ,
Complex neutrosophi graphs 92

tA1 ◦A2 (x1 , x2 )eiβA1 ◦A2 (x1 ,x2 ) = min{tA1 (x1 ), tA2 (x2 ))}ei min{βA1 (x1 ),βA2 (x2 )} ,
uA1 ◦A2 (x1 , x2 )eiγA1 ◦A2 (x1 ,x2 ) = max{uA1 (x1 ), uA2 (x2 ))}ei max{γA1 (x1 ),γA2 (x2 )} ,
for all x1 , x2 ∈ X ,

2. sB1 ◦B2 ((x, x2 )(x, y2 ))eiαB1 ◦B2 ((x,x2 )(x,y2 ))

= min{sA1 (x), sB2 (x2 y2 ))}ei min{αA1 (x),αB2 (x2 y2 )} ,
tB1 ◦B2 ((x, x2 )(x, y2 ))eiβB1◦B2 ((x,x2 )(x,y2 ))
= min{tA1 (x), tB2 (x2 y2 ))}ei min{βA1 (x),βB2 (x2 y2 )} ,
uB1 ◦B2 ((x, x2 )(x, y2 ))eiγB1 ◦B2 ((x,x2 )(x,y2 ))
= max{uA1 (x), uB2 (x2 y2 ))}ei max{γA1 (x),γB2 (x2 y2 )} ,
for all x ∈ X1 , and x2 y2 ∈ E2 ,

3. sB1 ◦B2 ((x1 , z)(y1 , z))eiαB1 ◦B2 ((x1 ,z)(y1 ,z))

= min{sB1 (x1 y1 ), sA2 (z))}ei min{αB1 (x1 y1 ),αA2 (z)} ,
tB1 ◦B2 ((x1 , z)(y1 , z))eiβB1 ◦B2 ((x1 ,z)(y1 ,z))
= min{tB1 (x1 y1 ), tA2 (z))}ei min{βB1 (x1 y1 ),βA2 (z)} ,
uB1 ◦B2 ((x1 , z)(y1 , z))eiγB1 ◦B2 ((x1 ,z)(y1 ,z))
= max{uB1 (x1 y1 ), uA2 (z))}ei max{γB1 (x1 y1 ),γA2 (z)} ,
for all z ∈ X2 , and x1 y1 ∈ E1 .

4. sB1 ◦B2 ((x1 , x2 )(y1 , y2))eiαB1 ◦B2 ((x1 ,x2 )(y1 ,y2 ))
= min{sA2 (x2 ), sA2 (y2 ), sB1 (x1 y1 )}ei min{αA2 (x2 ),αA2 (y2 ),αB1 (x1 y1 )} ,
tB1 ◦B2 ((x1 , x2 )(y1 , y2 ))eiβB1◦B2 ((x1 ,x2 )(y1 ,y2 ))
= min{tA2 (x2 ), tA2 (y2 ), tB1 (x1 y1 )}ei min{βA2 (x2 ),βA2 (y2 ),βB1 (x1 y1 )} ,
uB1 ◦B2 ((x1 , x2 )(y1 , y2 ))eiγB1 ◦B2 ((x1 ,x2 )(y1 ,y2 ))
= max{uA2 (x2 ), uA2 (y2 ), uB1 (x1 y1 )}ei max{γA2 (x2 ),γA2 (y2 ),γB1 (x1 y1 )} ,
for all x2 , y2 ∈ X2 , x2 6= y2 and x1 y1 ∈ E1 .

Example 3. Consider the two cn-graphs, as shown in Fig. 4. Then, their

omposition G1 ◦ G2 is shown in Fig. 5.

Proposition 2. The omposition of two cn-graphs is a cn-graph.

93 Yaqoob, Akram

Fig. 4: cn-graphs G1 and G2

Fig. 5: cn-graph G1 ◦ G2
Complex neutrosophi graphs 94

Proof: As in the previous proof, we verify the onditions for B1 ◦ B2 only.

We prove the 2nd ase:

sB1 ◦B2 ((x, x2 )(x, y2 ))eiαB1 ◦B2 ((x,x2 )(x,y2 ))

= min{sA1 (x), sB2 (x2 y2 ))}ei min{αA1 (x),αB2 (x2 y2 )}
≤ min{sA1 (x), min{sA2 (x2 ), sA2 (y2 )}}ei min{αA1 (x),min{αA2 (x2 ),αA2 (y2 )}}
 
 min{αA1 (x), αA2 (x2 )}, 
  i min
min{sA1 (x), sA2 (x2 )}, min{αA1 (x), αA2 (y2 )}
= min e
 
min{sA1 (x), sA2 (y2 )}
= min{sA1 ◦A2 (x, x2 ), sA1 ◦A2 (x, y2 )}ei min{αA1 ◦A2 (x,x2 ),αA1 ◦A2 (x,y2 )} ,

tB1 ◦B2 ((x, x2 )(x, y2 ))eiβB1 ◦B2 ((x,x2 )(x,y2 ))

= min{tA1 (x), tB2 (x2 y2 ))}ei min{βA1 (x),βB2 (x2 y2 )}
≤ min{tA1 (x), min{tA2 (x2 ), tA2 (y2 )}}ei min{βA1 (x),min{βA2 (x2 ),βA2 (y2 )}}
 
 min{βA1 (x), βA2 (x2 )}, 
  i min
min{tA1 (x), tA2 (x2 )}, min{βA1 (x), βA2 (y2 )}
= min e
 
min{tA1 (x), tA2 (y2 )}
= min{tA1 ◦A2 (x, x2 ), tA1 ◦A2 (x, y2 )}ei min{βA1 ◦A2 (x,x2 ),βA1 ◦A2 (x,y2 )} ,

uB1 ◦B2 ((x, x2 )(x, y2 ))eiγB1 ◦B2 ((x,x2 )(x,y2 ))

= max{uA1 (x), uB2 (x2 y2 ))}ei max{γA1 (x),γB2 (x2 y2 )}
≤ max{uA1 (x), max{uA2 (x2 ), uA2 (y2 )}}ei max{γA1 (x),max{γA2 (x2 ),γA2 (y2 )}}
 
 max{γA1 (x), γA2 (x2 )}, 
  i max
max{uA1 (x), uA2 (x2 )}, max{γA1 (x), γA2 (y2 )}
= max e
 
max{uA1 (x), uA2 (y2 )}
= max{uA1 ◦A2 (x, x2 ), uA1 ◦A2 (x, y2 )}ei max{γA1 ◦A2 (x,x2 ),γA1 ◦A2 (x,y2 )} ,

Similarly, we an prove it for z ∈ X2 , and x1 y1 ∈ E1 . In the ase x2 , y2 ∈ X2 ,

95 Yaqoob, Akram

x2 6= y2 and x1 y1 ∈ E1 , we have,

sB1 ◦B2 ((x1 , x2 )(y1 , y2 ))eiαB1 ◦B2 ((x1 ,x2 )(y1 ,y2 ))
= min{sA2 (x2 ), sA2 (y2 ), sB1 (x1 y1 )}ei min{αA2 (x2 ),αA2 (y2 ),αB1 (x1 y1 )}
 
 αA2 (x2 ), αA2 (y2 ), 
  i min
sA2 (x2 ), sA2 (y2 ), min{αA1 (x1 ), αA1 (y1 )}
≤ min e
 
min{sA1 (x1 ), sA1 (y1 )}
 
 min{αA1 (x1 ), αA2 (x2 )}, 
  i min
min{sA1 (x1 ), sA2 (x2 )}, min{αA1 (y1 ), αA2 (y2 )}
= min e
 
min{sA1 (y1 ), sA2 (y2 )}
= min{sA1 ◦A2 (x1 , x2 ), sA1 ◦A2 (y1 , y2 )}ei min{αA1 ◦A2 (x1 ,x2 ),αA1 ◦A2 (y1 ,y2 )}

tB1 ◦B2 ((x1 , x2 )(y1 , y2 ))eiβB1◦B2 ((x1 ,x2 )(y1 ,y2 ))

= min{tA2 (x2 ), tA2 (y2 ), tB1 (x1 y1 )}ei min{βA2 (x2 ),βA2 (y2 ),βB1 (x1 y1 )}
 
 βA2 (x2 ), βA2 (y2 ), 
  i min
tA2 (x2 ), tA2 (y2 ), min{βA1 (x1 ), βA1 (y1 )}
≤ min e
 
min{tA1 (x1 ), tA1 (y1 )}
 
 min{βA1 (x1 ), βA2 (x2 )}, 
  i min
min{tA1 (x1 ), tA2 (x2 )}, min{βA1 (y1 ), βA2 (y2 )}
= min e
 
min{tA1 (y1 ), tA2 (y2 )}
= min{tA1 ◦A2 (x1 , x2 ), tA1 ◦A2 (y1 , y2)}ei min{βA1 ◦A2 (x1 ,x2 ),βA1 ◦A2 (y1 ,y2 )}

uB1 ◦B2 ((x1 , x2 )(y1 , y2 ))eiγB1 ◦B2 ((x1 ,x2 )(y1 ,y2 ))
= max{uA2 (x2 ), uA2 (y2 ), uB1 (x1 y1 )}ei max{γA2 (x2 ),γA2 (y2 ),γB1 (x1 y1 )}
 
 γA2 (x2 ), γA2 (y2 ), 
  i max
uA2 (x2 ), uA2 (y2), max{γA1 (x1 ), γA1 (y1 )}
≤ max e
 
max{uA1 (x1 ), uA1 (y1 )}
 
 max{γA1 (x1 ), γA2 (x2 )}, 
  i max
max{uA1 (x1 ), uA2 (x2 )}, max{γA1 (y1 ), γA2 (y2 )}
= max e
 
max{uA1 (y1), uA2 (y2 )}
= max{uA1 ◦A2 (x1 , x2 ), uA1 ◦A2 (y1 , y2 )}ei max{γA1 ◦A2 (x1 ,x2 ),γA1 ◦A2 (y1 ,y2 )} .
This ompletes the proof. ✷
Denition 9. The union G1 ∪ G2 = (A1 ∪ A2 , B1 ∪ B2 ) of two cn-graphs is
dened as follows:
Complex neutrosophi graphs 96

1. sA1 ∪A2 (x)eiαA1 ∪A2 (x) = sA1 (x)eiαA1 (x) ,

tA1 ∪A2 (x)eiβA1 ∪A2 (x) = tA1 (x)eiβA1 (x) ,
uA1 ∪A2 (x)eiγA1 ∪A2 (x) = uA1 (x)eiγA1 (x) ,
for x ∈ X1 and x∈
/ X2 .

2. sA1 ∪A2 (x)eiαA1 ∪A2 (x) = sA2 (x)eiαA2 (x) ,

tA1 ∪A2 (x)eiβA1 ∪A2 (x) = tA2 (x)eiβA2 (x) ,
uA1 ∪A2 (x)eiγA1 ∪A2 (x) = uA2 (x)eiγA2 (x) ,
for x ∈ X2 and x∈
/ X1 .

3. sA1 ∪A2 (x)eiαA1 ∪A2 (x) = max{sA1 (x), sA2 (x)}ei max{αA1 (x),αA2 (x)} ,
tA1 ∪A2 (x)eiβA1 ∪A2 (x) = max{tA1 (x), tA2 (x)}ei max{βA1 (x),βA2 (x)} ,
uA1 ∪A2 (x)eiγA1 ∪A2 (x) = min{uA1 (x), uA2 (x)}ei min{γA1 (x),γA2 (x)} ,
for x ∈ X1 ∩ X2 .

4. sB1 ∪B2 (xy)eiαB1 ∪B2 (xy) = sB1 (xy)eiαB1 (xy) ,

tB1 ∪B2 (xy)eiβB1 ∪B2 (xy) = tB1 (xy)eiβB1 (xy) ,
uB1 ∪B2 (xy)eiγB1 ∪B2 (xy) = uB1 (xy)eiγB1 (xy) ,
for xy ∈ E1 and xy ∈
/ E2 .

5. sB1 ∪B2 (xy)eiαB1 ∪B2 (xy) = sB2 (xy)eiαB2 (xy) ,

tB1 ∪B2 (xy)eiβB1 ∪B2 (xy) = tB2 (xy)eiβB2 (xy) ,
uB1 ∪B2 (xy)eiγB1 ∪B2 (xy) = uB2 (xy)eiγB2 (xy) ,
for xy ∈ X2 and xy ∈
/ X1 .

6. sB1 ∪B2 (xy)eiαB1 ∪B2 (xy) = max{sB1 (xy), sB2 (xy)}ei max{αB1 (xy),αB2 (xy)} ,
tB1 ∪B2 (xy)eiβB1 ∪B2 (xy) = max{tB1 (xy), tB2 (xy)}ei max{βB1 (xy),βB2 (xy)} ,
uB1 ∪B2 (xy)eiγB1 ∪B2 (xy) = min{uB1 (xy), uB2 (xy)}ei min{γB1 (xy),γB2 (xy)} ,
for xy ∈ X1 ∩ X2 .

Example 4. Consider the two cn-graphs, as shown in Fig. 6 and Fig. 7.

Then, their orresponding union G1 ∪ G2 is shown in Fig. 8.

Proposition 3. The union of two cn-graphs is a cn-graph.

97 Yaqoob, Akram

Fig. 6: cn-graph G1

Fig. 7: cn-graph G2

Fig. 8: cn-graph G1 ∪ G2
Complex neutrosophi graphs 98

Proof: Sin e all the onditions for A1 ∪ A2 are automati ally satised there-
fore, we verify only onditions for B1 ∪ B2 . In the ase, when xy ∈ E1 ∩ E2 .
Then

sB1 ∪B2 (xy)eiαB1 ∪B2 (xy)

= max{sB1 (xy), sB2 (xy)}ei max{αB1 (xy),αB2 (xy)}
 
 min{αA1 (x), αA1 (y)}, 
  i max
min{sA1 (x), sA1 (y)}, min{αA2 (x), αA2 (y)}
≤ max e
 
min{sA2 (x), sA2 (y)}
 
 max{αA1 (x), αA2 (x)}, 
  i min
max{sA1 (x), sA2 (x)}, max{αA1 (y), αA2 (y)}
= min e
 
max{sA1 (y), sA2 (y)}
= min{sA1 ∪A2 (x), sA1 ∪A2 (y)}ei min{αA1 ∪A2 (x),αA1 ∪A2 (y)}

tB1 ∪B2 (xy)eiβB1∪B2 (xy)

= max{tB1 (xy), tB2 (xy)}ei max{βB1 (xy),βB2 (xy)}
 
 min{βA1 (x), βA1 (y)}, 
  i max
min{tA1 (x), tA1 (y)}, min{βA2 (x), βA2 (y)}
≤ max e
 
min{tA2 (x), tA2 (y)}
 
 max{βA1 (x), βA2 (x)}, 
  i min
max{tA1 (x), tA2 (x)}, max{βA1 (y), βA2 (y)}
= min e
 
max{tA1 (y), tA2 (y)}
= min{tA1 ∪A2 (x), tA1 ∪A2 (y)}ei min{βA1 ∪A2 (x),βA1 ∪A2 (y)}

uB1 ∪B2 (xy)eiγB1 ∪B2 (xy)

= min{uB1 (xy), uB2 (xy)}ei min{γB1 (xy),γB2 (xy)}
 
 max{γA1 (x), γA1 (y)}, 
  i min
max{uA1 (x), uA1 (y)}, max{γA2 (x), γA2 (y)}
≤ min e
 
max{uA2 (x), uA2 (y)}
 
 min{γA1 (x), γA2 (x)}, 
  i max
min{uA1 (x), uA2 (x)}, min{γA1 (y), γA2 (y)}
= max e
 
min{uA1 (y), uA2 (y)}
= max{uA1 ∪A2 (x), uA1 ∪A2 (y)}ei max{γA1 ∪A2 (x),γA1 ∪A2 (y)}
99 Yaqoob, Akram

If xy ∈ E1 and xy ∈
/ E2 , then

sB1 ∪B2 (xy)eiαB1 ∪B2 (xy) ≤ min{sA1 ∪A2 (x), sA1 ∪A2 (y)}ei min{αA1 ∪A2 (x),αA1 ∪A2 (y)}
tB1 ∪B2 (xy)eiβB1∪B2 (xy) ≤ min{tA1 ∪A2 (x), tA1 ∪A2 (y)}ei min{βA1 ∪A2 (x),βA1 ∪A2 (y)}
uB1 ∪B2 (xy)eiγB1 ∪B2 (xy) ≤ max{uA1 ∪A2 (x), uA1 ∪A2 (y)}ei max{γA1 ∪A2 (x),γA1 ∪A2 (y)}

If xy ∈ E2 and xy ∈
/ E1 , then

sB1 ∪B2 (xy)eiαB1 ∪B2 (xy) ≤ min{sA1 ∪A2 (x), sA1 ∪A2 (y)}ei min{αA1 ∪A2 (x),αA1 ∪A2 (y)}
tB1 ∪B2 (xy)eiβB1∪B2 (xy) ≤ min{tA1 ∪A2 (x), tA1 ∪A2 (y)}ei min{βA1 ∪A2 (x),βA1 ∪A2 (y)}
uB1 ∪B2 (xy)eiγB1 ∪B2 (xy) ≤ max{uA1 ∪A2 (x), uA1 ∪A2 (y)}ei max{γA1 ∪A2 (x),γA1 ∪A2 (y)}

This ompletes the proof. ✷

Denition 10. The join G1 +G2 = (A1 +A2 , B1 +B2 ) of two cn-graphs, where,
X1 ∩ X2 = ∅, is dened as follows:


 sA1 +A2 (x)eiαA1 +A2 (x) = sA1 ∪A2 (x)eiαA1 ∪A2 (x)
1. t (x)eiβA1 +A2 (x) = tA1 ∪A2 (x)eiβA1 ∪A2 (x) if x ∈ X1 ∪ X2 ,
 A1 +A2
uA1 +A2 (x)eiγA1 +A2 (x) = uA1 ∪A2 (x)eiγA1 ∪A2 (x)

 sB1 +B2 (xy)eiαB1 +B2 (x) = sB1 ∪B2 (xy)eiαB1 ∪B2 (x)
2. t (xy)eiβB1+B2 (x) = tB1 ∪B2 (xy)eiβB1∪B2 (x) if xy ∈ E1 ∩ E2 ,
 B1 +B2
uB1 +B2 (xy)eiγB1 +B2 (x) = uB1 ∪B2 (xy)eiγB1 ∪B2 (x)

 sB1 +B2 (xy)eiαB1 +B2 (xy) = min{sA1 (x), sA2 (y)}ei min{αA1 (x),αA2 (y)}
3. t (xy)eiβB1+B2 (xy) = min{tA1 (x), tA2 (y)}ei min{βA1 (x),βA2 (y)} if xy ∈
 B1 +B2
uB1 +B2 (xy)eiγB1 +B2 (xy) = max uA1 (x), uA2 (y)}ei max{γA1 (x),γA2 (y)}
É,
where É is the set of all edges joining the verti es of X1 and X2 .

Example 5. Consider the two cn-graphs, as shown in Fig. 9. Then, their

orresponding join G1 +G2 is shown in Fig. 10.

Proposition 4. The join of two cn-graphs is a cn-graph.

Proof: G1 = (A1, B1 ) and G2 = (A2 , B2 ) be cn-graphs of the graphs
Let
G∗1 = (X1 , E1 ) and G∗2 = (X2 , E2 ), respe tively. We prove that G1 +G2 =
Complex neutrosophi graphs 100

Fig. 9: cn-graphs G1 and G2

Fig. 10: cn-graph G1 +G2

101 Yaqoob, Akram

(A1 +A2 , B1 +B2 ) is a cn-graph of the graph G∗1 +G∗2 . In view of Proposition 3
it is su ient to verify the ase when xy ∈ É . In this ase we have

sB1 +B2 (xy)eiαB1 +B2 (xy) = min{sA1 (x), sA2 (y)}ei min{αA1 (x),αA2 (y)}
≤ min{sA1 ∪A2 (x), sA1 ∪A2 (y)}ei min{αA1 ∪A2 (x),αA1 ∪A2 (y)}
= min{sA1 +A2 (x), sA1 +A2 (y)}ei min{αA1 +A2 (x),αA1 +A2 (y)}

tB1 +B2 (xy)eiβB1+B2 (xy) = min{tA1 (x), tA2 (y)}ei min{βA1 (x),βA2 (y)}
≤ min{tA1 ∪A2 (x), tA1 ∪A2 (y)}ei min{βA1 ∪A2 (x),βA1 ∪A2 (y)}
= min{tA1 +A2 (x), tA1 +A2 (y)}ei min{βA1 +A2 (x),βA1 +A2 (y)}

uB1 +B2 (xy)eiγB1 +B2 (xy) = max{uA1 (x), uA2 (y)}ei max{γA1 (x),γA2 (y)}
≤ max{uA1 ∪A2 (x), uA1 ∪A2 (y)}ei max{γA1 ∪A2 (x),γA1 ∪A2 (y)}
= max{uA1 +A2 (x), uA1 +A2 (y)}ei max{γA1 +A2 (x),γA1 +A2 (y)}

This ompletes the proof. ✷

Denition 11. Let G1 = (A1 , B1 ) and G2 = (A2 , B2 ) be two cn-graphs. A
homomorphism g : G1 → G2 is a mapping g : X1 → X2 su h that:


 sA1 (x1 )eiαA1 (x1 ) ≤ sA2 (g(x1 ))eiαA2 (g(x1 ))
1. t (x )eiβA1 (x1 ) ≤ tA2 (g(x1 ))eiβA2 (g(x1 )) for all x1 ∈ X1 ,
 A1 1 iγA1 (x1 )
uA1 (x1 )e ≤ uA2 (g(x1 ))eiγA2 (g(x1 ))

 sB1 (x1 y1 )eiαB1 (x1 y1 ) ≤ sB2 (g(x1 )g(y1))eiαB2 (g(x1 )g(y1 ))
2. t (x y )eiβB1 (x1 y1 ) ≤ tB2 (g(x1 )g(y1))eiβB2 (g(x1 )g(y1 )) for all x1 y1 ∈
 B1 1 1 iγB1 (x1 y1 ) iγB2 (g(x1 )g(y1 ))
uB1 (x1 y1 )e ≤ uB2 (g(x1 )g(y1))e
E1 .
A bije tive homomorphism with the property

 sA1 (x1 )eiαA1 (x1 ) = sA2 (g(x1 ))eiαA2 (g(x1 ))
3. t (x )eiβA1 (x1 ) = tA2 (g(x1 ))eiβA2 (g(x1 )) for all x1 ∈ X1 ,
 A1 1 iγA1 (x1 )
uA1 (x1 )e = uA2 (g(x1 ))eiγA2 (g(x1 ))
is alled a weak isomorphism. A bije tive homomorphism g : G1 → G2
su h that:
Complex neutrosophi graphs 102

Fig. 11: cn-graphs G1 and G2


 sB1 (x1 y1 )eiαB1 (x1 y1 ) = sB2 (g(x1 )g(y1))eiαB2 (g(x1 )g(y1 ))
4. tB (x1 y1 )eiβB1 (x1 y1 ) = tB2 (g(x1 )g(y1))eiβB2 (g(x1 )g(y1 )) for all x1 y1 ∈
 1
uB1 (x1 y1 )eiγB1 (x1 y1 ) = uB2 (g(x1 )g(y1))eiγB2 (g(x1 )g(y1 ))
E1 ,

is alled a weak o-isomorphism. A bije tive mapping g : G1 → G2

satisfying 3. and 4. is alled an isomorphism.

Example 6. Consider two cn-graphs, as shown in Fig. 11. Then, it is easy

to see that the mapping g : X1 → X2 dened by g(a1) = b2 and g(b1 ) = a2 is
a weak isomorphism.

4 Energy of omplex neutrosophi graph

Gutman [33℄ in 1978 dened the on ept of graph energy. Anjali and
Mathew [34℄ extended this idea to fuzzy graphs. Later, Praba et al. [35℄
extended this on ept for intuitionisti fuzzy graphs and Thirunavukarasu et
al. [36℄ extended this on ept for omplex fuzzy graphs. Here, we extended
this on ept to cn-graphs.
Denition 12. Adja en y matrix of a cn-graph is written in the form of two
adja ent matri es, one ontaining the entries as values of amplitude fun tions
103 Yaqoob, Akram

and the other ontaining the entries as values of phase fun tions i.e.,

M(CNG) = (M(sij , tij , uij ), M(αij , βij , γij )).

Denition 13. The eigenvalue of an adja en y matrix of cn-graph M(CNG)

is dened in the form (X, Y ), where
(i) the set of eigenvalues of M(sij , tij , uij ) = X ,
(ii) the set of eigenvalues of M(αij , βij , γij ) = Y.

Denition 14. The energy of a cn-graph is dened by

 
Σ (|li |, |mi |, |ni |), Σ (|ei |, |fi |, |gi |)
(li ,mi ,ni )∈X (ei ,fi ,gi )∈X

where Σ (|li |, |mi |, |ni |) is the energy of the Amplitude matrix denoted
(li ,mi ,ni )∈X
by
E(sij (CNG), tij (CNG), uij (CNG))

and Σ (|ei |, |fi |, |gi |) is the energy of the Phase matrix denoted by
(ei ,fi ,gi )∈X

E(αij (CNG), βij (CNG), γij (CNG)).

Denition 15. CNG be a cn-graph (without loops) with |V| = n and

Let
|E| = m and M(CNG) = (M(sij , tij , uij ), M(αij , βij , γij )) be an adja en y
matrix of cn-graph of CNG, then upper bound and lower bound of the energy
of the cn-graph is
r
2
(i) 2 Σ sij sji + n(n − 1)|M(sij )| n ≤ E(sij (CNG))
1≤i<j≤n
q
≤ 2n Σ sij sji
1≤i<j≤n
where
r|M(sij )| is the determinant of M(sij ).
2
(ii) 2 Σ tij tji + n(n − 1)|M(tij )| n ≤ E(tij (CNG))
1≤i<j≤n
q
≤ 2n Σ tij tji
1≤i<j≤n
where
r|M(tij )| is the determinant of M(tij ).
2
(iii) 2 Σ uij uji + n(n − 1)|M(uij )| n ≤ E(uij (CNG))
1≤i<j≤n
q
≤ 2n Σ uij uji
1≤i<j≤n
where |M(uij )| is the determinant of M(uij ).
Complex neutrosophi graphs 104

Fig. 12: cn-graph G

r
2
(iv) 2 Σ αij αji + n(n − 1)|M(αij )| n ≤ E(αij (CNG))
1≤i<j≤n
q
≤ 2n Σ αij αji
1≤i<j≤n
where |M(αij )| is the determinant of M(αij ).
r
2
(v) 2 Σ βij βji + n(n − 1)|M(βij )| n ≤ E(βij (CNG))
1≤i<j≤n
q
≤ 2n Σ βij βji
1≤i<j≤n
where |M(βij )| is the determinant of M(βij ).
r
2
(vi) 2 Σ γij γji + n(n − 1)|M(γij )| n ≤ E(γij (CNG))
1≤i<j≤n
q
≤ 2n Σ γij γji
1≤i<j≤n
where |M(γij )| is the determinant of M(γij ).

A numeri al example to nd out the energy of a cn-graph is given below.

Example 7. Consider a graph G∗ = (V, E) su h that X = {a, b, c, d}, E =

{ab, bc, cd, da}. Let B be a cn-subset of E ⊆ X × X , as given:
!
0.1ei π/5 ,0.7ei 4π/3 ,0.8ei 3π/4 i π/4 ,0.4ei 2π/5 ,0.6ei π/3
, 0.2e ,
B= 0.1ei
ab
π/2 ,0.6ei π/6 ,0.5ei 5π/4
bc
i 3π/2 ,0.3ei 5π/4 ,0.7ei 7π/6 .
cd
, 0.3e da
105 Yaqoob, Akram

The adja en y matrix of the graph is

M(CNG) = (M(sij , tij , uij ), M(αij , βij , γij )),

where
 
0 (0.1, 0.7, 0.8) 0 (0.3, 0.3, 0.7)
 (0.1, 0.7, 0.8) 0 (0.2, 0.4, 0.6) 0 
M(sij , tij , uij ) =  
 0 (0.2, 0.4, 0.6) 0 (0.1, 0.6, 0.5) 
(0.3, 0.3, 0.7) 0 (0.1, 0.6, 0.5) 0
and
 
0 (π/5, 4π/3, 3π/4) 0 (3π/2, 5π/4, 7π/6)
 (π/5, 4π/3, 3π/4) 0 (π/4, 2π/5, π/3) 0 
M(αij , βij , γij ) =  
 0 (π/4, 2π/5, π/3) 0 (π/2, π/6, 5π/4) 
(3π/2, 5π/4, 7π/6) 0 (π/2, π/6, 5π/4) 0
 
0 0.1 0 0.3
 0.1 0 0.2 0 
Eigenvalues of M(sij ) =  
 0 0.2 0 0.1 
0.3 0 0.1 0
are {−0.3618, −0.1382, 0.1382, 0.3618}
 
0 0.7 0 0.3
 0.7 0 0.4 0 
Eigenvalues of M(tij ) =  
 0 0.4 0 0.6 
0.3 0 0.6 0
are {−1.0055, −0.2984, 0.2984, 1.0055}
 
0 0.8 0 0.7
 0.8 0 0.6 0 
Eigenvalues of M(uij ) =  
 0 0.6 0 0.5 
0.7 0 0.5 0
are {−1.3190, −0.0155, 0.0155, 1.3190}
 
0 π/5 0 3π/2
 π/5 0 π/4 0 
Eigenvalues of M(αij ) =  
 0 π/4 0 π/2 
3π/2 0 π/2 0
are {−1.6035π, −0.1726π, 0.1726π, 1.6035π}
 
0 4π/3 0 5π/4
 4π/3 0 2π/5 0 
Eigenvalues of M(βij ) =  
 0 2π/5 0 π/6 
5π/4 0 π/6 0
Complex neutrosophi graphs 106

are {−2.4137π, −0.7243π,0.7243π, 2.4137π} 

0 3π/4 0 7π/6
 3π/4 0 π/3 0 
Eigenvalues of M(γij ) =  
 0 π/3 0 5π/4 
7π/6 0 5π/4 0
are {−1.8742π, −0.26π, 0.26π, 1.8742π}
Energy of Amplitude matrix = (1, 2.6078, 2.669).
Energy of Phase matrix = (3.5522π, 6.2761π, 4.2684π).

5 Con lusion
A graph is a mathemati al obje t ontaining points (verti es) and onne -
tions (edges), and is a onvenient way of interpreting information involv-
ing the relationship between dierent obje ts. We have dened cn-graphs
and some operations, in luding union of cn-graphs, Cartesian produ t of cn-
graphs, join of cn-graphs and omposition of cn-graphs. We have aim to
extend our work to: (1) Complex fuzzy soft graphs, (2) Complex intuition-
isti fuzzy graphs.

Referen es
[1℄ L.A. Zadeh. Fuzzy sets. Inform. Control, 8(3):338353, 1965. doi:
10.1016/S0019-9958(65)90241-X.

[2℄ H.J. Zimmermann. Fuzzy set theory and its appli ations,. Originally
published by Kluwer A ademi Publishers in 1991, Se ond, Revised
Edition. Springer S ien e+Business Media, LLC, 1991. ISBN 978-94-
015-7951-3, doi: 10.1007/978-94-015-7949-0.

[3℄ M.J. Mendel. Fuzzy logi systems for engineering: a tutorial. Pro .
IEEE, 83:345377, 1995. doi: 10.1109/5.364485.

[4℄ K Atanassov. Intuitionisti fuzzy sets. Fuzzy Sets Syst., 20(1):8796,

1986. doi: 10.1016/S0165-0114(86)80034-3.

[5℄ F. Smaranda he. A unifying eld in logi s. neutrosophy: neutrosophi

probability, set and logi . Rehoboth:, Ameri an Resear h Press, 1999.
ISBN 1879585766.
107 Yaqoob, Akram

[6℄ F. Smaranda he. Neutrosophi set - a generalization of the intuitionis-

ti fuzzy set. IEEE Int. Conf. Granular Comput., 1:3842, 2006. doi:
10.1109/GRC.2006.1635754.

[7℄ Y. Guo and H.D. Cheng. A new neutrosophi approa h to im-

age segmentation. Pattern Re ognit., 42(5):587595, 2009. doi:
10.1016/j.pat og.2008.10.002.

[8℄ F.G. Lupianez. On neutrosophi topology. Kybernetes, 37(6):797800,

2018. doi: 10.1108/03684920810876990.

[9℄ P. Majumdar. Neutrosophi sets and its appli ations to de ision making.
In: A harjya D., Dehuri S., Sanyal S. (Eds.) Computational Intelligen e
for Big Data Analysis, 19:97115, 2015. doi: 10.1007/978-3-319-16598-
1_4.

[10℄ F. Smaranda he and L. Vladareanu. Appli ations of neutrosophi logi

to roboti s - an introdu tion. IEEE Int. Conf. Granular Comput., 1:607
612, 2011. doi: 10.1109/GRC.2011.6122666.

[11℄ F. Smaranda he. n-valued rened neutrosophi logi and its appli-
ations to physi s. Prog. Phys., 4:143146, 2013. http://www.ptep-
online. om/2013/PP-35-17.PDF.

[12℄ M. Gulistan, S. Nawaz, and H. Hassan. Neutrosophi triplet non-

asso iative semihypergroups with appli ation. Symmetry, 10(11):ID:613,
2018. doi: 10.3390/sym10110613.

[13℄ M. Gulistan, N. Yaqoob, Z. Rashid, F. Smaranda he, and H.A. Wa-

hab. A study on neutrosophi ubi graphs with real life appli ations in
industries. Symmetry, 10(6):ID:203, 2018. doi: 10.3390/sym10060203.

[14℄ R.M. Hashim, M. Gulistan, and F. Smaranda he. Appli ations of neu-
trosophi bipolar fuzzy sets in hope foundation for planning to build a
hildren hospital with dierent types of similarity measures. Symmetry,
10:ID:331, 2018. doi: 10.3390/sym10080331.

[15℄ M. Khan, M. Gulistan, N. Yaqoob, and M. Shabir. Neutrosophi u-

bi (α, β )-ideals in semigroups with appli ation. J. Intell. Fuzzy Syst.,
35(2):24692483, 2018. doi: 10.3233/JIFS-18112.
Complex neutrosophi graphs 108

[16℄ J. Zhan, M. Khan, M. Gulistan, and A. Ali. Appli a-

tions of neutrosophi ubi sets in multi- riteria de ision-
making. Int. J. Un ertain. Quan., 7(5):377394, 2017. doi:
10.1615/Int.J.Un ertaintyQuanti ation.2017020446.

[17℄ J.J. Bu kley. Fuzzy omplex numbers. Fuzzy Sets Syst., 33(3):333345,
1989. doi: 10.1016/0165-0114(89)90122-X.

[18℄ H.T. Nguyen, A. Kandel, and V. Kreinovi h. Complex fuzzy sets: to-
wards new foundations. IEEE Trans Fuzzy Syst., 2:10451048, 2000.
doi: 10.1109/FUZZY.2000.839195.

[19℄ D. Ramot, R. Milo, M. Friedman, and A. Kandel. Complex fuzzy sets.

IEEE Trans Fuzzy Syst., 10(2):171186, 2002. doi: 10.1109/91.995119.

[20℄ D. Ramot, M. Friedman, G. Langholz, and A. Kandel. Complex

fuzzy logi . IEEE Trans Fuzzy Syst., 11(4):450461, 2003. doi:
10.1109/TFUZZ.2003.814832.

[21℄ A.M. Alkouri and A.R. Salleh. Complex Atanassov's intuitionisti

fuzzy relation. Abstr. Appl. Anal., Arti le ID 287382:118, 2013. doi:
10.1155/2013/287382.

[22℄ M. Ali and F. Smaranda he. Complex neutrosophi set. Neural Comput.
Appl., 28(7):18171834, 2017. doi: 10.1007/s00521-015-2154-y.

[23℄ A. Kaufmann. Introdu tion a la Thiorie des Sous-Ensemble Flous. Neu-

trosophi graphs: A new dimension to graph theory 1. Masson et Cie,
Paris, 1973. ISBN 2225366305.

[24℄ A. Rosenfeld. Fuzzy graphs. In: Zadeh L.A., Fu K.S., Shimura M. (Eds.)
Fuzzy Sets and Their Appli ations. A ademi Press, New York, 1975.
http://www.oalib. om/referen es/13875421.

[25℄ J.N. Mordeson and C.S. Peng. Operations on fuzzy graphs. Inf. S i.,
79(3-4):159170, 1994. doi: 10.1016/0020-0255(94)90116-3.

[26℄ R. Dhavaseelan, R. Vikramaprasad, and V. Krishnaraj. Certain types

of neutrosophi graphs. Int. J. Math. S i. Appl., 5(2):333339, 2015.
http://ijmsa.yolasite. om/resour es/14.
109 Yaqoob, Akram

[27℄ M. Akram and S. Shahzadi. Neutrosophi soft graphs with appli ation.
J. Intell. Fuzzy Syst., 32(1):841858, 2017. doi: 10.3233/JIFS-16090,
https://www.mdpi. om/2075-1680/7/1/14/pdf.

[28℄ M. Akram. Single-valued neutrosophi planar graphs. Int. J. Algebra

Stat., 5(2):157167, 2016. doi: 10.20454/ijas.2016.1207.

[29℄ M. Akram and G. Shahzadi. Operations on single-valued

neutrosophi graphs. J. Un ertain Syst., 11(2):126, 2017.
http://fs.unm.edu/neut/OperationsOnSingleValued.pdf.

[30℄ S. Broumi, A. Bakali, M. Talea, and F. Smaranda he. Isolated single

valued neutrosophi graphs. Neutrosophi Sets Syst., 11:7478, 2016.
http://fs.unm.edu/NSS/IsolatedSingleValuedNeutrosophi Graphs.pdf.

[31℄ S. Ashraf, S. Naz, H. Rashmanlou, and H.A. Malik. Regularity of

graphs in single-valued neutrosophi environment. J. Intell. Fuzzy Syst.,
33(1):529542, 2017. doi: 10.3233/JIFS-161960.

[32℄ M. Akram and S. Naz. Energy of pythagorean fuzzy graphs with appli-
ations. Mathemati s, 6(8):136162, 2018. doi: 10.3390/math6080136.

[33℄ I. Gutman. The energy of a graph. Ber. Math.

Statist. Sekt. Fors hungszentram Graz., 103:122, 1978.
https://www.s irp.org/(S(351jmbntvnsjt1aadkposzje))/referen e/Refe
ren esPapers.aspx?Referen eID=1513425.

[34℄ N. Anjali and S. Mathew. Energy of a fuzzy graph. Ann. Fuzzy Math.
Inform., 6(3):455465, 2013. http://www.afmi.or.kr/arti les_in_

[35℄ B. Praba, V.M. Chandrasekaran, and G. Deepa. Energy

of an intuitionisti fuzzy graph. Ital. J. Pure Appl. Math.,
32:431444, 2014. http://ijpam.uniud.it/online_issue/201432/40-
PrabaChandrasekaranDeepa.pdf.

[36℄ P. Thirunavukarasu, R. Suresh, and K.K. Viswanathan. Energy

of a omplex fuzzy graph. Journal of Mathemati al S ien es and
Engineering Appli ations, 10(1):243248, 2016. http://www.as ent-
journals. om/IJMSEA/Vol10No1/20-suresh.pdf.