Neutrosophic System and Its Applications A New Wave

Neutrosophic System and its Applications “A New Wave" ISBN : 9781365528811
CHAPTER-1
CERTAIN TYPES OF NEUTROSOPHIC GRAPHS

1
V. Krishnaraj, 2R.Vikrama Prasad and 3R.Dhavaseelan
2
Department of Mathematics, Government Arts College(A),Salem - 636 007,
Tamil Nadu, India.
1,3
Department of Mathematics, Sona College of Technology, Salem - 636 005,
Tamil Nadu, India.
1. Introduction :-
The notion graph theory was first introduced by Euler in 1736. In the history of mathematics,
the solution given by Euler of the well known K𝑜nigsberg bridge problem is considered to be the first
theorem of graph theory. This has now become a subject generally regarded as a branch of
combinatorics.The theory of graph is an extremely useful tool for solving combinatorial problems in
different areas such as geometry, algebra, number theory, topology, operations research, optimization
and computer science. On the other hand, fuzzy graph theory as a generalization of Eulers graph theory
was first introduced by Rosenfeld [5] in 1975. In 1965, Zadeh[8] proposed the theory of fuzzy set
theory which is applied in many real applications to handle uncertainty. Atanassov[2] added a new
component (which determines the degree of non-membership) in the definition of fuzzy set. The
concept of Neutrosophic set was introduced by F. Smarandache [6] which is a mathematical tool for
handling problems involving imprecise, indeterminacy and inconsistent data. The notion of strong
graphs and investigate some of their properties [1]. In this chapter, the concept of strong neutrosophic
graph is introduced. Some interesting properties of strong neutrosophic graphs are studied.
2.Preliminaries:-
Definition 2.1 :- [1] An intuitionistic fuzzy graph is of the form 𝐺 = 〈𝑉, 𝐸〉 where
1. 𝑉 = {𝑣1 , 𝑣2 , . . . , 𝑣𝑛 } such that 𝜇1 : 𝑉 → [0,1] and 𝛾1 : 𝑉 → [0,1] denote the degree of
membership and nonmembership of the element 𝑣𝑖 ∈ 𝑉 respectively, and
0 ≤ 𝜇1 (𝑣𝑖 ) + 𝛾1 (𝑣𝑖 ) ≤ 1 (2.1)
2. 𝐸 ⊆ 𝑉 × 𝑉 where 𝜇2 : 𝑉 × 𝑉 → [0,1] and 𝛾2 : 𝑉 × 𝑉 → [0,1] are such that
Lulu, Intetnational Publisher, United States. 1

𝜇2 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑚𝑖𝑛{𝜇1 (𝑣𝑖 ), 𝜇1 (𝑣𝑗 )} (2.2)

𝛾2 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑚𝑎𝑥{𝛾1 (𝑣𝑖 ), 𝛾1 (𝑣𝑗 )} (2.3)
and 0 ≤ 𝜇2 (𝑣𝑖 , 𝑣𝑗 ) + 𝛾2 (𝑣𝑖 , 𝑣𝑗 ) ≤ 1 for every (𝑣𝑖 , 𝑣𝑗 ) ∈ 𝐸, 𝑖, 𝑗 = 1,2, . . . , 𝑛.
3.Certain types of Neutrosophic Graphs:-
Definition 3.1: A Neutrosophic graph (NG) is of the form 𝐺 =< 𝑉, 𝐸 > where
1. 𝑉 = 𝑣1 , 𝑣2 , 𝑣3 , . . . , 𝑣𝑛 such that𝜇1 : 𝑉 → [0,1] , 𝜍1 : 𝑉 → [0,1] and 𝛾1 : 𝑉 → [0,1]
denote the degree of membership, degree of indeterminacy and non-membership of the element
𝑣𝑖 ∈ 𝑉, respectively, and 0 ≤ 𝜇1 𝑣𝑖 + 𝜍1 𝑣𝑖 + 𝛾1 𝑣𝑖 ≤ 3 for every
𝑣𝑖 ∈ 𝑉, (𝑖 = 1,2, … , 𝑛)
2. 𝐸 ⊆ 𝑉 × 𝑉where 𝜇2 : 𝑉 × 𝑉 → [0,1] , 𝜍2 : 𝑉 × 𝑉 → [0,1] and 𝛾2 : 𝑉 × 𝑉 → [0,1] are

such that
𝜇2 𝑣𝑖 , 𝑣𝑗 ≤ min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗 ,
𝜍2 𝑣𝑖 , 𝑣𝑗 ≤ min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗 and
𝛾2 𝑣𝑖 , 𝑣𝑗 ≤ min 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗 and
0 ≤ 𝜇2 𝑣𝑖 , 𝑣𝑗 + 𝜍2 𝑣𝑖 , 𝑣𝑗 + 𝛾2 𝑣𝑖 , 𝑣𝑗 ≤ 3 for every 𝑣𝑖 , 𝑣𝑗 ∈ 𝐸(𝑖, 𝑗 = 1,2,3, . . . , 𝑛).
Definition 3.2 : An neutrosophic graph 𝐺 = 〈𝑉, 𝐸〉 is said to be complete neutrosophic graph if

𝜇2𝑖𝑗 = 𝑚𝑖𝑛(𝜇1𝑖 , 𝜇1𝑗 ),
𝜍2𝑖𝑗 = 𝑚𝑖𝑛(𝜍1𝑖 , 𝜍1𝑗 ) and

𝛾2𝑖𝑗 = 𝑚𝑎𝑥(𝛾1𝑖 , 𝛾1𝑗 ), for every 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉.
Definition 3.3 : Let 𝐺 = 〈𝑉, 𝐸〉 be a neutrosophic graph. Then the degree of a vertex v is defined by
𝑑(𝑣) = (𝑑𝜇 (𝑣), 𝑑𝛾 (𝑣)) where 𝑑𝜇 (𝑣) = 𝑢≠𝑣 ‍𝜇2 (𝑢, 𝑣),𝑑𝜍 (𝑣) = 𝑢≠𝑣 ‍𝜍2 (𝑢, 𝑣) and 𝑑𝛾 (𝑣) =
𝑢≠𝑣 ‍𝛾2 (𝑢, 𝑣).
Definition 3.4 : A neutrosophic graph 𝐺 =< 𝑉, 𝐸 > and 𝐺 ∗ is called Strong Neutrosophic graph.
𝜇2 𝑣𝑖 , 𝑣𝑗 = min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗 ,
𝜍2 𝑣𝑖 , 𝑣𝑗 = min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗 and
𝛾2 𝑣𝑖 , 𝑣𝑗 = max 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗
for all 𝑣𝑖 , 𝑣𝑗 ∈ 𝐸.
Definition 3.5 : The complement of a strong neutrosophic graph 𝐺 𝑜𝑛 𝐺 ∗ a Strong Neutrosophic

Graph 𝐺 𝑜𝑛 𝐺 ∗ where
1. 𝑉 = 𝑉
2. 𝜇1 𝑣𝑖 = 𝜇1 𝑣𝑖 , 𝜍1 𝑣𝑖 = 𝜍1 𝑣𝑖 , 𝛾1 𝑣𝑖 = 𝛾1 𝑣𝑖 , 𝑣𝑖 ∈ 𝑉
3.
0 𝑖𝑓 𝜇2 𝑣𝑖 , 𝑣𝑗 > 0
𝜇2 𝑣𝑖 , 𝑣𝑗 = min 𝜇 𝑣 , 𝜇 𝑣
1 𝑖 1 𝑗 𝑖𝑓 𝜇2 𝑣𝑖 , 𝑣𝑗 = 0
0 𝑖𝑓 𝛾2 𝑣𝑖 , 𝑣𝑗 > 0
𝛾2 𝑣𝑖 , 𝑣𝑗 = max 𝛾 𝑣 , 𝛾 𝑣
1 𝑖 1 𝑗 𝑖𝑓 𝛾2 𝑣𝑖 , 𝑣𝑗 = 0

0 𝑖𝑓 𝜍2 𝑣𝑖 , 𝑣𝑗 > 0
𝜍2 𝑣𝑖 , 𝑣𝑗 = min 𝜍 𝑣 , 𝜍 𝑣
1 𝑖 1 𝑗 𝑖𝑓 𝜍2 𝑣𝑖 , 𝑣𝑗 = 0
Remark 3.1 : If 𝐺 =< 𝑉, 𝐸 > is a neutrosophic graph on 𝐺 ∗ . Then from above definition, it follow
that 𝐺 is given by the neutrosophic graph 𝐺 =< 𝑉, 𝐸 > on 𝐺 ∗ where 𝑉 = 𝑉 and 𝜇2 𝑣𝑖 , 𝑣𝑗 =
min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗 , 𝜍2 𝑣𝑖 , 𝑣𝑗 = min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗 ,𝛾2 𝑣𝑖 , 𝑣𝑗 = max 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗 . for all

𝑣𝑖 , 𝑣𝑗 ∈ 𝐸
Thus 𝜇2 = 𝜇2 , 𝜍2 = 𝜍2 , 𝑎𝑛𝑑 𝛾2 = 𝛾2 on 𝑉 , where 𝐸 = (𝜇2 , 𝜍2 , 𝛾2 ) is the strong

neutrosophic relation on 𝑉. For any neutrosophic graph 𝐺, 𝐺 is strong neutrosophic graph and
𝐺 ⊆ 𝐺.
Proposition 3.1 : 𝐺 = 𝐺 if and only if 𝐺 is a strong neutrosophic graph.
Proof. It is obvious.
Definition 3.6 : A strong neutrosophic graph 𝐺 is called self complementary if 𝐺 ≈ 𝐺.
Example 3.1 : Consider a graph 𝐺 ∗ = (𝑉, 𝐸) such that 𝑉 = 𝑎, 𝑏, 𝑐, 𝑑 , 𝐸 = 𝑎𝑏, 𝑎𝑐, 𝑏𝑐, 𝑐𝑑 .
Consider a strong neutrosophic graph G.

Neutrosophic System and its Applications “A New Wave"
Clearly, 𝐺 = 𝐺. Hence 𝐺 is self complementary.
Proposition 3.2 : Let G be a strong neutrosophic graph. If

𝜇2 𝑣𝑖 , 𝑣𝑗 = min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗 ,𝜍2 𝑣𝑖 , 𝑣𝑗 = min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗 ,𝛾2 𝑣𝑖 , 𝑣𝑗 =
max 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗 for all 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. Then 𝐺 is self complementary.
Proof. Let 𝐺 be a strong neutrosophic graph such that

𝜇2 𝑣𝑖 , 𝑣𝑗 = min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗
𝜍2 𝑣𝑖 , 𝑣𝑗 = min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗
𝛾2 𝑣𝑖 , 𝑣𝑗 = max 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗
for all 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. Then 𝐺 ≃ 𝐺 under the identity map 𝐼: 𝑉 → 𝑉 .Hence 𝐺 is self

complementary.
Proposition 3.3 : Let G be a self complementary strong neutrosophic graphic. Then
𝑣𝑖 ≠𝑣𝑗 ‍𝜇2 𝑣𝑖 , 𝑣𝑗 = 𝑣𝑖 ≠𝑣𝑗 ‍min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗
𝑣𝑖 ≠𝑣𝑗 ‍𝜍2 𝑣𝑖 , 𝑣𝑗 = 𝑣𝑖 ≠𝑣𝑗 ‍min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗
𝑣𝑖 ≠𝑣𝑗 ‍𝛾2 𝑣𝑖 , 𝑣𝑗 = 𝑣𝑖 ≠𝑣𝑗 ‍max 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗
Proposition 3.4 : Let 𝐺1 and 𝐺2 be strong neutrosophic graphics. 𝐺1 ≈ 𝐺2 .
Proof. Assume that 𝐺1 and 𝐺2 are isomorphic, there exist a bijective map 𝑓:𝑉1 →𝑉2 satisfying
𝜇 𝑉1
𝑣𝑖 = 𝜇 𝑉2
𝑓(𝑣𝑖 ) ,
𝜍 𝑣𝑖 = 𝜍 𝑉2
𝑓(𝑣𝑖 ) ,
𝑉1
𝛾 𝑉1
𝑣𝑖 = 𝛾 𝑉2
𝑓(𝑣𝑖 ) for all 𝑣𝑖 ∈𝑉1 .
𝜇 𝐸1
𝑣𝑖 , 𝑣𝑗 = 𝜇 𝐸2
𝑓 𝑣𝑖 , 𝑓(𝑣𝑗 ) ,
𝜍 𝐸1
𝑣𝑖 , 𝑣𝑗 = 𝜍 𝐸2
𝛾 𝐸1
𝑣𝑖 , 𝑣𝑗 = 𝛾 𝐸2
𝑓 𝑣𝑖 , 𝑓(𝑣𝑗 ) for all 𝑣𝑖 , 𝑣𝑗 ∈𝐸1
By definition of complement, we have
𝜇 𝐸1
(𝑣𝑖 , 𝑣𝑗 ) = min[𝜇 (𝑣𝑖 ), 𝜇 (𝑣𝑗 )]
𝑉1 𝑉1
= min[𝜇 (𝑓(𝑣𝑖 )), 𝜇 (𝑓(𝑣𝑗 ))]

𝑉2 𝑉2
Lulu.com, United States 5

=𝜇 (𝑓(𝑣𝑖 ), 𝑓(𝑣𝑗 )),

𝐸2
𝜍 𝐸1
𝑣𝑖 , 𝑣𝑗 = min 𝜍 𝑉1
𝑣𝑖 , 𝜍 𝑉1
𝑣𝑗 ,
= min[𝜍 𝑉2
𝑓 𝑣𝑖 , 𝜍 𝑉2
𝑓 𝑣𝑗 ]
=𝜍 𝐸2
𝛾 𝐸1
𝑣𝑖 , 𝑣𝑗 = max 𝛾 𝑉1
𝑣𝑖 , 𝛾 𝑉1
𝑣𝑗 ,
= max[𝛾 𝑉2
𝑓 𝑣𝑖 , 𝛾 𝑉2
𝑓 𝑣𝑗 ]
=𝛾 𝐸2
𝑓 𝑣𝑖 , 𝑓(𝑣𝑗 ) .
For all 𝑣𝑖 , 𝑣𝑗 ∈ 𝐸1 .Hence 𝐺1 ≈ 𝐺2 . The converse is straight forward.

References :-
1. M.Akram,B.Davvaz, Strong intuitionistic fuzzy graphs, Filomat 26:1 (2012), 177-196.
2. K.T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20 (1986),87-96.
3. F.Harary, Graph Theory, Addition Westley, Third Printing,October 1972.
4. J.N. Mordeson, P.S. Nair, Fuzzy graphs, fuzzy hypergraphs, Physica Verlag,
Heidelberg 1998; Second Edition 2001.
5. Rosenfeld, Fuzzy graphs, Fuzzy sets and their applications (L. A. Zadeh, K.S. Fu, M.
Shimura, Eds.), Academic Press, New York, (1975), 77-95.
6. F. Smarandache, Neutrosophy and Neutrosophic Logic, First International Conference

on Neutrosophy, Neutrosophic Logic, Set, Probability and Statistics University of New
Mexico, Gallup, NM 87301, USA (2002).
7. F. Smarandache, Neutrosophic set, a generalisation of the intuitionistic fuzzy sets, Int.

J. Pure Appl. Math. 24 (2005) 287-297.
8. L.A. Zadeh, Fuzzy sets, Information Control 8 (1965) 338-353.

CHAPTER-2
NEUTROSOPHIC IMPLICATIVE 𝓝-IDEALS IN 𝑲𝑼-ALGEBRAS

D. Ramesh Kumar1, M. Vasu2 and A. Vadivel3
1
Department of Mathematics, Government Arts and Science College, Komarapalayam,
Tamil Nadu, India - 638 183.
Email:durairameshmath@gmail.com
2
Department of Mathematics, Government Arts College for Women,
Sivagangai, Tamil Nadu, India - 630 562.
Email:mvasu1974@gmail.com
3
Department of Mathematics, Government Arts College (Autonomous),
Karur, Tamil Nadu-639 005;
Department of Mathematics, Annamalai University, Annamalainagar,
Tamil Nadu-608 002
Email: avmaths@gmail.com
1. INTRODUCTION :-
Prabpayak and Leerawat [7, 8] introduced another algebraic structure which is called
KU -algebras. They studied ideals and congruences in KU -algebras. Additionally, they
introduced the concept of homomorphism of KU -algebra and examined some related
properties. In addition, they derived some straightforward consequences of the relations
between quotient KU-algebras and isomorphism. In 2014 Mostafa and Kareem [5] introduced
implicative ideals in KU-algebras.
A (crisp) set A in a universe P can be defined in the form of its characteristic function
μA : P → {0,1} yielding the value 1 for elements belonging to the set A and the value 0 for
elements excluded from the set A. So far, most of the generalizations of the crisp set have been
conducted on the unit interval [0,1], and they are consistent with the asymmetry observation.
In other words, the generalization of the crisp set to fuzzy sets relied on spreading positive
information that fit the crisp point {1} into the interval [0,1]. Because no negative meaning of

information is suggested, we now feel a need to deal with negative information. To do so, we
also feel a need to supply a mathematical tool. To attain such an object, Jun et al. [2] introduced
a new function, called a negative-valued function, and constructed 𝒩-structures. Zadeh [14]
introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. As a
generalization of fuzzy sets, Atanassov [1] introduced the degree of nonmembership/falsehood
(f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of
indeterminacy/neutrality (i) as an independent component in 1995 (published in 1999 ) [10]
and defined the neutrosophic set on three components: (t, i, f) = (truth, indeterminacy,
falsehood). For more details, refer to the following site: http://
fs.gallup.unm.edu/FlorentinSmarandache.htm
2. Preliminaries :-
We let K(τ) be the class of all algebras with type τ = (2,0). A KU-algebra [7, 8]
refers to a system P: = (P,∗ ,0) ∈ K(τ) in which the following axioms hold:
(KU1)(l11 ∗ l22 ) ∗ ((l22 ∗ l33 ) ∗ (l11 ∗ l33 )) = 0,
(KU2)l11 ∗ 0 = 0,
(KU3)0 ∗ l11 = l11 ,
(KU4)l11 ∗ l22 = 0 and l22 ∗ l11 = 0 implies l = l22 ,
(KU5)l11 ∗ l11 = 0, for all l11 , l22 , l33 ∈ P.
On a KU-algebra (P,∗ ,0) we can define a binary relation ≤ by putting l11 ≤ l22 ⇔ l22 ∗
l11 = 0, ∀ l11 , l22 ∈ P.
In a KU-algebra P, the following hold:

(KU1‟)(l22 ∗ l33 ) ∗ (l11 ∗ l33 ) ≤ (l11 ∗ l22 ),
(KU2‟)0 ≤ l11 ,
(KU3‟)l11 ≤ l22 , l22 ≤ l11 implies l11 = l22 ,
(KU4‟)l22 ∗ l11 ≤ l11 .
Theorem 2.1:
[4] In a KU-algebra P, the following axioms are satisfied: For all l11 , l22 , l33 ∈ P,
(i)l11 ≤ l22 imply l22 ∗ l33 ≤ l11 ∗ l33 ,

(ii)l11 ∗ (l22 ∗ l33 ) = l22 ∗ (l11 ∗ l33 ), for all l11 , l22 , l33 ∈ P,
(iii)((l22 ∗ l11 ) ∗ l11 ) ≤ l22 ,
(iv)(((l22 ∗ l11 ) ∗ l11 ) ∗ l11 ) = (l22 ∗ l11 ).
A subset I of a KU-algebra P is called an ideal [7, 8] of P if it satisfies the following:

(i)0 ∈ I,
(ii)(∀ l11 , l22 ∈ P)(l22 ∗ l11 ∈ I, l22 ∈ I ⇒ l11 ∈ I).
A KU-algebra P is said to be implicative [9] if it satisfies the following equality:

(∀ l11 , l22 ∈ P)((l11 ∗ l22 ) ∗ l11 = l11 ). (1)
Lemma 2.1:
Every ideal I of a KU-algebra P satisfies the following assertion:
(∀ l11 , l22 ∈ P)(l22 ∈ I, l11 ⪯ l22 ⇒ l11 ∈ I).
A subset I of a KU-algebra P is called a commutative ideal (briefly, c-ideal) [5] of P if it

satisfies (I1) and
(∀ l11 , l22 , l33 ∈ P)(l22 ∗ (l33 ∗ l11 ∈ I, l33 ∈ I ⇒ ((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ∈ I). (2)
A subset I of a KU-algebra P is called a positive implicative ideal (briefly, pi-ideal) [5] of P

if it satisfies (I1) and
(∀ l11 , l22 , l33 ∈ P)(l33 ∗ (l11 ∗ l22 ) ∈ I, l33 ∗ l11 ∈ I ⇒ l33 ∗ l22 ∈ I). (3)
Any pi-ideal is an ideal, but the converse is not true.
Lemma 2.2: [6] A subset I of a KU-algebra P is a pi-ideal of P iff I is an ideal of P

which satisfies the following condition:
(∀ l11 , l22 ∈ P)(l22 ∗ (l22 ∗ l11 ) ∈ I ⇒ l22 ∗ l11 ∈ I). (4)
A subset I of a KU-algebra P is called an implicative ideal (briefly, i-ideal) [5] of P if it
satisfies (I1) and
(∀ l11 , l22 , l33 ∈ P)(((l11 ∗ l22 ) ∗ (l33 ∗ l11 )) ∈ I, l33 ∈ I ⇒ l11 ∈ I). (5)
Lemma 2.3 [5] A subset I of a KU-algebra P is an i-ideal of P iff I is an ideal of P which

satisfies the following condition:

(∀ l11 , l22 ∈ P)((l11 ∗ l22 ) ∗ l11 ∈ I ⇒ l11 ∈ I). (6)
For any family {λj |j ∈ Δ} of real numbers, we define

max{λj |j ∈ Δ} if Δ is finite
∨ {λj |j ∈ Δ}: =
sup{λj |j ∈ Δ} o. w
min{λj |j ∈ Δ} if Δ is finite
∧ {λj |j ∈ Δ}: =
inf{λj |j ∈ Δ} o. w
We mean by ℱ(P, [−1,0]) the collection of functions from a set P to [−1,0]. We say that an
element of ℱ(P, [−1,0]) is a negative-valued function from P to [−1,0] (briefly,
𝒩-function on P). An 𝒩-structure refers to an ordered pair (P, f) of P and an 𝒩-function f
on P ( [2]). In what follows, we let P denote the nonempty universe of discourse unless
otherwise specified.
A 𝒩n (briefly, 𝒩n )-structure over P ([3]) is defined to be the structure:

P l 11
PN : = (𝕋 = |l11 ∈ P , (7)
N ,𝕀N ,𝔽N ) (𝕋N (l 11 ),𝕀N (l 11 ),𝔽N (l 11 ))
where 𝕋N , 𝕀N and 𝔽N are 𝒩 -functions on P , which are called the negative truth
membership function, the negative indeterminacy membership function and the negative
falsity membership function, respectively, on P.
We note that every 𝒩n -structure PN over P satisfies the condition:
(∀ l11 ∈ P)(−3 ≤ 𝕋N (l11 ) + 𝕀N (l11 ) + 𝔽N (l11 ) ≤ 0).
Definition 2.1 : [11] A 𝒩n -structure PN over a KU-algebra P is called a 𝒩n -subalgebra of P

if the following condition is valid:
𝕋N (l11 ∗ l22 ) ≤∨ {𝕋N (l11 ), 𝕋N (l22 )}
(∀ l11 , l22 ∈ P) 𝕀N (l11 ∗ l22 ) ≥∧ {𝕀N (l11 ), 𝕀N (l22 )} . (8)
𝔽N (l11 ∗ l22 ) ≤∨ {𝔽N (l11 ), 𝔽N (l22 )}
Definition 2.2 : [11] A 𝒩n -structure PN over a KU-algebra P is called a 𝒩n -ideal of P if the

following assertion is valid:

𝕋N (0) ≤ 𝕋N (l11 ) ≤∨ {𝕋N (l22 ∗ l11 ), 𝕋N (l22 )}

(∀ l11 , l22 ∈ P) 𝕀N (0) ≥ 𝕀N (l11 ) ≥∧ {𝕀N (l22 ∗ l11 ), 𝕀N (l22 )} . (9)
𝔽N (0) ≤ 𝔽N (l11 ) ≤∨ {𝔽N (l22 ∗ l11 ), 𝔽N (l22 )}
3. Neutrosophic Implicative 𝓝-Ideals :-
In what follows, let P denote a KU-algebra unless otherwise specified.
Definition 3.1 : A 𝒩n -structure PN over P is called a neutrosophic implicative 𝒩

(briefly, 𝒩ni )-ideal of P if the following assertions are valid:
(∀ l11 ∈ P)(𝕋N (0) ≤ 𝕋N (l11 ), 𝕀N (0) ≥ 𝕀N (l11 ), 𝔽N (0) ≤ 𝔽N (l11 )) (10)
𝕋N (l11 ) ≤∨ {𝕋N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋N (l33 )}
(∀ s l11 , l22 , l33 ∈ P) 𝕀N (l11 ) ≥∧ {𝕀N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕀N (l33 )} . (11)
𝔽N (l11 ) ≤∨ {𝔽N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝔽N (l33 )}
Example 3.1 Consider a KU-algebra P = {0, a5 , b5 , c5 } with the following Cayley table.
∗ 0 a5 b5 c5
0 0 a5 b5 c5
a5 0 0 a5 c5
b5 0 0 0 c5
c5 0 a5 b5 0
0 a 5 b 5 c5
The 𝒩n -structure PN = , , ,
(−0.7,−0.1,−0.6) (−0.7,−0.1,−0.6) (−0.7,−0.1,−0.6) (−0.3,−0.6,−0.4)
be a 𝒩n -structure over P. Then PN is a 𝒩ni -ideal of P.
Theorem 3.1:
Every 𝒩ni -ideal is a 𝒩n -ideal. But not conversely.
Proof. :
Let PN be a 𝒩ni -ideal of P. If we put l33 = l22 and l22 = l11 in (11), then
𝕋N (l11 ) ≤∨ {𝕋N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋N (l22 )} =∨ {𝕋N (l22 ∗ l11 ), 𝕋N (l22 )}
𝕀N (l11 ) ≥∧ {𝕀N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕀N (l22 )} =∧ {𝕀N (l22 ∗ l11 ), 𝕀N (l22 )}
𝔽N (l11 ) ≤∨ {𝔽N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝔽N (l22 )} =∨ {𝔽N (l22 ∗ l11 ), 𝔽N (l22 )}
for all l11 , l22 ∈ P by (3) and (5). Hence PN is a 𝒩n -ideal of P.

Example 3.2 : Consider a KU-algebra P = {0, a5 , b5 , c5 , d5 } with the following Cayley

table.
∗ 0 a5 b5 c5 d5
0 0 a5 b5 c5 d5
a5 0 0 a5 a5 b5
b5 0 0 0 a5 a5
c5 0 0 a5 0 b5
d5 0 0 0 0 0
The 𝒩n -structure
0 a5 b5 c5 d5
PN = , , , , . Then PN is a
(−0.7,−0.2,−0.6) (−0.5,−0.3,−0.4) (−0.5,−0.3,−0.4) (−0.3,−0.8,−0.5) (−0.3,−0.8,−0.5)
𝒩n KU-ideal of P but not a 𝒩ni -ideal of P since

𝔽N (a5 ) = −0.4 ≤− 0.5 ∨ 𝔽N ((0 ∗ a5 ) ∗ (c5 ∗ a5 )), 𝔽N (c5 ) .
Theorem 3.2 : If P is an implicative KU-algebra, then every 𝒩n -ideal is a 𝒩ni -ideal.

Proof. Let PN be a 𝒩n -ideal of P. Since P is implicative, we have (l11 ∗ l22 ) ∗ l11 = l11 for
all l11 , l22 ∈ P. It follows from (9) that
𝕋N (l11 ) ≤∨ {𝕋N (l33 ∗ l11 ), 𝕋N (l33 )} =∨ {𝕋N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋N (l33 )}
𝕀N (l11 ) ≥∧ {𝕀N (l33 ∗ l11 ), 𝕀N (l33 )} =∧ {𝕀N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕀N (l33 )}
𝔽N (l11 ) ≤∨ {𝔽N (l33 ∗ l11 ), 𝔽N (l33 )} =∨ {𝔽N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝔽N (l33 )}
for all l11 , l22 , l33 ∈ P. Therefore PN is a 𝒩ni -ideal of P.
Let PN be a 𝒩n -structure over P and let λ, μ, δ ∈ [−1,0] be ∋ −3 ≤ λ + μ + δ ≤ 0.
Consider the following sets:
𝕋λN : = {l11 ∈ P|𝕋N (l11 ) ≤ λ}
μ
𝕀N : = {l11 ∈ P|𝕀N (l11 ) ≥ μ}
𝔽δN : = {l11 ∈ P|𝔽N (l11 ) ≤ δ}
The set
PN (λ, μ, δ): = l11 ∈ P|𝕋N (l11 ) ≤ λ, 𝕀N (l11 ) ≥ μ, 𝔽N (l11 ) ≤ δ
is called the (λ, μ, δ)-level set of PN [11]. Note that
μ
PN (λ, μ, δ) = 𝕋λN ∩ 𝕀N ∩ 𝔽δN
μ
Theorem 3.3 : If PN is a 𝒩ni -ideal of P, then 𝕋λN , 𝕀N and 𝔽δN are i-ideals of P for all
λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0 whenever they are nonempty.
μ
Proof. Assume that 𝕋λN , 𝕀N and 𝔽δN are nonempty for all λ, μ, δ ∈ [−1,0] with −3 ≤ λ +

μ
μ + δ ≤ 0. Then l11 ∈ 𝕋λN , l22 ∈ 𝕀N and l33 ∈ 𝔽δN for some l11 , l22 , l33 ∈ P. Thus 𝕋N (0) ≤
μ
𝕋N (l11 ) ≤ λ, 𝕀N (0) ≥ 𝕀N (l22 ) ≥ μ , and 𝔽N (0) ≤ 𝔽N (l33 ) ≤ δ , that is, 0 ∈ 𝕋λN ∩ 𝕀N ∩ 𝔽δN .
Let (l11 ∗ l22 ) ∗ (l33 ∗ l11 ) ∈ 𝕋λN and l33 ∈ 𝕋λN . Then 𝕋N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )) ≤ λ and
𝕋N (l33 ) ≤ λ, which imply that
𝕋N (l11 ) ≤∨ {𝕋N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋N (l33 )} ≤ λ
μ μ
that is, l11 ∈ 𝕋λN . If (a5 ∗ b5 ) ∗ (c5 ∗ a5 ) ∈ 𝕀N and c5 ∈ 𝕀N , then 𝕀N ((a5 ∗ b5 ) ∗ (c5 ∗ a5 )) ≥
μ and 𝕀N (c5 ) ≥ μ. Thus
𝕀N (a5 ) ≥∧ {𝕀N ((a5 ∗ b5 ) ∗ (c5 ∗ a5 )), 𝕀N (c5 )} ≥ μ
μ
and so a5 ∈ 𝕀N . Finally, suppose that (u ∗ v) ∗ (w ∗ u) ∈ 𝔽δN and w ∈ 𝔽δN . Then 𝔽N ((u ∗
v) ∗ (w ∗ u)) ≤ δ and 𝔽N (w) ≤ δ. Thus
𝔽N (u) ≤∨ {𝔽N ((u ∗ v) ∗ (w ∗ u)), 𝔽N (w)} ≤ δ
μ
that is, u ∈ 𝔽δN .Therefore 𝕋λN , 𝕀N and 𝔽δN are i-ideals of P.
Corollary 3.1 : Let PN be a 𝒩n -structure over P and let λ, μ, δ ∈ [−1,0] be ∋ −3 ≤ λ +

μ + δ ≤ 0. If PN is a 𝒩ni -ideal of P, then the nonempty (λ, μ, δ)-level set of PN is an i-ideal
of P.
Lemma 3.1 : [11] Every 𝒩n -ideal PN of P satisfies the following assertion:

(l11 , l22 ∈ P)(l11 ⪯ l22 ⇒ 𝕋N (l11 )) ≤ 𝕋N (l22 ), 𝕀N (l11 ) ≥ 𝕀N (l22 ), 𝔽N (l11 ) ≤ 𝔽N (l22 )) (12)
Theorem 3.4 : For a 𝒩n -ideal PN of P, the following assertions are equivalent:

(i)PN is a 𝒩ni -ideal of P.
(ii)PN satisfies the following assertion:
𝕋N (l11 ) ≤ 𝕋N ((l11 ∗ l22 ) ∗ l11 )
(∀ l11 , l22 ∈ P) 𝕀N (l11 ) ≥ 𝕀N ((l11 ∗ l22 ) ∗ l11 ) . (13)
𝔽N (l11 ) ≤ 𝔽N ((l11 ∗ l22 ) ∗ l11 )
(iii)PN satisfies the following equalities:
𝕋N (l11 ) = 𝕋N ((l11 ∗ l22 ) ∗ l11 )
(∀ l11 , l22 ∈ P) 𝕀N (l11 ) = 𝕀N ((l11 ∗ l22 ) ∗ l11 ) . (14)
𝔽N (l11 ) = 𝔽N ((l11 ∗ l22 ) ∗ l11 )
Proof. Assume that PN is a 𝒩ni -ideal of P. Taking l33 = 0 in (11) and using (KU3) and (10)
induce the condition (13).
Let PN be a 𝒩n -ideal of P that satisfies the condition (13). Since (l11 ∗ l22 ) ∗ l11 ⪯

l11 for all l11 , l22 ∈ P, it follows from Lemma 3.1 that
𝕋N (l11 ) ≥ 𝕋N ((l11 ∗ l22 ) ∗ l11 )
(∀ l11 , l22 ∈ P) 𝕀N (l11 ) ≤ 𝕀N ((l11 ∗ l22 ) ∗ l11 ) .
𝔽N (l11 ) ≥ 𝔽N ((l11 ∗ l22 ) ∗ l11 )
Hence (14) is valid.
Let PN be a 𝒩n -ideal of P that satisfies the condition (14). Then
𝕋N (l11 ) = 𝕋N ((l11 ∗ l22 ) ∗ l11 ) ≤∨ {𝕋N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋N (l33 )}
𝕀N (l11 ) = 𝕀N ((l11 ∗ l22 ) ∗ l11 ) ≥∧ {𝕀N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕀N (l33 )}
𝔽N (l11 ) = 𝔽N ((l11 ∗ l22 ) ∗ l11 ) ≤∨ {𝔽N ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝔽N (l33 )}
for all l11 , l22 , l33 ∈ P by (14) and (9). Therefore PN is a 𝒩ni -ideal of P.
μ
Lemma 3.2 : [11] Let PN be a 𝒩n -structure over P and assume that 𝕋λN , 𝕀N and 𝔽δN are
ideals of P for all λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0 Then PN is a 𝒩n -ideal of P.
μ
Theorem 3.5 : Let PN be a 𝒩n -structure over P and assume that 𝕋λN , 𝕀N and 𝔽δN are
i-ideals of P for all λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0. Then PN is a 𝒩ni -ideal of P.
μ
Proof. If 𝕋λN , 𝕀N and 𝔽δN are i-ideals of P, then they are ideals of P. Hence PN is a 𝒩n -ideal
of P by Lemma 3.2. Let l11 , l22 ∈ P and λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0 such
that 𝕋N ((l11 ∗ l22 ) ∗ l11 ) = λ, 𝕀N ((l11 ∗ l22 ) ∗ l11 ) = μ and 𝔽N ((l11 ∗ l22 ) ∗ l11 ) = δ . Then
μ μ
((l11 ∗ l22 ) ∗ l11 ) ∈ 𝕋λN ∩ 𝕀N ∩ 𝔽δN . Since 𝕋λN ∩ 𝕀N ∩ 𝔽δN is an i-ideal of P, it follows from
μ
Lemma 2.3 that l11 ∈ 𝕋λN ∩ 𝕀N ∩ 𝔽δN . Hence
𝕋N (l11 ) ≤ λ = 𝕋N ((l11 ∗ l22 ) ∗ l11 ),
𝕀N (l11 ) ≥ μ = 𝕀N ((l11 ∗ l22 ) ∗ l11 ),
𝔽N (l11 ) ≤ δ = 𝔽N ((l11 ∗ l22 ) ∗ l11 ).
Therefore, PN is a 𝒩ni -ideal of P by Theorem 3.4.
For any fixed numbers ξT , ξF ∈ [−1,0), ξI ∈ (−1,0] and a nonempty subset G of P,
we define a 𝒩n -structure PNG over P by the structure
P l 11
PNG : = (𝕋G ,𝕀G ,𝔽G ) = |l11 ∈ P (15)
N N N (𝕋GN (l 11 ),𝕀GN (l 11 ),𝔽GN (l 11 ))
where 𝕋GN , 𝕀GN and 𝔽GN are 𝒩-functions on P which are given as follows:
ξT ifl11 ∈ G
𝕋GN : P → [−1,0], l11 ↦
0 o. w
ξI ifl11 ∈ G
𝕀GN : P → [−1,0], l11 ↦
−1 o. w
and

ξF ifl11 ∈ G
𝔽GN : P → [−1,0], l11 ↦
0 o. w
ξT ξI ξF
Suppose that PNG is a 𝒩ni -ideal of P. Then (𝕋GN ) 2 = G, (𝕀GN ) 2 = G and (𝔽GN ) 2 = G are
i-ideals of P by Theorem 3.3, and so G is an i-ideal of P. Now assume that G is an i-ideal of
P . Then 0 ∈ G , and so 𝕋GN (0) = ξT ≤ 𝕋GN (l11 ), 𝕀GN (0) = ξI ≥ 𝕀GN (l11 ) , and 𝔽GN (0) = ξF ≤
𝔽GN (l11 ) for all l11 ∈ P. For any l11 , l22 , l33 ∈ P, we consider four cases:
Case 1.(l11 ∗ l22 ) ∗ (l33 ∗ l11 ) ∈ G and l33 ∈ G,
Case 2.(l11 ∗ l22 ) ∗ (l33 ∗ l11 ) ∈ G and l33 ∉ G,
Case 3.(l11 ∗ l22 ) ∗ (l33 ∗ l11 ) ∉ G and l33 ∈ G,
Case 4.(l11 ∗ l22 ) ∗ (l33 ∗ l11 ) ∉ G and l33 ∉ G.
Case 1 implies that l11 ∈ G, and thus
𝕋GN (l11 ) = 𝕋GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )) = 𝕋GN (l33 ) = ξT ,
𝕀GN (l11 ) = 𝕀GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )) = 𝕀GN (l33 ) = ξI ,
𝔽GN (l11 ) = 𝔽GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )) = 𝔽GN (l33 ) = ξF .
Hence
𝕋GN (l11 ) ≤∨ {𝕋GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋GN (l33 )},
𝕀GN (l11 ) ≥∧ {𝕀GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕀GN (l33 )},
𝔽GN (l11 ) ≤∨ {𝔽GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝔽GN (l33 )}.
If case 2 is valid, then 𝕋GN (l33 ) = 0, 𝕀GN (l33 ) = −1 and 𝔽GN (l33 ) = 0. Thus
𝕋GN (l11 ) ≤ 0 =∨ {𝕋GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋GN (l33 )},
𝕀GN (l11 ) ≥ −1 =∧ {𝕀GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕀GN (l33 )},
𝔽GN (l11 ) ≤ 0 =∨ {𝔽GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝔽GN (l33 )}.
For the Case 3, it is similar to the Case 2. For the Case 4, it is clear that
𝕋GN (l11 ) ≤∨ {𝕋GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕋GN (l33 )},
𝕀GN (l11 ) ≥∧ {𝕀GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝕀GN (l33 )},
𝔽GN (l11 ) ≤∨ {𝔽GN ((l11 ∗ l22 ) ∗ (l33 ∗ l11 )), 𝔽GN (l33 )}.
Hence PNG is a 𝒩ni -ideal of P. Therefore, we have the following theorem.
Theorem 3.6 : Given a nonempty subset G of P, a 𝒩n -structure PNG over P is a 𝒩ni -ideal
of P iff G is an i-ideal of P.
Lemma 3.3 : [6] Let A and B be ideals of P ∋ A ⊆ B. If A is an i-ideal of P, then so is B.

We define a relation (=, ≤, =) between two 𝒩n -structures PN and PM over P as

follows:
𝕋N (l11 ) = 𝕋M (l11 )
PN (=, ≤, =)PM ⇔ (∀ l11 ∈ P) 𝕀N (l11 ) ≤ 𝕀M (l11 ) . (16)
𝔽N (l11 ) = 𝔽M (l11 )
Let
P l 11
PN : = (𝕋 = |l11 ∈ P
N ,𝕀N ,𝔽N ) (𝕋N (l 11 ),𝕀N (l 11 ),𝔽N (l 11 ))
and
P l 11
PM : = (𝕋 = |l11 ∈ P
M ,𝕀M ,𝔽M ) (𝕋M (l 11 ),𝕀M (l 11 ),𝔽M (l 11 ))
be 𝒩n -ideals of P such that PN (=, ≤, =)PM , and assume that PN is a 𝒩ni -ideal of P. Then
μ
𝕋λN , 𝕀N and 𝔽δN are i-ideals of P∀λ, μ, δ ∈ [−1,0] by Theorem 3.3. The condition PN (=, ≤, =
μ μ μ
)PM implies that 𝕋λN = 𝕋λM , 𝕀N ⊆ 𝕀M and 𝔽δN = 𝔽δM . It follows from Lemma 3.3 that 𝕋λM , 𝕀M
and 𝔽δM are i-ideals of P∀λ, μ, δ ∈ [−1,0]. Therefore, PM is a 𝒩ni -ideal of P by Theorem
3.5. Hence we have the following theorem.
P l 11
Theorem 3.7 : Let PN : = (𝕋 = |l11 ∈ P
N ,𝕀N ,𝔽N ) (𝕋N (l 11 ),𝕀N (l 11 ),𝔽N (l 11 ))
P l 11
and PM : = (𝕋 = |l11 ∈ P
M ,𝕀M ,𝔽M ) (𝕋M (l 11 ),𝕀M (l 11 ),𝔽M (l 11 ))
be 𝒩n -ideals of P such that PN (=, ≤, =)PM . If PN is a 𝒩ni -ideal of P, then so is PM .

We characterize implicative KU-algebra by using 𝒩ni -ideal.
Lemma 3.4 : [6] A KU-algebra P is implicative iff every ideal of P is an i-ideal of P.
Theorem 3.8 : A KU-algebra P is implicative iff every neutrosophic 𝒩-ideal of P is a

𝒩ni -ideal of P.
Proof. Assume that P is an implicative KU-algebra. Then every ideal is implicative by
μ
Lemma 3.4 . Let PN be a 𝒩n -ideal of P . Then 𝕋λN , 𝕀N and 𝔽δN are ideals of P for all
μ
λ, μ, δ ∈ [−1,0] [11], and so 𝕋λN , 𝕀N and 𝔽δN are i-ideals of P for all λ, μ, δ ∈ [−1,0]. It
follows from Theorem 3.5 that PN is a 𝒩ni -ideal of P.
Conversely, let P be a KU-algebra in which every 𝒩n -ideal is a 𝒩ni -ideal. For any
ideal A of P, define a 𝒩n -structure PN over P by

1
− if l11 ∈ A
𝕋N : P → [−1,0], p ↦ 2
0 o. w
1
−2 if l11 ∈ A
𝕀N : P → [−1,0], p ↦
−1 o. w
and
1
−2 if l11 ∈ A
𝔽N : P → [−1,0], p ↦
0 o. w
It is easy to see that PN is a 𝒩n -ideal of P. By hypothesis, PN is a 𝒩ni -ideal of P. Hence
1 1 1
− − −
𝕋N 2 = A, JN 2 = A and 𝔽N 2 = A are i -ideals of P by Theorem 3.3. Therefore, P is an
implicative KU algebra by Lemma 3.4.
We consider relations between 𝒩ni -ideal and neutrosophic positive implicative

𝒩-ideal.
Definition 3.2 : [12] A 𝒩n -structure PN over P is called a neutrosophic positive implicative

𝒩 (briefly, 𝒩npi )-ideal of P if it satisfies (10) and
𝕋N (l33 ∗ l22 ) ≤∨ {𝕋N (l33 ∗ (l11 ∗ l22 )), 𝕋N (l33 ∗ l11 )}
(∀ l11 , l22 , l33 ∈ P) 𝕀N (l33 ∗ l22 ) ≥∧ {𝕀N (l33 ∗ (l11 ∗ l22 )), 𝕀N (l33 ∗ l11 )} . (17)
𝔽N (l33 ∗ l22 ) ≤∨ {𝔽N (l33 ∗ (l11 ∗ l22 )), 𝔽N (l33 ∗ l11 )}
Note that every 𝒩npi -ideal is a 𝒩n -ideal, but the converse is false [12].
μ
Lemma 3.5 : [12] Let PN be a 𝒩n -structure over P and assume that 𝕋λN , 𝕀N and 𝔽δN are
pi-ideals of P for all λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0. Then PN is a 𝒩npi -ideal of
P.
Theorem 3.9 : Every 𝒩ni -ideal is a 𝒩npi -ideal. But not conversely.
μ
Proof. Let PN be a 𝒩ni -ideal of P. Then 𝕋λN , 𝕀N and 𝔽δN are i-ideals and hence ideals of P
for all λ, μ, δ ∈ [−1,0]. Let l11 , l22 , l33 ∈ P be such that l33 ∗ (l11 ∗ l22 ) ∈ 𝕋λN and l33 ∗ l11 ∈
𝕋λN . Since
(l33 ∗ l11 ) ∗ (l33 ∗ (l33 ∗ l22 )) ⪯ l11 ∗ (l33 ∗ l22 ) = l33 ∗ (l11 ∗ l22 )

we have (l33 ∗ l11 ) ∗ (l33 ∗ (l33 ∗ l22 )) ∈ 𝕋λN by Lemma 2.1. It follows from (I2) that
l33 ∗ (l33 ∗ l22 ) ∈ 𝕋λN . Since (l33 ∗ l22 ) ∗ (l33 ∗ (l33 ∗ l22 )) ⪯ l33 ∗ (l33 ∗ l22 ) for all l11 , l33 ∈
P, we get (l33 ∗ l22 ) ∗ (l33 ∗ (l33 ∗ l22 )) ∈ 𝕋λN by Lemma 2.1, which implies from Lemma 2.3
μ
that l33 ∗ l22 ∈ 𝕋λN . Hence 𝕋λN is a pi-ideal of P. Similarly, we can prove that 𝕀N and 𝔽δN are
pi-ideals of P. Therefore, PN is a 𝒩npi -ideal of P by Lemma 3.5.
Example 3.3 : Consider a KU-algebra P = {0,1,2,3,4} with the following Cayley table.
∗ 0 1 2 3 4
0 0 1 2 3 4
1 0 0 1 3 4
2 0 0 0 3 4
3 0 0 0 0 4
4 0 0 0 0 0
The 𝒩n -structure
0 1 2 3 4
PN = { , , , , }. Then
(−0.7,−0.2,−0.6) (−0.5,−0.3,−0.4) (−0.5,−0.3,−0.4) (−0.3,−0.8,−0.5) (−0.3,−0.8,−0.5)
PN is a 𝒩npi -ideal of P but not a 𝒩ni -ideal of P since 𝔽N (1) = −0.4 ≤− 0.5 =∨ {𝔽N ((1 ∗
0) ∗ (3 ∗ 1)), 𝔽N (3)}.
Proposition 3.1 : Every 𝒩ni -ideal PN of P satisfies the condition.

𝕋N ((l11 ∗ l22 ) ∗ l11 ) ≤ 𝕋N ((l22 ∗ l11 ) ∗ l22 )
(∀ l11 , l22 ∈ P) 𝕀N ((l11 ∗ l22 ) ∗ l11 ) ≥ 𝕀N ((l22 ∗ l11 ) ∗ l22 ) . (18)
𝔽N ((l11 ∗ l22 ) ∗ l11 ) ≤ 𝔽N ((l22 ∗ l11 ) ∗ l22 )
Proof. Assume that PN is a 𝒩ni -ideal of P. Then PN is a 𝒩npi -ideal of P by Theorem 3.9,
and hence PN is a 𝒩n -ideal of P. Since (l11 ∗ l22 ) ∗ l11 ⪯ l11 for all l11 , l22 ∈ P, we have
l11 ∗ l22 ⪯ ((l11 ∗ l22 ) ∗ l11 ) ∗ l22 and so
(((l11 ∗ l22 ) ∗ l11 ) ∗ l22 ) ∗ ((l22 ∗ l11 ) ∗ l11 ) ⪯ (l11 ∗ l22 ) ∗ ((l22 ∗ l11 ) ∗ l11 )
⪯ (l22 ∗ l11 ) ∗ l22
by Theorem 2.1 and (1). It follows from (11), (3), Lemma 3.1 and (10) that
𝕋N ((l11 ∗ l22 ) ∗ l11 ) ≤∨ {𝕋N ((0 ∗ ((l11 ∗ l22 ) ∗ l11 ) ∗ l22 ) ∗ ((l22 ∗ l11 ) ∗ l11 ), 𝕋N (0)}
=∨ {𝕋N ((((l11 ∗ l22 ) ∗ l11 ) ∗ l22 ) ∗ ((y ∗ l11 ) ∗ l11 )), 𝕋N (0)}
≤∨ {𝕋N ((l22 ∗ l11 ) ∗ l22 ), 𝕋N (0)}
= 𝕋N ((l22 ∗ l11 ) ∗ l22 )
for all l11 , l22 , l33 ∈ P. Similarly, we can prove that 𝕀N (l11 ∗ (l11 ∗ l22 )) ≥ 𝕀N (l22 ∗
(l22 ∗ l11 )) and 𝔽N (l11 ∗ (l11 ∗ l22 )) ≤ 𝔽N (l22 ∗ (l22 ∗ l11 )) for all l11 , l22 , l33 ∈ P.
Definition 3.3 : A 𝒩n -structure PN over P is called a neutrosophic commutative 𝒩-ideal

(briefly, 𝒩nc -ideal) [13] of P if it satisfies ( 10) and
𝕋N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≤∨ {𝕋N (l22 ∗ (l33 ∗ l11 )), 𝕋N (l33 )}
(∀ l11 , l22 , l33 ∈ P) 𝕀N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≥∧ {𝕀N (l22 ∗ (l33 ∗ l11 )), 𝕀N (l33 )} . (19)
𝔽N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≤∨ {𝔽N (l22 ∗ (l33 ∗ l11 )), 𝔽N (l33 )}.
Lemma 3.6 : [13] Let PN be a 𝒩n -ideal of P. Then PN is a 𝒩nc -ideal of P iff the following
assertion is valid:
𝕋N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≤ 𝕋N (l22 ∗ l11 )
(∀ l11 , l22 ∈ P) 𝕀N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≥ 𝕀N (l22 ∗ l11 ) .
𝔽N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≤ 𝔽N (l22 ∗ l11 )
Observing l22 ∗ l11 ⪯ ((l11 ∗ l22 ) ∗ l22 ) ∗ l11 and using Lemma 3.1, we have
𝕋N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≥ 𝕋N (l22 ∗ l11 )
(∀ l11 , l22 ∈ P) 𝕀N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≤ 𝕀N (l22 ∗ l11 ) .
𝔽N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ≥ 𝔽N (l22 ∗ l11 )
Hence Lemma 3.6 can be improved as follows.
Theorem 3.10 : Let PN be a 𝒩n -ideal of P. Then PN is a 𝒩nc -ideal of P iff the following
assertion is valid:
𝕋N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) = 𝕋N (l22 ∗ l11 )
(∀ l11 , l22 ∈ P) 𝕀N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) = 𝕀N (l22 ∗ l11 ) .
𝔽N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) = 𝔽N (l22 ∗ l11 )
Theorem 3.11 : Every 𝒩ni -ideal is a 𝒩nc -ideal.

Proof. Let PN be a 𝒩ni -ideal of P. Then PN is a 𝒩n -ideal of P. Note that
((((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ∗ l22 ) ∗ ((l11 ∗ l22 ) ∗ l22 ) ⪯ l22 ∗ l11 (20)
for all l11 , l22 ∈ P. It follows from ( 14 ) and Lemma 3.1 that
𝕋N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) = 𝕋N ((((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ∗ l22 ) ∗ ((l11 ∗ l22 ) ∗ l22 )
≤ 𝕋N (l22 ∗ l11 ),
𝕀N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) = 𝕀N ((((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ∗ l22 ) ∗ ((l11 ∗ l22 ) ∗ l22 ) ≥

𝕀N (l22 ∗ l11 ),
and
𝔽N (((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) = 𝔽N ((((l11 ∗ l22 ) ∗ l22 ) ∗ l11 ) ∗ l22 ) ∗ ((l11 ∗ l22 ) ∗
l22 ) ≤ 𝔽N (l22 ∗ l11 ),
for all l11 , l22 ∈ P. Therefore PN is a 𝒩nc -ideal of P by Lemma 3.6.
Lemma 3.7 : [11] For any 𝒩n -ideal PN of P, we have

𝕋N (l11 ) ≤∨ {𝕋N (l22 ), 𝕋N (l33 )},
(∀ l11 , l22 , l33 ∈ P)(l22 ∗ l11 ⪯ n ⇒ 𝕀N (l11 ) ≥∧ {𝕀N (l22 ), 𝕀N (l33 )}, . (21)
𝔽N (l11 ) ≤∨ {𝔽N (l22 ), 𝔽N (l33 )}
Lemma 3.8 : [12] Let PN be a 𝒩n -ideal of P . Then PN is a 𝒩npi -ideal of P iff the
following assertion is valid:
𝕋N (l33 ∗ l22 ) ≤ 𝕋N (l33 ∗ (l33 ∗ l22 )),
(∀ l11 , l22 ∈ P) 𝕀N (l33 ∗ l22 ) ≥ 𝕀N (l33 ∗ (l33 ∗ l22 )), . (22)
𝔽N (l33 ∗ l22 ) ≤ 𝔽N (l33 ∗ (l33 ∗ l22 ))
Let PN be a 𝒩n -ideal of P. Since l33 ∗ (l33 ∗ l22 ) ⪯ l33 ∗ l22 for all l11 , l22 ∈ P it follows
from Lemma 3.1 that
𝕋N (l33 ∗ l22 ) ≥ 𝕋N (l33 ∗ (l33 ∗ l22 )),
(∀ l11 , l22 ∈ P) 𝕀N (l33 ∗ l22 ) ≤ 𝕀N (l33 ∗ (l33 ∗ l22 )), .
𝔽N (l33 ∗ l22 ) ≥ 𝔽N (l33 ∗ (l33 ∗ l22 ))
Hence we have.
Theorem 3.12 : Let PN be a 𝒩n -ideal of P. Then PN is a 𝒩npi -ideal of P iff the following
assertion is valid:
𝕋N (l33 ∗ l22 ) = 𝕋N (l33 ∗ (l33 ∗ l22 )),
(∀ l11 , l22 ∈ P) 𝕀N (l33 ∗ l22 ) = 𝕀N (l33 ∗ (l33 ∗ l22 )), . (23)
𝔽N (l33 ∗ l22 ) = 𝔽N (l33 ∗ (l33 ∗ l22 ))

References :-
1. K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20 (1986), 87-96.
2. Y. B. Jun, K. J. Lee and S. Z. Song, 𝒩-ideals of BCK/BCI-algebras, J. Chungcheong
Math. Soc., 22 (2009) 417-437.
3. M. Khan, S. Amis, F. Smarandache and Y. B. Jun, Neutrosophic 𝒩-structures and
their applications in semigroups, Ann. Fuzzy Math. Inform., 14 (6) (2017) 583-598.
4. S. M. Mostafa, M. A. Abd-Elnaby and M. M. M. Yousef, Fuzzy ideals of
KU-algebras, International Math Forum., 6 (63) (2011) 3139-3149.
5. S. M. Mostafa and F. F. Kareem, N-fold Commutative KU-algebras, International
Journal of Algebra, 8 (6) (2014) 267-275.
6. S. M. Mostafa, R. A. K. Omar and O. W. Abd El-Baseer, Sub i -ideals of
KU-algebras, International Journal of Modern Science and Technology, 2 (5) (2017)
223-227.
7. C. Prabpayak and U. Leerawat, On ideals and congruence in KU-algebras, Scientia
Magna Journal, 5 (1) (2009) 54-57.
8. C. Prabpayak and U. Leerawat, On isomorphisms of KU-algebras, Scientia Magna
Journal, 5 (3) (2009) 25-31.
9. E. Radwan, S. M. Mostafa, F. A. Ibrahem and F. F. Kareem, Topology spectrum of a
KU-algebra, Journal of New Theory, 8 (2015) 78-91.
10. F. Smarandache, A Unifying field in logics: neutrosophic logic. neutrosophy,
neutrosophic set, neutrosophic probability, American Research Press, Rehoboth, NM,
USA, (1999).
11. M. Vasu and D. Ramesh Kumar, Neutrosophic 𝒩-structures applied to KU-algebras,
submitted.
12. M. Vasu and D. Ramesh Kumar, Neutrosophic positive Implicative 𝒩 -ideals in
KU-algebras, submitted.
13. M. Vasu and D. Ramesh Kumar, Neutrosophic commutative 𝒩 -ideals in
KU-algebras, submitted.
14. L. A. Zadeh, Fuzzy sets, Information and Control, 8 (1965), 338-353.

CHAPTER-3
NEUTROSOPHIC Z- SUBALGEBRA
1
P.Muralikrishna&2P.Hemavathi
1
PG & Research Department of Mathematics,
Muthurangam Govt Arts College(Autonomous), Vellore.
2
DepartmentofMathematics,
SaveethaSchoolofEngineering,SIMATS,
Thandalam-602105.India.
E-mail: 1pmkrishna@rocketmail.com,2 hemavathip@saveethal.com
Abstract :-
This chapter presents the notion of Neutrosophic set in 𝒁 – algebra, and
introduces some basic concepts of Neutrosophic 𝒁 – subalgebra. Homomorphic
image and inverse image of Neutrosophic 𝒁 – subalgebra have been provided.
Further, the Cartesian product of Neutrosophic𝒁 – subalgebra is studied.
Keywords: Neutrosophic set; z–subalgebra;Neutrosophicz–algebra.
1. Introduction :-
The concept of fuzzy sets has been initiated by Zadeh[10]which is applied in

numerous scientific areas. Iseki et al. [2,3] made an introduction to the theory of
BCK-algebras. Further the author described some novel properties of BCI algebras are wider
class than BCK-algebras. Neggerset al. [7] investigated the characteristics of B-algebras
which is related to various class of algebras such as BCH/BCI/BCK-algebras.
Neutrosophicsubalgebras of several types in BCK/BCI-algebras has been studied by Jun et
al. [4,5]. Moreover, neutrosophic N-structures applied to BCK/BCI-algebras and few of its
properties were discussed. BMBJ – Neutrosophic ideals in BCK/BCI – algebras have
been proposed by MohseniTakallo et al.[6] in which some fascinating results are provided.

Chandramouleeswaran et al. [1] presented a note on z-algebras and established some sub
structures which are related to z-algebra. MBJ – Neutrosophic Structures and its applications
in BCK/BCI – algebra was proposed by Takallo et al. [9]. Surya Manokaran et al. [8]
introduced the concept of MBJ-Neutrosophic𝛽 −subalgebra in which the homomorphic and
inverse image, cartesian product of MBJ-neutrosophic𝛽 −subalgebra have been discussed.
With all the above inspiration, this chapter deals the characteristics of neutrosophic z-algebra
and provides the related results.
2. Preliminaries :-
In this section some basic definitions which are required are recalled in
the sequel.
Definition 2.1 :
A BCK-algebra (X,*,0) is a non-empty set X with constant 0 and a binary
operation * by satisfying the following conditions:
1. ((x*y) *(x*z)) *(z*y) =0
2. 0*x=0
3. x*x=0
4. (x(x*y))*y=0
5. x*y=0 and y*x=0 imply x=y, ∀𝒙, 𝒚 ∈ 𝑿.
Definition 2.2 :
A Q-algebra (X,*,0) os a nonempty set X with constant ) and a binary operation
* by satisfying the following conditions:
1. x*0=x
2. x*x=0
3. (x*y)*z=(x*z)*y, ∀𝒙, 𝒚 ∈ 𝑿.
Definition 2.3 :
A BH-algebra (X,*,0) is a non-empty set X with constant ) and a binary
operation * satisfying the following conditions:
1. x*0=x
2. x*x=0

3. x*y=0 and y*x=0 implies x=y ∀𝒙, 𝒚 ∈ 𝑿.
Definition 2.4 :
A TM-algebra (X,*,0) is a non-empty set X with constant ) and a binary
operation * satisfying the following conditions:
1. x*0=x
2. (x*y)*(x*z))=z*y, ∀𝒙, 𝒚, 𝒛 ∈ 𝑿.
Definition 2.5 :
A SU-algebra (X,*,0) is a nonempty set X with constant 0 and a binary
operation * satisfying conditions:
1. (x*y)*(x*z))*(y*z)=0
2. x*0=x
3. if if x*y=0 ⇒ x=y, ∀𝒙, 𝒚, 𝒛 ∈ 𝑿.
Definition 2.6 :
A Z-algebra (X,*,0) is a non-empty set X with constant 0 and a binary operation
* satisfying the following conditions:
1. x*0=0
2. 0*x=x
3. x*x=x
4. x*y=y*x, when x≠0 and y≠0 ∀𝒙, 𝒚, 𝒛 ∈ 𝑿.
Example 2.7 :
Let X={0,1,2,3 } be a set with constant ) and a binary operation * is defined on
X by the Cayley’s table as follows.
* 0 1 2 3
0 0 1 2 3
1 0 1 1 2
2 0 1 2 1
3 0 2 1 3
Then (X,*,0) is a Z-algebra.

Definition 2.8 :
Let S be a non-empty subset of s Z-algebra of X. Then, S is called a Z-algebra
of X, if x*y ∈ S, ∀𝒙, 𝒚 ∈ 𝑺.
Example 2.9 :
Consider the Z-algebra in Example 2.7. Then the subsets A={1,2} ⊂ X is a Z-

subalgebra of X, but the subset C={3,2} ⊂ X is not a Z-subalgebra of X.
Definition 2.10 :
An Neutrosophic fuzzy set 𝑨 on 𝑿 is defined by
𝑨 = { < 𝑥, 𝑨𝑻 (𝒙) , 𝑨𝑰 (𝒙) , 𝑨𝑭 (𝒙) >∕ 𝑥 ∈ 𝑋} , where 𝑨𝑻 ∶ 𝑿 → 𝟎, 𝟏 is a truth
membership function, 𝑨𝑰 ∶ 𝑿 → 𝟎, 𝟏 is an indeterminate membership function and
𝑨𝑭 ∶ 𝑿 → 𝟎, 𝟏 is a false membership function.
Definition 2.11:
The supremum property of the fuzzy set 𝝁 for the subset 𝑻 in 𝑿 is defined
as 𝝁 𝒙𝟎 = 𝒔𝒖𝒑𝒙 ∈𝑻 𝝁(𝒙) , if there exists 𝒙, 𝒙𝟎 ∈ 𝑻.
Definition 2.12:
An MBJ – Neutrosophicfuzzy set 𝑨 in any set 𝑿 is said to have the
𝒔𝒖𝒑 − 𝒓𝒔𝒖𝒑 − 𝒊𝒏𝒇 property if for subset 𝑻 of 𝑿 there exists 𝒙𝟎 ∈ 𝑻 such that
𝑴𝑨 𝒙𝟎 = 𝒔𝒖𝒑𝒙 ∈𝑻 𝑴𝑨 (𝒙) , 𝑩𝑨 𝒙𝟎 = 𝒓𝒔𝒖𝒑𝒙 ∈𝑻 𝑩𝑨 (𝒙) and 𝑱𝑨 𝒙𝟎 =
𝒊𝒏𝒇𝒙 ∈𝑻 𝑱𝑨 𝒙 respectively.
3. NeutrosophicZ– Subalgebra
This division frames the structure of NeutrosophicZ – subalgebra ofZ – algebra
and some relevant results are discussed.
Definition 3.1 :
Let Χ be a Z – algebra. An Neutrosophic set 𝚵 = (𝕋𝚵 , 𝕀𝚵 , 𝔽𝚵 ) in Χ is called an
Neutrosophic Z– subalgebra of Χ if it satisfies:𝒙, 𝒚 ∈ 𝑿
(i)𝕋𝚵 𝑥⨂𝑦 ≥ min( 𝕋𝚵 𝑥 , 𝕋𝚵 𝑦 );

(ii)𝕀𝚵 𝑥⨂𝑦 ≥ min( 𝕀𝚵 𝑥 , 𝕀𝚵 𝑦 );

(iii)𝔽𝚵 𝑥⨂𝑦 ≤ max (𝔽𝚵 𝑥 , 𝔽𝚵 𝑦 )
Example 3.2 :
Consider a Z- algebra𝑿 = 𝟎, 𝟏, 𝟐, 𝟑 ,∗ by the following cayley’s table
* 0 1 2 3
0 0 1 2 3
1 0 1 1 2
2 0 1 2 1
3 0 2 1 3
and the Neutrosophic set on 𝑿 is defined by

𝟎. 𝟓 , 𝑥 = 𝟎, 𝟑 𝟎. 𝟔 , 𝑥 = 𝟎, 𝟑
𝕋𝚵 (𝒙) = 𝕀𝚵 (𝒙) =
𝟎. 𝟒 , 𝑥 = 𝟏, 𝟐 𝟎. 𝟓 , 𝑥 = 𝟏, 𝟐
𝟎. 𝟑 , 𝑥 = 𝟎, 𝟑
𝔽𝚵 𝒙 =
𝟎. 𝟏 , 𝑥 = 𝟏, 𝟐
Thus, 𝑨 satisfy the terms to be an NeutrosophicZ - subalgebra of 𝑿.
Theorem 3.3 :
If𝑨𝟏 and 𝑨𝟐 are two NeutrosophicZ-subalgebrasof 𝑿, then
𝑨𝟏 ∩ 𝑨𝟐 is an NeutrosophicZ - subalgebra of 𝑿.
Proof:
Let 𝑨𝟏 and 𝑨𝟐 be two Neutrosophic Z - subalgebra of 𝑿.
Now,
𝕋𝑨𝟏∩𝑨 𝒙⨂𝒚 = 𝐦𝐢𝐧⁡
{ 𝕋𝑨𝟏 𝒙⨂𝒚 , 𝕋𝑨𝟐 𝒙⨂𝒚 }
𝟐
≥ 𝐦𝐢𝐧 {𝕋𝑨𝟏 𝒙 , 𝕋𝑨𝟏 𝒚 , 𝐦𝐢𝐧⁡

{𝕋𝑨𝟐 𝒙 , 𝕋𝑨𝟐 𝒚 }}
= 𝐦𝐢𝐧 {𝕋𝑨𝟏 𝒙 , 𝕋𝑨𝟐 𝒙 , {𝕋𝑨𝟏 𝒚 , 𝕋𝑨𝟐 𝒚 }}
≥ 𝐦𝐢𝐧⁡
{𝕋𝑨𝟏∩𝑨 𝒙 , 𝕋𝑨𝟏∩𝑨 𝒚 }
𝟐 𝟐
𝕋𝑨𝟏∩𝑨 𝒙⨂𝒚 ≥ 𝐦𝐢𝐧⁡

{𝕋𝑨𝟏∩𝑨 𝒙 , 𝕋𝑨𝟏∩𝑨 𝒚 }.
𝟐 𝟐 𝟐
𝕀𝑨𝟏∩𝑨 𝒙⨂𝒚 = 𝐦𝐢𝐧⁡

{ 𝕀𝑨𝟏 𝒙⨂𝒚 , 𝕀𝑨𝟐 𝒙⨂𝒚 }
𝟐
≥ 𝐦𝐢𝐧 {𝕀𝑨𝟏 𝒙 , 𝕀𝑨𝟏 𝒚 , 𝐦𝐢𝐧⁡

{𝕀𝑨𝟐 𝒙 , 𝕀𝑨𝟐 𝒚 }}
= 𝐦𝐢𝐧 {𝕀𝑨𝟏 𝒙 , 𝕀𝑨𝟐 𝒙 , {𝕀𝑨𝟏 𝒚 , 𝕀𝑨𝟐 𝒚 }}
≥ 𝐦𝐢𝐧⁡
{𝕀𝑨𝟏∩𝑨 𝒙 , 𝕀𝑨𝟏∩𝑨 𝒚 }
𝟐 𝟐

𝕀𝑨𝟏∩𝑨 𝒙⨂𝒚 ≥ 𝐦𝐢𝐧⁡

{𝕀𝑨𝟏∩𝑨 𝒙 , 𝕀𝑨𝟏∩𝑨 𝒚 }.
𝟐 𝟐 𝟐
𝔽𝑨𝟏∩𝑨 𝒙⨂𝒚 = 𝐦𝐚𝐱⁡

{ 𝔽𝑨𝟏 𝒙⨂𝒚 , 𝔽𝑨𝟐 𝒙⨂𝒚 }
𝟐
≤ 𝐦𝐚𝐱 {𝔽𝑨𝟏 𝒙 , 𝔽𝑨𝟏 𝒚 , 𝐦𝐚𝐱⁡

{𝔽𝑨𝟐 𝒙 , 𝔽𝑨𝟐 𝒚 }}
= 𝐦𝐚𝐱 {𝔽𝑨𝟏 𝒙 , 𝔽𝑨𝟐 𝒙 , {𝔽𝑨𝟏 𝒚 , 𝔽𝑨𝟐 𝒚 }}

≤ 𝐦𝐚𝐱⁡
{𝔽𝑨𝟏∩𝑨 𝒙 , 𝔽𝑨𝟏∩𝑨 𝒚 }
𝟐 𝟐
𝔽𝑨𝟏∩𝑨 𝒙⨂𝒚 ≤ 𝐦𝐚𝐱⁡

{𝔽𝑨𝟏∩𝑨 𝒙 , 𝔽𝑨𝟏∩𝑨 𝒚 }.
𝟐 𝟐 𝟐
Thus, 𝑨𝟏 ∩ 𝑨𝟐 is an NeutrosophicZ- subalgebra of 𝑿.
Lemma 3.4 :
Let 𝑨 be an NeutrosophicZ- subalgebra of 𝑿, then
𝒊) 𝕋𝑨 𝟎 ≥ 𝕋𝑨 𝒙 , 𝕀𝑨 𝟎 ≥ 𝕀𝑨 𝒙 𝒂𝒏𝒅 𝔽𝑨 𝟎 ≤ 𝔽𝑨 𝒙 ,
𝒊𝒊)𝕋𝑨 𝟎 ≥ 𝕋𝑨 𝒙∗ ≥ 𝕋𝑨 𝒙 , 𝕀𝑨 𝟎 ≥ 𝕀𝑨 𝒙∗ ≥ 𝕀𝑨 𝒙 𝒂𝒏𝒅 𝔽𝑨 𝟎 ≤ 𝔽𝑨 𝒙∗ ≤
𝔽𝑨 𝒙 where 𝒙∗ = 𝟎 − 𝒙, ∀𝒙 ∈ 𝑿.
Proof:
i) For any 𝒙 ∈ 𝑿.
𝕋𝑨 𝟎 = 𝕋𝑨 𝒙⨂𝒙 ≥ 𝐦𝐢𝐧 𝕋𝑨 𝒙 , 𝕋𝑨 𝒙 = 𝕋𝑨 𝒙
Therefore, 𝕋𝑨 𝟎 ≥ 𝕋𝑨 𝒙 .
𝕀𝑨 𝟎 = 𝕀𝑨 𝒙⨂𝒙 ≥ 𝐦𝐢𝐧 𝕀𝑨 𝒙 , 𝕀𝑨 𝒙 = 𝕀𝑨 𝒙
Therefore, 𝕀𝑨 𝟎 ≥ 𝕀𝑨 𝒙 .
𝔽𝑨 𝟎 = 𝔽𝑨 𝒙⨂𝒙 ≤ 𝐦𝐚𝐱 𝔽𝑨 𝒙 , 𝔽𝑨 𝒙 = 𝔽𝑨 𝒙
Thus, 𝔽𝑨 𝟎 ≤ 𝔽𝑨 𝒙 .
ii) Also for 𝒙 ∈ 𝑿,

𝕋𝑨 𝒙∗ = 𝕋𝑨 𝟎⨂𝒙 ≥ 𝐦𝐢𝐧 𝕋𝑨 𝟎 , 𝕋𝑨 𝒙 = 𝕋𝑨 𝒙
𝑯𝒆𝒏𝒄𝒆, 𝕋𝑨 𝒙∗ ≥ 𝕋𝑨 𝒙 .
Similarly, 𝕀𝑨 𝟎 ≥ 𝕀𝑨 𝒙∗ ≥ 𝕀𝑨 𝒙
𝔽𝑨 (𝒙∗ ) = 𝔽𝑨 𝟎⨂𝒙 ≤ 𝐦𝐚𝐱 𝔽𝑨 𝟎 , 𝔽𝑨 𝒙 = 𝔽𝑨 𝒙
Thus, 𝔽𝑨 𝟎 ≤ 𝔽𝑨 𝒙∗ ≤ 𝔽𝑨 𝒙 .

Theorem 3.5 :
If there exists a sequence 𝒙𝒏 } in 𝑿 such that
𝐥𝐢𝐦𝒏→∞ 𝕋𝑨 𝒙𝒏 = 𝟏 = 𝐥𝐢𝐦 𝕀𝑨 𝒙𝒏 𝒂𝒏𝒅 𝐥𝐢𝐦𝒏→∞ 𝔽𝑨 𝒙𝒏 = 𝟎. And 𝑨 be an
𝒏→∞
Neutrosophic Z- subalgebra of 𝑿. Then

𝕋𝑨 𝟎 = 𝕀𝑨 𝟎 = 𝟏, 𝒂𝒏𝒅 𝔽𝑨 𝟎 = 𝟎
Proof:
Since, 𝕋𝑨 𝟎 ≥ 𝕋𝑨 𝒙 , ∀𝒙 ∈ 𝑿,
𝕋𝑨 𝟎 ≥ 𝕋 𝑨 𝒙 𝒏 .
Similarly, 𝕀𝑨 𝟎 ≥ 𝕀𝑨 𝒙𝒏 and 𝔽𝑨 𝟎 ≤ 𝔽𝑨 𝒙𝒏 for every positive integer n.
Note that, 𝟏 ≥ 𝕋𝑨 𝟎 ≥ 𝐥𝐢𝐦𝒏→∞ 𝕋𝑨 𝒙𝒏 = 𝟏,
Hence 𝕋𝑨 𝟎 = 𝟏.
Similarly, 𝕀𝑨 𝟎 = 𝟏
Also 𝟎 ≤ 𝔽𝑨 𝟎 ≤ 𝐥𝐢𝐦𝒏→∞ 𝔽𝑨 𝒙𝒏 = 𝟎.
Therefore, 𝔽𝑨 𝟎 = 𝟎.
∴ 𝑨 = 𝕋𝑨 , 𝕀𝑨 , 𝔽𝑨 is a Neutrosophic Z - subalgebra of 𝑿.
Theorem 3.6 :
If 𝑨 = 𝕋𝑨 , 𝕀𝑨 , 𝔽𝑨 is a Neutrosophic Z - subalgebra of 𝑿.Then the sets
𝑿𝕋𝑨 = { 𝒙 ∈ 𝑿 𝕋𝑨 𝒙 = 𝕋𝑨 𝟎 } ; 𝑿𝕀𝑨 = { 𝒙 ∈ 𝑿 𝕀𝑨 𝒙 = 𝕀𝑨 𝟎 } and 𝑿𝔽𝑨 = { 𝒙 ∈
𝑿 𝔽𝑨 𝒙 = 𝔽𝑨 𝟎 } are subalgebra of 𝑿.
Proof:
For any 𝒙, 𝒚 ∈ 𝑿𝕋𝑨 .
Then 𝕋𝑨 𝒙 = 𝕋𝑨 𝟎 = 𝕋𝑨 𝒚
𝕋𝑨 𝒙⨂𝒚 ≥ 𝐦𝐢𝐧⁡
(𝕋𝑨 𝒙 , 𝕋𝑨 𝒚 )
= 𝐦𝐢𝐧 𝕋𝑨 𝟎 , 𝕋𝑨 𝟎 = 𝕋𝑨 𝟎
𝒙⨂𝒚 ∈ 𝑿𝕋𝑨
Similarly, 𝒙⨂𝒚 ∈ 𝑿𝕀𝑨
Therefore,𝑿𝕋𝑨 , 𝑿𝕀𝑨 is a subalgebra of X.
Let 𝒙, 𝒚 ∈ 𝑿𝔽𝑨
𝔽𝑨 𝒙 = 𝔽𝑨 𝟎 = 𝔽𝑨 𝒚
Now, 𝔽𝑨 𝒙⨂𝒚 ≤ 𝐦𝐚𝐱⁡
(𝔽𝑨 𝒙 , 𝔽𝑨 𝒚 )

= 𝐦𝐚𝐱 𝔽𝑨 𝟎 , 𝔽𝑨 𝟎
= 𝔽𝑨 𝟎
∴ 𝒙⨂𝒚 ∈ 𝑿𝔽𝑨
𝑿𝔽𝑨 is a subalgebra of X.
Definition 3.7 :
𝑨 = { < 𝑥, 𝕋𝑨 (𝒙), 𝕀𝑨 (𝒙), 𝔽𝑨 (𝒙) >∕ 𝑥 ∈ 𝑋} be aNeutrosophic set in 𝑿 and 𝒇
be mapping from 𝑿 into 𝒀 then the image of 𝑨 under 𝒇, 𝒇(𝑨) is defined as,
𝒇 𝑨 = < 𝑥, 𝒇𝒔𝒖𝒑 𝕋𝑨 , 𝒇𝒔𝒖𝒑 𝕀𝑨 , 𝒇𝒊𝒏𝒇 𝑱𝑨 >∕ 𝑥 ∈ 𝑌 where
𝐬𝐮𝐩 𝕋𝑨 𝒙 , 𝒊𝒇 𝒇−𝟏 𝒚 ≠ ∅
𝒇𝒔𝒖𝒑 𝕋𝑨 𝒚 = 𝒙∈𝒇−𝟏 (𝒚)
𝟎 𝒐𝒕𝒉𝒆𝒓𝒘𝒊𝒔𝒆
𝐫𝐬𝐮𝐩 𝕀𝑨 𝒙 , 𝒊𝒇 𝒇−𝟏 𝒚 ≠ ∅
𝒇𝒔𝒖𝒑 𝕀𝑨 𝒚 = 𝒙∈𝒇−𝟏 (𝒚)
𝟏 𝒐𝒕𝒉𝒆𝒓𝒘𝒊𝒔𝒆
𝐢𝐧𝐟 𝔽𝑨 𝒙 , 𝒊𝒇 𝒇−𝟏 𝒚 ≠ ∅
𝒇𝒊𝒏𝒇 𝔽𝑨 𝒚 = 𝒙∈𝒇−𝟏 (𝒚)
𝟏 𝒐𝒕𝒉𝒆𝒓𝒘𝒊𝒔𝒆
Definition 3.8 :
Let 𝒇 ∶ 𝑿 → 𝒀 be a function. Let 𝑨 and 𝑩 be the two Neutrosophic
Z-subalgebra in 𝑿 and 𝒀 respectively. Then inverse image of 𝑩 under 𝒇 is
defined by
𝒇−𝟏 𝑩 = {𝒙, 𝒇−𝟏 𝕋𝑩 𝒙 , 𝒇−𝟏 𝕀𝑩 𝒙 , 𝒇−𝟏 𝔽𝑩 𝒙 ∕ 𝒙 ∈ 𝑿} such that
𝒇−𝟏 𝕋𝑩 𝒙 = 𝕋𝑩 (𝒇 𝒙 ) ; 𝒇−𝟏 𝕀𝑩 𝒙 = 𝕀𝑩 𝒇 𝒙 and 𝒇−𝟏 𝔽𝑩 𝒙 = 𝔽𝑩 (𝒇 𝒙 ).
Theorem 3.9 :
Let 𝑿, ⨂, 𝟎 𝒂𝒏𝒅 𝒀, ⨂, 𝟎 be two Z – algebras and 𝒇: 𝑿 → 𝒀 be an
homomorphism. If 𝑨 is a Neutrosophic Z– sub algebra of 𝑿, define
𝒇 𝑨 = { < 𝑥, 𝕋𝒇 𝒙 = 𝕋 𝒇 𝒙 , 𝕀𝒇 𝒙 = 𝕀 𝒇 𝒙 , 𝔽𝒇 𝒙 = 𝔽 𝒇 𝒙 >∕ 𝑥 ∈ 𝑋}. Then
𝒇 𝑨 is a Neutrosophic Z– sub algebra of 𝒀.

Proof:
Let 𝒙, 𝒚 ∈ 𝑿.
Now, 𝕋𝒇 𝒙⨂𝒚 = 𝕋(𝒇 𝒙⨂𝒚 )
= 𝕋(𝒇 𝒙 ⨂𝒇 𝒚 )
≥ 𝐦𝐢𝐧 𝕋 𝒇 𝒙 , 𝕋 𝒇 𝒚
= 𝐦𝐢𝐧 𝕋𝒇 𝒙 , 𝕋𝒇 𝒚
𝕋𝒇 𝒙⨂𝒚 ≥ 𝐦𝐢𝐧 𝕋𝒇 𝒙 , 𝕋𝒇 𝒚
Similarly, 𝕀𝒇 𝒙⨂𝒚 ≥ 𝐦𝐢𝐧 𝕀𝒇 𝒙 , 𝕀𝒇 𝒚
𝔽𝒇 𝒙⨂𝒚 = 𝔽(𝒇 𝒙⨂𝒚 ) = 𝔽(𝒇 𝒙 ⨂𝒇 𝒚 )
≤ 𝒎𝒂𝒙 𝔽 𝒇 𝒙 , 𝔽 𝒇 𝒚
𝔽𝒇 𝒙⨂𝒚 ≤ 𝐦𝐚𝐱 𝔽𝒇 𝒙 , 𝔽𝒇 𝒚
Hence 𝒇 𝑨 is aNeutrosophicZ– subalgebra of 𝒀.
Theorem 3.10 :
Let 𝒇 ∶ 𝑿 → 𝒀 be a homomorphism of Z – algebra 𝑿 into a Z – algebra 𝒀. If
𝑨 = { < 𝑥, 𝕋𝑨 (𝒙), 𝕀𝑨 (𝒙), 𝔽𝑨 (𝒙) >∕ 𝑥 ∈ 𝑋} is a NeutrosophicZ – subalgebra of 𝑿,
then the image 𝒇 𝑨 = < 𝑥, 𝒇𝒔𝒖𝒑 𝕋𝑨 , 𝒇𝒔𝒖𝒑 𝕀𝑨 , 𝒇𝒊𝒏𝒇 𝔽𝑨 >∕ 𝑥 ∈ 𝑋 of 𝑨 under 𝒇 is
a
Neutrosophic Z – sub algebra of 𝒀.
Proof:
𝑨 = { < 𝑥, 𝕋𝑨 (𝒙), 𝕀𝑨 (𝒙), 𝔽𝑨 (𝒙) >∕ 𝑥 ∈ 𝑋} be a Neutrosophic Z – sub algebra of 𝑿.
Let 𝒚𝟏 ,𝒚𝟐 ∈ 𝒀
∴ {𝒙𝟏 ⨂𝒙𝟐 : 𝒙𝟏 ∈ 𝒇−𝟏 (𝒚𝟏 ),𝒙𝟐 ∈ 𝒇−𝟏 𝒚𝟐 , } ⊆ {𝒙 ∈ 𝑿: 𝒙 ∈ 𝒇−𝟏 (𝒚𝟏 ⨂𝒚𝟐 )}
Now,
𝒇𝒔𝒖𝒑 𝕋𝑨 𝒚𝟏 ⨂𝒚𝟐 {𝕋𝑨 (𝒙) ∕ 𝒙 ∈ 𝒇−𝟏 (𝒚𝟏 + 𝒚𝟐 )}
= 𝐬𝐮𝐩⁡
≥ 𝐬𝐮𝐩 𝕋𝑨 𝒙𝟏 ⨂𝒙𝟐 𝒙𝟏 ∈ 𝒇−𝟏 𝒚𝟏 , 𝒙𝟐 ∈ 𝒇−𝟏 𝒚𝟐
≥ 𝐬𝐮𝐩 𝐦𝐢𝐧 𝕋𝑨 𝒙𝟏 , 𝕋𝑨 𝒙𝟐 𝒙𝟏 ∈ 𝒇−𝟏 𝒚𝟏 , 𝒙𝟐 ∈ 𝒇−𝟏 𝒚𝟐
= 𝐦𝐢𝐧⁡ {𝕋𝑨 𝒙𝟏 𝒙𝟏 ∈ 𝒇−𝟏 𝒚𝟏 },𝐬𝐮𝐩 { 𝕋𝑨 𝒙𝟐
{𝐬𝐮𝐩⁡ 𝒙𝟐 ∈ 𝒇−𝟏 𝒚𝟐 }}
= 𝐦𝐢𝐧{𝒇𝒔𝒖𝒑 (𝕋𝑨 𝒚𝟏 ), 𝒇𝒔𝒖𝒑 (𝕋𝑨 𝒚𝟐 )}

Similarly, 𝒇𝒔𝒖𝒑 𝕀𝑨 𝒚𝟏 ⨂ 𝒚𝟐 ≥ 𝐦𝐢𝐧{𝒇𝒔𝒖𝒑 (𝕀𝑨 (𝒚𝟏 )), 𝒇𝒔𝒖𝒑 (𝕀𝑨 (𝒚𝟐 ))}
𝒇𝒊𝒏𝒇 {𝔽𝑨 𝒚𝟏 ⨂𝒚𝟐 } = 𝒊𝒏𝒇{𝔽𝑨 (𝒙) ∕ 𝒙 ∈ 𝒇−𝟏 (𝒚𝟏 ⨂𝒚𝟐 )}
≤ 𝐢𝐧𝐟 𝔽𝑨 𝒙𝟏 ⨂𝒙𝟐 𝒙𝟏 ∈ 𝒇−𝟏 𝒚𝟏 , 𝒙𝟐 ∈ 𝒇−𝟏 𝒚𝟐
≤ 𝐢𝐧𝐟 𝐦𝐚𝐱 𝔽𝑨 𝒙𝟏 , 𝔽𝑨 𝒙𝟐 𝒙𝟏 ∈ 𝒇−𝟏 𝒚𝟏 , 𝒙𝟐 ∈ 𝒇−𝟏 𝒚𝟐
{𝔽𝑨 𝒙𝟏 𝒙𝟏 ∈ 𝒇−𝟏 𝒚𝟏 },𝐢𝐧𝐟 { 𝔽𝑨 𝒙𝟐
= 𝐦𝐚𝐱{𝐢𝐧𝐟⁡ 𝒙𝟐 ∈ 𝒇−𝟏 𝒚𝟐 }}
=𝐦𝐚𝐱{𝒇𝒊𝒏𝒇 (𝔽𝑨 𝒚𝟏 ) , 𝒇𝒊𝒏𝒇 (𝔽𝑨 𝒚𝟐 )}
Theorem 3.11 :
Let 𝒇 ∶ 𝑿 → 𝒀 be a homomorphism of Z– algebra. If 𝑩 = (𝕋𝑩 , 𝕀𝑩, 𝔽𝑩 ) is
aNeutrosophicZ– subalgebra of 𝒀. Then
𝒇−𝟏 𝑩 = < (𝒇−𝟏 𝕋𝑩 , 𝒇−𝟏 𝕀𝑩 , 𝒇−𝟏 𝔽𝑩 ) > is a Neutrosophic Z– subalgebra of
𝑿, where 𝒇−𝟏 𝕋𝑩 𝒙 = 𝕋𝑩 (𝒇 𝒙 ) ; 𝒇−𝟏 𝕀𝑩 𝒙 = 𝕀𝑩 𝒇 𝒙 and 𝒇−𝟏 𝔽𝑩 𝒙 =
𝔽𝑩 𝒇 𝒙 , for all 𝒙 ∈ 𝑿.
Proof :
Let 𝑩 be aNeutrosophicZ – subalgebra of 𝒀 and let 𝒙, 𝒚 ∈ 𝑿
Then 𝒇−𝟏 𝕋𝑩 𝒙⨂𝒚 = 𝕋𝑩 𝒇 𝒙⨂𝒚
= 𝕋𝑩 𝒇 𝒙)⨂𝒇(𝒚
≥ 𝐦𝐢𝐧⁡
{𝕋𝑩 𝒇(𝒙)) ⨂𝕋𝑩 𝒇(𝒚)}
{𝒇−𝟏 𝕋𝑩 𝒙
= 𝐦𝐢𝐧⁡ + 𝒇−𝟏 𝕋𝑩 𝒚 }
𝒇−𝟏 𝕋𝑩 𝒙⨂𝒚 ≥ 𝐦𝐢𝐧 𝒇−𝟏 𝕋𝑩 𝒙 ⨂ 𝒇−𝟏 𝕋𝑩 𝒚 .
Similarly, 𝒇−𝟏 𝕀𝑩 𝒙⨂𝒚 ≥ 𝐦𝐢𝐧⁡
{𝒇−𝟏 𝕀𝑩 𝒙 , 𝒇−𝟏 𝕀𝑩 𝒚 }
𝒇−𝟏 𝔽𝑩 𝒙⨂𝒚 = 𝔽𝑩 𝒇 𝒙⨂𝒚
= 𝔽𝑩 𝒇 𝒙)⨂𝒇(𝒚
≤ 𝐦𝐚𝐱⁡
{𝔽𝑩 𝒇(𝒙)⨂𝔽𝑩 𝒇(𝒚)}
= 𝐦𝐚𝐱{𝒇−𝟏 𝔽𝑩 𝒙 ⨂ 𝒇−𝟏 𝔽𝑩 𝒚 }
𝒇−𝟏 𝔽𝑩 𝒙⨂𝒚 ≤ 𝐦𝐚𝐱 𝒇−𝟏 𝔽𝑩 𝒙 ⨂ 𝒇−𝟏 𝔽𝑩 𝒚 .
Hence 𝒇−𝟏 𝑩 = (𝒇−𝟏 𝕋𝑩 , 𝒇−𝟏 𝕀𝑩 , 𝒇−𝟏 𝔽𝑩 ) is a Neutrosophic Z– sub algebra of 𝑿.

4. Product of Neutrosophic Z-Sub algebra :

In this section the Cartesian product of the two NeutrosophicZ- subalgebra𝑨
and 𝑩 of 𝑿 and 𝒀 respectively is given.
Definition 4.1 :
Let 𝑨 = { < 𝑥, 𝕋𝑨 (𝒙), 𝕀𝑨 (𝒙) , 𝔽𝑨 (𝒙) >∕ 𝑥 ∈ 𝑋} and 𝑩 = { < 𝑦, 𝕋𝑩 (𝒚), 𝕀𝑩 (𝒚),
𝔽𝑩 (𝒚))>∕ 𝑦 ∈ 𝑌} be two Neutrosophic sets of X and Y respectively. The Cartesian
product of 𝑨 and 𝑩 is denoted by 𝑨 × 𝑩 is defined as
𝑨 × 𝑩 = { < 𝒙, 𝒚 , 𝕋𝑨×𝑩 (𝒙, 𝒚), 𝕀𝑨×𝑩 (𝒙, 𝒚), 𝔽𝑨×𝑩 (𝒙, 𝒚) >∕ (𝑥, 𝑦) ∈ 𝑋 × 𝑌 } where
𝕋𝑨×𝑩 ∶ 𝑿 × 𝒀 → [𝟎, 𝟏], 𝕀𝑨×𝑩 : 𝑿 × 𝒀 → 𝑫[𝟎, 𝟏], 𝔽𝑨×𝑩 ∶ 𝑿 × 𝒀 → [𝟎, 𝟏].
𝕋𝑨×𝑩 (𝒙, 𝒚) = 𝐦𝐢𝐧⁡
{ 𝕋𝑨 (𝒙),𝕋𝑨 (𝒚)}, 𝕀𝑨×𝑩 (𝒙, 𝒚) = 𝐦𝐢𝐧⁡
{ 𝕀𝑨 (𝒙),𝕀𝑨 (𝒚)} and
𝔽𝑨×𝑩 (𝒙, 𝒚) = 𝐦𝐚𝐱⁡
{ 𝔽𝑨 (𝒙),𝔽𝑨 (𝒚)}.
Theorem 4.2 :
Let 𝑨 𝒂𝒏𝒅 𝑩 be two Neutrosophic Z - subalgebra of X and Y respectively.
Then 𝑨 × 𝑩 is also aNeutrosophicZ- subalgebra of 𝑿 × 𝒀.
Proof:
Let 𝑨 𝒂𝒏𝒅 𝑩 be aNeutrosophicZ- subalgebra of X and Y respectively.
Take 𝒙 = (𝒙𝟏 , 𝒙𝟐 ) and 𝒚 = 𝒚𝟏 , 𝒚𝟐 ∈ 𝑿 × 𝒀.
Now,
𝕋𝑨×𝑩 (𝒙⨂𝒚) = 𝕋𝑨×𝑩 𝒙𝟏 , 𝒙𝟐 ⨂ 𝒚𝟏 , 𝒚𝟐
= 𝕋𝑨×𝑩 𝒙𝟏 ⨂𝒚𝟏 , 𝒚𝟏 ⨂ 𝒚𝟐
= 𝐦𝐢𝐧⁡
{𝕋𝑨 𝒙𝟏 ⨂𝒚𝟏 ), 𝕋𝑩 ( 𝒚𝟏 ⨂ 𝒚𝟐 }
≥ 𝐦𝐢𝐧⁡
{𝐦𝐢𝐧 𝕋𝑨 𝒙𝟏 , 𝕋𝑩 𝒚𝟏 , 𝐦𝐢𝐧 𝕋𝑨 𝒙𝟐 , 𝕋𝑩 𝒚𝟐 }
= 𝐦𝐢𝐧⁡
{𝐦𝐢𝐧 𝕋𝑨 𝒙𝟏 , 𝕋𝑩 𝒙𝟐 , 𝐦𝐢𝐧 𝕋𝑨 𝒚𝟏 , 𝕋𝑩 𝒚𝟐 }
= 𝐦𝐢𝐧⁡
{ 𝕋𝑨×𝑩 𝒙𝟏 , 𝒙𝟐 , 𝕋𝑨×𝑩 𝒚𝟏 , 𝒚𝟐 }
= 𝐦𝐢𝐧 𝕋𝑨×𝑩 𝒙 , 𝕋𝑨×𝑩 (𝒚)}
𝕋𝑨×𝑩 (𝒙⨂𝒚) ≥ 𝐦𝐢𝐧{ 𝕋𝑨 × 𝕋𝑩 𝒙 , 𝕋𝑨 × 𝕋𝑩 (𝒚)} .
Similarly, 𝕀𝑨×𝑩 (𝒙⨂𝒚) ≥ 𝐦𝐢𝐧{ 𝕀𝑨 × 𝕀𝑩 𝒙 , 𝕀𝑨 × 𝕀𝑩 (𝒚)}
𝔽𝑨×𝑩 (𝒙⨂𝒚) = 𝔽𝑨×𝑩 𝒙𝟏 , 𝒙𝟐 ⨂ 𝒚𝟏 , 𝒚𝟐
= 𝔽𝑨×𝑩 𝒙𝟏 ⨂𝒚𝟏 , 𝒚𝟏 ⨂ 𝒚𝟐
= 𝐦𝐚𝐱{𝔽 𝒙𝟏 ⨂𝒚𝟏 ), 𝔽𝑩 ( 𝒚𝟏 ⨂ 𝒚𝟐 }

≤ 𝐦𝐚𝐱{𝐦𝐚𝐱 𝔽 𝒙𝟏 , 𝔽 𝒚𝟏 , 𝐦𝐚𝐱 𝔽𝑨 𝒙𝟐 , 𝔽 𝒚𝟐 }
= 𝐦𝐚𝐱{𝐦𝐚𝐱 𝔽𝑨 𝒙𝟏 , 𝔽𝑩 𝒙𝟐 , 𝐦𝐚𝐱 𝔽𝑨 𝒚𝟏 , 𝔽𝑩 𝒚𝟐 }
= 𝐦𝐚𝐱⁡
{ 𝔽𝑨 × 𝔽𝑩 𝒙𝟏 , 𝒙𝟐 , 𝔽𝑨 × 𝔽𝑩 𝒚𝟏 , 𝒚𝟐 }
= 𝐦𝐚𝐱 𝔽𝑨 × 𝔽𝑩 𝒙 , 𝔽𝑨 × 𝔽𝑩 (𝒚)}
𝔽𝑨×𝑩 (𝒙⨂ 𝒚) ≤ 𝐦𝐚𝐱 𝔽𝑨 × 𝔽𝑩 𝒙 , 𝔽𝑨 × 𝔽𝑩 (𝒚)}
Thus, 𝑨 × 𝑩 is also aNeutrosophicZ- subalgebra of 𝑿 × 𝒀.
Theorem 4.3 :
Let 𝑨𝒊 = { 𝒙 ∈ 𝑿𝒊 : 𝕋𝑨𝒊 𝒙 , 𝕀𝑨𝒊 𝒙 , 𝔽𝑨𝒊 𝒙 } be an Neutrosophic Z- subalgebra
𝒏
of 𝑿𝒊 , i=1,2,…n. Then 𝒊=𝟏 𝑨𝒊 is called direct product of finite NeutrosophicZ-
𝒏
subalgebra of 𝒊=𝟏 𝑿𝒊 if
𝒏 𝒏 𝒏
i) 𝒊=𝟏 𝕋𝑨𝒊 𝒙𝒊 ⨂𝒚𝒊 ≥ 𝐦𝐢𝐧⁡
{ 𝒊=𝟏 𝕋𝑨𝒊 𝒙𝒊 , 𝒊=𝟏 𝕋𝑨𝒊 (𝒚𝒊 )}
𝒏 𝒏 𝒏
ii) 𝒊=𝟏 𝕀𝑨𝒊 𝒙𝒊 ⨂𝒚𝒊 ≥ 𝐦𝐢𝐧⁡
{ 𝒊=𝟏 𝕀𝑨𝒊 𝒙𝒊 , 𝒊=𝟏 𝕀𝑨𝒊 (𝒚𝒊 )}
𝒏 𝒏 𝒏
iii) 𝒊=𝟏 𝔽𝑨𝒊 𝒙𝒊 ⨂𝒚𝒊 ≤ 𝐦𝐚𝐱⁡
{ 𝒊=𝟏 𝔽𝑨𝒊 𝒙𝒊 , 𝒊=𝟏 𝔽𝑨𝒊 (𝒚𝒊 )}
Proof :
The prove is clear by induction and using Theorem 4.2.
Theorem 4.4 :
Let 𝑨𝒊 = { 𝒙 ∈ 𝑿𝒊 : 𝕋𝑨𝒊 𝒙 , 𝕀𝑨𝒊 𝒙 , 𝔽𝑨𝒊 𝒙 } be an NeutrosophicZ-subalgebraof
𝒏
𝑿𝒊 , respectively for i=1,2,…n. Then 𝒊=𝟏 𝑨𝒊 is an NeutrosophicZ- subalgebra of
𝒏
𝒊=𝟏 𝑿𝒊 .
Proof:
Let 𝑨 be an Neutrosophic Z- subalgebra of 𝑿𝒊
𝒏
Let 𝒙𝟏 , 𝒙𝟐 , … 𝒙𝒏 and 𝒚𝟏 , 𝒚𝟐 , … 𝒚𝒏 ∈ 𝒊=𝟏 𝑿𝒊
Take 𝒂 = 𝒙𝟏 , 𝒙𝟐 , … 𝒙𝒏 and 𝒃 = 𝒚𝟏 , 𝒚𝟐 , … 𝒚𝒏
Then
𝒏
𝕋𝑨𝒊 𝒂⨂𝒃 ≥ 𝐦𝐢𝐧 𝕋𝑨𝟏 𝒂⨂𝒃 , … … . 𝕋𝑨𝒏 𝒂⨂𝒃

𝒊=𝟏
= 𝐦𝐢𝐧⁡
{𝐦𝐢𝐧 𝕋𝑨𝟏 𝒂 , 𝕋𝑨𝟏 𝒃𝒏 , … … … . 𝐦𝐢𝐧 𝕋𝑨𝒏 𝒂 , 𝕋𝑨𝒏 𝒃 }
= 𝐦𝐢𝐧⁡
{𝐦𝐢𝐧 𝕋𝑨𝟏 𝒂 , … … 𝕋𝑨𝒏 𝒂 , 𝐦𝐢𝐧 𝕋𝑨𝟏 𝒃 , … … 𝕋𝑨𝒏 𝒃 }

𝒏 𝒏
= 𝐦𝐢𝐧⁡
{ 𝕋𝑨𝒊 𝒂 , 𝕋𝑨𝒊 (𝒃)}
𝒊=𝟏 𝒊=𝟏
𝒏 𝒏 𝒏
𝕋𝑨𝒊 𝒂⨂𝒃 ≥ 𝐦𝐢𝐧 𝕋𝑨𝒊 𝒂 , 𝕋𝑨𝒊 (𝒃)}

𝒊=𝟏 𝒊=𝟏 𝒊=𝟏
𝒏 𝒏 𝒏
𝕀𝑨𝒊 𝒂⨂𝒃 ≥ 𝐦𝐢𝐧 𝕀𝑨𝒊 𝒂 , 𝕀𝑨𝒊 (𝒃)}

𝒊=𝟏 𝒊=𝟏 𝒊=𝟏
𝒏
𝔽𝑨𝒊 𝒂⨂𝒃 ≤ 𝐦𝐚𝐱 𝔽𝑨𝟏 𝒂⨂𝒃 , … … . 𝔽𝑨𝒏 𝒂⨂𝒃

𝒊=𝟏
= 𝐦𝐚𝐱⁡
{𝐦𝐚𝐱 𝔽𝑨𝟏 𝒂 , 𝔽𝑨𝟏 𝒃 , … … … . 𝐦𝐚𝐱 𝔽𝑨𝒏 𝒂 , 𝔽𝑨𝒏 𝒃 }
= 𝐦𝐚𝐱⁡
{𝐦𝐚𝐱 𝔽𝑨𝟏 𝒂 , … … 𝔽𝑨𝒏 𝒂 , 𝐦𝐚𝐱 𝔽𝑨𝟏 𝒃 , … … 𝔽𝑨𝒏 𝒃 }
𝒏 𝒏
= 𝐦𝐚𝐱⁡
{ 𝔽𝑨𝒊 𝒂 , 𝔽𝑨𝒊 (𝒃)}
𝒊=𝟏 𝒊=𝟏
𝒏 𝒏
Thus, 𝒊=𝟏 𝑨𝒊 is an NeutrosophicZ - subalgebra of 𝒊=𝟏 𝑿𝒊 .
Conclusion :
In this work, the Neutrosophic substructure on Z – algebra was introduced and related
properties were discussed. Further, the study analysed the NeuromorphicZ – sub algebra
using Homomorphic image, inverse image and cartesian product. In future, this idea can be
extended in to other algebraic substructures.
References :
1. Chandramouleeswaran, M., Muralikrishna, P., Sujatha, K., & Sabarinathan, S. (2017).
A note on Z-algebra. Italian Journal of Pure and Applied Mathematics, 38, 707-714.
2. Iseki, K. (1980). On BCI-algebras, Math. Seminar Notes, 8 , 125–130.
3. Iseki, K., & Tanaka, S. (1978). An introduction to the theory of BCK-algebras, Math.
Japan. 23, 1–26.
4. Jun, Y.B. (2017). Neutrosophic subalgebras of several types in BCK/BCI-algebras,
Ann. Fuzzy Math. Inform. 14(1), 75–86.

5. Jun, Y.B., Smarandache, F., & Bordbar, H. (2017). Neutrosophic N-structures applied
to BCK/BCI-algebras, Information, 8,128.
6. Mohseni Takallo, M., Hashem Bordbar, R.A., Borzooei, &Young Bae Jun. (2019).
BMBJ – Neutrosophic ideals in BCK/BCI – algebras, Neutrosophic Sets & Systems,
27,1-16. DOI:10.5281/zenodo.3275167.
7. Neggers, J., & Sik, K. (2002). On B-algebras. Matematički vesnik, 54(1-2), 21-29.
8. Surya Manokaran, Muralikrishna Prakasam. (2019). On MBJ-Neutrosophic
𝛽 −subalgebra, Neutrosophic Sets and Systems, 28, 216-227.
9. Takallo, M.M., &Jun, Y.B. (2018). MBJ – Neutrosophic Structures and its applications
in BCK/BCI – algebra, Neutrosophic Sets and Systems, .23, 72 – 84.
10. Zadeh, L.A. (1965). Fuzzy sets, Information and Control, 8(3), 338–353.

CHAPTER-4
Neutrosophic 𝓝-structures Applied to

𝑲𝑼-algebras
D. Ramesh Kumar1, M. Vasu2 andA. Vadivel3
1
Department of Mathematics, Government Arts and Science College,
Komarapalayam, Tamil Nadu, India - 638 183.
Email:durairameshmath@gmail.com
2
Department of Mathematics, Government Arts College for Women,
Sivagangai, Tamil Nadu, India - 630 562.
Email:mvasu1974@gmail.com
3
Department of Mathematics, Government Arts College (Autonomous),
Karur,Tamil Nadu-639 005;
Tamil Nadu-608 002
1. Introduction :-
Prabpayak and Leerawat [5, 6] introduced another algebraic structure which is called
𝐾𝑈 -algebras. They studied ideals and congruences in 𝐾𝑈 -algebras. Additionally, they
introduced the concept of homomorphism of 𝐾𝑈 -algebra and examined some related
properties. In addition, they derived some straightforward consequences of the relations
between quotient 𝐾𝑈-algebras and isomorphism.
A (crisp) set 𝐴 in a universe 𝑋 can be defined in the form of its characteristic function
𝜇𝐴 : 𝑋 → {0,1} yielding the value 1 for elements belonging to the set 𝐴 and the value 0 for
elements excluded from the set 𝐴. So far, most of the generalizations of the crisp set have been
conducted on the unit interval [0,1], and they are consistent with the asymmetry observation.
In other words, the generalization of the crisp set to fuzzy sets relied on spreading positive
information that fit the crisp point {1} into the interval [0,1]. Because no negative meaning of
information is suggested, we now feel a need to deal with negative information. To do so, we
Lulu International Publisher United States 37

also feel a need to supply a mathematical tool. To attain such an object, Jun et al. [2] introduced
a new function, called a negative-valued function, and constructed 𝒩-structures. Zadeh [8]
introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. As a
generalization of fuzzy sets, Atanassov [1] introduced the degree of nonmembership/falsehood
(f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of
indeterminacy/neutrality (i) as an independent component in 1995 (published in 1999 ) [7] and
defined the neutrosophic set on three components:
(𝑡, 𝑖, 𝑓) = (truth, indeterminacy, falsehood)
For more details, refer to the following site: http://
fs.gallup.unm.edu/FlorentinSmarandache.htm
In this chapter, we introduce the notions of a 𝒩𝑛 -subalgebra and a (closed) 𝒩𝑛 -ideal in
a 𝐾𝑈 -algebra, and investigate related properties. We consider characterizations of a
𝒩𝑛 -subalgebra and a 𝒩𝑛 -ideal. We discuss relations between a 𝒩𝑛 -subalgebra and a
𝒩𝑛 -ideal. We provide conditions for a 𝒩𝑛 -ideal to be a closed 𝒩𝑛 -ideal.
2 . Preliminaries :-
We let K(τ) be the class of all algebras with type τ = (2,0). A KU-algebra [5, 6]
refers to a system X: = (X,∗ ,0) ∈ K(τ) in which the following axioms hold:
(KU1)(l ∗ m) ∗ ((m ∗ n) ∗ (l ∗ n)) = 0,
(KU2)l ∗ 0 = 0,
(KU3)0 ∗ l = l,
(KU4)l ∗ m = 0 and m ∗ l = 0 implies l = m,
(KU5)l ∗ l = 0, for all l, m, n ∈ X.
On a KU-algebra (X,∗ ,0) we can define a binary relation ≤ by putting l ≤ m ⇔ m ∗ l = 0,

∀ l, m ∈ X.
In a KU-algebra X, the following hold:

(KU1‟)(m ∗ n) ∗ (l ∗ n) ≤ (l ∗ m),
(KU2‟)0 ≤ l,
(KU3‟)l ≤ m, m ≤ l implies l = m,
(KU4‟)m ∗ l ≤ l.

Theorem 2.1 [4] :

In a KU-algebra X, the following axioms are satisfied: For all l, m, n ∈ X,
(i)l ≤ m imply m ∗ n ≤ l ∗ n,
(ii)l ∗ (m ∗ n) = m ∗ (l ∗ n), for all l, m, n ∈ X,
(iii)((m ∗ l) ∗ l) ≤ m,
(iv)(((m ∗ l) ∗ l) ∗ l) = (m ∗ l).
A non-empty subset S of a KU-algebra X is called a subalgebra [5, 6] of X if l ∗ m ∈ S for

all l, m ∈ S.
A subset I of a KU-algebra X is called an ideal [5, 6] of X if it satisfies the following:

(i)0 ∈ I,
(ii)(∀ l, m ∈ X)(m ∗ l ∈ I, m ∈ I ⇒ l ∈ I).
For any family {λj |j ∈ Δ} of real numbers, we define
max λj | j ∈ Δ if Δ is finite
∨ λj | j ∈ Δ : =
sup λj | j ∈ Δ otherwise
min λj | j ∈ Δ if Δ is finite
∧ λj | j ∈ Δ : =
inf λj | j ∈ Δ otherwise
We mean by ℱ(X, [−1,0]) the collection of functions from a set X to [−1,0]. We say that an
element of ℱ(X, [−1,0]) is a negative-valued function from X to [−1,0] (briefly,
𝒩-function on X). An 𝒩-structure refers to an ordered pair (X, f) of X and an 𝒩-function f
on X ( [2]). In what follows, we let X denote the nonempty universe of discourse unless
otherwise specified.
A neutrosophic 𝒩 (briefly, 𝒩n )-structure over X ([3]) is defined to be the structure:

X l
XN : = = |l∈X (1)
T N ,I N ,F N T N (l),I N (l),F N (l)
where TN , IN and FN are 𝒩-functions on X, which are called the negative truth membership
function, the negative indeterminacy membership function and the negative falsity
membership function, respectively, on X.

We note that every 𝒩n -structure XN over X satisfies the condition:
(∀ l ∈ X) −3 ≤ TN (l) + IN (l) + FN (l) ≤ 0 .
3. Application in 𝐊𝐔-Algebras :
In this section, we take a KU-algebra X as the universe of discourse unless otherwise

specified.
Definition 3.1 :
A 𝒩n -structure XN over X is called a 𝒩n -subalgebra of X if the following condition is
valid:
TN l ∗ m ≤∨ TN (l), TN (m)
(∀ l, m ∈ X) IN l ∗ m ≥∧ IN (l), IN (m) (2)
FN l ∗ m ≤∨ FN (l), FN (m)
Example 3.1 Consider a KU-algebra X = {0, a, b, c, d} with the following Cayley

table.
∗ 0 a b c D
0 0 a b c D
a 0 0 a a B
b 0 0 0 a A
c 0 0 a 0 B
d 0 0 0 0 0
The
𝒩n -structure XN =
0 a b c d
, , , , over X is a
(−0.7,−0.2,−0.6) (−0.5,−0.3,−0.4) (−0.5,−0.3,−0.4) (−0.3,−0.8,−0.5) (−0.3,−0.8,−0.5)
𝒩n -subalgebra of X.
Let XN be a 𝒩n -structure over X and let λ, μ, δ ∈ [−1,0] be such that −3 ≤ λ + μ +

δ ≤ 0. Consider the following sets:

TNλ : = l ∈ X|TN (l) ≤ λ
μ
IN : = l ∈ X|IN (l) ≥ μ
FNδ : = l ∈ X|FN (l) ≤ δ

The set
XN (λ, μ, δ): = l ∈ X|TN (l) ≤ λ, IN (l) ≥ μ, FN (l) ≤ δ
is called the (λ, μ, δ)-level set of XN . Note that
μ
XN (λ, μ, δ) = TNλ ∩ IN ∩ FNδ
Theorem 3.1 :
δ ≤ 0. If XN is a 𝒩n -subalgebra of X, then the nonempty (λ, μ, δ)-level set of XN is a
subalgebra of X.
Proof :
Let λ, μ, δ ∈ [−1,0] be such that −3 ≤ λ + μ + δ ≤ 0 and XN (λ, μ, δ) ≠ ϕ. If l, m ∈
XN (λ, μ, δ) then TN (l) ≤ λ, IN (l) ≥ μ, FN (l) ≤ δ, TN (m) ≤ λ, IN (m) ≥ μ and FN (m) ≤ δ. It
follows from Equation (2) that
TN (l ∗ m) ≤∨ TN (l), TN (m) ≤ λ
IN l ∗ m ≥∧ IN l , IN m ≥ μ, and
FN (l ∗ m) ≤∨ FN (l), FN (m) ≤ δ
Hence, l ∗ m ∈ XN (λ, μ, δ), and therefore X N (λ, μ, δ) is a subalgebra of X.
μ
Theorem 3.2 : Let XN be a 𝒩n -structure over X and assume that TNλ , IN and FNδ are
subalgebras of X for all λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0. Then XN is a
𝒩n -subalgebra of X.
Proof :
Assume that there exist p, q ∈ X such that TN (p ∗ q) >∨ TN (p), TN (q) . Then
t t
TN (p ∗ q) > t λ ≥∨ TN (p), TN (q) for some t λ ∈ [−1,0). Hence p, q ∈ TNλ but p ∗ q ∉ TNλ ,
which is a contradiction. Thus

TN (l ∗ m) ≤∨ TN (l), TN (m)
for all l, m ∈ X. If IN (p ∗ q) <∧ IN (p), IN (q) for some p, q ∈ X, then
IN (p ∗ q) < t μ <∧ IN (p), IN (q)
1 t t
where t μ : = 2 IN (p ∗ q) +∧ IN (p), IN (q) . Thus p, q ∈ INμ and p ∗ q ∉ INμ , which is a
contradiction. Therefore
IN (l ∗ m) ≥∧ IN (l), IN (m)
for all l, m ∈ X. Now, suppose that there exist p, q ∈ X and t δ ∈ [−1,0) such that
FN (p ∗ q) > t δ ≥∨ FN (p), FN (q)
Then p, q ∈ FNtδ and p ∗ q ∉ FNtδ , which is a contradiction. Hence
FN (l ∗ m) ≤∨ FN (l), FN (m)
for all l, m ∈ X. Therefore XN is a 𝒩n -subalgebra of X.
Because [−1,0] is a completely distributive lattice with respect to the usual ordering, we have
the following theorem.
Theorem 3.3 :
If XN j | j ∈ ℕ is a family of 𝒩n -subalgebras of X, then XN j | j ∈ ℕ , ⊆ forms a
complete distributive lattice.
Proposition 3.1 :
If a 𝒩n -structure XN over X is a 𝒩n -subalgebra of X, then TN (0) ≤ TN (l), IN (0) ≥
IN (l) and FN (0) ≤ FN (l), ∀l ∈ X.
Proof. Straightforward.
Theorem 3.4 :
Let XN be a 𝒩n -subalgebra of X . If there exists a sequence pi in X such that
lim TN pi = −1, lim IN pi = 0 and lim FN pi = −1, then TN (0) = −1, IN (0) = 0 and
i→∞ i→∞ i→∞
FN (0) = −1.
Proof.
By Proposition 3.1, we have TN (0) ≤ TN (l), IN (0) ≥ IN (l) and FN (0) ≤ FN (l)∀l ∈ X.

Hence TN (0) ≤ TN pi , IN pi ≤ IN (0) and FN (0) ≤ FN pi for every positive integer n. It

follows that
−1 ≤ TN (0) ≤ lim TN pi = −1
i→∞
0 ≥ IN (0) ≥ lim IN pi = 0
i→∞
−1 ≤ FN (0) ≤ lim FN pi = −1
i→∞
Hence TN (0) = −1, IN (0) = 0 and FN (0) = −1
Proposition 3.2 :
If every 𝒩n -subalgebra XN of X satisfies:
TN (l ∗ m) ≤ TN (m), IN (l ∗ m) ≥ IN (m), FN (l ∗ m) ≤ FN (m) (3)
∀l, m ∈ X,then XN is constant.
Proof :
Using (KU3) and equations (3), we have TN (l) = TN (l ∗ 0) ≤ TN (0), IN (l) = IN (l ∗ 0) ≥
IN (0) and FN (l) = FN (l ∗ 0) ≤ FN (0)∀l ∈ X. It follows from Proposition 3.1 that TN (l) =
TN (0), IN (l) = IN (0) and FN (l) = FN (0)∀l ∈ X. Therefore XN is constant.
Definition 3.2 :
A 𝒩n -structure XN over X is called a 𝒩n -ideal of X if the following assertion is valid:
TN (0) ≤ TN (l) ≤∨ TN (m ∗ l), TN (m)
(∀ l, m ∈ X) IN (0) ≥ IN (l) ≥∧ IN (m ∗ l), IN (m) (4)
FN (0) ≤ FN (l) ≤∨ FN (m ∗ l), FN (m)
Example 3.2 :
The 𝒩n -structure XN over X in Example 3.1 is a 𝒩n -ideal of X.
Proposition 3.3 :
Every 𝒩n -ideal XN of X satisfies the following assertions:
(l, m ∈ X) l ⪯ m ⇒ TN (l) ≤ TN (m), IN (l) ≥ IN (m), FN (l) ≤ FN (m) (5)
Proof :
Let l, m ∈ X be such that l ⪯ m. Then m ∗ l = 0, and so

TN (l) ≤∨ TN (m ∗ l), TN (m) =∨ TN (0), TN (m) = TN (m)

IN (l) ≥∧ IN (m ∗ l), IN (m) =∧ IN (0), IN (m) = IN (m)
FN (l) ≤∨ FN (m ∗ l), FN (m) =∨ FN (0), FN (m) = FN (m)
This completes the proof.
Proposition 3.4 :
Let XN be a 𝒩n -ideal of X. Then
(i)TN (m ∗ n) ≤ TN (n ∗ (m ∗ n)) ⇔ TN ((l ∗ m) ∗ (l ∗ n)) ≤ TN (l ∗ (m ∗ n))
(ii)IN (l ∗ m) ≥ IN (n ∗ (m ∗ n)) ⇔ IN ((l ∗ m) ∗ (l ∗ n)) ≥ IN (l ∗ (m ∗ n))
(iii) FN (l ∗ m) ≤ FN (n ∗ (m ∗ n)) ⇔ FN ((l ∗ m) ∗ (l ∗ n)) ≤ FN (l ∗ (m ∗ n)) for all
l, m, n ∈ X.
Proof. Note that

l ∗ ((l ∗ m) ∗ (l ∗ n)) ⪯ l ∗ (m ∗ n)
for all l, m, n ∈ X. Assume that TN (l ∗ m) ≤ TN (m ∗ (l ∗ m)), IN (l ∗ m) ≥ IN (m ∗ (l ∗ m))
and FN (l ∗ m) ≤ FN (m ∗ (l ∗ m)) for all l, m ∈ X. It follows from Theorem 2.1 and
Proposition 3.3 that
TN ((l ∗ m) ∗ (l ∗ n)) = TN (l ∗ ((l ∗ m) ∗ n))
≤ TN (l ∗ (l ∗ ((l ∗ m) ∗ n)))
≤ TN (l ∗ ((l ∗ m) ∗ (l ∗ n)))
≤ TN (l ∗ (m ∗ n))
IN ((l ∗ m) ∗ (l ∗ n)) = IN (l ∗ ((l ∗ m) ∗ n))
≥ IN (l ∗ (l ∗ ((l ∗ m) ∗ n)))
≥ IN (l ∗ ((l ∗ m) ∗ (l ∗ n)))
≥ IN (l ∗ (m ∗ n))
FN ((l ∗ m) ∗ (l ∗ n)) = FN (l ∗ ((l ∗ m) ∗ n))
≤ FN (l ∗ (l ∗ ((l ∗ m) ∗ n)))
≤ FN (l ∗ ((l ∗ m) ∗ (l ∗ n)))
≤ FN (l ∗ (m ∗ n))
and for all l, m ∈ X. Conversely, suppose

TN ((l ∗ m) ∗ (l ∗ n)) ≤ TN (l ∗ (m ∗ n))
IN ((l ∗ m) ∗ (l ∗ n)) ≥ IN (l ∗ (m ∗ n)) (6)
FN ((l ∗ m) ∗ (l ∗ n)) ≤ FN (l ∗ (m ∗ n))
for all l, m, n ∈ X. If we substitute l for m in Equation (6), then
TN (m ∗ n) = TN (0 ∗ (m ∗ n)) = TN ((n ∗ n) ∗ (m ∗ n)) ≤ TN (n ∗ (m ∗ n))
IN (m ∗ n) = IN (0 ∗ (m ∗ n)) = IN ((n ∗ n) ∗ (m ∗ n)) ≥ IN (n ∗ (m ∗ n))
FN (m ∗ n) = FN (0 ∗ (m ∗ n)) = FN ((n ∗ n) ∗ (m ∗ n)) ≤ FN (n ∗ (m ∗ n))

for all l, m, n ∈ X by using (KU3) and (KU5).
Theorem 3.5 :
δ ≤ 0. If XN is a 𝒩n -ideal of X, then the nonempty (λ, μ, δ)-level set of XN is an ideal of X.
Proof :
Assume that XN (λ, μ, δ) ≠ ⌀ for λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0. Clearly,
0 ∈ XN (λ, μ, δ). Let l, m ∈ X be such that m ∗ l ∈ XN (λ, μ, δ) and m ∈ XN (λ, μ, δ). Then
TN (m ∗ l) ≤ λ , IN (m ∗ l) ≥ μ, FN (m ∗ l) ≤ δ, TN (m) ≤ λ, IN (m) ≥ μ and FN (m) ≤ δ. It
follows from Equation (4) that
TN (l) ≤∨ TN (m ∗ l), TN (m) ≤ λ
IN (l) ≥∧ IN (m ∗ l), IN (m) ≥ μ
FN (l) ≤∨ FN (m ∗ l), FN (m) ≤ δ
so that l ∈ XN (λ, μ, δ). Therefore XN (λ, μ, δ) is an ideal of X.
Theorem 3.6 :
μ
Let XN be a 𝒩n -structure over X and assume that TNλ , IN and FNδ are ideals of X for all
λ, μ, δ ∈ [−1,0] with −3 ≤ λ + μ + δ ≤ 0. Then XN is a 𝒩n -ideal of X.
Proof :
If there exist p, q, r ∈ X such that TN (0) > TN (p), IN (0) < IN (q) and FN (0) > FN (r)
respectively, then TN (0) > pt ≥ TN (p), IN (0) < q i ≤ IN (q) and FN (0) > rf ≥ FN (r) for
p q r
some pt , rf ∈ [−1,0) and q i ∈ (−1,0]. Then 0 ∉ TN t , 0 ∉ INi and 0 ∉ FNf . This is a
contradiction. Hence, TN (0) ≤ TN (l), IN (0) ≥ IN (l) and FN (0) ≤ FN (l) for all l ∈ X.
Assume that there exist pt , q t , pi , q i , pf , q f ∈ X such that
TN pt >∨ TN qt ∗ pt , TN q t , IN pi <∧ IN q i ∗ pi , IN q i and FN pf >∨ FN qf ∗
pf , FN q f . Then there exist st , sf ∈ [−1,0) and si ∈ (−1,0] such that
TN pt > st ≥∨ TN q t ∗ pt , TN q t
IN pi < si ≤∧ IN q i ∗ pi , IN q i
FN pf > sf ≥∨ FN q f ∗ pf , FN q f
s s s s s s
It follows that q t ∗ pt ∈ TNt , q t ∈ TNt , q i ∗ pi ∈ INi , q i ∈ INi , q f ∗ pf ∈ FNf and q f ∈ FNf .
s s s
However, pt ∉ TNt , pi ∉ INi and pf ∉ FNf . This is a contradiction, and so

TN (l) ≤∨ TN (m ∗ l), TN (m)

IN (l) ≥∧ IN (m ∗ l), IN (m)
FN (l) ≤∨ FN (m ∗ l), FN (m)
for all l, m ∈ X. Therefore XN is a 𝒩n -ideal of X.
Proposition 3.5 :
For any 𝒩n -ideal XN of X, we have
TN l ≤∨ TN m , TN n
∀ l, m, n ∈ X ( m ∗ l ⪯ n ⇒ IN l ≥∧ IN m , IN n ) (7)
FN l ≤∨ FN m , FN n
Proof. Let l, m, n ∈ X be such that m ∗ l ⪯ n. Then n ∗ (m ∗ l) = 0, and so
TN (m ∗ l) ≤∨ TN (n ∗ (m ∗ l)), TN (n) =∨ TN (0), TN (n) = TN (n)
IN (m ∗ l) ≥∧ IN (n ∗ (m ∗ l)), IN (n) =∧ IN (0), IN (n) = IN (n)
FN (m ∗ l) ≤∨ FN (n ∗ (m ∗ l)), FN (n) =∨ FN (0), FN (n) = FN (n)
It follows that
TN (l) ≤∨ TN (m ∗ l), TN (m) ≤∨ TN (m), TN (n)
IN (l) ≥∧ IN (m ∗ l), IN (m) ≥∧ IN (m), IN (n)
FN (l) ≤∨ FN (m ∗ l), FN (m) ≤∨ FN (m), FN (n)
This completes the proof.
Remark 3.1 : In a KU-algebra, not every 𝒩n -ideal is a 𝒩n -subalgebra by the given

example.
Example 3.3 : Consider a KU-algebra X = {0,1,2,3,4} with the following Cayley
table.
∗ 0 1 2 3 4
0 0 1 2 3 4
1 0 0 2 3 4
2 0 1 0 3 3
3 0 0 2 0 2
4 0 0 0 0 0
The 𝒩n -structure XN =
0 1 2 3 4
, , , . Then XN is a 𝒩n -ideal
(−0.8,0,−1) (−0.8,−0.2,−0.9) (−0.2,−0.6,−0.5) (−0.7,−0.4,−0.7) (−0.4,−0.8,−0.3)
of X, but it is not a 𝒩n -subalgebra of X as TN (3 ∗ 4) ≤∨ {TN (3), TN (4)}.

For any elements ζt , ζj , ζf ∈ X, we consider sets:

ζ
XNt : = l ∈ X|TN (l) ≤ TN ζt
ζ
XNj : = l ∈ X|IN (l) ≥ IN ζj
ζ
XNf : = l ∈ X|FN (l) ≤ FN ζf
ζ ζ ζ
Clearly, ζt ∈ XNt , ζj ∈ XNj andζf ∈ X Nf .
Theorem 3.7 :
ζ ζ ζ
Let ζt , ζj and ζf be any elements of X. If XN is a 𝒩n -ideal of X, then XNt , XNj and XNf
are ideals of X.
Proof.
ζ ζ ζ ζ ζ ζ
Clearly, 0 ∈ X Nt , 0 ∈ XNj and 0 ∈ XNf . Let l, m ∈ X be such that m ∗ l ∈ XNt ∩ XNj ∩ XNf
ζ ζ ζ
and m ∈ XNt ∩ XNj ∩ XNf . Then
TN (m ∗ l) ≤ TN ζt , TN (m) ≤ TN ζt
IN (m ∗ l) ≥ IN ζj , IN (m) ≥ IN ζj
FN (m ∗ l) ≤ FN ζf , FN (m) ≤ FN ζf
It follows from Equation (4) that
TN (l) ≤∨ TN (m ∗ l), TN (m) ≤ TN ζt
IN (l) ≥∧ IN (m ∗ l), IN (m) ≥ IN ζj
FN (l) ≤∨ FN (m ∗ l), FN (m) ≤ FN ζf
ζ ζ ζ ζ ζ ζ
Hence l ∈ XNt ∩ XNj ∩ XNf , and therefore X Nt , XNj and XNf are ideals of X.
Theorem 3.8 : Let ζt , ζj , ζf ∈ X and let XN be a 𝒩n -structure over X. Then

ζ ζ ζ
(i) If XNt , X Nj and XNf are ideals of X, then the following assertion is valid:
TN (l) ≥∨ TN (n ∗ m), TN (n) ⇒ TN (l) ≥ TN (m)
(∀ l, m, n ∈ X) IN (l) ≤∧ IN (n ∗ m), IN (n) ⇒ IN (l) ≤ IN (m) (8)
FN (l) ≥∨ FN (n ∗ m), FN (n) ⇒ FN (l) ≥ FN (m)
(ii) If XN satisfies Equation (8) and
(∀ l ∈ X) TN (0) ≤ TN (l), IN (0) ≥ IN (l), FN (0) ≤ FN (l) (9)
ζ ζ ζ
then XNt , XNj and X Nf are ideals of X for all ζt ∈ Im TN , ζj ∈ Im IN and ζf ∈ Im FN .
ζ ζ ζ
Proof. (i) Assume that XNt , XNj and XNf are ideals of X for ζt , ζj , ζf ∈ X. Let l, m, n ∈
X be such that TN (l) ≥∨ TN (n ∗ m), TN (n) , IN (l) ≤∧ IN (n ∗ m), IN (n) and FN (l) ≥∨
ζ ζ ζ ζ ζ ζ
FN (n ∗ m), FN (n) . Then n ∗ m ∈ XNt ∩ X Nj ∩ XNf and n ∈ XNt ∩ XNj ∩ XNf , where ζt = ζj =

ζ ζ ζ
ζf = l. It follows from (I2) that m ∈ XNt ∩ XNj ∩ XNf for ζt = ζj = ζf = l. Hence TN (m) ≤
TN ζt = TN (l), IN (m) ≥ IN ζj = IN (l) and FN (m) ≤ FN ζf = FN (l).
(ii) Let ζt ∈ Im TN , ζj ∈ Im IN and ζf ∈ Im FN and suppose that XN satisfies
ζ ζ ζ
Equations (8) and (9). Clearly, 0 ∈ XNt ∩ X Nj ∩ XNf by Equation (9). Let l, m ∈ X be such that
ζ ζ ζ ζ ζ ζ
m ∗ l ∈ XNt ∩ XNj ∩ XNf and m ∈ XNt ∩ XNj ∩ XNf . Then
TN (m ∗ l) ≤ TN ζt , TN (m) ≤ TN ζt
IN (m ∗ l) ≥ IN ζj , IN (m) ≥ IN ζj
FN (m ∗ l) ≤ FN ζf , FN (m) ≤ FN ζf
which implies that ∨ TN (m ∗ l), TN (m) ≤ TN ζt ,∧ IN (m ∗ l), IN (m) ≥ IN ζj and
∨ FN (m ∗ l), FN (m) ≤ FN ζf . It follows from Equation (8) that TN ζt ≥ TN (l), IN ζj ≤
ζ ζ ζ ζ ζ ζ
IN (l) and FN ζf ≥ FN (l). Thus, l ∈ XNt ∩ XNj ∩ XNf and therefore XNt , XNj and XNf are ideals
of X.
Definition 3.3 :
A 𝒩n -ideal XN of X is said to be closed if it is a 𝒩n -subalgebra of X.
Example 3.4 :
In Example 3.1, a 𝒩n -ideal XN of X is closed because it is a 𝒩n -subalgebra of X.
Theorem 3.9 :
Let X be a KU -algebra, For any λ1 , λ2 , δ1 , δ2 ∈ [−1,0) and μ1 , μ2 ∈ (−1,0] with
X
λ1 < λ2 , δ1 < δ2 and μ1 > μ2 , let XN : = be a 𝒩n -structure over X given as
T N ,I N ,F N
follows:
λ1 ifl ∈ X+
TN : X → [−1,0], l ↦
λ2 otherwise
μ ifl ∈ X+
IN : X → [−1,0], l ↦ 1
μ2 otherwise
δ ifl ∈ X+
FN : X → [−1,0], l ↦ 1
δ2 otherwise
where X+ = {l ∈ X|0 ⪯ l}. Then XN is a closed 𝒩n -ideal of X.
Proof.
Because 0 ∈ X +, we have TN (0) = λ1 ≤ TN (l), IN (0) = μ1 ≥ IN (l) and FN (0) = δ1 ≤
FN (l) for all l ∈ X. Let l, m ∈ X. If l ∈ X+ , then
TN (l) = λ1 ≤∨ TN (m ∗ l), TN (m)

IN (l) = μ1 ≥∧ IN (m ∗ l), IN (m)
FN (l) = δ1 ≤∨ FN (m ∗ l), FN (m) .
Suppose that l ∉ X+ . If m ∗ l ∈ X+ then m ∉ X+, and if m ∈ X + then m ∗ l ∉ X+. In either
case, we have
TN (l) = λ2 =∨ TN (m ∗ l), TN (m)
IN (l) = μ2 =∧ IN (m ∗ l), IN (m)
FN (l) = δ2 =∨ FN (m ∗ l), FN (m) .
For any l, m ∈ X, if any one of l and m does not belong to X+, then
TN (m ∗ l) ≤ λ2 =∨ TN (l), TN (m)
IN (m ∗ l) ≥ μ2 =∧ IN (l), IN (m)
FN (m ∗ l) ≤ δ2 =∨ FN (l), FN (m)
If l, m ∈ X+, then m ∗ l ∈ X+. Hence
TN (m ∗ l) = λ1 =∨ TN (l), TN (m)
IN (m ∗ l) = μ1 =∧ IN (l), IN (m)
FN (m ∗ l) = δ1 =∨ FN (l), FN (m)
Therefore XN is a closed 𝒩n -ideal of X.
Proposition 3.6 :
Every closed 𝒩n -ideal XN of a KU-algebra X satisfies the following condition:
(∀ l ∈ X) TN (0 ∗ l) ≤ TN (l), IN (0 ∗ l) ≥ IN (l), FN (0 ∗ l) ≤ FN (l) (10)
Proof. Straightforward.
We provide conditions for a 𝒩n -ideal to be closed.
Theorem 3.10 :
Let X be a KU-algebra. If XN is a 𝒩n -ideal of X that satisfies the condition of Equation
(10), then XN is a 𝒩n -subalgebra and hence is a closed 𝒩n -ideal of X.
Proof.
Note that (l ∗ m) ∗ l ⪯ 0 ∗ m for all l, m ∈ X. Using Equations (7) and (10), we have
TN (l ∗ m) ≤∨ TN (l), TN (0 ∗ m) ≤∨ TN (l), TN (m)
IN (l ∗ m) ≥∧ IN (l), IN (0 ∗ m) ≥∧ IN (l), IN (m)
FN (l ∗ m) ≤∨ FN (l), FN (0 ∗ m) ≤∨ FN (l), FN (m) .
Hence XN is a 𝒩n -subalgebra and is therefore a closed 𝒩n -ideal of X.

References :
1. K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20 (1986), 87-96.
2. Y. B. Jun, K. J. Lee and S. Z. Song, 𝒩-ideals of BCK/BCI-algebras, J. Chungcheong
Math. Soc., 22 (2009) 417-437.
3. M. Khan, S. Amis, F. Smarandache and Y. B. Jun, Neutrosophic 𝒩-structures and
their applications in semigroups, Ann. Fuzzy Math. Inform., 14 (6) (2017) 583-598.
4. S. M. Mostafa, M. A. Abd-Elnaby and M. M. M. Yousef, Fuzzy ideals of
KU-algebras, International Math Forum., 6 (63) (2011) 3139-3149.
5. C. Prabpayak and U. Leerawat, On ideals and congruence in KU-algebras, Scientia
Magna Journal, 5 (1) (2009), 54-57.
6. C. Prabpayak and U. Leerawat, On isomorphisms of KU-algebras, Scientia Magna
Journal, 5 (3) (2009), 25-31.
7. F. Smarandache, A Unifying field in logics: neutrosophic logic. neutrosophy,
neutrosophic set, neutrosophic probability, American Research Press, Rehoboth, NM,
USA, (1999).
8. L. A. Zadeh, Fuzzy sets, Information and control, 8 (1965), 338-353.

CHAPTER-5
FIXED POINT RESULTS FOR CONTRACTION THEOREMS IN

NEUTROSOPHIC METRIC SPACES
S. Sowndrarajan1 , M. Jeyaraman2 and Florentin Smarandache3
1
Research Scholar, P.G.and Research Department of Mathematics, Raja Doraisingam
Govt. Arts College, Sivagangai, Affiliated to Alagappa University, Karaikudi,
Tamilnadu, India.
Email: sowndariitm@gmail.com, Orchid id:
https://orcid.org/0000-0002-0173-8889
2
P.G.and Research Department of Mathematics, Raja Doraisingam Govt. Arts
College, Sivagangai, Affiliated to Alagappa University, Karaikudi, Tamilnadu,
India.
E-mail:jeya.math@gmail.com, Orchid id : https://orcid.org/0000-0002-0364-1845
3
Department of Mathematics, University of New Mexico,
705 Gurley Avenue, Gallup, NM 87301, USA
∗Correspondence: jeya.math@gmail.com
1. Introduction
Fuzzy Sets was presented by Zadeh [23] as a class of elements with a grade
of membership.Kramosil and Michalek [11] defined new notion called Fuzzy Metric
Space (FMS). Later, manyauthors have examined the concept of fuzzy metric in various
aspects.In 1984 Kaleva andSeikkala [10] have characterized the FMS, where separation
between any two points to be posi-tive number.In particular, George and Veeramani [6,7]
redefined the concept of fuzzy metricspace with the assistance of continuous t-norm, and
continuous t-co norm. FMS has utilized inapplied science fields such as fixed point
theory, decision making, medical imaging and signalprocessing. Heilpern [9] defined
fuzzy contraction for Fixed point theorem. Park [16] de-fined Intuitionistic Fuzzy
Metric Space (IFMS) from the concept of FMS and given some fixedpoint results.Fixed
point theorems related to FMS and IFMS given by Alaca et al [2] and numerous
researchers [15,21]. In 1998, Smarandache [18] characterized the new concept called
neutrosophic logic and neutrosophic set. In the idea of neutrosophic sets, there is Tdegree

of membership, I degree of indeterminacy and F degree of non-membership. A

neutrosophic value is appeared by (T,I,F). Hence, neutrosophic logic and neutrosophic
set assistsus to brief many uncertainties in our lives. In addition, several researchers have
made significant development on this theory [26–30]. Recently, Baset et al. [3, 4]
explored the neutrosophic applications in different fields such as model for sustainable
supply chain risk
management,resourcelevellingprobleminconstructionprojects,DecisionMakingandfinan
cialperformanceevaluation of manufacturing industries. In fact, the idea of fuzzy sets
deals with only a degree of membership. In addition, the concept of intuitionistic fuzzy
set established while adding degree of non - membership with degree of membership.
But these degrees are characterized relatively one another. Therefore, neutrosophic set is
a generalized state of fuzzy and intu-itionistic fuzzy set by incorporating degree of
indeterminacy.In 2019, Kirisci et al [12, 13]defined neutrosophic metric space as a
generalization of IFMS and brings about fixed point theorems incomplete neutrosophic
metric space.
In this chapter, we investigate and prove some contract iontheorems that are
extended to neutrosophic metric space with the assistance of Grabiec[8].
2. Preliminaries :
Definition 2.1 [17] :
Let Σ be a non-empty fixed set. A Neutrosophic Set (NS for short) Nin Σis
an object having the form N = {⟨a, ξN (a), ρN (a), ʋN (a)⟩: a ∈Σ} where the
functionsξN (a), ρN (a) and ʋN (a) represent the degree of membership, degree of in
determinacy and the degree of non-membership respectively of each element a∈N
to the set Σ.
A neutrosophic set N={⟨a,ξN(a),ρN(a),ʋN(a)⟩:a∈ Σ}is expressed as an ordered
triple N=⟨a,ξN(a),ρN(a),ʋN(a)⟩inΣ.
In NS, there is norestrictionon(ξN(a),ρN(a),ʋN(a))otherthantheyaresubsetsof
]− 0,1+ [
Remark2.2 [10] : Neutrosophic Set Nis included in another Neutrosophic set Ґ(N
⊆Ґ)if and only if

inf ξN (a) ≤ infξҐ(a) sup ξN (a) ≤ sup ξ Ґ(a)

infρN(a)≥infρҐ(a)supρN(a)≥supρҐ(a)
infʋN(a)≥infʋҐ(a)supʋN(a)≥supʋҐ(a)
Triangular Norms (TNs) were initiated by menger. Triangular conforms (TCs) known
sasdual operations of triangular norms (TNs).
Definition: 2.3 [4]

A binary operation * : [0, 1] x [0, 1] → [0, 1] is a continuous t-norm [CTN] if it satisfies
the following conditions :
(i) * is commutative and associative,
(ii) * is continuous,
(c) 𝜀 1*1 = 𝜀 1 for all 𝜀 1∈ [0, 1],
(d) 𝜀 1* 𝜀 2 ≤ 𝜀 3*𝜀 4 whenever 𝜀 1 ≤ 𝜀 3 and 𝜀 2 ≤ 𝜀 4 , for each 𝜀 1, 𝜀 2, 𝜀 3, 𝜀 4∈ [0, 1].
Definition: 2.4 [4]

A binary operation ⋄ : [0, 1] x [0, 1] → [0, 1] is a continuous t-conorm [CTC] if it
satisfies the following conditions :
(i) ⋄ is commutative and associative,
(ii) ⋄ is continuous,
(c) 𝜀 1⋄0 = 𝜀 1 for all 𝜀 1∈ [0, 1],
(d) 𝜀 1⋄ 𝜀 2 ≤ 𝜀 3⋄ 𝜀 4 whenever 𝜀 1≥𝜀 3 and 𝜀 2 ≥𝜀 4 , for each 𝜀 1, 𝜀 2, 𝜀 3 and 𝜀 4∈ [0,
1].
Remark 2.5 :
From the definitions of CTN and CTC, we note that if we take 0<ε1, ε2<1f or
ε1<ε2 then there exist 0<ε3, ε4<1 such that ε1*ε3≥ ε2 and ε1≥ ε2⬦ε4.
Further we chooseε5∈(0,1)then there exists ε6,ε7∈(0,1) such that ε6*ε6≥ε5 and
ε7⬦ε7≤ε5.
Definition 2.6 : [13]
A Sequence {tn} is called -non- decreasing sequence if there exists m0∈N such
thattm≤tm+1forallm>m0.

2. Neutrosophic Metric Space :
In this section, we apply neutrosophic theory to generalize the Intuitionistic fuzzy

metric space. We also discuss some properties and examplesinit.
Definition 3.1:
A 6-tuple (Σ, Ξ, Θ, Υ,∗,⋄) iscalled Neutrosophic Metric Space(shortly NMS), if Σ is an
arbitrary non empty set, ∗ is a neutrosophic CTN, ⋄ is a neutrosophic CTCand Ξ, Θ 𝑎𝑛𝑑 Υ are
neutrosophic sets on Σ3 × ℝ+satisfying the following conditions:
For all 𝜁, 𝜂,𝜔 ∈ Σ, 𝜆 ∈ ℝ+ .
(i) 0 ≤ Ξ ( 𝜁, 𝜂, 𝜆) ≤ 1; 0 ≤ Θ ( 𝜁, 𝜂, 𝜆) ≤ 1; 0 ≤ Υ ( 𝜁, 𝜂, 𝜆) ≤ 1;
(ii) Ξ ( 𝜁, 𝜂, 𝜆) + Θ ( 𝜁, 𝜂, 𝜆) + Υ ( 𝜁, 𝜂, 𝜆) ≤ 3;
(iii) Ξ ( 𝜁, 𝜂, 𝜆) = 1 if and only if 𝜁 = 𝜂 = 𝛿;
(iv) Ξ ( 𝜁, 𝜂, 𝜆) = Ξ(𝜂,𝜁, 𝜆), for all 𝜆 > 0;
(v) Ξ ( 𝜁, 𝜔, 𝜆)∗ Ξ ( 𝜔,𝜂, 𝜇) ≤ Ξ ( 𝜁, 𝜂, 𝜆 + 𝜇), for all 𝜆 , 𝜇> 0;
(vi) Ξ ( 𝜁, 𝜂, 𝛿, .) : [ 0, ∞ ) → [ 0 , 1] is neutrosophic continuous ;
lim
(vii) 𝜆→∞
Ξ ( 𝜁, 𝜂, 𝜆) = 1 for all 𝜆 > 0;
(viii) Θ ( 𝜁, 𝜂, 𝜆) = 0 if and only if 𝜁 = 𝜂 = 𝛿;
(ix) Θ ( 𝜁, 𝜂, 𝜆) = Θ(𝜂,𝜁, 𝜆) for all 𝜆 > 0;
(x) Θ ( 𝜁, 𝜔, 𝜆) ⋄ Θ ( 𝜔, 𝜂, 𝜇) ≥ Θ ( 𝜁, 𝜂, 𝜆 + 𝜇), for all 𝜆 , 𝜇 > 0;
(xi) Θ ( 𝜁, 𝜂, .) : [ 0, ∞ ) → [ 0 , 1] is neutrosophic continuous ;
lim
(xii) 𝜆→∞
Θ ( 𝜁, 𝜂, 𝜆) = 0 for all 𝜆 > 0;
(xiii) Υ ( 𝜁, 𝜂, 𝜆) = 0 if and only if 𝜁 = 𝜂
(xiv) Υ ( 𝜁, 𝜂, 𝜆) = Υ(𝜂,𝜁, 𝜆), for all 𝜆 > 0;
(xv) Υ ( 𝜁, 𝜔, 𝜆) ⋄ Υ ( 𝜔, 𝜂, 𝜇) ≥ Υ ( 𝜁, 𝜂, 𝜆 + 𝜇), for all 𝜆 , 𝜇 > 0;
(xvi) Υ( 𝜁, 𝜂, .) : [ 0, ∞ ) → [ 0 , 1] is neutrosophic continuous ;
lim
(xvii) 𝜆→∞
Υ ( 𝜁, 𝜂, 𝜆) = 0 for all 𝜆 > 0;
(xviii) If 𝜆 > 0 then Ξ ( 𝜁, 𝜂, 𝜆) = 0 ; Θ ( 𝜁, 𝜂, 𝜆) = 1 ; Υ ( 𝜁, 𝜂, 𝜆) = 1.
Then, (Ξ, Θ, Υ) is called an Neutrosophic sets on Σ.The functionΞ, Θ 𝑎𝑛𝑑 Υdenote degree of
closedness, neturalness and non-closedness between 𝜁 𝑎𝑛𝑑 𝜂 with respect to 𝜆 respectively.

Example 3.2 :
Let (Σ, d) be a metric space. Define 𝜁 ∗ 𝜂 = min { 𝜁, 𝜂 } and 𝜁 ⋄ 𝜂 = max { 𝜁, 𝜂} and
Ξ, Θ, Υ : Σ3 × ℝ+→ [ 0 , 1] defined by, we define
𝜆 𝑑 (𝜁 ,𝜂,𝜆 ) 𝑑 (𝜁 ,𝜂,𝜆 )
Ξ ( 𝜁, 𝜂, 𝜆) = ; Θ ( 𝜁, 𝜂, 𝜆) = ; Υ ( 𝜁, 𝜂, 𝜆) = for all 𝜁,
𝜆 + 𝑑 (𝜁 ,𝜂,𝜆 ) 𝜆 + 𝑑 (𝜁,𝜂 ,𝜆) 𝜆
𝜂 ∈ Σ and 𝜆 > 0. Then (Σ, Ξ, Θ, Υ,∗,⋄) is called NMS induced by a metric „d‟ the standard
neutrosophic metric.
Example 3.3 :
If we take Σ = ℕ, consider the CTN, CTC are 𝜁 ∗ 𝜂 = min { 𝜁, 𝜂 } and 𝜁 ⋄ 𝜂 = max
{ 𝜁, 𝜂}, Ξ, Θ, Υ : Σ3 × ℝ+→ [ 0 , 1] defined by
𝜁
𝑖𝑓 𝜁 ≤ 𝜂
𝜂
Ξ(𝜁, 𝜂 , 𝜆) = 𝜂
𝑖𝑓 𝜂 ≤ 𝜁
𝜁
𝜂 −𝜁
𝑖𝑓 𝜁 ≤ 𝜂
𝜂
Θ(𝜁, 𝜂 , 𝜆) = 𝜁 −𝜂
𝑖𝑓 𝜂 ≤ 𝜁
𝜁
𝜂 − 𝜁 𝑖𝑓 𝜁 ≤ 𝜂
Υ(𝜁, 𝜂 , 𝜆) =
𝜁 − 𝜂 𝑖𝑓 𝜂 ≤ 𝜁
for all 𝜁, 𝜂 ∈ Σ and 𝜆 > 0. Then (Σ, Ξ, Θ, Υ,∗,⋄) is called NMS.
Remark 3.4 :
In Neutrosophic metric space, Ξ ( 𝜁 , 𝜂 , .) is non-decreasing , Θ ( 𝜁 , 𝜂 , .) is
non-increasing and Υ ( 𝜁, 𝜂, .) is decreasing for all 𝜁, 𝜂 ∈ Σ.
Definition 3.5 : Let(Σ, Ξ, Θ, Υ,∗,⋄) beneutrosophicmetricspace.Then
(a) asequence{𝜁 n}inΣisconvergingtoapoint𝜁∈Σifforeach𝜆>0
limλ→∞Ξ(𝜁, 𝜂, 𝜆)=1; limλ→∞Θ(𝜁, 𝜂, 𝜆)=0; limλ→∞Υ(𝜁, 𝜂, 𝜆)=0.
(b) A sequence{𝜁 n}in Σ is said to be Cauchy if for each ε >0 and λ>0 there exist
N∈ℕ such that Ξ(𝜁 n, 𝜁 m,𝜆)>1−ε;Θ(𝜁 n, 𝜁 m,𝜆)<ε;Υ(𝜁 n, 𝜁 m,𝜆)<ε for all n, m≤N.
(c) (Σ, Ξ, Θ, Υ,∗,⋄) is said to be complete neutrosophic metric space if every

Cauchy sequence is convergent.
(d) (Σ, Ξ, Θ, Υ,∗,⋄) is called compact neutrosophic metric space if every Cauchy

sequence contains conver gent subsequence.
3. Main Results :
Theorem 4.1 : (Neutrosophic Banach Contraction Theorem)
Let(Σ, Ξ, Θ, Υ,∗,⋄) be a compl et e neutrosophicmetricspace. Let 𝐹: Σ → Σ be a
function satisfying Ξ(𝐹𝜁, 𝐹𝜂, 𝜆) ≥ Ξ(𝜁, 𝜂, 𝜆); Θ (𝐹𝜁, 𝐹𝜂, 𝜆) ≤ Θ (𝜁, 𝜂, 𝜆); Υ (𝐹𝜁,
𝐹𝜂, 𝜆) ≤ Υ (𝜁, 𝜂, 𝜆) (4.1.1) for all 𝜁, 𝜂 ∈ Σ and 0 < k < 1. The 𝐹 has fixed point.
Proof:
Let 𝜁 ∈ Σ and {𝜁 n} = 𝐹 n(𝜁) for all 𝑛 ∈ ℕ. By mathematical induction, we obtain
𝜆
Ξ(𝜁 n, 𝜁 n+1, 𝜆) ≥ Ξ(𝜁 n, 𝜁 n+1 , );
𝑘𝑛
𝜆
Θ (𝜁 n, 𝜁 n+1 , 𝜆) ≤ Θ (𝜁 n, 𝜁 n+1 , 𝑘𝑛
); (4.1.2)
𝜆
Υ (𝜁 n, 𝜁 n+1 , 𝜆) ≤ Υ (𝜁 n, 𝜁 n+1 , );
𝑘𝑛
for all n >0 and 𝜆 > 0. Thus for any non negative integer p , we have
𝜆 𝜆
Ξ(𝜁 n, 𝜁 n+1 , 𝜆) ≥ Ξ(𝜁 n, 𝜁 n+1 , ) *…(p - times) …* Ξ(𝜁 n+p-1, 𝜁 n+p , );
𝑘𝑛 𝑘𝑛
𝜆 𝜆
≥ Ξ(𝜁, 𝜁 1 , ) *…(p - times) …* Ξ(𝜁, 𝜁 1 , );
𝑝𝑘 𝑛 𝑝𝑘 𝑛 +−𝑝 −1
𝜆 𝜆
Θ (𝜁 n, 𝜁 n+1 , 𝜆) ≤Θ (𝜁 n, 𝜁 n+1 , ) ⋄…(p - times) …⋄ Θ (𝜁 n+p-1, 𝜁 n+p , );
𝑘𝑛 𝑘𝑛
𝜆 𝜆
≤Θ (𝜁, 𝜁 1 , ) ⋄…(p - times) …⋄ Θ (𝜁, 𝜁 1 , );
𝜆 𝜆
Υ (𝜁 n, 𝜁 n+1 , 𝜆) ≤ Υ (𝜁 n, 𝜁 n+1 , ) ⋄…(p - times) …⋄ Υ (𝜁 n+p-1, 𝜁 n+p , );
𝑘𝑛 𝑘𝑛
𝜆 𝜆
≤ Υ (𝜁, 𝜁 1 , ) ⋄…(p - times) …⋄ Υ (𝜁, 𝜁 1 , );
by (4.1.2) and the definition of NMS conditions, we get

limn→∞Ξ(𝜁 n, 𝜁 n+p , 𝜆) ≥ 1 *…(p - times) …*1 = 1,
limn→∞Θ (𝜁 n, 𝜁 n+p , 𝜆) ≤ 0 ⋄…(p - times) …⋄ 0 = 0,
limn→∞Υ (𝜁 n, 𝜁 n+p , 𝜆) ≤ 0 ⋄…(p - times) …⋄ 0 = 0.
Therefore, {𝜁 n} is a Cauchy sequence and it is convergent to a limit, let the limit
point is 𝜂 .
Thus, we get
𝜆 𝜆
Ξ(𝐹𝜂, 𝜂, 𝜆) ≥ Ξ(𝐹𝜂, F𝜁 n , 2) * Ξ(𝜁 n+1, 𝜂, 2) ;

𝜆 𝜆
≥ Ξ(𝜂, 𝜁 n , ) * Ξ(𝜁 n+1, 𝜂, )
2𝑘 2
→ 1 ∗ 1 = 1,
𝜆 𝜆
Θ (𝐹𝜂, 𝜂, 𝜆) ≤ Θ (𝐹𝜂, F𝜁 n , 2) ⋄ Θ (𝜁 n+1, 𝜂, 2) ;
𝜆 𝜆
≤ Θ (𝜂, 𝜁 n , ) ⋄ Θ (𝜁 n+1, 𝜂, 2)
2𝑘
→ 0 ∗ 0 = 0,
𝜆 𝜆
Υ (𝐹𝜂, 𝜂, 𝜆) ≤ Υ (𝐹𝜂, F𝜁 n , 2) ⋄ Υ (𝜁 n+1, 𝜂, 2) ;
𝜆 𝜆
≤ Υ (𝜂, 𝜁 n , ) ⋄ Υ (𝜁 n+1, 𝜂, 2)
2𝑘
→ 0 ∗ 0 = 0.
Since, we see that
Ξ(𝜁, 𝜂, 𝜆)=1 iff 𝜁 = 𝜂; Θ (𝜁, 𝜂, 𝜆)=0 iff 𝜁 = 𝜂; Υ (𝜁, 𝜂, 𝜆)=0 iff 𝜁 = 𝜂;
we get 𝐹𝜂 = 𝜂, which is a fixed point of Neutrosophic metric space (Σ, Ξ, Θ, Υ,∗,⋄) .
To show the uniqueness, let us assume that 𝐹𝜔 = 𝜔 for some 𝜔 ∈ Σ.
𝜆 𝜆 𝜆
1 ≥ Ξ(𝜁, 𝜂, 𝜆) = Ξ(𝐹𝜁, 𝐹𝜂, 𝜆)≥Ξ(𝜁, 𝜂, 𝑘 ) = Ξ(𝐹𝜂, 𝐹𝜔, 𝑘 ) ≥ Ξ(𝜁, 𝜂, 𝑘 2 )
𝜆
≥ ⋯ ≥ Ξ(𝜁, 𝜂, 𝑘 𝑛 ) → 1 as 𝑛 → ∞
𝜆 𝜆 𝜆
1 ≤Θ(𝜁, 𝜂, 𝜆) = Θ(𝐹𝜁, 𝐹𝜂, 𝜆)≤Θ(𝜁, 𝜂, ) = Θ(𝐹𝜂, 𝐹𝜔, ) ≤ Θ(𝜁, 𝜂, )
𝑘 𝑘 𝑘2
𝜆
≤ ⋯ ≤ Θ(𝜁, 𝜂, 𝑘 𝑛 ) → 1 as 𝑛 → ∞
𝜆 𝜆 𝜆
1 ≤Υ (𝜁, 𝜂, 𝜆) = Υ (𝐹𝜁, 𝐹𝜂, 𝜆)≤Υ (𝜁, 𝜂, 𝑘 ) = Υ (𝐹𝜂, 𝐹𝜂, 𝑘 ) ≤ Υ (𝜁, 𝜂, 𝑘 2 )
𝜆
≤ ⋯ ≤ Υ (𝜁, 𝜂, 𝑘 𝑛 ) → 1 as 𝑛 → ∞
From the definition of NMS, we get 𝜂 = 𝜔. Therefore F has a unique fixed point.
Lemma 4.2 :
(a). limn→∞ 𝜁 n = 𝜁 and limn→∞ 𝜂n =𝜂, then
Ξ(𝜁, 𝜂, 𝜆 − 𝜀) ≤ limn→∞ inf Ξ(𝜁 n , 𝜂n, 𝜆)
Θ (𝜁, 𝜂, 𝜆 − 𝜀) ≥ limn→∞ sup Θ (𝜁 n , 𝜂n, 𝜆)
Υ (𝜁, 𝜂, 𝜆 − 𝜀) ≥ limn→∞ sup Υ (𝜁 n , 𝜂n, 𝜆)
(b). limn→∞ 𝜁 n = 𝜁 and limn→∞ 𝜂n =𝜂, then
Ξ(𝜁, 𝜂, 𝜆 + 𝜀) ≥ limn→∞ sup Ξ(𝜁 n , 𝜂n, 𝜆)
Θ (𝜁, 𝜂, 𝜆 + 𝜀) ≤ limn→∞ inf Θ (𝜁 n , 𝜂n, 𝜆)
Υ (𝜁, 𝜂, 𝜆 + 𝜀) ≤ limn→∞ inf Υ (𝜁 n , 𝜂n, 𝜆)

for all 𝜆 > 0 and 0 <𝜀<𝜆 .

Proof for (a): By the definition of NMS, we get
𝜀 𝜀
Ξ(𝜁 n, 𝜂n , 𝜆) ≥ Ξ(𝜁 n, 𝜁, 2) ∗ Ξ(𝜁, 𝜂, 𝜆 − 𝜀) ∗ Ξ(𝜂, 𝜂n, 2)
lim n→∞ infΞ(𝜁 n, 𝜂n , 𝜆) ≥ 1 ∗ Ξ(𝜁, 𝜂, 𝜆 − 𝜀) ∗ 1

Hence, lim n→∞ infΞ(𝜁 n, 𝜂n , 𝜆) ≥ Ξ(𝜁, 𝜂, 𝜆 − 𝜀)
𝜀 𝜀
Θ (𝜁 n, 𝜂n , 𝜆) ≤ Θ (𝜁 n, 𝜁, 2) ⋄ Θ (𝜁, 𝜂, 𝜆 − 𝜀)⋄ Θ (𝜂, 𝜂n, 2)
lim n→∞ supΘ (𝜁 n, 𝜂n , 𝜆) ≤ 1 ⋄ Θ (𝜁, 𝜂, 𝜆 − 𝜀) ⋄ 1

Hence, lim n→∞ supΘ (𝜁 n, 𝜂n , 𝜆) ≤ Θ (𝜁, 𝜂, 𝜆 − 𝜀)
𝜀 𝜀
Υ (𝜁 n, 𝜂n , 𝜆) ≤ Υ (𝜁 n, 𝜁, 2) ⋄ Υ(𝜁, 𝜂, 𝜆 − 𝜀)⋄ Υ (𝜂, 𝜂n, 2)
lim n→∞ supΥ (𝜁 n, 𝜂n , 𝜆) ≤ 1 ⋄ Υ (𝜁, 𝜂, 𝜆 − 𝜀) ∗ 1

Hence, lim n→∞ supΥ (𝜁 n, 𝜂n , 𝜆) ≤ Υ (𝜁, 𝜂, 𝜆 − 𝜀).
Proof for (b): By the definition of NMS, we get
𝜀 𝜀
Ξ(𝜁, 𝜂, 𝜆 + 𝜀) ≥ Ξ(𝜁,𝜁 n, 2) ∗ Ξ(𝜁 n, 𝜂n,𝜀) ∗ Ξ(𝜂n𝜂, 2)
Hence, Ξ(𝜁, 𝜂, 𝜆 + 𝜀) ≥ lim n→∞ sup Ξ(𝜁 n, 𝜂n , 𝜀)

𝜀 𝜀
Θ (𝜁, 𝜂, 𝜆 + 𝜀) ≤ Θ (𝜁,𝜁 n, 2) ⋄ Θ (𝜁 n, 𝜂n,𝜀)⋄ Θ (𝜂n𝜂, 2)
Hence, Θ (𝜁, 𝜂, 𝜆 + 𝜀) ≤ lim n→∞ infΘ (𝜁 n, 𝜂n , 𝜀)

𝜀 𝜀
Υ (𝜁, 𝜂, 𝜆 + 𝜀) ≤ Υ (𝜁,𝜁 n, 2) ⋄ Υ (𝜁 n, 𝜂n,𝜀)⋄ Υ (𝜂n𝜂, 2)
Hence, Υ (𝜁, 𝜂, 𝜆 + 𝜀) ≤ lim n→∞ infΥ (𝜁 n, 𝜂n , 𝜀)
Corollary 4.3 limn→∞ 𝜁 n = 𝜁 and limn→∞ 𝜂n =𝜂, then
(a) Ξ(𝜁, 𝜂, 𝜆) ≤ limn→∞ inf Ξ(𝜁 n , 𝜂n, 𝜆)

Θ (𝜁, 𝜂, 𝜆) ≥ limn→∞ sup Θ (𝜁 n , 𝜂n, 𝜆)
Υ (𝜁, 𝜂, 𝜆) ≥ limn→∞ sup Υ (𝜁 n , 𝜂n, 𝜆) (4.3.1)
(b) Ξ(𝜁, 𝜂, 𝜆) ≤ limn→∞ sup Ξ(𝜁 n , 𝜂n, 𝜆)

Θ (𝜁, 𝜂, 𝜆) ≥ limn→∞ inf Θ (𝜁 n , 𝜂n, 𝜆)
Υ (𝜁, 𝜂, 𝜆) ≥ limn→∞ inf Υ (𝜁 n , 𝜂n, 𝜆) (4.3.2)
for all 𝜆 > 0 and 0 <𝜀<𝜆 .
Theorem 4.4 : (Neutrosophic Edelstein Contraction Theorem)

Let( Σ, Ξ, Θ, Υ,∗,⋄ ) be a com pact neutrosophicmetricspace. Let 𝐹: Σ → Σ be a
function satisfying
Ξ(𝐹𝜁, 𝐹𝜂,. ) ≥ Ξ(𝜁, 𝜂, . ); Θ (𝐹𝜁, 𝐹𝜂,. ) ≤ Θ (𝜁, 𝜂,. ); Υ (𝐹𝜁, 𝐹𝜂,. ) ≤ Υ (𝜁, 𝜂,. )
(4.4.1)
for all 𝜁, 𝜂 ∈ Σ and 0 < k < 1. The 𝐹 has fixed point.
Proof : Let 𝜁 ∈ Σ and {𝜁 n} = 𝐹 n(𝜁) for all 𝑛 ∈ ℕ. Assume 𝜁 n ≠ 𝜁 n+1 (If not 𝜁 n =
𝐹(𝜁 n) for 𝜁 n ≠ 𝜁 n+1 ), For otherwise , we get
Ξ(𝜁 n, 𝜁 n+1 , .) ≥ Ξ(𝜁 m, 𝜁 m+1 , . )> Ξ(𝜁 m-1,𝜁 m, . )> … > Ξ(𝜁 n, 𝜁 n+1 , . )
Θ (𝜁 n, 𝜁 n+1 , .) ≤ Θ (𝜁 m, 𝜁 m+1 , . )<Θ (𝜁 m-1, 𝜁 m, . )< … <Θ (𝜁 n, 𝜁 n+1 , . )
Υ (𝜁 n, 𝜁 n+1 , .) ≤ Υ (𝜁 m, 𝜁 m+1 , . )<Υ (𝜁 m-1, 𝜁 m, . )< … <Υ (𝜁 n, 𝜁 n+1 , . )
where m > n, which is a contradiction. Since Σ is compact set, {𝜁 n} has convergent
subsequence {𝜁𝑛𝑖 }. Let limi→∞ limn→∞𝜁𝑛𝑖 , Also we suume that 𝜂such that
F 𝜂 ∈ {𝜁𝑛𝑖 ; 𝑖 ∈ ℕ }.
According to the above assumption, we may now write,

Ξ(𝐹𝜁𝑛𝑖 , 𝐹𝜂,.) ≥ Ξ(𝜁𝑛𝑖 , 𝜂, . ); Θ(𝐹𝜁𝑛𝑖 , 𝐹𝜂,.) ≤ Θ(𝜁𝑛𝑖 , 𝜂,. ); Υ(𝐹𝜁𝑛𝑖 , 𝐹𝜂,.) ≤ Υ(𝜁𝑛𝑖 ,
𝜂,. ).
for all 𝑖 ∈ ℕ . Then by equation (4.3.1), we obtain
lim inf Ξ(𝐹𝜁𝑛𝑖 , 𝐹𝜂, 𝜆) ≥ Ξ(𝜁𝑛𝑖 , 𝜂, 𝜆) = Ξ(𝜂, 𝜂, 𝜆) = 1,
lim supΘ (𝐹𝜁𝑛𝑖 , 𝐹𝜂, 𝜆) ≤ Θ (𝜁𝑛𝑖 , 𝜂, 𝜆) = Θ (𝜂, 𝜂, 𝜆) = 0,
lim supΥ (𝐹𝜁𝑛𝑖 , 𝐹𝜂, 𝜆) ≤ Υ (𝜁𝑛𝑖 , 𝜂, 𝜆) = Υ (𝜂, 𝜂, 𝜆) = 0.
for each 𝜆 > 0. Hence
lim 𝐹𝜁𝑛𝑖 = F𝜂 (4.4.2)
Similarly,
lim 𝐹 2 𝜁𝑛𝑖 = lim 𝐹 2 𝜂 (4.4.3)
(we recall that lim 𝐹𝜁𝑛𝑖 = F𝜂for all𝑖 ∈ ℕ ), Now we observe that,
Ξ(𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) ≤ Ξ(𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆) ≤… ≤ Ξ(𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆)
≤ Ξ(𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆) ≤… ≤ Ξ(𝐹𝜁𝑛𝑖+1 , 𝐹 2 𝜁𝑛𝑖+1 , 𝜆) ≤ 1,
Θ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) ≥ Θ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆) ≥ … ≥ Θ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆)
≥ Θ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆) ≥ … ≥ Θ (𝐹𝜁𝑛𝑖+1 ,
𝐹 2 𝜁𝑛𝑖+1 , 𝜆) ≥ 0,
Υ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) ≥ Υ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆) ≥ … ≥ Υ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆)
≥ Υ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆) ≥ … ≥ Υ (𝐹𝜁𝑛𝑖+1 ,

𝐹 2 𝜁𝑛𝑖+1 , 𝜆) ≥ 0,
for all 𝜆 > 0. Thus { Ξ(𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) }, {Θ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) }, {Υ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) } and
{ Ξ(𝐹𝜁𝑛𝑖+1 , 𝐹 2 𝜁𝑛𝑖+1 , 𝜆) } are convergent to a common limit point.
So by equations (4.3.1), (4.3.2) and (4.4.1), we get,

Ξ(𝜂,𝐹𝜂, 𝜆) ≥ lim sup Ξ(𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) = lim sup Ξ(𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆)
≥ lim inf Ξ(𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆)
≥ Ξ(𝐹𝜂, 𝐹 2 𝜂, 𝜆)
Θ (𝜂,𝐹𝜂, 𝜆) ≤ lim sup Θ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) = lim sup Θ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆)

≤ lim inf Θ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆)
≤ Θ (𝐹𝜂, 𝐹 2 𝜂, 𝜆)
Υ (𝜂,𝐹𝜂, 𝜆) ≤ lim sup Υ (𝜁𝑛𝑖 , 𝐹𝜁𝑛𝑖 , 𝜆) = lim sup Υ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆)

≤ lim inf Υ (𝐹𝜁𝑛𝑖 , 𝐹 2 𝜁𝑛𝑖 , 𝜆)
≤ Υ (𝐹𝜂, 𝐹 2 𝜂, 𝜆)
for all 𝜆 > 0. Suppose 𝜂 ≠ 𝐹𝜂, By equation (4.4.1)
Ξ(𝜂, 𝐹𝜂,. ) ≥ Ξ(𝐹𝜂, 𝐹 2 𝜂, . ); Θ (𝜂,𝐹𝜂, 𝜆) ≤ Θ 𝐹𝜂, 𝐹 2 𝜂, 𝜆 ; Υ (𝜂,𝐹𝜂, 𝜆) ≤ Υ (𝐹𝜂,
𝐹 2 𝜂, 𝜆)
which is a contradiction, because all the above functions are left continuous, non–
decreasing and right continuous, non-increasing respectively. Hence 𝜂 = 𝐹𝜂
isafixedpoint.
To prove the uniqueness so the fixed point, let us consider F(𝜁)=ω for some 𝜁∈Σ.
Then,
𝜆 𝜆 𝜆
1 ≥ Ξ(𝜁,ω, 𝜆) = Ξ(𝐹𝜁,Fω, 𝜆) ≥ Ξ(𝜁,ω, ) = Ξ(𝐹𝜁,ω, ) ≥…≥ Ξ(𝜁,ω, ),
𝑘 𝑘 𝑘𝑛
𝜆 𝜆 𝜆
0 ≤ Θ (𝜁,ω, 𝜆) = Θ (𝐹𝜁,Fω, 𝜆) ≤Θ (𝜁,ω, ) = Θ (𝐹𝜁,ω, ) ≤…≤Θ (𝜁,ω,
𝑘 𝑘 𝑘𝑛
),
𝜆 𝜆 𝜆
0 ≤ Υ (𝜁,ω, 𝜆) = Υ (𝐹𝜁,Fω, 𝜆) ≤Υ (𝜁,ω, ) = Υ (𝐹𝜁,ω, ) ≤…≤Υ (𝜁,ω,
𝑘 𝑘 𝑘𝑛
).
𝜆
Now, we easily verify that, {𝑘 𝑛 } is an s – increasing sequence, then by
assumption for a given ε ∈ (0, 1), there exists 𝑛0 ∈ ℕ such that,

𝜆 𝜆 𝜆
Ξ(𝜁,ω, ) ≥ 1 – ε ; Θ (𝜁,ω, ) ≤ ε ; Υ (𝜁,ω, ) ≤ ε.
𝑘𝑛 𝑘𝑛 𝑘𝑛
Clearly,
𝜆 𝜆 𝜆
lim n → ∞ Ξ(𝜁,ω, ) = 1; lim n → ∞ Θ (𝜁,ω, ) = 0; lim n → ∞ Υ (𝜁,ω, )=
𝑘𝑛 𝑘𝑛 𝑘𝑛
0;
Therefore,
Ξ(𝜁,ω, 𝜆) = 1; Θ (𝜁,ω, 𝜆) = 0; Υ (𝜁,ω, 𝜆) = 0. Thus 𝜂 = 𝜔. Hence Proved.
4. Conclusion:
In this study, we have in vestigated the concept of Neutrosophic Metric Space and its
properties. We have proved fixed point results for contraction theorems in the setting of
neutrosophic metric Space. There is a scope to establish many fixed point results in the are
as such as fuzzy metric, generalized fuzzy metric, bipolar and partial fuzzy metric spaces
by using the concept of Neutrosophic Set.
References :
1. Atanassov K,Intuition is ticFuzzy Sets. Fuzzy Sets Syst, 1986,20,87-96.

2. Alaca,C.,TurkogluD.,YildizC.Fixedpointsinintuitionisticfuzzymetricspaces,Cha
osSolitonsandFractals, 2006,29,1073–1078.
3. Abdel-Basset, M., Gamal, A., Son, L. H., and Smarandache, F. A Bipolar
Neutrosophic Multi Criteria Decision Making Framework for Professional
Selection. Applied Sciences, 2020, 10, (4),121 -132
4. Abdel-Basset, M., Mohamed, R., Sallam, K., and Elhoseny, M, A novel
decision-making model
forsustainablesupplychainfinanceunderuncertaintyenvironment.JournalofCleane
rProduction, 2002, 122- 134.
5. EdelsteinM.Onfixedandperiodicpointsundercontractivemappings.JLondonMath
Soc1962, 37,74–90.
6. George A,Veeramani P. On some results in fuzzy metric spaces. Fuzzy Sets Syst
1994, 64,395–399.

7. George A,Veeramani P. On some results of analysis for fuzzy metric spaces.

Fuzzy Sets Syst1997,90,365–368.
8. Grabiec M.Fixed points in fuzzy metric spaces. Fuzzy Sets Syst1988, 27,385–399.
9. Heilpern, S.Fuzzy mappings and fixed point theorems, JMathAnalAppl, 1981,
83, 566–569.
10. KalevaO, SeikkalaS. On fuzzy metric spaces. Fuzzy Sets Syst 1984,12,225–229.
11. KramosilO, MichalekJ. Fuzzy metric and statistical metric spaces.
Kybernetika1975,11,326–334.
12. Kirisci M, SimsekN.Neutrosophicmetricspaces.arXiv:1907.00798.
13. KirisciM., Simsek N., AkyigitM. Fixed point results for anew metric space.
Mathematical Method sin the Applied Sciences (to appear).
14. Menger,K.M.Statistical metrics,ProcNatAcadSci,1942,28,535–537.
15. Mohamad, A.Fixed-point theorems inintuitionistic fuzzy metric spaces, Chaos
Solitons and Fractals, 2004, 34, 1689–1695.
16. Park JH.Intuitionistic fuzzy metric spaces. Chaos, Solitons and Fractals 2004,
22, 1039–1046.
17. Smarandache, F.A Unifying Field in Logics, Neutrosophy:Neutrosophic
Probability, Set andLogic; American Research Press:Rehe
both,MA,USA,1998.
18. Smarandache,F.Neutrosophy:NeutrosophicProbability,SetandLogic;ProQuestIn
formationandLearn-ing:AnnArbor,MI,USA,1998;105
19. Smarandache,F. Neutrosophicset, ageneralisation of the intuitionistic fuzzysets,
InterJPureAppl Math. 2005, 24,287–297.
20. Smarandache. F.Neutrosophic Fixed point theorems in Conemetricspaces,
Neutrosophic Sets and Systems, 2020,31,250 – 265.
21. Simsek, KrisciM. Fixed Point Theorems in Neutrosophic Metric Spaces,
SigmaJ.EngandNatSci.2019, 10(2),221-230.
22. TurkogluD.,AlacaC.,ChoY.J.,YildizC.Commonfixedpointtheoremsinintuitio
nisticfuzzymetricspaces,JApplMathComput,2006,22,411–424.
23. ZadehLA. Fuzysets. Inform Control, 1965, 8,338–353.

CHAPTER-6
GENERALIZED CLOSED SETS VIA NEUTROSOPHIC TOPOLOGICAL

SPACES
1
Dr.A.Pushpalatha and 2T.Nanthini
1
Assistant Professor of Mathematics
PG and Research Department of Mathematics
Government Arts College, Udumalpet-642126
Research Scholar
PG and Research Department of Mathematics
Government Arts College, Udumalpet-642126
Mail: velu_pushpa@yahoo.co.in1,tnanthinimaths@gmail.com2
1. Introduction :
In 1970, Levine[3] introduced the concept of generalized closed sets as a weaker form
of closed sets in topological spaces. Zadeh[1]introduced the notion of fuzzy sets in the year
1965.In fuzzy set theory, the membership of an element to a fuzzy set is a single value between
0 and 1.The concept of fuzzy topological spaces have been introduced and developed by
Chang[2]. In 1983, Atanassov [4] introduced the concept of intuitionistic fuzzy set which was
generalization of fuzzy set. In intuitionistic fuzzy set theory, the elements have the degree
membership and non – membership value between 0 and 1. Later, In 1997 Coker [5] introduced
the concept of intuitionitic fuzzy topological spaces, by using the notion of the intuitionitic
fuzzy set.
Floret in Smarand ache [8] introduced the concept of neutrosophic set. Neutrosophic set
is classified into three independent functions namely, membership function, indeterminancy
function and non membership function that are independently related. In 2012, Salama,
Alblowi[9] introduced the concept of neutrosophic topology. Neutrosophic topological spaces
are very natural generalizations of fuzzy topological spaces, allow more general functions to be
members of fuzzy topology.In 2014, Salama, Smarandache and Valeri[11] introduced the
concept of neutrosophic closed sets and neutrosophic continuous functions. Salama,

Alblowi[10] introduced the concept of generalized neutrosophic set and generalized

neutrosophic topological spaces. A generalized neutrosophic set
𝐴 = {〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 𝑥 〉: 𝑥 ∈ 𝑋} can be identified as an ordered triple 〈𝜇𝐴 , 𝜍𝐴 , 𝛾𝐴 〉in
]-0,1+[ on X, where the triple function satisfy the condition 𝜇𝐴 𝑥 ∩ 𝜍𝐴 𝑥 ∩ 𝛾𝐴 𝑥 ≤ 0.5.
Wadel andSmarandache[12] introduced the neutrosophic open sets via neutrosophic
topological spaces. Ishwarya and Bageerathi[13] introduced the concept of neutrosophic
semi-open sets in neutrosophic topological spaces. Dhavaseelan, Saied Jafari[14] introduced
generalized neutrosophic closed sets. In 2018, Shanthi, Chandrasekar and Safina[15]
introduced the neutrosophic generalized semi closed sets in neutrosophic topological spaces.
In this chapter, we introduce the concept of generalized closed sets[3] in neutrosophic

topological spaces and studied some of their properties.
2. Preliminaries :
In this section, we recollect some relevant basic preliminaries about neutrosophic sets
and its operations.
Definition 2.1 :
[9] Let𝑋 be a non-empty fixed set. A neutrosophic set [𝑁𝑆for short ] 𝐴is an object
having the form 𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 (𝑥)〉: 𝑥 ∈ 𝑋 where 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 and 𝛾𝐴 (𝑥)
which represents the degree of membership function, the degree of inderminacy and the degree
of non-membership function respectively of each element 𝑥 ∈ 𝑋 to the set 𝐴.
Remark 2.2 [9] :

A neutrosophic set 𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 (𝑥)〉: 𝑥 ∈ 𝑋 can be identified to an
ordered triple 𝐴 = 〈𝜇𝐴 , 𝜍𝐴 , 𝛾𝐴 )〉 in]-0, 1+[on 𝑋.
Remark 2.3[9] :
For the sake of simplicity, we shall use the symbol 𝐴 = 〈𝜇𝐴 , 𝜍𝐴 , 𝛾𝐴 )〉 for the
neutrosophic set 𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 (𝑥)〉: 𝑥 ∈ 𝑋 .
Example 2.4 [9] :

Every intuitionistic fuzzy set 𝐴 is a non-empty set in 𝑋 is obviously on𝑁𝑆 having the

form
𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 1 − 𝜇𝐴 𝑥 + 𝛾𝐴 𝑥 , 𝛾𝐴 𝑥 〉: 𝑥 ∈ 𝑋 . Since our main purpose is to construct
the tools for developing neutrosophic set and neutrosophic topology, we must introduce the
neutrosophic sets0𝑁 and 1𝑁 in 𝑋as follows:
0𝑁 may be defined as:
01 0𝑁 = 〈𝑥, 0,0,1〉: 𝑥 ∈ 𝑋
02 0𝑁 = 〈𝑥, 0,1,1〉: 𝑥 ∈ 𝑋
03 0𝑁 = 〈𝑥, 0,1,0〉: 𝑥 ∈ 𝑋
04 0𝑁 = 〈𝑥, 0,0,0〉: 𝑥 ∈ 𝑋
1𝑁 may be defined as:

11 1𝑁 = 〈𝑥, 1,0,0〉: 𝑥 ∈ 𝑋
12 1𝑁 = 〈𝑥, 1,0,1〉: 𝑥 ∈ 𝑋
13 1𝑁 = 〈𝑥, 1,1,0〉: 𝑥 ∈ 𝑋
14 1𝑁 = 〈𝑥, 1,1,1〉: 𝑥 ∈ 𝑋

Let 𝐴 = 〈𝜇𝐴 , 𝜍𝐴 , 𝛾𝐴 )〉 be a 𝑁𝑆on 𝑋, then the complement of the set 𝐴 [𝐶(𝐴) for
short] may be defined as three kinds of complements:
𝐶1 𝐶(𝐴) = 〈𝑥, 1 − 𝜇𝐴 𝑥 , 1 − 𝜍𝐴 𝑥 , 1 − 𝛾𝐴 (𝑥)〉: 𝑥 ∈ 𝑋
𝐶2 𝐶(𝐴) = 〈𝑥, 𝛾𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝜇𝐴 (𝑥)〉: 𝑥 ∈ 𝑋
𝐶1 𝐶(𝐴) = 〈𝑥, 𝛾𝐴 𝑥 , 1 − 𝜍𝐴 𝑥 , 𝜇𝐴 (𝑥)〉: 𝑥 ∈ 𝑋
Definition 2.6[9] :
Let 𝑥 be a non-empty set, and neutrosophic sets 𝐴 and 𝐵 in the form 𝐴 =
𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 𝑥 〉: 𝑥 ∈ 𝑋 and 𝐵 = 〈𝑥, 𝜇𝐵 𝑥 , 𝜍𝐵 𝑥 , 𝛾𝐵 𝑥 〉: 𝑥 ∈ 𝑋 . Then we
may consider two possible definitions for subsets 𝐴 ⊆ 𝐵 .
𝐴 ⊆ 𝐵 may be defined as:
1. 𝐴 ⊆ 𝐵 ⇔ 𝜇𝐴 𝑥 ≤ 𝜇𝐵 𝑥 , 𝜍𝐴 𝑥 ≤ 𝜍𝐵 𝑥 , 𝛾𝐴 𝑥 ≥ 𝛾𝐵 𝑥 ∀ 𝑥 ∈ 𝑋
2. 𝐴 ⊆ 𝐵 ⇔ 𝜇𝐴 𝑥 ≤ 𝜇𝐵 𝑥 , 𝜍𝐴 𝑥 ≥ 𝜍𝐵 𝑥 , 𝛾𝐴 𝑥 ≥ 𝛾𝐵 𝑥 ∀ 𝑥 ∈ 𝑋
Proposition 2.7[9] :
For any neutrosophic set 𝐴,the following conditions holds:
1. 0𝑁 ⊆ 𝐴 , 0𝑁 ⊆ 0𝑁

2. 𝐴 ⊆ 1𝑁 , 1𝑁 ⊆ 1𝑁
Definition 2.8[9] :
Let 𝑋 be a non-empty set, and
𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 𝑥 〉: 𝑥 ∈ 𝑋
𝐵 = 〈𝑥, 𝜇𝐵 𝑥 , 𝜍𝐵 𝑥 , 𝛾𝐵 𝑥 〉: 𝑥 ∈ 𝑋 are 𝑁𝑆𝑠. Then
1. 𝐴 ∩ 𝐵 may be defined as:
(I1) 𝐴 ∩ 𝐵 = 〈𝑥, 𝜇𝐴 𝑥 ⋀ 𝜇𝐵 𝑥 , 𝜍𝐴 𝑥 ⋀𝜍𝐵 𝑥 , 𝛾𝐴 𝑥 ⋁𝛾𝐵 𝑥 〉
(I2) 𝐴 ∩ 𝐵 = 〈𝑥, 𝜇𝐴 𝑥 ⋀ 𝜇𝐵 𝑥 , 𝜍𝐴 𝑥 ⋁𝜍𝐵 𝑥 , 𝛾𝐴 𝑥 ⋁𝛾𝐵 𝑥 〉
2. 𝐴 ∪ 𝐵 may be defined as:
(U1) 𝐴 ∪ 𝐵 = 〈𝑥, 𝜇𝐴 𝑥 ⋁ 𝜇𝐵 𝑥 , 𝜍𝐴 𝑥 ⋁𝜍𝐵 𝑥 , 𝛾𝐴 𝑥 ⋀𝛾𝐵 𝑥 〉
(U2) 𝐴 ∪ 𝐵 = 〈𝑥, 𝜇𝐴 𝑥 ⋁ 𝜇𝐵 𝑥 , 𝜍𝐴 𝑥 ⋀𝜍𝐵 𝑥 , 𝛾𝐴 𝑥 ⋀𝛾𝐵 𝑥 〉
We can easily generalize the operations of intersection and union in Definition
2.8 to arbitrary family of 𝑁𝑆𝑠 as follows:
Definition 2.9[9] :
Let 𝐴𝑗 : 𝑗 ∈ 𝐽 be a arbitrary family of 𝑁𝑆𝑠in 𝑋, then
1. ∩ 𝐴𝑗 may be defined as:
(i) ∩ 𝐴𝑗 = 〈𝑥, ⋀𝑗 ∈𝐽 𝜇𝐴𝑗 𝑥 , ⋀𝑗 ∈𝐽 𝜍𝐴𝑗 𝑥 , ⋁𝑗 ∈𝐽 𝛾𝐴𝑗 𝑥 〉
(ii) ∩ 𝐴𝑗 = 〈𝑥, ⋀𝑗 ∈𝐽 𝜇𝐴𝑗 𝑥 , ⋁𝑗 ∈𝐽 𝜍𝐴𝑗 𝑥 , ⋁𝑗 ∈𝐽 𝛾𝐴𝑗 𝑥 〉
2. ∪ 𝐴𝑗 may be defined as:

(i) ∪ 𝐴𝑗 = 〈𝑥, ⋁ , ⋁, ⋀〉
(ii) ∪ 𝐴𝑗 = 〈𝑥, ⋁ , ⋀, ⋀〉
For all 𝐴 and 𝐵 are two neutrosophic sets then the following conditions are true:
1. 𝐶 𝐴 ∩ 𝐵 = 𝐶 𝐴 ∪ 𝐶 𝐵
2. 𝐶 𝐴 ∪ 𝐵 = 𝐶 𝐴 ∩ 𝐶 𝐵 .
3.
Definition 2.11[9] :
A neutrosophic topology [ 𝑁𝑇 for short] is a non-empty set 𝑋 is a family 𝜏𝑁 of
neutrosophic subsets in 𝑋 satisfying the following axioms:
(NT1) 0𝑁 , 1𝑁 ∈ 𝜏𝑁 ,

(NT2) 𝐺1 ∩ 𝐺2 ∈ 𝜏𝑁 𝑓𝑜𝑟 𝑎𝑛𝑦 𝐺1 , 𝐺2 ∈ 𝜏𝑁 ,

(NT3)∪ 𝐺𝑖 ∈ 𝜏𝑁 𝑓𝑜𝑟 𝑒𝑣𝑒𝑟𝑦 {𝐺𝑖 : 𝑖 ∈ 𝐽} ⊆ 𝜏𝑁
Throughout this chapter, the pair of 𝑋, 𝜏𝑁 is called a neutrosophic topological space
[𝑁𝑇𝑆 for short]. The elements of 𝜏𝑁 are called neutrosophic open set [𝑁𝑂𝑆 for short]. A
neutrosophic set 𝐹 isneutrosophic closed if and only if 𝐶(𝐹) is neutrosophic open.
Example 2.12[9] :
Any fuzzy topological space 𝑋, 𝜏0 in the sense of Chang is obviously a 𝑁𝑇𝑆 in the
form 𝜏𝑁 = {𝐴: 𝜇𝐴 ∈ 𝜏0 } wherever we identify a fuzzy set in 𝑋 whose membership function is
𝜇𝐴 with its counterpart.
The following is an example of neutrosophic topological space.
Example 2.14[9] :
Let 𝑋 = {𝑥} and
𝐴 = 〈𝑥, 0.5,0.5,0.4〉: 𝑥 ∈ 𝑋
𝐵 = 〈𝑥, 0.4,0.6,0.8〉: 𝑥 ∈ 𝑋
𝐶 = 〈𝑥, 0.5,0.6,0.4〉: 𝑥 ∈ 𝑋
𝐷 = 〈𝑥, 0.4,0.5,0.8〉: 𝑥 ∈ 𝑋
Then the family 𝜏𝑁 = 𝑜𝑁 , 1𝑁 , 𝐴, 𝐵, 𝐶, 𝐷 is called a neutrosophic topological spaceon 𝑋.
The complement of 𝐴 [𝐶 𝐴 for short] of 𝑁𝑂𝑆 is called a neutrosophic closed set
[𝑁𝐶𝑆 for short] in 𝑋.
Now, we define neutrosophic closure and neutrosophic interior operations in
neutrosophic topological spaces:
Let 𝑋, 𝜏𝑁 be 𝑁𝑇𝑆 and 𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 𝑥 〉 be a 𝑁𝑆 in 𝑋 . Then the
neutrosophic closure and neutrosophic interior of 𝐴 are defined by
𝑁𝐶𝑙 𝐴 =∩ {𝐾: 𝐾 𝑖𝑠 𝑎 𝑁𝐶𝑆 𝑖𝑛 𝑋 𝑎𝑛𝑑 𝐴 ⊆ 𝐾
𝑁𝐼𝑛𝑡 𝐴 = {𝐺: 𝐺 𝑖𝑠 𝑎 𝑁𝑂𝑆 𝑖𝑛 𝑋 𝑎𝑛𝑑 𝐺 ⊆ 𝐴}
It can be also shown that 𝑁𝐶𝑙(𝐴) is 𝑁𝐶𝑆 and 𝑁𝐼𝑛𝑡(𝐴) is a 𝑁𝑂𝑆in 𝑋.
a) 𝐴 is 𝑁𝑂𝑆 if and only if 𝐴 = 𝑁𝐼𝑛𝑡(𝐴)

b) 𝐴 is 𝑁𝐶𝑆 if and only if 𝐴 = 𝑁𝐶𝑙(𝐴)
For any neutrosophic set 𝐴 in 𝑋, 𝜏𝑁 we have
a) 𝑁𝐶𝑙 𝐶 𝐴 = 𝐶(𝑁𝐼𝑛𝑡 𝐴 )
b) 𝑁𝐼𝑛𝑡 𝐶 𝐴 = 𝐶(𝑁𝐶𝑙 𝐴 )
Let 𝑋, 𝜏𝑁 be a 𝑁𝑇𝑆 and𝐴, 𝐵 be two neutrosophic sets in X. Then the following properties
are holds:
a) 𝑁𝐼𝑛𝑡 𝐴 ⊆ 𝐴
b) 𝐴 ⊆ 𝑁𝐶𝑙(𝐴)
c) 𝐴 ⊆ 𝐵 ⇒ 𝑁𝐼𝑛𝑡 𝐴 ⊆ 𝑁𝐼𝑛𝑡(𝐵)
d) 𝐴 ⊆ 𝐵 ⇒ 𝑁𝐶𝑙 𝐴 ⊆ 𝑁𝐶𝑙(𝐵)
e) 𝑁𝐼𝑛𝑡(𝑁𝐼𝑛𝑡 𝐴 ) = 𝑁𝐼𝑛𝑡(𝐴)
f) 𝑁𝐶𝑙(𝑁𝐶𝑙 𝐴 ) = 𝑁𝐶𝑙(𝐴)
g) 𝑁𝐼𝑛𝑡 𝐴 ∩ 𝐵 = 𝑁𝐼𝑛𝑡(𝐴) ∩ 𝑁𝐼𝑛𝑡(𝐵)
h) 𝑁𝐶𝑙 𝐴 ∪ 𝐵 = 𝑁𝐶𝑙 𝐴 ∪ 𝑁𝐶𝑙(𝐵)
i) 𝑁𝐼𝑛𝑡(0𝑁 ) = 0𝑁
j) 𝑁𝐼𝑛(1𝑁 ) = 1𝑁
k) 𝑁𝐼𝑛𝑡(0𝑁 ) = 0𝑁
l) 𝑁𝐶𝑙(1𝑁 ) = 1𝑁
m) 𝐴 ⊆ 𝐵 ⇒ 𝐶 𝐴 ⊆ 𝐶(𝐵)
n) 𝑁𝐶𝑙 𝐴 ∩ 𝐵 ⊆ 𝑁𝐶𝑙(𝐴) ∩ 𝑁𝐶𝑙(𝐵)
o) 𝑁𝐼𝑛𝑡 𝐴 ∪ 𝐵 ⊆ 𝑁𝐼𝑛𝑡 𝐴 ∪ 𝑁𝐼𝑛𝑡 𝐵
Definition 2.19 : [12]

Let 𝐴 = 〈𝑥, 𝜇𝐴 𝑥 , 𝜍𝐴 𝑥 , 𝛾𝐴 (𝑥)〉: 𝑥 ∈ 𝑋 be a nuetrosophic open sets and 𝐵 =
〈𝑥, 𝜇𝐵 𝑥 , 𝜍𝐵 𝑥 , 𝛾𝐵 (𝑥)〉: 𝑥 ∈ 𝑋 be a neutrosophic set on a neutrosophic toplogical space
𝑋, 𝜏𝑁 then
a) 𝐴is called neutrosophic regular open iff 𝐴 = 𝑁𝐼𝑛𝑡(𝑁𝐶𝑙 𝐴 ).
b) If 𝐵 ∈ 𝑁𝐶𝑆(𝑋) then 𝐵 in called neutosophic regular close iff 𝐴 = 𝑁𝐶𝑙(𝑁𝐼𝑛𝑡(𝐴).


A neutrosophic set 𝐴 in a neutrosophic toplogical space 𝑋, 𝜏𝑁 is called
1. Neutrosophic semi-open set 𝑁𝑆𝑂𝑆 if 𝐴 ⊆ 𝑁𝐶𝑙(𝑁𝐼𝑛𝑡 𝐴 ).
2. Neutrosophic pre-open set 𝑁𝑃𝑂𝑆 if 𝐴 ⊆ 𝑁𝐼𝑛𝑡(𝑁𝐶𝑙 𝐴 ).
3. Neutrosophic𝛼-open set (𝑁𝛼𝑂𝑆)if 𝐴 ⊆ 𝑁𝐼𝑛𝑡(𝑁𝐶𝑙 𝑁𝐼𝑛𝑡 𝐴 ).
4. Neutroophic𝛽-open set 𝑁𝛽𝑂𝑆 if 𝐴 ⊆ 𝑁𝐶𝑙(𝑁𝐼𝑛𝑡(𝑁𝐶𝑙(𝐴))).
An 𝑁𝑆𝑠 𝐴 is called neutrosophic semi-closed set, neutrosophic 𝛼 -closed set,
neutrosophic pre-closed set and neutrosophic regular closed set respectively (𝑁𝑆𝐶𝑆, 𝑁𝛼𝐶𝑆,
𝑁𝑃𝐶𝑆 𝑎𝑛𝑑 𝑁𝑅𝐶𝑆, resp.), if the complement of 𝐴 is a 𝑁𝑆𝑂𝑆, 𝑁𝛼𝑂𝑆, 𝑁𝑃𝑂𝑆 𝑎𝑛𝑑 𝑁𝑅𝑂𝑆
respectively.
Let 𝐴 be a subset of a neutrosophic spaces (𝑋, 𝜏𝑁 ) is called neutrosophic generalized
semi closed(𝑁𝑔𝑠-closed) if neutrosophic semi-𝑐𝑙(𝐴) ⊆ 𝐺, whenever 𝐴 ⊆ 𝐺 and 𝐺is 𝑁𝑂𝑆.
c) GENERALIZED CLOSED SETS IN NEUTROSOPHIC TOPOLOGICAL SPACES :
In this section, we introduce the new concept namely neutrosophic generalized closed
sets in neutrosophic topological spaces.
Definition 3.1 :
Let 𝑋, 𝜏𝑁 be a neutrosophic topological space. A subset 𝐴 of 𝑋, 𝜏𝑁 is called
neutrosophic generalized closed set (𝑁𝑒𝑜 − 𝑔-closed) if 𝑁𝑐𝑙 𝐴 ⊆ 𝐺 when ever 𝐴 ⊆ 𝐺 and
𝐺 is neutrosophic open set (𝑁𝑂𝑆) . Complement of 𝑁𝑒𝑜 − 𝑔 -closed set is called the
𝑁𝑒𝑜 − 𝑔-open
set.
Example 3.2 :
Let 𝑋 = {𝑎, 𝑏, 𝑐} with 𝜏𝑁 = 0𝑁 , 1𝑁 , 𝐴, 𝐵 where
𝐴 = 〈 0.5,0.5,0.4 , 0.7,0.5,0.5 , (0.4,0.5,0.5)〉,
𝐵 = 〈 0.3,0.4,0.4 , 0.4,0.5,0.5 , (0.3,0.4,0.6)〉 .Then (𝑋, 𝜏𝑁 ) is a neutrosophic
topological space.
The closed sets of 𝑋, 𝜏𝑁 are 𝐴′ = 〈 0.4,0.5,0.5 , 0.5,0.5,0.7 , (0.5,0.5,0.4)〉,

𝐵 ′ = 〈 0.4,0.6,0.3 , 0.5,0.5,0.4 , (0.6,0.6,0.3)〉. Consider the neutrosophic set

𝐶 = 〈 0.4,0.6,0.5 , 0.4,0.3,0.5 , (0.5,0.6,0.4)〉in 𝑋, 𝜏𝑁 . Here 𝐶 is𝑁𝑒𝑜 − 𝑔-closed
set in 𝑋, 𝜏𝑁 .
Theorem 3.3 :
Every neutrosophic closed set is a neutrosophic generalized closed set in 𝑋, 𝜏𝑁 .
Proof:
Let 𝐴 ⊆ 𝐺, where 𝐺 neutrosophic open set in is 𝑋, 𝜏𝑁 . Since 𝐴 is neutrosophic
closed set, 𝑁𝐶𝑙(𝐴) ⊆ 𝐴 [Since 𝐴 = 𝑁𝐶𝑙(𝐴) ]. Therefore 𝑁𝐶𝑙(𝐴) ⊆ 𝐴 ⊆ 𝐺 . Hence 𝐴 is a
𝑁𝑒𝑜 − 𝑔-closed set in 𝑋, 𝜏𝑁 .
Remark 3.4 :
The converse of the above theorem need not be true as seen in the following example.
Example 3.5 :
Let𝑋 = {𝑎, 𝑏} with 𝜏𝑁 = 0𝑁 , 1𝑁 , 𝐴, 𝐵 and where
𝐴 = 〈 0.4,0.5,0.5 , (0.2,0.4,0.6)〉,
𝐵 = 〈 0.7,0.5,0.3 , (0.3,0.4,0.5)〉.Then (𝑋, 𝜏𝑁 ) is a neutrosophic topological space.
The closed sets of 𝑋, 𝜏𝑁 are 𝐴′ = 〈 0.5,0.5,0.4 , 0.6,0.6,0.2 〉,
𝐵 ′ = 〈 0.3,0.5,0.7 , 0.5,0.6,0.3 〉. Consider the neutrosophic set
𝐶 = 〈0.6,0.5,0.6), 0.4,0.3,0.7 〉. 𝐶is𝑁𝑒𝑜 − 𝑔-closed set, but 𝐶 is not 𝑁𝐶𝑆, (Since
𝑁𝐶𝑙(𝐶) ≠ 𝐶).
Theorem 3.6 :
If 𝐴 and 𝐵 are 𝑁𝑒𝑜 − 𝑔-closed sets in 𝑋, 𝜏𝑁 then 𝐴 ∪ 𝐵 is 𝑁𝑒𝑜 − 𝑔-closed set in
𝑋, 𝜏𝑁 .
Proof :
Let 𝐴 and 𝐵 are 𝑁𝑒𝑜 − 𝑔 -closed setsin 𝑋, 𝜏𝑁 . Then 𝑁𝐶𝑙 𝐴 ⊆ 𝐺 whenever
𝐴 ⊆ 𝐺 and 𝐺 is 𝑁𝑂𝑆 in 𝑋, 𝜏𝑁 and 𝑁𝐶𝑙 𝐵 ⊆ 𝐺 whenever B⊆ 𝐺 and 𝐺 is 𝑁𝑂𝑆 in 𝑋 .
Since 𝐴 and 𝐵 are subsets of 𝐺, 𝐴 ∪ 𝐵 is a subset of 𝐺 and 𝐺 is neutrosophic open set.
Then 𝑁𝐶𝐿 𝐴 ∪ 𝐵 = 𝑁𝐶𝑙(𝐴) ∪ 𝑁𝐶𝑙(𝐵) [by Proposition 1.18(h)], 𝑁𝐶𝑙 𝐴 ∪ 𝐵 ⊆ 𝐺 .
Therefore𝐴 ∪ 𝐵 is 𝑁𝑒𝑜 − 𝑔-closed set in 𝑋, 𝜏𝑁 .

Theorem 3.7 :
If 𝐴 and 𝐵 are 𝑁𝑒𝑜 − 𝑔 -closed setsin 𝑋, 𝜏𝑁 , then 𝑁𝑐𝑙(𝐴 ∩ 𝐵) ⊆ 𝑁𝑐𝑙(𝐴) ∩
𝑁𝑐𝑙(𝐵).
Proof :
Let 𝐴 and 𝐵 are 𝑁𝑒𝑜 − 𝑔 -closed sets in 𝑋, 𝜏𝑁 . Then 𝑁𝐶𝑙 𝐴 ⊆ 𝐺 whenever
𝐴 ⊆ 𝐺 and 𝐺 is 𝑁𝑂𝑆 in 𝑋, 𝜏𝑁 and 𝑁𝐶𝑙 𝐵 ⊆ 𝐺 whenever B ⊆ 𝐺 and 𝐺 is 𝑁𝑂𝑆 in
𝑋, 𝜏𝑁 . Since 𝐴 and 𝐵 are subsetsof 𝐺 , 𝐴 ∩ 𝐵 is a subset of 𝐺 and 𝐺 is 𝑁𝑂𝑆 . Since
𝐴 ∩ 𝐵 ⊆ 𝐴and 𝐴 ∩ 𝐵 ⊆ 𝐵, we know that, if 𝐴 ⊆ 𝐵 then 𝑁𝑐𝑙(𝐴) ⊆ 𝑁𝑐𝑙(𝐵) [9]. Therefore
𝑁𝑐𝑙(𝐴 ∩ 𝐵) ⊆ 𝑁𝑐𝑙(𝐴) and 𝑁𝑐𝑙(𝐴 ∩ 𝐵) ⊆ 𝑁𝑐𝑙(𝐵) ,which implies that 𝑁𝑐𝑙 𝐴 ∩ 𝐵 ⊆
𝑁𝑐𝑙 𝐴 ∩ 𝑁𝑐𝑙 𝐵 . Hence proved.
Remark 3.8 :
The intersection of two 𝑁𝑒𝑜 − 𝑔-closed sets need not be a 𝑁𝑒𝑜 − 𝑔-closed set as seen
from the following example.
Example 3.9 :
Let 𝑋 = {𝑎, 𝑏, 𝑐} with 𝜏𝑁 = 0𝑁 , 1𝑁 , 𝐴, 𝐵, 𝐶 where
𝐴 = 〈 0.4,0.5,0.4 , 0.5,0.5,0.6 , (0.7,0.4,0.3)〉,
𝐵 = 〈 0.3,0.4,0.5 , 0.5,0.4,0.8 , (0.6,0.3,0.4)〉,
𝐶 = 〈 0.4,0.5,0.4 , 0.5,0.5,0.8 , (0.7,0.5,0.3)〉 . Then (𝑋, 𝜏𝑁 ) is a neutrosophic
topological space. The closed sets are
𝐴′ = 〈 0.4,0.5,0.4 , 0.6,0.5,0.5 , (0.3,0.6,0.7)〉,
𝐵 ′ = 〈 0.5,0.6,0.3 , 0.8,0.6,0.8 , (0.4,0.7,0.6)〉 , 𝐶′ =
〈 0.4,0.5,0.4 , 0.8,0.5,0.5 , (0.3,0.5,0.7)〉.
Consider the 𝑁𝑒𝑜 − 𝑔-closed sets 𝐷 = 〈 0.5,0.6,0.7 , 0.5,0.5,0.5 , (0.6,0.4,0.6)〉,
𝑎𝑛𝑑 𝐸 = 〈 0.4,0.3,0.8 , 0.2,0.6,0.7 , (0.5,0.4,0.7)〉 ,then 𝐷∩𝐸 =
〈 0.4,0.3,0.8 , 0.2,0.5,0.7 , (0.5,0.4,0.7)〉, is not a 𝑁𝑒𝑜 − 𝑔-closed set.
Theorem 3.10 :
If 𝐴 is 𝑁𝑒𝑜 − 𝑔 -closed set in 𝑋, 𝜏𝑁 and 𝐴 ⊆ 𝐵 ⊆ 𝑁𝐶𝑙 𝐴 , then 𝐵 is 𝑁𝑒𝑜 −
𝑔-closed setin 𝑋, 𝜏𝑁 .

Proof:
Let 𝐵 ⊆ 𝐺 where 𝐺 is 𝑁𝑂𝑆 in (𝑋, 𝜏𝑁 ) . Then 𝐴 ⊆ 𝐵 implies 𝐴 ⊆ 𝐺 . Since 𝐴 is
𝑁𝑒𝑜 − 𝑔 -closed, 𝑁𝐶𝑙(𝐴) ⊆ 𝐺 . Also 𝐴 ⊆ 𝑁𝐶𝑙 𝐵 implies 𝑁𝐶𝑙 𝐵 ⊆ 𝑁𝐶𝑙 𝐴 . Thus
𝑁𝐶𝑙 𝐵 ⊆ 𝐺 and so 𝐵 is 𝑁𝑒𝑜 − 𝑔-closed setin 𝑋, 𝜏𝑁 .
Theorem 3.11 :
An 𝑁𝑒𝑜 − 𝑔-closed set 𝐴 is neutrosophic closed set iff 𝑁𝐶𝑙 𝐴 − 𝐴 is neutrosophic
closed set.
Proof :
Assume that, 𝐴 is 𝑁𝐶𝑆 , then 𝑁𝐶𝑙 𝐴 = 𝐴 and so 𝑁𝐶𝑙 𝐴 − 𝐴 = 0𝑁 which is
𝑁𝐶𝑆 [9]. Conversely, suppose 𝑁𝐶𝑙 𝐴 − 𝐴 is 𝑁𝐶𝑆 . Then 𝑁𝐶𝑙 𝐴 − 𝐴 = 0𝑁 , that is
𝑁𝐶𝑙 𝐴 = 𝐴. Therefore 𝐴 is 𝑁𝐶𝑆. Hence proved.
Theorem 3.12 :
Suppose that 𝐴 ⊆ 𝐵 ⊆ 𝑋, 𝐵 is an 𝑁𝑒𝑜 − 𝑔-closed set relative to 𝐴 and that 𝐴 is an
𝑁𝑒𝑜 − 𝑔-closed subset of 𝑋. Then 𝐵 is 𝑁𝑒𝑜 − 𝑔-closed set relative to 𝑋.
Proof:
Let 𝐵 ⊆ 𝐺 and suppose that 𝐺 is 𝑁𝑂𝑆in 𝑋. Then 𝐵 ⊆ 𝐴 ∩ 𝐺. Therefore 𝑁𝐶𝑙 𝐵 ⊆
𝐴 ∩ 𝐺 . It follows that 𝐴 ∩ 𝑁𝐶𝑙 𝐵 ⊆ 𝐴 ∩ 𝐺 and 𝐴 ⊆ 𝐺 ∪ 𝑁𝐶𝑙(𝐵) . Since 𝐴 is 𝑁𝑒𝑜 −
𝑔 -closed in 𝑋 , we have 𝑁𝐶𝑙(𝐴) ⊆ 𝐺 ∪ 𝑁𝐶𝑙(𝐵) . Therefore 𝑁𝐶𝑙 𝐵 ⊆ 𝑁𝐶𝑙(𝐴) ⊆ 𝐺 ∪
𝑁𝐶𝑙(𝐵)and 𝑁𝐶𝑙 𝐵 ⊆ 𝐺. Then 𝐵 is 𝑁𝑒𝑜 − 𝑔-closed relative to 𝐵 is an 𝑁𝑒𝑜 − 𝑔-closed set
relative to 𝐺.
Corollary 3.13:
Let 𝐴 be a 𝑁𝑒𝑜 − 𝑔-closed set and suppose that 𝐹 is a 𝑁𝐶𝑆. Then 𝐴 ∩ 𝐹 is an
𝑁𝑒𝑜 − 𝑔-closed set.
Theorem 3.14 :
If 𝐴 is 𝑁𝑒𝑜 − 𝑔-closed set in 𝑋, then 𝐴 is 𝑁𝑒𝑜 − 𝑔𝑠-closed set in 𝑋.
Proof :
Let 𝐴 be a 𝑁𝑒𝑜 − 𝑔-closed set in 𝑋. Therefore 𝑁𝐶𝑙 𝐴 ⊆ 𝐺 and 𝐴 ⊆ 𝐺 whenever
𝐺 is 𝑁𝑂𝑆 in 𝑋 . 𝑁𝑆𝐶𝑙 𝐴 ⊆ 𝐺 . Then 𝑁𝑆𝐶𝑙(𝐴) ⊆ 𝑁𝐶𝑙(𝐴) , 𝑁𝑆𝐶𝑙(𝐴) ⊆ 𝐺 . Therefore 𝐴 is

𝑁𝑒𝑜 − 𝑔𝑠-closed in𝑋.
Remark 3.15 :
The converse of the above theorem need not be true as seen from the following
example.
Example 3.16 : Let𝑋 = {𝑎} with 𝜏𝑁 = 0𝑁 , 1𝑁 , 𝐴, 𝐵, 𝐶, 𝐷 where

𝐴 = 〈0.6,0.7,0.9〉
𝐵 = 〈0.5,0.4,0.7〉
𝐶 = 〈0.6,0.7,0.7〉
𝐷 = 〈0.5,0.4,0.9〉
Then (𝑋, 𝜏𝑁 ) is a neutrosophic topological space. Consider the neutrosophic set
𝐸 = 〈0.4,0.3,0.7〉 . 𝐸 is 𝑁𝑒𝑜 − 𝑔𝑠 -closed set in 𝑋, 𝜏𝑁 , but 𝐸 is not a 𝑁𝑒𝑜 − 𝑔 -closed
set 𝑋, 𝜏𝑁 ,since 𝑁𝐶𝑙(𝐸) ⊈ 𝐺.
References :
1. L.A. Zadeh, Fuzzy set, Inform and Control 8(1965), 338-353.

2. C.L. Chang, Fuzzy topological spaces, Journal of Mathematical Analysis and
Application, 24(1968), 1832-190.
3. Levine N. Generalized closed sets in topology. Rend. Cire. Math. Palermo.
1970;19(2):89-96.
4. K.T. Atanasov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20(1986),87-96.
5. Dogan Coker, An introduction to intuitionstic fuzzy topological spaces, Fuzzy Sets and
Systems,88(1997),81-89.
6. FloretinSmarandache, A Unifying Field in Logic: Neutrosophic Logic. Neutrosophy,
Neutrosophic set, Neutrosophic Probability. Ameican Research Press, Rehoboth,
NM,1999.
7. FloretinSmarandache, Neutrosophy and Neutrosophic Logic, First International
Conference on Neutrosophy, Neutrosophic Logic, Set, Probability, and Statistics
University of New Mexico, Gallup, NM 87301,USA(2002), smarad@unm,edu
8. FloretinSmarandache, Neutrosophic Set:- A Generalization of Intuitionistiic Fuzzy set,
Journal of DefenseResourses Management. 1 (2010),107-116.

9. A.A. Salama and S.A Alblowi, Neutrosophic set and Neutrosophic topological space,
ISOR J. Mathematics, Vol.(3), Issue(4),(2012). Pp-31-35.
10. A.A. Salama and S.A. Alblowi, Generalized Neutrosophic Set and Generalized
Neutrosophic Topological Spaces, Journal computer Sci. Engineering, Vol.(2) No.(7)
(2012).
11. A.A. Salama, FlorentinSmarandache and ValeriKroumov, Neutrosophic Closed set and
Neutrosophic Continuous Function, Neutrosophic Sets and Systems,Vol.(4) 2014, pp
4-8.
12. WadelFaris Al-omeri and FlorentinSmarandache, New Neutrosophic Sets via
Neutrosophic Topological Spaces, New Trends in Neutrosophic theory and
applications, Vol(2) June 2016.
13. P. Ishwarya and K. Bageerathi, On Neutrosophic semi-open sets in Neutrosophic
topological spaces, International Jour. of Math. Trends and Tech. 2016, 214-223.
14. R. Dhavaseelan and Jafari, Generalized Neutrosophic closed sets, New trends in
Neutrosophic theory and applications, Vol(2) (2018) 261-273.
15. V.K. Shanthi, S. Chandrasekar and K. SafinaBegam, Neutrosophic Generalized Semi
Closed sets in Neutrosophic Topological spaces, International Journal of Research in
Advent Technology, Vol.6, No.7, (2018) 2321-9637.

CHAPTER-7
NEUTROSOPHIC g*-CLOSED SETS AND ITS MAPS
A.Atkinswestley1 and S.Chandrasekar2*
1
Department of Mathematics, Roever College of Engineering and Technology,
Elambalur,Perambalur(DT), Tamil Nadu, India
E-mail: ats.wesly@gmail.com
2
Department of Mathematics, Arignar Anna Government Arts College,
Namakkal(DT),Tamil Nadu, India.
E-mail: chandrumat@gmail.com.
1. Introduction : -
Smarandache [10,11] characterized the Neutrosophic set on three segment Neutrosophic
sets(TTruth,I-Indeterminacy, F-Falsehood). Neutrosophic topological spaces(NS-T-S)
presented by Salama [19,20]etal. Neutrosophic have wide scope of constant applications for
the fields of Electrical & Electronic, Artificial Intelligence, Mechanics, Computer Science,
Information Systems, Applied Mathematics , basic leadership. Prescription and
Management Science and so on. Neutrosophic semiclosed, α-closed, preclosed and regular
closed sets are introduced by I. Arokiarani[6] et al.,R.Dhavaseelan [8] et al.introduced
Neutrosophicg closed sets and gαclosed sets.Point of this chapter is R .Dhavaseelan[9] and
S.Jafari, are introduced Generalized Neutrosophic Closed sets .D.Jayanthi [13] presented α
GClosed Sets in Neutrosophic Topological Spaces, V.K.Shanthi [22] developed
Neutrosophicgs and sg closed set.C.Mahesawri[14,15] et al introduced Neutrosophicgb
closed sets.
Aim of this present chapter is, we introduce and study the concepts of Neutrosophicg*-Closed
sets and Neutrosophicg*-open sets in Neutrosophictopological spaces. Also we study about
mappings of Neutrosophicg*-Closed sets
2. Preliminaries :-
In this section, we recall required and necessary definition and results of Neutrosophic
sets

Definition 2.1 [16,17] :

Let NuX∗ be a non-empty fixed set. A Neutrosophic set W1∗ is a object having the
formW1∗ = {< 𝑤, μW ∗ w , σW ∗1 w , γW ∗ w >: 𝑤 ∈ Nu∗X },
1 1
μW ∗ w -membership function
1
σW ∗1 w -Indeterminacyfunction
γW ∗ w -Non-Membership function
1
Definition 2.2 [16,17]:

Neutrosophic setW1∗ = {< 𝑤, μW ∗ w , σW ∗1 w , γW ∗ w >: 𝑤 ∈ Nu∗X }, on Nu∗X and
1 1
∀w ∈ Nu∗X then complement of W1∗ is

W1∗ C = {< 𝑤, γW ∗ ( w ), 1 − σW ∗1 w , μW ∗ w >: 𝑤 ∈ NuX∗ }
1 1
Definition 2.3 [16,17]:

Let W1∗ and W2∗ are two Neutrosophic sets,∀w ∈ Nu∗X
W1∗ = {< w, μW ∗ w , σW ∗1 w , γW ∗ w >: w ∈ Nu∗X }
1 1
W2∗ = {< w, μW ∗ w , σW ∗2 w , γW ∗ w >: w ∈ Nu∗X }

2 2
Then W1∗ ⊆ W2∗ ⇔ μW ∗ w ≤ μW ∗ w , σW ∗1 w ≤ σW ∗2 w &γW ∗ w ≥ γW ∗ w }

1 2 1 2
Definition 2.4[16,17] :
Let NuX∗ be a non-empty set, and Let W1∗ and W2∗ be two Neutrosophic sets are
W1∗ = {< 𝑤, μW ∗ w , σW ∗1 w , γW ∗ w >: 𝑤 ∈ Nu∗X },W2∗ = {<
1 1
𝑤, μW ∗ w , σW ∗2 w , γW ∗ w >: 𝑤 ∈ Nu∗X } ThenW1∗ ∩ W2∗ = {< 𝑤, μW ∗ w ∩

2 2 1
μW ∗ w , σW ∗1 w ∩ σW ∗2 w , γW ∗ w ∪ γW ∗ w >: 𝑤 ∈ NuX∗ }
2 1 2
W1∗ ∪ W2∗ = {< 𝑤, μW ∗ w ∪ μW ∗ w , σW ∗1 w ∪ σW ∗2 w , γW ∗ w ∩ γW ∗ w >: 𝑤

1 2 1 2
∈ NuX∗ }
Let NuX∗ be non-empty set and Nuτ be the collection of Neutrosophic subsets of
Nu∗X satisfying the accompanying properties:
1.0Nu , 1Nu ∈ Nuτ
2.NuT 1 ∩ NuT 2 ∈ Nuτ for any NuT 1 , NuT 2 ∈ Nuτ
3. ∪ NuT i ∈ Nuτ for every {NuT i : i ∈ j} ⊆ Nuτ

Then the space (Nu∗X , Nuτ ), is called a Neutrosophic topological space(NS-T-S) The
component of Nuτ are called Nu-OS (Neutrosophic open set)and its complement is
Nu-CS(Neutrosophic closed set)
Example 2.6 :
6 6 5 5 7 9
Let Nu∗X ={w} and ∀w ∈ Nu∗X ,W1∗ = 〈w, 10 , 10 , 10 〉,W2∗ = 〈w, 10 , 10 , 10 〉
6 7 5 5 6 9
W3∗ = 〈w, 10 , 10 , 10 〉 ,W4∗ = 〈w, 10 , 10 , 10 〉Then the collection
Nuτ = {0Nu , W1∗ , W2∗ , W3∗ , W4∗ 1Nu } is called a NS-T-S on Nu∗X .
Definition 2.7 :
Let (Nu∗X , Nuτ ), be a NS-T-S
andW1∗ = {< 𝑤, μW ∗ w , σW ∗1 w , γW ∗ w >: 𝑤 ∈ Nu∗X } bea Neutrosophic set in Nu∗X .

1 1
Then W1∗ is said to be
[1] Neutrosophicα-closed set [6] (Nu − αCS in short) Nu-cl(Nu-in(Nu-cl(W1∗ )))⊆
W1∗ ,
[2] Neutrosophic pre-closed set [22] (Nu-PCS in short) Nu-cl(Nu-in(W1∗ ))⊆ W1∗ ,
[3] Neutrosophic regular closed set [6] (Nu-RCS in short) Nu-cl(Nu-in(W1∗ ))=W1∗ ,
[4] Neutrosophic semi closed set [7] (Nu-SCS in short) Nu-in(Nu-cl(W1∗ ))⊆ W1∗ ,
[5] Neutrosophic generalized closed set [4] ( Nu-GCS in short) Nu-cl(W1∗ ⊆ ℋ
whenever W1∗ ⊆ ℋ and ℋ is a Nu-OS,in Nu∗X
[6] Neutrosophicα generalized closed set [13] (Nu- (αG)CS in short) Nuαcl(W1∗ )⊆
ℋ whenever W1∗ ⊆ ℋ And ℋ is aNu-OS,in Nu∗X
[7] Neutrosophic generalized semi closed set [21]( Nu -GSCS in short)
Nu-Scl(W1∗ )⊆ ℋ whenever W1∗ ⊆ ℋ and ℋ is a Nu-OS in NuX∗
[8] Neutrosophic semigeneralized closed set[21]( Nu-SGCS in short) if Nu scl(W1∗ )
⊆ℋ whenever W1∗⊆ℋ and ℋis a Nu-SOS in NuX∗ ,
[9] Neutrosophic generalized alpha closed set[9]. ( Nu -GαCS in short) if
Nu-αcl(W1∗) ⊆ℋ whenever W1∗ ⊆ℋ and ℋis a Nu-αOS in Nu∗X

[10] Neutrosophic generalized b closed set[14](Nu-GbCS in short) if Nu-bcl(W1∗ )
⊆ ℋ whenever W1∗ ⊆ ℋ and ℋ is a Nu-OS in Nu∗X
Definition 2.8.[13] :
An (NS)S W1∗ in an (NS)TS (Nu∗X , Nuτ ), is said to be aNeutrosophic weakly
generalized closed set ((Nu-WG)CS) Nu-cl(Nu-in(W1∗ ))⊆ 𝒦 whenever W1∗ ⊆ 𝒦, 𝒦 is
(Nu)OS in Nu∗X .
Definition 2.9 :
(Nu∗X , Nuτ ), be a NS-T-S and W1∗ = {< 𝑤, μW ∗ w , σW ∗1 w , γW ∗ w >: 𝑤 ∈

1 1
Nu∗X }Nu∗X .
Then Neutrosophic closure of W1∗ is Nu-Cl(W1∗ )= ∩ { ℋ: ℋ is a Nu-CS in Nu∗X and
W1∗ ⊆ ℋ}
Neutrosophic interior of W1∗ isNu-Int(W1∗ )=∪{M:M is a Nu-OS in NuX∗ and M⊆ W1∗ }.
Let (Nu∗X , Nuτ ), be a NS-T-S and

W1∗ = {< 𝑤, μW ∗ w , σW ∗1 w , γW ∗ w >: 𝑤 ∈ Nu∗X }
1 1
Nu-Sint(W1∗ )=∪{ ℋ/ ℋ is a Nu-SOS in Nu∗X and ℋ ⊆ W1∗ },
Nu-Scl(W1∗ )=∩{ 𝒦/ 𝒦 is a Nu-SCS in NuX∗ and W1∗ ⊆ 𝒦 }.
Nu-αint(W1∗ )=∪{ ℋ/ ℋ is a Nu-αOS in Nu∗X and ℋ ⊆ W1∗ },
Nu-αcl(W1∗ )=∩{ 𝒦/ 𝒦 is a Nu-αCS in NuX∗ and W1∗ ⊆ 𝒦 }.
3. NEUTROSOPHICG* CLOSED SETS :

In this section we introduce NeutrosophicG*-Closed sets and studied some of
its basic properties.

Definition 3.1:
An NS W1∗ in (Nu∗X , 𝑁𝑢𝜏 ) is said to be a NeutrosophicG*-Closed set (Nu-G*CS in
short) if Nu-cl(W1∗ ) ⊆𝒦 whenever W1∗ ⊆𝒦 and 𝒦 is Nu-GOS in (Nu∗X , 𝑁𝑢𝜏 ) .
The family of all Nu-G*CS’s of A NTS (Nu∗X , 𝑁𝑢𝜏 ) is denoted by Nu-G*C(Nu∗X ).
Example 3.2: Let NuX∗ = {𝑤1 ,𝑤2 } and let 𝑁𝑢𝜏 ={0Nu, 𝒦 , 1Nu}is NT on Nu∗X ,where
3 5 7 4 5 6 7 5 1 6 5 0
𝒦 = 〈w, , , , , , 〉.Then the NSW1∗ =〈w, , , , , , 〉 is Nu-G*CS
10 10 10 10 10 10 10 10 10 10 10 10
in (NuX∗ , 𝑁𝑢𝜏 )
Theorem 3.3:
Every Nu-CS is Nu-G*CS .
Proof:
Let W1∗ be aNu-CS in (Nu∗X , Nuτ ) . Then Nu-cl(W1∗ ) = W1∗ . Let W1∗ ⊆ 𝒦 and 𝒦
is Nu-GOS in (NuX∗ , Nuτ ) . Therefore Nu-cl(W1∗ ) = W1∗ ⊆ 𝒦. Thus W1∗ is Nu-G*CS
inNuX∗ .
Example 3.4:
Let Nu∗X ={w1 ,w2 } and let Nuτ ={0Nu, 𝒦,1Nu}is NT on Nu∗X , where
4 5 6 2 5 7 6 5 1 7 5 1
𝒦 = 〈w, , , , , , 〉 Then the NS W1∗ = 〈w, , , , , , 〉 is
10 10 10 10 10 10 10 10 10 10 10 10
Nu-G*CS but not an Nu-CS in Nu∗X .
Theorem 3.5:
Every Nu-G*CS is Nu-GCS.
Proof:
Let W1∗ be aNu-G*CS in (NuX∗ , Nuτ ) . Let W1∗ ⊆ 𝒦 and 𝒦 is Nu-OS in (NuX∗ ,
Nuτ ) . Since every Nu-OS is Nu-GOS and since W1∗ is Nu-G*CS in Nu∗X . Therefore
Nu-cl(W1∗ )⊆ 𝒦 whenever W1∗ ⊆ 𝒦 , 𝒦 is Nu-OS in Nu∗X . Thus W1∗ is Nu-GCS in
Nu∗X .
Example 3.6:
Let Nu∗X ={w1 ,w2 , w3 } and

2 5 7 5 5 4 3 5 5
letNuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X , where 𝒦= 〈w, , , , , , , , , 〉.
10 10 10 10 10 10 10 10 10

5 5 5 2 5 7 3 5 6
Then the NS W1∗ =〈w, , , , , , , , , 〉 is Nu-GCS but not an
10 10 10 10 10 10 10 10 10
Nu-G*CS in Nu∗X .
Theorem 3.7:
Every Nu-G*CS is Nu-αGCS .
Proof:
LetW1∗ be aNu-G*CS in (Nu∗X , 𝑁𝑢𝜏 ) . By Theorem 3.6 W1∗ is Nu-GCS in Nu∗X .
SinceNuα-cl( W1∗ )⊆Nu-cl( W1∗ )andW1∗ isaNu-GCSin Nu∗X .ThereforeNuα-cl(W1∗ )⊆Nu-cl(
W1∗ )⊆𝒦wheneverW1∗ ⊆𝒦,𝒦is Nu-OS in NuX∗ . Thus W1∗ is Nu-αGCS inNu∗X .
Example 3.8:
Let Nu∗X = {w1 , w2 } and let Nuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X ,

1 5 6 4 5 5 3 5 4 5 5 5
where𝒦 =〈w, , , , , , 〉. Then the NS W1∗ =〈w, , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10
is Nu-αGCS but not an Nu-G*CS in NuX∗ .
Theorem 3.9:
Every Nu-RCS is Nu-G*CS .
Proof:
Let W1∗ be a Nu-RCS in (Nu∗X , Nuτ ) . Then W1∗ = Nu-cl(Nu-int(W1∗ )). Let
W1∗ ⊆ 𝒦 and 𝒦 is Nu-GOS in(NuX∗ , Nuτ ) .Therefore Nu-cl(W1∗ )⊆Nu-cl(Nu-int(W1∗ )).
This implies Nu-cl(W1∗ )⊆W1∗ ⊆ 𝒦. Thus W1∗ is Nu-G*CS in Nu∗X .
Example 3.10:
Let Nu∗X = {w1 , w2 } and let Nuτ = {0Nu, 𝒦, 1Nu}is NT on Nu∗X ,Where
3 5 6 7 5 3 7 5 3 6 5 4
𝒦 =〈w, , , , , , 〉Then NS W1∗ =〈w, , , , , , 〉 is Nu-G*CS
10 10 10 10 10 10 10 10 10 10 10 10
but not an Nu-RCS in Nu∗X .

Diagram: I
Remark 3.11:
Nu-G*CS is independent from Nu-𝛼CS, Nu-SCS, Nu-PCS, and Nu-bCS as
seen from the following example.
Example 3.12:
Let Nu∗X = {w1 , w2 } and let Nuτ = {0Nu, 𝒦, 1Nu}is NT on Nu∗X , where
2 5 6 4 5 5 3 5 5 4 5 5
𝒦=〈w , , , , , 〉. Then NSW1∗ =〈w, , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10
isNuSCS, Nu-bCS, but not an Nu-G*CS in Nu∗X .
Example 3.13:
Let Nu∗X = {w1 , w2 } and let Nuτ = {0Nu, 𝒦, 1Nu}is NT on Nu∗X , where
6 5 2 5 5 4 1 5 7 4 5 5
𝒦=〈w , , , , , 〉. Then NSW1∗ =〈w, , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10
isNu-PCS, Nu-αCS, but not an Nu-G*CS in NuX∗ .
Example 3.14:
Let Nu∗X = {w1 ,w2 } and let Nuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X , where
6 5 2 5 5 2 1 5 3 4 5 2
𝒦=〈w, , , , , , 〉 Then the NS W1∗ =〈w, , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10
is Nu-G*CS but not NuSCS, Nu-bCSNu∗X .

Example 3.15:
Let Nu∗X = {w1 ,w2 } and let Nuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X , where
2 5 6 3 5 5 3 5 1 3 5 3
𝒦=〈w, , , , , , 〉 Then the NS W1∗ =〈w, , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10
is Nu-G*CS but not NuαCS, Nu-PCS Nu∗X .
Theorem 3.16:
The union of two Nu-G*CS’s is Nu-G*CS
Proof:
Let W1∗ and W2∗ be the two Nu-G*CS’s in Nu∗X and let W1∗ ∪W2∗ ⊆ 𝒦, where
𝒦 is a Nu-GOS in Nu∗X . Therefore W1∗ ⊆ 𝒦 or W2∗ ⊆ 𝒦 or both contained𝒦. Since
W1∗ and W2∗ are Nu-G*CS, Nu-cl( W1∗ )⊆ 𝒦 and Nu-cl( W2∗ ) ⊆ 𝒦 . Therefore
Nu-cl(W1∗∪W2∗ )⊆ 𝒦. Thus W1∗ ∪W2∗ is Nu-G*CS.
Remark 3.17:
The intersection of any two Nu-G*CSs is not an Nu-G*CS in general as seen in
the following example.
Example 3.18:
Let Nu∗X = {w1 , w2 } andlet Nuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X ,

5 5 1 1 5 8
where𝒦 =〈w, , , , , , 〉.
10 10 10 10 10 10
2 5 5 7 5 0 6 5 0 3 5 7
Then NS’s W1∗ = 〈w, , , , , , 〉 W2∗ =〈w, , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10
are Nu-G*CS’s in Nu∗X but W1∗∩W2∗ is not a Nu-G*CS in Nu∗X .
Theorem 3.19:
If W1∗ is Nu-G*CS in (Nu∗X ,Nuτ ), such that W1∗ ⊆W2∗⊆Nu-cl(W1∗ ). Then W2∗ is
also a Nu-G*CS of (Nu∗X ,Nuτ )
Proof:
Let 𝒦 be a Nu-GOS in (NuX∗ ,Nuτ ) such that W2∗ ⊆ 𝒦, SinceW1∗ ⊆W2∗ , W1∗ ⊆ 𝒦
and 𝒦 be aNu-GOS. Also since W1∗ is Nu-G*CS, Nu-cl(W1∗ )⊆ 𝒦. By hypothesis
W2∗ ⊆Nu-cl( W1∗ ). This implies Nu-cl( W2∗ )⊆Nu-cl(Nu-cl( W1∗ ))⊆ 𝒦 . Therefore
Nu-cl(W2∗)⊆ 𝒦. Hence W2∗ is Nu-G*CS of Nu∗X .

Theorem 3.20:
If W1∗ is both Nu-GOS and Nu-G*CS of (Nu∗X ,Nuτ ), then W1∗ is Nu-CS in
Nu∗X .
Proof: Let W1∗ is Nu-GOS in Nu∗X . Since W1∗ ⊆W1∗ , by hypothesis Nu-cl(W1∗ )⊆W1∗ . But
from the Definition, W1∗ ⊆Nu-cl(W1∗ ). Therefore Nu-cl(W1∗ )=W1∗. Hence W1∗ is Nu-CS
of Nu∗X .
Theorem 3.21:
Let (Nu∗X ,Nuτ ) be a NTS. Then Nu-GO(NuX∗ )=Nu-GC(Nu∗X ) iff every NS in
(NuX∗ , Nuτ ) is Nu-G*CS in NuX∗ .
Proof:
Necessity:
Suppose that Nu-GO(NuX∗ )=Nu-GC(Nu∗X ). Let W1∗ ⊆ 𝒦 and 𝒦 is Nu-GOS in
Nu∗X . This implies Nu-cl(W1∗)⊆Nu-cl(𝒦). Since 𝒦 is Nu-GOS in Nu∗X . Since by
hypothesis 𝒦 is Nu-GCS in NuX∗ , Nu-cl(𝒦)⊆ 𝒦. This implies Nu-cl(W1∗ )⊆ 𝒦.
Therefore W1∗ is Nu-G*CS in Nu∗X .
Sufficiency:
Suppose that every NS in (Nu∗X , Nuτ ) is Nu-G*CS in Nu∗X . Let
𝒦⊆Nu-O(NuX∗ ), then 𝒦⊆Nu-GO(Nu∗X ). Since 𝒦⊆ 𝒦 and 𝒦is Nu-OS in Nu∗X ,
by hypothesisNu-cl(𝒦)⊆ 𝒦. I.e.,𝒦⊆Nu-GC(Nu∗X ). Hence
Nu-GO(Nu∗X )⊆Nu-GC(Nu∗X ).Let W1∗ ⊆Nu-GC(NuX∗ ) then W1∗ C is an Nu-GOS in
Nu∗X . But Nu-GO(Nu∗X )⊆Nu-GC(NuX∗ ). ThereforeW1∗ C ⊆Nu-GC(Nu∗X ).
I.e.,W1∗ ⊆Nu-GO(Nu∗X ). Hence Nu-GC(Nu∗X )⊆Nu-GO(Nu∗X ). Thus
Nu-GO(Nu∗X )⊆Nu-GC(Nu∗X ).
Theorem 3.22:
If W1∗ is Nu-OS and an Nu-G*CS in (Nu∗X ,Nuτ ) , then
W1∗ is Nu-ROS in Nu∗X
W1∗ is Nu-RCS in Nu∗X

Proof:
(i) Let W1∗ be a Nu-OS and a Nu-G*CS in Nu∗X .Then Nu-cl(W1∗ )⊆W1∗ . I.e., Nu
int(Nu-clW1∗ ))⊆W1∗ .Since W1∗ is a Nu-OS, W1∗ is Nu-POS in Nu∗X . Hence
W1∗ ⊆Nu-int(Nu-cl( W1∗ )). Therefore W1∗ =Nu-int(Nu-cl( W1∗ )). Hence W1∗ is
Nu-ROS in Nu∗X .
(ii): Let W1∗ be a Nu-OS and an Nu-G*CS inNu∗X . Then Nu-cl(W1∗ )⊆W1∗. I.e.,
Nu-cl(Nu-int(W1∗ ))⊆W1∗ . Since W1∗ is a Nu-OS, W1∗ is Nu-OS in Nu∗X . Hence
W1∗ ⊆Nu-cl(Nu-int( W1∗ )). Therefore W1∗ =Nu-int(Nu-cl( W1∗ )). Hence W1∗ is
Nu-RCS in Nu∗X .
4. Neutrosophicg*-OPEN SETS :-
In this section we introduce Neutrosophicg*-open sets and studied some of its
properties.
Definition 4.1:
An NS W1∗ is said to be aNeutrosophicg*-open set (Nu-G*OS in short) in
( NuX∗ , Nuτ ) if the complement W1∗ C is Nu-G*CS in Nu∗X .The family of all
Nu-G*OS’s of A NTS (Nu∗X , Nuτ ) is denoted by Nu-G*O(Nu∗X ).
Theorem 4.2:
A subset W1∗ of (NuX∗ , Nuτ ) is Nu-G*OS iffW2∗ ⊆ Nu-int(W1∗ ) whenever W2∗ is
Nu-GCS in Nu∗X and W2∗ ⊆ W1∗ .
Proof:
Necessity: Let W1∗ is Nu-G*OS in NuX∗ . Let W2∗ be a Nu-GCS in Nu∗X and
W2∗ ⊆ W1∗ . Then W2∗ C is Nu-GOS in Nu∗X such that W1∗ C ⊆ W2∗ C . Since W1∗ C is
Nu-G*CS, we have Nu-cl(W1∗ C )⊆ W2∗ C . HenceNu-int(W1∗ ))𝐶 ⊆ W2∗ C . Therefore W2∗ ⊆
Nu-int(W1∗ ).

Sufficiency: Let W2∗ ⊆ Nu-int(W1∗ ) whenever W2∗ is Nu-GCS in NuX∗ and W2∗ ⊆ W1∗ .
Then W1∗ C ⊆ W2∗ C and W2∗ C is Nu-GOS. By hypothesis, (Nu-int(W1∗))C⊆ W2∗ C , which
implies Nu-cl( W1∗ C )⊆ W2∗ C . Therefore W1∗ C is Nu-G*CS of Nu∗X . Hence W1∗ is
Nu-G*OS in NuX∗ .
Theorem 4.3:
Every Nu-OS is Nu-G*OS .
Proof:
Let W1∗ be a Nu-OS. Then W1∗ C is Nu-CS. By Theorem 3.3, every Nu-CS is
Nu-G*CS. Therefore W1∗ C is Nu-G*CS. Hence W1∗ is Nu-G*OS.
Example 4.4:
Let Nu∗X = {w1 , w2 } and let Nuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X , where
2 5 2 5 5 8 2 5 3 7 5 8
𝒦 =〈w, , , , , , 〉. Then NSW1∗ =〈 w, , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10
is Nu-G*OS but not an Nu-OS in Nu∗X .
Theorem 4.5:
Every Nu-ROS is Nu- G*OS .
Proof:
Let W1∗ be aNu-WS. ThenW1∗ C is Nu-RCS. By Theorem 3.15, every Nu-RCS is
Nu-G*CS. Therefore W1∗ C is Nu-G*CS. Hence W1∗ is Nu-G*OS.
Example 4.6:
Let Nu∗X = {w1 , w2 } and let Nuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X , where
3 5 6 7 5 3 3 5 7 4 5 6
𝒦 =〈w, , , , , , 〉 Then NS W1∗ =〈w, , , , , , 〉is Nu-G*OS
10 10 10 10 10 10 10 10 10 10 10 10
but not an Nu-ROS in Nu∗X .

Theorem 4.7:
Every Nu-G*OS is Nu-GOS .
Proof:
Let W1∗ be a Nu-G*OS in (Nu∗X , Nuτ ) . Then W1∗ C is Nu-G*CS. By Theorem
3.6, every Nu-G*CS is Nu-GCS. Therefore W1∗ C is Nu-GCS. Hence W1∗ is Nu-GOS.
Example 4.8:
Let Nu∗X ={w1 ,w2 } and let Nuτ ={0Nu, 𝒦, 1Nu}is NT on Nu∗X , where
5 5 4 2 5 2 4 5 6 2 5 6
𝒦 =〈w, , , , , , 〉. Then NS W1∗ =〈w, , , , , , 〉is Nu-GOS
10 10 10 10 10 10 10 10 10 10 10 10
but not an Nu-G*OS inNu∗X .
Theorem 4.9:
Every Nu-G*OS is Nu-αGOS .
Proof:
Let W1∗ be aNu-G*OS in (Nu∗X ,Nuτ ). Then W1∗ C is Nu-G*CS. By Theorem 3.9,
every Nu-G*CS is Nu-αGCS. Therefore W1∗ C is Nu-αGCS. Hence W1∗ is Nu-αGOS.
Example 4.10:
Let Nu∗X ={ w1 , w2 } and let Nuτ ={0Nu, 𝒦 ,1Nu}is NT on Nu∗X , where 𝒦 =

4 5 2 6 5 7 6 5 4 5 5 3
〈w, , , , , , 〉Then the NS W1∗ =〈w, , , , , , 〉 is Nu-𝛼GOS
10 10 10 10 10 10 10 10 10 10 10 10
but not an Nu-G*OS in Nu∗X .
Theorem 4.11:
The intersection of two Nu-G*OS’s is Nu-G*OS.
Proof:
Let W1∗ and W2∗ be the two Nu-G*OS’s in Nu∗X , W1∗ C and W2∗ C are

Nu-G*CS. By Theorem 3.28W1∗ C ∪W2∗ C is Nu-G*CS in Nu∗X . Therefore (W1∗ ∩W2∗ )is
Nu-G*CS. Thus W1∗ ∩W2∗ is Nu-G*OS in Nu∗X .
Theorem 4.12:
Let (Nu∗X , Nuτ ) be a NTS. If W1∗ is NS of NuX∗ . Then for every W1∗ ∈
Nu-G*O( Nu∗X ) and every W2∗ ∈ ( Nu∗X ), Nu-int( W1∗ )⊆ W2∗ ⊆ W1∗ implies W2∗ ∈
Nu-G*O(Nu∗X ).
Proof:
By hypothesis Nu-int(W1∗ )⊆W2∗ ⊆ W1∗ . Taking complement on both sides, we
get W1∗ C ⊆ W2∗ C ⊆Nu-cl(W1∗ C ). Let W2∗ C ⊆ 𝒦 and 𝒦 is Nu-GOS in Nu∗X . SinceW1∗ C ⊆
W2∗ C , W1∗ C ⊆ 𝒦 . Since W1∗ C is Nu-G*CS, Nu-cl( W1∗ C )⊆ 𝒦 . Therefore
Nu-cl(W2∗ C )⊆Nu-cl(W1∗ C )⊆ 𝒦. Hence W2∗ C is Nu-G*CS in Nu∗X . Therefore W2∗ is
Nu-G*OS in NuX∗ . I.e.,W2∗ ⊆Nu-G*O(Nu∗X )
Definition: 4.13:
For any Nu. setW1∗ in any NSTS,
Nu-g*cl(W1∗ ) =∩{ 𝒰 : 𝒰 is Nu-g*CS Nu. set and W1∗ ⊆ 𝒰 }
Nu-g*int (W1∗) = ∪{ :𝒱 is Nu-g* OS and W1∗ ⊇ 𝒱 }
Theorem: 4.14:
In a Its (Nu∗X , Nuτ ) a Nu. setW1∗ is Nu-g*- CS iff W1∗ = Nu-g* cl(W1∗ ).
Proof:
Let W1∗ be a Nu-g*CS Nu. set in NSTS (Nu∗X , Nuτ ). Since W1∗ ⊆W1∗ and W1∗ is
Nu-g*CS ,
W1∗ ∈{ 𝒦 : 𝒦 is a Nu-g*CS Nu. set and W1∗ ⊆𝒦 } and W1∗ ⊆ 𝒦 ⇒ W1∗ = ∩{ 𝒦: 𝒦
is Nu-g*CS and W1∗ ⊆ 𝒦 } that is W1∗ = Nu-g* cl(W1∗ ).
Conversely, suppose that W1∗ = Nu-g*cl(W1∗ ),that is W1∗ = ∩{ 𝒦: 𝒦 is a Nu-g*- CS

Nu. set and W1∗ ⊆𝒦 }. This denotes thatW1∗ ∈{ 𝒦: 𝒦 is a Nu-g*CS Nu. set and
W1∗ ⊆ 𝒦 }. From nowW1∗ is Nu-g*CS Nu. set.
Theorem: 4.15 :
In a NSTS NuX∗ the subsequent results hold for Nu-g* - closure.
1) Nu-g*cl (0Nu) = 0Nu.
2) Nu-g*cl (W1∗ ) is Nu-g*CS Nu. set in Nu∗X .
3) Nu-g*cl (W1∗ ) ⊆Nu-g*cl (W2∗ ) if W1∗ ⊆W2∗ .
4) Nu-g* cl ( Nu-g*cl(W1∗ )) = Nu-g* cl(W1∗ ).
5) Nu-g* cl (W1∗ ∪ W2∗ )⊇Nu-g* cl(W1∗ )∪Nu-g* cl(W2∗ ).
6) Nu-g* cl (W1∗ ∩ W2∗ )⊆Nu-g* cl(W1∗ )∩Nu-g* cl(W2∗ ).
Proof: easy
Theorem: 4.16 :
In a NSTS NuX∗ , a Nu. setW1∗ is Nu-g* OS iff W1∗ = Nu-g*int (W1∗ ).
Proof:
Let W1∗ be Nu-g*OS Nu. set in Nu∗X . Since W1∗ ⊆W1∗ and W1∗ is Nu-g* OS
andW1∗ ∈{ 𝒦: 𝒦 is a Nu-g* OS Nu. set and W1∗ ⊇ 𝒦 } and W1∗ ⊇ 𝒦 ⇒ W1∗ =
∪{𝒦: 𝒦 is Nu-g*OS and W1∗ ⊇ 𝒦 }. That is W1∗ =Nu-g*int(W1∗ ).
Conversely, suppose that W1∗ = Nu-g*int (W1∗ ), that is W1∗ =∪( 𝒦: 𝒦 is Nu-g*OS and
W1∗ ⊇ 𝒦}. This implies that W1∗ ∈{ 𝒦: 𝒦 is Nu-g*OS and W1∗ ⊇ 𝒦}.Hence W1∗ is
Nu-g*OS Nu. set.
Theorem 4.17 :
In a NSTS NuX∗ , the following hold for Nu-g* -interior.
1) Nu-g*int (0Nu) = 0Nu
2) Nu-g*int(W1∗ ) ⊆Nu-g*int(W2∗ ) if W1∗ ⊆W2∗ .
3) Nu-g*int(W1∗ ) is Nu-g*OS in Nu∗X .
4) Nu-g*int (Nu-g*int (W1∗ )) = Nu-g*int (W1∗ ).

5) Nu-g*int (W1∗ ∪ W2∗ )⊇Nu-g*int(W1∗ )∪Nu-g*int (W2∗ ).
6) Nu-g*int (W1∗ ∩ W2∗ )⊆Nu-g*int(W1∗ )∩Nu-g*int (W2∗ ).
Proof: proof is as usual.
5. Neutrosophic G*-Continuous :
In this section we introduce Neutrosophicg*-continuous and studied some
properties of neutrosophic g* - open map and closed map.
Definition 5.1 :
Let NuX∗ and Nu∗Y betwoNTS.Afunction𝑓: Nu∗X ⟶ NuY∗ is said to be
neutrosophic g*-continuous(Nu-g*-continuous) if the inverse image of every
neutrosophic open set in NuY∗ is g* - open in Nu∗X .
Theorem 5.2 :
A function𝑓: NuX∗ ⟶ Nu∗Y isNu-g*-continuousiffthe inverse image of every
Nu-closed set in Nu∗Y is g* - closed set inNuX∗ .
Proof:
Suppose the function 𝑓: Nu∗X ⟶ Nu∗Y is Nu-g* - continuous. Let ℱ be Nu-closed set
in Nu∗Y . Then ℱ 𝑐 is Nu- open set in Nu∗Y . Since 𝑓 is Nu-g* - continuous, 𝑓 −1 (ℱ 𝑐 ) isNu-
g* - open in NuX∗ . But 𝑓 −1 (ℱ 𝑐 )= 𝑓 −1 (ℱ 𝑐 ) 𝑐 and so 𝑓 −1 (ℱ)is Nu-g* - closed in Nu∗X .
Conversely, assume that the inverse image of every Nu-closed set in Nu∗Y is Nu-g*
- closed in Nu∗X . Let 𝒱 be neutrosophic open set in Nu∗Y . Then𝒱 𝑐 is Nu-closed in Nu∗Y .
By hypothesis, 𝑓 −1 (𝒱 𝑐 ) is Nu-g*-closed set in Nu∗X . But 𝑓 −1 (𝒱 𝑐 ) = 𝑓 −1 (𝒱 𝑐 ) 𝑐
and so 𝑓 −1 (𝒱)is Nu-g* - open set in NuX∗ . Hence 𝑓 is Nu-g*-continuous.
Theorem 5.3 :
Every Nu- continuous function is Nu-g* -continuous.
Proof:
Let 𝑓: Nu∗X ⟶ Nu∗Y be Nu-continuous. Let ℱ be Nu-closed set in Nu∗Y . Then

𝑓 −1 (ℱ) is Nu-closed set in Nu∗X since 𝑓 is neutrosophic continuous. And therefore
𝑓 −1 (ℱ)is Nu-g* - closed in NuX∗ . Hence 𝑓 is Nu-g* -continuous.
Theorem 5.4 :
Every Nu-g*-continuous function is Nu-g-continuous.
Proof:
Let 𝑓: Nu∗X ⟶ NuY∗ be Nu-g* - continuous.Let ℱbeaNu-closed setinNuY∗ . Since
𝑓 is Nu-g* - continuous,𝑓 −1 (ℱ) is Nu-g* - closed in Nu∗X . And therefore 𝑓 −1 (ℱ)is Nu-g -
closed in NuX∗ as every Nu-g*-closed set is Nu-g - closed. Hence 𝑓 is
Nu-g-continuous.
The converse of the above theorem need not be true as seen from the following
example.
Theorem 5.5 :
If 𝑓: Nu∗X ⟶ NuY∗ is Nu-g* - continuous and Nu∗X is neutrosophic
–T*1/2NTS. Then 𝑓 is neutrosophic -continuous.
Proof:
Let 𝑓: Nu∗X ⟶ NuY∗ be Nu-g*- continuous . Let ℱ be Nu-closed set in Nu∗Y . Then
𝑓 −1 (ℱ)is 𝑓 −1 (ℱ)Nu-g* - closed in Nu∗X since 𝑓is Nu-g* - continuous. Also since Nu∗X
is neutrosophic - T*1/2,𝑓 −1 (ℱ)is closccl in Nu∗X . Hence 𝑓 is Nu-continuous.
Theorem 5.6 :
If 𝑓: Nu∗X ⟶ NuY∗ is Nu-g - continuous and Nu∗X is neutrosophic-
T*1/2NTS. Then 𝑓 is Nu-g* - continuous.
Proof :
Let 𝑓: Nu∗X ⟶ NuY∗ be Nu-g - continuous. Let ℱ be Nu-closed set in Nu∗Y , then
𝑓 −1 (ℱ) is g- closed in Nu∗X . Since X is neutrosophic - T*1/2, 𝑓 −1 (ℱ)is Nu-g* - closed in
Nu∗X . Hence 𝑓 is Nu-g* -continuous.

Theorem 5.7:
If𝑓: Nu∗X ⟶ Nu∗Y is Nu-g* - continuous and g : Nu∗Y ⟶ NuZ∗ is
Nu-continuous then gof :Nu∗X ⟶ NuZ∗ is Nu-g * -continuous.
Proof :
Let ℱ be Nu-closed set in Nu∗Z . Then 𝑔−1 (ℱ)is closed in Nu∗Y since 𝑔 is
Nu-continuous. And then 𝑓 −1 (𝑔−1 (ℱ)) is Nu-g* - closed in Nu∗X since 𝑓 is
Nu-g*-continuous.
Now 𝑔 ∘ 𝑓 −1
(ℱ)=𝑓 −1 (𝑔−1 (ℱ))is Nu-g*-closedinNuX∗ .Hence 𝑔 ∘ 𝑓: Nu∗X ⟶ Nu∗Z is
Nu-g*-continuous.
Theorem 5.8
If 𝑓: Nu∗X ⟶ Nu∗Y is Nu-g* - continuous and g :Nu∗Y ⟶ NuZ∗ is Nu-g* - continuous
and
Nu∗Y is neutrosophic –T*1/2space. Then gof :Nu∗X ⟶ Nu∗Z is Nu-g*- continuous.
Proof:
Let ℱbe Nu-closed set in Nu∗Z . Then 𝑔−1 (ℱ) is Nu-g*CS in NuY∗ since 𝑔 is
Nu-g*- continuous. Since Nu∗Y is neutrosophic –T*1/2, 𝑔−1 (ℱ) is Nu-closedin Nu∗Y .
And then 𝑓 −1 (𝑔−1 (ℱ)) is Nu-g*CS in NuX∗ as 𝑓 is Nu-g* - continuous. Now
𝑔∘𝑓 −1
(ℱ) = 𝑓 −1 (𝑔−1 (ℱ))is Nu-g*CS in Nu∗X . Hence 𝑔 ∘ 𝑓is Nu-g*
-continuous.
Definition 5.9
A map 𝑓: Nu∗X ⟶ Nu∗Y is said to be neutrosophic g* - open if the image of every
neutrosophic open set in NuX∗ is Nu-g*-open set in Nu∗Y .
Definition 5.10 :
A map 𝑓: NuX∗ ⟶ Nu∗Y is said to be neutrosophic g* - closed if the image of every
Nu-closed set in Nu∗X is Nu-g*-closed set in Nu∗Y .

Theorem 5.11 :
Everyneutrosophic open map is neutrosophic g* - open.
Proof:
Let 𝑓: Nu∗X ⟶ Nu∗Y be a neutrosophic open map let 𝒱 be an neutrosophic open
set in Nu∗X then 𝑓(𝒱) is Nu-open in NuY∗ since 𝑓 is neutrosophic open map. And
therefore 𝑓(𝒱) is Nu-g* - open in NuY∗ . Hence 𝑓 is neutrosophic g* open map.
Theorem 5.12:
If 𝑓: Nu∗X ⟶ NuY∗ is Nu-g*-open map and NuY∗ is neutrosophic –T*1/2, then 𝑓 is a
Nu-open map.
Proof :
Let 𝑓: Nu∗X ⟶ NuY∗ is neutrosophic g*- open map. Let 𝒱 be neutrosophic open
set in Nu∗X .
Then 𝑓 (𝒱) isNu- g* - open in Nu∗Y . Since Nu∗Y is neutrosophic -T*1/2 ,𝑓(𝒱) is
neutrosophic open set in NuY∗ . Hence 𝑓 isNu- open map.
Theorem 5.13:
Every Nu-g* - open map is neutrosophic g -open.
Proof:
Let 𝑓: Nu∗X ⟶ Nu∗Y be a Nu-g*- open map. Let 𝒱 be neutrosophic open set in
Nu∗X . Then 𝑓 (𝒱) isNu-g* - open in Nu∗Y since 𝑓 is Nu-g* - open map. And therefore
𝑓(𝒱) is Nu-g- open set in NuY∗ . Hence 𝑓 is neutrosophic g - open map.
Theorem 5.14 :
If 𝑓: NuX∗ ⟶ Nu∗Y is neutrosophic g - open and Nu∗Y is neutrosophic - *T1/2 space, then
𝑓 in Nu-g* - openmap.
Proof :
Let 𝒱 be neutrosophic open set in Nu∗X . Then 𝑓(𝒱) is Nu-g - open in Nu∗Y . Since
Nu∗Y is neutrosophic -*T1/2,𝑓 (𝒱) is Nu-g* - open in NuY∗ . And hence 𝑓 is Nu-g* - open
map.

Theorem 5.15 :
Every Nu-closed map is Nu-g* -closed map.
Proof :
Let 𝑓: Nu∗X ⟶ Nu∗Y be Nu-closed map. Let ℱ be Nu-closed set in NuX∗ .Then
𝑓(ℱ) is closed in Nu∗Y . And therefore 𝑓(ℱ) isNu- g* - closed in NuY∗ . And hence 𝑓 is
Nu-g* - closedmap.
Theorem 5.16 :
If 𝑓: NuX∗ ⟶ Nu∗Y is Nu-g* - closed and Nu∗Y is neutrosophic -T*1/2. Then𝑓 is
Nu-closed map.
Proof:
Let 𝑓: Nu∗X ⟶ NuY∗ be Nu-g* - closed map. Let ℱ be Nu-closed setin
Nu∗X .Then𝑓 −1 (ℱ)isNu-g*-closedin
Nu∗Y .SinceNu∗Y isneutrosophic-T*l/2,𝑓(ℱ)isNu-closedin Nu∗Y . Hence 𝑓 is neutrosophic
closcd map.
Theorem 5.17 :
A map𝑓: NuX∗ ⟶ Nu∗Y isNu-g*-closediffforeachneutrosophic set𝒮 of Nu∗Y and for
each neutrosophic open set 𝒰 such that 𝑓 −1 (𝒮)⊆𝒰 there is a Nu-g*-open set 𝒱 of
Nu∗Y such that 𝒮⊆𝒱 and 𝑓 −1 (𝒱)⊆ 𝒰.
Proof:
Suppose 𝑓 is Nu-g* - closed map. Let 𝒮be a neutrosophic set of NuY∗ and 𝒰 be
aneutrosophic open set of Nu∗X such that 𝑓 −1 (𝒰)⊆𝒰. Then 𝒱 = Nu∗Y –𝑓 (𝒰𝐶 ) isa
Nu-g*-open set in Nu∗Y such that 𝒮⊆𝒱 and 𝑓 −1 (𝒱)⊆ 𝒰.
Conversely, suppose thatℱis aNu-closed set of Nu∗X . Then
𝑓 −1 (𝑓(ℱ 𝐶 ))⊆ℱ 𝐶 and ℱ 𝐶 is Nu-open. By hypothesis, there is a Nu-g*-open set 𝒱 of
Nu∗Y such that 𝑓(ℱ)𝑐 ⊆𝒱 and 𝑓 −1 (𝒱)⊆ℱ 𝐶 Therefore ℱ⊆𝑓 −1 (𝒱)𝑐 . Hence
𝒱 𝑐 ⊆𝑓(ℱ)⊆𝑓(𝑓 −1 (𝒱)𝑐 )⊆𝒱 𝑐 which implies 𝑓(ℱ) = 𝒱 𝑐 . Since 𝒱 𝑐 is Nu-g* - closed, 𝑓(ℱ)
is Nu-g*CS and thus 𝑓 is a Nu-g*- closed m ap.

Conclusion :
In this chapter, we have defined the neutrosophic g* closed sets and open sets.then
discussed aboutneutrosophic g* continuity Then,we have presented some properties of these
operations. We havealso investigated neutrosophic topological structures ofneutrosophic sets.
Hence, we hope that the findings in this chapterwill help researchers enhance and promote the
further study onneutrosophic topology.
References :-
[1] Abdel-Basset, M., Mohamed, R., Elhoseny, M., & Chang, V. (2020). Evaluation
framework for smart disaster response systems in uncertainty environment. Mechanical
Systems and Signal Processing, 145, 106941.
[2] Abdel-Basset, M., Ali, M., &Atef, A. (2020). Uncertainty assessments of linear
time-cost tradeoffs using neutrosophic set. Computers & Industrial Engineering, 141,
106286.\
[3] Abdel-Basset, M., Ali, M., &Atef, A. (2020). Resource levelling problem in
construction projects under neutrosophic environment. The Journal of
Supercomputing, 76(2), 964-988.
[4] Abdel-Basset, M., Gamal, A., Son, L. H., &Smarandache, F. (2020). A Bipolar
Neutrosophic Multi Criteria Decision Making Framework for Professional Selection.
Applied Sciences, 10(4), 1202.
[5] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20(1986),87-94.
[6] I.Arokiarani, R. Dhavaseelan, S. Jafari, M. Parimala,On Some New Notions and
Functions In Neutrosophic Topological Spaces,Neutrosophic Sets and Systems, Vol.
16, 2017,(16-19)
[7] V.Banupriya, S.Chandrasekar, Neutrosophic α generalized semi closed
set,Neutrosophic Sets and Systems, Vol. 28, 2019,162-170.
[8] R .Dhavaseelan and S.Jafari, Generalized Neutrosophic closed sets, New trends in
Neutrosophic theory and applications Volume II- 261-273,(2018).
[9] R. Dhavaseelan, S. Jafari and md.Hanif page, Neutrosophic generalized
α-contra-continuity, creat. math. inform. 27 (2018), no. 2, 133 – 139

[10] FlorentinSmarandache ,Neutrosophic and NeutrosophicLogic,First International

Confer On
Neutrosophic Logic, Set, Probability, and Statistics University of New Mexico,
Gallup, NM 87301, USA (2002), smarand@unm.edu
[11] FloretinSmaradache, Neutrosophic Set: - A Generalization of Intuitionistic Fuzzy
set,Journal of Defense resourses Management. 1(2010), 107-114.
[12] Ishwarya, P and Bageerathi, K., On Neutrosophic semiopen sets in
Neutrosophictopological spaces, International Jour. of Math. Trends and Tech. 2016,
214-223.
[13] D.Jayanthi,  Generalized Closed Sets in Neutrosophic Topological
Spaces,International Journal of Mathematics Trends and Technology (IJMTT)-
Special IssueICRMIT March 2018.
[14] Maheswari, C., Sathyabama, M., Chandrasekar, S., Neutrosophic generalized b-closed
Sets Neutrosophic Topological Spaces,Journal of physics Conf. Series, 1139 (2018)
012065.
[15] C.Maheswari , S. Chandrasekar ,Neutrosophicgb-closed Sets and
Neutrosophicgb-Continuity,Neutrosophic Sets and Systems, Vol. 29, 2019,89-99
[16] T Rajesh kannan ,S.Chandrasekar,Neutosophic ωα-closed sets in Neutrosophic
topological space, Journal Of Computer And Mathematical
Sciences,vol.9(10),1400-1408 Octobe2018.
[17] T Rajesh kannan ,S.Chandrasekar,Neutosophic α-continuous multifunction in
Neutrosophic topological space, The International Journal of Analytical and
Experimental Modal Analysis, Volume XI,IssueIX,September 2019,1360-9367
[18] T.RajeshKannan, and S.Chandrasekar, Neutrosophicα-Irresolute Multifunction In
Neutrosophic Topological Spaces, " Neutrosophic Sets and Systems 32, 1
(2020),390-400. https://digitalrepository.unm.edu/ nss_journal/vol32/iss1/25
[19] A.A. Salama and S.A. Alblowi, Generalized Neutrosophic Set and Generalized
NeutrosophicTopological Spaces, Journal computer Sci. Engineering, Vol.(ii)
No.(7)(2012).
[20] A.A.Salama and S.A.Alblowi, Neutrosophic set and Neutrosophic topological space,
ISOR J.mathematics, Vol.(iii) ,Issue(4),(2012).pp-31-35.

[21] V.K.Shanthi ,S.Chandrasekar, K.SafinaBegam, NeutrosophicGeneralized Semi

Closed Sets In Neutrosophic Topological Spaces, International Journal of Research in
Advent Technology, Vol.6, No.7, July 2018, 1739-1743
[22] V. VenkateswaraRao,Y. SrinivasaRao, Neutrosophic Pre-open Sets and Pre-closed
Sets in Neutrosophic Topology, International Journal of ChemTechResearch,
Vol.10 , pp 449- 458, 2017
[23] Fatimah M. Mohammed and Sarah W. Raheem, Generalized b Closed Sets and
Generalized b Open Sets in Fuzzy Neutrosophic bi-Topological
Spaces, Neutrosophic Sets and Systems, vol. 35, 2020, pp. 188-197.
DOI: 10.5281/zenodo.3951661
[24] R. Suresh and S. Palaniammal, Neutrosophic Weakly Generalized open and Closed
Sets Neutrosophic Sets and Systems, vol. 33, 2020, pp. 67-77. DOI:
10.5281/zenodo.3782855
[25] G.Jayaparthasarathy, M.ArockiaDasan, V.F.Little Flower and R.RibinChristal, New
Open Sets in N-Neutrosophic Supra Topological Spaces, Neutrosophic Sets and
Systems, vol. 31, 2020, pp. 44-62. DOI: 10.5281/zenodo.3638252
[26] R. Vijayalakshmi, A. Savitha Mary and S. Anjalmose: Neutrosophic Semi-Baire
Spaces, Neutrosophic Sets and Systems, vol. 30, 2019, pp. 132-142. DOI:
10.5281/zenodo.3569673
[27] I. Mohammed Ali Jaffer and K. Ramesh: Neutrosophic Generalized Pre Regular Closed
Sets,Neutrosophic Sets and Systems, vol. 30, 2019, pp. 171-181. DOI:
10.5281/zenodo.3569681
[28] T. Nandhini, M. Vigneshwaran:pen map, αg#ψclosed map and Nαg#ψ-homomorphism
in neutrosophic topological spaces, Neutrosophic Sets and Systems, vol. 29, 2019, pp.
186-196, DOI: 10.5281/zenodo.3514429
[29] Anitha S, Mohana K, F. Smarandache: On NGSR Closed Sets in Neutrosophic
Topological Spaces, Neutrosophic Sets and Systems, vol. 28, 2019, pp. 171-178. DOI:
10.5281/zenodo.3382534
[30] R. Narmada Devi, R. Dhavaseelan and S. Jafari: A Novel on NSR Contra Strong
Precontinuity, Neutrosophic Sets and Systems, vol. 27, 2019, pp. 70-79. DOI:
10.5281/zenodo.3275708

CHAPTER-8
Neutrosophic 𝜶-Baire Spaces

R. Vijayalakshmi*, A. Savitha Mary** and S. Anjalmose**
* Department of Mathematics,
Arignar Anna Government Arts College, Namakkal-2,
Tamilnadu, India.Email:viji_lakhmi80@rediffmail.com
** Department of Mathematics,
St. Joseph’s College of Arts & Science (Autonomous), Manjakuppam,
Cuddalore - 607001, Tamilnadu, India.
Email: savitha.mary139@gmail.com, ansalmose@gmail.com
1. Introduction :-
The fuzzy set was introduced by L.A. Zadeh [15] in 1965, where each element had a
degree of membership. The Intuitionstic fuzzy set (Ifs for short) on a universe X was
introduced by K. Atanassov [ 2, 3,4] in 1983 as a generalization of fuzzy set, where besides the
degree of membership and the degree of non- membership of each element. The fuzzy
topological space was introduced by C.L.Chang in 1968[6]. The idea of "neutrosophic set" was
first given by Smarandache [9,10]. Neutrosophic operations have been investigated by
A.A.Salama at el. [1]. A.A.Salama and S.A.Alblowi presented the concept of Neutrosophic
Topological Spaces[12].The concept of Neutrosophic𝛼-open sets was given byI. Arokiarani
and R. Dhavaseelan [5].The concept of Baire space in fuzzy setting was introduced and studied
by G.Thangaraj and S. Anjalmose [14].The idea of neutrosophic Baire spaces are introduced
by R. Dhavaseelan, S. Jafari ,R. Narmada Devi, Md. Hanif [8].
2. Preliminaries :-
Now we introduce some basic notions and results that are used in the sequel. In this
work by a neutrosophic topological space we shall mean a non-empty set X together with a
neutrosophic topology T (in the sense of Chang) and denote it by (X, T). The interior,
closure and then complement of a neutrosophic set A will be denoted by 𝑖𝑛𝑡(A),𝑐𝑙(A) and
1-A (or 𝐴 ) respectively.
Definition 1.1. [5] :

A neutrosophic topology (NT) on a nonempty set X is a family T of neutrosophic sets in
X satisfying the following axioms:
(i) 0𝑁 , 1𝑁 ∈ 𝑇,
(ii) 𝐺1 ∩ 𝐺2 ∈ 𝑇 for any 𝐺1 , 𝐺2 ∈ 𝑇.
(iii)⋃ 𝐺𝑖 for arbitrary family 𝐺𝑖 | 𝑖 ∈ ⋀ .
In this case the ordered pair (X, T) or simply X is called a neutrosophic Topological Space
(briefly NTS) and each Neutrosophic set in T is called a neutrosophic open set (briefly NOS).
The complement A of a NOS A in X is called a neutrosophic closed set (briefly NCS) in X.
Definition 1.2. [5] :

Let A be a neutrosophic set in a neutrosophic topological space X. Then
Nint(A) = ∪ 𝐺 | 𝐺𝑖𝑠𝑛𝑒𝑢𝑡𝑟𝑜𝑠𝑜𝑝𝑕𝑖𝑐𝑜𝑝𝑒𝑛𝑠𝑒𝑡𝑖𝑛𝑋𝑎𝑛𝑑𝐺  A is called the neutrosophic
interior of A; Ncl(A) = ∩ 𝐺 | 𝐺𝑖𝑠𝑛𝑒𝑢𝑡𝑟𝑜𝑠𝑜𝑝𝑕𝑖𝑐𝑐𝑙𝑜𝑠𝑒𝑑𝑠𝑒𝑡𝑖𝑛𝑋𝑎𝑛𝑑𝐺  A is called the
neutrosophic closure of A.

A neutrosophic set A in a neutrosophic topological space X is said to a Neutrosophic
𝛼 -Open set(NSOS) if 𝐴 ⊆ 𝑁𝑖𝑛𝑡(𝑁𝑐𝑙 𝑁𝑖𝑛𝑡 𝐴 ) and Neutrosophic 𝛼 -Closed set (NSCS)
if𝑁𝑐𝑙 𝑁𝑖𝑛𝑡 𝑁𝑐𝑙(𝐴) ⊇𝐴

N 𝛼 int(A) = ∪ 𝐺 | 𝐺𝑖𝑠𝑛𝑒𝑢𝑡𝑟𝑜𝑠𝑜𝑝𝑕𝑖𝑐𝛼 − 𝑜𝑝𝑒𝑛𝑠𝑒𝑡𝑖𝑛𝑋𝑎𝑛𝑑𝐺  A is called the
neutrosophic interior of A;
N 𝛼 cl(A) = ∩ 𝐺 | 𝐺𝑖𝑠𝑛𝑒𝑢𝑡𝑟𝑜𝑠𝑜𝑝𝑕𝑖𝑐𝛼 − 𝑐𝑙𝑜𝑠𝑒𝑑𝑠𝑒𝑡𝑖𝑛𝑋𝑎𝑛𝑑𝐺  A is called the
neutrosophic closure of A;
Result 1.5 :
N𝛼cl(A) = 𝐴⋃𝑁𝑐𝑙(𝑁𝑖𝑛𝑡 𝑁𝑐𝑙 𝐴)
N𝛼int(A) = 𝐴⋂𝑁𝑖𝑛𝑡(𝑁𝑐𝑙 𝑁𝑖𝑛𝑡 𝐴 )

2. Neutrosophic 𝛼-nowhere dense sets :

Definition 2.1:
A neutrosophic set A in neutrosophic topological space (X, T) is called neutrosophic
𝛼-dense if there exists no neutrosophic𝛼-Closed set B in (X, T) such that A  B  1N .
That is Ncl ( A)  1N
Example 2.1:
Let X = {a, b}. Define the Neutrosophic set A, B and C on X as follows:
 a b  a b  a b 
A  x,  , ,  , ,  , 
 0.2 0.4   0.2 0.4   0.5 0.6 
 a b  a b  a b 
B  x,  , ,  , ,  , 
 0.6 0.2   0.6 0.2   0.3 0.4 
 a b  a b  a b 
C  x,  , ,  , ,  , 
 0.3 0.4   0.3 0.4   0.4 0.4 
Then the families T  0 N ,1N , A, B, A  B is neutrosophic topology on X. Thus (X, T) is a
Neutrosophic topological space. Now the sets B, A  B & C are neutrosophic𝛼-dense set in (X,
T).
Definition 2.2 :
A neutrosophic set A in neutrosophic topological space (X, T) is called neutrosophic
𝛼-nowhere dense if there exists no non-zero neutrosophic 𝛼 -open set B in (X, T) such that
B  Ncl (A). That is N int( Ncl ( A)) = 0N
In Example 2.1: The sets 𝐵 𝑎𝑛𝑑𝐴 ∪ 𝐵 are neutrosophic𝛼-nowhere dense set in (X, T).
Proposition 2.1:
If A is a Neutrosophic 𝛼-nowhere dense set in (X, T), then A is a Neutrosophic
𝛼-dense set in (X, T)
Proposition 2.2:
If A isbe a Neutrosophic 𝛼 - closed set in (X, T), then Ais a neutrosophic𝛼-nowhere

dense set in(X, T) if and only if N int( A)  0 N
Proof :
If A is non zero neutrosophic 𝛼 - closed set in (X, T) then Ncl ( A)  A .If
N int( A)  0 N then N int( Ncl ( A))  N int( A)  0 N . So A is a neutrosophic 𝛼-nowhere

dense set in (X, T). Conversely let
A is a neutrosophic 𝛼-nowhere dense set in (X, T). Then N int( Ncl ( A))  0 N .
Which implies that N int( A)  N int( Ncl ( A)  0 N , since Ais a Neutrosophic 𝛼-closed,
Ncl ( A)  A.
Proposition 2.3:
Let (X, T) be a neutrosophic topological space in (X, T), then every neutrosophic
nowhere dense set is neutrosophic 𝛼-nowhere dense set in (X, T).
Proof :
Let A be a Neutrosophic nowhere dense and non zero closed set in (X, T), then
𝑁𝑖𝑛𝑡(𝑁𝑐𝑙 𝐴 = 0𝑁  Ncl ( N int( Ncl ( A)))  0 N  A  Ncl ( N int( Ncl ( A)))  A  0 N  A . So
Ncl ( A)  A which implies Ais Neutrosophic 𝛼 -closed set. Now from
Ncl ( A)  A  N int( Ncl ( A))  N int( A)  0 N 

Ncl ( N int( Ncl ( A)))  Ncl (0 N )  0 N  N int( Ncl ( N int( Ncl ( A))))  N int( 0 N )  0 N 
Ncl ( A)  N int( Ncl ( N int( Ncl ( A))))  Ncl ( A)  0 N  A  0 N  0 N  N int( Ncl ( A))  0 N
.
Hence A is neutrosophic 𝛼-nowhere dense set in (X, T).
Definition 2.3:
Let (X, T) be a neutrosophic topological space. A neutrosophic set A in (X, T) is called

Neutrosophic 𝛼-first category if A = A
i 1
i where Ai‟s are neutrosophic 𝛼-nowhere dense sets
in (X, T).
Example 2.2:
Let X = {a, b}. Define the neutrosophic set A, B ,C and D on X as follows:

 a b c  a b c  a b c 
A  x,  , , ,  , , ,  , , 
 0.6 0.6 0.5   0.6 0.6 0.5   0.3 0.3 0.3 
 a b c  a b c  a b c 
B  x,  , , ,  , , ,  , , 
 0.6 0.6 0.5   0.6 0.6 0.6   0.3 0.3 0.4 
 a b c  a b c  a b c 
C  x,  , , ,  , , ,  , , 
 0.3 0.3 0.4   0.3 0.3 0.4   0.7 0.7 0.5 
 a b c  a b c  a b c 
D  x,  , , ,  , , ,  , , 
 0.3 0.3 0.3   0.3 0.3 0.3   0.7 0.7 0.7 
Then the families T  0 N ,1N , A, B is Neutrosophic topology on X. Thus (X, T) is a
neutrosophic topological space. Now the sets A, B, C , D are Neutrosophic𝛼-nowhere dense set
 
and A  B  C  D = B is neutrosophic 𝛼-first category set in (X, T)
Proposition 2.4 :

If A be a neutrosophic first category set in (X; T),then A   Bi where Ncl ( Bi )  1N
i 1

Proof: Let A be a neutrosophic 𝛼-first category set in (X,T). Then A =  Ai , where Ai‟s are
i 1
 
neutrosophic 𝛼-nowhere dense sets in (X, T).Now A   Ai   Ai . Now Aiis a Neutrosophic
i 1 i 1
𝛼 -nowhere dense set in (X, T). Then, by Proposition 2.1,we have Ai is a Neutrosophic

dense set in (X, T). Let us putBi = Ai . then A   Bi where Ncl ( Bi )  1N .
i 1
3. Neutrosophic 𝜶-Baire space :
Motivated by the concept of neutrosophic Baire space introduced in [9] we shall now
define:
Definition 3.1 :
Let (X, T)be a neutrosophic topological space. Then (X, T)is called a Neutrosophic
 
𝛼-Baire space if N int   Ai   0 N , where Ai ‟s are Neutrosophic 𝛼- nowhere dense sets in
 i 1 
(X,T).

In Example2.2:

The sets A, B, C , D are Neutrosophic𝛼-nowhere dense set and N𝛼int A  B  C  D = 
N𝛼int ( B ) = 0N is neutrosophic 𝛼-Baire space.
Definition 3.2:
Let A be a Neutrosophic 𝛼-first category set in a Neutrosophic topological space (X, T).
Then 1 - A is called a Neutrosophic 𝛼-residual set in (X, T).
Proposition 3.1:

Let (X, T) be a neutrosophic topological space. The  Ai n the following are equivalent:
i 1
(1). (X, T) is a neutrosophic 𝛼-Baire space.

(2). N𝛼int (A) = 0N for every neutrosophic 𝛼 first category set A in (X, T).
(3). N𝛼cl (B) = 1N for every neutrosophic 𝛼 -residual set in (X, T).
Proof:

(1) → (2). Let λ be a Neutrosophic 𝛼 -first category set in (X, T). Then A =  Ai ,
i 1

where Ai's are neutrosophic 𝛼 -nowhere dense sets in (X, T). Now N𝛼int (A) = N𝛼int (  Ai ) =
i 1
0N (since (X, T) is a neutrosophic 𝛼 -Baire space). Therefore N𝛼int(A) = 0N.
(2) → (3). Let B be a neutrosophic semi-residual set in (X, T). Then 1-B is a
neutrosophic 𝛼 -first category set in (X, T). By hypothesis, N𝛼int (1-B) = 0N which implies
that 1- N𝛼cl (B) = 0N.
Hence we have N𝛼cl (B) = 1N.

(3)→ (1). Let A be a neutrosophic 𝛼-first category set in (X, T). Then A = A
i 1
i where
Ai's are neutrosophic 𝛼 -nowhere dense sets in (X, T). 1- A is a neutrosophic 𝛼 -residual set in
(X, T). Since A is a Neutrosophic 𝛼 -first category set in (X, T), By hypothesis, we have N𝛼cl

(1- A) = 1N. Then 1- N𝛼int (A) = 1N, which implies that N𝛼int(A) = 0N. Hence N𝛼int (  Ai ) =
i 1
0N where Ai's are neutrosophic 𝛼 -nowhere dense sets in (X,T). Hence (X, T) is a neutrosophic
𝛼-Baire space.

Proposition 3.2 :
Every neutrosophic 𝛼-Baire space need not to bea Baire space.
Example 3.1:
Let X = {a, b}. Define the Neutrosophic set A, B,C and D on X as follows:
 a b  a b  a b   a b  a b  a b 
A  x,  , ,  , ,  ,  B  x,  , ,  , ,  , 
 0.5 0.2   0.5 0.2   0.3 0.4  ,  0.3 0.4   0.3 0.4   0.6 0.5 
 a b  a b  a b   a b  a b  a b 
C  x,  , ,  , ,  ,  D  x,  , ,  , ,  , 
 0.3 0.4   0.3 0.4   0.2 0.5  ,  0.3 0.4   0.5 0.4   0.5 0.2 
Then the family T  0 N ,1N , A, B, A  B is Neutrosophic topology on X. Thus (X, T)
is a neutrosophic topological space. The sets A, A  B are Neutrosophic semi 𝛼-nowhere
dense and also nowhere dense sets in (X, T). Here N int[( A)  ( A  B)]  N int( D)  0 N ,
and N int[( A)  ( A  B)]  N int( D)  0 N Hence the neutrosophic topological space (X,T) is
neutrosophic 𝛼-Baire space but it is not neutrosophic Baire space.
Proposition 3.3:

If A = A
i 1
i where Ai‟s are Neutrosophic nowhere dense sets in (X, T) then
neutrosophic 𝛼-Baire space will be a neutrosophic Baire space.
Proof:
In Example 2.2 the sets A, B, C , D are Neutrosophic nowhere dense set in (X, T) and
A  B  C  D= B .
Here Nint A  B  C  D =Nint ( B)  0 N
 
and also N 𝛼int A  B  C  D =N𝛼int ( B)  0 N

References :
[1] S. A. Alblowi, A. A. Salama and Mohmed Eisa, New Concepts of Neutrosophic
Sets, International Journal of Mathematics and Computer Applications Research
(IJMCAR),Vol. 3, Issue 3, Oct (2013) 95-102.
[2] K. Atanassov, Intuitionistic fuzzy sets, in V.Sgurev, ed.,Vii ITKRS Session,
Sofia(June 1983 central Sci. and Techn. Library, Bulg. Academy of Sciences( 1984)).
[3] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20(1986)87-96.
[4] K. Atanassov, Review and new result on Intuitionistic fuzzy sets , preprint
IM-MFAIS-1-88, Sofia, 1988.
[5] Arokiarani, R. Dhavaseelan, S. Jafari, M. Parimala”On Some New Notions and
Functions in Neutrosophic Topological Spaces” Neutrosophic Sets and Systems, Vol.
16, 2017
[6] C.L. Chang, Fuzzy Topological Spaces, J. Math. Anal. Appl. 24 (1968)182-190.
[7] Dogan Coker, An introduction to Intuitionistic fuzzy topological spaces, Fuzzy Sets
and Systems. 88(1997)81-89. [6] Reza Saadati, Jin HanPark, On the Intuitionistic fuzzy
topological space, Chaos, Solutions and Fractals 27(2006)331-344 .
[8] R. Dhavaseelan, 2S. Jafari ,3R. Narmada Devi, 4Md. Hanif Page,Neutrosophic
Baire Spaces, Neutrosophic Sets and Systems, Vol. 16, 2017
[9] Florentin Smarandache , Neutrosophy and Neutrosophic Logic , First International
Conference on Neutrosophy , Neutrosophic Logic , Set, Probability, and Statistics
University of New Mexico, Gallup, NM 87301, USA(2002) , smarand@unm.edu
[10] F. Smarandache. A Unifying Field in Logics:Neutrosophic Logic. Neutrosophy,
Neutrosophic Set, Neutrosophic Probability. American Research Press,
[11]Qays Haten Imran, F.Samarandache,Riad K. Al-Hamido and Dhavaseelan,On
Neutrosophic Semi Alpha Open Sets,NSS,18/2017(37-42)
[12]A.A. Salama and S.A. Alblowi, Neutrosophic Set and Neutrosophic Topological
Spaces, ISORJ. Mathematics,Vol(3), Issue(3), (2012) pp-31-35.
[13]A.A. Salama and S.A. Alblowi, "Generalized Neutrosophic Set and Generalized
Neutrosophic Topological Spaces," Journal Computer Sci. Engineering, Vol. (2) No.
(7) (2012)pp 129-132 .
[14] G.Thangaraj and S.Anjalmose, On Fuzzy Baire space, J. Fuzzy Math. Vol.21 (3),
(2013) 667-676.
[15] L.A. Zadeh, Fuzzy Sets, Inform and Control 8(1965)338-353

CHAPTER-9
ON 𝐍𝐧𝐜 𝐙𝛂 -OPEN SETS, 𝐍𝐧𝐜 𝐀∗ 𝐋 SETS AND DECOMPOSITIONS

OF CONTINUITY
A. Vadivel1, K. Balasubramaniyan2 and A. Gobikrishnan3
1
Department of Mathematics, Government Arts College (Autonomous), Karur,
Tamil Nadu-639 005; Department of Mathematics, Annamalai University,
Annamalainagar,
Tamil Nadu-608 002
2
𝐏𝐆 𝐃𝐞𝐩𝐚𝐫𝐭𝐦𝐞𝐧𝐭 𝐨𝐟 𝐌𝐚𝐭𝐡𝐞𝐦𝐚𝐭𝐢𝐜𝐬, 𝐀𝐫𝐢𝐠𝐧𝐚𝐫 𝐀𝐧𝐧𝐚 𝐆𝐨𝐯𝐞𝐫𝐧𝐦𝐞𝐧𝐭 𝐀𝐫𝐭𝐬 𝐂𝐨𝐥𝐥𝐞𝐠𝐞, 𝐀𝐭𝐭𝐮𝐫,
𝐓𝐚𝐦𝐢𝐥 𝐍𝐚𝐝𝐮 − 𝟔𝟑𝟔 𝟏𝟐𝟏
Email: kgbalumaths@gmail.com
3
Department of Mathematics, Thiruvalluvar Goverment Arts College, Rasipuram,
Tamil Nadu-637 401
Email: vainugobi@gmail.com
1. Introduction :
Smarandache‟s neutrosophic framework have wide scope of constant applications for

the fields of Computer Science, Information Systems, Applied Matheamatics, Artifical
Intelligence, Mechanics, dynamic, Medicine, Electrical & Electronic, and Management
Science and so forth [1, 2, 3, 4, 22, 23]. Topology is an classical subject, as a generalization
topological spaces numerous kinds of topological spaces presented throughout the year.
Smarandache [15] characterized the Neutrosophic set on three segment Neutrosophic sets
(T-Truth, F-Falsehood, I-Indeterminacy). Neutrosophic topological spaces (nts‟s) presented
by Salama and Alblowi [12]. Lellies Thivagar et.al. [9] was given the geometric existence of N
topology, which is a non-empty set equipped with N arbitrary topologies. Lellis Thivagar et al.
[10] introduced the notion of Nn -open (closed) sets in N neutrosophic crisp topological
spaces. Al-Hamido et al. [5] investigate the chance of extending the idea of neutrosophic crisp
topological spaces into N-neutrosophic crisp topological spaces and examine a portion of their

essential properties. Tong [16] introduced the notion of B set and B-continuity in topological
spaces. The concept of H ∗ sets, DS set, H ∗ -continuity, DS-continuity introduced by Ekici [6,
7] and used them to obtain a new decomposition of continuity. Noiri et.al [11] introduced the
notion of η set and η -continuity in topological spaces. In 2020, [17, 20] introduced
N -neutrosophic δ -open, N -neutrosophic δ -semiopen, N -neutrosophic δ -preopen and
N-neutrosophic Z-open sets are introduced. The main purpose of this chapter is to obtain a new
decompositions of continuous functions. We introduce and study the notion of Nnc Zα -open
sets and Nnc A∗ L sets. The relationships among of Nnc Zα -open sets, Nnc A∗ L sets and the
related sets are investigated. By using these notions, we obtain a new decompositions of
continuous functions. Also, some characterizations of these notions are presented.
2. Preliminaries :-
Salama and Smarandache [14] presented the idea of a neutrosophic crisp set in a set P and
defined the inclusion between two neutrosophic crisp sets, the intersection (union) of two
neutrosophic crisp sets, the complement of a neutrosophic crisp set, neutrosophic crisp empty
(resp., whole) set as more then two types. And they studied some properties related to
nutrosophic crisp set operations. However, by selecting only one type, we define the inclusion,
the intersection (union), and neutrosophic crisp empty (resp., whole) set again and discover a
few properties.
Definition 2.1 :
Let P be a non-empty set. Then H is called a neutrosophic crisp set (in short, ncs) in P
if H has the form H = (H1 , H2 , H3 ), where H1 , H2 , and H3 are subsets of P.
The neutrosophic crisp empty (resp., whole) set, denoted by ϕn (resp., Pn ) is an ncs
in P defined by ϕn = (ϕ, ϕ, P) (resp. Pn = (P, P, ϕ). We will denote the set of all ncs‟s in P
as ncS(P).
In particular, Salama and Smarandache [13] classified a neutrosophic crisp set as the
followings.
A neutrosophic crisp set H = (H1 , H2 , H3 ) in P is called a neutrosophic crisp set of
Type 1 (resp. 2 & 3) (in short, ncs-Type 1 (resp. 2 & 3) ), if it satisfies H1 ∩ H2 = H2 ∩
H3 = H3 ∩ H1 = ϕ (resp. H1 ∩ H2 = H2 ∩ H3 = H3 ∩ H1 = ϕ and H1 ∪ H2 ∪ H3 =
P&H1 ∩ H2 ∩ H3 = ϕ and H1 ∪ H2 ∪ H3 = P).
ncS1 (P) (ncS2 (P) and ncS3 (P)) means set of all ncs Type 1 (resp. 2 and 3).

Definition 2.2 :
Let H = (H1 , H2 , H3 ), M = (M1 , M2 , M3 ) ∈ ncS(P). Then H is said to be contained in
(resp. equal to) M, denoted by H ⊆ M (resp. H = M), if H1 ⊆ M1 , H2 ⊆ M2 and H3 ⊇ M3
(resp. H ⊆ M and M ⊆ H ), H c = (H3 , H2c , H1 ) , H ∩ M = (H1 ∩ M1 , H2 ∩ M2 , H3 ∪ M3 ) ,
H ∪ M = (H1 ∪ M1 , H2 ∪ M2 , H3 ∩ M3 ) . Let (Hj )j∈J ⊆ ncS(P), where Hj = (Hj 1 , Hj 2 , Hj 3 ) .
Then ⋂j∈J ‍Hj (simply ⋂ ‍Hj ) = (⋂ ‍Hj 1 , ⋂ ‍Hj 2 , ⋃ ‍Hj 3 ) ; ⋃j∈J ‍Hj (simply ⋃ ‍Hj ),
= (⋃ ‍Hj 1 , ⋃ ‍Hj 2 , ⋂ ‍Hj 3 ). The following are the quick consequence of Definition 2.2.
Proposition 2.1 : [8]

Let L, M, O ∈ ncS(P). Then
(i)ϕn ⊆ L ⊆ Pn ,
(ii) if L ⊆ M and M ⊆ O, then L ⊆ O,
(iii)L ∩ M ⊆ L and L ∩ M ⊆ M,
(iv)L ⊆ L ∪ M and M ⊆ L ∪ M,
(v)L ⊆ M iff L ∩ M = L,
(vi)L ⊆ M iff L ∪ M = M.
Likewise the following are the quick consequence of Definition 2.2.

Let L, M, O ∈ ncS(P). Then
(i)L ∪ L = L, L ∩ L = L (Idempotent laws),
(ii)L ∪ M = M ∪ L, L ∩ M = M ∩ L (Commutative laws),
(iii) (Associative laws) : L ∪ (M ∪ O) = (L ∪ M) ∪ O, L ∩ (M ∩ O) = (L ∩ M) ∩ O,
(iv) (Distributive laws:) L ∪ (M ∩ O) = (L ∪ M) ∩ (L ∪ O) , L ∩ (M ∪ O) = (L ∩
M) ∪ (L ∩ O),
(v) (Absorption laws) : L ∪ (L ∩ M) = L, L ∩ (L ∪ M) = L,
(vi) (DeMorgan‟s laws) : (L ∪ M)c = Lc ∩ M c , (L ∩ M)c = Lc ∪ M c ,
(vii)(Lc )c = L,
(viii) (a) L ∪ ϕn = L, L ∩ ϕn = ϕn ,
(b) L ∪ Pn = Pn , L ∩ Pn = L,
(c) Pnc = ϕ, ϕcn = Pn ,
(d) in general, L ∪ Lc ≠ Pn , L ∩ Lc ≠ ϕn .


Let L ∈ ncS(P) and let (Lj )j∈J ⊆ ncS(P). Then
(i)(⋂ ‍Lj )c = ⋃ ‍Lcj , (⋃ ‍Lj )c = ⋂ ‍Lcj ,
(ii)L ∩ (⋃ ‍Lj ) = ⋃ ‍(L ∩ Lj ), L ∪ (⋂ ‍Lj ) = ⋂ ‍(L ∪ Lj ).
Definition 2.3 :
[13] A neutrosophic crisp topology (briefly, ncts) on a non-empty set P is a family τ of
nc subsets of P satisfying the following axioms
(i)ϕn , Pn ∈ τ.
(ii)H1 ∩ H2 ∈ τ ∀ H1 &H2 ∈ τ.
(iii)⋃a ‍Ha ∈ τ, for any {Ha : a ∈ J} ⊆ τ.
Then (P, τ) is a neutrosophic crisp topological space (briefly, ncts ) in P. The τ
elements are called neutrosophic crisp open sets (briefly, ncos) in P. A ncsC is closed set
(briefly, nccs) iff its complement Cc is ncos.

Let P be a non-empty set. Then nc τ1 , nc τ2 , ⋯, nc τN are N -arbitrary crisp
topologies defined on P and the collection Nnc τ = {H ⊆ P: H = (⋃Nj=1 ‍Hj ) ∪ (⋂Nj=1 ‍Lj ) ,
Hj , Lj ∈nc τj } is called N neutrosophic crisp (briefly, Nnc )-topology on P if the axioms are
satisfied:
(i)ϕn , Pn ∈ Nnc τ.
(ii)⋃∞ ∞
j=1 ‍Hj ∈ Nnc τ ∀ {Hj }j=1 ∈ Nnc τ.
(iii)⋂nj=1 ‍Hj ∈ Nnc τ ∀ {Hj }nj=1 ∈ Nnc τ.

Then (P, Nnc τ) is called a Nnc -topological space (briefly, Nnc ts) on P. The Nnc τ
elements are called Nnc -open sets (Nnc os) on P and its complement is called Nnc -closed sets
(Nnc cs) on P. The elements of P are known as Nnc -sets (Nnc s) on P.

Let (P, Nnc τ) be Nnc ts on P and H be an Nnc s on P, then the Nnc interior of H
(briefly, Nnc int(H)) and Nnc closure of H (briefly, Nnc cl(H)) are defined as
(i) Nnc int(H) =∪ {A: A ⊆ H & 𝐴𝑖𝑠𝑎Nnc osinP}&Nnc cl(H) =∩ {C: H ⊆
C & 𝐶𝑖𝑠𝑎Nnc csinP}.

(ii)Nnc -regular open [18] set (briefly, Nnc ros) if H = Nnc int(Nnc cl(H)).
(iii)Nnc -pre open set (briefly, Nnc 𝒫os) if H ⊆ Nnc int(Nnc cl(H)).
(iv) Nnc -semi open set (briefly, Nnc 𝒮os) if H ⊆ Nnc cl(Nnc int(H)).
(v)Nnc α-open set (briefly, Nnc αos) if H ⊆ Nnc int(Nnc cl(Nnc int(H))).
(vi) Nnc - γ -open set[18] (briefly, Nnc γos ) if
H ⊆ Nnc cl(Nnc int(H)) ∪ Nnc int(Nnc cl(H)).
(vii)Nnc β-open set [19] (briefly, Nnc βos) if H ⊆ Nnc cl(Nnc int(Nnc cl(H))).
The complement of an Nnc ros (resp. Nnc 𝒮os, Nnc 𝒫os, Nnc αos, Nnc βos&Nnc γos) is
called an Nnc -regular (resp. Nnc -semi, Nnc -pre, Nnc -α, Nnc -β&Nnc -γ) closed set (briefly,
Nnc rcs (resp. Nnc 𝒮cs, Nnc 𝒫cs, Nnc αcs, Nnc βcs&Nnc γc)) in P.
The family of all Nnc ros (resp. Nnc rcs , Nnc 𝒫os , Nnc 𝒫cs , Nnc 𝒮os , Nnc 𝒮cs ,
Nnc αos, Nnc αcs, Nnc βos, Nnc βcs, Nnc γos&Nnc γcs,) of P is denoted by Nnc ROS(P) (resp.
Nnc RCS(P), Nnc 𝒫OS(P), Nnc 𝒫CS(P), Nnc 𝒮OS(P), Nnc 𝒮CS(P), Nnc αOS(P), Nnc αCS(P),
Nnc βOS(P), Nnc βCS(P), Nnc γOS(P)&Nnc γCS(P)).

A set H is said to be a
(i)Nnc δ interior of H (briefly, Nnc δint(H)) is defined by Nnc δint(H) =∪ {A: A ⊆
H & 𝐴𝑖𝑠𝑎Nnc ros}.
(ii) Nnc δ closure of H (briefly, Nnc δcl(H) ) is defined by Nnc δcl(H) =∪ {x ∈
P: Nnc int(Nnc cl(L)) ∩ H ≠ ϕ, x ∈ L & 𝐿𝑖𝑠𝑎Nnc os}.

(i)Nnc δ-open set (briefly, Nnc δos) if H = Nnc δint(H).
(ii)Nnc δ-pre open set (briefly, Nnc δ𝒫os) if H ⊆ Nnc int(Nnc δcl(H)).
(iii)Nnc δ-semi open set (briefly, Nnc δ𝒮os) if H ⊆ Nnc cl(Nnc δint(H)).
(iv)Nnc a-open set (briefly, Nnc aos) if H ⊆ Nnc int(Nnc cl(Nnc δint(H))).
The complement of an Nnc δos (resp. Nnc δ𝒫os, Nnc δ𝒮os&Nnc aos) is called an Nnc δ
(resp. Nnc δ -pre, Nnc δ -semi &Nnc a ) closed set (briefly, Nnc δcs (resp. Nnc δ𝒫cs ,

Nnc δ𝒮cs&Nnc δ acs)) in Q.
The family of all Nnc δos (resp. Nnc δcs, Nnc δ𝒫os, Nnc δ𝒫cs, Nnc δ𝒮os, Nnc δ𝒮cs,
Nnc aos&Nnc acs ) of P is denoted by Nnc δOS(P) (resp. Nnc δCS(P) , Nnc δ𝒫OS(P) ,
Nnc δ𝒫CS(P), Nnc δ𝒮OS(P), Nnc δ𝒮CS(P), Nnc aOS(P)&Nnc aCS(P)).
Definition 2.8 [17, 21] :

Let H be an Nnc s on a Nnc tsP. Then H is said to be a
(i)Nnc e-open (briefly, Nnc eo) set if H ⊆ Nnc cl(Nnc δint(H)) ∪ Nnc int(Nnc δcl(H)).
(ii)Nnc e-closed (briefly, Nnc ec) set if Nnc cl(Nnc δint(H)) ∩ Nnc int(Nnc δcl(H)) ⊆ H.
(iii)Nnc Z-open (briefly, Nnc Zo) set if H ⊆ Nnc cl(Nnc int δ (H)) ∪ Nnc int(Nnc cl(H)),
(iv)Nnc Z-closed (briefly, Nnc Zc) set if Nnc int(Nnc clδ (H)) ∩ Nnc cl(Nnc int(H)) ⊆ H.
The complement of an Nnc eo (resp. Nnc Zo) set is called an Nnc ec (resp. Nnc Zc) set
in P . The family of all Nnc eo (resp. Nnc ec , Nnc Zo&Nnc Zc ) set of P is denoted by
Nnc eOS(P) (resp. Nnc eCS(P), Nnc ZOS(P)&Nnc ZCS(P)).
Lemma 2.1 [21] :

Let H, B be two sub set of (P, Nnc τ). Then the following are hold:
Nnc clα (H) = H ∪ Nnc cl(Nnc int(Nnc cl(H))) ) and
Nnc int α (H) = H ∩ Nnc int(Nnc cl(Nnc int(H))),
(ii) Nnc sclδ (H) = H ∪ Nnc int(Nnc clδ (H)) and
Nnc sint δ (H) = H ∩ Nnc cl(Nnc int δ (H)),
(iii)Nnc pcl(H) = H ∪ Nnc cl(Nnc int(H)) and Nnc pint(H) = H ∩ Nnc int(Nnc cl(H)).
Definition 2.9 [17, 21] :

A function h: (P, Nnc τ) → (Q, Nnc σ) is called Nnc e-continuous (resp. Nnc α-continuous,
Nnc pre-continuous, Nnc δ -semi-continuous, Nnc semi-continuous, Nnc γ -continuous
&Nnc Z -continuous) (briefly, Nnc eCts (resp. Nnc αCts , Nnc 𝒫Cts , Nnc δ𝒮Cts , Nnc 𝒮Cts ,
Nnc γCts&Nnc ZCts )) if h−1 (V) is Nnc eo (resp. Nnc αo , Nnc 𝒫o , Nnc δ𝒮o , Nnc 𝒮o ,
Nnc γo&Nnc Zo) of P, for each V ∈ Nnc σ.

3. 𝐍𝐧𝐜 𝐙𝛂 -open sets :

Definition 3.1 :
Let (P, Nnc τ) be a Nnc ts. Let H be an Nnc s in (P, Nnc τ). Then H is said to be a
(i) Nnc Zα -open (briefly, Nnc Zα o ) if
H ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪ Nnc cl(Nnc int δ (H)).
(ii) Nnc Zα -closed (briefly, Nnc Zα c ) if
Nnc cl(Nnc int(Nnc cl(H))) ∩ Nnc int(Nnc clδ (H)) ⊆ H.
The family of all Nnc Zα o (resp. Nnc Zα c ) sets of a space (P, Nnc τ) will be as always
denoted by Nnc Zα OS(P) ( resp. Nnc Zα CS(P)).
Definition 3.2 :
Let (P, Nnc τ) be a Nnc ts on P and H be an Nnc s on P. Then
(i)Nnc Zα int(H) = ⋃ ‍{G: G ⊆ H and G is a Nnc Zα o set in P}.
(ii)Nnc Zα cl(H) = ⋂ ‍{F: H ⊆ F and F is a Nnc Zα c set in P}.
Theorem 3.1 :
Let (P, Nnc τ) be a Nnc ts on P. Then the statement hold but the converse need not be
true.
(i) Every Nnc os (resp. Nnc cs) is a Nnc αos (resp. Nnc αcs).
(ii) Every Nnc δos (resp. Nnc δcs) is a Nnc os (resp. Nnc cs).
(iii) Every Nnc δ𝒮os (resp. Nnc δ𝒮cs) is a Nnc eos (resp. Nnc ecs).
(iv) Every Nnc Zos (resp. Nnc Zcs) is a Nnc γos (resp. Nnc γcs).
(v) Every Nnc Zos (resp. Nnc Zcs) is a Nnc eos (resp. Nnc ecs).
(vi) Every Nnc αos (resp. Nnc αcs) is a Nnc Zα os (resp. Nnc Zα cs).
(vii) Every Nnc 𝒮os (resp. Nnc 𝒮cs) is a Nnc γos (resp. Nnc γcs).
(viii) Every Nnc δos (resp. Nnc δcs) is a Nnc aos (resp. Nnc acs).
(ix) Every Nnc aos (resp. Nnc acs) is a Nnc δ𝒮os (resp. Nnc δ𝒮cs).
(x) Every Nnc δ𝒮os (resp. Nnc δ𝒮cs) is a Nnc Zα os (resp. Nnc Zα cs).
(xi) Every Nnc aos (resp. Nnc acs) is a Nnc αos (resp. Nnc αcs).
(xii) Every Nnc Zα os (resp. Nnc Zα cs) is a Nnc 𝒮os (resp. Nnc 𝒮cs).
(xiii) Every Nnc Zα os (resp. Nnc Zα cs) is a Nnc Zos (resp. Nnc Zcs).
Proof. Proof of with examples (i) to (iii), (iv) to (v) are proved in [21] & [17]. We prove only

(vi) to (xiii).
(vi) Suppose that H is a Nnc αos, then
H ⊆ Nnc int(Nnc cl(Nnc int(H))) ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪ Nnc cl(Nnc int δ (H)). Hence
H is a Nnc Zα os.
(vii) Suppose that H is a Nnc 𝒮os, then H ⊆ Nnc cl(Nnc int(H)) ⊆ Nnc cl(Nnc int(H)) ∪
Nnc int(Nnc cl(H)). Hence H is a Nnc γos.
(viii) Let H be an Nnc δos. Then H = Nnc int δ (H) ⊆ Nnc int(Nnc cl(Nnc int δ (H))).
Hence H is a Nnc aos.
(ix) Let H be an Nnc aos. Then
H ⊆ Nnc int(Nnc cl(Nnc int δ (H))) ⊆ Nnc cl(Nnc int δ (H)). Hence H is a Nnc δ𝒮os.
(x) Let H be an Nnc δ𝒮os. Then
H ⊆ Nnc cl(Nnc int δ (H)) ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪ Nnc cl(Nnc int δ (H)). Hence H is a
Nnc Zα os.
(xi) Let H be an Nnc aos. Then
H ⊆ Nnc int(Nnc cl(Nnc int δ (H))) ⊆ Nnc int(Nnc cl(Nnc int(H))). Hence H is a Nnc αos.
(xii) Suppose that H is a Nnc Zα os, then H ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪
Nnc cl(Nnc int δ (H)) ⊆ Nnc cl(Nnc int(H)). Hence H is a Nnc 𝒮os.
(xiii) Suppose that H is a Nnc Zα os, then H ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪
Nnc cl(Nnc int δ (H)) ⊆ Nnc cl(Nnc int δ (H)) ∪ Nnc int(Nnc cl(H)). Hence H is a Nnc Zos.
Remark 3.1 The following diagram holds for a subset of a space P :
The converse of the above implications need not necessary be true, as shown by [17], [21] and
the following examples.

Example 3.1 :
Let P = {a, b, c, d, e} , nc τ1 = {ϕN , PN , A, B, C} ,
nc τ2 = {ϕN , PN } . A = 〈{c}, {ϕ}, {a, b, d, e}〉 , B = 〈{a, b}, {ϕ}, {c, d, e}〉 ,
C = 〈{a, b, c}, {ϕ}, {d, e}〉, then we have 2nc τ = {ϕN , PN , A, B, C}. Then,
(i)〈{c, d}, {ϕ}, {a, b, e}〉 is a 2nc Zα os but not 2nc αos.
(ii)〈{a, c}, {ϕ}, {b, d, e}〉 is a 2nc Zos but not 2nc Zα os.
Example 3.2 :
Let P = {a, b, c, d}, nc τ1 = {ϕN , PN , A, B, C, D}, nc τ2 = {ϕN , PN , E, F}.A =
〈{a}, {ϕ}, {b, c, d}〉, B = 〈{c}, {ϕ}, {a, b, d}〉, C = 〈{a, c}, {ϕ}, {b, d}〉, D = 〈{a, c, d}, {ϕ}, {b}〉,
E = 〈{a, b}, {ϕ}, {c, d}〉, F = 〈{a, b, c}, {ϕ}, {d}〉, then we have 2nc τ = {ϕN , PN , A, B, C, D, E, F}.
The set
(i)〈{a, c}, {ϕ}, {b, d}〉 is a 2nc Zα os but not 2nc δ𝒮os.
(ii)〈{a, d}, {ϕ}, {b, c}〉 is a 2nc 𝒮os but not 2nc Zα os.
Definition 3.3 :
A Nnc sH of a Nnc ts(P, Nnc τ) is called:
(i) a Nnc A∗ set if H = O ∩ V, where O is Nnc o and V is Nnc ac,
(ii) a Nnc DS set if H = O ∩ V, where O is Nnc o and V is Nnc δ𝒮c,
(iii) a Nnc B set if H = O ∩ V, where O is Nnc o and V is Nnc 𝒮c,
(iv) a Nnc η set if H = O ∩ V, where O is Nnc o and V is Nnc αc,
(v) a Nnc δ∗ set if Nnc int δ (H) is Nnc δc.
Theorem 3.2 :
Let (P, Nnc τ) be a Nnc ts. Then a Nnc Zα o set H of P is Nnc αo if one of the following
conditions are hold:
(i)(P, Nnc τ) is Nnc ED,
(ii)H is Nnc δ∗ set of P,
(iii)P\H is Nnc δ-dense of P.
Proof. (i) Since, H ∈ Nnc Zα OS(P) and P is Nnc ED, then H ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪
Nnc cl(Nnc int δ (H)) ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪ Nnc int(Nnc cl(Nnc int δ (H))) =

Nnc int(Nnc cl(Nnc int(H))) and therefore H ∈ Nnc αOS(P, Nnc τ).
(ii) Let H be a Nnc δ∗ set and Nnc Zα o . Then H ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪
Nnc cl(Nnc int δ (H)) = Nnc int(Nnc cl(Nnc int(H))) ∪ Nnc int δ (H) =
Nnc int(Nnc cl(Nnc int(H))). Therefore H is Nnc αo.
(iii) Let H ∈ Nnc Zα OS(P) and P\H be a Nnc δ-dense set of P. Then Nnc int δ (H) = ϕ
and hence H ⊆ Nnc int(Nnc cl(Nnc int(H))). Therefore H is Nnc αo.
Lemma 3.1 :
Let (P, Nnc τ) be a Nnc ts. Then the following statements are hold.
(i) The union of arbitrary Nnc Zα o sets is Nnc Zα o,
(ii) The intersection of arbitrary Nnc Zα c sets is Nnc Zα c.
Remark 3.2 :
By the following example we show that the intersection of any two Nnc Zα o sets is not
Nnc Zα o.
Example 3.3:
In Example 3.1, the sets 〈{c, d}, {ϕ}, {a, b, e}〉 and 〈{a, b, d, e}, {ϕ}, {c}〉 are 2nc Zα os but
the intersection 〈{d}, {ϕ}, {a, b, c, e}〉 is not 2nc Zα os.
Theorem 3.3 :
Let H be Nnc s of a Nnc ts(P, Nnc τ). Then the following are statements are equivalent:
(i)H is Nnc Zα o set,
(ii)H = Nnc Zα int(H),
(iii)H = Nnc int α (H) ∪ Nnc sint δ (H).
Proof. (i) ↔ (ii). Obvious,

(i) ⇒ (ii). Let H be a Nnc Zα o set. Then H ⊆ Nnc int(Nnc cl(Nnc int(H))) ∪
Nnc cl(Nnc int δ (H)) . By Lemma 2.1,
Nnc int α (H) ∪ Nnc sint δ (H) =
(H ∩ Nnc int(Nnc cl(Nnc int(H)))) ∪ (H ∩ Nnc cl(Nnc int δ (H))) =
H ∩ (Nnc int(Nnc cl(Nnc int(H)))) ∪ Nnc cl(Nnc int δ (H)) = H.
(ii) ⇒ (i). Let H = Nnc int α (H) ∪ Nnc sint δ (H) . Then by Lemma 2.1 we have

H = (H ∩ Nnc int(Nnc cl(Nnc int(H)))) ∪ (H ∩ Nnc cl(Nnc int δ (H))) ⊆

Nnc int(Nnc cl(Nnc int(H))) ∪ Nnc cl(Nnc int δ (H)). Therefore H is Nnc Zα o set.
Theorem 3.4 :
Let H be subset of a Nnc ts(P, Nnc τ). Then the following statements are equivalent:
(i)H is a Nnc Zα c,
(ii)H = Nnc Zα c1(H),
(iii)H = Nnc clα (H) ∩ Nnc sclδ (H).
Proof. It is clear.
4 𝐍𝐧𝐜 𝐀∗ 𝐋 sets
Definition 4.1 :
A Nnc sH of a Nnc ts(P, Nnc τ) is said to be an Nnc A∗ L set if there exist an Nnc o set O and
an Nnc Zα c set V such that H = O ∩ V . The family of Nnc A∗ L sets of P is denoted by
Nnc A∗ L(P).
Remark 4.1 (i) The following diagram holds for a Nnc sH of a Nnc tsP
(ii) Every Nnc o set and every Nnc Zα c set is Nnc A∗ L set.
The above implications is reversible as shown below.
Example 4.1 :
In Example 3.2, the set 〈{b}, {ϕ}, {a, c, d}〉 is 2nc η (resp. 2nc A∗ L) sets but not 2nc A∗ (resp.
2nc A∗ DS) sets.
Example 4.2 :
Let P = {a, b, c, d, e} , nc τ1 = {ϕN , PN , A, B, C} , nc τ2 = {ϕN , PN , D, E} . A =

〈{a}, {ϕ}, {b, c, d, e}〉 , B = 〈{c}, {ϕ}, {a, b, d, e}〉 , C = 〈{a, c}, {ϕ}, {b, d, e}〉 ,
D = 〈{a, b}, {ϕ}, {c, d, e}〉 , E = 〈{a, b, c}, {ϕ}, {d, e}〉 , then we have
2nc τ = {ϕN , PN , A, B, C, D, E}. Then,
(i)〈{b, c, e}, {ϕ}, {a, d}〉 is a 2nc B set but not 2nc A∗ L set.
(ii)〈{a}, {ϕ}, {b, c, d, e}〉 is a 2nc A∗ L set but not 2nc Zα c (resp. 2nc o) sets.
Example 4.3 :
Let P = {a, b, c, d}, nc τ1 = {ϕN , PN , A, B, C}, nc τ2 = {ϕN , PN }.A = 〈{a}, {ϕ}, {b, c, d}〉,
B = 〈{b}, {ϕ}, {a, c, d}〉, C = 〈{a, b}, {ϕ}, {c, d}〉, then we have 2nc τ = {ϕN , PN , A, B, C}. The
set 〈{b, c}, {ϕ}, {a, d}〉 is a 2nc A∗ L (resp. 2nc DS) sets but not 2nc η (resp. 2nc A∗ ) sets.
Theorem 4.1 :
Let H be a Nnc set of a Nnc ts(P, Nnc τ) . Then H ∈ Nnc A∗ L(P) iff H = O ∩
Nnc Zα c1(H)hor some Nnc o set O.
Proof.
Let H ∈ Nnc A∗ L(P) . Then H = O ∩ V, where O is Nnc o and V is Nnc Zα c . Since
H ⊆ V, then Nnc Zα cl(H) ⊆ Nnc Zα cl(V) = V. Thus O ∩ Nnc Zα cl(H) ⊆ O ∩ V = H ⊆ O ∩
Nnc Zα cl(H).Therefore, H = O ∩ Nnc Zα cl(H).
Conversely, since H = O ∩ Nnc Zα cl(H), hor some Nnc o set O and Nnc Zα cl(H) is
Nnc Zα c, then by Definition 4.1, H is Nnc A∗ L set.
Lemma 4.1 :
Let H be a Nnc s of a Nnc ts ‟s (P, Nnc τ). Then, H is Nnc 𝒮c iff
Nnc int(H) = Nnc int(Nnc cl(H)).
Theorem 4.2 : Let P be a Nnc ts and H ⊆ P . If H ∈ Nnc A∗ L(P), then Nnc pint(H) =
Nnc int(H).
Proof. Let H ∈ Nnc A∗ L(P). Then, H = O ∩ V, where O is Nnc o and V is Nnc Zα c.
Since V is Nnc Zα c, then V is Nnc 𝒮c. Hence by Lemmas 2.1, 4.1, we have Nnc pint(H) =
H ∩ Nnc int(Nnc cl(H)) ⊆ O ∩ Nnc int(Nnc cl(V)) = O ∩ Nnc int(V) = Nnc int(H). Thus,
Nnc pint(H) = Nnc int(H).

Theorem 4.3 : Let H be a Nnc s of a Nnc ts(P, Nnc τ). Then the following are equivalent:
(i)H is Nnc o,
(ii)H is Nnc αo and Nnc A∗ L set,
(iii)H is Nnc 𝒫o and Nnc A∗ L set.
Proof. (i) ⇒ (ii) and (ii) ⇒ (iii). Obvious,
(iii) ⇒ (i). Let H be a Nnc 𝒫o set and H ∗ L set. Then by Theorem 4.2 we have
Nnc pint(H) = Nnc int(H). But, H is Nnc 𝒫o, then H = Nnc pint(H) = Nnc int(H). Thus H is
Nnc o.
Definition 4.2 :
A Nnc tsP is said to be Nnc submaximal if each Nnc dense set of P is Nnc o in P and Nnc
extremely disconnected (briefly Nnc ED) if the Nnc closure of each Nnc o set of P is Nnc o in
P. A Nnc sH of a Nnc tsP is called Nnc δ-dense, iff Nnc δcl(H) = P.
Theorem 4.4 :
For an Nnc ED space P. The following are equivalent:
(i)H is Nnc o,
(ii)H is Nnc Zα o and Nnc A∗ L set,
(iii)H is Nnc 𝒫o and Nnc A∗ L set.
Proof. It follows directly from Theorems 3.2, 4.3.
Theorem 4.5 : Let (P, Nnc τ) be a Nnc ts. Then the following are equivalent:
(i)P is Nnc submaximal,
(ii) Every dense subset of P is an Nnc A∗ L set.
Proof. (i) ⇒ (ii). Let P be a Nnc submaximal space. Then every Nnc dense set of P is an
Nnc o sets, so is an Nnc A∗ L set.
(ii) ⇒ (i). It is known that every Nnc dense set is Nnc 𝒫o. Also, by hypothesis, every
dense is Nnc A∗ L set. So, by Theorem 4.3, it is Nnc o. Therefore, P is Nnc submaximal.
Theorem 4.6 :
Let P be a Nnc ts. Then the following are equivalent:

(i)P is indiscrete,
(ii) The Nnc A∗ L set of P are only trivial ones.
Proof. (i) ⇒ (ii). Let H be an Nnc A∗ L set of P. Then there exists an Nnc o set O and an
Nnc Zα c set V such that H = O ∩ V. If H ≠ ϕ, then O ≠ ϕ. We obtain O = P and H = V.
Hence P = Nnc Zα cl(H) ⊆ H and H = P.
(ii) ⇒ (i). Every Nnc o set is an Nnc A∗ L set. So, Nnc o sets in P are only the trivial
ones. Hence, P is indiscrete.
5. Decompositions of 𝐍𝐧𝐜 -continuous functions :-
Definition 5.1 :
A function h: (P, Nnc τ) → (Q, Nnc σ) is said to be Nnc Zα (resp. Nnc super
&Nnc a )-continuous (briefly, Nnc Zα Cts , Nnc super Cts&Nnc aCts ) if h−1 (V) is Nnc Zα o
(resp. Nnc δo&Nnc ao) in P, hor every V ∈ Nnc σ.
Theorem 5.1 :
Let (P, Nnc τ) and (Q, Nnc σ) be any two Nnc ts‟s. Let h: (P, Nnc τ) → (Q, Nnc σ) be a
function. Then
(i) Every Nnc Cts is a Nnc αCts.
(ii) Every Nnc δCts is a Nnc Cts.
(iii) Every Nnc δ𝒮Cts is a Nnc eCts.
(iv) Every Nnc ZCts is a Nnc γCts.
(v) Every Nnc ZCts is a Nnc eCts.
(vi) Every Nnc αCts is a Nnc Zα Cts.
(vii) Every Nnc 𝒮Cts is a Nnc γCts.
(viii) Every Nnc δCts is a Nnc aCts.
(xi) Every Nnc aCts is a Nnc δ𝒮Cts.
(x) Every Nnc δ𝒮Cts is a Nnc Zα Cts.
(xi) Every Nnc aCts is a Nnc αCts.
(xii) Every Nnc Zα Cts is a Nnc 𝒮Cts.
(xiii) Every Nnc Zα Cts is a Nnc ZCts.

Proof. Proof of (i) to (iii), (iv) to (v) are proved in [21] & [17]. We prove only (vi) to (xiii).
(vi) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc αCts andO is a Nnc os in Q. Then h−1 (O)
is Nnc αos in P . By Theorem 3.1, every Nnc αo is Nnc Zα o , h−1 (O) is Nnc Zα os in P .
Therefore h is Nnc Zα Cts.
(vii) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc 𝒮Cts and O is a Nnc os in Q . Then
h−1 (O) is Nnc 𝒮os in P. By Theorem 3.1, every Nnc 𝒮o isNnc γo, h−1 (O) is Nnc γos in P.
Therefore h is Nnc γCts.
(viii) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc δCts and O is a Nnc os in Q . Then
h−1 (O) is Nnc δo in P. By Theorem 3.1, every Nnc δo isNnc ao, h−1 (O) is Nnc aos in P.
Therefore h is Nnc aCts.
(ix) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc aCts andO is a Nnc os in Q. Then h−1 (O)
is Nnc ao in P . By Theorem 3.1, every Nnc ao is Nnc δ𝒮o , h−1 (O) is Nnc δ𝒮os in P .
Therefore h is Nnc δ𝒮Cts.
(x) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc δ𝒮Cts and O is a Nnc os in Q . Then
h−1 (O) is Nnc δ𝒮o in P. By Theorem 3.1, every Nnc δ𝒮o isNnc Zα o, h−1 (O) is Nnc Zα os in
P. Therefore h is Nnc Zα Cts.
(xi) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc aCts andO is a Nnc os in Q. Then h−1 (O)
is Nnc ao in P. By Theorem 3.1, every Nnc ao isNnc αo, h−1 (O) is Nnc αos in P. Therefore h
is Nnc αCts.
(xii) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc Zα Cts and O is a Nnc os in Q . Then
h−1 (O) is Nnc Zα os in P. By Theorem 3.1, every Nnc Zα o isNnc 𝒮o, h−1 (O) is Nnc 𝒮os in P.
Therefore h is Nnc 𝒮Cts.
(xii) Let h: (P, Nnc τ) → (Q, Nnc σ) be a Nnc Zα Cts and O is a Nnc os in Q . Then
h−1 (O) is Nnc Zα o in P. By Theorem 3.1, every Nnc Zα o isNnc Zo, h−1 (O) is Nnc Zos in P.
Therefore h is Nnc ZCts. width 0.22 true cm height 0.22 true cm depth 0pt
Remark 5.1 :
Let h: (P, Nnc τ) → (Q, Nnc σ) be a function. Then the following diagram is hold:

The implications of the above diagram are not reversible as shown below.
Example 5.1 :
In Example 4.2, the function h: (P, Nnc τ) → (P, Nnc τ) defined as
(i)h(a) = a, h(b) = d, h(c) = c and h(d) = b is 2nc 𝒮Cts but not 2nc Zα Cts.
(ii)h(a) = a, h(b) = b and h(c) = h(d) = c is 2nc Zα Cts but not 2nc δ𝒮Cts.
Example 5.2 :
Let P = {a, b, c, d, e} , nc τ1 = {ϕN , PN , A, B, C} ,
nc τ2 = {ϕN , PN } . H = 〈{a, b}, {ϕ}, {c, d, e}〉 , B = 〈{c, d}, {ϕ}, {a, b, e}〉 ,
C = 〈{a, b, c, d}, {ϕ}, {e}〉 , then we have 2nc τ = {ϕN , PN , A, B, C} . Then, the function
h: (P, Nnc τ) → (P, Nnc τ) defined as
(i) h(a) = c, h(b) = h(c) = d and h(d) = h(e) = e is 2nc ZCts but not 2nc Zα Cts.
(ii)h(a) = a, h(b) = b, h(c) = c and h(d) = h(e) = d is 2nc Zα Cts but not 2nc αCts.
Definition 5.2 :
A function h: (P, Nnc τ) → (Q, Nnc σ) is said to be Nnc A∗ L-continuous (briefly, Nnc A∗ LCts)
if h−1 (V) is an Nnc A∗ L set of P, for every V ∈ Nnc σ.
Definition 5.3:
A function h: (P, Nnc τ) → (Q, Nnc σ) is called Nnc B -continuous (resp. η -continuous
&𝐷𝑆 -continuous) if h−1 (V) is a Nnc B set (resp. Nnc η set &Nnc DS set) in P , for each
V ∈ Nnc σ.

Remark 5.2 :
(i) Let h: P → Q be a function. Then the following implications are hold:
(ii) Every Nnc Cts isNnc A∗ LCts.
The above implications are not reversible as shown by and the following examples.
Example 5.3 :
In Example 3.1, the function h: (P, Nnc τ) → (P, Nnc τ) is defined as identity map,then it is a
2nc A∗ LCts but not 2nc Cts.
Example 5.4 :
In Example 4.2, Let Q = {a, b, c, d, e}, nc σ1 = {ϕN , YN , F, G, H}, nc σ2 = {ϕN , YN }.F =
〈{c}, {ϕ}, {a, b, d, e}〉 , G = 〈{d, e}, {ϕ}, {a, b, c}〉 , H = 〈{c, d, e}, {ϕ}, {a, b}〉 , then we have
2nc σ = {ϕN , YN , F, G, H}. Then, a function h: (P, Nnc τ) → (Q, Nnc σ) defined as
(i) h(a) = a, h(b) = d, h(c) = e, h(d) = b and h(e) = c is 2nc BCts but not
2nc A∗ LCts.
(ii) h(a) = h(c) = a, h(b) = d, h(d) = b and h(e) = e` is 2nc A∗ LCts (resp.
2nc ηCts) but not 2nc DCCts (resp. 2nc A∗ Cts).
Example 5.5 :
In Example 4.3, the function h: (P, Nnc τ) → (P, Nnc τ) defined as h(a) = h(d) = d and
h(b) = h(c) = b is 2nc A∗ LCts but not 2nc η7Cts.
Theorem 5.2 :
The following are equivalent for a function h: P → Q :
(i)h is Nnc Cts,
(ii)h is Nnc αCts and Nnc A∗ LCts,
(iii)h is Nnc 𝒫Cts and Nnc A∗ LCts.
Proof. It is an immediate consequence of Theorem 4.3.
Theorem 5.3 :
Let P be an Nnc ED space and h: P → Q be a function. Then following are equivalent:
(i)h is Nnc Cts,
(ii)h is Nnc Zα Cts and Nnc A∗ LCts,
(iii)h is Nnc αCts and Nnc A∗ LCts,
(iv)h is Nnc 𝒫Cts and Nnc A∗ LCts.
Proof.
It is an immediate consequence of Theorem 4.4.
References :
 M. Abdel-Basset, V. Chang, M. Mohamed and F. Smarandche, A Refined Approach
for Forecasting Based on Neutrosophic Time Series, Symmentry, 11 (4) (2019) 457.
 M. Abdel-Basset, G. Manogaran, A. Gamal and V. Chang, A Novel Intelligent
Medical Decision Support Model Based on Soft Computing and IoT, IEEE Internet of
Things Journal, (2019).
 M. Abdel-Basset, and M. Mohamed, A novel and powerful framework based on
neutrosophic sets to aid patients with cancer, Future Generation Computer Systems,
98 (2019) 144-153.
 M. Abdel-Basset, A. Gamal, G. Manogaran and H. V. Long A novel group decision
making model based on neutrosophic sets for heart disease diagnosis, Multimedia
Tools and Applications, (2019) 1-26.
 R. K. Al-Hamido, T. Gharibah , S. Jafari and F. Smarandache, On neutrosophic crisp
topology via N-topology, Neutrosophic Sets and Systems, 23 (2018), 96-109.
 Erdal Ekici, On a-open sets, H ∗ -sets and decomposition of continuity and super
continuity, Annales Univ. Sci. Budapest, 51 (2008) 39-51.
 Erdal Ekici and S. Jafari, On D-sets, DS-sets and decomposition of continuous,
H-continuous and HB-continuous functions, Italian J. Pure Appl. Math., 24 (2008),
255-264.
 K. Hur, P. K. Lim, J. G. Lee and J. Lee, The category of neutrosophic crisp sets,
Annals of Fuzzy mathematics and Informatics, 14 (1) (2017), 43-54.
 M. Lellis Thivagar, V. Ramesh, M D. Arockia, On new structure of N-topology,
Cogent Mathematics (Taylor and Francis), 3 (2016):1204104.
 M. Lellis Thivagar, S. Jafari, V. Antonysamy and V.Sutha Devi, The ingenuity of

neutrosophic topology via N-topology, Neutrosophic Sets and Systems, 19 (2018),

91-100.
 T. Noiri and O. R. Sayed, On decomposition of continuity, Acta. Math. Hungar., 111
(1-2) (2006), 1-8.
 A. Salama and S. A. Alblowi, Generalized neutrosophic set and generalized
neutrosophic topological spaces, Journal computer sci. engineering, 2 (7) (2012),
31-35.
 A. Salama, F. Smarandache and V. Kroumov, Neutrosophic crisp sets and
neutrosophic crisp topological spaces, Neutrosophic Sets and Systems, 2 (2014),
25-30.
 A. Salama and F. Smarandache, Neutrosophic crisp set theory, Educational Publisher,
Columbus, Ohio, USA, 2015.
 F. Smarandache, Neutrosophy and neutrosophic logic, First International Conference
on Neutrosophy, Neutrosophic Logic, Set, Probability, and Statistics, University of
New Mexico, Gallup, NM 87301, USA (2002).
 J. Tong, On decomposition of continuity in topological spaces, Acta. Math. Hungar.,
54 (1-2) (1989), 51-55.
 Vadivel, N. Moogambigai and S. Tamilselvan, Nnc Z-open sets and continuity in Nnc
topological spaces, Submitted.
 Vadivel and C. John Sundar, γ-Open Sets in 𝒩nc -Topological Spaces, Advances in
Mathematics: Scientific Journal, 9 (4) (2020), 2197-2202.
 Vadivel and C. John Sundar, 𝒩nc β-open sets, Advances in Mathematics: Scientific
Journal, 9 (4) (2020), 2203-2207.
 Vadivel and C. John Sundar, Nnc δ-open sets, Submitted.
 Vadivel and P. Thangaraja, e-open sets in Nnc topological spaces, Journal of Physics:
Conference Series 1724 (2021) 012007.
 V. Venkateswaran Rao and Y. Srinivasa Rao, Neutrosophic Pre-open sets and
Pre-closed sets in Neutrosophic Topology, International Journal of chemTech
Research, 10 (10) 449-458.
 F. Wadei, Al-Omeri and Saeid Jafari, Neutrosophic pre-continuity multifunctions and
almost pre-continuity multifunctions, Neutrosophic Sets and Systems, 27 (2019)
53-69.

CHAPTER-10
NEUTROSOPHIC 𝛼-IRRESOLUTE
MULTIFUNCTION IN NEUTROSOPHIC
TOPOLOGICAL SPACES
T.RajeshKannan1, S.Chandrasekar2
12
, PG and Research Department of Mathematics,
Arignar Anna Government Arts College,
Namakkal(DT),Tamil Nadu, India.
rajeshkannan03@yahoo.co.in, chandrumat@gmail.com
1. Introduction :-
C.L. Chang [3] was introduced fuzzy topological space by using .Zadeh‟s L.A [18]
(uncertain) fuzzy sets. Further Coker [4] was developed the notion of Intuitionistic fuzzy
topological spaces by using Atanassov‟s[1] Intuitionistic fuzzy set. Neutrality the degree of
indeterminacy, as an independent concept was introduced by Smarandache [7]. He also defined
the Neutrosophic set of three component Neutrosophic topological spaces (t, f, i) =(Truth,
Falsehood, Indeterminacy),The Neutrosophic crisp set concept converted to Neutrosophic
topological spaces by A.A.Salama [13]. I.Arokiarani.[2] et al, introduced Neutrosophic α
-closed sets. T Rajesh kannan[10] et.al introduced and investigated a new class of continuous
multivalued function is called Neutrosophic α- continuous multivalued function in
Neutrosophic topological spaces.
Aim of this present chapter is, we define some new type of irresolute multifunction
between the two spaces. we obtain some characterization and some properties between
such as Lower & Upper 𝛼- irresolute multifunction.
2. Preliminaries :-
In this section, we introduce the basic definition for Neutrosophic sets and its
operations. Throughout this presentation, ( 𝑅 𝐶 1 , 𝜏𝑅 𝐶 1 ) is namely as classical

topological spaces on 𝑅 𝐶 1 (represent as CTS𝑅 𝐶 1 ) , (𝑅 𝑁 2 .,𝜏𝑁 ) is namely as an

𝑅𝑁 2,
Neutrosophic topological spaces on 𝑅 𝑁 2 .(represent as NUTS𝑅 𝑁 2 ,),The family of all
open set in 𝑅 𝐶 1 ( 𝛼 − Open in 𝑅 𝐶 1 , semi-openin 𝑅 𝐶 1 and pre-open in 𝑅 𝐶 1
respectively ) is denoted by O(CTS 𝑅 𝐶 1 )( 𝛼 O(CTS 𝑅 𝐶 1 ) , SO(CTS 𝑅 𝐶 1 ) and
PO(CTS𝑅 𝐶 1 ) respectively). The family of all Neutrosophic open set in 𝑅 𝑁 2 ,(𝛼 −Open
in 𝑅 𝑁 2 ,, semi-open in 𝑅 𝑁 2 , and pre-open in 𝑅 𝑁 2 , respectively ) is denoted by
O(NUTS𝑅 𝑁 2 ,).( 𝛼O(NUTS𝑅 𝑁 2 ,) , SO(NUTS𝑅 𝑁 2 ,) and PO(NUTS𝑅 𝑁 2 ,) respectively).
The family of all closed set in 𝑅 𝐶 1 (𝛼 −closed in𝑅 𝐶 1 , semi-closed in 𝑅 𝐶 1 and
pre-Closed in 𝑅 𝐶 1 respectively ) is denoted by C(CTS 𝑅 𝐶 1 ).( 𝛼 C(CTS 𝑅 𝐶 1 ) ,
SC(CTS𝑅 𝐶 1 ) and PS(CTS𝑅 𝐶 1 ) respectively). The family of all Neutrosophic Closed in
in 𝑅 𝑁 2 ( 𝛼 − closed in 𝑅 𝑁 2 , , semi-closed in 𝑅 𝑁 2 , and pre-closed in 𝑅 𝑁 2 ,
respectively ) is denoted by C(NUTS𝑅 𝑁 2 ,).( 𝛼C(NUTS𝑅 𝑁 2 ,) , SC(NUTS𝑅 𝑁 2 ,) and
PC(NUTS𝑅 𝑁 2 ,) respectively)

Let 𝑅 𝑁 1 be a non-empty fixed set. A Neutrosophic set 𝐴𝑅 𝑁 1 is an object
having the form 𝐴𝑅 𝑁 1 = {< 𝜉 , 𝜇𝐴 ( 𝜉 ), 𝜍𝐴 ( 𝜉 ), 𝛾𝐴 ( 𝜉 )> : 𝜉 ∈ 𝑅 𝑁 1 }.Where

𝑅𝑁 1 𝑅𝑁 1 𝑅𝑁 1
𝜇𝑅 𝑁 1 ( 𝜉 ): 𝑅 𝑁 1 → 0,1 , 𝜍𝑅 𝑁 1 ( 𝜉 )): 𝑅 𝑁 1 → 0,1 , , 𝛾𝐴 ( 𝜉 )): 𝑅 𝑁 1 → 0,1 , are represent

𝑅𝑁 1
Neutrosophic of the degree of membership function, the degree indeterminacy and
the degree of non membership function respectively of each element 𝜉 ∈ 𝑅 𝐶 1 to the
set 𝐴𝑅 𝐶 1 with 0 ≤ 𝜇𝐴 ( 𝜉 )+ 𝜍𝐴 ( 𝜉 )+ 𝛾𝐴 ( 𝜉 ) ≤ 1 .This is called standard form

generalized fuzzy sets. But alsoNeutrsophic set may be
0 ≤ 𝜇𝐴 (𝜉)+𝜍𝐴 (𝜉)+𝛾𝐴 (𝜉) ≤ 3

Remark 2.2[7] :
we denote𝐴𝑅 𝑁 1 = {<𝜉, 𝜇𝐴 ,𝜍𝐴 ,𝛾𝐴 > } for the Neutrosophic set

𝐴𝑅 𝑁 1 = {<𝜉, 𝜇𝐴 (𝜉),𝜍𝐴 (𝜉),𝛾𝐴 (𝜉)> : 𝜉∈𝑅 𝐶 1 }.


Example 2.3 [7] :
Each Intuitionistic fuzzy set𝐴𝑅 𝑁 1 is a non-empty set in 𝑅 𝑁 1 is obviously on
Neutrosophic set having the form 𝐴𝑅 𝑁 1 = {<𝜉, 𝜇𝐴 (𝜉),(1 − (𝜇𝐴 + 𝛾𝐴 (𝜉)))

,𝛾𝐴 (𝜉)> : 𝜉∈𝑅 𝐶 1 }

𝑅𝑁 1
We must introduce the Neutrosophic set 0𝑁 and 1𝑁 in 𝑅 𝑁 1 as follows: :
0𝑁 = {<𝜉, 0, 0, 1>: 𝜉 ∈ 𝑅 𝑁 1 } & 1𝑁 = {< 𝜉, 1, 0, 0>: 𝜉∈ 𝑅 𝑁 1 }
Let 𝑅 𝑁 1 be a non-empty set and Neutrosophic sets 𝐴𝑅 𝑁 1 and 𝐵𝑅 𝑁 1 in the
form NS 𝐴𝑅 𝑁 1 = {<𝜉, 𝜇𝐴 (𝜉),𝜍𝐴 (𝜉),𝛾𝐴 (𝜉))> : 𝜉∈𝑅 𝐶 1 }&𝐵𝑅 𝑁 1 = {<𝜉,

𝜇𝐵 (𝜉),𝜍𝐵 (𝜉),𝛾𝐵 (𝜉)> : 𝜉∈𝑅 𝐶 1 } defined as:

1 𝐴𝑅 𝑁 1 ⊆ 𝐵𝑅 𝑁 1 ⇔ 𝜇𝐴 (𝜉) ≤ 𝜇𝐵 (𝜉), 𝜍𝐴 (𝜉), ≤ 𝜍𝐵 (𝜉), and 𝛾𝐵 (𝜉) ≥ 𝛾𝐵 (𝜉)

𝑅𝑁 1 𝑅𝑁 1 𝑅𝑁 1 𝑅𝑁 1 𝑅𝑁 1 𝑅𝑁 1
(2)𝐴𝑅 𝑁 1 𝐶 = {<𝜉 , 𝛾𝐵 (𝜉), 𝜍𝐴 (𝜉),𝜇𝐵 (𝜉)>: 𝜉 ∈𝑅 𝐶 1 }

(3)𝐴𝑅 𝑁 1 ∩𝐵𝑅 𝑁 1 ={<𝜉, 𝜇𝐴 (𝜉))⋀𝜇𝐵 (𝜉), 𝜍𝐴 (𝜉))⋀ 𝜍𝐵 (𝜉),𝛾𝐴 (𝜉)∨ 𝛾𝐵 (𝜉)>:

𝜉∈𝑅 𝑁 1
(4)𝐴𝑅 𝑁 1 ∪𝐵𝑅 𝑁 1 ={<x, 𝜇𝐴 (𝜉)∨ 𝜇𝐵 (𝜉), 𝜍𝐴 (𝜉) ∨ 𝜍𝐵 (𝜉), 𝛾𝐴 (𝜉) ⋀𝛾𝐵 (𝜉)> :
𝜉∈𝑅 𝑁 1 }
(5) ∩ 𝐴𝑗𝑅1 𝐶 ={<𝜉, ∧𝑗 𝜇𝐴𝑗 𝜉 , ∧𝑗 𝜍𝐴𝑗 𝜉 , ∨𝑗 𝛾𝐴𝑗 𝜉 > : 𝜉 ∈𝑅 𝑁 1 }

(6) ∪ 𝐴𝑗𝑅 𝑁 1 = {<𝜉, ∨𝑗 𝜇𝐴𝑗 𝜉 , ∨𝑗 𝜍𝐴𝑗 𝜉 , ∧𝑗 𝛾𝐴𝑗 𝜉 > : 𝜉∈𝑅 𝑁 1 } for all 𝜉∈𝑅 𝐶 1
Proposition 2.6 [9] :
For all 𝐴𝑅 𝑁 1 and𝐵𝑅 𝑁 1 are two Neutrosophic sets then the following condition are
are true:
(1) (𝐴𝑅 𝑁 1 ∩ 𝐵𝑅 𝑁 1 )𝐶 = (𝐴𝑅 𝑁 1 )𝐶 ∪(𝐵𝑅 𝑁 1 )𝐶

(2) (𝐴𝑅 𝑁 1 ∪ 𝐵𝑅 𝑁 1 )𝐶 = (𝐴𝑅 𝑁 1 )𝐶 ∩ (𝐵𝐴 )𝐶

𝑅𝑁 1

A Neutrosophic topology is a non -empty set 𝑅 𝑁 1 is a family 𝜏𝑁 𝑅 𝑁 1 of
Neutrosophic subsets in 𝑅 𝑁 1 satisfying the following axioms:
(i) 0𝑁 , 1𝑁 ∈ 𝜏𝑁 𝑅 𝑁 1
(ii) 𝐺𝑅 𝑁 1 ∩𝐻𝑅 𝑁 1 ∈ 𝜏𝑁 𝑅 𝑁 1 for any 𝐺𝑅 𝑁 1 ,𝐻𝑅 𝑁 1 ∈ 𝜏𝑁 𝑅 𝑁 1
(iii) ⋃𝑖 𝐺𝑖𝑅 𝑁 1 ∈ 𝜏𝑁 𝑅 𝑁 1 for every 𝐺𝑖𝑅 𝑁 1 ∈ 𝜏𝑁 𝑅 𝑁 1 , I ∈ J
The pair (𝑅 𝑁 1 , 𝜏𝑁 𝑅𝑁 1 ) is called a Neutrosophic topological space.
The element Neutrosophic topological spaces of 𝜏𝑁 𝑅𝑁 1 are called Neutrosophic
open sets.
A Neutrosophic set 𝐴𝑅 𝑁 1 is closed if and only if 𝐴𝑅 𝑁 1 𝐶 is Neutrosophic open.
Let (𝑅 𝑁 1 , 𝜏𝑁 𝑅 𝑁 1 ) be Neutrosophic topological spaces.
𝐴𝑅 𝑁 1 = {<𝜉,𝜇𝐴 (𝜉),𝜍𝐴 (𝜉),𝛾𝐴 (𝜉))> : 𝜉∈𝑅 𝑁 1 } be a Neutrosophic set in 𝑅 𝑁 1

1. Neu-Cl(𝐴𝑅 𝑁 1 ) =∩{ 𝐾 𝐴 :𝐾 𝐴 is a Neutrosophic closed set in 𝑅 𝑁 1 and

𝑅𝑁 1 𝑅𝑁 1
𝐴𝑅 𝑁 1 ⊆ 𝐾 𝐴 }
𝑅𝑁 1
2. Neu-Int(𝐴𝑅 𝑁 1 ) = ∪{𝐺𝐴 :𝐺𝐴 is a Neutrosophic open set in 𝑅 𝑁 1 and

𝐺𝐴 ⊆𝐴𝑅 𝑁 1 }.
𝑅𝑁 1
3. NeutrosophicSemi-open if 𝐴𝑅 𝑁 1 ⊆ Neu-Cl(Neu-Int(𝐴𝑅 𝑁 1 )).
4. The complement of NeutrosophicSemi-open set is called Neutrosophic
semi-closed.
5. Neu-sCl(𝐴𝑅 𝑁 1 ) =∩ { 𝐾 𝐴 :𝐾 𝐴 is a Neutrosophic Semi closed set in 𝑅 𝑁 1

and 𝐴𝑅 𝑁 1 ⊆ 𝐾 𝐴 }
𝑅𝑁 1
6. Neu-sInt(𝐴𝑅 𝑁 1 ) = ∪{𝐺𝐴 :𝐺𝐴 is a Neutrosophic Semi open set in 𝑅 𝐶 1


and 𝐺𝐴 ⊆𝐴𝑅 𝑁 1 }.
𝑅𝑁 1
7. Neutrosophic α-open set if 𝐴𝑅 𝑁 1 ⊆ Neu-Int(Neu-Cl(Neu-Int(𝐴𝑅 𝑁 1 ))).
8. The complement of Neutrosophic α-open set is called Neutrosophic
α-closed.
9. Neuα- Cl(𝐴𝑅 𝑁 1 ) =∩{ 𝐾 𝐴 :𝐾 𝐴 is a Neutrosophic α - closed set in 𝑅 𝑁 1

and 𝐴𝑅 𝑁 1 ⊆𝐾 𝐴 }
𝑅𝑁 1
10. Neu α -Int(𝐴𝑅 𝑁 1 ) = ∪ {𝐺𝐴 :𝐺𝐴 is a Neutrosophic α - open set in 𝑅 𝑁 1 and

and 𝐺𝐴 ⊆𝐴𝑅 𝑁 1 }.
𝑅𝑁 1
11. Neutrosophicpre open set if 𝐴𝑅 𝑁 1 ⊆ Neu-Int(Neu-Cl𝐴𝑅 𝑁 1 )).
12. The complement of NeutrosophicPre-open set is called Neutrosophic
pre-closed.
13. Neu- pCl(𝐴𝑅 𝑁 1 ) =∩{ 𝐾 𝐴 :𝐾 𝐴 is a Neutrosophic P- closed set in 𝑅 𝑁 1

and 𝐴𝑅 𝑁 1 ⊆𝐾 𝐴 }
𝑅𝑁 1
14. Neu- pInt(𝐴𝑅 𝑁 1 ) = ∪{𝐺𝐴 :𝐺𝐴 is a Neutrosophic P - open set in 𝑅 𝑁 1

and 𝐺𝐴 ⊆ 𝐴𝑅 𝑁 1 }. Remark:2.9[11]
𝑅𝑁 1
Let 𝐴𝑅 𝑁 1 be an Neutrosophic topological space (𝑅 𝑁 1 , 𝜏𝑁 𝑅 𝐶 1 ).Then
(i) Neu α-Cl(𝐴𝑅 𝑁 1 ) = 𝐴𝑅 𝑁 1 ∪ Neu-Cl(Neu-Int(Neu-Cl(𝐴𝑅 𝑁 1 ))).
(ii) Neu α-Int(𝐴𝑅 𝑁 1 ) = 𝐴𝑅 𝑁 1 ∩Neu-Int(Neu-Cl(Neu-Int(𝐴𝑅 𝑁 1 ))).
Take 𝜉1 ,𝜉2 ,𝜉3 are belongs to real numbers 0 to 1 such that 0≤𝜉1 +𝜉2 +𝜉3 ≤1 .An
.An Neutrosophic point ℘(𝜉1 , 𝜉2 , 𝜉3 )is Neutrosophic set defined by
℘(𝜉1 ,𝜉2 ,𝜉3 ) = {(𝜉1 , 𝜉2 , 𝜉3 )𝑖𝑓 𝜉 = ℘

0,0,1 𝑖𝑓 𝜉 ≠ ℘
Take ℘(𝜉1 , 𝜉2 , 𝜉3 ) =<℘𝜉1 ℘𝜉2 . ℘𝜉3 > Where ℘𝜉1 ℘𝜉2 . ℘𝜉3 are represent Neutrosophic
the degree of membership function, the degree indeterminacy and the degree of
non-membership function respectively of each element 𝜉 ∈ 𝑅 𝑁 1 to the set 𝐴𝑅 𝑁 1

Definition 2.11:
A Neutrosophic set 𝐴𝑅 𝑁 1 in 𝑅 𝑁 1 is said to be quasi-coincident (q-coincident)
with a Neutrosophic set 𝐵𝑅 𝑁 1 denoted by 𝐴𝑅 𝑁 1 q𝐵𝑅 𝑁 1 if and only if there exists
𝜉∈𝑅 𝑁 1 such that 𝐴𝑅 𝑁 1 (𝜉) + 𝐵𝑅 𝑁 1 (𝜉) >1.
Remark 2.12 :
𝐴𝑅 𝑁 1 q 𝐵𝑅 𝑁 1 ⟺ 𝐴𝑅 𝑁 1 ⊈ 𝐵𝑅 𝑁 1 𝐶
let𝑅 𝑁 1 and 𝑅 𝑁 2 be two finite sets. Define 𝜓1 :𝑅 𝑁 1 → 𝑅 𝑁 2 .
If𝐴𝑅 𝑁 2 = {<𝜃, 𝜇𝐴 (𝜃),𝜍𝐴 (𝜃),𝛾𝐴 (𝜃))> : 𝜃∈𝑅 𝐶 2 }.is an NS in 𝑅 𝑁 2 , then the inverse
image( pre image) 𝐴𝑅 𝑁 2 under 𝜓1 is an NS defined by 𝜓1 −1 (𝐴𝑅 𝑁 2 )=< 𝜉, 𝜓1 −1 𝜇𝐴

𝑅𝑁 2
(𝜉), 𝜓1 −1 𝜍𝐴 (𝜉), 𝜓1 −1 𝛾𝐴 (𝜉) : 𝜉∈𝑅 𝑁 1 >. Also define image NS U=<𝜉, 𝜇𝑈 (𝜉),
𝜍𝑈 (𝜉), 𝛾𝑈 (𝜉) : 𝜉∈ 𝑅 𝑁 1 :> under 𝜓1 is an NS defined by 𝜓1 (U)=< 𝜃, 𝜓1 (𝜇𝐴 (𝜃)),

𝑅𝑁 2
𝜓1 (𝜍𝐴 (𝜃)), 𝜓1 𝛾𝐴 (𝜃): 𝜃∈ 𝑅 𝑁 2 >

where
𝜓1 (𝜇𝐴 (𝜃)), ={ sup 𝜇𝐴 (𝜉), if 𝜓1 −1 (𝜃) ≠𝜙, 𝜉∈ 𝜓1 −1 (𝜃)

0, elsewhere
𝜓1 (𝜍𝐴 (𝜃))= { sup𝜍𝐴 (𝜉) if 𝜓1 −1 (𝜃) ≠𝜙, 𝜉∈ 𝜓1 −1 (𝜃)

0, elsewhere
𝜓1 (𝛾𝐴 (𝜃))= { inf (𝛾𝐴 (𝜉) if 𝜓1 −1 (𝜃) ≠ 𝜙, 𝜉∈ 𝜓1 −1 (𝜃)

0, Elsewhere
A mapping 𝜓1 :(𝑅 𝑁 1 ,𝜏𝑁 𝑅 𝑁 1 ) → (𝑅 𝑁 2 ., 𝜏𝑁 𝑅𝑁 2 ) is called a
(1) Neutrosophiccontinuous(Neu-continuous ) if𝜓1 −1 𝐴𝑅 𝑁 2 ∈
C(CTS𝑅 𝐶 1 )whenever 𝐴𝑅 𝑁 2 ∈ C(NUTS𝑅 𝑁 2 )

(2) Neutrosophic α-continuous(Neu α - continuous) if 𝜓1 −1 𝐴𝑅 𝑁 2 ∈
𝜓1 −1 𝐴𝑅 𝑁 2 ∈ αC(CTS𝑅 𝐶 1 ) whenever𝐴𝑅 𝑁 2 ∈ C(NUTS𝑅 𝑁 2 )
(3) NeutrosophicSemi-continuous(Neu Semi - continuous ) if
𝜓1 −1 𝐴𝑅 𝑁 2 ∈ 𝑠C(CTS𝑅 𝐶 1 ) whenever𝐴𝑅 𝑁 2 ∈ C(NUTS𝑅 𝑁 2 )
Definition 2.15 :
Let (𝑅 𝐶 1 ,𝜏𝑁 𝑅 𝐶 1 ) be a topological space in the classical sense and (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 2 be
an Neutrosophic topological space. 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅𝑁 ) is called a

2
Neutrosophic multifunction if and only if for each 𝜉 ∈ 𝑅 𝐶 1 , 𝛹 (𝜉) is a Neutrosophic
Neutrosophic set in 𝑅 𝑁 2 .
Definition 2.16 :
For a Neutrosophicmultifunction: 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 2 ),the upper
inverse 𝛹 + (Γ) and lower inverse 𝛹 − (Γ) of a Neutrosophic set 𝛤𝑅 𝑁 2 . in 𝑅 𝑁 2 are
defined as follows:
𝛹 +( 𝛤𝑅 𝑁 2 .) ={ 𝜉 ∈ 𝑅 𝐶 1 \ 𝛹 (𝜉) ≤ 𝛤𝑅 𝑁 2 . } and
𝛹 −( 𝛤𝑅 𝑁 2 .) = {𝜉 ∈ 𝑅 𝐶 1 \ 𝛹(𝜉)q 𝛤𝑅 𝑁 2 .}.
Lemma 2.17 :
For a Neutrosophicmultifunction𝛹: (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅𝑁 2 ),
we have 𝛹 −(1- 𝛤𝑅 𝑁 2 ) = 𝑅 𝐶 1 - 𝛹 +( 𝛤𝑅 𝑁 2 .), for any Neutrosophic set 𝛤𝑅 𝑁 2 . in 𝑅 𝑁 2 .
Lemma 2.18 :
Let 𝛤𝑅 𝑁 2 be a subset of Neutrosophic topology 𝜏𝑁 𝑅 𝑁 2 .then
1.𝛤𝑅 𝑁 2 is𝛼-closed in𝑅 𝑁 2 iffNeu-SInt (Neu-Cl(𝛤𝑅 𝑁 2 ) ⊂ 𝛤𝑅 𝑁 2
2.Neu- SInt(Neu-Cl(𝛤𝑅 𝑁 2 ) = 𝑁𝑒𝑢 − 𝐶𝑙(𝑁𝑒𝑢 − 𝐼𝑛𝑡(𝑁𝑒𝑢 − 𝐶𝑙(𝛤𝑅 𝑁 2 ))

Lemma 2.19 :
Let 𝛤𝑅 𝑁 2 be a subset of Neutrosophic topology 𝜏𝑁 𝑅 𝑁 2 .then below are equivalent
1𝛤𝑅 𝑁 2 isNeu𝛼-open in𝑅 𝑁 2
2.𝑈𝑅 𝑁 2 ⊂ 𝛤𝑅 𝑁 2 ⊂ 𝑁𝑒𝑢 − 𝐼𝑛𝑡(𝑁𝑒𝑢 − 𝐶𝑙 𝑈𝑅 𝑁 2 ) for some 𝑈𝑅 𝑁 2 of 𝑅 𝑁 2 .
3.𝑈𝑅 𝑁 2 ⊂ 𝛤𝑅 𝑁 2 ⊂ 𝑁𝑒𝑢 − 𝑆(𝐶𝑙 𝑈𝑅 𝑁 2 ) for some 𝑈𝑅 𝑁 2 of 𝑅 𝑁 2
4.𝛤𝑅 𝑁 2 ⊂ 𝑁𝑒𝑢 − 𝑆𝐶𝑙 𝑁𝑒𝑢 − 𝐼𝑛𝑡(𝛤𝑅𝑁 2 )
A Neutrosophic multifunction:𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 ,𝜏𝑁 𝑅 𝑁 2 ) is said to be
1. Neutrosophic upper semi continuous at a point 𝜉∈𝑅 𝐶 1 if for any 𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ), 𝛤𝑅 𝑁 2 . containing𝛹(𝜉) ,there exist 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈ O(CTS𝑅 𝐶 1 ) such
that 𝛹 (𝑈𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2 .
2. Neutrosophic lower semi continuous at a point 𝜉∈𝑅 𝐶 1 if for any𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ), with 𝛹 (𝜉)q𝛤𝑅 𝑁 2 , there exist x ∈ 𝑈𝑅 𝐶 1 ∈ O(CTS𝑅 𝐶 1 ) such that
𝛹(𝑈𝑅 𝐶 1 )q𝛤𝑅 𝑁 2
3. Neutrosophic upper semi continuous (Neutrosophic lower semi continuous)
continuous) if it is Neutrosophic upper semi continuous (Neutrosophic
lower semi continuous) at each point 𝜉∈𝑅 𝐶 1 .
4. Neutrosophic upper pre -continuous at a point 𝜉∈𝑅 𝐶 1 if for any 𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ), Γ containing 𝛹(𝜉) ,there exist 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈PO(CTS𝑅 𝐶 1 ) such
that 𝛹 (𝑈𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2
5. Neutrosophic lower pre- continuous at a point 𝜉∈𝑅 𝐶 1 if for any𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ), with𝛹 (𝜉)q𝛤𝑅 𝑁 2 , there exist 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈PO(CTS𝑅 𝐶 1 ) such that
that 𝛹(𝑈𝑅 𝐶 1 )q𝛤𝑅 𝑁 2
6. Neutrosophic upper pre-continuous (Neutrosophic lower pre-continuous) if
if it is Neutrosophic upper pre-continuous (Neutrosophic lower
pre-continuous) at each point 𝜉∈𝑅 𝐶 1 .

7. Neutrosophic upper 𝛼 -continuous at a point 𝜉∈𝑅 𝐶 1 if for any 𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ), Γ containing 𝛹(𝜉) (that is , F (𝜉) ⊂ Γ), there exist 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈
𝛼 O(CTS𝑅 𝐶 1 ) such that 𝛹 (𝑈𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2
8. Neutrosophic lower 𝛼 - continuous at a point 𝜉∈𝑅 𝐶 1 if for any𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ), with𝛹 (𝜉)q𝛤𝑅 𝑁 2 , there exist x ∈ 𝑈𝑅 𝐶 1 ∈ 𝛼 O(CTS𝑅 𝐶 1 ) such
9. Neutrosophic upper 𝛼 -continuous (Neutrosophic lower 𝛼 -continuous) if
it is Neutrosophic upper𝛼 -continuous (Neutrosophic lower 𝛼 -continuous)
-continuous) at each point 𝜉∈𝑅 𝐶 1 .
10. Neutrosophic upper quasi-continuous at a point 𝜉∈𝑅 𝐶 1 if for any 𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ),𝛤𝑅 𝑁 2 containing 𝛹 (𝜉) ,there exist 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈ 𝑆 O(CTS𝑅 𝐶 1 )
such that 𝛹 (𝑈𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2
11. Neutrosophic lower quasi semi continuous at a point 𝜉∈𝑅 𝐶 1 if for any𝛤𝑅 𝑁 2
O(NUTS𝑅 𝑁 2 ), with 𝛹 (𝜉)q𝛤𝑅 𝑁 2 , there exist 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈S O(CTS𝑅 𝐶 1 ) such
12. Neutrosophic upper quasi semi continuous (Neutrosophic lower quasi
semi continuous) if it is Neutrosophic upperquasi semi continuous
(Neutrosophic lower quasi semi continuous) at each point𝜉∈𝑅 𝐶 1 .
III. Lower 𝛼-Irresolute Neutrosophic Multifunctions :

In this section, we introduce the Definition for Neutrosophic Lower 𝛼- irresolute
multifunction and its properties
Definition 3.1 :
An Neutrosophic multifunction 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 2 ) is said to be
(1) Neutrosophic lower α-irresolute at a point 𝑥0 ∈ 𝑅 𝐶 1 , if for any 𝛤𝑅 𝑁 2 ∈
𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 such that 𝛹 𝑥0 𝑞 𝛤𝑅 𝑁 2 there exists 𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 )

containing 𝑥0 such that 𝛹 𝜉 𝑞𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1
(2) Neutrosophic lower 𝛼-irresolute if it is Neutrosophic lower 𝛼-irresolute at
each point of 𝑅 𝐶 1 .
Theorem 3.2 :
Every Neutrosophic lower𝛼-irresolute multifunction is Neutrosophic lower
𝛼-continuous multifunction.
Proof :
Letting𝑥0 ∈ 𝑅 𝐶 1 , 𝛹:(𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .𝜏𝑁 𝑅𝑁 2 ) and 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2
such that 𝛹 𝑥0 𝑞 𝛤𝑅 𝑁 2 . But we know that , Every𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is
𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 ,.Therefore 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 .By our assumption
,Neutrosophic lower𝛼 −irresolute multifunction, there exists 𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 )
containing 𝑥0 such that 𝛹 𝜉 𝑞𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 .Hence𝛹 is Neutrosophic lower
𝛼-continuous multifunction at 𝑥0 .
Theorem 3.3 :
Every Neutrosophic lower𝛼 − irresolute multifunction is Neutrosophic
lower Pre continuous multifunction.
Proof :
Letting 𝑥0 ∈ 𝑅 𝐶 1 , 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 ) and 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2

2
such that 𝛹 𝑥0 𝑞 𝛤𝑅 𝑁 2 . 𝐵ut we know that , Every𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is
𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 .Therefore 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 .By our assumption
,Neutrosophic lower 𝛼-irresolute multifunction, there exists 𝑈𝑅 𝐶 1 ∈
𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 ) containing 𝑥0 such that
𝛹 𝑥0 𝑞𝛤𝑅 𝑁 2 , ∀𝑥 ∈ 𝑈𝑅 𝐶 1 . every𝑈𝑅 𝐶 1 , 𝑈𝑅 𝐶 1 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is 𝑈𝑅 𝐶 1 ∈ 𝑃𝑂 𝐶𝑇𝑇𝑆𝑅 𝑁 2 .

There exists𝑈𝑅 𝐶 1 ∈ 𝑃O(CTS𝑅 𝐶 1 ) containing 𝑥0 such that 𝛹 𝜉 𝑞𝛤𝑅 𝑁 2 , ∀𝜉 ∈

𝑈𝑅 𝐶 1 .Hence𝛹 is Neutrosophic lower Pre-continuous multifunction at 𝑥0 .
Theorem 3.4 :
Every Neutrosophic lower𝛼-irresolute multifunction is Neutrosophic lower
quasi semi continuous multifunction.
Proof :
Letting 𝑥0 ∈ 𝑅 𝐶 1 , 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 ) and 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2

2
such that 𝛹 𝑥0 𝑞 𝛤𝑅 𝑁 2 , But we know that , Every𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is
𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 ,Therefore𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 .By our assumption
,Neutrosophic lower 𝛼 − irresolute multifunction, There exists 𝑈𝑅 𝐶 1 ∈
𝛼O(CTS𝑅 𝐶 1 ) containing 𝑥0 such that 𝛹 𝜉 𝑞𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 Here every
𝑈𝑅 𝐶 1 , 𝑈𝑅 𝐶 1 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is 𝑈𝑅𝐶 1 ∈ 𝑆𝑂 𝐶𝑇𝑇𝑆𝑅 𝑁 2 . Finally we get , There
exists 𝑈𝑅 𝐶 1 ∈ 𝑆O(CTS𝑅 𝐶 1 ) containing 𝑥0 such that 𝛹 𝜉 𝑞𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 hence 𝛹 is
𝛹 is Neutrosophic lower quasi semi continuous multifunction at 𝑥0 .
Theorem 3.5 :
Let 𝛹 ∶ (𝑅 𝐶 1 , 𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 , 𝜏𝑁 𝑅 𝑁 2 ), be an Neutrosophic multifunction and
letting 𝑥0 ∈ 𝑅 𝐶 1 . Then the following statements are equivalent:
(a) 𝛹 is Neutrosophic lower α-irresolute at 𝑥0 .
(b) For any 𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ) with (𝑥0 )𝑞𝛤𝑅 𝑁 2 ,
⟹ 𝑥0 ∈ 𝑠𝐶𝑙(𝐼𝑛𝑡(𝛹 −(𝛤𝑅𝑁 2 ))).
(c) For any 𝑈𝑅 𝐶 1 , 𝑈𝑅 𝐶 1 ∈ 𝑆𝑂(𝐶𝑇𝑆𝑈𝑅 𝐶 1 ) ,𝑥0 𝜖𝑈𝑅 𝐶 1 and for each 𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈
𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ) with 𝛹(𝑥0 )𝑞𝛤𝑅 𝑁 2 , there exists a 𝑉𝑅 𝐶 1 ∈ 𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ) , 𝑉𝑅 𝐶 1 ⊂ 𝑈𝑅 𝐶 1
such that 𝛹 𝜉 𝑞𝑉𝑅 𝐶 1 , ∀ 𝜉 ∈ 𝑉𝑅 𝐶 1
Proof :
(a) ⇒ (b). Let 𝑥0 ∈ 𝑅 𝐶 1 and𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 such that 𝛹 𝑥0 𝑞𝛤𝑅 𝑁 2

Then by our assumption (a) , we get there exists 𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 )
such that 𝑥0 ∈ 𝑈𝑅 𝐶 1 and 𝐹 𝜉 𝑞𝛤𝑅 𝑁 2 , ∀ 𝜉 ∈ 𝑈𝑅 𝐶 1 .Thus 𝑥0 ∈ 𝑈𝑅 𝐶 1 ⊂
𝛹 − 𝛤𝑅 𝑁 2 … … 1 Here 𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 ) .we know that for any set
𝐴𝑅 𝐶 1 , 𝐴𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 )⟺ 𝐴𝑅 𝐶 1 ⊂ 𝑠𝐶𝑙 𝐼𝑛𝑡 𝐴𝑅 𝐶 1 . Therefore, 𝑈𝑅 𝐶 1 ⊂
𝑠𝐶𝑙 𝐼𝑛𝑡 𝑈𝑅 𝐶 1 … 2 . from(1) and(2), we get 𝑥0 ∈ 𝑠𝐶𝑙 𝐼𝑛𝑡𝛹 − 𝛤𝑅 𝑁 2 .Hence
(b).
(b) ⇒ (c). Let 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 such that 𝑥0 𝑞𝛤𝑅 𝑁 2 , then 𝑥0 ∈
𝑠𝐶𝑙 𝐼𝑛𝑡𝛹 − 𝛤𝑅𝑁 2 . Let 𝑈𝑅 𝐶 1 ∈ 𝑠O(CTS𝑅 𝐶 1 ) and 𝑥0 ∈ 𝑈𝑅 𝐶 1 .Then 𝑈𝑅 𝐶 1 ∩
𝐼𝑛𝑡 𝛹 − 𝛤𝑅 𝑁 2 ≠ 𝜑 and 𝑈𝑅 𝐶 1 ∩ 𝐼𝑛𝑡 𝛹 − 𝛤𝑅𝑁 2 is semi-open in 𝑅 𝐶 1 . Put
𝑉𝑅 𝐶 1 = 𝐼𝑛𝑡(𝑈𝑅 𝐶 1 ∩ 𝐼𝑛𝑡(𝛹 −(𝛤𝑅𝑁 2 )), Then 𝑉𝑅𝐶 1 is an open set of 𝑅 𝐶 1 , 𝑉𝑅 𝐶 1 ⊂
𝑈𝑅 𝐶 1 , 𝑉𝑅 𝐶 1 ≠ 𝜑and 𝛹 𝑣 𝑞𝛤𝑅 𝑁 2 , ∀𝑣 ∈ 𝑉𝑅 𝐶 1 . (c) ⇒ (a).Let {𝑈𝜉 } be the system of
the 𝑠O(CTS𝑅 𝐶 1 ) containing 𝜉.
Let 𝑈𝑅 𝐶 1 ∈ 𝑆O(CTS𝑅 𝐶 1 ) and 𝑥0 ∈ 𝑈𝑅 𝐶 1 and Any 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑌 such
that 𝛹 𝑥0 𝑞𝛤𝑅 𝑁 2 , there exists a nonempty open set 𝐵𝑈 ⊂ 𝑈𝑅 𝐶 1 Such that
𝛹 𝑣 𝑞𝛤𝑅 𝑁 2 ∀𝑣 ∈ 𝐵𝑈 . Let 𝑊𝑅 𝐶 1 = ∪ 𝐵𝑈 ∶ 𝑈 ∈ 𝑈𝑥 0 , then 𝑊𝑅 𝐶 1 ∊
O(CTS𝑅 𝐶 1 ),and 𝑥0 ∈ 𝑠𝐶𝑙 𝑊𝑅 𝐶 1 and 𝛹 𝑣 𝑞𝛤𝑅 𝑁 2 , ∀𝑣 ∈ 𝑊𝑅 𝐶 1 .Put
𝑆 𝑅 𝐶 1 = 𝑊𝑅 𝐶 1 ∪ 𝑥0 , then 𝑊𝑅 𝐶 1 ⊂ 𝑆 𝑅 𝐶 1 ⊂ 𝑠𝐶𝑙 𝑊𝑅 𝐶 1 . Thus 𝑆 𝑅 𝐶 1 ∈
𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ) ), 𝑥0 ∈ 𝑆 𝑅 𝐶 1 and 𝛹 𝑣 𝑞𝛤𝑅 𝑁 2 , ∀𝑣 ∈ 𝑆 𝑅 𝐶 1 . Hence 𝛹is
Neutrosophic lower α-irresolute at 𝑥0 .
Theorem 3.6 :
Let𝛹 ∶ (𝑅 𝐶 1 , 𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 . , 𝜏𝑁 𝑅 𝑁 2 ), be an Neutrosophic multifunction. Then
the following statements are equivalent:
(a) 𝛹 is Neutrosophic lower α-irresolute.
(b)𝛹 −(𝜆𝑅 𝑁 2 ) ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ),for every Neutrosophic α-open set 𝜆𝑅 𝑁 2 of 𝑅 𝑁 2 .
(c) 𝛹 +(𝛽𝑅 𝑁 2 ) ∈ 𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ),for every Neutrosophic α-closed set 𝛽𝑅 𝑁 2 of 𝑅 𝑁 2 .
(d) 𝑠𝐼𝑛𝑡(𝐶𝑙(𝛹 + (𝛤𝑅 𝑁 2 ))) ⊂ 𝛹 +(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛤𝑅 𝑁 2 )), for each Neutrosophic set𝛤𝑅 𝑁 2 of

𝑅𝑁 2 .
(e) 𝛹 𝑠𝐼𝑛𝑡 𝐶𝑙 𝑉𝑅 𝐶 1 ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛹(𝑉𝑅𝐶 1 )),for each subset𝑉𝑅 𝐶 1 of 𝑅 𝐶 1 .
(f) 𝛹 𝛼𝐶𝑙 𝑉𝑅 𝐶 1 ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛹(𝑉𝑅 𝐶 1 )),for each subset 𝑉𝑅 𝐶 1 of 𝑅 𝐶 1 ,
(g) 𝛼𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 )) ⊂ 𝛹 +(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛤𝑅 𝑁 2 )),for each Neutrosophic set 𝛤𝑅 𝑁 2 of
𝑅𝑁 2 .
(h) 𝛹 𝐶𝑙 𝐼𝑛𝑡 𝐶𝑙 𝐴𝑅 𝐶 1 ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛹(𝐴𝑅 𝐶 1 )),for each subset 𝐴𝑅 𝐶 1 of 𝑅 𝐶 1 .
Proof :
(a)⇒(b). Let 𝜆𝑅 𝑁 2 ∈ 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ) and 𝑥0 ∈ 𝛹 − 𝜆𝑅 𝑁 2 such that𝛹(𝑥0 )𝑞𝜆𝑅 𝑁 2 ,
since 𝛹 is Neutrosophic lower α-irresolute, Applying previous theorem, it follows
that 𝑥0 ∈ 𝑠𝐶𝑙(𝐼𝑛𝑡(𝛹 −(𝜆𝑅 𝑁 2 ))). As 𝑥0 is chosen arbitray in 𝛹 −(𝜆𝑅𝑁 2 ), we have
𝛹 −(𝜆𝑅 𝑁 2 ) ⊂ 𝑠𝐶𝑙(𝐼𝑛𝑡𝛹 −(𝜆𝑅𝑁 2 )) and thus 𝛹 − 𝜆𝑅 𝑁 2 ∈ 𝛼𝑂 𝐶𝑇𝑆𝑅 𝐶 1 . Hence 𝛹 −(𝜆𝑅𝑁 2 )
is an 𝛼 −open in 𝑅 𝐶 1 .(b)⇒(a). Let 𝑥0 ∈ 𝑅 𝐶 1 and 𝜆𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 such that
𝛹(𝑥0 )𝑞𝜆𝑅 𝑁 2 , so that𝑥0 ∈ 𝛹 −(𝜆𝑅𝑁 2 ). By hypothesis 𝛹 − 𝜆𝑅 𝑁 2 ∈ 𝛼𝑂 𝐶𝑇𝑆𝑅 𝐶 1 . We
have 𝑥0 ∈ 𝛹 −(𝜆𝑅 𝑁 2 ) ⊂ 𝑠𝐶𝑙(𝐼𝑛𝑡(𝛹 −(𝜆𝑅𝑁 2 ))) and we get 𝛹 is Neutrosophic lower
α-irresolute at 𝑥0. . As 𝑥0 was arbitrarily chosen, 𝛹 is Neutrosophic lower
α-irresolute.
(b)⇔(c). From the definition, both are equivalent.
(c)⇒ (d).Let 𝛤𝑅 𝑁 2 ∈ 𝑁𝑈𝑇𝑆𝛤𝑅 𝑁 2 . taking closure , Neu- 𝛼𝐶𝑙 𝛤𝑅 𝑁 2 is Neutrosophic
α-closed set in 𝑅 𝑁 2 . By our assumption, 𝛹 + 𝑁𝑒𝑢 − 𝛼𝐶𝑙 𝛤𝑅 𝑁 2 ∈ 𝛼𝐶 𝐶𝑇𝑆𝑅 𝐶 1 .
We know that sIntCl(𝐴𝑅 𝐶 1 ) ⊂ 𝐴𝑅 𝐶 1 iff 𝐴𝑅 𝐶 1 ∈ 𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ).
we obtain
𝛹 + 𝑁𝑒𝑢 − 𝛼𝐶𝑙 𝛤𝑅 𝑁 2 ⊃ 𝑠𝐼𝑛𝑡 𝐶𝑙 𝛹 + 𝑁𝑒𝑢 − 𝐶𝑙 𝛤𝑅 𝑁 2 ⊃ 𝑠𝐼𝑛𝑡 𝐶𝑙 𝛹 + 𝛤𝑅 𝑁 2 .
(d) ⇒ (e) Suppose that (d) is satisfied and let 𝑉𝑅 𝐶 1 be an arbitrary subset of 𝑅 𝐶 1 . Let
us Take𝛤𝑅 𝑁 2 = 𝛹(𝑉𝑅𝐶 1 ), Then𝑉𝑅 𝐶 1 ⊂ 𝛹 +(𝛤𝑅𝑁 2 ). Therefore, by hypothesis, we have
𝑠𝐼𝑛𝑡(𝐶𝑙(𝑉𝑅 𝐶 1 )) ⊂ 𝑠𝐼𝑛𝑡(𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 ))) ⊂ 𝛹 +(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛤𝑅 𝑁 2 )).

Therefore,𝛹 𝑠𝐼𝑛𝑡 𝐶𝑙 𝑉𝑅 𝐶 1 ⊂ 𝛹 𝛹 + 𝑁𝑒𝑢 − 𝛼𝐶𝑙 𝛤𝑅 𝑁 2 ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙 𝛤𝑅 𝑁 2 =
𝑁𝑒𝑢 − 𝛼𝐶𝑙 𝛹 𝑉𝑅 𝐶 1 .
(e) ⇒(c).Suppose that (e) is true. and let 𝛤𝑅 𝑁 2 ∈ 𝛼𝐶(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ). Put 𝑉𝑅 𝐶 1 =
𝛹 +(𝛤),Then 𝛹(𝑉𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2 . Therefore, by our hypothesis, we have
𝛹 𝑠𝐼𝑛𝑡 𝐶𝑙 𝑉𝑅 𝐶 1 ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙 𝛹 𝑉𝑅 𝐶 1 ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛤𝑅 𝑁 2 ) = 𝛤𝑅 𝑁 2 .And
𝛹 +(𝛹(𝑠𝐼𝑛𝑡(𝐶𝑙( 𝑉𝑅 𝐶 1 )))) ⊂ 𝛹 +(𝛤𝑅𝑁 2 ). Since we always have
𝛹 +(𝛹(𝑠𝐼𝑛𝑡(𝐶𝑙( 𝑉𝑅 𝐶 1 )))) ⊃ 𝑠𝐼𝑛𝑡(𝐶𝑙( 𝑉𝑅 𝐶 1 )),Then must verify
𝛹 + 𝛤𝑅 𝑁 2 ⊃ 𝑠𝐼𝑛𝑡 𝐶𝑙 𝛹 + 𝛤𝑅𝑁 2 . We know that sIntCl𝑉𝑅 𝐶 1 ⊂ 𝑉𝑅 𝐶 1 iff 𝑉𝑅 𝐶 1 ∈
𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ),Finally we get 𝐹 +(𝛤𝑅𝑁 2 ) ∈ 𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ).
(c)⇒ (f). Here 𝑉𝑅 𝐶 1 ⊂ 𝛹 +(𝛹( 𝑉𝑅 𝐶 1 )), we have 𝑉𝑅 𝐶 1 ⊂ 𝛹 + (𝑁𝑒𝑢 −
𝐶𝑙(𝛹( 𝑉𝑅 𝐶 1 ))).NowNeu-𝛼𝐶𝑙(𝛹( 𝑉𝑅𝐶 1 )) is an Neutrosophic α-closed set in 𝑅 𝑁 2 and so
by our assumption,𝛹 +(𝑁𝑒𝑢 − 𝐶𝑙(𝛹( 𝑉𝑅𝐶 1 ))) ∈ 𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ).Thus𝛼𝐶𝑙( 𝑉𝑅𝐶 1 ) ⊂
𝛹𝛹 +(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛹( 𝑉𝑅 𝐶 1 ))). Consequently, 𝛹 𝛼𝐶𝑙 𝑉𝑅 𝐶 1 ⊂ 𝛹 𝛹 + 𝑁𝑒𝑢 −
𝛼𝐶𝑙 𝛹 𝑉𝑅 𝐶 1 ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛹( 𝑉𝑅𝐶 1 )).
(f)⇒ (c).Let 𝛤𝑅 𝑁 2 ∈ 𝛼𝐶𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ). Replacing 𝑉𝑅 𝐶 1 by 𝛹 +we get by(f),
𝛹(𝛼𝐶𝑙(𝛹 +(𝛤𝑅𝑁 2 ))) ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛹(𝛹 + (𝛤𝑅 𝑁 2 ))) ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛤𝑅𝑁 2 ) =
𝛤𝑅 𝑁 2 .Consequently, 𝛼𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 )) ⊂ 𝛹 +(𝛤𝑅𝑁 2 ). But 𝛹 +(𝛤𝑅 𝑁 2 ) ⊂ 𝛼𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 ))
and so, 𝛼𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 )) = 𝛹 +(𝛤𝑅 𝑁 2 ).
Thus 𝛹 +(𝛤𝑅𝑁 2 ) ∈ 𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ).
(f) ⇒ (g). Let𝛤𝑅 𝑁 2 be any Neutrosophic set of 𝑅 𝑁 2 . Replacing 𝑉𝑅 𝐶 1 by 𝛹 +(𝛤𝑅 𝑁 2 ) we
we get by (f),𝛹 𝛼𝐶𝑙 𝛹 + 𝛤𝑅 𝑁 2 ⊂ 𝑁𝐸𝑈 − 𝛼𝐶𝑙(𝛹(𝛹 +(𝛤𝑅 𝑁 2 ))) ⊂ 𝑁𝑒𝑢 −
𝛼𝐶𝑙(𝛤𝑅 𝑁 2 ).Therefore we get 𝛼𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 )) ⊂ 𝛹 +(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛤𝑅𝑁 2 )).
(g)⇒ (f). Replacing 𝛤𝑅 𝑁 2 by 𝛹( 𝑉𝑅𝐶 1 ), where 𝑉𝑅 𝐶 1 is a subset of 𝑅 𝐶 1 , we get by our
result (g),𝛼𝐶𝑙(𝑉𝑅 𝐶 1 ) ⊂ 𝛼𝐶𝑙(𝛹 +(𝛹(𝑉𝑅 𝐶 1 ))) = 𝛼𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 )) = 𝛹 +(𝛼𝐶𝑙(𝛤𝑅𝑁 2 )) =
𝛹 +(𝛼𝐶𝑙(𝛹(𝑉𝑅 𝐶 1 ))).Thus 𝛹(𝛼𝐶𝑙(𝑉𝑅 𝐶 1 )) ⊂ 𝛹(𝛹 +(𝛼𝐶𝑙(𝛹(𝑉𝑅𝐶 1 ))) ⊂ 𝑁𝑒𝑢 𝛼𝐶𝑙(𝛹(𝑉𝑅 𝐶 1 )).

(e)⇒ (h).Clearly is true from the above result.
(h)⇒(a). Let 𝜉 ∈ 𝑅 𝐶 1 and 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 )such that (𝜉 )𝑞𝛤𝑅 𝑁 2 . Then 𝜉 ∈
𝜉 ∈ 𝛹 − 𝛤𝑅 𝑁 2 .We shall show that 𝛹 −(𝛤𝑅𝑁 2 ) ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ). By the hypothesis, We
have 𝛹(𝐶𝑙(𝐼𝑛𝑡(𝐶𝑙(𝛹 +(𝛤𝑅 𝑁 2 𝑐 ))))) ⊂ 𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝛹(𝛹 +(𝛤𝑅 𝑁 2 𝑐 ))) ⊂ (𝛤𝑅𝑁 2 𝑐 ), Which
implies 𝐶𝑙(𝐼𝑛𝑡(𝐶𝑙(𝛹 +(𝛤𝑅𝑁 2 +))))) ⊂ 𝛹 + (𝛤𝑅𝑁 2 𝑐 ) ⊂ (𝛹 −(𝛤𝑅𝑁 2 ))𝑐 .Therefore, we obtain
𝛹 −(𝛤𝑅𝑁 2 ) ⊂ 𝐼𝑛𝑡(𝐶𝑙(𝐼𝑛𝑡(𝛹 −(𝛤𝑅 𝑁 2 )))) . Hence 𝛹 −(𝛤𝑅𝑁 2 ) ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ). Put
𝑈𝑅 𝐶 1 = 𝛹 −(𝛤𝑅 𝑁 2 ). Then 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ) and 𝛹(𝑢)𝑞𝛤𝑅 𝑁 2 for every
𝑢 ∈ 𝑈𝑅 𝐶 1 . Therefore 𝛹 is Neutrosophic lower α-irresolute.
IV. Upper α-Irresolute Neutrosophic Multifunctions :
In this section, we introduce the Definition for Neutrosophic upper 𝛼- irresolute
multifunction and its properties.
Definition 4.1 :
An Neutrosophicmultifunction𝛹: (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 2 ), is called
(a) Neutrosophic upper α-irresolute at a point 𝑥 0 ∈ 𝑅 𝐶 1 , if for any 𝛤𝑅 𝑁 2 ,𝛤𝑅 𝑁 2 ∈
𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 . ) such that 𝛹(𝑥 0 ) ⊂ 𝛤𝑅 𝑁 2 there exists 𝑈𝑅 𝐶 1 ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 )
containing 𝑥 0 such that 𝛹(𝑈𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2 .
(b) Neutrosophic upper α-irresolute if it is satisfiedthat property at each point of
𝑅𝐶 1 .
Theorem 4.2 :
Every Neutrosophic upper𝛼-irresolute multifunction is Neutrosophic
upper𝛼-continuous multifunction.
Proof:
Letting𝑥0 ∈ 𝑅 𝐶 1 , 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 2 ) and 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2
such that 𝛹 𝑥0 ⊂ 𝛤𝑅 𝑁 2 , But we know that , every𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is
𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 , Therefore 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 ,By our assumption

,Neutrosophic lower 𝛼 − irresolute multifunction, There exists 𝑈𝑅 𝐶 1 ∈
𝛼O(CTS𝑅 𝐶 1 ) containing 𝑥0 such that 𝛹(𝜉 ) ⊂ 𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 Hence 𝛹 is
Neutrosophic lower 𝛼-continuous multifunction at 𝑥0 .
Theorem 4.3 :
Every Neutrosophic upper𝛼-irresolute multifunction is Neutrosophic upper
Pre-continuous multifunction.
Proof:
Letting 𝑥0 ∈ 𝑅 𝐶 1 , 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 2 ) and 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2
such that 𝛹 𝑥0 ⊂ 𝛤𝑅 𝑁 2 .But we know that , Every𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is
𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 .Therefore 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 .By our assumption
,Neutrosophicupper𝛼 −irresolute multifunction, There exists 𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 )
containing 𝑥0 such that

𝛹 𝜉 ⊂ 𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 , every𝑈𝑅 𝐶 1 , 𝑈𝑅 𝐶 1 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is 𝑈𝑅 𝐶 1 ∈
𝑃𝑂 𝐶𝑇𝑇𝑆𝑅 𝑁 2 .There exists 𝑈𝑅 𝐶 1 ∈ 𝑃O(CTS𝑅 𝐶 1 ) containing 𝑥0 such that 𝛹 𝜉 ⊂
𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 hence 𝛹 is NeutrosophicupperPre-continuous multifunction at 𝑥0 .
Theorem 4.4 :
Every Neutrosophic upper𝛼-irresolute multifunction is
Neutrosophicupperquasi semi continuous multifunction.
Proof:
Letting 𝑥0 ∈ 𝑅 𝐶 1 , 𝛹 : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅 𝑁 2 ) and 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2
such that 𝛹 𝑥0 ⊂ 𝛤𝑅 𝑁 2 ,.But we know that , Every𝛤𝑅 𝑁 2 , 𝛤𝑅 𝑁 2 ∈ 𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is
𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 ,
Therefore 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 , By our assumption
,Neutrosophicupper𝛼-irresolute multifunction, there exists 𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 )
containing 𝑥0 such that

𝛹 𝜉 ⊂ 𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 . Every𝑈𝑅 𝐶 1 , 𝑈𝑅 𝐶 1 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 is 𝑈𝑅 𝐶 1 ∈
𝑆𝑂 𝐶𝑇𝑇𝑆𝑅 𝑁 2 . Their exists 𝑈𝑅 𝐶 1 ∈ 𝑆O(CTS𝑅 𝐶 1 ) containing 𝑥0 such that 𝛹 𝜉 ⊂
𝛤𝑅 𝑁 2 , ∀𝜉 ∈ 𝑈𝑅 𝐶 1 Hence 𝛹 is Neutrosophicupper quasi semi continuous
multifunction at 𝑥0 .
Theorem 4.5
Let : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 .,𝜏𝑁 𝑅𝑁 2 ), be an Neutrosophic multifunction and let
𝜉 ∈ 𝑅 𝐶 1 . Then the following statements are equivalent:
(a) 𝛹is Neutrosophic Upper α-irresolute at 𝜉.
(b) For each 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ) with (𝜉) ⊂ 𝛤𝑅 𝑁 2 , Implies
𝜉 ∈ 𝑠𝐶𝑙(𝐼𝑛𝑡(𝛹 −(𝛤))).
(c) For any 𝜉 , 𝜉 ∈ 𝑈𝑅 𝐶 1 ∈ 𝑆𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ) and for any 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ) with
(𝜉) ⊂ 𝛤𝑅 𝑁 2 , there exists a nonempty open set 𝑉𝑅 𝐶 1 ⊂ 𝑈𝑅 𝐶 1 such that 𝛹( 𝑉𝑅 𝐶 1 ) ⊂
𝛤𝑅 𝑁 2 .
Proof.
(a)⇒ (b) Let 𝜉 ∈ 𝑅 𝐶 1 and 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ) Such that 𝛹 𝜉 ⊂ 𝛤𝑅 𝑁 2 Then by
our assumption (a), we get there exists 𝑈𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 ) such that
𝜉 ∈ 𝑈𝑅 𝐶 1 and 𝐹(𝑈𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2 , Thus 𝜉 ∈ 𝑈𝑅 𝐶 1 ⊂ 𝛹 +(𝛤𝑅 𝑁 2 ). here 𝑈𝑅 𝐶 1 ∈
𝛼O(CTS𝑅 𝐶 1 ) .We know that for any set 𝐴𝑅 𝐶 1 , 𝐴𝑅 𝐶 1 ∈ 𝛼O(CTS𝑅 𝐶 1 )⟺ 𝐴𝑅 𝐶 1 ⊂
𝑠𝐶𝑙(𝐼𝑛𝑡(𝐴𝑅 𝐶 1 )). Therefore, 𝑈𝑅 𝐶 1 ⊂ 𝑠𝐶𝑙(𝐼𝑛𝑡(𝑈𝑅 𝐶 1 )). Finally we get
𝜉 ∈ 𝑠𝐶𝑙(𝐼𝑛𝑡𝛹 +(𝛤𝑅 𝑁 2 )).hence(b).
(b)⇒ (c).Let 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 ) such that 𝛹(𝜉) ⊂ 𝛤𝑅 𝑁 2 , then
𝜉 ∈ 𝑠𝐶𝑙(𝐼𝑛𝑡𝛹 −(𝛤𝑅𝑁 2 )). Let 𝑈𝑅 𝐶 1 ∈ 𝑆O(CTS𝑅 𝐶 1 ) and 𝜉 ∈ 𝑈𝑅 𝐶 1 .Then𝑈𝑅 𝐶 1 ∩
𝐼𝑛𝑡(𝛹 −(𝛤𝑅 𝑁 2 )) ≠ 𝜑 and 𝑈𝑅 𝐶 1 ∩ 𝐼𝑛𝑡(𝛹 −(𝛤𝑅 𝑁 2 )) is semi-open in 𝑅 𝐶 1 .Put 𝑉𝑅 𝐶 1 =
𝐼𝑛𝑡(𝑈𝑅 𝐶 1 ∩ 𝐼𝑛𝑡(𝛹 −(𝛤𝑅 𝑁 2 )), Then 𝑉𝑅 𝐶 1 is an open set of 𝑅 𝐶 1 , 𝑉𝑅 𝐶 1 ⊂ 𝑈𝑅 𝐶 1 , 𝑉𝑅 𝐶 1 ≠ 𝜑
and 𝛹(𝑉𝑅 𝐶 1 ) ⊂ 𝛤𝑅 𝑁 2 ,

(c) ⇒(a).Let {𝑈𝜉 } be the system of the 𝑆O(CTS𝑅 𝐶 1 ) containing𝜉. Let 𝑈𝑅 𝐶 1 ∈
𝑆O(CTS𝑅 𝐶 1 ) and 𝜉 ∈ 𝑈𝑅 𝐶 1 and Let 𝛤𝑅 𝑁 2 ∈ 𝛼𝑂 𝑁𝑈𝑇𝑆𝑅 𝑁 2 such that 𝛹 𝜉 ⊂ 𝛤𝑅 𝑁 2 ,
there exists a nonempty open set 𝐵𝑈 ⊂ 𝑈𝑅 𝐶 1 Such that 𝛹(𝑣) ⊂ 𝛤𝑅 𝑁 2 , ∀𝑣 ∈ 𝐵𝑈 . Let
𝑊𝑅 𝐶 1 = ∪ 𝐵𝑈 ∶ 𝑈𝑅 𝐶 1 ∈ {𝑈𝜉 }, then 𝑊𝑅 𝐶 1 ∊O(CTS𝑅 𝐶 1 ) and 𝜉 ∈ 𝑠𝐶𝑙(𝑊𝑅 𝐶 1 ) and
𝛹(𝑣) ⊂ 𝛤𝑅 𝑁 2 , ∀𝑣 ∈ 𝑊𝑅 𝐶 1 .Put 𝑆𝑅 𝐶 1 = 𝑊𝑅 𝐶 1 ∪ 𝜉.Then 𝑊𝑅 𝐶 1 ⊂ 𝑆𝑅 𝐶 1 ⊂ 𝑠𝐶𝑙(𝑊𝑅 𝐶 1 ).
Thus 𝑆𝑅 𝐶 1 ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ) ), 𝜉 ∈ 𝑆𝑅 𝐶 1 and 𝛹(𝑣) ⊂ 𝛤𝑅 𝑁 2 , ∀𝑣 ∈ 𝑆. Hence 𝛹 is
Neutrosophic Upper α-irresolute at 𝜉.
Theorem 4.6
For an Neutrosophicmultifunction : (𝑅 𝐶 1 ,𝜏𝑅 𝐶 1 ) → (𝑅 𝑁 2 ,𝜏𝑁 𝑅 𝑁 2 )the following
statements are equivalent:
(a) 𝛹 is Neutrosophic upper α-irresolute.
(b) 𝛹 +(𝛤𝑅 𝑁 2 ) ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ),for every Neutrosophic α-open set 𝛤𝑅 𝑁 2 𝑜𝑓 𝑅 𝑁 2
(c) 𝛹 −(𝜆𝑅𝑁 2 . ) ∈ 𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ),for each Neutrosophic α-closed set 𝜆𝑅 𝑁 2 . 𝑜𝑓 𝑅 𝑁 2 .
(d) For each point 𝜉 ∈ 𝑅 𝐶 1 and for each α-neighborhood 𝑉𝑅 𝑁 2 . of
𝛹(𝜉 ) 𝑖𝑛 𝑅 𝑁 2 . 𝐹 +(𝑉𝑅 𝑁 2 . ) is an α-neighborhood of 𝜉.
(e) For each point 𝜉 ∈ 𝑅 𝐶 1 and for each α-neighborhood 𝑉𝑅 𝑁 2 .of 𝛹 (𝜉) in 𝑅 𝑁 2 .,
𝑅 𝑁 2 ., there is an α- neighborhood 𝑈𝑅 𝐶 1 of 𝜉 such that 𝛹(𝑈𝑅 𝐶 1 ) ⊂ 𝑉𝑅 𝑁 2 . .
(f) 𝛼𝐶𝑙(𝛹 −(𝜆𝑅 𝑁 2 . )) ⊂ 𝛹 −(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝜆𝑅 𝑁 2 . )) 𝑓𝑜𝑟 each Neutrosophic set
𝜆𝑅 𝑁 2 . 𝑜𝑓 𝑅 𝑁 2 .
(g) 𝑠𝐼𝑛𝑡(𝐶𝑙(𝛹 − (𝜆𝑅𝑁 2 . ))) ⊂ 𝛹 −(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝜆𝑅 𝑁 2 . ))for any Neutrosophic set
𝜆 𝑜𝑓 𝑅 𝑁 2 ..
Proof.
(a)⇒ (b). Let 𝛤𝑅 𝑁 2 𝜖 𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 . ) and 𝜉 ∈ 𝛹 + 𝛤𝑅𝑁 2 .Applying previous
theorem, we get 𝜉 ∈ 𝑠𝐶𝑙(𝐼𝑛𝑡𝛹 +(𝛤𝑅 𝑁 2 )).Therefore, we obtain 𝛹 + 𝛤𝑅 𝑁 2 ⊂
𝑠𝐶𝑙 𝐼𝑛𝑡𝛹 + 𝛤𝑅𝑁 2 ., Finally we get 𝛹 +(𝛤𝑅𝑁 2 ) ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ).

(b)⇒ (a). Let 𝜉be arbitrarily point in 𝑅 𝐶 1 and 𝛤𝑅 𝑁 2 𝜖𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 . ) such that
𝛹(𝜉) ⊂ 𝛤𝑅 𝑁 2 so ∈ 𝛹 +(𝛤𝑅 𝑁 2 ) . By hypothesis 𝛹 +(𝛤𝑅𝑁 2 ) ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ), we
get𝜉 ∈ 𝛹 +(𝛤𝑅 𝑁 2 ) ⊂ 𝑠𝐶𝑙(𝐼𝑛𝑡(𝛹 + (𝛤𝑅 𝑁 2 ))) and hence F is Neutrosophic upper
upper α-irresolute at 𝜉.As 𝜉 is arbitrarily chosen, 𝛹 is Neutrosophic upper
α-irresolute.
𝐶 𝐶
(b)⇒ (c). This implies easily get from that 𝛹 − 𝛤𝑅𝑁 2 = [𝛹 + 𝛤𝑅 𝑁 2 ].where
𝛤𝑅 𝑁 2 𝜖𝛼𝑂(𝑁𝑈𝑇𝑆𝑌)
(c)⇒ (f).Let 𝜆𝑅 𝑁 2 . 𝜖𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 . ) .Then by our assumption (c), 𝛹 −(𝑁𝑒𝑢 −
𝛼𝐶𝑙(𝜆𝑅 𝑁 2 . )) is an α-closed set in 𝑅 𝐶 1 . We have𝛹 −(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝜆𝑅 𝑁 2 . )) ⊃
𝑠𝐼𝑛𝑡(𝐶𝑙(𝛹 − (𝑁𝑒𝑢 − 𝐶𝑙(𝜆𝑅𝑁 2 . )))) ⊃ 𝑠𝐼𝑛𝑡(𝐶𝑙(𝛹 −(𝜆𝑅 𝑁 2 . ))) ⊃
𝛹 −(𝜆) ∪ 𝑠𝐼𝑛𝑡(𝐶𝑙(𝛹 −(𝜆𝑅𝑁 2 . ))) ⊃ 𝛼𝐶𝑙(𝛹 −(𝜆𝑅𝑁 2 . )).Hence the result.
(f)⇒(g).Let 𝜆𝑅 𝑁 2 . 𝜖𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 . ). we have 𝛼𝐶𝑙(𝛹 −(𝜆𝑅 𝑁 2 . )) = 𝛹 −(𝜆𝑅𝑁 2 . ) ∪
𝑠𝐼𝑛𝑡(𝐶𝑙(𝛹 − (𝜆𝑅 𝑁 2 . ))) ⊂ 𝛹 −(𝑁𝑒𝑢 − 𝛼𝐶𝑙(𝜆𝑅 𝑁 2 . )). Hence (g).
(g)⇒(c).Let 𝜆𝑅 𝑁 2 . 𝐶 𝜖 𝛼𝐶(𝑁𝑈𝑇𝑆𝑅 𝑁 2 . )Then by (g) we have,
𝑠𝐼𝑛𝑡 𝐶𝑙 𝛹 − 𝜆𝑅 𝑁 2 . 𝐶 ⊂ 𝛹 − 𝜆𝑅 𝑁 2 . 𝐶 ∪ 𝑠𝐼𝑛𝑡 𝐶𝑙 𝛹 − 𝜆𝑅 𝑁 2 . 𝐶
⊂ 𝛹 − 𝛼𝐶𝑙(𝜆𝑅𝑁 2 . 𝑐 = 𝛹 −(𝜆𝑅 𝑁 2 . 𝐶 ).
Hence By our result, 𝛹 −(𝜆𝑅𝑁 2 . 𝐶 ) ∈ 𝛼𝐶(𝐶𝑇𝑆𝑅 𝐶 1 ).
(b)⇒(d).Let 𝜉 ∈ 𝑅 𝐶 1 and 𝑉𝑅 𝑁 2 . be an α-neighborhood of 𝛹(𝜉) in 𝑅 𝑁 2 .Then
there is an 𝜆𝑅 𝑁 2 . 𝜖𝛼𝑂(𝑁𝑈𝑇𝑆𝑅 𝑁 2 . ) such that 𝛹(𝜉) ⊂ 𝜆𝑅 𝑁 2 . ⊂ 𝑉𝑅 𝑁 2 . . Hence,
𝜉 ∈ 𝛹 +(𝜆𝑅 𝑁 2 ) ⊂ 𝛹 +(𝑉𝑅 𝑁 2 ). Now by hypothesis 𝛹 +(𝜆𝑅𝑁 2 ) ∈ 𝛼𝑂(𝐶𝑇𝑆𝑅 𝐶 1 ),
and Thus 𝛹 +(𝑉𝑅𝑁 2 . ) is an α-neighborhood of 𝜉.
(d)⇒(e). Let 𝜉 ∈ 𝑅 𝐶 1 and 𝑉𝑅 𝑁 2 be an α-neighborhood of 𝛹(𝜉) in 𝑅 𝑁 2 .Put
𝑈𝑅 𝐶 1 = 𝛹 + 𝑉𝑅 𝑁 2 . .Then 𝑈𝑅 𝐶 1 is an α-neighborhood of 𝜉 and 𝛹(𝑈) ⊂ 𝑉𝑅 𝑁 2 .
(e)⇒(a).Let𝜉 ∈ 𝑅 𝐶 1 and𝑉𝑅𝑁 2 be an Neutrosophic set in 𝑅 𝑁 2 such that 𝛹(𝜉) ⊂
𝛹(𝜉) ⊂ 𝑉𝑅𝑁 2 . . 𝑉𝑅 𝑁 2 . being an Neutrosophic α-open set in 𝑅 𝑁 2 . , is an
α-neighborhood of 𝛹(𝜉) and according to the hypothesis there is an
α-neighborhood 𝑈𝑅 𝐶 1 of 𝜉 such that 𝛹 𝑈𝑅 𝐶 1 ⊂ 𝑉𝑅 𝑁 2 . Therefore 𝑉𝑅 𝑁 2 . ∈

𝛼𝑂 𝐶𝑇𝑆𝑅 𝐶 1 such that 𝜉 ∈ 𝐴𝑅 𝐶 1 ⊂ 𝑈𝑅 𝐶 1 and hence 𝛹 𝐴 ⊂ 𝛹 𝑈𝑅 𝐶 1 ⊂
𝑉𝑅 𝑁 2 . . Hence 𝛹 is Neutrosophic upper α-irresolute at 𝜉.
References :-
1. K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems
20(1986),87-94.
2. I. Arokiarani, R. Dhavaseelan, S. Jafari, M. Parimala,On Some New Notions
and Functions In Neutrosophic Topological Spaces, Neutrosophic Sets and
Systems, Vol. 16, 2017,(16-19)
3. C.L. Chang, Fuzzy Topological Spaces, J. Math. Anal.Appl.24 (1968),
182-190.
4. .Dogan Coker, An introduction to Intuitionistic fuzzy topological spaces,
Fuzzy Sets and Systems,88(1997), 81-89
5. R .Dhavaseelan and S.Jafari, Generalized Neutrosophic closed sets, New
trends in Neutrosophic theory and applications Volume II- 261-273,(2018)
6. R .Dhavaseelan and S.Jafari, Neutrosophic semi continuous multifunction ,
New trends in Neutrosophic theory and applications Volume II-
345-354,(2017)
7. FlorentinSmarandache , Neutrosophic and
NeutrosophicLogic,FirstInternational Confer On Neutrosophic ,Neutrosophic
Logic, Set, Probability and Statistics University of New Mexico, Gallup, NM
87301, USA (2002), smarand@unm.edu
8. FloretinSmaradache, Neutrosophic Set: - A Generalization of Intuitionistic
Fuzzy set, Journal of Defense Resourses Management. 1(2010), 107-114.
9. P.Iswarya and Dr.K.Bageerathi, On Neutrosophic semi-open sets in
Neutrosophic Topological spaces, International Journal of Mathematics
Trends and Technology (IJMTT), Vol37, No.3, (2016), 24-33.

10. Mani Parimala,FlorentinSmarandache,SaeidJafari and
RamalingamUdhayakumar, Article in Information (Switzerland) October
2018.
11. T Rajesh kannan ,Dr. S.Chandrasekar,Neutosophic ωα-closed sets in
Neutrosophic topological space, Journal Of Computer And Mathematical
Sciences,vol.9(10),1400-1408 Octobe2018.
12. T Rajesh kannan ,S.Chandrasekar,Neutosophic α-continuous multifunction
in Neutrosophic topological space, The International Journal of Analytical
and Experimental Modal Analysis, Volume XI,IssueIX,September
2019,1360-9367
13. A.A.Salama and S.A.Alblowi, Neutrosophic set and Neutrosophic topological
space, ISOR J. Mathematics, Vol.(3),Issue(4),(2012).pp-31-35
14. V.K.Shanthi ,S.Chandrasekar, K.SafinaBegam, Neutrosophic Generalized
Semi Closed Sets In Neutrosophic Topological Spaces, International Journal of
Research in Advent Technology, Vol.6, No.7, July 2018, 1739-1743
15. S S Thakur and Kush Bohre , On Lower and Upper α −Irresolute Intuitionistic
Intuitionistic Fuzzy MultiFunction, Facta Universities, Ser.Math.Informvol 30,
30, No 4 (2015) Page-361-375
16. Wadei F.AL-omeri and SaeidJafari ,Neutrosophic pre continuous
multifunction and almost pre continuous multifunctions,Netrosophic sets and
system, vol 27 2019,53-69
17. L.A. Zadeh, Fuzzy Sets, Inform and Control 8(1965), 338- 353.
18. C. Maheswari , S. Chandrasekar: Neutrosophicgb-closed Sets and
Neutrosophicgb-Continuity, Neutrosophic Sets and Systems, vol. 29, 2019, pp.
pp. 89-100, DOI: 10.5281/zenodo.3514409
19. C.Maheswari, M.Sathyabama, S.Chandrasekar.,:,Neutrosophic generalized
b-closed Sets In Neutrosophic Topological Spaces,Journal of physics Conf. Series
1139 (2018) 012065.doi:10.1088/1742-6596/1139/1/012065

20. V. Banupriya S.Chandrasekar: Neutrosophic αgs Continuity and
Neutrosophic αgs Irresolute Maps, Neutrosophic Sets and Systems, vol. 28, 2019,
pp. 162-170. DOI: 10.5281/zenodo.3382531
21. Abdel-Basset, M., El-hoseny, M., Gamal, A., &Smarandache, F. (2019). A novel
model for evaluation Hospital medical care systems based on plithogenic sets.
Artificial intelligence in medicine, 100, 101710.
22. Abdel-Basset, M., Manogaran, G., Gamal, A., & Chang, V. (2019). A Novel
Intelligent Medical Decision Support Model Based on Soft Computing and
IoT. IEEE Internet of Things Journal.
23. Abdel-Basset, M., Mohamed, R., Zaied, A. E. N. H., &Smarandache, F. (2019).
A hybrid plithogenic decision-making approach with quality function
deployment for selecting supply chain sustainability metrics. Symmetry,
11(7), 903.
24. Abdel-Baset, M., Chang, V., &Gamal, A. (2019). Evaluation of the green
supply chain management practices: A novel neutrosophic approach.
Computers in Industry, 108, 210-220.
25. Abdel-Basset, M., Saleh, M., Gamal, A., &Smarandache, F. (2019). An
approach of TOPSIS technique for developing supplier selection with group
decision making under type-2 neutrosophic number. Applied Soft
Computing, 77, 438-452.

CHAPTER-11
THE SHORTEST PATH PROBLEM ON INDIA FAMOUS SEVEN TOURIST

PLACE WITH DIJKSTRA’S ALGORITHM IN INTERVAL-VALUED
INTUITIONISTIC TRAPEZOIDAL NEUTROSOPHIC FUZZY GRAPHS
K. Kalaiarasi and R.Divya
Assistant Professor, PG and Research Department of Mathematics,

Cauvery College for Women (Autonomous),
Affiliated to Bharathidasan University,
Trichy-18, Tamil Nadu, India.
Kalaishruthi12@gmail.com

rdivyamat@gmail.com
Abstract :
In this article, Interval-Valued Intuitionistic Trapezoidal Neutrosophic Fuzzy Graph of
Shortest Path Problem was Inaugurated, which is drew on trapezoidal numbers and
Interval-Valued Intuitionistic Neutrosophic Fuzzy Graph. Real-world application is given as
an illustrative model for Interval-Valued Intuitionistic Trapezoidal Neutrosophic Fuzzy Graph.
Here we introduced India famous seven tourist place. Here we assume only seven types of
tourist place as vertices of Interval-valued Intuitionistic Trapezoidal Neutrosophic Fuzzy
Graph. Use of fuzzification method, edge weights of this Graph was calculated. Score function
of Interval-Valued Intuitionistic Trapezoidal Neutrosophic Fuzzy Graph is inaugurated, with
the help of this score function in the proposed algorithm. Additionally Shortest way is
determined for this model. This present Dijkstra's Algorithm briefest way was checked .
Keywords :
Interval-valued Intuitionistic Fuzzy Number (IVIFN), Trapezoidal Fuzzy Number
(TrFN), Shortest Path (SP), Interval-Valued Intuitionistic Trapezoidal Neutrosophic Fuzzy
Graph(IVITrNFG).
1. INTRODUCTION:-
The creators of, Ahuja [1] examined systematic execution of Dijkstra's calculation.
Arsham [2] introduced another crucial arrangement calculation which permits affectability
examination without utilizing any counterfeit, slack or surplus factors. Anusuya [3] apply
positioning capacity for briefest way issue. Broumi [4] proposed for extend esteemed
neutrosophic number. Broumi [5] presented neutrosophic charts with most limited way
issues. Broumi [6] proposed calculation gives Shortest way issue on single esteemed
neutrosophic charts. Broumi [7] proposed the Shortest way under Bipolar Neutrosophic
setting. Broumi [8] gave the Shortest way issue under span esteemed neutrosophic setting.
Chiranjibe Jana [9] Presented Trapezoidal neutrosophic aggregation operators and its
application in multiple attribute decision making process. De [10] Computation of Shortest
Path in a fuzzy organization. De [11] study on ranking of trapezoidal intuitionistic fuzzy
numbers. Enayattabar [12] introduced Dijkstra calculation for briefest way issue under
Pythagorean fuzzy climate. Jana [13] presented stretch esteemed trapezoidal neutrosophic set.
Jayagowri [14] discover Optimized Path in a Network utilizing trapezoidal intuitionistic fuzzy
numbers. Kalaiarasi [15] determine fuzzy optimal total cost and fuzzy optimal order quantity
obtained by ranking function method and Kuhn-tucker method for the proposed inventory
model. Kalaiarasi [16] constructed inventory parameters that are fuzzy using trapezoidal
fuzzy numbers. Kumar [17] proposed to tackling briefest way issue with edge weight. Kumar
[18] introduced Algorithm for most limited way issue in an organization with span esteemed
intuitionistic trapezoidal fuzzy number. Kumar [19] presented the SPP from an underlying hub
to an objective hub on neutrosophic chart . Majumdar [20] introduced an intuitionistic fuzzy
most brief way organization. Nagoor Gani [21] looking intuitionistic fuzzy most brief
organization. Ojekudo Nathaniel akpofure [22] tended to the most brief way utilizing Dijkstra's
calculation. Said broumi [23] processing the most brief way Neutrosophic Information.
Smarandache [24] summed up the fuzzy rationale and presented two neutrosophic ideas.
Victor christianto [25] gave a neutrosophic approach to futurology. Wang [26] contributed
neutrosophic sets with their properties. Xu [27] introduced a strategies for amassing span

esteemed intuitionistic fuzzy data, Yang [28] introduced rectangular hindrance subject to
various improvement capacities regarding the quantity of curves. Ye [29] proposed a
Trapezoidal fuzzy Neural Computing and Applications. Ye [30] developed of the Multi models
dynamic strategy utilizing shape liking measure, Ye [31] presented a Prioritized aggregation
operators of trapezoidal intuitionistic fuzzy sets and their application Here, in this chapter
disclosed the briefest way to tourist place utilized the proposed calculationInterval-valued
Intuitionistic trapezoidal fuzzy number gives more accuracy than fuzzy numbers. So that
Interval-valued Intuitionistic trapezoidal fuzzy numbers are used for finding shortest path of a
graph. In this chapter Dijkstra‟s algorithm is the only algorithm suitable for verifying our
real world problem , because of the edge weight of fuzzy graph, rather than other algorithms.
Section II, introduced some basic concepts related to definitions. Section III, introduced
IVITrNFG proposed algorithm and find SPP using that proposed algorithm. Section IV, we
apply real life application. The application has India famous seven tourist place and find its
SPP using IVITrNFG proposed algorithm . Section V verified shortest path on India famous
seven tourist place with Dijkstra‟s algorithm. Conclusion are given in section VI.
2. METHODOLOGY
In this section we explain some important definition.
Definition 2.1 :

U U U U U U U U
Let n1  ( [(t aL , t bL , t cL , t dL ), (t eL , t Lf , t gL , t hL )] , [(t a , t b , t c , t d ), (t e , t f , t g , t h )]),
([(iaL , ibL , icL , idL ), (ieL , i Lf , i gL , ihL )], [(iaU , ibU , icU , idU ), (ieU , iUf , iUg , ihU )]),
([( f aL , f bL , f cL , f dL ), ( f aL , f bL , f cL , f dL ], [( f eU , f fU , f gU , f hU ), ( f eU , f fU , f gU , f hU ] ) and

n2  ( [(TaL , TbL , TcL , TdL ), (TeL , T fL , TgL , ThL )] ,
[(TaU , TbU , TcU , TdU ), (TeU , T fU , TgU , ThU )]), ( [(I aL , I bL , I cL , I dL ), (I eL , I Lf , I gL , I hL )],
[(I aU , I bU , I cU , I dU ), (I eU , I Uf , I gU , I hU )]),
( [(FaL , FbL , FcL , FdL ), ( FeL , F fL , FgL , FhL )], [(FaU , FbU , FcU , FdU ), ( FeU , F fU , FgU , FhU ] both
interval-valued Intuitionistic trapezoidal neutrosophic numbers. Therefore following

procedure are hold :

 
(1) n1  n2  [(taL  TaL  taLTaL , tbL  TbL  tbLTbL , tcL  TcL  tcLTcL , tdL  TdL  tdLTdL ),
[(t eL  TeL  t eLTeL , t Lf  T fL  t LfT fL , t gL  TgL  t gLTgL , t hL  ThL  t hLThL )],

[(t aU  TaU  t aU TaU , t bU  TbU  t bU TbU , t cU  TcU  t cU TcU , t dU  TdU  t dU TdU ),
(t eU  TeU  t eU TeU , t Uf  T fU  t Uf T fU , t Ug  TgU  t Ug TgU , t hU  ThU  t hU ThU )],

U U
[(iaL I aL , ibL I bL , icL I cL , idL I dL ) , (ie I e , i f I f , i g I g , ih I h )] , [(i a
L L L L L L L L
a I , ibU I bU , icU I cU , idU I dU ), ,
(ieU I eU , iUf I Uf , iUg I gU , ihU I hU )] , [( f aL FaL , fbL FbL , fcL FcL , f dL FdL ) ,
( f eL FeL , f fL FfL , f gL FgL , f hL FhL ) ] , [( f aU FaU , f bU FbU , f cU FcU , f dU FdU )] ,
[( f eU FeU , f fU FfU , f gU FgU , f hU FhU )]
We propose definition of score and accuracy functions for an interval-valued
Intuitionistic trapezoidal neutrosophic number.
Definition 2.2 :

U U U U U U U U
Let n1  ( [(t aL , t bL , t cL , t dL ), (t eL , t Lf , t gL , t hL )] , [(t a , t b , t c , t d ), (t e , t f , t g , t h )]),
([(iaL , ibL , icL , idL ), (ieL , i Lf , i gL , ihL )], [(iaU , ibU , icU , idU ), (ieU , iUf , iUg , ihU )]),
([( f aL , f bL , f cL , f dL ), ( f aL , f bL , f cL , f dL ], [( f eU , f fU , f gU , f hU ), ( f eU , f fU , f gU , f hU ] ) and be an
interval-valued , intuitionistic trapezoidal neutrosophic number, then defined as their score

functions
 1
S (n) 
3
 [(t U  t bU  t cU  t dU  t eL  t Lf  t gL  t hL )  (t aL  t bL  t cL  t dL  t eU  t Uf  t Ug  t hU )] 
2  a 
 8 
 [(i U  i U  i U  i U  i L  i L  i L  i L )  (i L  i L  i L  i L  i U  i U  i U  i U )] 
 a b c d e f g h a b c d e f g h 
 8 
 
  [( f a  f b  f c  f d  f e  f f  f g  f h )  ( f a  f b  f c  f d  f e  f f  f g  f h )] 
U U U U L L L L L L L L U U U U
 8 
 

S (n)  [1,1] ----------------- (1)
_
Where the higher value of S ( n ) , larger the interval-valued intuitionistic trapezoidal number
_
n.

III. INTERVAL-VALUED INTUITIONISTIC TRAPEZOIDAL NEUTROSOPHIC

FUZZY GRAPH :
In this research, we using proposed algorithm for finding shortest path.

Step :1
[ (0, 0, 0, 0 ), (0, 0, 0, 0) ],[ (0, 0, 0, 0 ), (0, 0, 0, 0) ], [ ( 1,1,1,1), (1,1,1,1 ) ],[ (1,1,1,1), (1,1,1,1) ] ,
Let d1 
[ ( 1,1,1,1), (1,1,1,1 ) ],[ (1,1,1,1), (1,1,1,1) ]
and the source node as

[ (0, 0, 0, 0 ), (0, 0, 0, 0) ],[ (0, 0, 0, 0 ), (0, 0, 0, 0) ], [ ( 1,1,1,1), (1,1,1,1 ) ],[ (1,1,1,1), (1,1,1,1) ] ,
d1  .
[ ( 1,1,1,1), (1,1,1,1 ) ],[ (1,1,1,1), (1,1,1,1) ]
Step: 2
Find d j  minimum d i  d ij  ; j  2, 3, ....... n.
Step : 3
If the minimum value of i . ie., i  r then the lable node j as [ d j , r ] . If minimum
arise related to more than one values of i . Their position we choose minimum value of i .
Step: 4
Let the destination node be [ d n , l ] . Here source node is d n . We conclude a score
function and we finds minimum value of interval-valued intuitionistic trapezoidal neutrosophic
number.
Step: 5
We calculate shortest path problem between source and destination node. Review the
label of node 1. Let it be as [ d n , A ] . Now review the label of node A and so on. Replicate the
same procedure until node 1 is procured.
Step: 6
The shortest path can be procured by combined all the nodes by the step 5.
IV. DATA ANALYSIS :

To find shortest path on India famous seven tourist place using interval-valued

intuitionistic trapezoidal neutrosophic fuzzy graph.
In this chapter, TBOG denotes The Beaches of Goa, GWOI denotes Gate way of India ,
MM denotes Mecca Masjid, HCOV denotes Holy City of Varanasi, TM denotes Taj mahal,
TGC denotes The Golden City (Jaisalmer), and SHS denotes Sri Harmandir Sahib.
1. The Beaches of Goa 2. Gate way of India
3. Mecca Masjid 4. Holy

City of Varanasi
5. Taj mahal 6.The Golden City (Jaisalmer)

7. Harmandir Sahib
Here we consider source node is The Beaches of Goa and destination node is Sri Harmandir
Sahib. To find shortest path on The Beaches of Goa to Sri Harmandir Sahib.
Fig 3 : A graph of India famous seven tourist place

qHere distance between one tourist place to another tourist place is calculated in kilometers.
The numerical value of the distance is converted to IVITrNFG with the help of through
trapezoidal signed distance.
The given distance ( kilometer) converted to neutrosophic number. We converted

neutrosophic number as (a1 , a 2 , a3 , a 4 ) are membership function & (a1* , a 2*' , a 3*' , a 4* ) are
non-membership function. These functions converted to fuzzy trapezoidal numbers using
a1  a 2  a3  a 4
trapezoidal signed distance . Finally converted interval-valued
4
intuitionistic trapezoidal neutrosophic fuzzy number.

Here, Apply the Interval-valued Intuitionistic Trapezoidal Neutrosophic Fuzzy Number

in our algorithm to find shortest path to India famous seven tourist places.
In this application, many paths have India famous seven tourist places. To calculate
Shortest Path using score function( Definition 2.1 and 2.2).
An algorithm is used to apply a definite procedure and the process has been
expensive and time consuming
Here node 1-2 = 564 km
This km changed to neutrosophic number use neutrosophic score function, and each
neutrosophic number converted to fuzzification method, so we get fuzzy number. Finally we
convert membership and non-membership from fuzzy number because of Interval-valued
Intuitionistic fuzzy number, and use trapezoidal signed distance to membership and
non-membership functions.
At last we get Interval-valued Intuitionistic Trapezoidal Neutrosophic Fuzzy Number.

3500 1515 295
0.35 0.15 0.0295
(0.35, 0.65) (0.15, 0.85) (0.0295,
0.9705)
 ([ ( 0.20, 0.29, 0.35, 0.56), (0.49, 0.59, 0.65, 0.87) ]), ( [ (0.8, 0.71, 0.65, 0.44),
(0.51, 0.41, 0.35, 0.13)]),( [ (0.11, 0.13, 0.16, 0.2), (0.79, 0.83, 0.86, 0.92 ) ]),
([ ( 0.89, 0.87, 0.84, 0.8), (0.21, 0.17, 0.14, 0.08) ]), ( [ (0.003, 0.005, 0.03, 0.08),
(0.9615, 0.9699, 0.9705, 0.9801)]),( [ (0.997, 0.995, 0.97, 0.92),
(0.0385, 0.0301, 0.0295, 0.0199 ) ] ) 
1-3= 658 km
9400 5900 1528
0.94 0.59 0.15
(0.94, 0.06) (0.59, 0.41) (0.15, 0.85)

 ( [ (0.91, 0.92, 0.94, 0.99 ), (0.02, 0.04, 0.06, 0.12) ]), ( [ (0.09, 0.08, 0.06, 0.01 ),
(0.98, 0.96, 0.94, 0.88 ) ]), ( [ (0.52, 0.55, 0.6, 0.69 ), (0.35, 0.4, 0.42, 0.47) ] )
([ (0.48, 0.45, 0.4, 0.31 ), (0.65, 0.6, 0.58, 0.53) ]), ( [ (0.09, 0.12, 0.15, 0.24 ),
(0.80, 0.83, 0.86, 0.91 ) ]), ( [ (0.91, 0.88, 0.85, 0.76 ), (0.2, 0.17, 0.14, 0.09) ] ) 
2-4= 1530 km
8700 2300 1812
0.87 0.23 0.18
(0.87, 0.13) (0.23, 0.77) (0.18, 0.82)
 ([ ( 0.82, 0.86, 0.89,0.91 ), (0.09, 0.11, 0.13, 0.19) ]), ( [ ( 0.18, 0.14, 0.11, 0.09 ),
(0.91, 0.89, 0.87, 0.81 ) ]), ( [ ( 0.17, 0.2, 0.23, 0.32), ( 0.72, 0.76, 0.79, 0.81 ) ])
([ ( 0.83, 0.8, 0.77,0.68 ), (0.28, 0.24, 0.21, 0.19) ]), ( [ ( 0.14, 0.16, 0.18, 0.24 ),
(0.79, 0.81, 0.83, 0.85 ) ]), ( [ ( 0.86, 0.84, 0.82, 0.76), ( 0.21, 0.19, 0.17, 0.15 ) ]) 
2-5= 1422 km
9500 4466 770
0.95 0.45 0.077
(0.95, 0.05) (0.45, 0.55) (0.077, 0.923)
 ([ (0.92, 0.94, 0.96, 0.98 ), (0.02, 0.04, 0.06, 0.08 ) ]), ([ ( 0.08,0.06, 0.04, 0.02 ),
(0.98, 0.96, 0.94, 0.92 ) ]), ([ (0.32, 0.39, 0.45, 0.64), (0.49, 0.52, 0.58, 0.61) ])
([ (0.68, 0.61, 0.55, 0.36 ), (0.51, 0.48, 0.42, 0.39 ) ]), ([ ( 0.11, 0.059, 0.08,0.16 ),
(0.899, 0.919, 0.923, 0.951) ]), ([ (0.989, 0.941, 0.92, 0.84), (0.101, 0.081, 0.077, 0.049) ] ) 
2-6= 1077 km
8989 3021 2739
0.89 0.30 0.27
(0.89, 0.11) (0.30, 0.7) (0.27,
0.73)
 ([ ( 0.84, 0.86, 0.89, 0.97 ), (0.07, 0.09, 0.11,0.17) ]), ([ (0.16, 0.14, 0.11, 0.03),
(0.93, 0.91, 0.89, 0.83) ]), ([ (0.1, 0.2, 0.3, 0.6), (0.4, 0.7, 0.8, 0.9 ) ])
([ ( 0.9, 0.8, 0.7, 0.4 ), (0.6, 0.3, 0.2,0.1) ]), ([ (0.21, 0.25, 0.27, 0.35),
(0.65, 0.71, 0.74, 0.82) ]), ([ (0.79, 0.75, 0.73, 0.65), (0.35, 0.29, 0.26, 0.18 ) ]) 
3-4= 1266 km
9639 3419 2424

0.96 0.34 0.24

(0.96, 0.04) (0.34, 0.66) (0.24, 0.76)
 ( [ (0.94, 0.95, 0.96, 0.99 ), (0.02, 0.03, 0.04, 0.07) ]), ( [ (0.06, 0.05, 0.04, 0.01 ),
( 0.98, 0.97, 0.96, 0.93) ]), ( [ ( 0.23, 0.27, 0.35, 0.51), (0.52, 0.57, 0.66, 0.89) ] )
( [ (0.77, 0.73, 0.65, 0.49 ), (0.48, 0.43, 0.34, 0.11) ]), ( [ (0.17, 0.21, 0.26, 0.32 ),
( 0.59, 0.68, 0.79, 0.98) ]), ( [ ( 0.83, 0.79, 0.74, 0.68), (0.41, 0.32, 0.21, 0.02) ] ) 
4-5= 843 km
8649 3593 2529
0.86 0.36 0.25
(0.86, 0.14) (0.36, 0.64) (0.25, 0.75)
 ([ (0.79, 0.85, 0.89, 0.91), (0.07, 0.09, 0.15, 0.25 ) ]), ( [ (0.21, 0.15, 0.11, 0.09 ),
(0.93 0.91, 0.85, 0.75 ) ]), ( [ (0.25, 0.31, 0.37, 0.51), (0.47, 0.58, 0.64, 0.87) ] )
([ (0.75, 0.69, 0.63, 0.49), (0.53, 0.42, 0.36, 0.13 ) ]), ( [ (0.09, 0.15, 0.26, 0.5 ),
(0.59, 0.67, 0.75, 0.99 ) ]), ( [ (0.91, 0.85, 0.74, 0.5), (0.41, 0.33, 0.25, 0.01) ] ) 
5-7= 469 km
8829 6039 1385
0.88 0.60 0.14
(0.88, 0.12) (0.60, 0.4) (0.14,
0.86)
 ([ ( 0.79, 0.86, 0.89, 0.98 ), (0.06, 0.09, 0.12, 0.21)]),( [ (0.21, 0.14, 0.11, 0.02 ),
(0.94, 0.91, 0.88, 0.79 ) ]), ( [ (0.4, 0.5, 0.6, 0.9), (0.2, 0.3, 0.4, 0.7) ]),
([ ( 0.6, 0.5, 0.4, 0.1), (0.8, 0.7, 0.6, 0.3 )]),( [ (0.065, 0.085, 0.127, 0.277 ),
(0.79, 0.81, 0.86, 0.98 ) ]), ( [ (0.935, 0.915, 0.873, 0.723), (0.21, 0.19, 0.14, 0.02) ]) 
6-7= 837 km
8915 4135 2271
0.89 0.41 0.23
(0.89, 0.11) (0.41, 0.59) (0.23, 0.77)
 ([ ( 0.85, 0.87, 0.89, 0.95 ), (0.07, 0.09, 0.11, 0.17) ]), ( [ (0.15, 0.13, 0.11, 0.05 ),
(0.93, 0.91, 0.89, 0.83) ]), ( [ (0.29, 0.37, 0.41, 0.57), (0.37, 0.48, 0.59, 0.92 ) ])
([ ( 0.71, 0.63, 0.59, 0.43 ), (0.63, 0.52, 0.41, 0.08) ]), ( [ (0.09, 0.17, 0.23, 0.43 ),
(0.59, 0.68, 0.87, 0.94) ]), ( [ (0.91, 0.83, 0.77, 0.57), (0.41, 0.32, 0.13, 0.06 ) ]) 

Here, Apply the IVITrNFN in our algorithm to find shortest path to India famous seven tourist
place
Edges Interval-valued , intuitionistic trapezoidal fuzzy neutrosophic numbers

1 2  ([ ( 0.20, 0.29, 0.35, 0.56), (0.49, 0.59, 0.65, 0.87) ]), ( [ (0.8, 0.71, 0.65, 0.44),
(0.51, 0.41, 0.35, 0.13)]),( [ (0.11, 0.13, 0.16, 0.2), (0.79, 0.83, 0.86, 0.92 ) ]),
([ ( 0.89, 0.87, 0.84, 0.8), (0.21, 0.17, 0.14, 0.08) ]), ( [ (0.003, 0.005, 0.03, 0.08),
(0.9615, 0.9699, 0.9705, 0.9801)]),( [ (0.997, 0.995, 0.97, 0.92),
(0.0385, 0.0301, 0.0295, 0.0199 ) ] ) 
1 3  ( [ (0.91, 0.92, 0.94, 0.99 ), (0.02, 0.04, 0.06, 0.12) ]), ( [ (0.09, 0.08, 0.06, 0.01 ),
(0.98, 0.96, 0.94, 0.88 ) ]), ( [ (0.52, 0.55, 0.6, 0.69 ), (0.35, 0.4, 0.42, 0.47) ] )
([ (0.48, 0.45, 0.4, 0.31 ), (0.65, 0.6, 0.58, 0.53) ]), ( [ (0.09, 0.12, 0.15, 0.24 ),
(0.80, 0.83, 0.86, 0.91 ) ]), ( [ (0.91, 0.88, 0.85, 0.76 ), (0.2, 0.17, 0.14, 0.09) ] ) 
24  ([ ( 0.82, 0.86, 0.89,0.91 ), (0.09, 0.11, 0.13, 0.19) ]), ( [ ( 0.18, 0.14, 0.11, 0.09 ),
(0.91, 0.89, 0.87, 0.81 ) ]), ( [ ( 0.17, 0.2, 0.23, 0.32), ( 0.72, 0.76, 0.79, 0.81 ) ])
([ ( 0.83, 0.8, 0.77,0.68 ), (0.28, 0.24, 0.21, 0.19) ]), ( [ ( 0.14, 0.16, 0.18, 0.24 ),
(0.79, 0.81, 0.83, 0.85 ) ]), ( [ ( 0.86, 0.84, 0.82, 0.76), ( 0.21, 0.19, 0.17, 0.15 ) ]) 
25  ([ (0.92, 0.94, 0.96, 0.98 ), (0.02, 0.04, 0.06, 0.08 ) ]), ([ ( 0.08,0.06, 0.04, 0.02 ),
(0.98, 0.96, 0.94, 0.92 ) ]), ([ (0.32, 0.39, 0.45, 0.64), (0.49, 0.52, 0.58, 0.61) ])
([ (0.68, 0.61, 0.55, 0.36 ), (0.51, 0.48, 0.42, 0.39 ) ]), ([ ( 0.11, 0.059, 0.08,0.16 ),
(0.899, 0.919, 0.923, 0.951) ]), ([ (0.989, 0.941, 0.92, 0.84), (0.101, 0.081, 0.077, 0.049) ] ) 
26  ([ ( 0.84, 0.86, 0.89, 0.97 ), (0.07, 0.09, 0.11,0.17) ]), ([ (0.16, 0.14, 0.11, 0.03),
(0.93, 0.91, 0.89, 0.83) ]), ([ (0.1, 0.2, 0.3, 0.6), (0.4, 0.7, 0.8, 0.9 ) ])
([ ( 0.9, 0.8, 0.7, 0.4 ), (0.6, 0.3, 0.2,0.1) ]), ([ (0.21, 0.25, 0.27, 0.35),
(0.65, 0.71, 0.74, 0.82) ]), ([ (0.79, 0.75, 0.73, 0.65), (0.35, 0.29, 0.26, 0.18 ) ]) 
34  ( [ (0.94, 0.95, 0.96, 0.99 ), (0.02, 0.03, 0.04, 0.07) ]), ( [ (0.06, 0.05, 0.04, 0.01 ),
( 0.98, 0.97, 0.96, 0.93) ]), ( [ ( 0.23, 0.27, 0.35, 0.51), (0.52, 0.57, 0.66, 0.89) ] )
( [ (0.77, 0.73, 0.65, 0.49 ), (0.48, 0.43, 0.34, 0.11) ]), ( [ (0.17, 0.21, 0.26, 0.32 ),
( 0.59, 0.68, 0.79, 0.98) ]), ( [ ( 0.83, 0.79, 0.74, 0.68), (0.41, 0.32, 0.21, 0.02) ] ) 
45  ([ (0.79, 0.85, 0.89, 0.91), (0.07, 0.09, 0.15, 0.25 ) ]), ( [ (0.21, 0.15, 0.11, 0.09 ),
(0.93 0.91, 0.85, 0.75 ) ]), ( [ (0.25, 0.31, 0.37, 0.51), (0.47, 0.58, 0.64, 0.87) ] )
([ (0.75, 0.69, 0.63, 0.49), (0.53, 0.42, 0.36, 0.13 ) ]), ( [ (0.09, 0.15, 0.26, 0.5 ),
(0.59, 0.67, 0.75, 0.99 ) ]), ( [ (0.91, 0.85, 0.74, 0.5), (0.41, 0.33, 0.25, 0.01) ] ) 

57  ([ ( 0.79, 0.86, 0.89, 0.98 ), (0.06, 0.09, 0.12, 0.21)]),( [ (0.21, 0.14, 0.11, 0.02 ),
(0.94, 0.91, 0.88, 0.79 ) ]), ( [ (0.4, 0.5, 0.6, 0.9), (0.2, 0.3, 0.4, 0.7) ]),
([ ( 0.6, 0.5, 0.4, 0.1), (0.8, 0.7, 0.6, 0.3 )]),( [ (0.065, 0.085, 0.127, 0.277 ),
(0.79, 0.81, 0.86, 0.98 ) ]), ( [ (0.935, 0.915, 0.873, 0.723), (0.21, 0.19, 0.14, 0.02) ]) 
67  ([ ( 0.85, 0.87, 0.89, 0.95 ), (0.07, 0.09, 0.11, 0.17) ]), ( [ (0.15, 0.13, 0.11, 0.05 ),
(0.93, 0.91, 0.89, 0.83) ]), ( [ (0.29, 0.37, 0.41, 0.57), (0.37, 0.48, 0.59, 0.92 ) ])
([ ( 0.71, 0.63, 0.59, 0.43 ), (0.63, 0.52, 0.41, 0.08) ]), ( [ (0.09, 0.17, 0.23, 0.43 ),
(0.59, 0.68, 0.87, 0.94) ]), ( [ (0.91, 0.83, 0.77, 0.57), (0.41, 0.32, 0.13, 0.06 ) ]) 
Table 1: Interval-valued intuitionistic trapezoidal fuzzy neutrosophic edge weight.
In this iteration SPP was calculated through the proposed algorithm, the concept of the
India famous seven tourist place shortest path calculated from The Beaches of Goa to Sri
Harmandir Sahib.
Let n = 7 is the destination node, since there are totally 7 nodes.
Iteration: 1
Assume the source node is The beaches of Goa. Here we assume
[ (0, 0, 0, 0 ), (0, 0, 0, 0) ],[ (0, 0, 0, 0 ), (0, 0, 0, 0) ], [ (1,1,1,1), (1,1,1,1) ],[ (1,1,1,1), (1,1,1,1) ] ,
d1 
[ (1,1,1,1), (1,1,1,1) ],[ (1,1,1,1), (1,1,1,1) ]
and label of source node is
 [ (0, 0, 0, 0 ), (0, 0, 0, 0) ],[ (0, 0, 0, 0 ), (0, 0, 0, 0) ], [ (1,1,1,1), (1,1,1,1 ) ],[ (1,1,1,1), (1,1,1,1) ] , 
 ,  
 [ ( 1,1,1,1), (1,1,1,1 ) ],[ (1,1,1,1), (1,1,1,1) ] 
the value of d j , j  2, 3, 4, 5, 6 is succeeding:
Here we assume d 1 is the beaches of Goa.
Iteration 2 :
The node Gate way of India has only node The beaches of Goa as the predecessor.
IVITrFNSP is calculated from Gate way of India to The beaches of Goa.

Since node 2 has only node 1 as the predecessor. So fix i  1 and j  2 we apply step 2 at
proposed algorithm.

d 2 = minimum d1  d12 
Therefore minimum value i  1 , corresponding to label node 2 as

 ([ ( 0.20, 0.29, 0.35, 0.56), (0.49, 0.59, 0.65, 0.87) ]), ( [ (0.8, 0.71, 0.65, 0.44), 
(0.51, 0.41, 0.35, 0.13)]),( [ (0.11, 0.13, 0.16, 0.2), (0.79, 0.83, 0.86, 0.92 ) ]), 
 
= ([ ( 0.89, 0.87, 0.84, 0.8), (0.21, 0.17, 0.14, 0.08) ]), ( [ (0.003, 0.005, 0.03, 0.08), 
(0.9615, 0.9699, 0.9705, 0.9801)]),( [ (0.997, 0.995, 0.97, 0.92), 
 

(0.0385, 0.0301, 0.0295, 0.0199 ) ] )  , 1 

  ([ ( 0.20, 0.29, 0.35, 0.56), (0.49, 0.59, 0.65, 0.87) ]), ( [ (0.8, 0.71, 0.65, 0.44), 
(0.51, 0.41, 0.35, 0.13)]), ( [ (0.11, 0.13, 0.16, 0.2), (0.79, 0.83, 0.86, 0.92 ) ]), 
 
d 2  ([ ( 0.89, 0.87, 0.84, 0.8), (0.21, 0.17, 0.14, 0.08) ]), ( [ (0.003, 0.005, 0.03, 0.08), 
(0.9615, 0.9699, 0.9705, 0.9801)]), ( [ (0.997, 0.995, 0.97, 0.92), 
 
(0.0 3 8 5, 0.0 3 0 ,10.0 2 9 5, 0.0 1 9 9) ] )  
The labelled node is Gate way of India and minimum provided corresponding node is The
beaches of Goa.
Minimum Labelled
Path Node
Node Node
 ([ ( 0.20, 0.29, 0.35, 0.56), (0.49, 0.59, 0.65, 0.87) ]), ( [ (0.8, 0.71, 0.65, 0.44),
(0.51, 0.41, 0.35, 0.13)]),( [ (0.11, 0.13, 0.16, 0.2), (0.79, 0.83, 0.86, 0.92 ) ]),
TBOG GWOI ([ ( 0.89, 0.87, 0.84, 0.8), (0.21, 0.17, 0.14, 0.08) ]), ( [ (0.003, 0.005, 0.03, 0.08),
(0.9615, 0.9699, 0.9705, 0.9801)]),( [ (0.997, 0.995, 0.97, 0.92),
(0.0385, 0.0301, 0.0295, 0.0199 ) ] ) 
Iteration 3:
The node Mecca Masjid has only node The beaches of Goa as the predecessor.
IVITrFNSP is calculated from Mecca Masjid to The beaches of Goa. Since node 3 has
only node 1 as the predecessor. So fix i  1 and j  3 we apply step 2 at proposed
algorithm.

 ( [ (0.91, 0.92, 0.94, 0.99 ), (0.02, 0.04, 0.06, 0.12) ]), ( [ (0.09, 0.08, 0.06, 0.01),
 
= (0.98, 0.96, 0.94, 0.88 ) ]), ( [ (0.52, 0.55, 0.6, 0.69 ), (0.35, 0.4, 0.42, 0.47) ] ) 
 
([ (0.48, 0.45, 0.4, 0.31), (0.65, 0.6, 0.58, 0.53) ]), ( [ (0.09, 0.12, 0.15, 0.24 ), 

(0.80, 0.83, 0.86, 0.91) ]), ( [ (0.91, 0.88, 0.85, 0.76 ), (0.2, 0.17, 0.14, 0.09) ] )  , 1 

  ( [ (0.91, 0.92, 0.94, 0.99 ), (0.02, 0.04, 0.06, 0.12) ]), ( [ (0.09, 0.08, 0.06, 0.01),
(0.98, 0.96, 0.94, 0.88 ) ]), ( [ (0.52, 0.55, 0.6, 0.69 ), (0.35, 0.4, 0.42, 0.47) ] ) 
 
d3   
([ ( 0.48 , 0.45 , 0.4 , 0 .31 ), ( 0 .65 , 0.6 , 0 .58 , 0 .53 ) ]), ( [ ( 0. 09 , 0 .12 , 0 .15 , 0 .24 ), 

( 0.80 , 0. 83 , 0. 86 , 0 .91 ) ]), ( [ ( 0. 91 , 0 .88 , 0 .85 , 0 .76 ), ( 0 .2, 0 .17 , 0 .14 , 0 .09 ) ] )  

Here the labelled node is Mecca Masjid and the minimum provided corresponding node
is The beaches of Goa
Minimum Node Labelled Node Path Node

 ( [ (0.91, 0.92, 0.94, 0.99 ), (0.02, 0.04, 0.06, 0.12) ]),
( [ (0.09, 0.08, 0.06, 0.01), (0.98, 0.96, 0.94, 0.88 ) ]),
( [ (0.52, 0.55, 0.6, 0.69 ), (0.35, 0.4, 0.42, 0.47) ] )
TBOG MM ([ (0.48, 0.45, 0.4, 0.31), (0.65, 0.6, 0.58, 0.53) ]),
( [ (0.09, 0.12, 0.15, 0.24 ), (0.80, 0.83, 0.86, 0.91) ]),
( [ (0.91, 0.88, 0.85, 0.76 ), (0.2, 0.17, 0.14, 0.09) ] ) 
Iteration 4 :
The node Holy city of varanasi has two predecessors node, they are node Mecca
Masjid and node Gate way of India.
IVITrFNSP is calculated to Holy city of varanasi from Mecca Masjid and Gate way of
India.
.
Since node 4 has two predecessors node 2 and node 3. So fix i  2, 3 and j  4 we
apply step 2 at proposed algorithm.
d 4 = minimum d 2  d 24 , d 3  d 34 
Therefore,
 
S (n1 )  0.123134 , S (n2 )  0.1425
Therefore minimum value i  2 , corresponding to lable node 4 as

  ([ ( 0.856, 0.901, 0.928, 0.96), (0.535, 0.635, 0.695, 0.895) ]), ( [ ( 0.836, 0.751, 0.688, 0.490), 
(0.956, 0.935, 0915, 0.835) ]), ( [ (0.0187, 0.026, 0.0368, 0.064), (0.5688, 0.6308, 0.6794, 0.7452) ]),

 

 ([ ( 0.7387, 0.696, 0.6468, 0.544), (0.0588, 0.0408, 0.0294, 0.0152) ]), 
( [ ( 0.00042, 0.0008, 0.0054, 0.0192), (0.7596, 0.7856, 0.8055, 0.833) ]), 
 
( [ (0.8574, 0.8358, 0.7954, 0.6992), (0.008, 0.0057, 0.005, 0.0029) ]) , 2
 

 ([ ( 0.856, 0.901, 0.928, 0.96), (0.535, 0.635, 0.695, 0.895) ]), 

( [ ( 0.836, 0.751, 0.688, 0.490), (0.956, 0.935, 0915, 0.835) ]), 
 
( [ (0.0187, 0.026, 0.0368, 0.064), (0.5688, 0.6308, 0.6794, 0.7452) ]), 
d4   
 ([ ( 0.7387, 0.696, 0.6468, 0.544), (0.0588, 0.0408, 0.0294, 0.0152) ]), 
( [ ( 0.00042, 0.0008, 0.0054, 0.0192), (0.7596, 0.7856, 0.8055, 0.833) ]),
 
( [ (0.8574, 0.8358, 0.7954, 0.6992), (0.008, 0.0057, 0.005, 0.0029) ])  
Here, the labelled node is Holy city of varanasi and the minimum provided corresponding
node is Gate way of India.
Minimu Labelle
Path Node
m Node d Node
 ([ ( 0.856, 0.901, 0.928, 0.96), (0.535, 0.635, 0.695, 0.895) ]),
( [ ( 0.836, 0.751, 0.688, 0.490), (0.956, 0.935, 0915, 0.835) ]),
( [ (0.0187, 0.026, 0.0368, 0.064), (0.5688, 0.6308, 0.6794, 0.7452) ]),
GWOI HCOV ([ ( 0.7387, 0.696, 0.6468, 0.544), (0.0588, 0.0408, 0.0294, 0.0152) ]),
( [ ( 0.00042, 0.0008, 0.0054, 0.0192), (0.7596, 0.7856, 0.8055, 0.833) ]),
( [ (0.8574, 0.8358, 0.7954, 0.6992), (0.008, 0.0057, 0.005, 0.0029) ]) 
Iteration 5:
The node Taj mahal has two predecessors node, they are node Gate way of India
and node Holy city of varanasi.
IVITrFNSP is calculated to Taj mahal from Gate way of India and Holy city of
varanasi.
Since node 5 has two predecessors node 2 and node 4. So fix i  2, 4 and j  5 we

d 5 = minimum d 2  d 25 , d 4  d 45 
Therefore,
 
S (n1 )  0.135 , S (n2 )  0.24229
  ([ ( 0.94, 0.96, 0.97, 0.99), (0.5, 0.6, 0.67, 0.88) ]), ( [ ( 0.816, 0.73, 0.66, 0.45), 
(0.99, 0.98, 0.96, 0.93) ]), ( [ (0.035, 0.051, 0.072, 0.128), (0.387, 0.432, 0.4988, 0.5612) ]),

 

 ([ ( 0 .6052, 0 .531, 0.462, 0. 288), ( 0.107 , 0. 0816, 0 . 0588, 0. 0312 ) ]), 
( [ ( 0.000033, 0.00029, 0.0024, 0.0128), (0.8644, 0.8913, 0.8958, 0.932) ]) 
 

( [ (0.986, 0.936, 0.892, 0.773), (0.00389, 0.0024, 0.0023, 0.00097 ) ]) , 2 

 ([ ( 0.94, 0.96, 0.97, 0.99), (0.5, 0.6, 0.67, 0.88) ]), ( [ ( 0.816, 0.73, 0.66, 0.45), 
(0.99, 0.98, 0.96, 0.93) ]), ( [ (0.035, 0.051, 0.072, 0.128), (0.387, 0.432, 0.4988, 0.5612) ]),
 
d 5   ([ ( 0.6052, 0.531, 0.462, 0.288), (0.107, 0.0816, 0.0588, 0.0312) ]), 
( [ ( 0.000033, 0.00029, 0.0024, 0.0128), (0.8644, 0.8913, 0.8958, 0.932) ]) 
 
( [ (0.986, 0.936, 0.892, 0.773), (0.00389, 0.0024, 0.0023, 0.00097) ])  
Here, the labelled node is Taj mahal and the minimum provided corresponding node is Gate
way of India.
Minimum Node Labeled Node Path Node
 ([ ( 0.94, 0.96, 0.97, 0.99), (0.5, 0.6, 0.67, 0.88) ]),
( [ ( 0.816, 0.73, 0.66, 0.45), (0.99, 0.98, 0.96, 0.93) ]),
( [ (0.035, 0.051, 0.072, 0.128), (0.387, 0.432, 0.4988, 0.5612) ]),
GWOI TM ([ ( 0.6052, 0.531, 0.462, 0.288), (0.107, 0.0816, 0.0588, 0.0312) ]),
( [ ( 0.000033, 0.00029, 0.0024, 0.0128), (0.8644, 0.8913, 0.8958, 0.932) ])
( [ (0.986, 0.936, 0.892, 0.773), (0.00389, 0.0024, 0.0023, 0.00097) ]) 
Iteration 6 :
The node The Golden City has only node Gate way of India as the predecessor.
IVITrFNSP is calculated from The Golden City to Gate way of India. Since node 6 has
only node 2 as the predecessor. So fix i  2 and j  6 we apply step 2 at proposed

algorithm.
d 6 = minimum d 2  d 26 
 ([ ( 0.872, 0.9, 0.9285, 0.9868), (0.5257, 0.6269, 0.6885, 0.8921) ]), 

( [ (0.832, 0.75, 0.6885, 0.4568), (0.9657, 0.947, 0.928, 0.852)]), 
 
= ( [ (0.011, 0.026, 0.048, 0.12), (0.316, 0.581, 0.688, 0.828 ) ]), 
 
([ ( 0.801, 0.696, 0.588, 0.32), (0.126, 0.051, 0.028, 0.008) ]), 
( [ (0.00063, 0.00125, 0.0081, 0.028), (0.6249, 0.6886, 0.718, 0.8036)]), 
 
( [ (0.787, 0.746, 0.708, 0.598), (0.0135, 0.0087, 0.0077, 0.0036 ) ] )  , 2
  ([ ( 0.872, 0.9, 0.9285, 0.9868), (0.5257, 0.6269, 0.6885, 0.8921) ]), 

( [ (0.832, 0.75, 0.6885, 0.4568), (0.9657, 0.947, 0.928, 0.852)]), 
 
( [ (0.011, 0.026, 0.048, 0.12), (0.316, 0.581, 0.688, 0.828 ) ]), 
d6   
([ ( 0.801, 0.696, 0.588, 0.32), (0.126, 0.051, 0.028, 0.008) ]), 
( [ (0.00063, 0.00125, 0.0081, 0.028), (0.6249, 0.6886, 0.718, 0.8036)]),
 
( [ (0.787, 0.746, 0.708, 0.598), (0.0135, 0.0087, 0.0077, 0.0036 ) ] )  
Here the labelled node is The Golden City and the minimum provided corresponding
node is Gate way of India
Minimum Labelled
Path Node
Node Node
 ([ ( 0.872, 0.9, 0.9285, 0.9868), (0.5257, 0.6269, 0.6885, 0.8921) ]),
( [ (0.832, 0.75, 0.6885, 0.4568), (0.9657, 0.947, 0.928, 0.852)]),
( [ (0.011, 0.026, 0.048, 0.12), (0.316, 0.581, 0.688, 0.828 ) ]),
GWOI TGC
([ ( 0.801, 0.696, 0.588, 0.32), (0.126, 0.051, 0.028, 0.008) ]),
( [ (0.00063, 0.00125, 0.0081, 0.028), (0.6249, 0.6886, 0.718, 0.8036)]),
( [ (0.787, 0.746, 0.708, 0.598), (0.0135, 0.0087, 0.0077, 0.0036 ) ] ) 
Iteration 7 :
The node Sri Harmandir Sahib has two predecessors node, they are node Taj mahal
and node The Golden City.
IVITrFNSP is calculated to Sri Harmandir Sahib from Taj mahal and The Golden
City. Since node 7 has two predecessors node 5 and node 6. So fix i  5, 6 and j  7 we

d 7 = minimum d 5  d 57 , d 6  d 67 
Therefore,
 
S (n1 )  0.25626 , S (n2 )  0.272027
  ([ ( 0.9874, 0.9944, 0.9967, 0.9998), (0.53, 0.636, 0.7096, 0.9052) ]), 

( [ ( 0.8546, 0.7678, 0.6974, 0.461), (0.9994, 0.9982, 0.9952, 0.9853) ]), 
 
( [ (0.014, 0.0255, 0.0432, 0.1152), (0.0774, 0.1296, 0.1995, 0.3928) ]), 
 
 ([ ( 0.36312, 0.2655, 0.1848, 0.0288), (0.0856, 0.05712, 0.03528, 0.00936) ]),
( [ ( 0.000002145, 0.000024, 0.0003, 0.0035), 
 
(0.6828, 0.72195, 0.77, 0.9134) ]), ( [ (0.9219, 0.856, 0.779, 0.559), 
(0.0008, 0.00045, 0.000322, 0.0000194 ) ]) , 5 
 
 ([ ( 0.9874, 0.9944, 0.9967, 0.9998), (0.53, 0.636, 0.7096, 0.9052) ]), 

( [ ( 0.8546, 0.7678, 0.6974, 0.461), (0.9994, 0.9982, 0.9952, 0.9853) ]), 
 
( [ (0.014, 0.0255, 0.0432, 0.1152), (0.0774, 0.1296, 0.1995, 0.3928) ]), 
 
d 7   ([ ( 0.36312, 0.2655, 0.1848, 0.0288), (0.0856, 0.05712, 0.03528, 0.00936) ]),
( [ ( 0.000002145, 0.000024, 0.0003, 0.0035), 
 
(0.6828, 0.72195, 0.77, 0.9134) ]), ( [ (0.9219, 0.856, 0.779, 0.559), 
(0.0008, 0.00045, 0.000322, 0.0000194 ) ])  
 
The labelled node is Sri Harmandir Sahib and the minimum provided corresponding
node is Taj mahal.
Minimum Node Labelled Node Path Node
 ([ ( 0.9874, 0.9944, 0.9967, 0.9998), (0.53, 0.636, 0.7096, 0.9052) ]),

( [ ( 0.8546, 0.7678, 0.6974, 0.461), (0.9994, 0.9982, 0.9952, 0.9853) ]),
( [ (0.014, 0.0255, 0.0432, 0.1152), (0.0774, 0.1296, 0.1995, 0.3928) ]),
TM SHS ([ ( 0.36312, 0.2655, 0.1848, 0.0288), (0.0856, 0.05712, 0.03528, 0.00936) ]),
( [ ( 0.000002145, 0.000024, 0.0003, 0.0035),
(0.6828, 0.72195, 0.77, 0.9134) ]), ( [ (0.9219, 0.856, 0.779, 0.559),
(0.0008, 0.00045, 0.000322, 0.0000194 ) ]) 
Since Sri Harmandir Sahib is the destination node .

We calculate SP to destination node to source node. Since

Labeled Node Minimum Node

Sri Harmandir Sahib Taj mahal
Taj mahal Gate way of India
Gate way of India The beaches of Goa
Therefore the seven wonders interval-valued intuitionistic nether trapezoidal

neutrosophic fuzzy graph shortest path is
Fig 4 : SP from The beaches of Goa to Sri Harmandir Sahib.

V. SHORTEST PATH ON DIJKSTRA’S ALGORITHM :

In the above real life application, we clarify another method of SPP using Dijkstra‟s
algorithm. In this SPP, we use direct method of Dijkstra‟s algorithm and we assume edge
weight is India famous seven tourist place km.
Fig 5 : SP for Dijkstra’s Algorithm.
Here, we verify India famous seven tourist place shortest path through Dijkstra‟s
Algorithm. We have the paths are
1 2  5  7
Here these two paths interval-valued intuitionistic trapezoidal neutrosophic fuzzy
graphs and Dijkstra‟s Algorithm are same. The shortest path is
1 2  5  7
VI . CONCLUSION :
In this chapter, discovering SP on India famous seven tourist place using interval-valued
intuitionistic trapezoidal neutrosophic fuzzy graph. A genuine application is given to act as an
interval-valued intuitionistic trapezoidal neutrosophic fuzzy graph. Finally checked most brief
way shortest path on India famous seven tourist place with Dijkstra'algorithm.

REFERENCES :
1. Ahuja RK, Mehlhrn K, Orlin JB, Tarjan RE (1990) Faster algorithms for the shortest
path problem. J ACM 37:213-223.
2. Yang CD, Lee DT, Wong CK (1992) On bends and lengths of rectilinear paths : a
graph theoretic approach. Int J Comput Geom Appl 2(1): 61-74.
3. Arsham H (1998) Stability analysis for the shortest path problem. Conf J Numer
Themes 133:171-210.
4. Broumi S, Bakali A, Talea M, Smarandache F, Vladareanu L(2016) Applying Dijkstra
algorithm for solving neutrosophic shortest path problem. In: International conference
on advanced mechatronic systems (ICAMechS) 2016.
5. Ye, J.Multiple-attribute decision-making method under a single-valued neutrosophic
hesitant fuzzy environment J.Intell.syst.2014, 24, 23-36
6. Broumi S, Bakali A, Mohamed T, Smarandache F, Vladareanu L(2016) Shortest path
problem under triangular fuzzy neutrosophic information. In: 10th International
conference on software, knowledge, information management and applications
(SKIMA), pp 169-174.
7. Broumi S, Mohamed T, Bakali A, Smarandache F (2016) Single valued neutrosophic
graphs. J New Theory 10:86-101.
8. Smarandache F(2005) A unifying field in logic. Neutrosophy: neutrosophic probability,
set, logic, 4th edn. American Research Press, Rehoboth.
9. Wang H, Smarandache F, Zhang Y, Sunderraman R (2010) Single value neutrosophic
sets Multisp Multistruct 4:410-413.
10. J Ye Trapezoidal fuzzy neutrosophic set and its application to multiple attribute
decision making Neural Computing and Applications.2014 DOI 10.1007
s00521-014-1787-6.
11. Chiranjibe Jana, Madhumangal Pal, Faruk Karaaslan, Jian-qiang Wang, Trapezoidal
neutrosophic aggregation operators and its application in multiple attribute decision
making process. 2018.
12. Ye, J., Trapezoidal neutrosophic set and its application to multiple attribute decision
making, Neural computing and Applications, 26(5), pp. 1157-1166, (2015).
13. Ye, J.Trapezoidal neutrosophic set and its application to multiple attribute
decision-making, Neural comput. Appl. 2015, 26, 1157-1166.

14. Ye, J., Multi criteria decision-making method using the Dice similarity measure
between expected intervals of trapezoidal fuzzy numbers, Journal of Decision Systems,
21(4), pp. 307-317, (2012).
15. H Wang, F Smarandache, Y Zhang and R Sunderraman, “ Single valued Neutrosophic
Sets” Fuzzy Sets and Systems, Vol 20, 1986, pp: 87-96.
16. Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, “ Shortest Path
Problem Under Trapezoidal Neutrosophic Information, 2017, pp: 1-7
17. P.K.De and Amita Bhinchar. Computation of Shortest Path in a fuzzy network.
International journal computer applications. 11(2), 2010. pp 0975-8887.
18. Smarandache, F. A unifying field in logics: Neutrosophic logic, Neutrosophic set,
Neutrosophic probability and statistics, 4th ed.; American Research press: Rehoboth,
DE, USA, 1998.
19. P.Jayagowri and G. G. Ramani, Using Trapizoidal Intuitionistic Fuzzy Number to Find
Optimized Path in a Network. Volume2014. Advances in Fuzzy Systems , 2014, 6
pages.
20. A Kumar and M kaur, A New Algorithm for Solving Shortest Path Problem on a
Network with Imprecise Edge Weight. Applications and Applied Mathematics. Vol.
6, Issue 2, 2011, pp 602-619.
21. G Kumar, R. K. Bajaj and N Gandotra, “Algorithm for shortest path problem in a
network with interval valued intuitionistic trapezoidal fuzzy number. Procedia
Computer Science 70, 2015, pp 123-129.
22. S Majumdar and A pal, Shortest path problem on Intuitionistic Fuzzy Network, Annals
of Pure and Applied Mathematics, Vol. 5, No. 1, November 2013, pp 26-36.
23. Xu, Z.S., Methods for aggregating interval-valued intuitionistic fuzzy information and
their application to decision making, Control and decision, 22(2), pp 215-219, 2007.
24. Broumi S, Mohamed T, Bakali A, Smarandache F, Krishnan KK (2017) Shortest path
problem on single valued neutrosophic graphs. In: International symposium on
networks, computers and communications.
25. Deli I, Subas Y(2017) A ranking method of single valued neutrosophic numbers and
its applications to multi-attribute decision making problems. Int J Mach Learn Cybern
8(2017) : 1309-1322.
26. Enayattabar M, Ebrahimnejad A, Motameni H(2018) Dijkstra algorithm for shortest
path problem under interval-valued Pythagorean fuzzy environment. Complex Intell
sSyst 1-8.
27. Broumi ,S.; Bakali, A.; Talea, M.; Smarandache, F.; Ali, M.; Shortest path under
Bipolar Neutrosophic setting. Appl.Mech.Mater.2017, 859, 59-66.
28. Deli I (2018) Operators on single valued trapezoidal neutrosophic numbers and
SVTN-group decision making . Neutrosophic Sets Syst 22: 131-151.
29. Kumar R, Edaltpanah SA, Jha S, Broumi S, Dey A (2018) Neutrosophic shortest path
problem. Neutrosophic Sets Syst 23: 5-15.
30. Broumi, S.; Bakali, A.; Talea, M.; Smarandache, F.; Kishore, P.K.; Sachin, R.;
Shortest path problem under interval-valued neutrosophic setting. Int. J. Adv. Trends
Compt. Sci. Eng. 2019, 8, 216-222.
31. K.Kalaiarasi, R.Divya, The shortest path on minimal spanning tree with triangular
single-valued neutrosophic intuitionistic fuzzy graph, Parishodh journal,2020, IX,
3899-3903

CHAPTER-12
Neutrosophic αgs Continuity And Neutrosophic
αgs Irresolute Maps
V.Banu priya1, S.Chandrasekar2,M. Suresh3
1
Assistant Professor, Department of Mathematics,
RMK College of Engineering and Technology, Puduvoyal, Tiruvallur(DT),
Tamil Nadu, India.E-mail: spriya.maths@gmail.com.
2
Arignar Anna Government Arts College,Namakkal(DT),T
amil Nadu, India.E-mail: chandrumat@gmail.com.
3
Assistant Professor,Department Of Mathematics R.M.D. Engineering College ,
Kavaraipettai, Tiruvallur, Tamil Nadu, India
Email sureshmaths2209@gmail.com
Abstract :
Neutrosophic Continuity functions very first introduced by A.A.Salama et.al.Aim of
this present chapter is, we introduce and investigate new kind of Neutrosophic continuity is
called Neutrosophic αgs Continuity maps in Neutrosophic topological spaces and also
discussed about some properties and characterization of Neutrosophic αgs Irresolute Maps.
Keywords:
Neutrosophic α-closed sets, Neutrosophic semi-closed sets, Neutrosophic αgs-closed
sets Neutrosophic αgs Continuity maps, Neutrosophic αgs irresolute maps
1. Introduction :
Neutrosophic set theory concepts first initiated by F.Smarandache[11] which is
Based on K. Atanassov‟s intuitionistic[6]fuzzy sets & L.A.Zadeh‟s [20]fuzzy sets. Also it
defined by three parameters truth(T), indeterminacy (I),and falsity(F)-membership function.

Smarandache‟s neutrosophic concept have wide range of real time applications for the
fieldsof[1,2,3,4&5] Information Systems, Computer Science, Artificial Intelligence, Applied
Mathematics, decision making. Mechanics, Electrical&Electronic, Medicine and
Management Science etc,.
A.A.Salama[16] introduced Neutrosophic topological spaces by using Smarandache‟s
Neutrosophic sets. I.Arokiarani.[7] et.al., introduced Neutrosophic α-closed sets.P.
Ishwarya, [13]et.al., introduced and studied Neutrosophic semi-open sets in Neutrosophic
topological spaces. Neutrosophic continuity functions introduced by A.A.Salama[15].
Neutrosophic αgs-closed set[8] introduced by V.Banu priya&S.Chandrasekar. Aim of this
present chapter is, we introduce and investigatenew kind of Neutrosophic continuity is
called Neutrosophic αgs Continuity maps in Neutrosophic topological spaces and also we
discussed about properties and characterization Neutrosophic αgs Irresolute Maps
.
2. PRELIMINARIES :
In this section, we introduce the basic definition for Neutrosophic sets and its
operations.

Let E be a non-empty fixed set. A Neutrosophic set λ writing the formatis
λ = {<e, ηλ(e), σλ(e) ,γλ(e)>:e∈E}
Where ηλ(e), σλ(e) and γλ(e) which represents Neutrosophic topological spaces the degree of
membership function, indeterminacy and non-membership function respectively of each
element e∈E to the set λ.
Remark 2.2 [11] :

A Neutrosophic set λ={<e, ηλ(e), σλ(e), γλ(e)>: e∈E} can be identified to an ordered
triple <ηλ, σλ, γλ> in ⦌-0,1+⦋ on E.
Remark 2.3[11] :
Neutrosophic setλ={<e, ηλ(e),σλ(e),γλ(e)>:e∈E}our convenient we can write λ=<e, ηλ,
σλ, γλ>.

Example 2.4 [11] :

we must introduce the Neutrosophic set 0N and 1N in E as follows:
0N may be defined as:
(01) 0N={<e, 0, 0, 1>: e∈E}
(02) 0N={<e, 0, 1, 1>: e∈E}
(03) 0N={<e, 0, 1, 0 >:e∈E}
(04) 0N={<e, 0, 0, 0>: e∈E}
1N may be defined as:
(11) 1N= {<e, 1, 0, 0>: e∈E}
(12) 1N= {<e, 1, 0, 1>: e∈E}
(13) 1N={<e, 1, 1, 0 >: e∈E}
(14) 1N={<e, 1, 1, 1 >: e∈E}

Let λ=<ηλ, σλ,γλ> be a Neutrosophic set on E, then λC defined as λC={<e, γλ(e) ,1-
σλ(e), ηλ(e)>: e ∈E}

Let Ebe a non-empty set, and Neutrosophic sets λ and μ in the form
λ ={<e, ηλ(e), σλ(e), γλ(e)>:e∈E} and
μ ={<e, ημ(e), σμ(e), γμ(e)>: e∈E}.
Then we consider definition for subsets (λ⊆μ).
λ⊆μdefined as: λ⊆μ ⟺ηλ(e) ≤ ημ(e), σλ(e) ≤ σμ(e) and γλ(e) ≥ γμ(e) for all e∈E

For any Neutrosophic set λ, then the following condition are holds:
(i) 0N⊆λ, 0N⊆ 0N
(ii) λ⊆1N, 1N⊆ 1N

Let E be a non-empty set, and λ=<e, ημ(e),σλ(e), γλ(e)> , μ =<e, ημ(e), σμ(e), γμ(e)> be
two Neutrosophic sets. Then
(i) λ∩μ defined as :λ∩μ =<e, ηλ(e)⋀ημ(e), σλ(e)⋀σμ(e),γλ(e)⋁γμ(e)>

(ii) λ∪μ defined as :λ∪μ =<e, ηλ(e)⋁ημ(e), σλ(e)⋁σμ(e), γλ(e)⋀γμ(e)>

For all λ and μ are two Neutrosophic sets then the following condition are true:
(i) (λ∩μ)C=λC∪μC
(ii) (λ∪μ)C=λC∩μC.

A Neutrosophic topology is a non-empty set E is a family τNof Neutrosophic subsets in
E satisfying the following axioms:
(i) 0N, 1N ∈τN ,
(ii) G1∩G2∈τN for any G1, G2∈τN,
(iii) ∪Gi∈τNfor any family {Gi⎸i∈J}⊆τN.
the pair (E, τN) is called a Neutrosophic topological space.
The element Neutrosophic topological spaces of τN are called Neutrosophic open sets.
A Neutrosophic set λ is closed if and only if λC is Neutrosophic open.
Example 2.11[16] :
Let E={e} and
A1= {<e, .6, .6, .5>:e∈E}
A2= {<e, .5, .7, .9>:e∈E}
A3= {<e, .6, .7, .5>:e∈E}
A4= {<e, .5, .6, .9>:e∈E}
Then the family τN={0N, 1N,A1, A2, A3, A4}is called a Neutrosophic topological space on
E.
Let (E, τN) be Neutrosophic topological spaces andλ={<e, ηλ(e), σλ(e), γλ(e)>:e∈E} be
a Neutrosophic set in E. Then the Neutrosophic closure and Neutrosophic interior of λ are
defined by
Neu-cl(λ)=∩{D:D is a Neutrosophic closed set in E and λ⊆D}
Neu-int(λ)=∪{C:C is a Neutrosophic open set in E and C⊆λ}.

Definition 2.13 :
Let (E, τN) be a Neutrosophic topological space. Then λ is called
(i) Neutrosophic regular Closed set [7] (Neu-RCS in short) if λ=Neu-Cl(Neu-Int(λ)),
(ii) Neutrosophic α-Closed set[7] (Neu-αCS in short) if Neu-Cl(Neu-Int(Neu-Cl(λ)))⊆λ,
(iii) Neutrosophic semi Closed set [13] (Neu-SCS in short) if Neu-Int(Neu-Cl(λ))⊆λ ,
(iv) Neutrosophic pre Closed set [18] (Neu-PCS in short) if Neu-Cl(Neu-Int(λ))⊆λ,
Definition 2.14 :
(i). Neutrosophic regular open set [7](Neu-ROS in short) if λ=Neu-Int(Neu-Cl(λ)),
(ii). Neutrosophic α-open set [7](Neu-αOS in short) if λ⊆Neu-Int(Neu-Cl(Neu-Int(λ))),
(iii). Neutrosophic semi open set [13](Neu-SOS in short) if λ⊆Neu-Cl(Neu-Int(λ)),
(iv).Neutrosophic pre open set [18] (Neu-POS in short) if λ⊆Neu-Int(Neu-Cl(λ)),
Definition 2.15 :
(i).Neutrosophic generalized closed set[9](Neu-GCS in short) if Neu-cl(λ)⊆U whenever
λ⊆U and U is a Neu-OS in E ,
(ii).Neutrosophic generalized semi closed set[17] (Neu-GSCS in short) if Neu-scl(λ)⊆U
Whenever λ⊆U and U is a Neu-OS in E,
(iii).Neutrosophic α generalized closed set *14+(Neu-αGCS in short) if Neu-αcl(λ)⊆U
whenever λ⊆U and U is a Neu-OS in E ,
(iv).Neutrosophic generalized alpha closed set [10] (Neu-GαCS in short) if
Neu-αcl(λ)⊆U whenever λ⊆U and U is a Neu-αOS in E .
The complements of the above mentioned Neutrosophic closed sets are
called their respective Neutrosophic open sets.

Let (E, τN) be a Neutrosophic topological space.Then λ is called Neutrosophic α
generalized Semi closed set (Neu-αGSCS in short) if Neu-αcl(λ)⊆U whenever λ⊆U and U is a
Neu-SOS in E
The complements of Neutrosophic αGS closed sets is called Neutrosophic αGS open sets.

3. Neutrosophic αgs-Continuity maps :

In this section we Introduce Neutrosophic α-generalized semi continuity maps and
study some of its properties.
Definition 3.1 :
A maps f:(E1, τN)→( E2, σN) is called a Neutrosophic α-generalized semi
continuity(Neu-αGS continuity in short) f-1(μ) is a Neu-αGSCS in (E1, τN) for every
Neu-CS μ of (E2, σN)
Example 3.2 :
Let E1={a1,a2}, E2={b1,b2}, U=<e1,(.7,.5,.8),(.5,.5,.4)> andV=<e2,(1,.5,.9),(.2,.5,.3)>.Then
τN={0N,U,1N- and σN={0N,V,1N} are Neutrosophic Topologies on E1and E2 respectively.
Define a mapsf:(E1, τN)→( E2, σN)by f(a1)=b1 and f(a2)=b2. Then f is a Neu-αGS continuity
maps.
Theorem 3.3 :
Every Neu-continuity maps is a Neu-αGS continuity maps.
Proof :
Let f:(E1, τN)→( E2, σN)be a Neu-continuity maps. Let λ be a Neu-CS in E2. Since f is a
Neu-continuity maps, f-1(λ) is a Neu-CS in E1. Since every Neu-CS is a Neu-αGSCS,f-1(λ) is a
Neu-αGSCS in E1. Hence f is a Neu-αGS continuity maps.
Example 3.4 :
Neu-αGS continuity maps is not Neu-continuity maps
Let E1={a1, a2}, E2={b1, b2},U=<e1, (.5,.5,.3), (.7,.5, .8)> and V=< e2,(.4,.5,.3), (.8,.5, .9)>.
Then τN={0N,U,1N- and σN={0N,V,1N} are Neutrosophic sets on E1 and E2 respectively.
Define a mapsf:(E1, τN)→( E2, σN) by f(a1)=b1 and f(a2)=b2 . Since the Neutrosophic set λ=<y
,(.3,.5, .4),(.9,.5, .8)> is Neu-CS in E2, f-1(λ) is a Neu-αGSCS but not Neu-CS in E1. Therefore f
is a Neu-αGS continuity maps but not a Neu-continuity maps.

Theorem 3.5 :
Every Neu-α continuity maps is a Neu-αGS continuity maps.
Proof :
Let f:(E1, τN)→( E2, σN)be a Neu- α continuity maps. Let λ be a Neu-CS in E2. Then by
hypothesis
f-1(λ) is a Neu-αCS in E1. Since every Neu-αCS is a Neu-αGSCS,f-1(λ)is a Neu-αGSCS in E1.
Hence f is a Neu-αGS continuity maps.
Example 3.6 :
Neu-αGS continuity maps is not Neu-α continuity maps
Let E1={a1,a2}, E2={b1,b2},U=<e1,(.5,.5, .6), (.7,.5,.6)> and V=< e2,(.3,.5,.9), (.5,.5, .7)>.
Then τN={0N,U,1N- and σN={0N, V, 1N} are Neutrosophic Topologies on E1 and E2 respectively.
Define a mapsf:(E1, τN)→( E2, σN)by f(a1)=b1 and f(a2)=b2. Since the Neutrosophic set λ=<
e2, (.9,.5, .3), (.7,.5, .5)> is Neu-CS in E2, f-1(λ) is a Neu-αGSCS continuity maps.
Remark 3.7 :
Neu-G continuity maps and Neu-αGS continuity maps are independent of each other.
Example 3.8 :
Neu-αGS continuity maps is not Neu-G continuity maps.
Let E1={a1, a2}, E2={b1, b2}, U=< e1,(.5,.5, .6), (.8,.5,.4)> and V=< e2,(.7,.5,.4), (.9,.5, .3)>. Then
τN={0N,U,1N- and σN={0N,V,1N} are Neutrosophic Topologies on E1 and E2 respectively.
Define a mapsf:(E1, τN)→( E2, σN) by f(a1)=b1 and f(a2)=b2 .Then f is Neu-αGS continuity
maps but not Neu-G continuitymaps.
Since λ=< e1,(.4,.5, .7), (.3,.5, .9)> is Neu-CS in E2, f-1(λ)=<e2, (.4,.5, .7), (.7,.5, .3)> is not
Neu-GCS in E1.
Example 3.9 :
Neu-G continuity maps are not Neu-αGS continuity maps.

Let E1={a1, a2}, E2={b1,b2}, U=<e1,(.6,.5,.4), (.8,.5,.2)> and V=<e2,(.3,.5,.7), (.1,.5, .9)>.
Then τN={0N,U,1N- and σN={0N,V,1N} are Neutrosophic Topologies on E1 and E2
respectively. Define a maps f:( E1, τN) →( E2, σN) by f(a1)=b1 and f(a2)=b2 . Then f is Neu-G
continuity maps but not a Neu-αGS continuity maps.
Since λ=< e2,(.7,.5, .3), (.9,.5, .1)> is Neu-CS in E2, f-1(λ)=<e1, (.7,.5, .3), (.9,.5,.1)> is not
Neu-αGSCS in E1.
Theorem 3.10 :
Every Neu-αGS continuity maps is a Neu-GS continuity maps.
Proof :
Let f f:(E1, τN)→( E2, σN) be a Neu-αGS continuity maps. Let λ be a Neu-CS in E2.Then
by hypothesis
f-1(λ) Neu-αGSCS in E1. Since every Neu-αGSCS is a Neu-GSCS, f-1(λ) is a Neu-GSCS in E1.
Hence f is a Neu-GS continuity maps.
Example 3.11 :
Neu-GS continuity maps is not Neu-αGS continuity maps.
Let E1={a1, a2}, E2={b1, b2}, U=<e1,(.8,.5,.4), (.9,.5,.2)> and V=< e2,(.3,.5,.9), (0.1,.5, .9)>.
Then τN={0N,U,1N- and σN={0N,V,1N} are Neutrosophic Topologies on E1 and E2
respectively. Define a mapsf:(E1, τN)→( E2, σN)by f(a1)=b1 and f(a2)=b2.Since the
Neutrosophic set λ=< e2,(.9,.5,.3),(.9, .5,.1)> is Neu-CS in E2, f-1(λ) is Neu-GSCS in E1
but not Neu-αGSCS in E1. Therefore f is a Neu-GS continuity maps but not a Neu-αGS
continuity maps.
Remark 3.12 :
Neu-P continuity maps and Neu-αGS continuity maps are independent of each other.
Example 3.13 :
Neu-P continuity maps is not Neu-αGS continuity maps Let E1={a1, a2}, E2={b1,
b2},U= <e1, (.3,.5,.7),(.4,.5,.6)> and V=< e2,(.8,.5,.3), (.9,.5, .2)>. Then τN={0N,U,1N- and σN={0N,
V, 1N } are Neutrosophic Topologies on E1 and E2 respectively. Define a mapsf:(E1, τN)→(
E2, σN)by f(a1)=b1 and f(a2)=b2.Since the Neutrosophic set λ=< e2,(.3,.5, .8), (.2,.5, .9)> is
Neu-CS in E2, f-1(λ) is Neu-PCS in E1 but not Neu-αGSCS in E1. Therefore f is a Neu-P
continuity maps but not Neu-αGS continuity maps.
Example 3.14 :
Neu-αGS continuity maps is not Neu-P continuity maps
Let E1={a1, a2}, E2={b1, b2}, U=< e1,(.4,.5,.8),(.5,.5,.7)> and V=< e1,(.5,.5,.7), (.6,.5, .6)>and
W=< e2,(.8,.5,.4), (.5,.5,.7)>. Then τN={0N,U,V,1N- and σN={0N,W,1N} are Neutrosophic
Topologies on E1 and E2 respectively. Define a mapsf:(E1, τN)→( E2, σN)by f(a1) = b1 and
f(a2)=b2. Since the Neutrosophic set λ=<y ,(.4,.5, .8), (.7,.5, .5)> is Neu-αGSCS but not
Neu-PCS in E2, f-1(λ)is Neu-αGSCS in E1 but not Neu-PCS in E1. Therefore f is a Neu-αGS
continuity maps but not Neu-P continuity maps.
Theorem 3.15 :
Every Neu-αGS continuity maps is a Neu-αG continuity maps.
Proof :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS continuity maps. Let λ be a Neu-CS in E2. Since
f is Neu-αGS continuity maps, f-1(λ) is a Neu-αGSCS in E1. Since every Neu-αGSCS is
a Neu- αGCS, f-1(λ) is a Neu- αGCS in E1. Hence f is a Neu- αG continuity maps.
Example 3.16 :
Neu- αG continuity maps is not Neu-αGS continuity maps.
Let E1={a1, a2}, E2={b1, b2}, U=< e1,(.1,.5,.7),(.3,.5, .6)> and V=< e2,(.7,.5,.4), (.6,.5,
.5)>.Then τN={0N,U,1N- and σN={0N,V,1N} are Neutrosophic Topologies on E1 and E2
respectively. Define a mapsf:(E1, τN)→( E2, σN)by f(a1)=b1 and f(a2)=b2.Since the
Neutrosophic set λ=< e2,(.4,.5,.7),(.5,.5, .6)> is Neu-CS in E2, f-1(λ) is Neu-αGCS in E1 but
not Neu-αGSCS in E1. Therefore f is a Neu-αG continuity maps but not a Neu-αGS
continuity maps.
Theorem 3.17 :
Every Neu-αGS continuity maps is a Neu-Gα continuity maps.
Proof :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS continuity maps. Let λ be a Neu-CS in E2. Since f is
Neu-αGS continuity maps, f-1(λ)is a Neu-αGSCS in E1. Since every Neu-αGSCS is a
Neu-GαCS, f-1(λ) is a Neu-GαCS in E1. Hence f is a Neu-Gα continuity maps.
Example 3.18 :
Neu-Gα continuity maps is not Neu-αGS continuity maps Let E1={a1, a2}, E2={b1, b2},
U=<e1, (.5,.5,.7), (.3,.5, .9)> and V=< e2,(.6,.5,.6), (.5,.5,.7)>.Then τN={0N,U,1N } and
σN={0N,V,1N} are Neutrosophic Topologies on E1 and E2 respectively. Define a mapsf:(E1,
τN)→( E2, σN)by f(a1)=b1 and f(a2)=b2. Since the Neutrosophic set λ=<y,(.6,.5,.6), (.7,.5, .5)> is
Neu-CS in E2, f-1(λ)is Neu-Gα CS in E1 but not Neu-αGSCS in E1. Therefore f is a Neu-Gα
continuity maps but not a Neu-αGS continuity maps.
Remark 3.19 :
We obtain the following diagram from the results we discussed above.
Theorem 3.20 :
A mapsf:(E1,τN)→( E2,σN)is Neu-αGS continuity if and only if the inverse image of each
Neutrosophic set in E2 is a Neu-αGSOS in E1.
Proof :
First part Let λ be a Neutrosophic set in E2. This implies λC is Neu-CS in E2. Since f is
Neu-αGS continuity, f-1(λC) is Neu-αGSCS in E1. Since f-1(λC)=(f-1(λ))C, f-1(λ) is a Neu-αGSOS in
E 1.
Converse part Let λ be a Neu-CS in E2. Then λC is a Neutrosophic set in E2. By hypothesis
f-1(λC) is Neu-αGSOS in E1. Since f-1(λC)=(f-1(λ))C, (f-1(λ))C is a Neu-αGSOS in E1. Therefore f-1(λ)
is a Neu-αGSCS in E1. Hence f is Neu-αGS continuity.

Theorem 3.21 :
Let f:(E1, τN)→( E2, σN)be a maps and f-1(λ) be a Neu-RCS in E1for every Neu-CS λ in E2.
Then f is a Neu-αGS continuity maps.
Proof :
Let λ be a Neu-CS in E2 and f-1(λ) be a Neu-RCS in E1. Since every Neu-RCS is a Neu-αGSCS,
f-1(λ) is a Neu-αGSCS in E1. Hence f is a Neu-αGS continuity maps.
Definition 3.22 :
A Neutrosophic Topology (E, τN) is said to be an
(i)Neu-αgaU1/2(in short Neu- αgaU1/2) space ,if every Neu-αGSCS in E is a Neu-CS in E,
(ii)Neu-αgbU1/2(in short Neu- αgbU1/2) space ,if every Neu-αGSCS in E is a Neu-GCS in E,
(iii)Neu-αgcU1/2(in short Neu- αgcU1/2) space, if every Neu-αGSCS in E is a Neu-GSCS in E.
Theorem 3.23 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS continuity maps, then f is a Neu-continuity
maps if E1 is a Neu-αgaU1/2 space.
Proof :
Let λ be a Neu-CS in E2. Then f-1(λ)is a Neu-αGSCS in E1, by hypothesis.Since E1 is a
Neu-αgaU1/2,f-1(λ) is a Neu-CS in E1. Hence f is a Neu-continuity maps.
Theorem 3.24 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS continuity maps, then f is a Neu-G continuity
maps if E1 is a Neu-αgbU1/2 space.
Proof :
Let λ be a Neu-CS in E2. Then f-1(λ) is a Neu-αGSCS in E1, by hypothesis. Since E1 is a Neu-
-1
αgbU1/2,f (λ) is a Neu-GCS in E1. Hence f is a Neu-G continuity maps.
Theorem 3.25 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS continuity maps, then f is a Neu-GS continuity
maps if E1 is a Neu-αgcU1/2 space.
Proof :
Let λ be a Neu-CS in E2. Then f-1(λ) is a Neu-αGSCS in E1, by hypothesis. Since E1 is a Neu-
-1
αgcU1/2,f (λ) is a Neu-GSCS in E1. Hence f is a Neu-GS continuity maps.
Theorem 3.26 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS continuity maps and g:( E2, σN)→( E3, ρN) be an
Neutrosophic continuity, then g∘f :( E1, τN)→( E3, ρN) is a Neu-αGS continuity.
Proof :
Let λ be a Neu-CS in E3. Then g-1(λ)is a Neu-CS in E2, by hypothesis. Since f is a Neu-αGS
continuity maps, f-1(g-1(λ)) is a Neu-αGSCS in E1. Hence g∘f is a Neu-αGS
continuity maps.
Theorem 3.27 :
Let f:(E1, τN)→( E2, σN)be a maps from Neutrosophic Topology in E1 in to a
Neutrosophic Topology E2. Then the following conditions set are equivalent if E1is a
Neu-αgaU 1/2 space.
(i) f is a Neu-αGS continuity maps.
(ii) if μ is a Neutrosophic set in E2 then f-1(μ) is a Neu-αGSOS in E1.
(iii) f-1(Neu-int(μ))⊆Neu-int(Neu-Cl(Neu-int(f-1(μ)))) for every Neutrosophic set μ in E2.
Proof :
(i)→ (ii): is obviously true.
(ii)→ (iii): Let μ be any Neutrosophic set in E2. Then Neu-int(μ) is a Neutrosophic set in
E2. Then f-1(Neu-int(μ)) is a Neu-αGSOS in E1. Since E1 is a Neu-αgaU1/2 space, f-1(Neu-int(μ))is
a Neutrosophic set in E1.Therefore
f-1(Neu-int(μ))=Neu-int(f-1(Neu-int(μ)))⊆Neu-int(Neu-Cl(Neu-int(f-1(μ)))).
(iii)→(i) Let μ be a Neu-CS in E2. Then its complement μC is a Neutrosophic set in E2. By
Hypothesis f-1(Neu-int(μC))⊆Neu-int(Neu-Cl(Neu-int(f-1(Neu-int(μC))))).This implies that
f-1(μC)⊆Neu-int(Neu-Cl(Neu-int(f-1(Neu-int(μC))))).Hence f-1(μC) is a Neu-αOS in E1. Since
every Neu-αOS is a Neu-αGSOS, f-1(μC)is a Neu-αGSOS in E1. Therefore f-1(μ) is a Neu-αGSCS
in E1. Hence f is a Neu-αGS continuity maps.
Theorem 3.28 :
Let f:(E1, τN)→( E2, σN)be a maps. Then the following conditions set are equivalent if E 1 is
a Neu- αgaU1/2 space.
(i) f is a Neu-αGS continuity maps.
(ii) f-1(λ) is a Neu-αGSCS in E1 for every Neu-CS λ in E2.
(iv) Neu-Cl(Neu-int(Neu-Cl(f-1(λ))))⊆f-1(Neu-Cl(λ)) for every Neutrosophic set λ in E2.
Proof :
(i)→ (ii): is obviously true.
(ii)→ (iii): Let λ be a Neutrosophic set in E2.Then Neu-Cl(λ) is a Neu-CS in E2. By
hypothesis, f-1(Neu-Cl(λ))is a Neu-αGSCS in E1. Since E1 is a Neu-αgaU1/2 space, f-1(Neu- Cl(λ))
is a Neu-CS in E1. Therefore Neu-Cl(f-1(Neu-Cl(λ)))=f-1(Neu-Cl(λ)). Now
Neu-Cl(Neu-int(Neu-Cl(f-1(λ))))⊆Neu-Cl(Neu-int(Neu-Cl(f-1(Neu-Cl(λ)))))⊆f-1(Neu-Cl(λ)).
(iii)→(i): Let λ be a Neu-CS in E2. By hypothesis
Neu-Cl(Neu-int(Neu-Cl(f-1(λ))))⊆f-1(Neu-Cl(λ))=f-1(λ).This implies f-1(λ) is a Neu-αCS in E1 and
hence it is a Neu-αGSCS in E1. Therefore f is a Neu-αGS continuity maps.
Definition 3.29 :
Let (E, τN) be a Neutrospohic topology.The Neutrospohic alpha generalized semi closure
(Neu-αGSCl(λ)in short) for any Neutrosophic set λ is Defined as follows. Neu-αGSCl(λ)=∩{
K 𝐾is a Neu-αGSCS in E1and λ ⊆K}. If λ is Neu-αGSCS, then Neu-αGSCl(λ)=λ.
Theorem 3.30 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS continuity maps. Then the following conditions
set are hold.
(i) f(Neu-αGSCl(λ))⊆Neu-Cl(f(λ)), for every Neutrosophic set λ in E1.
(ii) Neu-αGSCl(f-1(μ))⊆f-1(Neu-Cl(μ)),for every Neutrosophic set μ in E2.
Proof :
(i) Since Neu-Cl(f(λ))is a Neu-CS in E2 and f is a Neu-αGS continuity maps, f-1(Neu-Cl(f(λ)))is
Neu-αGSCS in E1. That is Neu-αGSCl(λ)⊆f-1(Neu-Cl(f(λ))). Therefore f(Neu-αGSCl(λ))
⊆Neu-Cl(f(λ)),for every Neutrosophic set λ in E1.
(ii) Replacing λ by f-1(μ) in (i) we get f(Neu-αGSCl(f-1(μ)))⊆Neu-Cl(f(f-1(μ)))⊆Neu-Cl(μ).Hence
Neu-αGSCl(f-1(μ))⊆f-1(Neu-Cl(μ)), for every Neutrosophic set μ in E2.
4. Neutrosophic α-Generalized Semi Irresolute Maps :-

In this section we Introduce Neutrosophic α-generalized semi irresolute maps and study
some of its characterizations.
Definition 4.1 :
A mapsf:(E1, τN)→( E2, σN)is called a Neutrosophic alpha-generalized semi
irresolute(Neu-αGS irresolute) maps if f-1(λ) is a Neu-αGSCSin (E1, τN) for every Neu-αGSCS λ
of (E2, σN)
Theorem 4.2 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS irresolute, then f is a Neu-αGS continuity maps.
Proof :
Let f be a Neu-αGS irresolute maps. Let λ be any Neu-CS in E2. Since every Neu-CS is a
Neu-αGSCS, λ is a Neu-αGSCS in E2. By hypothesis f-1(λ) is a Neu-αGSCS in E2. Hence f is a
Neu-αGS continuity maps.
Example 4.3 :
Neu-αGS continuity maps is not Neu-αGS irresolute maps.
Let E1={a1, a2}, E2={b1, b2}, U=< e1,(.4,.5, .7), (.5,.5,.6)> and V=< e2,(.8,.5,.3), (.4,.6, .7)>.
Then τN={0N,U,1N- and σN = {0N,V,1N} are Neutrosophic Topologies on E1 and E2 respectively.
Define a mapsf:(E1, τN)→( E2, σN)by f(a1)=b1 and f(a2)=b2. Then f is a Neu-αGS continuity. We
have μ=< e2,(.2,.5, .9), (.6,.5, .5)> is a Neu-αGSCS in E2 but f-1(μ) is not a Neu-αGSCS in E1.
Therefore f is not a Neu-αGS irresolute maps.
Theorem 4.4 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS irresolute, then f is a Neutrosophic irresolute maps
if E1 is a Neu- αgaU1/2 space.

Proof :
Let λ be a Neu-CS in E2. Then λ is a Neu-αGSCS in E2. Therefore f-1(λ) is a Neu-αGSCS in E1,
by hypothesis. Since E1 is a Neu-αgaU1/2 space, f-1(λ) is a Neu-CS in E1. Hence f is a
Neutrosophic irresolute maps.
Theorem 4.5 :
Let f:(E1, τN)→( E2, σN)and g:( E2, σN)→( E3, ρN) be Neu-αGS irresolute maps, then g∘f:( E1,
τN)→( E3, ρN)is a Neu-αGS irresolute maps.
Proof :
Let λ be a Neu-αGSCS in E3. Then g-1(λ) is a Neu-αGSCS in E2. Since f is a Neu-αGS
irresolute maps. f-1((g-1(λ))) is a Neu-αGSCS in E1. Hence g∘f is a Neu-αGS irresolute maps.
Theorem 4.6 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS irresolute and g:( E2, σN) →( E3, ρN) be Neu-αGS
continuity maps, then g∘f:(E1, τN)→( E3, ρN) is a Neu-αGS continuity maps.
Proof :
Let λ be a Neu-CS in E3. Then g-1(λ) is a Neu-αGSCS in E2. Since f is a Neu-αGS irresolute,
f-1((g-1(λ)) is a Neu-αGSCS in E1. Hence g∘f is a Neu-αGS continuity maps.
Theorem 4.7 :
Let f:(E1, τN)→( E2, σN)be a Neu-αGS irresolute, then f is a Neu-G irresolute maps if E1 is a
Neu-αgbU1/2 space.
Proof :
Let λ be a Neu-αGSCS in E2. By hypothesis, f-1(λ) is a Neu-αGSCS in E1. Since E1 is a
Neu- αgbU1/2 space, f-1(λ) is a Neu-GCS in E1. Hence f is a Neu-G irresolute maps.
Theorem 4.8 :
Let f:(E1, τN)→( E2, σN)be a maps from a Neutrosophic Topology E1 Into a Neutrosophic
Topology E2
. Then the following conditions set are equivalent if E1 and E2 are Neu- αgaU1/2 spaces.
(i) f is a Neu-αGS irresolute maps.

(ii) f-1(μ) is a Neu-αGSOS in E1 for each Neu-αGSOS μ in E2.
(iii) Neu-Cl(f-1(μ))⊆f-1(Neu-Cl(μ)) for each Neutrosophic set μ of E2.
Proof :
(i) →(ii) : Let μ be any Neu-αGSOS in E2. Then μC is a Neu-αGSCS in E2.Since f is Neu-αGS
irresolute, f-1(μC) is a Neu-αGSCS in E1. But f-1(μC)=(f-1(μ))C.Therefore f-1(μ) is a Neu-αGSOS in
E 1.
(ii)→(iii) : Let μ be any Neutrosophic set in E2and μ⊆Neu-Cl(μ). Then f-1(μ)⊆f-1(Neu-Cl(μ)).
Since Neu-Cl(μ) is a Neu-CS in E2, Neu-Cl(μ) is a Neu-αGSCS in E2. Therefore (Neu-Cl(μ))C is a
Neu-αGSOS in E2. By hypothesis, f-1((Neu-Cl(μ))C) is a Neu-αGSOS in E1. Since
f-1((Neu-Cl(μ))C)=(f-1(Neu-Cl(μ)))C,f-1(Neu-Cl(μ)) is a Neu-αGSCS in E1. Since E1 is Neu- αgaU1/2
space,f-1(Neu-Cl(μ)) is a Neu-CS in E1. Hence
Neu-Cl(f-1(μ))⊆Neu-Cl(f-1(Neu-Cl(μ)))=f-1(Neu-Cl(μ)). That is Neu-Cl(f-1(μ))⊆f-1(Neu-Cl(μ)).
(iii)→(i) : Let μ be any Neu-αGSCS in E2. Since E2 is Neu-αgaU1/2 space, μ is a Neu-CS in E2 and
Neu-Cl(μ)=μ.Hence f-1(μ)=f-1(Neu-Cl(μ)⊇Neu-Cl(f-1(μ)). But clearly f-1(μ)⊆Neu-Cl(f-1(μ)).
Therefore Neu-Cl(f-1(μ))=f-1(μ). This implies f-1(μ) is a Neu-CS and hence it is a Neu-αGSCS in
E1. Thus f is a Neu-αGS irresolute maps.
Conclusion :
In this research chapter using Neu-αGSCS(Neutrosophic αgs-closed sets ) we are
defined Neu-αGS continuity maps and analyzed its properties.after that we were compared
already existing Neutrosophic continuity maps to Neu-αGSCS continuity maps.
Furthermore we were extended to this maps to Neu-αGS irresolute maps , Finally This
concepts can be extended to future Research for some mathematical applications.

References :
[1] Abdel-Basset, M., Saleh, M., Gamal, A., & Smarandache, F. (2019). An approach
of TOPSIS technique for developing supplier selection with group decision making
under type-2 neutrosophic number Applied Soft Computing, 77, 438-452.
[2] Abdel-Baset, M., Chang, V., Gamal, A., & Smarandache, F. (2019). An integrated
neutrosophic ANP and VIKOR method for achieving sustainable supplier selection:
A case study in importingfield
.Computers in Industry, 106, 94-110.
[3] Abdel-Basset, M., Manogaran, G., Gamal, A., & Smarandache, F. (2019). A group
decision making framework based on neutrosophic TOPSIS approach for smart
medical device selection. Journal of medical systems, 43(2), 38.
[4] Abdel-Baset, M., Chang, V., & Gamal, A. (2019). Evaluation of the green supply
chain management practices: A novel neutrosophic approach. Computers in
Industry, 108, 210-220.
[5] Abdel-Basset, M., Manogaran, G., Gamal, A., & Smarandache, F. (2018). A hybrid
approach of neutrosophic sets and DEMATEL method for developing supplier
selection criteria. Design Automation for Embedded Systems, 1-22.
[6] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20(1986),87-94.
[7] I.Arokiarani, R. Dhavaseelan, S. Jafari, M. Parimala,On Some New Notions and
Functions In Neutrosophic Topological Spaces,Neutrosophic Sets and Systems, Vol.
16, 2017,(16-19)
[8] V.Banu priya, S.Chandrasekar, Neutrosophic α generalized semi closed
set(Communicated)
[9] R .Dhavaseelan and S.Jafari, Generalized Neutrosophic closed sets, New trends in
Neutrosophic theory and applications Volume II- 261-273,(2018).
[10] R. Dhavaseelan, S. Jafari and md. Hanif page, Neutrosophic generalized
α-contra-continuity, creat. math. inform. 27 (2018), no. 2, 133 – 139
[11] Florentin Smarandache ,Neutrosophic and NeutrosophicLogic,First International
Conference On Neutrosophic ,Neutrosophic Logic, Set, Probability, and
Statistics University of New MeEico, Gallup, NM 87301, USA (2002),
smarand@unm.edu
[12] Floretin Smaradache, Neutrosophic Set: - A Generalization of Intuitionistic Fuzzy
set, Journal of Defense Resourses Management. 1(2010), 107-114.
[13] Ishwarya, P and Bageerathi, K., On Neutrosophic semiopen sets in Neutrosophic

topological spaces, International Jour. of Math. Trends and Tech. 2016, 214-223.
[14] D.Jayanthi,  Generalized Closed Sets in Neutrosophic Topological Spaces,
InternationalJournal of Mathematics Trends and Technology (IJMTT)- Special Issue
ICRMIT March 2018.
[15] A.A. Salama and S.A. Alblowi, Generalized Neutrosophic Set and Generalized
Neutrosophic Topological Spaces, Journal computer Sci. Engineering, Vol.(ii)
No.(7)(2012).
[16] A.A.Salama and S.A.Alblowi, Neutrosophic set and Neutrosophic topological space,
ISORJ.mathematics, Vol.(iii) ,Issue(4),(2012).pp-31-35
[17] V.K.Shanthi ,S.Chandrasekar, K.SafinaBegam, Neutrosophic Generalized Semi
Closed Sets In Neutrosophic Topological Spaces, International Journal of Research
in Advent Technology, Vol.6, No.7, July 2018, 1739-1743
[18] V.Venkateswara Rao,Y.Srinivasa Rao, Neutrosophic Pre-open Sets and Pre-closed
Sets in Neutrosophic Topology, International Journal of ChemTech Research,
Vol.10 No.10, pp 449-458, 2017
[19] Nabeeh, N. A., Smarandache, F., Abdel-Basset, M., El-Ghareeb, H. A., &
Aboelfetouh, A. (2019). An Integrated Neutrosophic-TOPSIS Approach and Its
Application to Personnel Selection: A New Trend in Brain Processing and
Analysis. IEEE Access, 7, 29734-29744.
[20] Zadeh, L. A. “Fuzzy sets”, Information and Control, 8, 338-353 (1965).

CHAPTER-13
1
2
3 𝒁-OPEN SETS IN A NEUTROSOPHIC TOPOLOGICAL SPACES
4
5 A. Vadivel1, N. Moogambigai2 and S. Tamilselvan3
6
7
8
9 1
10
11 Tamil Nadu-639 005; Department of Mathematics, Annamalai University,
12
13 Annamalainagar,
14
15 Tamil Nadu-608 002
16
17 Email: avmaths@gmail.com
18 2
19 Department of Mathematics, Thiruvalluvar Goverment Arts College, Rasipuram,
20
21 Tamil Nadu-637 401
22 Email: toyesmohan@gmail.com
23
24 3
Mathematics Section (FEAT), Annamalai University, Annamalainagar, Tamil
25
26 Nadu-608 002
27
28 Email: tamil_au@yahoo.com
29
30
31
32 1 . Introduction :-
33
34
35
In mathematics, concept of fuzzy set between the intervals was first introduced by Zadeh [16]
36
37 in discipline of logic and set theory. The general topology has been framework with fuzzy set
38
39 was undertaken by Chang [4] as fuzzy topological space. In 1983, Atanassov [2] initiated
40
41 intuitionistic fuzzy set which contains a membership and non-membership values. Coker [5]
42
43 created intuitionistic fuzzy set in a topology entitled as intuitionistic fuzzy topological spaces.
44
45 The concepts of neutrosophy and neutrosophic set was introduced Smarandache [11, 12] at the
46
beginning of 20𝑡𝑕 century. Salama and Alblowi [8] in 2012, originated neutrosophic set in a
47
48 neutrosophic topological space. Saha [13] defined 𝛿-open sets in fuzzy topological spaces. In
49
50 2008, Ekici [6] introduced the notion of 𝑒-open sets in a general topology. In 2014, Seenivasan
51
52 et. al. [10] introduced fuzzy 𝑒-open sets in a topological space along with fuzzy 𝑒-continuity.
53
54 Vadivel et al. [3] studied fuzzy 𝑒-open sets in intuitionistic fuzzy topological space. Vadivel et
55
56 al. [14] introduced 𝑒-open sets in a neutrosophic topological space. From 2011, El-Maghrabi
57
and Mubarki [7] introduced and studied some properties of 𝒵 -open sets and maps in

topological spaces. In this chapter, we develop the concept of neutrosophic 𝑍-open sets in a
neutrosophic topological spaces and also specialized some of their basic properties with
examples. Also, we discuss about neutrosophic 𝑍-interior and 𝑍 -closure in neutrosophic
topological spaces.
2. Preliminaries :-
The needful basic definitions & properties of neutrosophic topological spaces are
discussed in this section.

Let X be a non-empty set. A neutrosophic set (briefly, Ns) L is an object having the
form L = {〈y, μL (y), σL (y), νL (y)〉: y ∈ X} where μL → [0,1] denote the degree of
membership function, σL → [0,1] denote the degree of indeterminacy function and νL →
[0,1] denote the degree of non-membership function respectively of each element y ∈ X to
the set L and 0 ≤ μL (y) + σL (y) + νL (y) ≤ 3 for each y ∈ X.
Remark 2.1 [9] :

A NsL = {〈y, μL (y), σL (y), νL (y)〉: y ∈ X} can be identified to an ordered triple
〈y, μL (y), σL (y), νL (y)〉 in [0,1] on X.

Let X be a non-empty set & the Ns ‟s L&𝑀 in the form
L = {〈y, μL (y), σL (y), νL (y)〉: y ∈ X}, M = {〈y, μM (y), σM (y), νM (y)〉: y ∈ X}, then
(i)0N = 〈y, 0,0,1〉 and 1N = 〈y, 1,1,0〉,
(ii)L ⊆ M iff μL (y) ≤ μM (y), σL (y) ≤ σM (y)&νL (y) ≥ νM (y): y ∈ X,
(iii)L = M iff L ⊆ M and M ⊆ L,
(iv)1N − L = {〈y, νL (y),1 − σL (y), μL (y)〉: y ∈ X} = Lc ,
(v)L ∪ M = {〈y, max⁡
(μL (y), μM (y)), max⁡
(σL (y), σM (y)), min⁡
(νL (y), νM (y))〉
: y ∈ X},
(vi)L ∩ M = {〈y, min⁡
(μL (y), μM (y)), min⁡
(σL (y), σM (y)), max⁡
(νL (y), νM (y))〉
: y ∈ X}.


A neutrosophic topology (briefly, Nt) on a non-empty set X is a family τN of neutrosophic
subsets of X satisfying [(i)]
(i)0N , 1N ∈ τN .
(ii)L1 ∩ L2 ∈ τN for any L1 , L2 ∈ τN .
(iii)⋃ ‍La ∈ τN , ∀ La : a ∈ A ⊆ τN .
Then (X, τN ) is called a neutrosophic topological space (briefly, Nts) in X. The τN

elements are called neutrosophic open sets (briefly, Nos) in X. A NsC is called a neutrosophic
closed sets (briefly, Ncs) iff its complement Cc is Nos.

Let (X, τN ) be Nts on X and L be an Ns on X, then the neutrosophic interior of L
(briefly, Nint(L)) and the neutrosophic closure of L (briefly, Ncl(L)) are defined as
Nint(L) = ⋃ ‍{I: I ⊆ L & 𝐼 𝑖𝑠 𝑎 𝑁𝑜𝑠 𝑖𝑛 𝑋}
Ncl(L) = ⋂ ‍{I: L ⊆ I & 𝐼 𝑖𝑠 𝑎 𝑁𝑐𝑠 𝑖𝑛 𝑋}.

Let (X, τN ) be Nts on X and L be an Ns on X. Then L is said to be a neutrosophic
regular (resp. pre, semi, α&𝛽) open set (briefly, Nros (resp. N𝒫os, N𝒮os, Nαos&𝑁𝛽𝑜𝑠)) if
L = Nint(Ncl(L)) (resp. L ⊆ Nint(Ncl(L)) , L ⊆ Ncl(Nint(L)) ,
L ⊆ Nint(Ncl(Nint(L)))&𝐿 ⊆ 𝑁𝑐𝑙(𝑁𝑖𝑛𝑡(𝑁𝑐𝑙(𝐿)))).
The complement of an N𝒫os (resp. N𝒮os , Nαos , Nros&𝑁𝛽𝑜𝑠 ) is called a
neutrosophic pre (resp. semi, α, regular &𝛽) closed set (briefly, N𝒫cs (resp. N𝒮cs, Nαcs,
Nrcs&𝑁𝛽𝑐𝑠)) in X.
The family of all N𝒫os (resp. N𝒫cs, N𝒮os, N𝒮cs, Nαos, Nαcs, Nβos&𝑁𝛽𝑐𝑠) of X
is denoted by N𝒫OS(X) (resp. N𝒫CS(X) , N𝒮OS(X) , N𝒮CS(X) , NαOS(X) , NαCS(X) ,
NβOS(X)&𝑁𝛽𝐶𝑆(𝑋)).

A set L is said to be a neutrosophic
(i) δ interior of L (briefly, Nδint(L) ) is defined by Nδint(L) = ⋃ ‍{I: I ⊆
L & 𝐼 𝑖𝑠 𝑎 𝑁𝑟𝑜𝑠 𝑖𝑛 𝑋}.

(ii) δ closure of L (briefly, Nδcl(L)) is defined by Nδcl(L) = ⋂ ‍{A: L ⊆

A & 𝐴 𝑖𝑠 𝑎 𝑁𝑟𝑐𝑠 𝑖𝑛 𝑋}.

A set L is said to be a neutrosophic
(i)δ-open set (briefly, Nδos) if L = Nδint(L).
(ii)δ-semi open set (briefly, Nδ𝒮os) if L ⊆ Ncl(Nδint(L)).
The complement of an Nδos (resp. Nδ𝒮os ) is called a neutrosophic δ (resp. δ-semi)

closed set (briefly, Nδcs (resp. Nδ𝒮cs)) in X.
The family of all Nδ𝒮os (resp. Nδ𝒮cs ) of X is denoted by Nδ𝒮OS(X) (resp.

Nδ𝒮CS(X)).

A set K is said to be a neutrosophic
(i)e-open set (briefly, Neos) if K ⊆ Ncl(Nδint(K)) ∪ Nint(Nδcl(K)).
(ii)e-closed set (briefly, Necs) if K ⊇ Ncl(Nδint(K)) ∩ Nint(Nδcl(K)).
The complement of a Neos is called a Necs. The family of all Neos (resp. Necs) of X
is denoted by NeOS(X) (resp. NeCS(X)).
3. Neutrosophic 𝒁-open sets in 𝑵𝒕𝒔

Throughout the sections 3 & 4, let (X, τN ) be any Nts. Let K and M be a Ns‟s in
Nts.
Definition 3.1:
(i) Z-open set (briefly, NZos) if K ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)).
(ii) Z-closed set (briefly, NZcs) if K ⊇ Ncl(Nδint(K)) ∩ Nint(Nδcl(K)).
The complement of a NZos is called a NZcs. The family of all NZos (resp. NZcs) of
X is denoted by NZOS(X) (resp. NZCS(X)).
Definition 3.2 :

(i) Z interior of K (briefly, NZint(K) ) is defined by NZint(K) = ⋃ ‍{A: A ⊆

K & 𝐴 𝑖𝑠 𝑎 𝑁𝑍𝑜𝑠 𝑖𝑛 𝑋}.
(ii) Z closure of K (briefly, NZcl(K) ) is defined by NZcl(K) = ⋂ ‍{A: K ⊆
A & 𝐴 𝑖𝑠 𝑎 𝑁𝑍𝑐𝑠 𝑖𝑛 𝑋}.
Proposition 3.1 :
The statements are hold but the converse does not true.
(i) Every Nδos (resp. Nδcs) is a Nos (resp. Ncs).
(ii) Every Nos (resp. Ncs) is a Nδ𝒮os (resp. Nδ𝒮cs).
(iii) Every Nos (resp. Ncs) is a N𝒫os (resp. N𝒫cs).
(iv) Every Nδ𝒮os (resp. Nδ𝒮cs) is a NZos (resp. NZcs).
(v) Every N𝒫os (resp. N𝒫cs) is a NZos (resp. NZcs).
(vi) Every NZos (resp. NZcs) is a Neos (resp. Necs).
Proof :
The proof of (i), (ii) & (iii) are studied in [14, 15].
(iv) K is a Nδ𝒮os , then K ⊆ Ncl(Nδint(K)) ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)) . ∴ K is a
NZos.
(v)K is a N𝒫os, then K ⊆ Nint(Ncl(K)) ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)). ∴ K is a NZos.
(vi)K is a NZos then K ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)). So K ⊆ Ncl(Nδint(K)) ∪
Nint(Ncl(K)) ⊆ Ncl(Nδint(K)) ∪ Nint(Nδcl(K)). ∴ K is a Neos.
It is also true for their respective closed sets.
Remark 3.1 The diagram shows NZos‟s in fnts.

Example 3.1 Let Y = {a, b, c} and define Ns‟s Y1 , Y2 , Y3 &Y4 in Y are
μa μb μc σa σb σc νa νb νc
Y1 = 〈Y, ( , , ), ( , , ), ( , , )〉,
0.2 0.3 0.4 0.5 0.5 0.5 0.8 0.7 0.6
Y2 = 〈Y, ( , , ), ( , , ), ( , , )〉,
0.1 0.1 0.4 0.5 0.5 0.5 0.9 0.9 0.6
Y3 = 〈Y, ( , , ), ( , , ), ( , , )〉,
0.2 0.2 0.3 0.5 0.5 0.5 0.8 0.8 0.7
Y4 = 〈Y, ( , , ), ( , , ), ( , , )〉
0.2 0.4 0.4 0.5 0.5 0.5 0.8 0.6 0.6
Y5 = 〈Y, ( , , ), ( , , ), ( , , )〉.
0.8 0.7 0.8 0.5 0.5 0.5 0.2 0.3 0.2
Then we have τN = {0N , Y1 , Y2 , 1N } is a Nts in Y, then
(i)Y3 is a N𝒫os but not Nos.
(ii)Y4 is a NZos but not N𝒫os.
(iii)Y5 is a Neos but not NZos.
Example 3.2 Let Y = {a, b, c} and define Ns‟s Y1 , Y2 &Y3 in Y are
Y1 = 〈Y, ( , , ), ( , , ), ( , , )〉,
0.4 0.6 0.5 0.5 0.5 0.5 0.6 0.4 0.5
Y2 = 〈Y, ( , , ), ( , , ), ( , , )〉,
0.6 0.4 0.4 0.5 0.5 0.5 0.4 0.6 0.6
Y3 = 〈Y, ( , , ), ( , , ), ( , , )〉.
0.4 0.5 0.5 0.5 0.5 0.5 0.6 0.5 0.5
Then we have τN = {0N , Y1 , Y2 , Y1 ∪ Y2 , Y1 ∩ Y2 , 1N } is a Nts in Y, then Y3 is a NZos
but not Nδ𝒮os. The other implications are shown in [14].
Theorem 3.1 Let (X, τN ) be a Nts . Then if M ∈ NδOS(X) and M ∈ NZOS(X), then
H ∩ M is NZo.
Proof. Suppose that H ∈ NδOS(X). Then H = Nint δ (H). Since M ∈ NZOS(X), then

M ⊆ Ncl(Nint δ (M)) ∪ Nint(Ncl(M)) and hence

H ∩ M ⊆ Nint δ (H) ∩ (Ncl(Nint δ (M)) ∪ Nint(Ncl(M)))
= (Nint δ (H) ∩ Ncl(Nint δ (M))) ∪ (Nint δ (H) ∩ Nint(Ncl(M)))
⊆ Ncl(Nint δ (H) ∩ (Nint δ (M))) ∪ Nint(Nint(H) ∩ Ncl(M))
⊆ Ncl(Nint δ (H ∩ M)) ∪ Nint(Ncl(H ∩ M)).
Thus H ∩ M ⊆ Ncl(Nint δ (H ∩ M)) ∪ Nint(Ncl(H ∩ M)). Therefore, H ∩ M is NZo.
Proposition 3.2 :
Let (X, τN ) be a Nts. Then the closure of a NZo set of X is N𝒮o.
Proof. Let H ∈ NZOS(X). Then

Ncl(H) ⊆ Ncl(Ncl(Nint δ (H)) ∪ Nint(Ncl(H)))
⊆ Ncl(Nint δ (H)) ∪ Ncl(Nint(Ncl(H)))
= Ncl(Nint(Ncl(H))).
Therefore, Ncl(H) is N𝒮o.
Theorem 3.2 :
The statements are true.
(i)N𝒫cl(K) ⊇ K ∪ Ncl(Nint(K)).
(ii)N𝒫int(K) ⊆ K ∩ Nint(Ncl(K)).
(iii)Nδ𝒮cl(K) ⊇ K ∪ Nint(Nδcl(K)).
(iv)Nδ𝒮int(K) ⊆ K ∩ Ncl(Nδint(K)).
Proof :
(i) Since N𝒫cl(K) is N𝒫cs, we have
Ncl(Nint(K)) ⊆ Ncl(Nint(N𝒫cl(K))) ⊆ N𝒫cl(K).
Thus K ∪ Ncl(Nint(K)) ⊆ N𝒫cl(K).
The other cases are similar.
Theorem 3.3 :
Let K is a NZos iff K = N𝒫int(K) ∪ Nδ𝒮int(K).
Proof : Let K is a NZos. Then K ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)). By Theorem 3.2, we

have
N𝒫int(K) ∪ Nδ𝒮int(K) = K ∩ (Nint(Ncl(K))) ∪ (K ∩ Ncl(Nδint(K)))
= K ∩ (Nint(Ncl(K))) ∪ Ncl(Nδint(K))
= K.
Conversely, if K = N𝒫int(K) ∪ Nδ𝒮int(K) then, by Theorem 3.2
K = N𝒫int(K) ∪ Nδ𝒮int(K)
= (K ∩ Nint(Ncl(K))) ∪ (K ∩ Ncl(Nδint(K)))
= K ∩ (Nint(Ncl(K)) ∪ Ncl(Nδint(K)))
⊆ Nint(Ncl(K)) ∪ Ncl(Nδint(K))
and hence K is a NZos.
Theorem 3.4 :
The union (resp. intersection) of any family of NZOS(X) (resp. NZCS(X) ) is a
NZOS(X)(resp. NZCS(X)).
Proof :
Let {K a : a ∈ τN } be a family of NZos‟s. For each a ∈ τN , K a ⊆ Ncl(Nδint(K a )) ∪
Nint(Ncl(K a )).
⋃a∈τ N ‍K a ⊆ ⋃a∈τ N ‍Ncl(Nδint(K a )) ∪ Nint(Ncl(K a ))
⊆ Ncl(Nδint(∪ K a )) ∪ Nint(Ncl(∪ K a ))
The other case is similar.
Remark 3.2 :
The intersection of two NZos‟s need not be NZos.
Example 3.3 :
Let Y = {a, b} and define Ns‟s Y1 , Y2 &Y3 in Y are
μa μb σa σb νa νb
Y1 = 〈Y, ( , ), ( , ), ( , )〉,
0.2 0.1 0.5 0.5 0.7 0.5
Y2 = 〈Y, ( , ), ( , ), ( , )〉,
0.3 0.5 0.5 0.5 0.7 0.2

Y3 = 〈Y, ( , ), ( , ), ( , )〉.
0.1 0.2 0.5 0.5 0.1 0.1
Then we have τN = {0N , Y1 , 1N } is a Nts in Y, then Y2 &Y3 are NZos but Y2 ∩ Y3 is not
NZos.
Proposition 3.3 :
Let K is a
(i) NZos and Nδint(K) = 0N , then K is a N𝒫os.
(ii)NZos and Ncl(K) = 0N , then K is a Nδ𝒮os.
(iii)NZos and Nδcs, then K is a Nδ𝒮os.
(iv)Nδ𝒮os and Ncs, then K is a NZos.
Proof. :
(i) Let K be a NZos, that is
K ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)) = 0N ∪ Nint(Ncl(K)) =
Nint(Ncl K . Hence K is a N𝒫os.
(ii) Let K be a NZos, that is
K ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)) = Ncl(Nδint(K)) ∪ 0N =
Ncl(Nδint(K))
Hence K is a Nδ𝒮os.
(iii) Let K be a NZos and Nδcs, that is
K ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)) = Ncl(Nδint(K)) ∪ Nint(Ncl(K)) =
Ncl(Nδint(K)).
Hence K is a Nδ𝒮os.
(iv) Let K be a Nδ𝒮os and Ncs, that is
K ⊆ Ncl(Nδint(K)) ⊆ Ncl(Nδint(K)) ∪ Nint(Ncl(K)).Hence K is a NZos.
Theorem 3.5 : Let K be a NZcs (resp. NZos) iff K = NZcl(K) (resp. K = NZint(K)).
Proof :
Suppos K = NZcl(K) =∩ {A: K ⊆ A & 𝐴𝑖𝑠𝑎𝑁𝑍𝑐𝑠} This means K ∈∩ {A: K ⊆
A & 𝐴𝑖𝑠𝑎𝑁𝑍𝑐𝑠} and hence K is NZcs. Conversely, suppose K be a NZcs in X. Then, we
have K ∈∩ {A: K ⊆ A & 𝐴𝑖𝑠𝑎𝑁𝑍𝑐𝑠}. Hence, K ⊆ A implies
K =∩ {A: K ⊆ A & 𝐴𝑖𝑠𝑎𝑁𝑍𝑐𝑠} = 𝑁𝑍𝑐𝑙(𝐾). Similarly for K = NZint(K).

Proposition 3.4 :
Let K and L are in X, then
(i)NZcl(K) = NZint(K), NZint(K) = NZcl(K).
(ii)NZcl(K ∪ L) ⊇ NZcl(K) ∪ NZcl(L), NZcl(K ∩ L) ⊆ NZcl(K) ∩ NZcl(L).
(iii)NZint(K ∪ L) ⊇ NZint(K) ∪ NZint(L), NZint(K ∩ L) ⊆ NZint(K) ∩ NZint(L).
Proof :
(i) The proof is directly from definition.
(ii)K ⊆ K ∪ L or L ⊆ K ∪ L. Hence NZcl(K) ⊆ NZcl(K ∪ L) or NZcl(L) ⊆ NZcl(K ∪
L). Therefore, NZcl(K ∪ L) ⊇ NZcl(K) ∪ NZcl(L). The other one is similar.
(iii)K ⊆ K ∪ L or L ⊆ K ∪ L. Hence NZint(K) ⊆ NZint(K ∪ L) or NZint(L) ⊆
NZint(K ∪ L). Therefore, NZint(K ∪ L) ⊇ NZint(K) ∪ NZint(L). The other one is
similar.
Remark 3.3 :
The equality of (ii) in Proposition 3.4 can not be true in the given example.
Example 3.4 :
Let Y = {a, b, c, d} and define Ns‟s Y1 , Y2 , Y3 &Y4 in Y are
μa μb μc μd σa σb σc σd νa νb νc νd
Y1 = 〈Y, ( , , , ), ( , , , ), ( , , , )〉,
1 0 0.2 0 0.5 0.5 0.5 0.5 0 1 0.7 1
Y2 = 〈Y, ( , , , ), ( , , , ), ( , , , )〉,
0 1 0 0 0.5 0.5 0.5 0.5 1 0 1 0.1
Y3 = 〈Y, ( , , , ), ( , , , ), ( , , , )〉,
1 0 0 1 0.5 0.5 0.5 0.5 0 0.2 0 0
Y4 = 〈Y, ( , , , ), ( , , , ), ( , , , )〉.
0 0.9 0.3 1 0.5 0.5 0.5 0.5 1 0 0.2 0
Then we have τN = {0N , Y1 , Y2 , Y1 ∩ Y2 , 1N } is a Nts in Y, then NZcl(Y3 ∪ Y4 ) ≠
NZcl(Y3 ) ∪ NZcl(Y4 ).

Proposition 3.5 :
Let K be a neutrosophic set in a neutrosophic topological space X. Then Nint(K) ⊆
NZint(K) ⊆ K ⊆ NZcl(K) ⊆ Ncl(K).
Proof. It follows from the definitions of corresponding operators.
Theorem 3.6 :
Let K and L in X, then the NZint sets have
(i)NZcl(0N ) = 0N , NZcl(1N ) = 1N .
(ii)NZcl(K) is a NZcs in X.
(iii)NZcl(K) ⊆ NZcl(L) if K ⊆ L.
(iv)K ⊆ NZcl(K).
(v)K is NZc set in X ⇔ NZcl(K) = K.
(vi)NZint(NZint(K)) = NZint(K).
Proof :
The proofs (i) to (iv) and (vi) are directly from definitions of NZcl set.
(v) Let K be NZc set in X. By using Proposition 3.4, K is NZo set in X. By Proposition 3.4,
NZint(K) = K ⇔ NZcl(K) = K ⇔ NZcl(K) = K.
Theorem 3.7 :
Let K and L in X, then the NZint sets have
(i)NZint(0N ) = 0N , NZint(1N ) = 1N .
(ii)NZint(K) is a NZos in X.
(iii)NZint(K) ⊆ NZint(L) if K ⊆ L.
(iv)NZint(NZint(K)) = NZint(K).
Proof :
The proofs are directly from definitions of NZint set.
Proposition 3.6 :
If K and L is in X, then
(i)NZcl(K) ⊇ K ∪ NZcl(NZint(K)).
(ii)NZint(K) ⊆ K ∩ Nint(NZcl(K)).

(iii)Nint(NZcl(K)) ⊇ Nint(NZcl(NZint(K))).
Proof :
(i) By Theorem 3.6 K ⊆ NZcl(K) → (1). Again using Theorem 3.6, NZint(K) ⊆ K.
Then NZcl(NZint(K)) ⊆ NZcl(K) → (2). By (1) and (2) we have,
K ∪ NZcl(NZint(K)) ⊆ NZcl(K).
(ii) By Theorem 3.6, NZint(K) ⊆ K → (1). Again using Theorem 3.6, K ⊆ NZint(K).
Then NZint(K) ⊆ NZint(NZcl(K) → (2). By (1) and (2) we have, NZint(K) ⊆ K ∪
NZint(NZcl(K)).
(iii) By Theorem 3.6, NZcl(K) ⊆ Ncl(K), we get Nint(NZcl(K)) ⊆ Nint(Ncl(K)).
Hence (iii).
(iv) By (i), NZcl(K) ⊇ K ∪ NZ(NZint(K)) . We have, Nint(NZcl(K)) ⊇ Nint(K ∪
NZcl(NZint(K))) . Since Nint(K ∪ L) ⊇ Nint(K) ∪ Nint(L) , Nint(NZcl(K)) ⊇
Nint(K) ∪ Nint(NZcl(NZint(K))) ⊇ Nint(NZcl(NZint(K))).
4. Conclusion :-
We have studied about neutrosophic Z-open set and neutrosophic Z-closed set and their
respective interior and closure operators of neutrosophic topological space in this chapter. Also
studied some of their fundamental properties along with examples in Nts. Also, we have
discussed a near open sets of neutrosophic Z-open sets in Nts. In future, we can be extended to
neutrosophic Z continuous mappings, neutrosophic Z -open mappings and neutrosophic
Z-closed mappings in Nts.
References :-
[1] I. Arokiarani, R. Dhavaseelan, S. Jafari and M. Parimala, On some new notions and
functions in neutrosophic topological spaces, Neutrosophic Sets and Systems, 16 (2017),
16-19.
[2] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20 (1986), 87-96.
[3] V. Chandrasekar, D. Sobana and A. Vadivel, On Fuzzy e-open Sets, Fuzzy e-continuity
and Fuzzy e -compactness in Intuitionistic Fuzzy Topological Spaces, Sahand
Communications in Mathematical Analysis (SCMA), 12 (1) (2018), 131-153.
[4] C. L. Chang, Fuzzy topological spaces, J. Math. Anal. Appl., 24 (1968), 182-190.

[5] D. Coker, An introduction to intuitionistic fuzzy topological spaces, Fuzzy sets and
systems, 88 (1997), 81-89.
[6] Erdal Ekici, On e-open sets, 𝒟𝒫 ⋆ -sets and 𝒟𝒫ϵ⋆ -sets and decomposition of continuity,
The Arabian Journal for Science and Engineering, 33 (2A) (2008), 269-282.
[7] A. I. El-Magharabi and A. M. Mubarki, Z-open sets and Z-continuity in topological
spaces, International Journal of Mathematical Archive, 2 (10) (2011), 1819-1827.
[8] A. A. Salama and S. A. Alblowi, Neutrosophic set and neutrosophic topological spaces,
IOSR Journal of Mathematics, 3 (4) (2012), 31-35.
[9] A. A. Salama and F. Smarandache, Neutrosophic crisp set theory, Educational Publisher,
Columbus, Ohio, USA, 2015.
[10] V. Seenivasan and K. Kamala, Fuzzy e-continuity and fuzzy e-open sets, Annals of
Fuzzy Mathematics and Informatics, 8 (2014), 141-148.
[11] F. Smarandache, A Unifying field in logics: neutrosophic logic. neutrosophy,
neutrosophic set, neutrosophic probability, American Research Press, Rehoboth, NM, (1999).
[12] F. Smarandache, Neutrosophy and neutrosophic logic, First International Conference
on Neutrosophy, Neutrosophic Logic, Set, Probability, and Statistics, University of New
[13] Supriti Saha, Fuzzy δ-continuous mappings, Journal of Mathematical Analysis and
Applications, 126 (1987), 130-142.
[14] A. Vadivel, C. John Sundar and P. Thangaraja, Neutrosophic e -open sets in a
topological spaces, Submitted.
[15] V. Venkateswara Rao and Y. Srinivasa Rao, Neutrosophic pre-open sets and pre-closed
sets in Neutrosophic topology, International Journal of Chem Tech Research, 10 (10) (2017),
449-458.
[16] L. A. Zadeh, Fuzzy sets, Information and control, 8 (1965), 338-353.

CHAPTER-14
NEUTROSOPHIC Gb-CLOSED SETS AND NEUTROSOPHIC

Gb-CONTINUITY
C.Maheswari1,M Sathyabama2 S. Chandrasekar3*
1
Department of Mathematics,Muthayammal College of Arts and Science,
Rasipuram,Namakkal(DT),Tamil Nadu, India.
E-mail: mahi2gobi@gmail.com
2 Department of Mathematics, Periyar University Constituent College of Arts and
Science,Idappadi,Salem(DT),Tamilnadu, India
E-mail: sathyachezian@gmail.com
3
PG and Research Department of Mathematics,
3
.Arignar Anna Government Arts College,Namakkal(DT),Tamil Nadu, India.
E-mail: chandrumat@gmail.com
1. Introduction :-
Smarandache’sneutrosophic system have wide range of real time applications for the
fields of Computer Science ,Information Systems, Applied Mathematics , Artificial
Intelligence, Mechanics, decision making. Medicine, Electrical & Electronic, and
Management Science etc,.Topology is a classical subject, as a generalization topological
spaces many type of topological spaces introduced over the year.Smarandache [9] defined
the Neutrosophic set on three component Neutrosophic sets(TTruth, F -Falsehood ,I-
Indeterminacy). Neutrosophic topological spaces(N-T-S) introduced by Salama [17]etal.,
R.Dhavaseelan[6],SaiedJafari are introduced Neutrosophic generalized closed
sets.Neutrosophic b closed sets are introduced C.Maheswari[14] et al.Aim of this chapter is
we introduce and study about Neutrosophic generalized b closed sets and Neutrosophic
generalized b continuity in Neutrosophic topological spaces and its properties and
Characterization are discussed details..
2. Preliminaries :
In this section, we recall needed basic definition and operation of Neutrosophic sets

and its fundamental Results

Let X be a non-empty fixed set. A Neutrosophic set P is an object having the form
P = {< 𝑥, μP x , σP x , γP (x) >: 𝑥 ∈ 𝑋},
μP x -represents the degree of membership function
σP x -represents degree indeterminacy and then
γP (x)-represents the degree of non-membership function

Neutrosophic set P = {< 𝑥, μP x , σP x , γP (x) >: 𝑥 ∈ 𝑋}, on X and ∀x ∈ X then
complement of P isP C = {< 𝑥, γP (x), 1 − σP x , μP x >: 𝑥 ∈ 𝑋}

Let P and Q are two Neutrosophic sets, ∀x ∈ X
P = {< 𝑥, μP x , σP x , γP (x) >: 𝑥 ∈ 𝑋}
Q = {< 𝑥, μQ x , σQ x , γQ (x) >: 𝑥 ∈ 𝑋}
Then P ⊆ Q ⇔ μP x ≤ μQ x , σP x ≤ σQ x & γP (x) ≥ γQ (x)}
Definition 2.4 [9]:

Let X be a non-empty set, and Let P and Q be two Neutrosophic sets are
P = {< 𝑥, μP x , σP x , γP (x) >: 𝑥 ∈ 𝑋}, Q = {< 𝑥, μQ x , σQ x , γQ (x) >: 𝑥 ∈ 𝑋}Then
1. P ∩ Q = {< 𝑥, μP x ∩ μQ x , σP x ∩ σQ x , γP (x) ∪ γQ (x) >: 𝑥 ∈ 𝑋}
2. P ∪ Q = {< 𝑥, μP x ∪ μQ x , σP x ∪ σQ x , γP (x) ∩ γQ (x) >: 𝑥 ∈ 𝑋}

Let X be non-empty set and τN be the collection of Neutrosophic subsets of X
satisfyingthe following properties :
1.0N , 1N ∈ τN
2.T1 ∩ T2 ∈ τN for any T1 , T2 ∈ τN
3. ∪ Ti ∈ τN for every {Ti : i ∈ j} ⊆ τN
Then the space (X, τN ) is called a Neutrosophic topological space(N-T-S). The element of

τN are called Neu-OS (Neutrosophic open set) and its complement is Neu-CS(Neutrosophic
closed set)
Example 2.6 :
Let X ={x} and ∀x ∈ X
6 6 5 5 7 9
A1 = 〈x, 10 , 10 , 10 〉,A2 = 〈x, 10 , 10 , 10 〉
6 7 5 5 6 9
A3 = 〈x, 10 , 10 , 10 〉 ,A4 = 〈x, 10 , 10 , 10 〉
Then the collection τN = {0N , A1 , A2 , A3 , A4, 1N } is called a N-T-S on X.
Definition 2.7 :
Let (X, τN )be a N-T-S and P = {< 𝑥, μP x , σP x , γP (x) >: 𝑥 ∈ 𝑋} be a
Neutrosophic set in X. Then P is said to be
1. Neutrosophic b closed set [14] (Neu-bCS in short) if
Neu-cl(Neu-int(P))∩Neu-int(Neu-cl(P))⊆P,
2. Neutrosophicα-closed set [2] (Neu- αCS in short) if Neu-cl(Neu-int(Neu-cl(P)))⊆P,
3. Neutrosophicpre-closed set [20] (Neu-Pre-CS in short) if Neu-cl(Neu-int(P))⊆P,
4. Neutrosophic regular closed set [9] (Neu-RCS in short) if Neu-cl(Neu-int(P)) = P,
5. Neutrosophic semi closed set [11] (Neu-SCS in short) if Neu-int(Neu-cl(P))⊆P,
6. Neutrosophic generalized closed set [6] (Neu-GCS in short) if Neu-cl(P⊆H
whenever P⊆H and H is an Neu-OS,
7. Neutrosophic generalized pre closed set [13] (Neu-GPCS in short) if Neu-Pcl(P) ⊆
H whenever P⊆H and H is an Neu-OS,
8. Neutrosophicα generalized closed set [12] (Neu- αGCS in short) if Neu α-cl(P)⊆H
whenever P⊆H and H is an Neu-OS,
9. Neutrosophic generalized semi closed set [19](Neu-GSCS in short) if Neu-Scl(P)⊆H
whenever P⊆H and H is an Neu-OS.
Definition 2.8.[9]:
(X, τN )be a N-T-S and P = {< 𝑥, μP x , σP x , γP (x) >: 𝑥 ∈ 𝑋} be a Neutrosophic set
in X. Then Neutrosophic closure of P is Neu-Cl(P)=∩{H:H is a Neu-CS in X and P⊆H}
Neutrosophic interior of P is Neu-Int(P)=∪{M:M is a Neu-OS in X and M⊆P}.

Let (X, τN )be a N-T-S and P = {< 𝑥, μP x , σP x , γP (x) >: 𝑥 ∈ 𝑋} be a Neutrosophic
set in X. Then the Neutrosophic b closure of P ( Neu-bcl(P)in short) and Neutrosophic b
interior of P (Neu-bint(P) in short) are defined as
Neu-bint(P)= ∪{ G/G is a Neu-bOS in X and G⊆P},

Neu-bcl(P)= ∩{ K/K is a Neu-bCS in X and P⊆K }.
Proposition 2.10 :
Let (X, τN ) be any N-T-S. Let P and Q be any two Neutrosophic sets in (X, τN ).Then
the Neutrosophic generalized b closure operator satisfies the following properties.
1. Neu-bcl(0N)=0N and Neu-bcl(1N) = 1N,
2. P⊆Neu-bcl(P),
3. Neu-bint(P)⊆P,
4. If P is a Neu-bCS then P=Neu-bcl(Neu-bcl(P)),
5. P⊆Q⇒Neu-bcl(P) ⊆Neu-bcl(Q),
6. P⊆Q⇒Neu-bint(P)⊆Neu-bint(Q).
3. Neutrosophic Generalized b Closed Sets :
Definition 3.1 :
A Neutrosophic set P in a N-T-S (X, τN ) is said to be a Neutrosophic generalized b
closed set(Neu-GbCS in short) if Neu-bcl(P) ⊆H whenever P⊆H and H is a Neu-OS in
(X, τN ).The family of all Neu-GbCSs of a N-T-S (X, τN ) is denoted by Neu-gbC(X).
Example 3.2 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } isbe a N.T.on X where
2 5 8 3 5 7
E1 = 〈x, , , , , , 〉. Then the Neutrosophic set
10 10 10 10 10 10
7 5 3 6 5 4
P = 〈x, , , , , , 〉is a Neu-GbCS in X.
10 10 10 10 10 10

Example 3.3 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N }isbe a N.T.on X. where
6 5 3 8 5 2
10 10 10 10 10 10
6 5 4 3 5 7
P = 〈x, , , , , , 〉is not a Neu-GbCS in X.
10 10 10 10 10 10
Theorem 3.4 :
Every Neu-CS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ). Since P is a Neu-CS and Neu-bcl(P) ⊆Neu-cl(P),
Neu-bcl(P) ⊆Neu-cl(P)=P⊆H. Therefore P is a Neu-GbCS in X.
Example 3.5 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } isbe a N.T. on X .where
3 5 6 2 5 7
10 10 10 10 10 10
5 5 4 6 5 3
P = 〈x, , , , , , 〉 is a Neu-GbCS but not a Neu-CS in X, since Neu-cl(P)=E1≠P
10 10 10 10 10 10
Theorem 3.6 :
Every Neu-αCS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ). Since P is a Neu-αCS, Neu-αcl(P)= P. Therefore
Neu-bcl(P) ⊆Neu-αcl(P)=P⊆H. Hence P is a Neu-GbCS in X.
Example 3.7 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } isbe a N.T. on X .where
3 5 6 2 5 8
10 10 10 10 10 10
5 5 3 6 5 3
P = 〈x, , , , , , 〉is a Neu-GbCS but not a Neu-αCS in X, since
10 10 10 10 10 10
Neu-cl(Neu-int(Neu-cl(P)))=E1 C ⊈ P.

Theorem 3.8 :
Every Neu-Pre-CS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ).Since P is a Neu-Pre-CS,Neu-cl(Neu-int(P)) ⊆P.
Therefore Neucl(Neu-int(P))∩Neu-int(Neu-cl(P) ⊆Neu-cl(P)∩Neu-cl(Neu-int(P) ⊆P. This
implies Neu-bcl(P) ⊆H. Hence Pis a Neu-GbCS in X.
Example 3.9 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } is be a
9 5 8 3 5 7
N.T.onX.whereE1 = 〈x, , , , , , 〉. Then the Neutrosophic set P =
10 10 10 10 10 10
4 5 6 5 5 5
〈x, , , , , , 〉is a Neu-GbCS but not a Neu-pre closed set in X, since
10 10 10 10 10 10
Neu-cl(Neu-int(P))=E1 C ⊈ P.
Theorem 3.10 :
Every Neu-bCS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ). Since P is a Neu-bCS,Neu-bcl(P)=P. Therefore
Neu-bcl(P)=P ⊆ H. Hence P is a Neu-GbCS in X.
Example 3.11 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } is be a N.T.on X .where
6 5 4 8 5 2
E1 = 〈x, , , , , , 〉.Then the Neutrosophic set
10 10 10 10 10 10
8 5 2 9 5 1
P = 〈x, , , , , , 〉is a Neu-GbCS but not a Neu-bCS in X, since
10 10 10 10 10 10
Neu-cl(Neu-int(P))∩ Neu-int(Neu-cl(P))=1N⊈ P.
Theorem 3.12 :
Every Neu-RCS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ). Since P is a Neu-RCS , Neu-cl(Neu-int(P))=P. This
impliesNeu-cl(P)=Neu-cl(Neu-int(P)). Therefore Neu-cl(P)=P. Hence P is a Neu-CS in X. By
theorem 3.4, P is aNeu-GbCS in X.

Example 3.13 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } is be a N.T.on X
2 5 8 4 5 6
whereE1 = 〈x, , , , , , 〉.Then the Neutrosophic set
10 10 10 10 10 10
7 5 3 5 5 5
P = 〈x, , , , , , 〉
10 10 10 10 10 10
is a Neu-GbCS but not a Neu-RCS in X, since Neu-cl(Neu-int(P))=E1C≠ P.
Theorem 3.14 :
Every Neu-GCS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ). Since P is a Neu-GCS, Neu-cl(P) ⊆H. Therefore
Neu-bcl(P) ⊆Neu-cl(P), Neu-bcl(P)⊆H. Hence P is a Neu-GbCS in X.
Example 3.15 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } is be a N.T.on X. where
2 5 8 4 5 6
10 10 10 10 10 10
1 5 8 3 5 7
P = 〈x, , , , , , 〉is a Neu-GbCS but not a Neu-GCS in X, since Neu-cl(P)=E1C ⊈
10 10 10 10 10 10
E1 .
Theorem 3.16:
Every Neu-αGCS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ).Since P is a Neu-αGCS, Neu-αcl(P)⊆H.Therefore
Neubcl(P) ⊆ Neu-αcl(P), Neu-bcl(P)⊆H. Hence P is a Neu-GbCS in X.
Example 3.17:
Let X = {p1 , p2 }τN = {0N , E1 , 1N } is be a N.T.on X.where
5 5 4 5 5 5
10 10 10 10 10 10
5 5 5 3 5 7
P = 〈x, , , , , , 〉is a Neu-GbCS but not a Neu-αGCS in X, since
10 10 10 10 10 10
Neu-cl(Neu-int(Neu-cl(A)))=1N ⊈ E1

Theorem 3.18:
Every Neu-GPCS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ). Since P is a Neu-GPCS, Neu-Pcl(P)⊆H. Therefore
Neubcl(P) ⊆ Neu-Pcl(P), Neu-bcl(P) ⊆ H. Hence P is a Neu-GbCS in X.
Example 3.19 :
Let X = {p1 , p2 }τN = {0N , E1 , E2 , 1N } is be a
2 5 8 3 5 7 4 5 6 5 5 5
N.T.onX.whereE1 = 〈x, , , , , , 〉,E2 = 〈x, , , , , , 〉Then the
10 10 10 10 10 10 10 10 10 10 10 10
Neutrosophic set
4 5 6 5 5 5
P = 〈x, , , , , , 〉is a Neu-GbCS but not a Neu-Gp closed set in X, since
10 10 10 10 10 10
Neu-Pcl(P)=E2C ⊈ E2 .
Theorem 3.20 :
Every Neu-SCS is a Neu-GbCS but not conversely.
Proof :
Let P⊆H and H is a Neu-OS in (X, τN ).Since P is a Neu-SCS, Neu-bcl(P) ⊆ Neu-Scl(P) ⊆
H. ThereforeP is a Neu-GbCS in X.
Example 3.21 :
9 5 1 7 5 2
10 10 10 10 10 10
7 5 3 6 5 4
P = 〈x, , , , , , 〉
10 10 10 10 10 10
is a Neu-GbCS but not a Neu-SCS in X, since Neu-int(Neu-cl(P))=1N ⊈ P
Theorem 3.22 :
Every Neu-GSCS is a Neu-GbCS but not conversely.
Proof : Obivious
Example 3.23 :

8 5 6 0 5 1
10 10 10 10 10 10
6 5 5 2 5 3
P = 〈x, , , , , , 〉 is a Neu-GbCS but not a Neu-GSCS in X, since
10 10 10 10 10 10
Neu-int(Neu-cl(P))=1N ⊈ P. The following implications are true:
Theorem 3.24 :
The union of any two Neu-GbCSs need not be a Neu-GbCS in general as seen from the
following example.
Example 3.25:
Let X = {p1 , p2 }τN = {0N , E1 , 1N } is be a N.T.on X where
6 5 4 8 5 2
10 10 10 10 10 10
1 5 9 8 5 2
P = 〈x, , , , , , 〉,
10 10 10 10 10 10
6 5 4 7 5 3
Q = 〈x, , , , , , 〉is a are Neu-GbCSs but P∩Q is not a Neu-GbCS in X, since
10 10 10 10 10 10
Neu-bcl(P∩Q) =1N ⊈ E1
Theorem 3.26:
If P is a Neu-GbCS in (X, τN ).such that P⊆Q⊆Neu-bcl(P) then Q is a Neu-GbCS in
(X, τN ).
Proof :
Let Q be a Neutrosophic set in a N-T-S (X, τN ).such that Q⊆H and H is a Neu-OS in X.
This implies P ⊆ H. Since P is a Neu-GbCS, Neu-bcl(P)⊆H. By hypothesis, we have
Neu-bcl(Q)⊆Neu-bcl(Neu-bcl(P))= Neu-bcl(P)⊆H. Hence Q is a Neu-GbCS in X.

Theorem 3.27 :
If P is Neutrosophic b open and Neutrosophic generalized b closed in a N-T-S
(X, τN ).then Pis Neutrosophic b closed in (X, τN ).
Proof :
Since P is Neutrosophic b open and Neutrosophic generalized b closed in (X, τN ).,
Neu-bcl(P)⊆P. butP ⊆ Neu-bcl(P). Thus Neu-bcl(P)=P and hence P is Neutrosophic b
closed in (X, τN ).
4. Neutrosophic generalized b open sets :

In this section, we introduce Neutrosophic generalized b open sets in Neutrosophic
topological space and study some of their properties.
Definition 4.1 :
A Neutrosophic set P is said to be a Neutrosophic generalized b open set (Neu-GbOS
in short)in(X, τN ).if the complement PC is a Neu-GbCS in X. The family of all Neu-GbOSs of a
N-T-S (X, τN )isdenoted by Neu-GbO (X).
Example 4.2 :
Let X = {p1 , p2 }τN = {0N , E1 , 1N } is be a N.T.onX
3 5 7 4 5 6
,whereE1 = 〈x, 10 10 10
, , , 10 10 10
, , 〉.Then the Neutrosophic set
4 5 6 5 5 5
P = 〈x, , , , , , 〉 is a Neu-GbOS in X.
10 10 10 10 10 10
Theorem 4.3 :
For any N-T-S (X, τN )., we have the following:
1. Every Neu-OS is a Neu-GbOS.
2. Every Neu-bOS is a Neu-GbOS.
3. Every Neu-αOS is a Neu-GbOS.
4. Every Neu-GOS is a Neu-GbOS.
5. Every Neu-GPOS is a Neu-GbOS.
Proof:
Straight forward. The converse part of the above results need not be correct in

common as seen from using following examples.
Example 4.4:
4 5 5 3 5 4
10 10 10 10 10 10
4 6 6 4 5 5
P = 〈x, , , , , , 〉 is a Neu-GbOS but not a Neu-OS in X.
10 10 10 10 10 10
Example 4.5 :
6 5 4 8 5 2
10 10 10 10 10 10
2 5 8 1 5 9
P = 〈x, , , , , , 〉 is a Neu-GbOS but not a Neu-bOS in X.
10 10 10 10 10 10
Example 4.6 :
3 5 6 2 5 8
10 10 10 10 10 10
3 5 5 3 5 6
P = 〈x, , , , , , 〉 is a Neu-GbOS but not a Neu-bOS in X.
10 10 10 10 10 10
Example 4.7 :
2 5 7 4 5 6
10 10 10 10 10 10
8 5 0 7 5 3
P = 〈x, , , , , , 〉is a Neu-GbOS but not a Neu-GOS in X.
10 10 10 10 10 10
Example 4.8 :
Let X = {p1 , p2 }τN = {0N , E1 , E2 , 1N } is be a N.T.on X where
2 5 8 3 5 7 4 5 6 5 5 5
E1 = 〈x, , , , , , 〉 , E2 = 〈x, , , , , , 〉.Then the Neutrosophic
10 10 10 10 10 10 10 10 10 10 10 10
6 5 4 5 5 5
set P = 〈x, , , , , , 〉 is a Neu-GbOS but not a Neu-GPOS in X.
10 10 10 10 10 10
The intersection of any two Neu-GbOSs need not be a Neu-GbOS in general
Example 4.9 :


6 5 3 8 5 2
whereE1 = 〈x, , , , , , 〉,.Then the Neutrosophic sets
10 10 10 10 10 10
6 5 3 9 5 1 7 5 2 8 5 2
P = 〈x, , , , , , 〉 and Q = 〈x, , , , , , 〉are Neu-GbOSs but
10 10 10 10 10 10 10 10 10 10 10 10
P∩Q is not a Neu-GbOS in X.
Theorem 4.10 :
A Neutrosophic set P of a N-T-S (X, τN )., is a Neu-GbOS if and only if H⊆Neu-bint(P)
wheneverH is a Neu-CS and H⊆P.
Proof :
Necessity: Suppose P is a Neu-GbOS in X. Let G be a Neu-CS and H⊆P. Then FC is a
Neu-OS in Xsuch that PC⊆HC. Since PC is a Neu-GbCS, Neu-bcl(PC) ⊆HC.Hence
(Neu-bint(P))C⊆HC . This impliesH⊆Neu-bint(P).
Sufficiency:
Let P be any Neutrosophic set of X and let H⊆Neu-bint(P) whenever H is a Neu-CS and
H⊆P.Then P⊆HC and HC is a Neu-OS. By hypothesis, (Neu-bint(P))C⊆HC . Hence
Neu-bcl(PC) ⊆HC . Hence Pis a Neu-GbOS in X.
Theorem 4.11:
If P is a Neu-GbOSin (X, τN )., such that Neu-bint(P) ⊆Q⊆P then Q is a Neu-GbOS in
(X, τN )
Proof :
By hypothesis, we have Neu-bint(P)⊆Q⊆P. This implies PC⊆QC⊆(Neu-bint(P))C. That
is, PC⊆QC⊆Neubcl(PC). Since PC is a Neu-GbCS, by theorem 3.26, QC is a Neu-GbCS. Hence Q
is a Neu-GbOS in X.
5. Applications of Neutrosophic Generalized b Closed Sets :-

In this section, we introduce NeutrosophicbU1 2 spaces, Neutrosophic gbU1 2
spaces and Neutrosophic gbUb spaces in Neutrosophic topological space and study
some of their properties.

Definition 5.1 :
A N-T-S (X, τN )., is called a Neutrosophic bU1 2 space (Neu- bU1 2 space in short)
if everyNeu-bCS in X is a Neu-CS in X.
Definition 5.2 :
A N-T-S (X, τN )., is called a Neutrosophic gbU1 2 space (Neu-gbU1 2 space in
short) if everyNeu-GbCS in X is a Neu-CS in X.
Definition 5.3 :
A N-T-S (X, τN )., is called a Neutrosophic gbUb space (Neu- gbUb space in short) if
every Neu-GbCS in X is a Neu-bCS in X.
Theorem 5.4 :
Every Neu-gbU1 2 space is a Neu- gbUb space.
Proof :
Let (X, τN )be a Neu-gbU1 2 space and let P be a Neu-GbCS in X. By hypothesis, P is
a Neu-CS in X.Since every Neu-CS is a Neu-bCS, P is a Neu-bCS in X. Hence (X, τN )., is a
Neu- gbUb space.
The converse of the above theorem need not be true in general as seen from the following
example.
Example 5.5:
9 5 9 1 5 1
whereE1 = 〈x, , , , , , 〉,.Then the Neutrosophic set
10 10 10 10 10 10
2 5 3 8 5 7
P = 〈x, , , , , , 〉is a Neu- gbUb space but not a Neu-gbU1 2 space,
10 10 10 10 10 10
Theorem 5.6 :
Let (X, τN )., be a N-T-S and (X, τN ).,a Neu-gbU1 2 space. Then the following
statements hold.
1. Any union of Neu-GbCS is a Neu-GbCS.
2. Any intersection of Neu-GbOS is a Neu-GbOS.

Proof :
1. Let {𝐴𝑖 }𝑖∈𝑗 be a collection of Neu-GbCS in a Neu-gbU1 2 space (X, τN )., Therefore every
Neu-GbCS isa Neu-CS. but the union of Neu-CS is a Neu-CS. Hence the union of Neu-GbCS is
a Neu-GbCS in X.
2. It can be proved by taking complement in (1).
Theorem 5.7 :
A N-T-S (X, τN )., is a Neu- gbUb space if and only if Neu-Gb(X)=Neu-bO(X).
Proof Necessity:
Let P be a Neu-GbOS in X. Then PC is a Neu-GbCS in X. By hypothesis, PC is a Neu-bCS
in X. Therefore P is a Neu-bOS in X. Hence Neu-GbO (X)=Neu-bO(X).
Sufficiency:
Let P be a Neu-GbCS in X. Then PC is a Neu-GbOS in X. By hypothesis, PC is a Neu-bOS
in X. Therefore P is a Neu-bCS in X. Hence(X, τN )., is a Neu- gbUb space.
Theorem 5.8 :
A N-T-S (X, τN ) is a Neu-gbU1 2 space if and only if Neu-GbO(X) = Neu-O(X).
Proof Necessity:
Let P be a Neu-GbOS in X. Then PC is a Neu-GbCS in X. By hypothesis, PC is a Neu-CS in
X. Therefore P is a Neu-OS in X. Hence Neu-GbO(X)=Neu-O(X).
Sufficiency:
Let P be a Neu-GbCS in X.Then PC is a Neu-GbOS in X. By hypothesis, PC is a Neu-OS in
X. Therefore P is a Neu-CS in X. Hence (X, τN ) is a Neu-gbU1 2 space.
5. Neutrosophic generalized b continuity mapping :

In this section we have introduced Neutrosophic generalized b continuity mapping
and studied some of itsproperties.
Definition 6.1 :
A mapping f: (X, τN ) → (Y, σN )is called a Neutrosophic generalized b continuity

(Neu-Gbcontinuity in short) if f-1(Q) is a Neu-Gb CS in (X, τN )for every Neu-CS Q of

(Y, σN ).
Example 6.2 :
Let
2 5 4 3 5 7
X = p1 , p2 , Y = q1 , q 2 , E1 = 〈x, , , , , , 〉 E2 =
10 10 10 10 10 10
3 5 7 4 5 6
〈x, , , , , , 〉, τN = {0N , E1 , 1N } and σN = {0N , E2 , 1N } are N-T-S on X
10 10 10 10 10 10
and Y respectively. Define a mapping f: (X, τN ) → (Y, σN ) by f(p1)=q1 and f(p2)=q2 .Then f
is a Neu-Gb continuity mapping.
Theorem 6.3 :
Every Neutrosophiccontinuity mapping is a Neu-Gb continuity mapping but not
conversely.
Proof.Let f: (X, τN ) → (Y, σN ) be a Neutrosophic continuity mapping. Let P be a Neu-CS

in Y. Since f isNeutrosophiccontinuity mapping, f-1(P) is a Neu-CS in X. Since every Neu-CS is
a Neu-GbCS, f-1(P) is aNeu-Gb CS in X. Hence f is a Neu-Gb continuity mapping
Example 6.4 :
Let
3 5 6 2 5 7
X = p1 , p2 , Y = q1 , q 2 , E1 = 〈x, , , , , , 〉 E2 =
10 10 10 10 10 10
4 5 5 3 5 6
〈x, , , , , , 〉,
10 10 10 10 10 10
τN = {0N , E1 , 1N }andσN = {0N , E2 , 1N } are N-T-S on X and Y respectively. Define a

mapping
f: (X, τN ) → (Y, σN )by f(p1)=q1 and f(p2)=q2 .The Neutrosophic
5 5 4 6 5 3
set P = 〈x, , , , , , 〉 is Neu-CS in Y. Then f-1(P) is Neu-GbCS in X but not
10 10 10 10 10 10
Neu-CS in X. Therefore, f is a Neu-Gb continuity mapping but not a Neutrosophiccontinuity

mapping.
Example 6.8 :
Let
2 5 8 4 5 6
X = p1 , p2 , Y = q1 , q 2 , E1 = 〈x, , , , , , 〉 E2 =
10 10 10 10 10 10

3 5 7 5 5 5
10 10 10 10 10 10
and Y respectively. Define a mappingf: (X, τN ) → (Y, σN ) by f(p1)=q1 and f(p2)=q2 .The
7 5 3 5 5 5
Neutrosophic set P = 〈x, , , , , , 〉 is Neu-CS in Y. Then f-1(P) is Neu-Gb CS
10 10 10 10 10 10
in X but not Neu-RCS in X. Then f is Neu-Gb continuity mapping but not a Neu-R continuity
mapping.
Theorem 6.9 :
Every Neu-GS continuity mapping is a Neu-Gb continuity mapping but not
conversely.
Proof :
Let f: (X, τN ) → (Y, σN ) be a Neu-GS continuity mapping. Let P be a Neu-CS in Y.
Then by hypothesisf-1(P) is a Neu-GCS in X. Since every Neu-GSCS is a Neu-Gb CS, f-1(P) is a
Neu-GbCS in X. Hence f is aNeu-Gb continuity mapping
Example 6.10 :
Let
5 5 2 6 5 2
X = p1 , p2 , Y = q1 , q 2 , E1 = 〈x, , , , , , 〉 E2 =
10 10 10 10 10 10
6 5 3 6 5 2
10 10 10 10 10 10
3 5 6 2 5 6
Neutrosophic set P = 〈x, , , , , , 〉 is Neu-CS in Y. Then f-1(P) is Neu-Gb CS
10 10 10 10 10 10
in X but not Neu-GSCS in X. Then f is Neu-Gb continuity mapping but not a Neu-GS
continuity mapping.
Theorem 6.11 :
EveryNeu-αGcontinuity mapping is a Neu-Gb continuity mapping but not conversely.
Proof :
Let f: (X, τN ) → (Y, σN ) be anNeu-αGcontinuity mapping. Let P be a Neu-CS in Y.
Then, by

hypothesis f-1(P) is a Neu- αgcsin X. Since, every Neu- αGCS is a Neu-GSCS and every
Neu-GSCS is aNeu-GbCS, f-1(P) is a Neu-Gb CS in X. Hence f is a Neu-Gb continuity mapping.
Example 6.12 :
Let
5 5 4 5 5 5
X = p1 , p2 , Y = q1 , q 2 , E1 = 〈x, , , , , , 〉 E2 =
10 10 10 10 10 10
5 5 5 7 5 3
10 10 10 10 10 10
5 5 5 3 5 7
Neutrosophic set P = 〈x, , , , , , 〉 is Neu-CSin Y. Then f-1(P) is Neu-Gb CS
10 10 10 10 10 10
in X but not Neu-αGCSin X. Then f is Neu-Gb continuity mapping but not anNeu-αG
continuity mapping.
The following implications are true:
Theorem 6.13 :
A mapping f: X → Y is Neu-Gb continuity then the inverse image of each Neu-OS
in Y is aNeu-αGOS in X.
Proof :
Let P be a Neu-OS in Y. This implies PC is Neu-CS in Y. Since f is Neu-Gb continuity,
f-1(PC ) isNeu-Gb CS in X. Since f-1(PC )=(f-1(P))C, f-1(P) is a Neu-Gb OS in X.
Theorem 6.14 :
Let f: (X, τN ) → (Y, σN ) be a Neu-Gb continuity mapping, then f is a Neutrosophic
continuity mapping if X is a Neu-bU1 2 space.

Proof :
Let P be a Neu-CS in Y. Then f-1(P) is a Neu-Gb CS in X, since f is a Neu-Gb Continuity.
Since X isa Neu-bU1 2 space, f-1(P) is a Neu-CS in X. Hence f is a Neutrosophiccontinuity
mapping.
Theorem 6.15 :
Let f: (X, τN ) → (Y, σN ) be a Neu-Gb continuity function, then f is a Neu-G continuity
mapping if X is a Neu-gbU1 2 space
Proof :
Let P be a Neu-CS in Y. Then f-1(P) is a Neu-GbCS in X, by hypothesis. Since X is a
Neu-gbU1 2 space, f-1(P) is a Neu-GCS in X. Hence f is a Neu-G continuity mapping.
Theorem 6.16 :
Let f: (X, τN ) → (Y, σN ) be a Neu-Gb continuity mapping and g: (X, τN ) → (Z, ρN ) is
Neutrosophiccontinuity, then gof: (X, τN ) → (Z, ρN )is a Neu-Gb continuity.
Proof :
Let P be a Neu-CS in Z. Then, g-1(P) is a Neu-CS in Y, by hypothesis. Since, f is a Neu-Gb
continuity mapping, f-1(g-1(P)) is a Neu-Gb CS in X. Hence, g of is a Neu-Gb continuity
mapping.
7 . Conclusions :
Many different forms of closed sets have been introduced over the years. Various
interesting problems arise when one considers openness. Its importance is significant in
various areas of mathematics and related sciences,In this chapter we have introduced
Neutrosophic generalized b closed sets in Neutrosophic Topological Spaces and then we
presented Neutrosophic generalized b continuity mapping and studied some of its
properties. Also we investigate the relationships between the other existing
Neutrosophiccontinuity functions. This shall be extended in the future Research with some
applications

References :-
[1] K.Atanassov,Intuitionistic fuzzy sets,Fuzzy Sets and Systems 20,87-94. (1986)

[2] I. Arokiarani, R. Dhavaseelan, S. Jafari, M. Parimala: On Some New Notions and
Functions in Neutrosophic Topological Spaces, Neutrosophic Sets and Systems, Vol.
16 (2017), pp. 16-19. doi.org/10.5281/zenodo.831915
[3] Anitha S, Mohana K, F. Smarandache: On NGSR Closed Sets in Neutrosophic
Topological Spaces, Neutrosophic Sets and Systems, vol. 28, 2019, pp. 171-178.
DOI: 10.5281/zenodo.3382534
[4] V. Banupriya S.Chandrasekar: Neutrosophic αgs Continuity and Neutrosophic αgs
Irresolute Maps, Neutrosophic Sets and Systems, vol. 28, 2019, pp. 162-170.
DOI: 10.5281/zenodo.3382531
[5] A. Edward Samuel, R. Narmadhagnanam: Pi-Distance of Rough Neutrosophic Sets
for Medical Diagnosis, Neutrosophic Sets and Systems, vol. 28, 2019, pp.
51-75. DOI: 10.5281/zenodo.3382511
[6] R.Dhavaseelan, and S.Jafari., Generalized Neutrosophic closed sets, New trends
inNeutrosophic theory and applications ,Volume II,261-273,(2018).
[7] R. Dhavaseelan, R. Narmada Devi, S. Jafari and QaysHatem Imran: Neutrosophic
alpha-m-continuity, Neutrosophic Sets and Systems, vol. 27, 2019, pp. 171-179.
DOI: 10.5281/zenodo.3275578
[8] R.Dhavaseelan, S.Jafari, and Hanifpage.md.:Neutrosophic generalized
-contra-continuity, creat. math. inform. 27,no.2, 133 - 139,(2018)
[9] FlorentinSmarandache.:,Neutrosophic and NeutrosophicLogic,First International
Conference On Neutrosophic,Neutrosophic Logic, Set, Probability, and Statistics
University of New Mexico, Gallup, NM 87301, USA , smarand@unm.edu ,(2002)
[10] FloretinSmarandache.:,Neutrosophic Set: - A Generalization of Intuitionistic Fuzzy
set, Journal of Defense Resourses Management1,107-114,(2010).
[11] P.Ishwarya, and K.Bageerathi.,OnNeutrosophicsemiopen sets in Neutrosophic
topological spaces, International Jour. Of Math. Trends and Tech. , 214-223,(2016).
[12] D.Jayanthi,𝛼Generalized closed Sets in Neutrosophic Topological Spaces,
International Journal of Mathematics Trends and Technology (IJMTT)- Special Issue
ICRMIT March (2018).

[13] A.Mary Margaret, and M.Trinita Pricilla.,Neutrosophic Vague Generalized Pre-closed

Sets in Neutrosophic Vague Topological Spaces,International Journal of Mathematics
And its Applications,Volume 5, Issue 4-E , 747-759.(2017).
[14] C.Maheswari, M.Sathyabama, S.Chandrasekar.,:,Neutrosophic generalized b-closed
Sets In Neutrosophic Topological Spaces,Journal of physics Conf. Series 1139 (2018)
012065.doi:10.1088/1742-6596/1139/1/012065
[15] T. Rajesh Kannan , S. Chandrasekar, Neutrosophic ωα - Closed Sets in Neutrosophic
Topological Spaces, Journal of Computer and Mathematical Sciences,
Vol.9(10),1400-1408 October 2018.
[16] T.RajeshKannan , S.Chandrasekar, Neutrosophic α-Continuity Multifunction In
Neutrosophic Topological Spaces, The International journal of analytical and
experimental modal analysis ,Volume XI, Issue IX, September/2019 ISSN NO: 0886-
9367 PP.1360-1368
[17] A.A.Salama and S.A. Alblowi., Generalized Neutrosophic Set and Generalized
Neutrosophic Topological Spaces, Journal computer Sci. Engineering,
Vol.(ii),No.(7)(2012).
[18] A.A.Salama, and S.A.Alblowi.,Neutrosophic set and Neutrosophic topological space,
ISOR J.mathematics,Vol.(iii),Issue(4),.pp-31-35,(2012).
[19] V.K.Shanthi.V.K.,S.Chandrasekar.S, K.SafinaBegam, Neutrosophic Generalized
Semi closed Sets In Neutrosophic Topological Spaces, International Journal of
Research in Advent Technology, Vol.(ii),6, No.7, , 1739-1743,July (2018)
[20] V.VenkateswaraRao.,Y.SrinivasaRao.,Neutrosophic Pre-open Sets and Pre-closed
Sets in Neutrosophic Topology, International Journal of ChemTech Research,
Vol.(10),No.10, pp 449-458, (2017)
[21] Abdel-Basset, M., Manogaran, G., Gamal, A., & Smarandache, F. (2019). A group
decision making framework based on neutrosophic TOPSIS approach for smart
medical device selection. Journal of medical systems, 43(2), 38.
[22] Abdel-Baset, M., Chang, V., & Gamal, A. (2019). Evaluation of the green supply
chain management practices: A novel neutrosophic approach. Computers in
Industry, 108, 210-220.
[23] Abdel-Basset, M., Manogaran, G., Gamal, A., & Smarandache, F. (2018). A hybrid
approach of neutrosophic sets and DEMATEL method for developing supplier
selection criteria. Design Automation for Embedded Systems, 1-22.

[24] Wadei F. Al-Omeri ,SaeidJafari: neutrosophic pre-continuitymultifunctions and

almost pre-continuitymultifunctions, Neutrosophic Sets and Systems, vol. 27, 2019,
pp. 53-69 .
DOI: 10.5281/zenodo.3275368

CHAPTER-15
CERTAIN NOTIONS OF PENTAPARTITIONED NEUTROSOPHIC

PYTHAGOREAN SETS
R. Radha1,*, A. Stanis Arul Mary2
1
Research Scholar,
Department of Mathematics,
Nirmala College for Women, Coimbatore, Tamilnadu,
radharmat2020@gmail.com
2
Assistant Professor,
Department of Mathematics, Nirmala College for Women,
Coimbatore, Tamilnadu,
stanisarulmary@gmail.com
1. Introduction :
The fuzzy set was introduced by Zadeh [19] in 1965. The concept of Neutrosophic set
was introduced by F. Smarandache which is a mathematical tool for handling problems
involving imprecise, indeterminancy and inconsistent data.Smarandache [15] in proposed
neutrosophic sets. In neutrosophic sets, the indeterminacy membership function walks
along independently of the truth membership or of the falsity membership. Neutrosophic
theory has been widely explored by researchers for application purpose in handling real life
situations involving uncertainty. Although the hesitation margin of neutrosophic theory is
independent of the truth or falsity membership, looks more general than intuitionistic fuzzy
sets yet. Recently, in Atanassov et al. [3] studied the relations between inconsistent
intuitionistic fuzzy sets, picture fuzzy sets, neutrosophic sets and intuitionistic fuzzy sets;
however, it remains in doubt that whether the indeterminacy associated to a particular
element occurs due to the belongingness of the element or the non-belongingness. This has
been pointed out by Chattejee et al. [4] while introducing a more general structure of
neutrosophic set viz. quadripartitioned single valued neutrosophic set (QSVNS). The idea of
QSVNS is actually stretched from Smarandache, s four numerical-valued neutrosophic logic

and Belnap, s four valued logic, where the indeterminacy is divided into two parts, namely,
“unknown” i.e., neither true nor false and “contradiction” i.e., both true and false. In the
context of neutrosophic study however, the QSVNS looks quite logical. Also, in their study,
Chatterjee [4] et al. analyzed a real-life example for a better understanding of a QSVNS
environment and showed that such situations occur very naturally. In 2018 Smarandache
[17] generalized the Soft Set to the Hyper Soft Set by transforming the classical
uni-argument function F into a multi-argument function: In 2016, F. Smarandache [14]
introduced for the first time the degree of dependence between the components of fuzzy
set and neutrosophic sets. The main idea of Neutrosophic sets is to characterize each value
statement in a 3D – Neutrosophic space, where each dimension of the space represents
respectively the truth membership, falsity membership and the indeterminacy, when two
components T and F are dependent and I is independent then T+I+F≤ 2.Rama Malik and
SurpatiPramanik[12] introduced Pentapartitioned neutrosophic set and its properties. Here
indeterminacy is divided into three parts as contradiction, ignorance and unknown
membership function. If T and F are dependent neutrosophic pythagorean components
then T 2 + F 2 ≤ 1.Similarly, for U and C as dependent neutrosophic pythagorean components
then C 2 + U 2 ≤ 1. When combining both we get Quadripartitioned pythagorean set with
2 2 2 2
dependent components asT + F + C + U ≤ 2Radha and A. Stanis Arul Mary *10+
introduced Quadripartitioned neutrosophic pythagorean sets with T, C, U, F as dependent
neutrosophic components.In this we have to introduce the concept of introduced the
concept of Pentapartitioned neutrosophic pythagorean set with T,C,U and F are
dependent neutrosophic components and I as an independent neutrosophic components
and establish some of its properties.
2. PRELIMINARIES :
2.1 Definition [15] :
Let X be a universe. A Neutrosophic set A on X can be defined as follows:
𝐴 = {< 𝑥, 𝑇𝐴 (𝑥), 𝐼𝐴 (𝑥), 𝐹𝐴 (𝑥) >: 𝑥 ∈ 𝑋 Where 𝑇𝐴 , 𝐼𝐴 , 𝐹𝐴 : 𝑈 → 0,1 𝑎𝑛𝑑0 ≤ 𝑇𝐴 𝑥 +
𝐼𝐴 𝑥 + 𝐹𝐴 𝑥 ≤ 3. Here,𝑇𝐴 (𝑥) is the degree of membership, 𝐼𝐴 (𝑥) is the degree of
inderminancy and 𝐹𝐴 (𝑥) is the degree of non-membership.


Let X be a universe. A Quadripartitioned neutrosophic set A with independent
neutrosophic components on X is an object of the form
𝐴 = {< 𝑥, 𝑇𝐴 (𝑥), 𝐶𝐴 (𝑥), 𝑈𝐴 (𝑥), 𝐹𝐴 (𝑥) >: 𝑥 ∈ 𝑋}𝑎𝑛𝑑0 ≤ 𝑇𝐴 𝑥 + 𝐶𝐴 𝑥 + 𝑈𝐴 𝑥 + 𝐹𝐴 𝑥 ≤
4Here,𝑇𝐴 (𝑥) is the truth membership, 𝐶𝐴 (𝑥) is contradiction membership,𝑈𝐴 (𝑥) is
ignorance membership and 𝐹𝐴 (𝑥) is the false membership.
2.3 Definition[12] :
Let P be a non-empty set. A Pentapartitionedneutrosophic set A over P characterizes
each element p in P a truth -membership function 𝑇𝐴 , a contradiction membership
function 𝐶𝐴 , an ignorance membership function 𝐺𝐴 , unknown membership function 𝑈𝐴
and a false membership function 𝐹𝐴 , such that for each p in P
𝑇𝐴 + 𝐶𝐴 + 𝐺𝐴 + 𝑈𝐴 + 𝐹𝐴 ≤ 5

Let X be a universe. A Quadripartitioned neutrosophic pythagorean set A with
dependent neutrosophic components A on X is an object of the form
𝐴 = {< 𝑥, 𝑇𝐴 (𝑥), 𝐶𝐴 (𝑥), 𝑈𝐴 (𝑥), 𝐹𝐴 (𝑥) >: 𝑥 ∈ 𝑋} Where 𝑇𝐴 + 𝐹𝐴 ≤ 1, 𝐶𝐴 + 𝑈𝐴 ≤
1 𝑎𝑛𝑑0 ≤ (𝑇𝐴 𝑥 )2 + (𝐶𝐴 𝑥 )2 + (𝑈𝐴 𝑥 )2 + (𝐹𝐴 𝑥 )2 ≤ 2
Here,𝑇𝐴 (𝑥) is the truth membership, 𝐶𝐴 (𝑥) is contradiction membership,𝑈𝐴 (𝑥) is
ignorance membership and 𝐹𝐴 (𝑥) is the false membership.

A Quadripartitioned neutrosophic pythagorean set A is contained in another
Quadripartitioned neutrosophic pythagorean set B (i.e) A⊆ 𝐵 if 𝑇𝐴 (𝑥) ≤ 𝑇𝐵 (𝑥),𝐶𝐴 (𝑥) ≤
𝐶𝐵 (𝑥), 𝑈𝐴 (𝑥) ≤ 𝑈𝐵 (𝑥) and 𝐹𝐴 (𝑥) ≤ 𝐹𝐵 (𝑥).

The complement of a Quadripartitioned neutrosophic pythagorean set A on X
Denoted by𝐴𝑐 and is defined as 𝐴𝑐 (x)= {< 𝑥, 𝐹𝐴 (𝑥), 𝑈𝐴 (𝑥), 𝐶𝐴 𝑥 , 𝑇𝐴 (𝑥) > ∶ 𝑥 ∈ 𝑋}


Let X be a non-empty set, A = < 𝑥, 𝑇𝐴 (𝑥), 𝐶𝐴 (𝑥), 𝑈𝐴 (𝑥), 𝐹𝐴 (𝑥) > and
B = < 𝑥, 𝑇𝐵 (𝑥), 𝐼𝐵 (𝑥), 𝐹 𝐵 (𝑥) > are Quadripartitioned neutrosophic pythagorean sets.
Then
A ∪ B = <𝑥, 𝑚𝑎𝑥 𝑇𝐴 𝑥 , 𝑇𝐵 𝑥 , 𝑚𝑎𝑥 𝐶𝐴 𝑥 , 𝐶𝐵 𝑥 ,
𝑚𝑖𝑛(𝑈𝐴 (𝑥), 𝑈 𝐵 (𝑥)), 𝑚𝑖𝑛(𝐹𝐴 (𝑥), 𝐹 𝐵 (𝑥)) >
A ∩B=
< 𝑥, 𝑚𝑖𝑛 𝑇𝐴 𝑥 , 𝑇𝐵 𝑥 , 𝑚𝑖𝑛 𝐶𝐴 𝑥 , 𝐶𝐵 𝑥 , 𝑚𝑎𝑥 𝑈𝐴 𝑥 , 𝑈𝐵 𝑥 , 𝑚𝑎𝑥(𝐹𝐴 (𝑥), 𝐹 𝐵 (𝑥)) >
3. Pentapartitioned Neutrosophic Pythagorean Set (PNPS or PNP Set) :

3.1 Definition :-
Let X be a universe. A Pentapartitioned neutrosophic pythagorean set A with T, F, C
and U as dependent neutrosophic components and I as independent component for A on X
is an object of the form 𝐴 = {< 𝑥, 𝑇𝐴 , 𝐶𝐴 , 𝐼𝐴 , 𝑈𝐴 , 𝐹𝐴 >: 𝑥 ∈ 𝑋}Where 𝑇𝐴 + 𝐹𝐴 ≤ 1, 𝐶𝐴 +
𝑈𝐴 ≤ 1 𝑎𝑛𝑑(𝑇𝐴 )2 + (𝐶𝐴 )2 + (𝐼𝐴 )2 + (𝑈𝐴 )2 + (𝐹𝐴 )2 ≤ 3
Here,𝑇𝐴 (𝑥) is the truth membership,
𝐶𝐴 𝑥 is contradiction membership,
𝑈𝐴 (𝑥)is ignorance membership,
𝐹𝐴 (𝑥)is the false membership and
IA (𝑥) is an unknown membership.
3.2 Definition :-
A Pentapartitioned neutrosophic pythagorean set A is contained in another
Pentapartitioned neutrosophic pythagorean soft set B (i.e) A⊆ 𝐵 if 𝑇𝐴 ≤ 𝑇𝐵 , 𝐶𝐴 ≤
𝐶𝐵 , 𝐼𝐴 ≥ 𝐼𝐵 , 𝑈𝐴 ≥ 𝑈𝐵 and 𝐹𝐴 ≥ 𝐹𝐵
3.3 Definition :-
The complement of a Pentapartitioned neutrosophic pythagorean set A on X denoted
𝑐
by 𝐴 and is defined as 𝐴𝑐 (x)= {< 𝑥, 𝐹𝐴 , 𝑈𝐴 ,1 − 𝐼𝐴 , 𝐶𝐴 , 𝑇𝐴 >: 𝑥 ∈ 𝑋}
3.4 Definition :-
Let X be a non-empty set, A = < 𝑥, 𝑇𝐴 , 𝐶𝐴 , 𝐼𝐴 , 𝑈𝐴 , 𝐹𝐴 >and B = < 𝑥, 𝑇𝐵 , 𝐶𝐵 ,

𝐼𝐵 , 𝑈𝐵 , 𝐹 𝐵 > are two Pentapartitioned neutrosophic pythagorean sets. Then

A∪B = < x, 𝑚𝑎𝑥 𝑇𝐴 , 𝑇𝐵 , 𝑚𝑎𝑥 𝐶𝐴 , 𝐶𝐵 , 𝑚𝑖𝑛 𝐼𝐴 , 𝐼𝐵 , 𝑚𝑖𝑛 𝑈𝐴 , 𝑈𝐵 , 𝑚𝑖𝑛(𝐹𝐴 , 𝐹𝐵 )>
A∩B = <𝑥, 𝑚𝑖𝑛 𝑇𝐴 , 𝑇𝐵 , 𝑚𝑖𝑛 𝐶𝐴 , 𝐶𝐵 , 𝑚𝑎𝑥 𝐼𝐴 , 𝐼𝐵 , 𝑚𝑎𝑥 𝑈𝐴 , 𝑈𝐵 , 𝑚𝑎𝑥(𝐹𝐴 , 𝐹𝐵 )>
3.5 Definition :
A Pentapartitionedneutrosophicpythagorean set A over the universe X is said to be
empty Pentapartitionedneutrosophicpythagorean set ∅ with respect to the parameter A if
𝑇𝐴 = 0, 𝐶𝐴 = 0, 𝐼𝐴 = 1, 𝑈𝐴 = 1, 𝐹𝐴 =1,∀𝑥 ∈ 𝑋, ∀𝑒 ∈ 𝐴.It is denoted by ∅
3.6 Definition :
A Pentapartitioned neutrosophic Pythagorean set . A over the universe X is said to be
∆ universe Pentapartitioned neutrosophic pythagorean set with respect to the parameter A
if 𝑇𝐴 = 1, 𝐶𝐴 = 1, 𝐼𝐴 = 0, 𝑈𝐴 = 0, 𝐹𝐴 =0. It is denoted by ∆
3.7 Definition :
Let A and B be two Pentapartitioned neutrosophic pythagorean sets on X then A\B
may be defined as A\B =
< 𝑥, 𝑚𝑖𝑛 𝑇𝐴 , 𝐹𝐵 , 𝑚𝑖𝑛 𝐶𝐴 , 𝑈𝐵 , 𝑚𝑎𝑥 𝐼𝐴 , 1 − 𝐼𝐵 , 𝑚𝑎𝑥(𝑈𝐴 , 𝐶𝐵 ), 𝑚𝑎𝑥(𝐹𝐴 , 𝑇 𝐵 ) >
3.7 Theorem :
Let K and L are two Pentapartitioned neutrosophic pythagorean sets over the
universe X. Then the following are true.
(i) K⊆ L iff K ∩ L = K
(ii) K⊆ L iff K ∪ L = L
3.8 Theorem:
Let F, G, H and S are Pentapartitioned neutrosophic pythagorean sets over the
universe X. Then the following are true.
(i) If F ∩ G =∅𝐴 , then F⊆ 𝐺 𝑐
(ii) If F⊆ G and G ⊆ H then F⊆ H
(iii) If F⊆ G and H⊆ S then F∩ H ⊆ G∩ S
(iv) F⊆ G iff 𝐺 𝑐 ⊆ 𝐹 𝑐

3.9 Definition :
Let I be an arbitrary index {Fi}𝑖∈𝐼 be a subfamily of Pentapartitioned neutrosophic
pythagorean set over the universe X.
(i)The union of these Pentapartitioned neutrosophic pythagorean set is the Pentapartitioned
neutrosophic pythagorean set Hwhere H(x) = ⋃𝑖∈𝐼 𝐹𝑖 𝑥 for each x∈ 𝑋.
(ii)The intersection of these Pentapartitioned neutrosophic pythagorean set is the
Pentapartitioned neutrosophic pythagorean set M where M(x) = ⋂𝑖∈𝐼 𝐹𝑖 (𝑥) for each x∈ 𝑋.
3.10 Theorem :
Let I be an arbitrary index set and {Fi} i∈𝐼 be a subfamily of Pentapartitioned
neutrosophic pythagorean set over the universe X. Then
(i) (⋃𝑖∈𝐼 (𝐹𝑖 )𝐶 = ⋂𝑖∈𝐼 (𝐹𝑖
(ii) (⋂𝑖∈𝐼 (𝐹𝑖 ))𝐶 = ⋃𝑖∈𝐼 (𝐹𝑖 )𝐶
3.11 Theorem
Let K be Pentapartitionedneutrosophicpythagorean set over the universe X. Then the
following are true.
(i) (∅)𝑐 = X
(ii) (X)𝑐 = ∅
3.12 Theorem :
following are true.
(i) K∪ ∅ = K
(ii) K∪ 𝑋 = X
3.13 Theorem :
following are true.
(i) K∩ ∅ = ∅
(ii) K∩ 𝑋 = K, A

3.14 Theorem :
Let K and G are two Pentapartitioned neutrosophic pythagorean sets over the same
universe X. We have the following
(i) (K∪ 𝐺)C = K C ∩GC
(ii) (K∩ 𝐺) C = K C∪GC
3.15 Theorem
Let K and L are two Pentapartitioned neutrosophic pythagorean sets over the same
universe X. We have the following
(i) (K⋀𝐿) C = KC ⋁L C
(ii) (K⋁ L) C = (K) C⋀(L) C
4. Penta Partitioned Neutrosophic Pythagorean Topological Space

4.1 Definition :
A Pentapartitioned Neutrosophic Pythagorean topology on a non-empty set M is a 𝜏
of Pentapartitioned Neutrosophic Pythagorean sets satisfying the following axioms.
 0𝑀 , 1𝑀 ∈ 𝜏
ii) The union of the elements of any sub collection of 𝜏 is in 𝜏
iii) The intersection of the elements of any finite sub collection 𝜏 is in 𝜏
The pair (M, 𝜏) is called an Pentapartitioned Neutrosophic Pythagorean Topological Space
over M.
Note :
1. Every member of 𝜏 is called a PNP open set in M.
2. The set 𝐴𝑀 is called a PVP closed set in X if 𝐴𝑀 ∈ 𝜏 𝑐 , where 𝜏 𝑐 = {𝐴𝑀 𝑐 : 𝐴𝑀 ∈ 𝜏}.
4.2 Example :
Let M = {b1, b2} and Let 𝐴𝑀 , 𝐵𝑀 , 𝐶𝑀 be Penta Partitioned Neutrosophic Pythagorean
sets where
AM = < b1 , 0.5,0.1,0.5,0.7,0.2 >< b2 , 0.7,0.5,0.6,0.2,0.1 >< 𝑏3 , 0.6,0.5,0.8,0.4,0.3 >
BM = < b1 , 0.6,0.7,0.6,0.1,0.2 >< b2 , 0.2,0.3,0.6,0.4,0.7 >< 𝑏3 , 0.5,0.6,0.7,0.1,0.3 >
CM = < b1 , 0.6,0.7,0.5,0.1,0.2 >< b2 , 0.7,0.5,0.6,0.2,0.1 >< 𝑏3 , 0.6,0.6,0.7,0.1,0.3 >

𝜏 = {𝐴𝑀 , 𝐵𝑀 , 𝐶𝑀 , 0𝑀 , 1𝑀 }is an Penta Partitioned Neutrosophic Pythagorean topology on M.
4.3 Preposition :
Let (M, 𝜏1 ) and (M, 𝜏2 ) be two Penta Partitioned Neutrosophic Pythagorean
topological space on M, Then 𝜏1 ⋂𝜏2 is an Penta Partitioned Neutrosophic Pythagorean
topology on M where 𝜏1 ⋂𝜏2 =
{𝐴𝑀 : 𝐴𝑀 ∈ 𝜏1 and 𝐴𝑀 ∈ 𝜏2 }
Proof :
Obviously 0𝑀 , 1𝑀 ∈ 𝜏.
Let 𝐴𝑀 , 𝐵𝑀 ∈ 𝜏1 ⋂𝜏2
Then 𝐴𝑀 , 𝐵𝑀 ∈ 𝜏1 and 𝐴𝑀 , 𝐵𝑀 ∈ 𝜏2
We know that 𝜏1 and 𝜏2 are two Pentapartitioned Neutrosophic Pythagorean
topological space M.
Then 𝐴𝑀 ⋂𝐵𝑀 ∈ 𝜏1 and 𝐴𝑀 ⋂𝐵𝑀 ∈ 𝜏2
Hence 𝐴𝑀 ⋂𝐵𝑀 ∈ 𝜏1 ⋂𝜏2 .
Let 𝜏1 and 𝜏2 are two Penta Partitioned Neutrosophic Pythagorean topological
spaces on X.
Denote 𝜏1 ∨ 𝜏2 = {𝐴𝑀 ∪ 𝐵𝑀 : 𝐴𝑀 ∈ 𝜏1 and 𝐴𝑀 ∈ 𝜏2 }
𝜏1 ∧ 𝜏2 = {𝐴𝑀 ∩ 𝐵𝑀 : 𝐴𝑀 ∈ 𝜏1 and 𝐴𝑀 ∈ 𝜏2 }
4.4 Example :
Let 𝐴𝑀 𝑎𝑛𝑑 𝐵𝑀 be two Penta Partitioned Neutrosophic Pythagorean topological
space on X.
Define 𝜏1 = {0𝑀 , 1𝑀 , 𝐴𝑀 }
𝜏2 = {0𝑀 , 1𝑀 , 𝐵𝑀 }
Then 𝜏1 ∩ 𝜏2 = 0𝑀 , 1𝑀 is a Penta Partitioned Neutrosophic Pythagorean topological
space on M.
But 𝜏1 ∪ 𝜏2 = 0𝑀 , 𝐴𝑀 , 𝐵𝑀 , 1𝑀 ,
𝜏1 ∨ 𝜏2 = 0𝑀 , 𝐴𝑀 , 𝐵𝑀 , 1𝑀 , 𝐴𝑀 ∪ 𝐵𝑀 𝑎𝑛𝑑
𝜏1 ∧ 𝜏2 = 0𝑀 , 𝐴𝑀 , 𝐵𝑀 , 1𝑀 , 𝐴𝑀 ∩ 𝐵𝑀 are not Penta Partitioned Neutrosophic Pythagorean
topological space on X.

4.5 Theorem :
Let (M, 𝜏) be a Penta Partitioned Neutrosophic Pythagorean topological space on M
and let m ∈ M, {𝜏 𝑚 = {𝐴 𝑚 : 𝐴𝑀 ∈ 𝜏} is an Penta Partitioned Neutrosophic
Pythagorean topological space on M.
Proof :
Let m ∈ M.
i) 0𝑀 , 1𝑀 ∈ 𝜏0𝑐𝑁 = 0(𝑚) and 1𝑐𝑁 = X(m) we have 0𝑐𝑁 , 1𝑐𝑁 ∈ 𝜏 𝑚
ii) Let V, W ∈ 𝜏 𝑚 . Then there exist 𝐴𝑀 , 𝐵𝑀 ∈ 𝜏 such that V =A(m) and W =G(m)
By 𝜏 is anPenta Partitioned Neutrosophic Pythagorean topological space on X,
𝐴𝑀 ∩ 𝐵𝑀 ∈ 𝜏
Take 𝐶𝑀 = 𝐴𝑀 ∩ 𝐵𝑀
Then 𝐶𝑀 ∈ 𝜏
Note that V∩ W = 𝐴𝑀 ∩ 𝐵𝑀 = 𝐶𝑀 and {𝜏 𝑚 = {𝐴 𝑚 : 𝐴𝑀 ∈ 𝜏}
Then V∩ W = 𝜏 𝑚
4.6 Definition :
Let (M, 𝜏) be a Penta Partitioned Neutrosophic Pythagorean topological space on X
and let 𝔅 ⊆ 𝜏, 𝔅 is a basis on 𝜏 if for each 𝐴𝑀 ∈ 𝜏, there exist 𝔅′ ⊆ 𝔅 such that
𝐴𝑀 ⊆ 𝔅′
4.7 Example :
Let (M, 𝜏) be a Penta Partitioned Neutrosophic Pythagorean topological space on X as in
Example 4.3 :
Then 𝔅 = {𝐴𝑀 , 𝐵𝑀 , 𝐶𝑀 , 0𝑀 , 1𝑀 } is a basis for 𝜏.
4.8 Theorem :
Let 𝔅 be a basis for Penta Partitioned Neutrosophic Pythagorean topological space on
𝜏. Define 𝔅𝑚 = 𝐴 𝑚 : 𝐴𝑀 ∈ 𝔅 and 𝜏 𝑚 = {𝐴 𝑚 : 𝐴𝑀 ∈ 𝜏} for and m ∈ 𝑀. Then
𝔅𝑚 is a basis for Penta Partitioned Neutrosophic Pythagorean topology 𝜏 𝑚 .
Proof :
Let m ∈ 𝑀. For any V= 𝜏 𝑚 , V= B(m) , for 𝐵𝑀 ∈ 𝜏. Now 𝔅 is a basis for 𝜏. Then

′
there exists 𝔅′ ⊆ 𝔅 such that 𝐵𝑀 =⊔ 𝔅′ where 𝔅,𝑚 = {𝐴 𝑚 : 𝐴𝑀 ∈ 𝔅′ ′ } ⊆ 𝔅𝑚 . Thus
𝔅𝑚 is a basis for Penta Partitioned Neutrosophic Soft topology 𝜏 𝑚 .
5. SOME PROPERTIES OF PENTA PARTITIONED NEUTROSOPHIC PYTHAGOREAN

TOPOLOGICAL SPACE
5.1 Definition :
Let (M, 𝜏) be a Penta Partitioned Neutrosophic Pythagorean topological space on M
and let 𝐴𝑀 belongs to Penta Partitioned Neutrosophic Pythagorean set on M. Then the
interior of 𝐴𝑀 is denoted as PNPInt (𝐴𝑀 ). It is defined by PNPInt (𝐴𝑀 ) = ∪ {𝐵𝑀 ∈ 𝜏: 𝐵𝑀 ⊆
𝐴𝑚 }
5.2 Definition :
Let (M, 𝜏) be a Penta Partitioned Neutrosophic Pythagorean topological space on
M and let 𝐴𝑀 belongs to Penta Partitioned Neutrosophic Pythagorean set M. Then the
closure of 𝐴𝑀 is denoted as PNPCl (𝐴𝑀 ). It is defined by PNPCl (𝐴𝑀 ) = ∩ {𝐵𝑀 ∈ 𝜏 𝐶 : 𝐴𝑀 ⊆
𝐵𝑚 }
5.3 Theorem
Let (M, 𝜏) be a Penta Partitioned Neutrosophic Pythagorean topological space over
M. Then the following properties are hold.
i) 0𝑀 𝑎𝑛𝑑 1𝑀 arePenta Partitioned Neutrosophic Pythagorean closed sets over M
ii) The intersection of any number of Penta Partitioned Neutrosophic Pythagorean
closed set is a Pentapartitioned Neutrosophic Pythagorean closed set over M.
iii) The union of any two Penta Partitioned Neutrosophic Pythagorean closed set is
an Penta Partitioned Neutrosophic Pythagorean closed set over M.
5.4 Theorem
Let (M, 𝜏) be a be a Penta Partitioned Neutrosophic Pythagorean topological space over
X.andLet 𝐴𝑀 ∈Penta Partitioned Neutrosophic Pythagorean topological space .Then the
following properties hold.
(i) PNPInt (AM ) ⊆ AM
(ii) AM ⊆ BM implies PNPInt (AM ) ⊆ PNPInt (BM ).

(iii) PNPInt(𝐴𝑀 ) ∈ 𝜏.
(iv) 𝐴𝑀 is a PNP open set implies PNPInt (𝐴𝑀 ) =𝐴𝑀 .
(v) PNPInt (PNPInt (𝐴𝑀 )) = PNPInt(𝐴𝑀 )
(vi) PNPInt (0𝑀 ) = 0𝑀 , PNPInt (1𝑀 ) =1𝑀 .
5.5 Theorem :
Let (M, 𝜏) be a be a Penta Partitioned Neutrosophic Pythagorean topological space
over M and Let 𝐴𝑀 is in the Penta Partitioned Neutrosophic Pythagorean topological space
.Then the following properties hold.
(i) 𝐴𝑀 ⊆ PNPCl(𝐴𝑀 )
(ii) 𝐴𝑀 ⊆ 𝐵𝑀 implies PNPCl (𝐴𝑀 ) ⊆ QNSCl (𝐵𝑀 ).
(iii) PNPCl(𝐴𝑀 )c ∈ 𝜏.
(iv) 𝐴𝑀 is a PNP closed set implies PNPCl (𝐴𝑀 ) =𝐴𝑀 .
(v) PNPCl (PNPCl (𝐴𝑀 )) = PNPCl(𝐴𝑀 )
(vi) PNPCl (0𝑀 ) = 0𝑀 , PNPCl (1𝑀 ) =1𝑀 .
5.6 Theorem :
Let (M, 𝜏) be a be a Penta Partitioned Neutrosophic Pythagorean topological space
over M and Let 𝐴𝑀 , 𝐵𝑀 are in Penta Partitioned Neutrosophic Pythagorean topological
space M .Then the following properties hold.
(i) PNPInt (AM ) ∩ PNPInt (BM ) = PNPInt (AM ∩ BM )
(ii) PNPInt (AM ) ∪ QNSInt (BM ) ⊆ PNPInt (AM ∪ BM )
(iii) PNPCl (AM ) ∪ QNSCl (BM ) ⊆ PNPCl (AM ∪ BM )
(iv) PNPCl (AM ∪ BM ) ⊆ PNPCl (AM ) ∩ PNPCl (BM )
(v) (PNPInt (FE))c = PNPCl (FEc)
(vi) (PNPCl (FE))c = PNPInt (FEc)
Proof:
(i) Since 𝐴𝑀 ∩ 𝐵𝑀 ⊆ 𝐴𝑚 for any m in M
By theorem, PNPInt (𝐴𝑀 ∩ 𝐵𝑀 ) ⊆ PNPInt (𝐴𝑀 )
Similarly, PNPInt (𝐴𝑀 ∩ 𝐵𝑀 ) ⊆ PNPInt (𝐵𝑀 )
PNPInt (𝐴𝑀 ∩ 𝐵𝑀 ) ⊆ PNPInt (𝐴𝑀 ) ∩ PNPInt(𝐵𝑀 )

By theorem, PNPInt (𝐴𝑀 ) ⊆ 𝐴𝑀 and PNPInt (𝐵𝑀 ) ⊆ 𝐵𝑀

Thus PNPInt (𝐴𝑀 ∩ 𝐵𝑀 ) ⊆ 𝐴𝑀 ∩ 𝐵𝑀
Therefore, PNPInt (𝐴𝑀 ) ∩ PNPInt (𝐵𝑀 ) = PNPInt (𝐴𝑀 ∩ 𝐵𝑀 )
Similarly we can prove (ii),(iii) and (iv).
v) (PNPInt (FE))c = (∩ {𝐵𝑀 ∈ 𝜏: 𝐵𝑀 ⊆ 𝐴𝑚 })c
=∩ {𝐵𝑀 ∈ 𝜏c: 𝐴𝑀 c⊆ 𝐵𝑚 }
= PNPCl (𝐴𝑀 c)
Similarly we can prove (vi)
5.7 Example :
Let M = {b1, b2} and Let 𝐴𝑀 , 𝐵𝑀 , 𝐶𝑀 be Penta Partitioned Neutrosophic Pythagorean
where
AM = < b1 , 0.3,0.3,0.2,0.1,0.3 >< b2 , 0.6,0.4,0.2,0.3,0.1 >
BM = < b1 , 0.2,0.3,0.5,0.1,0.5 >< b2 , 0.6,0.5,0.2,0.3,0.2 >
CM = < b1 , 0.3,0.3,0.2,0.3,0.3 >< b2 , 0.6,0.5,0.2,0.3,0.1 >
𝜏 = {𝐴𝑀 , 𝐵𝑀 , 𝐶𝑀 , 0𝑀 , 1𝑀 }is an Penta Partitioned Neutrosophic Pythagorean topology on M.
i) PNPInt (𝐵𝑀 ) = 0𝑀 = PNPInt(𝐶𝑀 )
Then 𝐵𝑀 ∪ 𝐶𝑀 = 𝐴𝑀
PNPInt (𝐵𝑀 ) ∪ PNPInt (𝐶𝑀 ) =0𝑀 ∪ 0𝑀 =0𝑀
And PNPInt (𝐵𝑀 ∪ 𝐶𝑀 ) = PNPInt (𝐴𝑀 )=𝐴𝑀
PNPInt (𝐵𝑀 ) ∪ PNPInt (𝐶𝑀 ) ≠ PNPInt (𝐵𝑀 ∪ 𝐶𝑀 )
ii) PNPCl (𝐵𝑀 )c = (PNPCl (𝐵𝑀 ))c = 0𝑀 c = 1𝑀
Similarly, PNPCl (C𝑀 )c= 𝑋𝑀
PNPCl (𝐵𝑀 )c∩PNPCl (C𝑀 )c= 1𝑀 ∩ 1𝑀 = 1𝑀
Similarly,PNPCl (𝐵𝑀 c∩ C𝑀 c) = PNPCl (𝐵𝑀 ∩ C𝑀 )c
= PNPInt (𝐵𝑀 ∪ C𝑀 )c
= A𝑀 c
PNPCl (𝐵𝑀 c∩ C𝑀 c) ≠PNPCl (𝐵𝑀 )c∩ (PNPCl (𝐵𝑀 )]c
6. Conclusion
In this chapter, we have introduced Pentapartitioned neutrosophic pythagorean set
with T, C, U and F as dependent neutrosophic components and I as an independent

neutrosophic components. The Pentapartitioned neutrosophic pythagorean set is an

extension of Quadripartitioned neutrosophic pythagorean set with dependent neutrosophic
components and Pentapartitioned neutrosophic set. We discussed some of its properties of
Pentapartitioned neutrosophic pythagorean set. Future works may compromise of the study
of different types of operators on Pentapartitioned neutrosophic pythagorean set dealing
with actual problems and implementing them in decision making problems.
References :
[1] I. Arockiarani, R. Dhavaseelan, S. Jafari,M. Parimala, On some notations and
functions in neutrosophic topological spaces, Neutrosophic sets and systems
[2] I. Arockiarani, I.R. Sumathi and J, Martina Jency, Fuzzy neutrosophic soft
topological spaces, IJMA-4[10], oct-2013.
[3] K. Atanassov, Intuitionistic fuzzy sets, in V. Sgurev, ed., vii ITKRS Session, Sofia
(June 1983 central Sci. and Techn. Library, Bulg. Academy of Sciences (1983)).
[4] Chahhtterjee, R. Majumdar, P. Samanta, S.K. On some similarity measures and
entropy on Quadripartitioned single valued neutrosophic sets. J. Int. Fuzzy
Syst.2016, 30, 2475–2485.
*5+ M. Irfan Ali, F. Feng, X. Liu, W. K. Min and M. Shabir, “On some new operations in
soft set theory”, Comput. Math Appl.57 (2009) 1547-1553.
[6] D. Molodtsov, Soft set Theory - First Results, Comput.Math.Appl. 37 (1999)19-31.
[7] P.K. Maji, R. Biswas ans A. R. Roy, “Fuzzy soft sets”, Journal of Fuzzy Mathematics,
Vol. 9, no.3, pp – 589-602, 2001
*8+ P. K. Maji, R. Biswas ans A. R. Roy, “Intuitionistic Fuzzy soft sets”, The journal of
fuzzy Mathematics, Vol. 9, (3) (2001), 677 – 692.
[9] Pabitra Kumar Maji, Neutrosophic soft set, Annals of Fuzzy Mathematics and
Informatics, Volume 5, No.1, (2013).,157-168.
[10] R. Radha, A. Stanis Arul Mary, F. Smarandache, Quadripartitioned Neutrosophic
pythagorean set with T, C, U and F as dependent components, ISROSET, (submitted)
[11] R. Radha, A. Stanis Arul Mary, Heptapartitioned neutrosophic sets, IRJCT,
volume 2,222-230
[12] Rama Malik, Surapati Pramanik, Pentapartitioned Neutrosophic set and its
properties, Neutrosophic Sets and Systems, Vol 36,2020

[13] A. Salama and S. A. Al – Blowi, Neutrosophic Set and Neutrosophic topological

spaces, IOSR Journal of Math., Vol. (3) ISSUE4 (2012), 31 – 35
[14] M. Shabir and M. Naz, On soft topological spaces, Comput.Math.Appl. 61
(2011)1786 – 1799.
[15] F. Smarandache, Degree of Dependence and independence of the sub
components of fuzzy set and neutrosophic set, Neutrosophic sets and systems, vol
11,2016 95-97
[16] F. Smarandache, Neutrosophy and Neutrosophic Logic, First International
Conference on Neutrosophy, Neutrosophic Logic, Set, Probability and Statistics
University of New Mexico, Gallup, NM 87301, USA (2002).
[17] F. Smarandache, Neutrosophic set, A generialization of the intuituionistics fuzzy
sets, Inter. J. Pure Appl. Math., 24 (2005), 287 – 297.
[18] F. Smarandache: Extension of Soft Set to Hypersoft Set, and then to Plithogenic
Hypersoft Set, Neutrosophic Sets and Systems, vol. 22, 2018, pp. 168-170.
[19] B. Tanay and M.B. Kandemir, Topological structure of fuzzy soft sets,
Comput.Math.Appl. 61 (2001),2952 – 2957.
[20] Xindong Peng, Yong Yang, Some results for pythagorean fuzzy sets, International
Journal of Intelligent systems,30(2015).1133-1160.
[21] L. A. Zadeh, Fuzzy Sets, Inform and Control 8(1965) 338 – 353.
[22] Zhaowen Li, Rongchen cui, On the topological structure of intuitionistic fuzzy
soft sets, Annals of Fuzzy Mathematics and Informatics, Volume 5, No.1,
(2013),229-239.
*23+ Zorlutuna, M. Akdag, W. K. Min, S. Atmaca, “Remarks on soft topological
spaces”, Annals of Fuzzy Mathematics and Informatics, Volume3, No.2, (2012),
pp.171-185.

CHAPTER-16
SEPARATION AXIOMS IN 𝐍𝐧𝐜 TOPOLOGICAL SPACES VIA 𝐍𝐧𝐜 𝐞-OPEN

SETS
A. Vadivel1, V. Sudha1 and S. Tamilselvan3
1
Tamil Nadu-639 005;
Tamil Nadu-608 002
2
Department of Mathematics, Periyar Goverment Arts College, Cuddalore,
Tamil Nadu-607 001
Email:sudhasowjimath@gmail.com
3
Mathematics Section (FEAT), Annamalai University, Annamalainagar,
Tamil Nadu-608 002
Email: tamil_au@yahoo.com
1.Introduction
Smarandache‟s neutrosophic system have wide range of real time applications for the
fields of Computer Science, Information Systems, Applied Matheamatics, Artifical
Intelligence, Mechanics, decision making, Medicine, Electrical & Electronic, and
Management Science etc [1, 2, 3, 4, 20, 21]. Topology is a classical subject, as a generalization
topological spaces many types of topological spaces introduced over the year. Smarandache
[16] defined the Neutrosophic set on three component Neutrosophic sets (T-Truth,
F-Falsehood, I-Indeterminacy). Neutrosophic topological spaces (nts‟s) introduced by Salama
and Alblowi [11]. Lellies Thivagar et al. [8] was given the geometric existence of N topology,
which is a non-empty set equipped with N arbitrary topologies. Lellis Thivagar et al. [9]
introduced the notion of Nn -open (closed) sets and Nn topological spaces. Al-Hamido [5]
explore the possibility of expanding the concept of neutrosophic crisp topological spaces into
N-neutrosophic crisp topological spaces and investigate some of their basic properties. Several

generalized forms of strongly open and strongly closed functions in topological spaces have
been introduced and investigated over the course of years. Certainly, it is hard to say whether
one form is more or less important than another. Functions and of course strongly open and
strongly closed functions stand among the most important and most researched points in the
whole of mathematical science. Various interesting problems arise when one considers
openness and closeness. Its importance is significant in various areas of mathematics and
related sciences. In 2008, Erdal Ekici [6] introduced a new class of generalized open sets called
e-open sets and studied several fundamental and interesting properties of e-open sets and
introduced a new class of continuous functions called e-continuous functions into the field of
topology. In 2020, Vadivel and co-authors [18, 19] the concept of N-neutrosophic δ-open,
N-neutrosophic δ-semiopen, N-neutrosophic δ-preopen and N-neutrosophic e-open sets are
introduced.
Salama et al. [12, 14] put some basic concepts of the neutrosophic crisp set and their
operations, and because of their wide applications and their grate flexibility to solve the
problem, we used these concepts to define new types of neutrosophic points, that we called
neutrosophic crisp points (briefly, ncpt‟s). Finally, we used these points (ncpt‟s) to define the
concept of neutrosophic crisp e limit point, with some of its properties and construct the
separation axioms (Nnc eτi space, i = 0,1,2) in neutrosophic crisp topological and examine
the relationship between them in details.
2 Preliminaries :
Salama and Smarandache [15] presented the idea of a neutrosophic crisp set in a set U
and defined the inclusion between two neutrosophic crisp sets, the intersection (union) of two
neutrosophic crisp sets, the complement of a neutrosophic crisp set, neutrosophic crisp empty
(resp., whole) set as more then two types. And they studied some properties related to
nutrosophic crisp set operations. However, by selecting only one type, we define the inclusion,
the intersection (union), and neutrosophic crisp empty (resp., whole) set again and discover a
few properties.
Definition 2.1 :
Let U be a non-empty set. Then H is called a neutrosophic crisp set (in short, ncs) in U if
H has the form H = (H1 , H2 , H3 ), where H1 , H2 , and H3 are subsets of U. The neutrosophic

crisp empty (resp., whole) set, denoted by ϕn (resp., Un ) is an ncs in U defined by

ϕn = (ϕ, ϕ, U) (resp. Un = (U, U, ϕ)). We will denote the set of all ncs‟s in U as ncS(U).
In particular, Salama and Smarandache [13] classified a neutrosophic crisp set as the
followings. A neutrosophic crisp set H = (H1 , H2 , H3 ) in U is called a neutrosophic crisp set
of Type 1 (resp. 2 & 3) (in short, ncs-Type 1 (resp. 2 & 3) ), if it satisfies H1 ∩ H2 = H2 ∩
H3 = H3 ∩ H1 = ϕ (resp. H1 ∩ H2 = H2 ∩ H3 = H3 ∩ H1 = ϕ and H1 ∪ H2 ∪ H3 =
U&H1 ∩ H2 ∩ H3 = ϕ and H1 ∪ H2 ∪ H3 = U). ncS1 (U) (ncS2 (U) and ncS3 (U)) means set
of all ncs Type 1 (resp. 2 and 3).
Definition 2.2 :
Let H = (H1 , H2 , H3 ), M = (M1 , M2 , M3 ) ∈ ncS(U). Then H is said to be contained in
(resp. equal to) M, denoted by H ⊆ M (resp. H = M), if H1 ⊆ M1 , H2 ⊆ M2 and H3 ⊇ M3
(resp. H ⊆ M and M ⊆ H ); H c = (H3 , H2c , H1 ) ; H ∩ M = (H1 ∩ M1 , H2 ∩ M2 , H3 ∪ M3 ) ;
H ∪ M = (H1 ∪ M1 , H2 ∪ M2 , H3 ∩ M3 ) . Let (Uj )j∈J ⊆ ncS(U), where Hj = (Hj 1 , Hj 2 , Hj 3 ) .
Then ⋂j∈J ‍Hj (simply ⋂ ‍Hj ) = (⋂ ‍Hj 1 , ⋂ ‍Hj 2 , ⋃ ‍Hj 3 ) ; ⋃j∈J ‍Hj (simply ⋃ ‍Hj )
= (⋃ ‍Hj 1 , ⋃ ‍Hj 2 , ⋂ ‍Hj 3 ). The following are the quick consequence of Definition 2.2.

Let L, M, O ∈ ncS(U). Then
(i)ϕn ⊆ L ⊆ Un ,
(ii) if L ⊆ M and M ⊆ O, then L ⊆ O,
(iii)L ∩ M ⊆ L and L ∩ M ⊆ M,
(iv)L ⊆ L ∪ M and M ⊆ L ∪ M,
(v)L ⊆ M iff L ∩ M = L,
(vi)L ⊆ M iff L ∪ M = M.
Likewise the following are the quick consequence of Definition 2.2.

Let L, M, O ∈ ncS(U). Then
(i)L ∪ L = L, L ∩ L = L (Idempotent laws),
(ii)L ∪ M = M ∪ L, L ∩ M = M ∩ L (Commutative laws),
(iii) (Associative laws) : L ∪ (M ∪ O) = (L ∪ M) ∪ O, L ∩ (M ∩ O) = (L ∩ M) ∩ O,
(iv) (Distributive laws:) L ∪ (M ∩ O) = (L ∪ M) ∩ (L ∪ O) , L ∩ (M ∪ O) = (L ∩

M) ∪ (L ∩ O),
(v) (Absorption laws) : L ∪ (L ∩ M) = L, L ∩ (L ∪ M) = L,
(vi) (DeMorgan‟s laws) : (L ∪ M)c = Lc ∩ M c , (L ∩ M)c = Lc ∪ M c ,
(vii)(Lc )c = L,
(viii)(a) L ∪ ϕn = L, L ∩ ϕn = ϕn ,
(b) L ∪ Un = Un , L ∩ Un = L,
(c) Unc = ϕ, ϕcn = Un ,
(d) in general, L ∪ Lc ≠ Un , L ∩ Lc ≠ ϕn .

Let L ∈ ncS(U) and let (Lj )j∈J ⊆ ncS(U). Then
(i)(⋂ ‍Lj )c = ⋃ ‍Lcj , (⋃ ‍Lj )c = ⋂ ‍Lcj ,
(ii)L ∩ (⋃ ‍Lj ) = ⋃ ‍(L ∩ Lj ), L ∪ (⋂ ‍Lj ) = ⋂ ‍(L ∪ Lj ).
Definition 2.3 [10]:

Let U be a non-empty set and the nc sets H&𝑀 in the form H = 〈H1 , H2 , H3 〉 ,
M = 〈M1 , M2 , M3 〉 then the additional new ways for the intersection, union and inclusion
between H&𝑀 are
H ∩ M = (H1 ∩ M1 , H2 ∩ M2 , H3 ∩ M3 )
H ∪ M = (H1 ∪ M1 , H2 ∪ M2 , H3 ∪ M3 )
H ⊆ M ⇔ H1 ⊆ M1 , H2 ⊆ M2 and H3 ⊆ M3 .

For all u, v, w belonging to a non-empty set U. Then the nc points related to u, v, w are
defined as follows:
(i)uP 1 = 〈{u}, ϕ, ϕ〉, is called a ncpt(ncpt P 1 ) in U.
(ii)vP 2 = 〈ϕ, {v}, ϕ〉, is called a ncpt(ncpt P 2 ) in U.
(iii)wP 3 = 〈ϕ, ϕ, {w}〉, is called a ncpt(ncpt P 3 ) in U.
The set of all nc points (ncpt P 1 , ncpt P 2 , ncpt P 3 ) is denoted by ncPt.

Let U be to a non-empty set and u, v, w ∈ U. Then the ncpt :

(i)uP 1 is belonging to the nc set L = 〈L1 , L2 , L3 〉, denoted by uP 1 ∈ L, if u ∈ L1 ,

wherein uP 1 does not belong to the nc set L denoted by uP 1 ∉ L, if u ∉ L1 .
(ii)vP 2 is belonging to the nc set L = 〈L1 , L2 , L3 〉, denoted by vP 2 ∈ L, if v ∈ L2 . In
contrast vP 2 does not belong to the nc set L, denoted by vP 2 ∉ L, if v ∉ L2 .
(iii)wP 3 is belonging to the nc set L = 〈L1 , L2 , L3 〉, denoted by wP 3 ∈ L, if w ∈ L3 .
In contrast wP 3 does not belong to the nc set L, denoted by wP 3 ∉ L, if w ∉ L3 .
Remark 2.1 [10] :

If L = 〈L1 , L2 , L3 〉 is a nc set in a non-empty set U then :
L\uP 1 = 〈L1 \{u}, L2 , L3 〉, L\uP 1 means that the component L does not contain uP 1 .
L\vP 2 = 〈L1 , L2 \{v}, L3 〉, L\vP 2 means that the component L does not contain vP 2 .
L\wP 3 = 〈L1 , L2 , L3 \{u}〉, L\wP 3 means that the component L does not contain wP 3 .
Remark 2.2 [10] :

If L = 〈L1 , L2 , L3 〉 is a nc set in a non-empty set U then : L = (∪ {uP 1 : uP 1 ∈ L}) ∪ (∪
{vP 2 : vP 2 ∈ L}) ∪ (∩ {wP 3 : wP 3 ∈ L}) = (∪ {〈{u}, ϕ, ϕ〉: u ∈ U}) ∪ (∪ {〈ϕ, {v}, ϕ〉: v ∈ U}) ∪
(∩ {〈ϕ, ϕ, {w}〉: w ∈ U}) or L = (∪ {uP 1 : uP 1 ∈ L}) ∪ (∪ {vP 2 : vP 2 ∈ L}) ∪ (∪ {wP 3 : wP 3 ∈
L}) = (∪ {〈{u}, ϕ, ϕ〉: u ∈ U}) ∪ (∪ {〈ϕ, {v}, ϕ〉: v ∈ U}) ∪ (∪ {〈ϕ, ϕ, {u}〉: w ∈ U}).

A neutrosophic crisp topology (briefly, nct) on a non-empty set U is a family τ of nc
subsets of U satisfying the following axioms
(i)ϕn , Un ∈ τ.
(ii)H1 ∩ H2 ∈ τ ∀ H1 &H2 ∈ τ.
(iii)⋃a ‍Ha ∈ τ, for any {Ha : a ∈ J} ⊆ τ.
Then (U, τ) is a neutrosophic crisp topological space (briefly, ncts ) in U. The τ elements
are called neutrosophic crisp open sets (briefly, ncos) in U. A ncsC is closed set (briefly,
nccs) iff its complement Cc is ncos.

Let U be a non-empty set. Then nc τ1 , nc τ2 , ⋯, nc τN are N -arbitrary crisp
topologies defined on U and the collection Nnc τ = {S ⊆ U: S = (⋃Nj=1 ‍Hj ) ∪ (⋂Nj=1 ‍Lj ) ,

Hj , Lj ∈nc τj } is called N neutrosophic crisp (briefly, Nnc ) topology on U if the axioms are
satisfied:
(i)ϕn , Un ∈ Nnc τ.
(ii)⋃∞ ∞
j=1 ‍Uj ∈ Nnc τ ∀ {Uj }j=1 ∈ Nnc τ.
(iii)⋂nj=1 ‍Uj ∈ Nnc τ ∀ {Uj }nj=1 ∈ Nnc τ.

Then (U, Nnc τ) is called a Nnc -topological space (briefly, Nnc ts) on U. The Nnc τ elements
are called Nnc -open sets (Nnc os) on U and its complement is called Nnc -closed sets (Nnc cs)
on U. The elements of U are known as Nnc -sets (Nnc s) on U.

Let (U, Nnc τ) be any Nnc ts. Let H be an Nnc s in (U, Nnc τ). Then H is said to be a
Nnc -regular open [17] set (briefly, Nnc ros) if H = Nnc int(Nnc cl(H)). The complement of an
Nnc ros is called an Nnc -regular closed set (briefly, Nnc rcs ) in U. The family of all Nnc ros
(resp. Nnc rcs) of U is denoted by Nnc ROS(U) (resp. Nnc RCS(U)).

(i) Nnc δ interior of H (briefly, Nnc δint(H) ) is defined by Nnc δint(H) =∪ {S: S ⊆
H & 𝑆 𝑖𝑠 𝑎 Nnc ros}.
(ii) Nnc δ closure of H (briefly, Nnc δcl(H) ) is defined by
Nnc δcl(H) =∪ {u ∈ U: Nnc int(Nnc cl(L)) ∩ H ≠ ϕ, u ∈ L & 𝐿 𝑖𝑠 𝑎 Nnc os}.
Definition 2.10 :
(i)Nnc δ- open (briefly, Nnc δo) set [18] if H = Nnc δint(H).
(ii)Nnc e-open (briefly, Nnc eo) set [19] if
H ⊆ Nnc cl(Nnc δint(H)) ∪ Nnc int(Nnc δcl(H)).
The complement of an Nnc δos (resp. Nnc eos) is called an Nnc δ (resp. Nnc e) closed set
(briefly, Nnc δcs (resp. Nnc ecs)) in U.
The family of all Nnc eos (resp. Nnc ecs) of U containing a point u ∈ U is denoted by
Nnc eOS(U, u) (resp. Nnc eCS(U, u)). The family of all Nnc δos (resp. Nnc δcs, Nnc eos and
Nnc ecs) of U is denoted by Nnc δOS(U) (resp. Nnc δCS(U), Nnc eOS(U) and Nnc eCS(U)).


Let (U, Nnc τ) be Nnc ts, P ∈ Nnc pt in U, a Nnc set L = 〈L1 , L2 , L3 〉 ∈ Nnc eOS(U) is
called N neutrosophic crisp e neighbourhood (briefly, Nnc enhd ) of P in (U, Nnc τ) if
P ∈ L.
𝟑. 𝐍𝐧𝐜 𝐞 limit point
Definition 3.1 :
Let (U, Nnc τ) be Nnc ts, P ∈ Nnc pt in U, a Nnc set L = 〈L1 , L2 , L3 〉 ∈ Nnc eOS(U) is
called Nnc enhd of P in (U, Nnc τ), if there is Nnc eo set H = 〈H1 , H2 , H3 〉 containing P
such that H ⊆ L. Every Nnc eonhd of any point P ∈ Nnc pt in U is Nnc enhd of P, but in
general the inverse is not true.
Example 3.1 :
Let U = {u, v, w} , nc τ1 = {ϕN , UN , H, L, C} , nc τ2 = {ϕN , UN } . H = 〈{u}, ϕ, ϕ〉 ,
L = 〈{v}, ϕ, ϕ〉 , C = 〈{u, v}, ϕ, ϕ〉 , then we have 2nc τ = {ϕN , UN , H, L, C} . If we take
U = 〈{u, v}, {w}, ϕ〉 . Then C = 〈{u, v}, ϕ, ϕ〉 is an Nnc eo set containing p = uP 1 =
〈{u}, ϕ, ϕ〉 and C ⊆ U. That is U is a Nnc enhd ofp in (U, Nnc τ), while it is not a Nnc eonhd
of p.
Definition 3.2 :
Let (U, Nnc τ) be Nnc ts and L = 〈L1 , L2 , L3 〉 be Nnc set of U. A Nnc ptP in U is called
a Nnc e limit point (briefly, Nnc elpt) of L = 〈L1 , L2 , L3 〉 if every Nnc eo set containing P
must contains at least one Nnc pt of L different from P. It is easy to say that the Nnc ptP is not
Nnc elpt of L if there is a Nnc eo set O of P and L ∩ (O\P) = ϕn .
Definition 3.3 :
The set of all Nnc elpt‟s of a Nnc set L is called Nnc e derived set of L, denoted by
Nnc eD(L).
Example 3.2 :
In Example 3.1, if we take D = 〈{u, v}, ϕ, ϕ〉. Then p = wP 1 = 〈{u}, ϕ, ϕ〉 is the only
Nnc elptD. i.e. Nnc eD(D) = {wP 1 }.

Remark 3.1 :
(i) Let L be any Nnc set of U, if P = 〈{u}, ϕ, ϕ〉 ∈ Nnc eOS(U) in any Nnc ts(U, Nnc τ), then
P ∈ Nnc eD(L).
(ii) Let L be any Nnc set of U, the following facts is true:
Nnc eD(L) ⊈ L, L ⊈ Nnc eD(L), and sometimes Nnc eD(L) ∩ L = ϕn or Nnc eD(L) ∩ L ≠ ϕn .
(iii) In any Nnc ts(U, Nnc τ), we have Nnc eD(ϕ) = ϕn .
Theorem 3.1 :
Let (U, Nnc τ) be Nnc ts and L = 〈L1 , L2 , L3 〉 be a Nnc set of U, then L is Nnc ec set iff
Nnc eD(L) ⊆ L.
Proof :
Let L be Nnc ec set, then (U\L) is Nnc eo set this implies that for each Nnc ptP ∈ Nnc Pt
in (U\L), P ∉ L, there is a Nnc eo set O of P and O ⊆ (U\L). Since L ∩ (U\L) = ϕn , then
P is not Nnc elpt of L , thus O ∩ L = ϕn , which implies that P ∉ Nnc eD(L) . Hence
Nnc eD(L) ⊆ L.
Conversely, assume that P ∉ Nnc eD(L), implies that P is not Nnc elpt of L, hence, there is a
Nnc eo set O of P and O ∩ L = ϕn which means that O ⊆ (U\L) and since (U\L) is a
Nnc eo set. Hence L is Nnc ec set.
Theorem 3.2 :
Let (U, Nnc τ) be Nnc ts, L, O be a Nnc sets of U, then the following properties hold:
(i)Nnc eD(ϕn ) = ϕn
(ii) If L ⊆ O, then Nnc eD(L) ⊆ Nnc eD(O)
(iii)Nnc eD(L ∩ O) ⊆ Nnc eD(L) ∩ Nnc eD(O)
(iv)Nnc eD(L ∪ O) = Nnc eD(L) ∪ Nnc eD(O).
Proof.
(i) The proof is, directly.
(ii) Assume that Nnc eD(L) be a Nnc set containing a Nnc ptP ∈ Nnc Pt then by Definition 3.2,
for each Nnc eo set V of P, we have L ∩ V\P ≠ ϕn , but L ⊆ O, hence O ∩ V\P ≠ ϕn , this
means that P ∈ Nnc eD(O). Hence, Nnc eD(L) ⊆ Nnc eD(O).
(iii) Since

L ∩ O ⊆ L, then by (ii) Nnc eD(L ∩ O) ⊆ Nnc eD(L) (1)
L ∩ O ⊆ O, implies Nnc eD(L ∩ O) ⊆ Nnc eD(O) (2)

from (1) & (2) Nnc eD(L ∩ O) ⊆ Nnc eD(L) ∩ Nnc eD(O).
(iv) Let P ∈ Nnc Pt such that P ∉ Nnc eD(L) ∪ Nnc eD(O), then either P ∉ Nnc eD(L) and
P ∉ Nnc eD(O), then there is a Nnc o set K of P and L ∩ K\P = ϕn and O ∩ K\P = ϕn , this
implies that (L ∪ O) ∩ K\P = ϕn , i.e P ∉ Nnc eD(L ∪ O), hence
Nnc eD(L ∪ O) ⊆ Nnc eD(L) ∪ Nnc eD(O). (3)
Conversely, since L ⊆ L ∪ O, O ⊆ L ∪ O , then by property (ii) Nnc eD(L) ⊆ Nnc eD(L ∪
O)and Nnc eD(O) ⊆ Nnc eD(L ∪ O), thus
Nnc eD(L ∪ O) ⊇ Nnc eD(L) ∪ Nnc eD(O) (4)
from (3) and (4) we have Nnc eD(L ∪ O) = Nnc eD(L) ∪ Nnc eD(O).
Remark 3.2 :
In general, the inverse of property (ii) & (iii) in Theorem 3.2 is not true. The following
examples act as an evidence to this claim.
Example 3.3 :
Let U = {u, v, w}, nc τ1 = {ϕN , UN , H}, nc τ2 = {ϕN , UN }, H = 〈ϕ, {u}, ϕ〉, then we
have 2nc τ = {ϕN , UN , H} . If we take L = 〈ϕ, {u}, ϕ〉 , C = 〈ϕ, {v}, ϕ〉 . 2nc eD(L) =
〈ϕ, {v, w}, ϕ〉, 2nc eD(C) = 〈ϕ, {v, w}, ϕ〉 and 2nc eD(H) ⊆ 2nc eD(C), but L ⊂ C.
Example 3.4 :
In Example 3.3, 2nc eD(H ∩ C) = ϕ.Therefore, 2nc eD(H ∩ C) ⊃ 2nc eD(H) ∩ 2nc eD(C).
Theorem 3.3 :
For any Nnc set L over the universe U, then Nnc ecl(L) = L ∪ Nnc eD(L).
Proof :
Let us first prove that L ∪ Nnc eD(L) is a Nnc ec set that is Un \(L ∪ Nnc eD(L)) =
(Un \L) ∩ (Un \Nnc eD(L)) is a Nnc eo set. Now for a Nnc ptP ∈ (Un \L) ∩ (Un \Nnc eD(L)),
then P ∈ (Un \L) and P ∈ Un \Nnc eD(L), thus P ∉ L and P ∉ Nnc eD(L). So by Definition
3.3, there is a Nnc set R of P such that R ∩ L = ϕn , hence R ⊆ Un \L. Now for each P1 ∈ R,

then P1 ∉ Nnc eD(L) , then R ∩ Nnc eD(L) = ϕn , this implies that R ⊆ Un \Nnc eD(L) . i.e
R ⊆ (Un \L) ∩ (Un \Nnc eD(L)) . Thus (Un \L) ∩ (Un \Nnc eD(L)) is a Nnc enhd of all its
elements and hence (Un \L) ∩ (Un \Nnc eD(L)) is a Nnc eo set and thus L ∪ Nnc eD(L) is a
Nnc ec set containing L, therefore Nnc ecl(L) ⊆ L ∪ Nnc eD(L). Since Nnc ecl(L) is a Nnc ec
set (see Definition 3.3 ) and Nnc ecl(L) contains all its Nnc elpt ‟s.Thus Nnc eD(L) ⊆
Nnc ecl(L) and L ⊆ Nnc ecl(L), hence Nnc ecl(L) = L ∪ Nnc eD(L).
4. Separation axioms in a 𝐍𝐧𝐜 topological space
Definition 4.1 :
A Nnc ts(U, Nnc τ) is called:
(i)P1 -Nnc eτ0 -space if ∀ uP 1 ≠ vP 1 ∈ U ∃ a Nnc eo set O in U containing one of them
but not the other.
(ii)P2 -Nnc eτ0 -space if ∀ uP 2 ≠ vP 2 ∈ U ∃ a Nnc eo set O in U containing one of
them but not the other.
(iii)P3 -Nnc eτ0 -space if ∀ uP 3 ≠ vP 3 ∈ U ∃ a Nnc eo set O in U containing one of
them but not the other.
(iv) P1 - Nnc eτ1 -space if ∀ uP 1 ≠ vP 1 ∈ U ∃ a Nnc eo sets O1 , O2 in U such that
uP 1 ∈ O1 , vP 1 ∉ O1 and uP 1 ∉ O2 , vP 1 ∈ O2 .
(v) P2 - Nnc eτ1 -space if ∀ uP 2 ≠ vP 2 ∈ U ∃ a Nnc eo sets O1 , O2 in U such that
uP 2 ∈ O1 , vP 2 ∉ O1 and uP 2 ∉ O2 , vP 2 ∈ O2 .
(vi) P3 - Nnc eτ1 -space if ∀ uP 3 ≠ vP 3 ∈ U ∃ a Nnc eo sets O1 , O2 in U such that
uP 3 ∈ O1 . vP 3 ∉ O1 and uP 3 ∉ O2 , vP 3 ∈ O2 .
(vii) P1 - Nnc eτ2 -space if ∀ uP 1 ≠ vP 1 ∈ U ∃ a Nnc eo sets O1 , O2 in U such that
uP 1 ∈ O1 , vP 1 ∉ O1 and uP 1 ∉ O2 , vP 1 ∈ O2 with O1 ∩ O2 = ϕ.
(viii) P2 - Nnc eτ2 -space if ∀ uP 2 ≠ vP 2 ∈ U ∃ a Nnc eo sets O1 , O2 in U such that
(ix) P3 - Nnc eτ2 -space if ∀ uP 3 ≠ vP 3 ∈ U∃ a Nnc eo sets O1 , O2 in U such that
Definition 4.2 :
A Nnc ts(U, Nnc τ) is called:

(i) Nnc eτ0 -space if (U, Nnc τ) is P1 - Nnc eτ0 -space, P2 - Nnc eτ0 -space and
P3 -Nnc eτ0 -space.
(ii) Nnc eτ1 -space if (U, Nnc eτ) is P1 - Nnc eτ1 -space, P2 - Nnc eτ1 -space and
(iii) Nnc eτ2 -space if (U, Nnc τ) is P1 - Nnc eτ2 -space, P2 - Nnc eτ2 -space and
Remark 4.1 :
For a Nnc ts(U, Nnc τ)
(i) Every Nnc eτ0 -space is P1 -Nnc eτ0 -space.
(ii) Every Nnc eτ0 -space is P2 -Nnc eτ0 -space.
(iii) Every Nnc eτ0 -space is P3 -Nnc eτ0 -space.
(iv) Every Nnc eτ1 -space is P1 -Nnc eτ1 -space.
(v) Every Nnc eτ1 -space is P2 -Nnc eτ1 -space.
(vi) Every Nnc eτ1 -space is P3 -Nnc eτ1 -space.
(vii) Every Nnc eτ2 -space is P1 -Nnc eτ2 -space.
(viii) Every Nnc eτ2 -space is P2 -Nnc eτ2 -space.
(ix) Every Nnc eτ2 -space is P3 -Nnc eτ2 -space.
(x) Every Nnc eτ1 -space is Nnc eτ0 -space.
(xi) Every Nnc eτ2 -space is Nnc eτ1 -space.
But not conversely.
Proof. :
The proof is directly from Definition 4.2. The inverse of Remark 4.1 is not true, the
following example explain this state.
Example 4.1 :
Let U = {u, v}. nc τ1 = {ϕN , UN , H}, nc τ2 = {ϕN , UN }, H = 〈{u}, ϕ, ϕ〉, then we have
2nc τ = {ϕN , UN , H} . nc σ1 = {ϕN , UN , L} , nc σ2 = {ϕN , UN } , L = 〈ϕ, {v}, ϕ〉 , then we
have 2nc σ = {ϕN , UN , L}. nc μ1 = {ϕN , UN , C}, nc μ2 = {ϕN , UN }, C = 〈ϕ, ϕ, {u}〉, then
we have 2nc μ = {ϕN , UN , C}. Then
(i)(U, 2nc τ) is P1 -2nc eτ0 -space but it is not 2nc eτ0 -space.
(ii)(U, 2nc σ) is P2 -2nc eτ0 -space but it is not 2nc eτ0 -space.
(iii)(U, 2nc μ) is P3 -2nc eτ0 -space but it is not 2nc eτ0 -space.

Example 4.2 :
Let U = {u, v} , nc τ1 = {ϕN , UN , H, L} , nc τ2 = {ϕN , UN } , H = 〈{u}, {v}, ϕ〉 ,
L = 〈{v}, {u}, ϕ〉, then we have 2nc τ = {ϕN , UN , H, L}. nc σ1 = {ϕN , UN , C, D} , nc σ2 =
{ϕN , UN }, C = 〈ϕ, ϕ, {u}〉, D = 〈ϕ, ϕ, {v}〉, then we have 2nc σ = {ϕN , UN , C, D}. Then
(i) (U, 2nc τ) is P1 - 2nc eτ1 (resp. P1 - 2nc eτ2 )-space but it is not 2nc eτ1 (resp.
2nc eτ2 )-space.
(ii) (U, 2nc σ) is P2 - 2nc eτ1 (resp. P2 - 2nc eτ2 )-space but it is not 2nc eτ1 (resp.
2nc eτ2 )-space.
(iii) (U, 2nc σ) is P3 - 2nc eτ1 (resp. P3 - 2nc eτ2 )-space but it is not 2nc eτ1 (resp.
2nc eτ2 )-space.
Example 4.3:
Let U = {u, v} , nc τ1 = {ϕN , UN , H, L, C} , nc τ2 = {ϕN , UN } , H = 〈{u}, ϕ, ϕ〉 ,
L = 〈ϕ, {v}, ϕ〉, C = 〈ϕ, ϕ, {u}〉, then we have 2nc τ = {ϕN , UN , H, L, C}. Then (U, 2nc τ) is
2nc eτ0 -space but not 2nc eτ1 -space.
Example 4.4 :
Let U = {u, v} , nc τ1 = {ϕN , UN , H, L} , nc τ2 = {ϕN , UN } , H = 〈{u}, ϕ, ϕ〉 , L =
〈{u, v}, ϕ, ϕ〉, then we have 2nc τ = {ϕN , UN , H, L}. Then (U, 2nc τ) is 2nc eτ1 -space but not
2nc eτ2 -space.
5. Conclusion :-
In this chapter we have defined a new Nnc e points in Nnc ts. Also we have introduced the
concept of Nnc e limit point, with some of its properties. Further, we constructed the separation
axioms (Nnc eτi − space i = 0,1,2) in Nnc topological and examine the relationship between
them in details.

References :
[1] M. Abdel-Basset, V. Chang, M. Mohamed and F. Smarandche, A Refined Approach for

Forecasting Based on Neutrosophic Time Series, Symmentry, 11 (4) (2019) 457.
[2] M. Abdel-Basset, G. Manogaran, A. Gamal and V. Chang, A Novel Intelligent Medical
Decision Support Model Based on Soft Computing and IoT, IEEE Internet of Things Journal,
(2019).
[3] M. Abdel-Basset, and M. Mohamed, A novel and powerful framework based on
neutrosophic sets to aid patients with cancer, Future Generation Computer Systems, 98
(2019) 144-153.
[4] M. Abdel-Basset, A. Gamal, G. Manogaran and H. V. Long A novel group decision
making model based on neutrosophic sets for heart disease diagnosis, Multimedia Tools and
Applications, (2019) 1-26.
[5] R. K. Al-Hamido, T. Gharibah , S. Jafari and F. Smarandache, On neutrosophic crisp
topology via N-topology, Neutrosophic Sets and Systems, 23 (2018), 96-109.
[6] Erdal Ekici, On e-open sets, 𝒟𝒫 ⋆ -sets and 𝒟𝒫ϵ⋆ -sets and decomposition of continuity,
The Arabian Journal for Science and Engineering, 33 (2008) 271-282.
[7] K. Hur, P. K. Lim, J. G. Lee and J. Lee, The category of neutrosophic crisp sets, Annals
of Fuzzy mathematics and Informatics, 14 (1) (2017), 43-54.
[8] M. Lellis Thivagar, V. Ramesh, M D. Arockia, On new structure of N-topology, Cogent
Mathematics (Taylor and Francis), 3 (2016):1204104.
[9] M. Lellis Thivagar, S. Jafari, V. Antonysamy and V.Sutha Devi, The ingenuity of
neutrosophic topology via N-topology, Neutrosophic Sets and Systems, 19 (2018), 91-100.
[10] A. B. AL-Nafee, R. K. Al-Hamido and F. Smarandache, Separation axioms in
neutrosophic crisp topological Spaces, Neutrosophic Sets and Systems, 25 (2019), 25-32.
[11] A. A. Salama and S. A. Alblowi, Generalized neutrosophic set and generalized
neutrosophic topological spaces, Journal computer sci. engineering, 2 (7) (2012), 31-35.
[12] A. A. Salama, Neutrosophic Crisp Points and Neutrosophic Crisp Ideals, Neutrosophic
Sets and Systems, 1 (1) (2013), 50-54.
[13] A. A. Salama, F. Smarandache and V. Kroumov, Neutrosophic crisp sets and
neutrosophic crisp topological spaces, Neutrosophic Sets and Systems, 2 (2014), 25-30.
[14] A. A. Salama, F. Smarandache and Valeri Kroumov, Neutrosophic Crisp Sets and
Neutrosophic Crisp Topological Spaces, Neutrosophic Sets and Systems, 2 (2014), 25-30.

[15] A. A. Salama and F. Smarandache, Neutrosophic crisp set theory, Educational

Publisher, Columbus, Ohio, USA, 2015.
[16] F. Smarandache, Neutrosophy and neutrosophic logic, First International Conference
on Neutrosophy, Neutrosophic Logic, Set, Probability, and Statistics, University of New
[17] A. Vadivel and C. John Sundar, γ-Open Sets in 𝒩nc -Topological Spaces, Advances in
Mathematics: Scientific Journal, 9 (4) (2020), 2197-2202.
[18] A. Vadivel and C. John Sundar, Nnc δ-open sets, Submitted.
[19] A. Vadivel and P. Thangaraja, e-open sets Nnc Topological Spaces, Journal of Physics:
Conference Series 1724 (2021) 012007.
[20] V. Venkateswaran Rao and Y. Srinivasa Rao, Neutrosophic Pre-open sets and
Pre-closed sets in Neutrosophic Topology, International Journal of chemTech Research, 10
(10) 449-458.
[21] F. Wadei, Al-Omeri and Saeid Jafari, Neutrosophic pre-continuity multifunctions and
almost pre-continuity multifunctions, Neutrosophic Sets and Systems, 27 (2019) 53-69.

CHAPTER-17
SELF-CENTERED SINGLE VALUED NEUTROSOPHIC

GRAPHS
1
R.Vikrama Prasad,2V.Krishnaraj and3R.Dhavaseelan
1
Department of Mathematics, Government Arts College(A),Salem - 636 007, Tamil Nadu,
India.
2,3
Department of Mathematics, Sona College of Technology, Salem - 636 005, Tamil Nadu,
India.
1. Introduction
Fuzzy set [19] theory plays a vital role in complex phenomena which is not effortlessly
described by classical set theory. Atanassov introduced the concept of intuitionistic fuzzy
relations and intuitionistic fuzzy graphs(IFGs). Parvathi and Karunambigai[13] introduced the
concept of IFG elaborately and analyzed its components. Authors of [9] introduced the concept
of self-centered IFG. Smarandache[16] introduced the idea of neutrosophic sets by combining
the non-standard analysis. Neutrosophic set is a mathematical tool for dealing real life
problems having imprecise, indeterminacy and inconsistent data. Neutrosophic set theory, as a
generalization of classical set theory, fuzzy set theory and intuitionistic fuzzy set theory, is
applied in a variety of fields, including control theory, decision making problems, topology,
medicines and in many more real life problems. Wang et al. [17] presented the notion of
single-valued neutrosophic sets to apply neutrosophic sets in real life problems
moreconveniently. A single-valued neutrosophic set has three components: truth membership
degree, indeterminacy membership degree and falsity membership degree. These three
components of a single-valued neutrosophic set are not dependent and their values are
contained in the standard unit interval [0, 1]. Single-valued neutrosophic sets are the
generalization of intuitionistic fuzzy sets. Single-valued neutrosophic sets have been a new hot
research topic and many researchers have addressed this issue. Akram et al.[1-5] has discussed
several concepts related to single-valued neutrosophic graphs. Majumdar and Samanta [10]
studied similarity and entropy of single-valued neutrosophic sets. Ye[18] proposed correlation

coefficients of single-valued neutrosophic sets, and applied it to single-valued neutrosophic

decision making problems.
In this chapter, we introduce the concepts of length, distance, radius, eccentricity,
diameter, status, total status, median and central vertex of a single valued neutrosophic graph.
We present the concept of self-centered single valued neutrosophic graph. We also discuss
some interesting properties besides giving some examples.

Let X be a space of points. A neutrosophic set A in X is characterized by a
truth-membership function 𝑇 𝐴
(𝑥), an indeterminacy membership function 𝐼 𝐴
(𝑥) and a
falsity membership function 𝐹 𝐴
(𝑥). The functions 𝑇 𝐴
(𝑥), 𝐼 𝐴
(𝑥)and 𝐹 𝐴
(𝑥) are real
standard or non standard subsets of ]0−, 1+[. That is, 𝑇 𝐴
(𝑥): 𝑋 →]0−, 1+[, 𝐼 𝐴
(𝑥): 𝑋 →
]0−, 1+[,𝐹 𝐴
(𝑥): 𝑋 →]0−, 1+[ and 0− ≤ 𝑇 𝐴
(𝑥) + 𝐼 𝐴
(𝑥) + 𝐹 𝐴
(𝑥) ≤ 3+.
From philosophical point view, the neutrosophic set takes the value from real standard
or non standard subsets of ]0−, 1+[. In real life applications in scientific and engineering
problems, it is difficult to use neutrosophic set with value from real standard or non standard
subset of ]0−, 1+[.

A single valued neutrosophic graph is a pair 𝐺 = (𝐴, 𝐵), where 𝐴: 𝑉 → [0,1] is single
valued neutrosophic set in V and 𝐵: 𝑉 × 𝑉 → [0,1] is single valued neutrosophic relation on V
such that 𝑇 𝐵
(𝑥𝑦) ≤ min{𝑇 𝐴
(𝑥), 𝑇 𝐴
(𝑦)}, 𝐼 𝐵
(𝑥𝑦) ≤ min{𝐼 𝐴
(𝑥), 𝐼 𝐴
(𝑦)}, 𝐹 𝐵
(𝑥𝑦) ≤
max{𝐹 𝐴
(𝑥), 𝐹 𝐴
(𝑦)} for all 𝑥, 𝑦 ∈ 𝑉. A is called single valued neutrosophic vertex set of G
and B is called single valued neutrosophic edge set of G, respectively. We note that B is
symmetric single valued neutrosophic relation on A. If B is not symmetric single valued
neutrosophic relation on A,then 𝐺 = (𝐴, 𝐵) is called a single valued neutrosophic directed
graph.
Definition 1.3 :
A single valued neutrosophic graph 𝐺 = (𝐴, 𝐵) is said to be complete if 𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) =
min(𝑇𝐴 (𝑣𝑖 ), 𝑇𝐴 (𝑣𝑗 )), 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) = min(𝐼𝐴 (𝑣𝑖 ), 𝐼𝐴 (𝑣𝑗 )) and
𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) = max(𝐹𝐴 (𝑣𝑖 ), 𝐹𝐴 (𝑣𝑗 )), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉.

2. Self-Centered Single Valued Neutrosophic Graphs :

Definition 2.1 :
Let 𝐺 = 𝐴, 𝐵 be a single valued neutrosophic graph. Then the order of G is defined to
be 𝑂(𝐺) = 𝑂𝑇 (𝐺), 𝑂𝐼 (𝐺), 𝑂𝐹 (𝐺) where 𝑂 𝑇
(𝐺) = 𝑢∈𝑉 ‍𝑇𝐴 (𝑢) , 𝑂 𝐼 (𝐺) = 𝑢∈𝑉 ‍𝐼𝐴 (𝑢) ,
𝑂𝐹 (𝐺) = 𝑢∈𝑉 ‍𝐹𝐴 (𝑢).
Definition 2.2 :
The size of G is defined to be 𝑆(𝐺) = 𝑆𝑇 (𝐺), 𝑆𝐼 (𝐺), 𝑆𝐹 (𝐺) where 𝑆𝑇 (𝐺) =
𝑢,𝑣∈𝑉 ‍𝑇𝐵 (𝑢, 𝑣), 𝑆𝐼 (𝐺) = 𝑢,𝑣∈𝑉 ‍𝐼𝐵 (𝑢, 𝑣), 𝑆𝐹 (𝐺) = 𝑢,𝑣∈𝑉 ‍𝐹𝐵 (𝑢, 𝑢).
Definition 2.3 :
The neighbourhood of any vertex 𝑣 is defined as 𝑁(𝑣) = 𝑁𝑇 (𝑣), 𝑁𝐼 (𝑣), 𝑁𝐹 (𝑣) where
𝑁𝑇 (𝑣) = {𝑢 ∈ 𝑉: 𝑇𝐵 (𝑢, 𝑣) = min{𝑇𝐴 (𝑢), 𝑇𝐴 (𝑣)}} , 𝑁𝐼 𝑣 =
𝑢 ∈ 𝑉: 𝐼𝐵 𝑢, 𝑣 = min 𝐼𝐴 𝑢 , 𝐼𝐴 𝑣 , 𝑁𝐹 (𝑣) = {𝑢 ∈ 𝑉: 𝐹𝐵 (𝑢, 𝑣) =
max{𝐹𝐴 (𝑢), 𝐹𝐴 (𝑣)}}and 𝑁[𝑣] = 𝑁(𝑣) ∪ {𝑣} is called closed neighbourhood of v.
Definition 2.4 :
A path P in a single valued neutrosophic graph 𝐺 = 𝐴, 𝐵 is a sequence of distinct
vertices 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 such that either one of the following condition is satisfied
1) 𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0, 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0 and 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0 for some i and j.
2) 𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0, 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0 and 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0 for some i and j.
Definition 2.5 :
Let G be a single valued neutrosophic graph.
1) [13]The length of a path 𝑃: 𝑣1 , 𝑣2 , . . . , 𝑣𝑛+1 (𝑛 > 0) in G is n.
2) [13]The path 𝑃: 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 +1 in G is called a cycle if 𝑣1 = 𝑣𝑛 +1 and 𝑛 ≥ 3.
3) An single valued neutrosophic graph G is connected if any two vertices are joined by path.
Definition 2.6 :
The strength of a path 𝑃: 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 , is defined as 𝑆(𝑃) = (𝑆𝑇 (𝑃), 𝑆𝐼 (𝑃), 𝑆𝐹 (𝑃))
where 𝑆𝑇 (𝑃) = min(𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 )),𝑆𝐼 (𝑃) = min(𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 )) and 𝑆𝐹 (𝑃) = max(𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 )) for
all i and j.

Note 2.1 :
In other words, the strength of a path is defined to be the weight of the weakest edge of the
path. i.e the strength of a path 𝑆(𝑃).
Definition 2.7 :
A single valued neutrosophic graph 𝐺 = 𝐴, 𝐵 is said to be a single valued
neutrosophic bipartite if the vertex set V can be partitioned into two non empty sets 𝑉1 and 𝑉2
such that
1) 𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0, 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0 and 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0, if 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉1 or 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉2 ,
2) 𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0, 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0 and 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0, if 𝑣𝑖 ∈ 𝑉1 or 𝑣𝑗 ∈ 𝑉2 for some i and
j(or)𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0, 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0 and 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0, if 𝑣𝑖 ∈ 𝑉1 or 𝑣𝑗 ∈ 𝑉2 for some i
and j (or) 𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0, 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) > 0 and 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) = 0 , if 𝑣𝑖 ∈ 𝑉1 or 𝑣𝑗 ∈ 𝑉2 for
some i and j.
Definition 2.8 :
A single valued neutrosophic bipartite graph 𝐺 = (𝐴, 𝐵) is said to be complete if
𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) = min(𝑇𝐴 (𝑣𝑖 ), 𝑇𝐴 (𝑣𝑗 )) , 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ) = min(𝐼𝐴 (𝑣𝑖 ), 𝐼𝐴 (𝑣𝑗 )) and 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 ) =
max(𝐹𝐴 (𝑣𝑖 ), 𝐹𝐴 (𝑣𝑗 )) for all 𝑣𝑖 ∈ 𝑉1 and 𝑣𝑗 ∈ 𝑉2 . It is denoted by 𝐾𝑣1 ,𝑉2 .
Definition 2.9 :
Let single valued neutrosophic graph 𝐻 = (𝐴′ , 𝐵 ′ ) is said to be a single valued
neutrosophic subgraph of a connected single valued neutrosophic graph 𝐺 = (𝐴, 𝐵). If
𝑇𝐴′ (𝑣𝑖 ) = 𝑇𝐴 (𝑣𝑖 ) , 𝐼𝐴′ (𝑣𝑖 ) = 𝐼𝐴 (𝑣𝑖 ) , 𝐹𝐴′ (𝑣𝑖 ) = 𝐹𝐴 (𝑣𝑖 )∀𝑣𝑖 ∈ 𝑉 ′ and 𝑇𝐵′ (𝑣𝑖 , 𝑣𝑗 ) = 𝑇𝐵 (𝑣𝑖 , 𝑣𝑗 ) ,
𝐼𝐵′ (𝑣𝑖 , 𝑣𝑗 ) = 𝐼𝐵 (𝑣𝑖 , 𝑣𝑗 ), 𝐹𝐵′ (𝑣𝑖 , 𝑣𝑗 ) = 𝐹𝐵 (𝑣𝑖 , 𝑣𝑗 )∀(𝑣𝑖 , 𝑣𝑗 ) ∈ 𝐸 ′ .
Definition 2.10 :
Let 𝐺 = (𝐴, 𝐵) be a connected single valued neutrosophic graph.
1) The T-length of a path 𝑃: 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 in G, 𝑙 𝑇 (𝑃) is defined
𝑛−1 1
as𝑙 𝑇 (𝑃) = 𝑖=1 ‍(𝑇 (𝑣 ,𝑣 ))
𝐵 𝑖 𝑖+1
𝑛−1 1
2) The I-length of a path 𝑃: 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 in G, 𝑙𝐼 (𝑃) is defined as 𝑙𝐼 (𝑃) = 𝑖=1 ‍(𝐼 (𝑣 ,𝑣 ))
𝐵 𝑖 𝑖+1
3) The F-length of a path 𝑃: 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 in G, 𝑙𝐹 (𝑃) is defined as

𝑛−1 1
𝑙𝐹 (𝑃) = 𝑖=1 ‍(𝐹 (𝑣 ,𝑣 ))
𝐵 𝑖 𝑖+1

4) The (T,I,F)-length of a path 𝑃: 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 in G, 𝑙(𝑇,𝐼,𝐹) (𝑃) is defined as 𝑙(𝑇,𝐼,𝐹) (𝑃) =

(𝑙 𝑇 (𝑃), 𝑙𝐼 (𝑃), 𝑙𝐹 (𝑃)).
Definition 2.11 :
1) The T-distance 𝛿𝑇 (𝑣𝑖 , 𝑣𝑗 ) is the minimum of the T-length of all the paths joining 𝑣𝑖 and 𝑣𝑗
in G, where 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. i.e 𝛿𝑇 (𝑣𝑖 , 𝑣𝑗 ) = min{𝑙 𝑇 (𝑃): P is a path between 𝑣𝑖 and 𝑣𝑗 },
2) The I-distance 𝛿𝐼 (𝑣𝑖 , 𝑣𝑗 ) is the minimum of the I-length of all the paths joining 𝑣𝑖 and 𝑣𝑗
in G, where 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. i.e 𝛿𝐼 (𝑣𝑖 , 𝑣𝑗 ) = min{𝑙𝐼 (𝑃): P is a path between 𝑣𝑖 and 𝑣𝑗 },
3) The F-distance 𝛿𝐹 (𝑣𝑖 , 𝑣𝑗 ) is the minimum of the F-length of all the paths joining 𝑣𝑖 and 𝑣𝑗
in G, where 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. i.e 𝛿𝐹 (𝑣𝑖 , 𝑣𝑗 ) = min{𝑙𝐹 (𝑃): P is a path between 𝑣𝑖 and 𝑣𝑗 },
4) The distance 𝛿(𝑇,𝐼,𝐹) (𝑣𝑖 , 𝑣𝑗 ) is defined as 𝛿(𝑇,𝐼,𝐹) (𝑣𝑖 , 𝑣𝑗 ) = (𝛿𝑇 , 𝛿𝐼 , 𝛿𝐹 ).
Definition 2.12 :
1) For each 𝑣𝑖 ∈ 𝑉, the T-eccentricity of 𝑣𝑖 , denoted by 𝑒𝑇 (𝑣𝑖 ) and is defined as 𝑒𝑇 (𝑣𝑖 ) =
max{𝛿𝑇 (𝑣𝑖 , 𝑣𝑗 ): 𝑣𝑖 ∈ 𝑉, 𝑣𝑖 ≠ 𝑣𝑗 }.
2) For each 𝑣𝑖 ∈ 𝑉, the I-eccentricity of 𝑣𝑖 , denoted by 𝑒𝐼 (𝑣𝑖 ) and is defined as 𝑒𝐼 (𝑣𝑖 ) =
max{𝛿𝐼 (𝑣𝑖 , 𝑣𝑗 ): 𝑣𝑖 ∈ 𝑉, 𝑣𝑖 ≠ 𝑣𝑗 }.
3) For each 𝑣𝑖 ∈ 𝑉, the F-eccentricity of 𝑣𝑖 , denoted by 𝑒𝐹 (𝑣𝑖 ) and is defined as𝑒𝐹 (𝑣𝑖 ) =
min{𝛿𝐹 (𝑣𝑖 , 𝑣𝑗 ): 𝑣𝑖 ∈ 𝑉, 𝑣𝑖 ≠ 𝑣𝑗 }.
4) For each 𝑣𝑖 ∈ 𝑉 , the eccentricity of 𝑣𝑖 denoted by 𝑒(𝑣𝑖 ) and is defined as 𝑒(𝑣𝑖 ) =
(𝑒𝑇 (𝑣𝑖 ), 𝑒𝐼 (𝑣𝑖 ), 𝑒𝐹 (𝑣𝑖 )).
Definition 2.13 :
1) The T-radius of G is denoted by 𝑟𝑇 (𝐺) and is defined as 𝑟𝑇 (𝐺) = min{𝑒𝑇 (𝑣𝑖 ): 𝑣𝑖 ∈ 𝑉}.
2) The I-radius of G is denoted by 𝑟𝐼 (𝐺) and is defined as 𝑟𝐼 (𝐺) = min{𝑒𝐼 (𝑣𝑖 ): 𝑣𝑖 ∈ 𝑉}.
3) The F-radius of G is denoted by 𝑟𝐹 (𝐺) and is defined as 𝑟𝐹 (𝐺) = min{𝑒𝐹 (𝑣𝑖 ): 𝑣𝑖 ∈ 𝑉}.
4) The radius of G is denoted by 𝑟(𝐺) and is defined as 𝑟(𝐺) = 𝑟𝑇 (𝐺), 𝑟𝐼 (𝐺), 𝑟𝐹 (𝐺) .

Definition 2.14 :
The T-diameter of G is denoted by 𝑑𝑖𝑎 𝑇
(𝐺) and is defined
as𝑑𝑖𝑎 𝑇
(𝐺) = max{𝑒 𝑇
(𝑣𝑖 ): 𝑣𝑖 ∈ 𝑉}.
The I-diameter of G is denoted by 𝑑𝑖𝑎 𝐼 (𝐺) and is defined as
𝑑𝑖𝑎 𝐼 (𝐺) = max{𝑒 𝐼 (𝑣𝑖 ): 𝑣𝑖 ∈ 𝑉}.
The F-diameter of G is denoted by 𝑑𝑖𝑎 𝐹
(𝐺) and is defined
as𝑑𝑖𝑎 𝐹
(𝐺) = max{𝑒 𝐹
(𝑣𝑖 ): 𝑣𝑖 ∈ 𝑉}.
The diameter of G is denoted by 𝑑𝑖𝑎(𝐺) and is defined
as𝑑𝑖𝑎(𝐺) = (𝑑𝑖𝑎 𝑇
(𝐺), 𝑑𝑖𝑎 𝐼 (𝐺), 𝑑𝑖𝑎 𝐹
(𝐺)).
Example 2.1 :
Consider a single valued neutrosophic graph, 𝐺 = (𝐴, 𝐵) such that
𝑉 = {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 , 𝑣5 }𝐸 = {(𝑣1 , 𝑣2 ), (𝑣2 , 𝑣3 ), (𝑣3 , 𝑣1 ), (𝑣3 , 𝑣4 ), (𝑣4 , 𝑣5 ), (𝑣5 , 𝑣2 )}.
𝑣1 − 𝑣2
Path 𝑣1 − 𝑣4 𝑣1 − 𝑣5 𝑣2 − 𝑣3 𝑣2 − 𝑣4 𝑣2 − 𝑣5 𝑣3 − 𝑣4 𝑣3 − 𝑣5 𝑣4 − 𝑣5
𝑣1 − 𝑣3
Distance
(6,9,4)
𝛿 𝑇,𝐼,𝐹 (11,12,10) (13,18,9) (8,8,8) (13,13,10) (7,9,5) (5,5,5) (13,14,10) (8,9,5)
(6,7,5)
(𝑣𝑖 , 𝑣𝑗 )
Then the eccentricity of 𝑣𝑖 are 𝑒(𝑣1 ) = (13,18,4) ,

𝑒(𝑣2 ) = (13,13,4),𝑒(𝑣3 ) = (13,14,5),𝑒(𝑣4 ) = (13,13,5),𝑒(𝑣5 ) = (13,18,5).Radius of G is
𝑟(𝐺) = (13,13,4) and Diameter of G is 𝑑(𝐺) = (13,18,5).

Definition 2.15 :
A vertex 𝑣𝑖 ∈ 𝑉 is called a
1) T-central vertex of a connected single valued neutrosophic graph G, if 𝑟 𝑇
(𝐺) =
𝑒 𝑇
(𝑣𝑖 ).
2) I-central vertex of a connected single valued neutrosophic graph G, if 𝑟 𝐼 (𝐺) = 𝑒 𝐼 (𝑣𝑖 ).
3) F-central vertex of a connected single valued neutrosophic graph G, if 𝑟 𝐹
(𝐺) = 𝑒 𝐹
(𝑣𝑖 ).
4) central vertex of a connected single valued neutrosophic graph G,if 𝑟 𝑇
(𝐺) = 𝑒 𝑇
(𝑣𝑖 ),
𝑟 𝐼 (𝐺) = 𝑒 𝐼 (𝑣𝑖 ) and 𝑟 𝐹
(𝐺) = 𝑒 𝐹
(𝑣𝑖 ) and the set of all central vertices of a single
valued neutrosophic graph is denoted by 𝐶(𝐺).
Definition 2.16 :
< 𝐶(𝐺) >= 𝐻: (𝐴′ , 𝐵 ′ ) is a single valued neutrosophic subgraph of 𝐺 = (𝐴, 𝐵)
induced by the central vertices of G is called the center of G.
Definition 2.17 :
A connected single valued neutrosophic graph G is a
1) T- self-centered single valued neutrosophic graph, if every vertex of G is a T- central
vertex. (i.e) 𝑟 𝑇
(𝐺) = 𝑒 𝑇
(𝑣𝑖 ), ∀𝑣𝑖 ∈ 𝑉.
2) I- self-centered single valued neutrosophic graph, if every vertex of G is a I- central vertex.
(i.e) 𝑟 𝐼 (𝐺) = 𝑒 𝐼 (𝑣𝑖 ), ∀𝑣𝑖 ∈ 𝑉.
3) F- self-centered single valued neutrosophic graph, if every vertex of G is a F- central
vertex. (i.e) 𝑟 𝐹
(𝐺) = 𝑒 𝐹
(𝑣𝑖 ), ∀𝑣𝑖 ∈ 𝑉.
4) single valued neutrosophic self-centered graph, if every vertex of G is a central vertex. (i.e)
𝑟 𝑇
(𝐺) = 𝑒 𝑇
(𝑣𝑖 ), 𝑟 𝐼 (𝐺) = 𝑒 𝐼 (𝑣𝑖 ) and 𝑟 𝐹
(𝐺) = 𝑒 𝐹
(𝑣𝑖 ), ∀𝑣𝑖 ∈ 𝑉.
Example 2.2 :
𝑉 = {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 }𝐸 = {(𝑣1 , 𝑣2 ), (𝑣2 , 𝑣3 ), (𝑣3 , 𝑣4 ), (𝑣4 , 𝑣1 ), (𝑣1 , 𝑣3 )}.

Path 𝒗𝟏 − 𝒗𝟐 𝒗𝟏 − 𝒗𝟑 𝒗𝟏 − 𝒗𝟒 𝒗𝟐 − 𝒗𝟑 𝒗𝟐 − 𝒗𝟒 𝒗𝟑 − 𝒗𝟒
Distance
(5,5,8) (11,11,12) (6,6,4) (6,6,4) (11,11,12) (5,5,8)
𝛿 (𝑇,𝐼,𝐹)
Then the eccentricity of 𝑣𝑖 are 𝑒(𝑣1 ) = (11,11,4),

𝑒(𝑣2 ) = (11,11,4), 𝑒(𝑣3 ) = (11,11,4), 𝑒(𝑣4 ) = (11,11,4).Radius of G is 𝑟(𝐺) = (11,11,4)
and Diameter of G is 𝑑(𝐺) = (11,11,4). Here 𝑟(𝐺) = 𝑒(𝑣𝑖 ), ∀𝑣𝑖 ∈ 𝑉.
Hence G is a self-centered single valued neutrosophic graph.
Definition 2.18 :
1) The T-status of a node u of G is denoted by 𝑠 𝑇
(𝑢) and is defined as 𝑠 𝑇
(𝑢) =
𝑣∈𝑉 ‍𝛿𝑇 (𝑢, 𝑣),
2) The I-status of a node u of G is denoted by 𝑠 𝐼 (𝑢) and is defined as

𝑠 𝐼 (𝑢) = 𝑣∈𝑉 ‍𝛿𝐼 (𝑢, 𝑣),
3) The F-status of a node u of G is denoted by 𝑠 𝐹

(𝑢) and is defined as 𝑠 𝐹
(𝑢) =
𝑣∈𝑉 ‍𝛿𝐹 (𝑢, 𝑣),
4) The status of a node u of G is defined as 𝑠(𝑢) = (𝑠 𝑇

(𝑢), 𝑠 𝐼 (𝑢), 𝑠 𝐹
(𝑢)).
Definition 2.19 :
1) The minimum T-status of G is defined as 𝑚[𝑠𝑇 (𝐺)] = 𝑚𝑖𝑛{𝑠𝑇 (𝑢): 𝑢 ∈ 𝑉},
2) The minimum I-status of G is defined as 𝑚[𝑠𝐼 (𝐺)] = 𝑚𝑖𝑛{𝑠𝐼 (𝑢): 𝑢 ∈ 𝑉},
3) The minimum F-status of G is defined as 𝑚 𝑠𝐹 𝐺 = 𝑚𝑖𝑛 𝑠𝐹 𝑢 : 𝑢 ∈ 𝑉 .
4) The minimum status of G is denoted by 𝑚[𝑠(𝐺)] and is defined as

𝑚[𝑠(𝐺)] = (𝑚[𝑠𝑇 (𝐺)], 𝑚[𝑠𝐼 (𝐺)], 𝑚[𝑠𝐹 (𝐺)]).
Definition 2.20 :
1) The maximum T-status of G is defined as 𝑀[𝑠𝑇 (𝐺)] = 𝑚𝑎𝑥{𝑠𝑇 (𝑢): 𝑢 ∈ 𝑉},
2) The maximum I-status of G is defined as 𝑀[𝑠𝐼 (𝐺)] = 𝑚𝑎𝑥{𝑠𝐼 (𝑢): 𝑢 ∈ 𝑉},
3) The maximum F-status of G is defined as 𝑀[𝑠𝐹 (𝐺)] = 𝑚𝑎𝑥{𝑠𝐹 (𝑢): 𝑢 ∈ 𝑉}.
4) The maximum status of G is denoted by 𝑀[𝑠(𝐺)] and is defined as
𝑀[𝑠(𝐺)] = (𝑀[𝑠𝑇 (𝐺)], 𝑀[𝑠𝐼 (𝐺)], 𝑀[𝑠𝐹 (𝐺)]).
Definition 2.21 :
The total T-status of a node u of G is denoted by 𝑡𝑠 𝑇
(𝑢) and is defined as 𝑡𝑠 𝑇
(𝑢) =
𝑢∈𝑉 ‍𝑠 𝑇 (𝑢),
The total I-status of a node u of G is denoted by 𝑡𝑠 𝐼 (𝑢) and is defined as 𝑡𝑠 𝐼 (𝑢) =
𝑣∈𝑉 ‍𝑠 𝐼 (𝑢),
The total F-status of a node u of G is denoted by 𝑡𝑠 𝐹

(𝑢) and is defined as 𝑡𝑠 𝐹
(𝑢) =
𝑣∈𝑉 ‍𝑠 𝐹 (𝑢).
The total status of G is denoted by 𝑡[𝑠(𝐺)] and is defined as

𝑡[𝑠(𝐺)] = (𝑡𝑠 𝑇
(𝑢), 𝑡𝑠 𝐼 (𝑢), 𝑡𝑠 𝐹
(𝑢)).
Definition 2.22 :
Let 𝐺 = (𝐴, 𝐵) be a connected single valued neutrosophic graph. The median is
defined as 𝑀(𝐺) = (𝑀𝑇 𝐺 , 𝑀𝐼 𝐺 , 𝑀𝐹 𝐺 , where𝑀𝑇 (𝐺) = {𝑣𝑖 ∈ 𝑉: 𝑚𝑖𝑛{𝑠𝑇 (𝑣𝑖 )}},𝑀𝐼 (𝐺) =
{𝑣𝑖 ∈ 𝑉: 𝑚𝑖𝑛{𝑠𝐼 (𝑣𝑖 )}},𝑀𝐹 (𝐺) = {𝑣𝑖 ∈ 𝑉: 𝑚𝑖𝑛{𝑠𝐹 (𝑣𝑖 )}}.
Example 2.3 :
Consider a single valued neutrosophic -graph, 𝐺 = (𝐴, 𝐵) such that 𝑉 = {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 },
𝐸 = {(𝑣1 , 𝑣2 ), (𝑣2 , 𝑣3 ), (𝑣3 , 𝑣1 ), (𝑣3 , 𝑣4 ), (𝑣1 , 𝑣4 )}.

Here, status of the nodes are𝑠 𝑣1 = 22,19,17 , 𝑠 𝑣2 = 27,28,23 , 𝑠 𝑣3 = 26,16,14 ,

𝑠 𝑣4 = 29,27,20 .The minimum status of G is 𝑚[𝑠(𝐺)] = (22,16,14). The maximum
status of G is 𝑀[𝑠(𝐺)] = (29,28,23). The total status of G is 𝑡[𝑠(𝐺)] = (104,90,74). The
median is 𝑀(𝐺) = ({𝑣1 }, {𝑣3 }, {𝑣3 }).
Definition 2.23:
A connected single valued neutrosophic graph 𝐺 = (𝐴, 𝐵) is a self-median if all the
nodes have the same status. In other words, a connected single valued neutrosophic graph
𝐺 = (𝐴, 𝐵) is self-median if and only if 𝑚[𝑠(𝐺)] = 𝑀[𝑠(𝐺)].
Example 2.4 :
𝑉 = {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 },𝐸 = {(𝑣1 , 𝑣2 ), (𝑣2 , 𝑣3 ), (𝑣3 , 𝑣4 ), (𝑣4 , 𝑣1 ), (𝑣1 , 𝑣3 ), (𝑣2 , 𝑣4 )}.
Here, status of the nodes are 𝑠 𝑣1 = 20,23,15 , 𝑠 𝑣2 = 20,23,15 , 𝑠 𝑣3 = 20,23,15 ,
𝑠(𝑣4 ) = (20,23,15). The minimum status of G is 𝑚[𝑠(𝐺)] = (20,23,15). The maximum
status of G is 𝑀[𝑠(𝐺)] = (20,23,15). The total status of G is 𝑡[𝑠(𝐺)] = (80,92,60).

The median is 𝑀(𝐺) = {{𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 }, {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 }, {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 }}. Hence 𝐺 = (𝐴, 𝐵) is

called the self-median graph.
Theorem 2.1 :
If 𝐺 = (𝐴, 𝐵) is a bipartite single valued neutrosophic graph then it has no strong
single valued neutrosophic cycle of odd length.
Proof :
Let G be a bipartite single valued neutrosophic graph with bipartition 𝑉1 and 𝑉2 .
Suppose that it contains a strong cycle of odd length, say 𝑣1 , 𝑣2 , . . . , 𝑣𝑛 , 𝑣1 for some odd
n(vertices). Without loss of generality, let 𝑣1 ∈ 𝑉1 . Since (𝑣𝑖 , 𝑣𝑖+1 ) is strong single valued
neutrosophic for 𝑖 = 1,2, . . . , 𝑛 − 1 and the nodes are alternatively in 𝑉1 and 𝑉2 , we have 𝑣𝑛
and 𝑣1 ∈ 𝑉1 . But this implies that (𝑣𝑛 , 𝑣1 ) is an edge in 𝑉1 which contradicts the assumption
that G is a bipartite single valued neutrosophic graph. Hence bipartite single valued
neutrosophic graph has no single valued neutrosophic strong cycle of odd length.
Theorem 2.2 :
Every complete single valued neutrosophic graph G is a self-centered single valued
1 1 1
neutrosophic graph and 𝑟(𝐺) = (𝑇 , , ) where 𝑇 𝐴
(𝑥) and 𝐼 𝐴
(𝑥) are the
(𝑥) 𝐼 (𝑥) 𝐹 (𝑥)
𝐴 𝐴 𝐴
least value and 𝐹 𝐴

(𝑥) is greatest value.
Proof :
Let G be a complete single valued neutrosophic graph G. To prove that G is a
self-centered single valued neutrosophic graph. That is we have to show that every vertex is a
central vertex. First we claim that G is a T- self-centered single valued neutrosophic graph
1
and 𝑟 𝑇
(𝐺) = 𝑇 , where 𝑇 𝐴
(𝑣𝑖 ) is the least. Now fix a vertex 𝑣𝑖 ∈ 𝑉 such that
(𝑣𝑖 )
𝐴
𝑇 𝐴
(𝑣𝑖 ) is least vertex membership value of G.
(1) Consider all the 𝒗𝒊 − 𝒗𝒋 paths P of length n in G, ∀𝒗𝒊 ∈ 𝑽.

Case (i) : If 𝑛 = 1 , then 𝑇 𝐵
(𝑣𝑖 , 𝑣𝑗 ) = min(𝑇 𝐴
(𝑣𝑖 , 𝑣𝑗 )) = 𝑇 𝐴
(𝑣𝑖 ) . Therefore, the
1
T-length of 𝑃 = 𝑙 𝑇
(𝑃) = 𝑇 .
(𝑣𝑖 )
𝐴
Case (ii) : If 𝑛 > 1, then one of the edges of P possesses the T-strength 𝑇 𝐴
(𝑣𝑖 ) and hence,

1 1
T-length of a 𝑣𝑖 − 𝑣𝑗 path will exceed . That is T-length of P = 𝑙 𝑇
(𝑃) > .
𝑇 (𝑣𝑖 ) 𝑇 (𝑣𝑖 )
𝐴 𝐴
Hence
1
𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) = min(𝑙 𝑇
(𝑃)) = 𝑇 , ∀𝑣𝑗 ∈ 𝑉. (1)
(𝑣𝑖 )
𝐴
(2) Let 𝑣𝑘 ≠ 𝑣𝑖 𝑖𝑛𝑉. Consider all 𝑣𝑘 − 𝑣𝑗 paths Q of length n in G, ∀𝑣𝑗 ∈ 𝑉.

Case (i) : If 𝑛 = 1, then 𝑇 𝐵
(𝑣𝑘 , 𝑣𝑗 ) = min(𝑇 𝐴
(𝑣𝑘 , 𝑣𝑗 )) ≥ 𝑇 𝐴
(𝑣𝑖 ), since 𝑇 𝐴
(𝑣𝑖 ) is the
1 1
least. Hence T-length of 𝑄 = 𝑙 𝑇
(𝑄) = 𝑇 ≤𝑇 .
(𝑣𝑘 ,𝑣𝑗 ) (𝑣𝑖 )
𝐵 𝐴
1 1 2
Case (ii) : If 𝑛 = 2, then 𝑙 𝑇
(𝑄) = 𝑇 +𝑇 ≤𝑇 , since 𝑇 𝐴
(𝑣𝑖 ) is the
(𝑣𝑘 ,𝑣𝑘+1 ) (𝑣𝑘 +1 ,𝑣𝑗 ) (𝑣𝑖 )
𝐵 𝐵 𝐴
least.
𝑛
Case (iii) : If 𝑛 > 2, then 𝑙 𝑇
(𝑄) ≤ 𝑇 , since 𝑇 𝐴
(𝑣𝑖 ) is the least. Hence
(𝑣𝑖 )
𝐴
1
𝛿 𝑇
(𝑣𝑘 , 𝑣𝑗 ) = min(𝑙 𝑇
(𝑄)) ≤ 𝑇 , ∀𝑣𝑘 , 𝑣𝑗 ∈ 𝑉. (2)
(𝑣𝑖 )
𝐴
From Equations (1) and (2), we have

1
𝑒 𝑇
(𝑣𝑖 ) = max(𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 )) = 𝑇 , ∀𝑣𝑖 ∈ 𝑉. (3)
(𝑣𝑖 )
𝐴
Hence G is a T-self-centered single valued neutrosophic graph.

Now, 𝑟 𝑇
(𝐺) = min(𝑒 𝑇
(𝑣𝑖 ))
1
=𝑇 , 𝑠𝑖𝑛𝑐𝑒𝑏𝑦𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 3
𝑣𝑖
𝐴
1
𝑟 𝑇
(𝐺) = , 𝑤𝑕𝑒𝑟𝑒𝑇 𝐴
(𝑣𝑖 ) 𝑖𝑠𝑙𝑒𝑎𝑠𝑡.
𝑇 𝐴 (𝑣𝑖 )
Next, we claim that G is a I- self-centered single valued neutrosophic graph and 𝑟 𝐼 (𝐺) =
1
, where 𝐼 𝐴
(𝑣𝑖 ) is the least. Now fix a vertex 𝑣𝑖 ∈ 𝑉 such that 𝐼 𝐴
(𝑣𝑖 ) is least vertex
𝐼 (𝑣𝑖 )
𝐴
membership value of G.

Case (i) : If 𝑛 = 1, then 𝐼 𝐵
(𝑣𝑖 , 𝑣𝑗 ) = min(𝐼 𝐴
(𝑣𝑖 , 𝑣𝑗 )) = 𝐼 𝐴
(𝑣𝑖 ) . Therefore, the I-length
1
of 𝑃 = 𝑙 𝐼 (𝑃) = 𝐼 .
(𝑣𝑖 )
𝐴
Case (ii) : If 𝑛 > 1, then one of the edges of P possesses the I-strength 𝐼 𝐴
1 1
I-length of a 𝑣𝑖 − 𝑣𝑗 path will exceed . That is I-length of P = 𝑙 𝐼 (𝑃) > 𝐼 . Hence
𝐼 (𝑣 ) 𝑖 (𝑣𝑖 )
𝐴 𝐴
1
𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) = min(𝑙 𝐼 (𝑃)) = 𝐼 , ∀𝑣𝑗 ∈ 𝑉. (4)
(𝑣𝑖 )
𝐴

(2) Let 𝑣𝑘 ≠ 𝑣𝑖 𝑖𝑛𝑉. Consider all 𝑣𝑘 − 𝑣𝑗 paths Q of length n in G, ∀𝑣𝑗 ∈ 𝑉.

Case (i) : If 𝑛 = 1, then 𝐼 𝐵
(𝑣𝑘 , 𝑣𝑗 ) = min(𝐼 𝐴
(𝑣𝑘 , 𝑣𝑗 )) ≥ 𝐼 𝐴
(𝑣𝑖 ), since 𝐼 𝐴
(𝑣𝑖 ) is the
1 1
least. Hence I-length of 𝑄 = 𝑙 𝐼 (𝑄) = 𝐼 ≤𝐼 .
(𝑣𝑘 ,𝑣𝑗 ) (𝑣𝑖 )
𝐵 𝐴
1 1 2
Case (ii) : If 𝑛 = 2, then 𝑙 𝐼 (𝑄) = 𝐼 +𝐼 ≤𝐼 , since 𝐼 𝐴
(𝑣𝑖 ) is the
(𝑣𝑘 ,𝑣𝑘+1 ) (𝑣𝑘+1 ,𝑣𝑗 ) (𝑣𝑖 )
𝐵 𝐵 𝐴
least.
𝑛
Case (iii) : If 𝑛 > 2, then 𝑙 𝐼 (𝑄) ≤ 𝐼 , since 𝐼 𝐴
(𝑣𝑖 ) is the least. Hence
(𝑣𝑖 )
𝐴
1
𝛿 𝐼 (𝑣𝑘 , 𝑣𝑗 ) = min(𝑙 𝐼 (𝑄)) ≤ 𝐼 , ∀𝑣𝑘 , 𝑣𝑗 ∈ 𝑉. (5)
(𝑣𝑖 )
𝐴

1
𝑒 𝐼 (𝑣𝑖 ) = max(𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 )) = 𝐼 , ∀𝑣𝑖 ∈ 𝑉. (6)
(𝑣𝑖 )
𝐴
Hence G is a I-self-centered single valued neutrosophic graph.

Now, 𝑟 𝐼 (𝐺) = min(𝑒 𝐼 (𝑣𝑖 ))
1
=𝐼 , 𝑠𝑖𝑛𝑐𝑒𝑏𝑦𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 (6)
(𝑣𝑖 )
𝐴
1
𝑟 𝐼 (𝐺) = , 𝑤𝑕𝑒𝑟𝑒𝐼 𝐴
(𝑣𝑖 ) 𝑖𝑠𝑙𝑒𝑎𝑠𝑡.
𝐼 𝐴 (𝑣𝑖 )
Next, we claim that G is a F- self-centered single valued neutrosophic graph and 𝑟 𝐹
(𝐺) =
1
, where 𝐹 𝐴
(𝑣𝑖 )is the greatest. Now fix a vertex 𝑣𝑖 ∈ 𝑉 such that 𝐹 𝐴
(𝑣𝑖 ) is greatest
𝐹 (𝑣𝑖 )
𝐴
vertex membership value of G.

Case (i) : If 𝑛 = 1 , then 𝐹 𝐵
(𝑣𝑖 , 𝑣𝑗 ) = max(𝐹 𝐴
(𝑣𝑖 , 𝑣𝑗 )) = 𝐹 𝐴
(𝑣𝑖 ) .Therefore, the
1
F-length of 𝑃 = 𝑙 𝐹
(𝑃) = .
𝐹 (𝑣𝑖 )
𝐴
Case (ii) : If 𝑛 > 1, then one of the edges of P possesses the F-strength 𝐼 𝐴
1 1
F-length of a 𝑣𝑖 − 𝑣𝑗 path will exceed . That is F-length of P= 𝑙 𝐹
(𝑃) > 𝐹 . Hence
𝐼 (𝑣𝑖 ) (𝑣𝑖 )
𝐴 𝐴
1
𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 ) = min(𝑙 𝐹
(𝑃)) = 𝐹 , ∀𝑣𝑗 ∈ 𝑉. (7)
(𝑣𝑖 )
𝐴
(2) Let 𝒗𝒌 ≠ 𝒗𝒊 𝒊𝒏𝑽. Consider all 𝒗𝒌 − 𝒗𝒋 paths Q of length n in G, ∀𝒗𝒋 ∈ 𝑽.

Case (i) : If 𝑛 = 1, then 𝐹 𝐵
(𝑣𝑘 , 𝑣𝑗 ) = max(𝐹 𝐴
(𝑣𝑘 , 𝑣𝑗 )) ≤ 𝐹 𝐴
(𝑣𝑖 ), since 𝐹 𝐴
(𝑣𝑖 ) is

1 1
the greatest. Hence F-length of 𝑄 = 𝑙 𝐹
(𝑄) = ≥ .
𝐹 (𝑣𝑘 ,𝑣𝑗 ) 𝐹 (𝑣𝑖 )
𝐵 𝐴
1 1 2
Case (ii) : If 𝑛 = 2, then 𝑙 𝐹
(𝑄) = 𝐹 +𝐹 ≥𝐹 , since 𝐹 𝐴
(𝑣𝑖 ) is
(𝑣𝑘 ,𝑣𝑘+1 ) (𝑣𝑘 +1 ,𝑣𝑗 ) (𝑣𝑖 )
𝐵 𝐵 𝐴
the greatest.
𝑛
Case (iii) : If 𝑛 > 2, then 𝑙 𝐹
(𝑄) ≥ 𝐹 , since 𝐹 𝐴
(𝑣𝑖 ) is the greatest. Hence
(𝑣𝑖 )
𝐴
1
𝛿 𝐹
(𝑣𝑘 , 𝑣𝑗 ) = min(𝑙 𝐹
(𝑄)) ≥ 𝐹 , ∀𝑣𝑘 , 𝑣𝑗 ∈ 𝑉. (8)
(𝑣𝑖 )
𝐴

1
𝑒 𝐹
(𝑣𝑖 ) = min(𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 )) = 𝐹 , ∀𝑣𝑖 ∈ 𝑉. (9)
(𝑣𝑖 )
𝐴
Hence G is a F-self-centered single valued neutrosophic graph.

Now,𝑟 𝐹
(𝐺) = min(𝑒 𝐹
(𝑣𝑖 ))
1
= , 𝑠𝑖𝑛𝑐𝑒𝑏𝑦𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 (9)
𝐹 𝐴 (𝑣𝑖 )
1
𝑟 𝐹
(𝐺) = , 𝑤𝑕𝑒𝑟𝑒𝐹 𝐴
(𝑣𝑖 ) 𝑖𝑠𝑔𝑟𝑒𝑎𝑡𝑒𝑠𝑡.
𝐹 𝐴 (𝑣𝑖 )
From equations (3),(6), and (9), every vertex of G is a central vertex. Hence G is a self-centered
single valued neutrosophic graph.
Theorem 2.3 :
A single valued neutrosophic graph 𝐺 = (𝐴, 𝐵) is a self-centered single valued
neutrosophic graph iff 𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝑇
(𝐺) , 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝐼 (𝐺) and 𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 ) ≥
𝑟 𝐹
(𝐺)∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉.
Proof.⇒ We assume that G is self-centered single valued neutrosophic graph G. That is
𝑒 𝑇
(𝑣𝑖 ) = 𝑒 𝑇
(𝑣𝑗 ), 𝑒 𝐼 (𝑣𝑖 ) = 𝑒 𝐼 (𝑣𝑗 ), 𝑒 𝐹
(𝑣𝑖 ) = 𝑒 𝐹
(𝑣𝑗 ), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉, 𝑟 𝑇
(𝐺) =
𝑒 𝑇
(𝑣𝑖 ), 𝑟 𝐼 (𝐺) = 𝑒 𝐼 (𝑣𝑖 ) and 𝑟 𝐹
(𝐺) = 𝑒 𝐹
(𝑣𝑖 ), ∀𝑣𝑖 ∈ 𝑉 . Now we wish to show that
𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝑇
(𝐺), 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝑇
(𝐺) and 𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 ) ≥ 𝑟 𝐹
(𝐺), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. By the
definition of eccentricity, we obtain, 𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑒 𝑇
(𝑣𝑖 ), 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑒 𝐼 (𝑣𝑖 ) and
𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 ) ≥ 𝑒 𝐹
(𝑣𝑖 ), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. When 𝑒 𝑇
(𝑣𝑖 ) = 𝑒 𝑇
(𝑣𝑗 ) ,
𝑒 𝐼 (𝑣𝑖 ) = 𝑒 𝐼 (𝑣𝑗 ),𝑒 𝐹
(𝑣𝑖 ) = 𝑒 𝐹
(𝑣𝑗 ), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. Since G is self-centered single valued
neutrosophic graph, the above inequality becomes 𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝑇
(𝐺), 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) ≤
𝑟 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≥ 𝑟 𝐹
(𝐺).
⇐ Assume that 𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝑇
(𝐺), 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝐼 (𝐺) and 𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 ) ≥

𝑟 𝐹
(𝐺), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. Then we have to prove that G is self-centered single valued
neutrosophic graph. Suppose that G is not self-centered single valued neutrosophic graph.
Then 𝑟 𝑇
(𝐺) = 𝑒 𝑇
(𝑣𝑖 ), 𝑟 𝐼 (𝐺) = 𝑒 𝐼 (𝑣𝑖 )and 𝑟 𝐹
(𝐺) = 𝑒 𝐹
(𝑣𝑖 ),for some 𝑣𝑖 ∈ 𝑉. Let us
assume that 𝑒 𝑇
(𝑣𝑖 ), 𝑒 𝐼 (𝑣𝑖 ) and 𝑒 𝐹
(𝑣𝑖 ) is the least value among all other eccentricity.
That is
𝑟 𝑇
(𝐺) = 𝑒 𝑇
(𝑣𝑖 ), 𝑟 𝐼 (𝐺) = 𝑒 𝐼 (𝑣𝑖 ) 𝑎𝑛𝑑𝑟 𝐹
(𝐺) = 𝑒 𝐹
(𝑣𝑖 ) (10)
where 𝑒 𝑇
(𝑣𝑖 ) < 𝑒 𝑇
(𝑣𝑗 ), 𝑒 𝐼 (𝑣𝑖 ) < 𝑒 𝐼 (𝑣𝑗 ), 𝑒 𝐹
(𝑣𝑖 ) < 𝑒 𝐹
(𝑣𝑗 ), for some 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉 and
𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) = 𝑒 𝑇
(𝑣𝑗 ) > 𝑒 𝑇
(𝑣𝑖 ), 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) = 𝑒 𝐼 (𝑣𝑗 ) > 𝑒 𝐼 (𝑣𝑖 ) (11)
𝑎𝑛𝑑𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 ) = 𝑒 𝐹
(𝑣𝑗 ) > 𝑒 𝐹
(𝑣𝑖 ), 𝑓𝑜𝑟𝑠𝑜𝑚𝑒𝑣𝑖 , 𝑣𝑗 ∈ 𝑉.
Hence from equations (10) and (11), we have 𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) > 𝑟 𝑇
(𝐺), 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) > 𝑟 𝐼 (𝐺)
and 𝛿 𝐹
(𝑣𝑖 , 𝑣𝑗 ) < 𝑟 𝐹
(𝐺), for some 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉 , which is a contradiction to the fact that
𝛿 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝑇
(𝐺), 𝛿 𝐼 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑟 𝑇
(𝑣𝑖 , 𝑣𝑗 ) ≥ 𝑟 𝐹
(𝐺), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. Hence
G is a self-centered single valued neutrosophic graph.
Theorem 2.4 :
Let 𝐺 = (𝐴, 𝐵) be a single valued neutrosophic graph. If the graph G is complete
bipartite single valued neutrosophic graph then the complement of G is self-centered single
valued neutrosophic graph.
Proof. A bipartite single valued neutrosophic graph G is said to be complete, if 𝑇 𝐵
𝑣𝑖 , 𝑣𝑗 =
min 𝑇 𝐴
𝑣𝑖 , 𝑇 𝐴
𝑣𝑗 ,
𝑣𝑖 , 𝑣𝑗 = min 𝐼 𝐴
𝑣𝑖 , 𝐼 𝐴
𝑣𝑗 ,𝐹 𝐵
𝑣𝑖 , 𝑣𝑗 = max 𝐹 𝐴
𝑣𝑖 , 𝐹 𝐴
𝑣𝑗 ,
∀𝑣𝑖 ∈ 𝑉1 , 𝑣𝑗 ∈ 𝑉2 .
and 𝑇 𝐵
(𝑣𝑖 , 𝑣𝑗 ) = 0, (12)
𝐼 𝐵
(𝑣𝑖 , 𝑣𝑗 ) = 0,
𝐹 𝐵
(𝑣𝑖 , 𝑣𝑗 ) = 0, ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉1 (𝑜𝑟) 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉2
Now,
𝑇 𝐵
(𝑣𝑖 ), 𝑇 𝐴
(𝑣𝑗 )) − 𝑇 𝐵
(𝑣𝑖 , 𝑣𝑗 ) (13)
𝐼 𝐵
(𝑣𝑖 ), 𝐼 𝐴
(𝑣𝑗 )) − 𝐼 𝐵
𝐹 𝐵
(𝑣𝑖 ), 𝐹 𝐴
(𝑣𝑗 )) − 𝐹 𝐵
(𝑣𝑖 , 𝑣𝑗 ).
By using equation (12)
𝑇 𝐵
( 𝑖 ), 𝑇 𝐴 (𝑣𝑗 )) (14)

𝐼 𝐵
(𝑣𝑖 ), 𝐼 𝐴
(𝑣𝑗 )) (15)
𝐹 𝐵
(𝑣𝑖 ), 𝐹 𝐴
(𝑣𝑗 )), ∀𝑣𝑖 , 𝑣𝑗 ∈ 𝑉1 (𝑜𝑟) 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉2 (16)
From equations (12),(14), the complement of G has two components and each is complete
single valued neutrosophic graph, which are self-centered single valued neutrosophic by
Theorem 2.2.Hence the proof.
Theorem 2.5 :
Every self-median SVN-graph is a self-centered SVN-graph.
Proof :
Let 𝐺 = (𝐴, 𝐵) be a connected self-median SVN-graph with 𝑉 = {𝑣1 , 𝑣2 , 𝑣3 , . . . , 𝑣𝑛 }.
By definition,
𝑠𝑇 (𝑣1 ) = 𝑠𝑇 (𝑣2 ) = 𝑠𝑇 (𝑣3 ) =. . . = 𝑠𝑇 (𝑣𝑛 ),
𝑠𝐼 (𝑣1 ) = 𝑠𝐼 (𝑣2 ) = 𝑠𝐼 (𝑣3 ) =. . . = 𝑠𝐼 (𝑣𝑛 ),
𝑠𝐹 (𝑣1 ) = 𝑠𝐹 (𝑣2 ) = 𝑠𝐹 (𝑣3 ) =. . . = 𝑠𝐹 (𝑣𝑛 ).
𝑣𝑖 ∈𝑉 ‍𝛿𝑇 (𝑣1 , 𝑣𝑖 ) = 𝑣𝑖 ∈𝑉 ‍𝛿𝑇 (𝑣2 , 𝑣𝑖 ) = 𝑣𝑖 ∈𝑉 ‍𝛿𝑇 (𝑣3 , 𝑣𝑖 ) =. . . = 𝑣𝑖 ∈𝑉 ‍𝛿𝑇 (𝑣𝑛 , 𝑣𝑖 ),
𝑖≠1 𝑖≠2 𝑖≠3 𝑖≠𝑛
𝑣𝑖 ∈𝑉 ‍𝛿𝐼 (𝑣1 , 𝑣𝑖 ) = 𝑣𝑖 ∈𝑉 ‍𝛿𝐼 (𝑣2 , 𝑣𝑖 ) = 𝑣𝑖 ∈𝑉 ‍𝛿𝐼 (𝑣3 , 𝑣𝑖 ) =. . . = 𝑣𝑖 ∈𝑉 ‍𝛿𝐼 (𝑣𝑛 , 𝑣𝑖 ),

𝑖≠1 𝑖≠2 𝑖≠3 𝑖≠𝑛
𝑣𝑖 ∈𝑉 ‍𝛿𝐹 (𝑣1 , 𝑣𝑖 ) = 𝑣𝑖 ∈𝑉 ‍𝛿𝐹 (𝑣2 , 𝑣𝑖 ) = 𝑣𝑖 ∈𝑉 ‍𝛿𝐹 (𝑣3 , 𝑣𝑖 ) =. . . = 𝑣𝑖 ∈𝑉 ‍𝛿𝐹 (𝑣𝑛 , 𝑣𝑖 ).

𝑖≠1 𝑖≠2 𝑖≠3 𝑖≠𝑛
1 1 1 1
𝑣𝑖 ∈𝑉 ‍ = 𝑣𝑖 ∈𝑉 ‍ = 𝑣𝑖 ∈𝑉 ‍ =. . . = 𝑣𝑖 ∈𝑉 ‍ ,
𝑇𝐵 (𝑣1 ,𝑣𝑖 ) 𝑇𝐵 (𝑣2 ,𝑣𝑖 ) 𝑇𝐵 (𝑣3 ,𝑣𝑖 ) 𝑇𝐵 (𝑣𝑛 ,𝑣𝑖 )
𝑖≠1 𝑖≠2 𝑖≠3 𝑖≠𝑛
1 1 1 1
𝑣𝑖 ∈𝑉 ‍ = 𝑣𝑖 ∈𝑉 ‍ = 𝑣𝑖 ∈𝑉 ‍ =. . . = 𝑣𝑖 ∈𝑉 ‍ ,
𝐼𝐵 (𝑣1 ,𝑣𝑖 ) 𝐼𝐵 (𝑣2 ,𝑣𝑖 ) 𝐼𝐵 (𝑣3 ,𝑣𝑖 ) 𝐼𝐵 (𝑣𝑛 ,𝑣𝑖 )
𝑖≠1 𝑖≠2 𝑖≠3 𝑖≠𝑛
1 1 1 1
𝑣𝑖 ∈𝑉 ‍ = 𝑣𝑖 ∈𝑉 ‍ = 𝑣𝑖 ∈𝑉 ‍ =. . . = 𝑣𝑖 ∈𝑉 ‍ .
𝐹𝐵 (𝑣1 ,𝑣𝑖 ) 𝐹𝐵 (𝑣2 ,𝑣𝑖 ) 𝐹𝐵 (𝑣3 ,𝑣𝑖 ) 𝐹𝐵 (𝑣𝑛 ,𝑣𝑖 )
𝑖≠1 𝑖≠2 𝑖≠3 𝑖≠𝑛
1 1 1 1
𝑚𝑎𝑥{𝑇 } = 𝑚𝑎𝑥{𝑇 } = 𝑚𝑎𝑥{𝑇 } =. . . = 𝑚𝑎𝑥{𝑇 },
𝐵 (𝑣1 ,𝑣 )
𝑖 𝐵 (𝑣2 ,𝑣 )
𝑖 𝐵 (𝑣3 ,𝑣 )
𝑖 𝐵 (𝑣𝑛 ,𝑣𝑖 )
1 1 1 1
𝑚𝑎𝑥{𝐼 } = 𝑚𝑎𝑥{𝐼 } = 𝑚𝑎𝑥{𝐼 } =. . . = 𝑚𝑎𝑥{𝐼 },
𝐵 (𝑣1 ,𝑣𝑖 ) 𝐵 (𝑣2 ,𝑣𝑖 ) 𝐵 (𝑣3 ,𝑣𝑖 ) 𝐵 (𝑣𝑛 ,𝑣𝑖 )
1 1 1 1
𝑚𝑖𝑛{𝐹 } = 𝑚𝑖𝑛{𝐹 } = 𝑚𝑖𝑛{𝐹 } =. . . = 𝑚𝑖𝑛{𝐹 }.
𝐵 (𝑣1 ,𝑣𝑖 ) 𝐵 (𝑣2 ,𝑣𝑖 ) 𝐵 (𝑣3 ,𝑣𝑖 ) 𝐵 (𝑣𝑛 ,𝑣𝑖 )
𝑚𝑎𝑥{𝛿𝑇 (𝑣1 , 𝑣𝑖 )} = 𝑚𝑎𝑥{𝛿𝑇 (𝑣2 , 𝑣𝑖 )} = 𝑚𝑎𝑥{𝛿𝑇 (𝑣3 , 𝑣𝑖 )} =. . . = 𝑚𝑎𝑥{𝛿𝑇 (𝑣𝑛 , 𝑣𝑖 )},

𝑚𝑎𝑥{𝛿𝐼 (𝑣1 , 𝑣𝑖 )} = 𝑚𝑎𝑥{𝛿𝐼 (𝑣2 , 𝑣𝑖 )} = 𝑚𝑎𝑥{𝛿𝐼 (𝑣3 , 𝑣𝑖 )} =. . . = 𝑚𝑎𝑥{𝛿𝐼 (𝑣𝑛 , 𝑣𝑖 )},
𝑚𝑖𝑛{𝛿𝐹 (𝑣1 , 𝑣𝑖 )} = 𝑚𝑖𝑛{𝛿𝐹 (𝑣2 , 𝑣𝑖 )} = 𝑚𝑖𝑛{𝛿𝐹 (𝑣3 , 𝑣𝑖 )} =. . . = 𝑚𝑖𝑛{𝛿𝐹 (𝑣𝑛 , 𝑣𝑖 )}.
𝑒(𝑣1 ) = 𝑒(𝑣2 ) = 𝑒(𝑣3 ) =. . . = 𝑒(𝑣𝑛 ).

Therefore G is self-centered.
3. Conclusion :
In this chapter, the concepts of length, distance, eccentricity, radius, diameter, status,
total status, median and central vertex of a single valued neutrosophic graph have been
investigated. We have presented the concept of self-centered single valued neutrosophic graph.
Also some interesting properties of self-centered single valued neutrosophic graphs followed
by some examples.
References :
[1] M. Akram, W.A. Dudek and M. Murtaza Yousaf, Self centered interval-valued
fuzzy graphs, Afrika Matematika, 26(5-6), (2015) 887-898.
[2] M. Akram, Single-valued neutrosophic planar graphs, International Journal of
Algebra and Statistics, 5(2), (2016) 157-167.
[3] M. Akram and S. Shahzadi, Representation of graphs using intuitionistic
neutrosophic soft sets, Journal of Mathematical Analysis, 7(6), (2016) 31-53.
[4] M. Akram and G. Shahzadi, Operations on single-valued neutrosophic graphs,
Journal of Uncertain System, 11(2), (2017) 1-26.
[5] M. Akram and S. Shahzadi, Neutrosophic soft graphs with application, Journal of
Intelligent &FuzzySystems, 32(1), (2017) 841-858.
[6] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy sets and Systems, 20, (1986) 87 – 96.
[7] S. Broumi, M. Talea, A. Bakali and F. Smarandache, Single Valued Neutrosophic
Graphs: Degree, Order and Size, IEEE International Conference on Fuzzy Systems ,
(2016) 2444–2451.
[8] R. Dhavaseelan, R. Vikramaprasad, and V. Krishnaraj, Certain types of
neutrosophic graphs, International Journal of Mathematical Sciences and
Applications, 5(2), (2015) 333 – 339.
[9] M.G. Karunambigai and O. Kalaivani, Self centered Intuitionistic fuzzy graph,
World Applied Science Journal,14(12), (2011) 1928-1936.
[10] P. Majumdar, and S.K. Samanta, On similarity and entropy of neutrosophic sets,
Journal of Intelligent & Fuzzy Systems, 26(3), (2014) 1245–1252.
[11] J.N. Mordeson and P.S. Nair, Fuzzy graphs and fuzzy hypergraphs, Physica Verlag,

Heidelberg, 2001.
[12] A. Nagoorgani, and K. Radha, Regular properties of fuzzy graphs, Bulletin of Pure
and Applied Sciences,27E(2), (2008) 411 –419.
[13] R. Parvathi and M.G. Karunambigai, Intuitionistic fuzzy Graphs, Journal of
ComputationalIntelligence,Theory and Applications,20, (2006) 139–150.
[14] K. Radha and N. Kumaravel, Some properties of edge regular fuzzy graphs, Jamal
Academic ResearchJournal, Special issue, (2014) 121–127.
[15] K.H. Rosen, Discrete mathematics and its applications, McGraw - Hill, 7th Edition,
2012.
[16] F. Smarandache, A Unifying field in logics neutrosophy:Neutrosophic
Probability,set and logic, Rehoboth:American Research Press,1998.
[17] H. Wang, F. Smarandache,Y.Q. Zhang and R. Sunderraman, Single-valued
neutrosophic sets, Multisspace and Multistruct, 4, (2010) 410–413.
[18] J. Ye, A multicriteria decision-making method using aggregation operators for
simplified neutrosophic sets, Journal of Intelligent & Fuzzy Systems, 26(5), (2014)
2459–2466.
[19] L.A. Zadeh, Fuzzy sets, Information and control, 8,(1965) 338–353.

CHAPTER-18
SHORTEST PATH ON INTUITIONISTIC TRAPEZOIDAL

NEUTROSOPHIC FUZZY GRAPHS WITH APPLICATION
K. Kalaiarasi and R.Divya

Kalaishruthi12@gmail.com

rdivyamat@gmail.com
I. Introduction :
J.Ye introduced decision making Neural Computing and Applications. [10] and ye[12]
trapezoidal fuzzy numbers are applied rather than triangular fuzzy numbers Chiranjbe jana [11]
extended interval trapezoidal neutrosophic set and define trapezoidal, triangular neutrosophic
score and accuracy function. P.Jayagowri [19] Using Trapizoidal Intuitionistic Fuzzy Number
to Find Optimized Path in a Network. [21] G Kumar, discussed Algorithm for shortest path
problem in a network with interval valued intuitionistic trapezoidal fuzzy number Section II,
introduced some basic concepts related to definitions. Section III, introduced ITrNFG proposed
algorithm and find SPP using that proposed algorithm. Section IV, we apply real life
application. The application has Chola period buildted temple and find its SPP using ITrNFG
proposed algorithm . Section V verified shortest path on Chola period buildted temple with

Dijkstra‟s algorithm. Conclusion are given in section VI.
II. Methodology :
In this section we explain some important definition.
Definition 2.1

Let n1  [(t aL , t bL , t cL , t dL ), (t aU , t bU , t cU , t dU )] , [(iaL , ibL , icL , idL ), (iaU , ibU , icU , idU )] ,
[( faL , fbL , fcL , fdL ), ( faU , fbU , fcU , fdU )] and


n2  [(TaL , TbL , TcL , TdL ), (TaU , TbU , TcU , TdU )] , [(I aL , I bL , I cL , I dL ), ( I aU , I bU , I cU , I dU )] ,
[(FaL , FbL , FcL , FdL ), ( FaU , FbU , FcU , FdU )] both intuitionistic trapezoidal neutrosophic numbers.
Therefore following procedure are hold :

 
(2) n1  n2  [(taL  TaL  taLTaL , tbL  TbL  tbLTbL , tcL  TcL  tcLTcL , tdL  TdL  tdLTdL ),
(taU  TaU  taU TaU , tbU  TbU  tbU TbU , tcU  TcU  tcU TcU , tdU  TdU  tdU TdU )], [(iaL I aL , ibL I bL , icL I cL , idL I dL )
, (iaU I aU , ibU IbU , icU I cU , idU I dU )] , [( f aL FaL , fbL FbL , fcL FcL , f dL FdL ) , ( f aU FaU , fbU FbU , fcU FcU , f dU FdU )]
We propose definition of score and accuracy functions for an intuitionistic trapezoidal

neutrosophic number.
Definition 2.2

Let n1  [(t aL , t bL , t cL , t dL ), (t aU , t bU , t cU , t dU )] , [(iaL , ibL , icL , idL ), (iaU , ibU , icU , idU )] ,
[( f aL , f bL , f cL , f dL ), ( f aU , f bU , f cU , f dU )] be an intuitionistic trapezoidal neutrosophic number,
then defined as their score functions

 1   t aL  t bL  t cL  t dL t aU  t bU  t cU  t dU   iaL  ibL  icL  idL iaU  ibU  icU  idU 
S (n)  2        
3   4 4   4 4 
 f aL  f bL  f cL  f dL f aU  f bU  f cU  f dU  
    
----------------- (1)
 4 4  
_ _
Where the higher value of S ( n ) , larger the intuitionistic trapezoidal number n .
III. Intuitionistic Trapezoidal Neutrosophic Fuzzy Graph Algorithm :

Advantages of the proposed Algorithm :

It is easy to understand a step wise representation and not dependent on any

programming language. So we introduce Intuitionistic Trapezoidal Neutrosophic Fuzzy
Graph Algorithm.
In this research, we using proposed algorithm for finding shortest path.
Step 1 :
Let d1  [ (0, 0, 0, 0 ), (0, 0, 0, 0) ], [ (1,1,1,1), (1,1,1,1) ],[ (1,1,1,1), (1,1,1,1) ] and the source

node as d1  [ (0, 0, 0, 0), (0, 0, 0, 0) ],[ (1,1,1,1), (1,1,1,1) ],[ (1,1,1,1), (1,1,1,1) ] . 
Step 2:
Find d j  minimum d i  d ij  ; j  2, 3, ....... n.
Step 3 :
If the minimum value of i . ie., i  r then the lable node j as [ d j , r ] . If minimum
arise related to more than one values of i . Their position we choose minimum value of i .
Step 4 :
Let the destination node be [ d n , l ] . Here source node is d n . We conclude a score
function and we finds minimum value of intuitionistic trapezoidal neutrosophic number.
Step 5 :
We calculate shortest path problem between source and destination node. Review the label
of node 1. Let it be as [ d n , A ] . Now review the label of node A and so on. Replicate the same
procedure until node 1 is procured.
Step: 6
The shortest path can be procured by combined all the nodes by the step 5.
IV. DATA ANALYSIS

To find shortest path on Chola period temples using intuitionistic trapezoidal
neutrosophic fuzzy graph.

In this chapter, AST denotes AmarasundreashwararTemple, GKCT denotes Gangai konda

cholapuram Temple, TKT denotes Thiruvanai Kovil Temple, MKT denotes Moovar Kovil
Temple, SST denotes Shri Suryanar Temple, BT denotes Brihadeeswarar Temple, and SAT
denotes Shri Airavatesvara Temple. Here, each node is converts as ITrNFN.
Here we consider source node is Amarasundreashwarar Temple and destination node
is Airavatesvara temple . To find shortest path on Amarasundreashwarar Temple to
Airavatesvara temple.
Node 1 = AmarasundreashwararTemple
Node 2 = Gangai konda cholapuram Temple
Node 3 = Thiruvanai Kovil Temple
Node 4 = Moovar Kovil Temple
Node 5 = Shri Suryanar Temple
Node 6 = Brihadeeswarar Temple
Node 7 = Shri Airavatesvara Temple
The distance (km) between temples are considered as the edges of the graph.
Considered distance are converted as Intuitionistic Trapezoidal Neutrosophic Fuzzy Graph
using the score function (fuzzification) of Intuitionistic Trapezoidal Neutrosophic Fuzzy
Graph.
1. Amarasundreashwarar Temple 2. Gangai konda cholapuram
3. Thiruvanai Kovil 4. Moovar Kovil

5. Shri Suryanar Temple 6. Brihadeeswarar Temple
7. Airavatesvara Temple
Here we consider source node is Amarasundreashwarar Temple and destination node is

Shri Airavatesvara temple . To find shortest path on Amarasundreashwarar Temple to Shri
Airavatesvara temple.
Fig 3 : A graph of Chola period buildted temples

Here distance between one temple to another temple is calculated in kilometers. The
numerical value of the distance is converted to ITrNFG with the help of through trapezoidal
signed distance.
The given distance ( kilometer) converted to neutrosophic number. We
converted neutrosophic number as (a1 , a 2 , a3 , a 4 ) are membership function &
(a1* , a 2*' , a 3*' , a 4* ) are non-membership function. These functions converted to fuzzy
a1  a 2  a3  a 4
trapezoidal numbers using trapezoidal signed distance . Finally converted
4
interval-valued intuitionistic trapezoidal neutrosophic fuzzy number.
Here, Apply the Intuitionistic Trapezoidal Neutrosophic Fuzzy Number in our
algorithm to find shortest path to Chola period temples.
In this application, many paths have chola period temples. To calculate Shortest
Path using score function( Definition 2.1 and 2.2).
An algorithm is used to apply a definite procedure and the process has been
expensive and time consuming
Here node 1-2 = 117 km
This km changed to neutrosophic number use neutrosophic score function, and
each neutrosophic number converted to fuzzification method, so we get fuzzy number. Finally
we convert membership and non-membership from fuzzy number because of Intuitionistic
fuzzy number, and use trapezoidal signed distance to membership and non-membership
functions. At last we get Intuitionistic Trapezoidal Neutrosophic Fuzzy Number.
820 340 131
0.82 0.34 0.131
(0.82, 0.18) (0.34, 0.66) (0.131, 0.869)
 [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45),
(0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ]), 
1-3= 35 km
350 142 105
0.35 0.142 0.105
(0.35, 0.65) (0.142, 0.858) (0.105, 0.895)

 [ (0.06, 0.35, 0.47, 0.52 ), (0.46, 0.57, 0.65, 0.92) ],[ (0.021, 0.079, 0.142, 0.326 ),
(0.772, 0.803, 0.858, 0.999 ) ],[ (0.048, 0.070, 0.105, 0.197 ), (0.729, 0.895, 0.957, 0.999) ] 
2-3= 125 km
955 425 157
0.955 0.425 0.157
(0.955, 0.045) (0.425, 0.575) (0.157, 0.843)
 [ ( 0.922, 0.955, 0.966,0.977 ), (0.027, 0.045, 0.051, 0.057) ], [ ( 0.344, 0.392, 0.425, 0.539 ),
(0.237, 0.575, 0.623, 0.865 ) ], [ ( 0.104, 0.124, 0.157, 0.243), ( 0.7 2 7, 0.8 4 3, 0.8 7 9, 0.9 2 3) ] 
2-5= 24 km
316 172 74
0.316 0.172 0.074
(0.316, 0.684) (0.172, 0.828) (0.074, 0.926)
 [ (0.125, 0.316, 0.396, 0.427 ), (0.475, 0.684, 0.725, 0.852 ) ], [ ( 0.057,0.172, 0.215, 0.244 ),
(0.679, 0.828, 0.88, 0.925 ) ], [ (0.042, 0.074, 0.085, 0.095), (0.883, 0.896, 0.926, 0.999) ]) 
2-6= 71 km
650 330 109
0.65 0.33 0.109
(0.65, 0.35) (0.33, 0.67) (0.109, 0.891)
 [ ( 0.41, 0.65, 0.72, 0.82 ), (0.06, 0.35, 0.42,0.57) ], [ (0.19, 0.28, 0.33, 0.52),
(0.51, 0.66, 0.69, 0.82) ], [ (0.043, 0.109, 0.112, 0.172), (0.7 5 1, 0.8 9 1, 0.9 5 6, 0.9 6 6) ] 
3-4= 48 km
465 220 103
0.465 0.22 0.103
(0.465, 0.535) (0.22, 0.78) (0.103, 0.897)
 [ (0.213, 0.465, 0.525, 0.657 ), (0.275, 0.535, 0.719, 0.611) ] , [ (0.07, 0.14, 0.22, 0.45 ),
( 0.55, 0.78, 0.84, 0.95) ] , [ ( 0.039, 0.085, 0.105, 0.185), (0.7 5 2, 0.8 9 7, 0.9 5 7, 0.9 8 2) ] 

4-6= 95 km
950 435 232
0.95 0.435 0.232
(0.95, 0.05) (0.435, 0.565) (0.232, 0.768)
 [ (0.89, 0.95, 0.97, 0.99), (0.01, 0.02, 0.05, 0.12 ) ] , [ (0.113, 0.435, 0.573, 0.619 ),
(0.293,0.565, 0.627, 0.775 ) ], [ (0.112, 0.128, 0.232, 0.456), (0.5 3 7, 0.7 6 8, 0.8 4 2, 0.9 2 5) ] 
5-6= 54 km
650 320 170
0.65 0.32 0.17
(0.65, 0.35) (0.32, 0.68) (0.17, 0.83)
 [ (0.37, 0.65, 0.71, 0.87), (0.06, 0.35, 0.47, 0.52) ] , [ (0.14, 0.25, 0.32, 0.57 ),
(0.22,0.68, 0.87, 0.95 ) ], [ (0.05, 0.09, 0.22, 0.32), (0.67, 0.83, 0.85, 0.97) ] 
5-7= 20 km
180 72 50
0.18 0.072 0.05
(0.18, 0.82) (0.072, 0.928) (0.05, 0.95)
 [ (0.06, 0.18, 0.21, 0.27), (0.71, 0.82, 0.84, 0.91) ] , [ (0.025, 0.072, 0.089, 0.102 ),
(0.879,0.928, 0.93, 0.975 ) ], [ (0.01, 0.04, 0.06, 0.09), (0.89, 0.95, 0.97, 0.99) ] 
6-7= 20 km
640 330 201
0.64 0.33 0.201
(0.64, 0.36) (0.33, 0.67) (0.201, 0.799)
 [ (0.52, 0.61, 0.64, 0.79), (0.25, 0.31, 0.36, 0.52) ] , [ (0.22, 0.3, 0.36, 0.44 ),
(0.59,0.64, 0.67, 0.78 ) ], [ (0.137, 0.155, 0.201, 0.311), (0.6 1 9, 0.7 9 9, 0.8 1 2, 0.9 6 6) ] 
In this iteration SPP was calculated through the proposed algorithm, the concept of the

Chola period temples shortest path calculated from Amarasundreashwarar Temple to Shri
Airavatesvara Temple.
Edges Intuitionistic trapezoidal fuzzy neutrosophic numbers

1 2  [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45),
(0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ]), 
1 3  [ (0.06, 0.35, 0.47, 0.52 ), (0.46, 0.57, 0.65, 0.92) ],[ (0.021, 0.079, 0.142, 0.326 ),
(0.772, 0.803, 0.858, 0.999 ) ],[ (0.048, 0.070, 0.105, 0.197 ), (0.729, 0.895, 0.957, 0.999) ] 
23  [ ( 0.922, 0.955, 0.966,0.977 ), (0.027, 0.045, 0.051, 0.057) ], [ ( 0.344, 0.392, 0.425, 0.539 ),
(0.237, 0.575, 0.623, 0.865 ) ], [ ( 0.104, 0.124, 0.157, 0.243), ( 0.727, 0.843, 0.879, 0.923 ) ] 
25  [ (0.125, 0.316, 0.396, 0.427 ), (0.475, 0.684, 0.725, 0.852 ) ], [ ( 0.057,0.172, 0.215, 0.244 ),
(0.679, 0.828, 0.88, 0.925 ) ], [ (0.042, 0.074, 0.085, 0.095), (0.883, 0.896, 0.926, 0.999) ]) 
26  [ ( 0.41, 0.65, 0.72, 0.82 ), (0.06, 0.35, 0.42,0.57) ], [ (0.19, 0.28, 0.33, 0.52),
(0.51, 0.66, 0.69, 0.82) ], [ (0.043, 0.109, 0.112, 0.172), (0.751, 0.891, 0.956, 0.966 ) ] 
34  [ (0.213, 0.465, 0.525, 0.657 ), (0.275, 0.535, 0.719, 0.611) ] , [ (0.07, 0.14, 0.22, 0.45 ),
( 0.55, 0.78, 0.84, 0.95) ] , [ ( 0.039, 0.085, 0.105, 0.185), (0.752, 0.897, 0.957, 0.982) ] 
46  [ (0.89, 0.95, 0.97, 0.99), (0.01, 0.02, 0.05, 0.12 ) ] , [ (0.113, 0.435, 0.573, 0.619 ),
(0.293,0.565, 0.627, 0.775 ) ], [ (0.112, 0.128, 0.232, 0.456), (0.537, 0.768, 0.842, 0.925) ] 
56  [ (0.37, 0.65, 0.71, 0.87), (0.06, 0.35, 0.47, 0.52) ] , [ (0.14, 0.25, 0.32, 0.57 ),
(0.22,0.68, 0.87, 0.95 ) ], [ (0.05, 0.09, 0.22, 0.32), (0.67, 0.83, 0.85, 0.97) ] 
57  [ (0.06, 0.18, 0.21, 0.27), (0.71, 0.82, 0.84, 0.91) ] , [ (0.025, 0.072, 0.089, 0.102 ),
(0.879,0.928, 0.93, 0.975 ) ], [ (0.01, 0.04, 0.06, 0.09), (0.89, 0.95, 0.97, 0.99) ] 
67  [ (0.52, 0.61, 0.64, 0.79), (0.25, 0.31, 0.36, 0.52) ] , [ (0.22, 0.3, 0.36, 0.44 ),
(0.59,0.64, 0.67, 0.78 ) ], [ (0.137, 0.155, 0.201, 0.311), (0.619, 0.799, 0.812, 0.966) ] 
Table 1: Intuitionistic trapezoidal fuzzy neutrosophic edge weight.

Let n = 7 is the destination node, since there are totally 7 nodes.
Here, Apply the ITrNFN in our algorithm to find shortest path to chola period
temples.
Iteration 1 :
Assume the source node is AmarasundreashwararTemple. Here we assume

d1   [ (0, 0, 0, 0), (0, 0, 0, 0) ],[ (1,1,1,1), (1,1,1,1) ],[(1,1,1,1), (1,1,1,1) ]  and label of source node
is
{  [ (0, 0, 0, 0), (0, 0, 0, 0) ],[ (1,1,1,1), (1,1,1,1) ],[(1,1,1,1), (1,1,1,1) ] ,  } the value of
d j , j  2, 3, 4, 5, 6 is succeeding: Here we assume d 1 is the Amarasundreashwarar Temple.
Iteration 2:
The node Gangai konda cholapuram Temple has only node
Amarasundreashwarar Temple as the predecessor.
ITrFNSP is calculated from Gangai konda cholapuram Temple to
Amarasundreashwarar Temple. Since node 2 has only node 1 as the predecessor. So fix i  1
and j  2 we apply step 2 at proposed algorithm.
= minimum
  [ (0, 0, 0, 0), (0, 0, 0, 0) ],[ (1,1,1,1), (1,1,1,1) ],[(1,1,1,1), (1,1,1,1) ]   

 
  [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45), 
(0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ] 
 
  [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45), 
 
= (0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), 
(0.727, 0.869, 0.924, 0.956 ) ]  
 
  [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45), 
 
= (0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), 
 (0.727, 0.869, 0.924, 0.956 ) ]  , 1 
 
  [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45), 
d2   
(0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ] 
The labeled node is Gangai konda cholapuram and minimum provided
corresponding node is Amarasundreashwarar Temple.
Minimum Node Labeled Path Node

Node
 [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ],

AST GKCT
[ (0.28, 0.29, 0.34, 0.45), (0.21, 0.66, 0.85, 0.92)],
[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ] 
Iteration 3 :
The node Thiruvanai Kovil Temple has two predecessors node, they are node
Amarasundreashwarar Temple and node Gangai konda cholapuram Temple.
ITrFNSP is calculated to Thiruvanai Kovil from Amarasundreashwarar
Temple and Gangai konda cholapuram. Since node 3 has two predecessors node 1 and node
2. So fix i  1, 2 and j  3 we apply step 2 at proposed algorithm.
d 3 = minimum d1  d13 , d 2  d 23 

= minimum
  [ ( 0, 0, 0, 0), ( 0, 0, 0, 0) ],[ (1,1,1,1), (1,1,1,1) ],[ (1,1,1,1), (1,1,1,1) ]   
 [ (0.06, 0.35, 0.47, 0.52 ), (0.46, 0.57, 0.65, 0.92) ],[ (0.021, 0.079, 0.142, 0.326 ), 
 
(0.772, 0.803, 0.858, 0.999 ) ],[ (0.048, 0.070, 0.105, 0.197 ), (0.729, 0.895, 0.957, 0.999) ]  , 
 
 [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45), 
(0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ]   
 
 [ ( 0.922, 0.955, 0.966,0.977 ), (0.027, 0.045, 0.051, 0.057) ], [ ( 0.344, 0.392, 0.425, 0.539 ), 
(0.237, 0.575, 0.623, 0.865 ) ], [ ( 0.104, 0.124, 0.157, 0.243), ( 0.727, 0.843, 0.879, 0.923 ) ]  
 
= minimum
  [ (0.06, 0.35, 0.47, 0.52 ), (0.46, 0.57, 0.65, 0.92) ],[ (0.021, 0.079, 0.142, 0.326 ), 
(0.772, 0.803, 0.858, 0.999 ) ],[ (0.048, 0.070, 0.105, 0.197 ), (0.729, 0.895, 0.957, 0.999) ]  , 
 
 
 [ ( 0.963, 0.992, 0.998 , 0.999), (0.134, 0.179, 0.222, 0.33) ],[ (0.096, 0.114, 0.145, 0.242), 

(0.049, 0.379, 0.529, 0.796) ],[ (0.0009, 0.016, 0.025, 0.055), (0.529, 0.732, 0.812, 0.882 )]  
Using equation (1),we have
  [ (0.06, 0.35, 0.47, 0.52 ), (0.46, 0.57, 0.65, 0.92) ],[ (0.021, 0.079, 0.142, 0.326 ), 
S 
(0.772, 0.803, 0.858, 0.999 ) ],[ (0.048, 0.070, 0.105, 0.197 ), (0.729, 0.895, 0.957, 0.999) ]  

S (n1 ) = 0.26
  [ ( 0.963, 0.992, 0.998 , 0.999), (0.134, 0.179, 0.222, 0.33) ],[ (0.096, 0.114, 0.145, 0.242), 
S 
(0.049, 0.379, 0.529, 0.796) ],[ (0.0009, 0.016, 0.025, 0.055), (0.529, 0.732, 0.812, 0.882 )] 

S (n 2 ) = 0.07476


 [ ( 0.963, 0.992, 0.998 , 0.999), (0.134, 0.179, 0.222, 0.33) ],[ (0.096, 0.114, 0.145, 0.242), 
 
(0.049, 0.379, 0.529, 0.796) ],[ (0.0009, 0.016, 0.025, 0.055), (0.529, 0.732, 0.812, 0.882 )] , 2 
 [ ( 0.963, 0.992, 0.998 , 0.999), (0.134, 0.179, 0.222, 0.33) ],[ (0.096, 0.114, 0.145, 0.242), 
d3   
(0.049, 0.379, 0.529, 0.796) ],[ (0.0009, 0.016, 0.025, 0.055), (0.529, 0.732, 0.812, 0.882 )] 
Here, the labeled node is Thiruvanai Kovil and the minimum provided
corresponding node is Gangai konda cholapuram Temple .
Minimum Labeled
Path Node
Node Node
 [ ( 0.963, 0.992, 0.998, 0.999), (0.134, 0.179, 0.222, 0.33) ],
GKCT TKT [ (0.096, 0.114, 0.145, 0.242), (0.049, 0.379, 0.529, 0.796)],
[ (0.0009, 0.016 , 0.025, 0.055), (0.529, 0.732, 0.812, 0.882 ) ] 
Iteration 4 :
The node Moovar Kovil has only node Thiruvanai Kovil as the predecessor.
ITrFNSP is calculated to Moovar Kovil from Thiruvanai Kovil.
proposed algorithm.
d 4 = minimum d 3  d 34 
= minimum
  [ ( 0.963, 0.992, 0.998 , 0.999), (0.134, 0.179, 0.222, 0.33) ],[ (0.096, 0.114, 0.145, 0.242), 
(0.049, 0.379, 0.529, 0.796) ],[ (0.0009, 0.016, 0.025, 0.055), (0.529, 0.732, 0.812, 0.882 )]   
 
 
  [ ( 0.213, 0.465, 0.525 , 0 .657 ), ( 0.275, 0.535, 0.719, 0.611) ] , [ ( 0.07, 0.14, 0.22, 0.45 ), 
( 0.55, 0.78, 0.84, 0.95) ] , [ ( 0.039, 0.085, 0.105, 0.185), (0.752, 0.897, 0.957, 0.982) ]  
  [ ( 0.97, 0.995, 0.999, 0.9996), (0.372, 0.618, 0.78, 0.739) ], 

 
=  [ (0.007, 0.016, 0.03, 0.1), (0.03, 0.29, 0.44, 0.76)], 
[ (0.00003, 0.001, 0.002, 0.01), (0.398, 0.657, 0.777, 0.866 ) ] 
 
 [ ( 0.97, 0.995, 0.999, 0.9996), (0.372, 0.618, 0.78, 0.739) ], 

 
=  [ (0.007, 0.016, 0.03, 0.1), (0.03, 0.29, 0.44, 0.76)], 
[ (0.00003, 0.001, 0.002, 0.01), (0.398, 0.657, 0.777, 0.866 ) ]  , 3
 

  [ ( 0.97, 0.995, 0.999, 0.9996), (0.372, 0.618, 0.78, 0.739) ], 

 
d 4   [ (0.007, 0.016, 0.03, 0.1), (0.03, 0.29, 0.44, 0.76)], 
[ (0.00003, 0.001, 0.002, 0.01), (0.3 9 8, 0.6 5 7, 0.7 7 7, 0.8 6 6) ] 
 
Here the labeled node is Moovar Kovil and the minimum provided corresponding node is
Thiruvanai Kovil.
Minimum Labeled
Path Node
Node Node
 [ ( 0.97, 0.995, 0.999, 0.9996), (0.372, 0.618, 0.78, 0.739) ],
[ (0.007, 0.016, 0.03, 0.1), (0.03, 0.29, 0.44, 0.76)],
TKT MKT
[ (0.00003, 0.001, 0.002, 0.01), (0.398, 0.657, 0.777, 0.866 ) ] 
Iteration 5 :
The node Shri Suryanar Temple has only node Gangai konda cholapuram
as the predecessor.
ITrFNSP is calculated to Shri Suryanar Temple from Gangai konda
cholapuram.
proposed algorithm.
d 5 = minimum d 2  d 25 
= minimum
  [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45), 
(0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ]   
 
 
  [ (0.125, 0.316, 0.396, 0.427 ), (0.475, 0.684, 0.725, 0.852 ) ], [ ( 0.057,0.172, 0.215, 0.244 ),

(0.679, 0.828, 0.88, 0.925 ) ], [ (0.042, 0.074, 0.085, 0.095), (0.883, 0.896, 0.926, 0.999) ])   
  [ ( 0.58, 0.877, 0.969, 0.994), (0.533, 0.728, 0.774, 0.895) ], 
 
=  [ (0.016, 0.049, 0.0731, 0.109), (0.142, 0.546, 0.748, 0.851)], 
 [ (0.0004, 0.009 , 0.0135, 0.021), (0.642, 0.779, 0.856, 0.955 ) ] 
 
 [ ( 0.58, 0.877, 0.969, 0.994), (0.533, 0.728, 0.774, 0.895) ], 

 
=  [ (0.016, 0.049, 0.0731, 0.109), (0.142, 0.546, 0.748, 0.851)], 
 [ (0.0004, 0.009 , 0.0135, 0.021), (0.642, 0.779, 0.856, 0.955 ) ]  , 2
 

  [ ( 0.58, 0.877, 0.969, 0.994), (0.533, 0.728, 0.774, 0.895) ],[ (0.016, 0.049, 0.0731, 0.109), 
d5   
(0.142, 0.546, 0.748, 0.851)],[ (0.0004, 0.009 , 0.0135, 0.021), (0.642, 0.779, 0.856, 0.955 ) ] 
Here the labeled node is Shri Suryanar Temple and the minimum provided
corresponding node is Gangai konda cholapuram .
Minimum Labeled
Path Node
Node Node
 [ ( 0.58, 0.877, 0.969, 0.994), (0.533, 0.728, 0.774, 0.895) ],

GKCT SST [ (0.016, 0.049, 0.0731, 0.109), (0.142, 0.546, 0.748, 0.851)],
[ (0.0004, 0.009 , 0.0135, 0.021), (0.642, 0.779, 0.856, 0.955 ) ] 
Iteration 6 :
The node Brihadeeswarar Temple has three predecessors node, they are node
Gangai konda cholapuram , node Moovar Kovil and node Shri Suryanar Temple. ITrFNSP
is calculated to Brihadeeswarar Temple from Gangai konda cholapuram , Moovar Kovil and
Shri Suryanar Temple . Since node 6 has three predecessors node 2, node 4 and node 5. So
fix i  2, 4, 5 and j  6 we apply step 2 at proposed algorithm.
d 6 = minimum d 2  d 26 , d 4  d 46 , d 5  d 56 
= minimum
  [ ( 0.52, 0.82, 0.95, 0.99), (0.11, 0.14, 0.18, 0.29) ], [ (0.28, 0.29, 0.34, 0.45), 
(0.21, 0.66, 0.85, 0.92)],[ (0.009, 0.131, 0.159, 0.225), (0.727, 0.869, 0.924, 0.956 ) ]   
 
 [ ( 0.41, 0.65, 0.72, 0.82 ), (0.06, 0.35, 0.42,0.57) ], [ (0.19, 0.28, 0.33, 0.52), 
 
(0.51, 0.66, 0.69, 0.82) ], [ (0.043, 0.109, 0.112, 0.172), (0.751, 0.891, 0.956, 0.966 ) ]  , 
 [ ( 0.97, 0.995, 0.999, 0.9996), (0.372, 0.618, 0.78, 0.739) ],[ (0.007, 0.016, 0.03, 0.1), 
 
(0.03, 0.29, 0.44, 0.76)],[ (0.00003, 0.001, 0.002, 0.01), (0.398, 0.657, 0.777, 0.866 ) ]   
 
 [ ( 0. 89, 0. 95, 0 . 97, 0 .99 ), ( 0. 01, 0 .02, 0 . 05, 0. 12 ) ] , [ ( 0. 113, 0 . 435, 0 . 573, 0 . 619 ), 
(0.293,0.565, 0.627, 0.775 ) ], [ (0.112, 0.128, 0.232, 0.456), (0.537, 0.768, 0.842, 0.925) ] , 
 
 [ ( 0.58, 0.877, 0.969, 0.994), (0.533, 0.728, 0.774, 0.895) ],[ (0.016, 0.049, 0.0731, 0.109), 
(0.142, 0.546, 0.748, 0.851)],[ (0.0004, 0.009 , 0.0135, 0.021), (0.642, 0.779, 0.856, 0.955 ) ]  
 
 [ (0.37, 0.65, 0.71, 0.87), (0.06, 0.35, 0.47, 0.52) ] , [ (0.14, 0.25, 0.32, 0.57 ), 
(0.22,0.68, 0.87, 0.95 ) ], [ (0.05, 0.09, 0.22, 0.32), (0.67, 0.83, 0.85, 0.97) ]  
 
= minimum

  [ (0.717, 0.937, 0.986, 0.998 ), (0.163, 0.441, 0.524, 0.694) ],[ (0.053, 0.081, 0.112, 0.234 ), 
(0.107, 0.436, 0.357, 0.754 ) ],[ (0.0004, 0.014, 0.018, 0.039 ), (0.546, 0.774, 0.883, 0.923) ]  , 
 
 [ (0.997, 0.9997, 0.99997, 0.99999), (0.378, 0.626, 0.79, 0.77) ],[ (0.0008, 0.007, 0.02, 0.06), 
 
(0.009, 0.164, 0.276, 0.589) ],[ (0.000003, 0.0001, 0.0005, 0.004), (0.214, 0.504, 0.654, 0.8 )] ,
 [(0.735, 0.957, 0.991, 0.999), (0.561, 0.8232, 0.88, 0.949)],[(0.002, 0.012,0.023, 0.062), 
 
(0.031, 0.371, 0.651, 0.808)],[ (0.00002, 0.0008, 0.003, 0.007), (0.43, 0.646, 0.728, 0.926)]  

  [ (0.717, 0.937, 0.986, 0.998 ), (0.163, 0.441, 0.524, 0.694) ],[ (0.053, 0.081, 0.112, 0.234 ), 
S 
(0.107, 0.436, 0.357, 0.754 ) ],[ (0.0004, 0.014, 0.018, 0.039 ), (0.546, 0.774, 0.883, 0.923) ] 

S (n1 )  0.16295
  [ (0.997, 0.9997, 0.99997, 0.99999), (0.378, 0.626, 0.79, 0.77) ],[ (0.0008, 0.007, 0.02, 0.06), 
S 
(0.009, 0.164, 0.276, 0.589) ],[ (0.000003, 0.0001, 0.0005, 0.004), (0.214, 0.504, 0.654, 0.8 )]  

S (n2 )  0.2874
  [(0.735, 0.957, 0.991, 0.999), (0.561, 0.8232, 0.88, 0.949)],[(0.002, 0.012,0.023, 0.062), 
S 
(0.031, 0.371, 0.651, 0.808)],[ (0.00002, 0.0008, 0.003, 0.007), (0.43, 0.646, 0.728, 0.926)] 

S (n3 )  0.2544
  [ ( 0.717, 0.937, 0.986, 0.998), (0.163, 0.441, 0.524, 0.694) ], 

 
 [ (0.053, 0.081, 0.112, 0.234), (0.107, 0.436, 0.357, 0.754)], 
[ (0.0004, 0.014 , 0.018, 0.039), (0.546, 0.774, 0.883, 0.923 ) ] , 2
 
 [ ( 0.717, 0.937, 0.986, 0.998), (0.163, 0.441, 0.524, 0.694) ],[ (0.053, 0.081, 0.112, 0.234), 
d6   
(0.107, 0.436, 0.357, 0.754)],[ (0.0004, 0.014 , 0.018, 0.039), (0.546, 0.774, 0.883, 0.923 ) ] 
Here, the labeled node is Brihadeeswarar Temple and the minimum provided
corresponding node is Gangai konda cholapuram .
Minimum Node Labeled Node Path Node
 [ ( 0.717, 0.937, 0.986, 0.998), (0.163, 0.441, 0.524, 0.694) ],
[ (0.053, 0.081, 0.112, 0.234), (0.107, 0.436, 0.357, 0.754)],
GKCT BT
[ (0.0004, 0.014 , 0.018, 0.039), (0.546, 0.774, 0.883, 0.923 ) ] 
Iteration 7:
The node Shri Airavatesvara Temple has two predecessors node, they are node Shri
Suryanar Temple and node Brihadeeswarar Temple. ITrFNSP is calculated to Shri

Airavatesvara Temple from Shri Suryanar Temple and Brihadeeswarar Temple Since node
7 has two predecessors node 5 and node 6. So fix i  5, 6 and j  7 we apply step 2 at
proposed algorithm.
d 7 = minimum d 5  d 57 , d 6  d 67 
= minimum
  [ ( 0.58, 0.877, 0.969, 0.994), (0.533, 0.728, 0.774, 0.895) ],[ (0.016, 0.049, 0.0731, 0.109), 
(0.142, 0.546, 0.748, 0.851)],[ (0.0004, 0.009 , 0.0135, 0.021), (0.642, 0.779, 0.856, 0.955 ) ]  
 
 [ (0.06, 0.18, 0.21, 0.27), (0.71, 0.82, 0.84, 0.91) ] , [ (0.025, 0.072, 0.089, 0.102 ), 
 
(0.879,0.928, 0.93, 0.975 ) ], [ (0.01, 0.04, 0.06, 0.09), (0.89, 0.95, 0.97, 0.99) ]  , 
 
 [ ( 0.717, 0.937, 0.986, 0.998), (0.163, 0.441, 0.524, 0.694) ],[ (0.053, 0.081, 0.112, 0.234), 
(0.107, 0.436, 0.357, 0.754)],[ (0.0004, 0.014 , 0.018, 0.039), (0.546, 0.774, 0.883, 0.923 ) ]   
 
 [ (0.52, 0.61, 0.64, 0.79), (0.25, 0.31, 0.36, 0.52) ] , [ (0.22, 0.3, 0.36, 0.44 ), 
(0.59,0.64, 0.67, 0.78 ) ], [ (0.137, 0.155, 0.201, 0.311), (0.619, 0.799, 0.812, 0.966) ]  
 
= minimum
  [ ( 0.605, 0.899, 0.9755, 0.996), (0.864, 0.951, 0.964, 0.99) ],[ (0.0004, 0.0035, 0.006, 0.011), 
(0.125, 0.507, 0.696, 0.829)],[ (0.000004, 0.0004 , 0.0008, 0.002), (0.057, 0.74, 0.83, 0.945 ) ]  ,
 
 
 [ ( 0.864, 0.975, 0.995, 0.999), (0.372, 0.614, 0.695, 0.853) ],[ (0.011, 0.024, 0.04, 0.1), 
(0.06, 0.279, 0.239, 0.588) ],[ (0.00005, 0.002, 0.004, 0.01), (0.338, 0.618, 0.716, 0.892 )]  

Therefore,

S (n1 )  0.2563

S (n2 )  0.3072
  [ ( 0.605, 0.899, 0.9755, 0.996), (0.864, 0.951, 0.964, 0.99) ], 

 
 [ (0.0004, 0.0035, 0.006, 0.011), (0.125, 0.507, 0.696, 0.829)], 
[ (0.000004, 0.0004 , 0.0008, 0.002), (0.057, 0.74, 0.83, 0.945 ) ] , 5
 
 [ ( 0.605, 0.899, 0.9755, 0.996), (0.864, 0.951, 0.964, 0.99) ],[ (0.0004, 0.0035, 0.006, 0.011), 
d6   
(0.125, 0.507, 0.696, 0.829)],[ (0.000004, 0.0004 , 0.0008, 0.002), (0.057, 0.74, 0.83, 0.945 ) ] 
The labeled node is Shri Airavatesvara Temple and the minimum provided
corresponding node is Shri Suryanar Temple.

Minimum
Labeled Node Path Node
Node
 [ ( 0.605, 0.899, 0.9755, 0.996), (0.864, 0.951, 0.964, 0.99) ],
SST SAT [ (0.0004, 0.0035, 0.006, 0.011), (0.125, 0.507, 0.696, 0.829)],
[ (0.000004, 0.0004 , 0.0008, 0.002), (0.057, 0.74, 0.83, 0.945 ) ] 
Since Shri Airavatesvara Temple is the destination node .

We calculate SP to destination node to source node. Since
Labeled Node Minimum Node
Shri Airavatesvara Temple Shri Suryanar Temple
Shri Suryanar Temple. Gangai konda cholapuram
Gangai konda cholapuram Amarasundreashwarar Temple
Therefore the Chola period temples intuitionistic nether trapezoidal

neutrosophic fuzzy graph shortest path is
Fig 4 : SP from Amarasundreashwarar Temple to Shri Airavatesvara temple.

V. SHORTEST PATH ON DIJKSTRA’S ALGORITHM :
In the above real life application, we clarify another method of SPP using Dijkstra‟s
algorithm. In this SPP, we use direct method of Dijkstra‟s algorithm and we assume edge
weight is Chola period buildted temples km.

Fig 5 : SP for Dijkstra’s Algorithm.

Here, we verify Chola period buildted temples shortest path through Dijkstra‟s
Algorithm. We have the paths are
1 2  5  7
Here these two paths intuitionistic trapezoidal neutrosophic fuzzy graphs and Dijkstra‟s
Algorithm are same. The shortest path is
1 2  5  7
VI . Conclusion :
In this article, discovering Shortest Path on Chola period buildted temples using
intuitionistic trapezoidal neutrosophic fuzzy graph. A genuine application is given to act as an
intuitionistic trapezoidal neutrosophic fuzzy graph. Finally checked most brief way SP on
Chola period buildted temples with Dijkstra'algorithm.
.
References :
1. Ahuja RK, Mehlhrn K, Orlin JB, Tarjan RE (1990) Faster algorithms for the shortest
path problem. J ACM 37:213-223.
2. Yang CD, Lee DT, Wong CK (1992) On bends and lengths of rectilinear paths : a
graph theoretic approach. Int J Comput Geom Appl 2(1): 61-74.
3. Arsham H (1998) Stability analysis for the shortest path problem. Conf J Numer
Themes 133:171-210.

4. Broumi S, Bakali A, Talea M, Smarandache F, Vladareanu L(2016) Applying Dijkstra

algorithm for solving neutrosophic shortest path problem. In: International conference
on advanced mechatronic systems (ICAMechS) 2016.
5. Ye, J.Multiple-attribute decision-making method under a single-valued neutrosophic
hesitant fuzzy environment J.Intell.syst.2014, 24, 23-36
6. Broumi S, Bakali A, Mohamed T, Smarandache F, Vladareanu L(2016) Shortest path
problem under triangular fuzzy neutrosophic information. In: 10th International
conference on software, knowledge, information management and applications
(SKIMA), pp 169-174.
7. Broumi S, Mohamed T, Bakali A, Smarandache F (2016) Single valued neutrosophic
graphs. J New Theory 10:86-101.
8. Smarandache F(2005) A unifying field in logic. Neutrosophy: neutrosophic probability,
set, logic, 4th edn. American Research Press, Rehoboth.
9. Wang H, Smarandache F, Zhang Y, Sunderraman R (2010) Single value neutrosophic
sets Multisp Multistruct 4:410-413.
10. J Ye Trapezoidal fuzzy neutrosophic set and its application to multiple attribute
decision making Neural Computing and Applications.2014 DOI 10.1007
s00521-014-1787-6.
11. Chiranjibe Jana, Madhumangal Pal, Faruk Karaaslan, Jian-qiang Wang, Trapezoidal
neutrosophic aggregation operators and its application in multiple attribute decision
making process. 2018.
12. Ye, J., Trapezoidal neutrosophic set and its application to multiple attribute decision
making, Neural computing and Applications, 26(5), pp. 1157-1166, (2015).
13. Ye, J.Trapezoidal neutrosophic set and its application to multiple attribute
decision-making, Neural comput. Appl. 2015, 26, 1157-1166.
14. Ye, J., Multi criteria decision-making method using the Dice similarity measure
between expected intervals of trapezoidal fuzzy numbers, Journal of Decision Systems,
21(4), pp. 307-317, (2012).
15. H Wang, F Smarandache, Y Zhang and R Sunderraman, “ Single valued Neutrosophic
Sets” Fuzzy Sets and Systems, Vol 20, 1986, pp: 87-96.
16. Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, “ Shortest Path
Problem Under Trapezoidal Neutrosophic Information, 2017, pp: 1-7
17. P.K.De and Amita Bhinchar. Computation of Shortest Path in a fuzzy network.
International journal computer applications. 11(2), 2010. pp 0975-8887.

18. Smarandache, F. A unifying field in logics: Neutrosophic logic, Neutrosophic set,

Neutrosophic probability and statistics, 4th ed.; American Research press: Rehoboth,
DE, USA, 1998.
19. P.Jayagowri and G. G. Ramani, Using Trapizoidal Intuitionistic Fuzzy Number to Find
Optimized Path in a Network. Volume2014. Advances in Fuzzy Systems , 2014, 6
pages.
20. A Kumar and M kaur, A New Algorithm for Solving Shortest Path Problem on a
Network with Imprecise Edge Weight. Applications and Applied Mathematics. Vol.
6, Issue 2, 2011, pp 602-619.
21. G Kumar, R. K. Bajaj and N Gandotra, “Algorithm for shortest path problem in a
network with interval valued intuitionistic trapezoidal fuzzy number. Procedia
Computer Science 70, 2015, pp 123-129.
22. S Majumdar and A pal, Shortest path problem on Intuitionistic Fuzzy Network, Annals
of Pure and Applied Mathematics, Vol. 5, No. 1, November 2013, pp 26-36.
23. Xu, Z.S., Methods for aggregating interval-valued intuitionistic fuzzy information and
their application to decision making, Control and decision, 22(2), pp 215-219, 2007.
24. Broumi S, Mohamed T, Bakali A, Smarandache F, Krishnan KK (2017) Shortest path
problem on single valued neutrosophic graphs. In: International symposium on
networks, computers and communications.
25. Deli I, Subas Y(2017) A ranking method of single valued neutrosophic numbers and
its applications to multi-attribute decision making problems. Int J Mach Learn Cybern
8(2017) : 1309-1322.
26. Enayattabar M, Ebrahimnejad A, Motameni H(2018) Dijkstra algorithm for shortest
path problem under interval-valued Pythagorean fuzzy environment. Complex Intell
sSyst 1-8.
27. Broumi ,S.; Bakali, A.; Talea, M.; Smarandache, F.; Ali, M.; Shortest path under
Bipolar Neutrosophic setting. Appl.Mech.Mater.2017, 859, 59-66.
28. Deli I (2018) Operators on single valued trapezoidal neutrosophic numbers and
SVTN-group decision making . Neutrosophic Sets Syst 22: 131-151.
29. Kumar R, Edaltpanah SA, Jha S, Broumi S, Dey A (2018) Neutrosophic shortest path
problem. Neutrosophic Sets Syst 23: 5-15.
30. Broumi, S.; Bakali, A.; Talea, M.; Smarandache, F.; Kishore, P.K.; Sachin, R.;
Shortest path problem under interval-valued neutrosophic setting. Int. J. Adv. Trends
Compt. Sci. Eng. 2019, 8, 216-222.

31. K.Kalaiarasi, R.Divya, The shortest path on minimal spanning tree with triangular
single-valued neutrosophic intuitionistic fuzzy graph, Parishodh journal,2020, IX,
3899-3903.

CHAPTER – 19
NS(WπG)Closed Sets InNeutrosophic TopologicalSpaces

R. Suresh 1,S. Palaniammal2
1
Department of Science and Humanities,Sri Krishna College of Engineering and
Technology,Coimbatore,Tamil Nadu, India.
2
Principal,Sri Krishna Adithya College of Arts and Science,Coimbatore, Tamil Nadu,
India.
Email:rsuresh6186@gmail.com 1, splvlb@yahoo.com2
1. Introduction
Neutrosophicidea have wide range of application in engineering ,scientific and real life.
Neutrosophic set are contain (MMembership, I-Indeterminacy, NM-Non
Membership).Salamapresented Neutrosophic topologicalspaces(NS-T-S).This chapter is
sorted out into five section. In the main segment authentic improvement of the ideas were
talked about. Second part is committed for fundamental definitions and results, required for
this work. Third part is NS(WπG)CSare introduced.NS(W𝜋G)OSinitiated in 4th part. In the 5th
part NS(WπG)) homeomorphism are discusseddetailed.Reasonable example each given in
each parts. NS(G)CS presented by R.Dhavaseelan et.al.,R,Suresh et al introducedNS(WG)CS
and also share idea of NS(WG) separation axioms.In this article is we exhibitedNS(WπG)CS,
NS(WπG)OSin NSTS.
2. Preliminaries :
In this part, we survey required fundamental definition and consequences of
Neutrosophic
Definition 2.1 (5).
Let R∗1 and R∗2 are two Neutrosophic sets, ∀r ∈ NX∗
R∗1 = {< 𝑟, μR ∗1 r , σR ∗1 r , γR ∗1 r >: 𝑟 ∈ NX∗ },R∗2 = {< 𝑟, μR ∗2 r , σR ∗2 r , γR ∗2 r >: 𝑟 ∈ NX∗ }
(i).R∗1 C = {< 𝑟, γR ∗1 ( r ), 1 − σR ∗1 r , μR ∗1 r >: 𝑟 ∈ NX∗ }

(ii).R∗1 ⊆ R∗2 ⇔ μR ∗1 r ≤ μR ∗2 r , σR ∗1 r ≤ σR ∗2 r & γR ∗1 r ≥ γR ∗2 r }
(iii).R∗1 ∩ R∗2 = {< 𝑟, μR ∗1 r ∩ μR ∗2 r , σR ∗1 r ∩ σR ∗2 r , γR ∗1 r ∪ γR ∗2 r >: 𝑟 ∈ NX∗ }

(i𝑣)R∗1 ∪ R∗2 = {< 𝑟, μR ∗1 r ∪ μR ∗2 r , σR ∗1 r ∪ σR ∗2 r , γR ∗1 r ∩ γR ∗2 r >: 𝑟 ∈ NX∗ }
Definition 2.2 (11).

Let NX∗ be non-empty set and NSτ be the collection of Neutrosophic subsets of NX∗ satisfying
the accompanying properties :
1.0N , 1N ∈ NSτ
2.NT 1 ∩ NT 2 ∈ NSτ for any NT 1 , NT 2 ∈ NSτ
3. ∪ NT i ∈ NSτ for every {NT i : i ∈ j} ⊆ NSτ
Then (NX∗ , NSτ ) is called a Neutrosophic topologicalspace(NS-T-S).
Definition 2.3.
Let ( NX∗ , NSτ ), be a NS-T-S and R∗1 = {< 𝑟, μR ∗1 r , σR ∗1 r , γR ∗1 r >: 𝑟 ∈ NX∗ } be a
Neutrosophic set in NX∗ . Then R∗1 is said to be
1. Neutrosophicα-closed set [1] (NS- αCS in short) NS-cl(NS-in(NS-cl(R∗1 )))⊆ R∗1 ,
2. Neutrosophicpre-closed set [14] (NS-PCS in short) NS-cl(NS-in(R∗1 ))⊆ R∗1 ,
3. Neutrosophic regular closed set [1] (NS-RCS in short) NS-cl(NS-in(R∗1 ))=R∗1 ,
4. Neutrosophic π open[23] if R∗1 union of NS(R)OSs,
5. Neutrosophic semi closed set [8] (NS-SCS in short) NS-in(NS-cl(R∗1 ))⊆ R∗1 ,
6. Neutrosophic generalized closed set [3] (NS-GCS in short) NS-cl(R∗1 ⊆H whenever
R∗1 ⊆H and H is aNS-OS,
7. Neutrosophicα generalized closed set [9] (NS- (αG)CS in short) NS-α-cl(R∗1 )⊆H
whenever R∗1 ⊆H And H is aNS-OS,
8. Neutrosophic generalized semi closed set [16](NS-(GS)CS in short) NS-Scl(R∗1 )⊆H
whenever R∗1 ⊆H and H is aNS-OS.
3. NEUTROSOPHIC WEAKLY π GENERALIZED CLOSED SET
3rd sectionNeutrosophicweakly π generalized closed set is defined. Some of its
propertiesare derived.
Definition 3.1:
An NSSR∗1 is said to beNeutrosophicweakly π generalized closed set(NS(WπG)CS)
(NS(WπG)CS) in (𝑁𝑋∗ , 𝑁𝑆𝜏 ), ifNScl(NSint(R∗1 )) ⊆‍ 𝑈1∗ whenever R∗1 ⊆‍ 𝑈1∗ and ∗
1 is a
NS(π)CS in 𝑁𝑋∗ .

The family of all NS(WπG)CS of aNSTS(𝑁𝑋∗ , 𝑁𝑆𝜏 )is denoted by NS(WπG)CS(𝑁𝑋∗ ).
Example 3.2:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
letNSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ , where
2 5 7 2 5 6
𝑁𝑇∗ = 〈r, , , , , , 〉.
10 10 10 10 10 10
2 5 8 1 5 7
NSSR∗1 = = 〈r, , , , , , 〉is a NS(WπG)CS in 𝑁𝑋∗ .
10 10 10 10 10 10
Proposition 3.3:
Every NSCS is a NS(WπG)CS
Proof:
Let R∗1 beNSCS in 𝑁𝑋∗ and let R∗1 ⊆‍ 𝑈1∗ and 𝑈1∗ is a NSOS in (𝑁𝑋∗ , 𝑁𝑆𝜏 ). Since
NScl R∗1 = R∗1 , then NS𝑐𝑙 R∗1 ⊆‍ 𝑈1∗ .ButNS𝑐𝑙(NSint R∗1 ⊆‍NScl R∗1 ⊆‍ 𝑈1∗ . In
furtherexpressions, NScl(NSint R∗1 ) ⊆‍ 𝑈1∗ . ThereforeR∗1 is a NS(WπG)CS in 𝑁𝑋∗ .
Example 3.4:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and let NSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ where
3 5 7 4 5 6
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
1 5 9 2 5 8
NSSR∗1 =〈r, , , , , , 〉
10 10 10 10 10 10
is a NS(WπG)CS in 𝑁𝑋∗ ,although not NSCS in 𝑁𝑋∗ .

7 5 3 6 5 4
Because NScl R∗1 = 〈r, , , , , , 〉= 𝑁𝑇∗ 𝐶 ≠‍ R∗1 .
10 10 10 10 10 10
Proposition 3.5:
Every NS(α)CSis a NS(WπG)CS .
Proof:
Let R∗1 beNS(α)CS in 𝑁𝑋∗ and let R∗1 ⊆‍ 𝑈1∗ and 𝑈1∗ is a NSOS in (𝑁𝑋∗ , 𝑁𝑆𝜏 ). Since R∗1 is
NS(α)CS, NScl(NSint(NScl R∗1 ))⊆ R∗1 . Therefore
NScl(NSint R∗1 )⊆NScl(NSint(NScl R∗1 ))⊆ R∗1 ⊆ U1∗ . ThereforeNScl(NSint R∗1 )⊆‍ 𝑈1∗ .
Hence R∗1 is a NS(WπG)CS in 𝑁𝑋∗ .

Example 3.6:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
letNSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ where
4 5 6 2 5 8
𝑁𝑇∗ =〈r, , , , , , 〉
10 10 10 10 10 10
4 5 6 2 5 8
Then NSSR∗1 == 〈r, , , , , , 〉is a NS(WπG)CS in 𝑁𝑋∗
10 10 10 10 10 10
but not NS(α)CS in 𝑁𝑋∗ ,

sinceR∗1 ⊆‍ 𝑁𝑇∗ but NScl(NSint(NScl R∗1 )) = 𝑁𝑇∗ 𝐶 ⊈‍ R∗1 .
Proposition 3.7:
Every NS(G)CSis a NS(WπG)CS .
Proof:
Let R∗1 beNS(G)CS in 𝑁𝑋∗ and let R∗1 ⊆‍ 𝑈1∗ and 𝑈1∗ is a NSOS in (𝑁𝑋∗ , 𝑁𝑆𝜏 ). By
hypothesis, NScl R∗1 ⊆𝑈1∗ , NScl(NSint R∗1 ⊆NScl R∗1 .Therefore NSclNSintR∗1 ⊆‍
NScl(R∗1 ‍⊆‍ 𝑈1∗ . Thus NScl(NSint R∗1 ) ⊆‍ 𝑈1∗ . Hence R∗1 is aNS(WπG)CS in 𝑁𝑋∗ .
Example 3.8:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
let NSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ where
2 5 7 3 5 6
𝑁𝑇∗ =〈r, , , , , , 〉
10 10 10 10 10 10
2 5 8 2 5 7
Then NSS =〈r, , , , , , 〉is a NS(WπG)CS in 𝑁𝑋∗ ,
10 10 10 10 10 10
although not NS(G)CS in 𝑁𝑋∗ .

8 5 2 7 5 2
BecauseR∗1 ⊆‍ 𝑁𝑇∗ but NScl R∗1 =〈r, , , , , , 〉⊈ 𝑁𝑇∗ .
10 10 10 10 10 10
Proposition 3.9:
Every NS(R)CSis a NS(WπG)CS .
Proof:
Let R∗1 beNS(R)CS in (𝑁𝑋∗ , 𝑁𝑆𝜏 ). Let 𝑈1∗ beNSOSsuch that R∗1 ⊆‍ 𝑈1∗ .
ByDefinition,NScl(NSint(R∗1 ))= R∗1 ⊆‍ 𝑈1∗ . It implies, that NScl(NSint R∗1 )⊆‍ 𝑈1∗ . Hence
R∗1 is a NS(WπG)CS in 𝑁𝑋∗ .

Example 3.10:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
letNSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗
5 5 3 6 5 3
where𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
3 5 6 3 5 6
Then NSSR∗1 =〈r, , , , , , 〉is a NS(WπG)CS in 𝑁𝑋∗ ,
10 10 10 10 10 10
although not NS(R)CS in 𝑁𝑋∗ since NScl(NSint R∗1 ) = 0NS ≠‍ R∗1 .
Proposition 3.11:
Every NS(P)CS is a NS(WπG)CS .
Proof:
Let R∗1 beNS(G)CS in (𝑁𝑋∗ , 𝑁𝑆𝜏 ). Let 𝑈1∗ be NSπOS such that R∗1 ⊆‍ 𝑈1∗ . SinceR∗1 is
NS(P)CS, NScl(NSint(R∗1 ⊆‍ R∗1 and R∗1 ⊆‍ 𝑈1∗ . This implyNScl(NSint R∗1 )⊆‍ 𝑈1∗ .
thereforeR∗1 is a NS(WπG)CS in 𝑁𝑋∗ .
Example 3.12:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
4 5 6 3 5 7
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
6 5 4 5 5 3
10 10 10 10 10 10
although not NS(P)CS in, since NScl(NSint R∗1 )= 𝑁𝑇∗ 𝐶 ⊈ R∗1 .
Proposition 3.13:
Every NS(αG)CSis a NS(WπG)CS .
Proof:
Let R∗1 beNS(αG)CS in (𝑁𝑋∗ , 𝑁𝑆𝜏 ). Let 𝑈1∗ beNSOSsuch that R∗1 ⊆‍ 𝑈1∗ . Byhypothesis,
NScl(NSint(NScl R∗1 )⊆‍ 𝑈1∗ .This implies NScl(NSint(NScl R∗1 )⊆‍
𝑈1∗ andNScl(NSint R∗1 )⊆NScl NSint
(NScl R∗1 ))⊆‍ 𝑈1∗ .So, NScl(NSint R∗1 )⊆‍ 𝑈1∗ .Hence R∗1 is a NS(WπG)CS in 𝑁𝑋∗ .

Example 3.14:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
4 5 6 6 5 4
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
3 5 7 4 5 5
10 10 10 10 10 10
although not NS(αG)CS in 𝑁𝑋∗ since, NScl(NSint(NScl(R∗1 )))⊈R∗1 .
Proposition 3.15:
NS(S)CS and NS(WπG)CS are independent to allfurther.
Figure No. I Comparison NS(WπG)CS with other closed sets
Example 3.16:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
3 5 5 2 5 6
𝑁𝑇∗ = 〈r, , , , , , 〉.
10 10 10 10 10 10
3 5 5 2 5 6
Then NSSR∗1 = 〈r, , , , , , 〉is a NS(S)CS in 𝑁𝑋∗ ,
10 10 10 10 10 10
Although not NS(WπG)CS in 𝑁𝑋∗ , sinceR∗1 ⊆𝑁𝑇∗ ,

5 5 3 6 5 2
butNScl(NSint R∗1 ) =〈r, , , , , , 〉⊈𝑁𝑇∗ .
10 10 10 10 10 10

Example 3.17:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
8 5 2 6 5 3
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
7 5 3 5 5 4
Then NSSR∗1 = 〈r, , , , , , 〉is a NS(WπG)CS
10 10 10 10 10 10
although not NS(S)CS in 𝑁𝑋∗ ,since NSint(NScl R∗1 )= 1NS⊈R∗1 .
Proposition 3.18:
NS(GS)CS and NS(WπG)CS are independent to each other which can be seen from
thefollowing example.
Example 3.19:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
2 5 8 4 5 6
𝑁𝑇∗ = 〈r, , , , , , 〉.
10 10 10 10 10 10
2 5 8 4 5 6
Then NSSR∗1 = 〈r, , , , , , 〉 = 𝑁𝑇∗ is a NS(GS)CS in 𝑁𝑋∗ ,
10 10 10 10 10 10
although not NS(WπG)CS in 𝑁𝑋∗ , since R∗1 ⊆𝑁𝑇∗

8 5 2 6 5 4
butNScl(NSint R∗1 =〈r, , , , , , 〉 = 𝑁𝑇∗ 𝐶 ⊈𝑈1∗ .
10 10 10 10 10 10
Example 3.20:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
letNSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ ,where
8 5 2 9 5 1
𝑁𝑇∗ = 〈r, , , , , , 〉.
10 10 10 10 10 10
6 5 4 7 5 3
Then NSSR∗1 =〈r, , , , , , 〉is a NS(WπG)CS,
10 10 10 10 10 10
although not NS(GS)CS in 𝑁𝑋∗ ,since R∗1 ∪NSint NScl R∗1 )=1NS⊈𝑁𝑇∗ .
Remark 3.21:
Union of any two NS(WπG)CS need not beNS(WπG)CS.
Example 3.22:
Let 𝑁 ∗ = {𝑟1∗ , 𝑟2∗ } and


5 5 5 8 5 2
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
2 5 8 8 5 2
Then NSSR∗1 =〈r, , , , , , 〉 and
10 10 10 10 10 10
5 5 5 7 5 3
R∗2 =〈r, , , , , , 〉
10 10 10 10 10 10
areNS(WπG)CS, but R∗1 ∪R∗2 is not aNS(WπG)CS in 𝑁𝑋∗ ,

sinceNScl(NSint(R∗1 ∪R∗2 ))=1NS⊈𝑁𝑇∗
4. NS(W𝜋G) OPEN SET

In this part the notionNeutrosophicweakly π generalized open set is initiated. Some of
itsProperty are obtained.
Definition 4.1:
ANSSR∗1 is assumed to beNeutrosophicweakly π generalized open set(NS(W𝜋G)OS) in
(𝑁𝑋∗ , 𝑁𝑆𝜏 ),if the complement R∗1 C is a NS(W𝜋G)CS in 𝑁𝑋∗ .
Example 4.2:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
letNSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ , where
2 5 7 2 5 6
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
8 5 2 7 5 1
Then the NSSR∗1 =〈r, , , , , , 〉is a NS(W𝜋G)OS in 𝑁𝑋∗ .
10 10 10 10 10 10
Proposition 4.3:
For any NSTS(𝑁𝑋∗ , 𝑁𝑆𝜏 ), the subsequent are true.
i)Every NSOSis a NS(W𝜋G)OS.
ii)EveryNS(α)OSis a NS(W𝜋G)OS.
iii)EveryNS(G)OSis a NS(W𝜋G)OS.
iv)EveryNS(P)OS is a NS(W𝜋G)OS.
The above outcomeable to proved as prop (3.1) to prop (3.8).
Example 4.4:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and let NSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ where

3 5 7 4 5 6
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
9 5 1 8 5 2
Then NSSR∗1 =〈r, , , , , , 〉is a NS(W𝜋G)OS in 𝑁𝑋∗ ,
10 10 10 10 10 10
althoughnot NSOS in 𝑁𝑋∗ .
Example 4.5:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
4 5 6 2 5 8
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
6 5 4 8 5 2
Then NSSR∗1 =〈r, , , , , , 〉is a NS(W𝜋G)OS in 𝑁𝑋∗ ,
10 10 10 10 10 10
howevernot NS(α)OS in 𝑁𝑋∗ .
Example 4.6:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
2 5 7 3 5 6
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
8 5 2 7 5 2
Then the NSSR∗1 =〈r, , , , , , 〉is NS(W𝜋G)OS in𝑁𝑋∗ ,
10 10 10 10 10 10
although not NS(G)OS in 𝑁𝑋∗ .
Example 4.7:
Let 𝑁𝑋∗ = {𝑟1∗ , 𝑟2∗ } and
4 5 6 3 5 7
𝑁𝑇∗ =〈r, , , , , , 〉.
10 10 10 10 10 10
4 5 6 3 5 5
Then NSSR∗1 = 〈r, , , , , , 〉is a NS(W𝜋G)OS in 𝑁𝑋∗ ,
10 10 10 10 10 10
although not NS(P)OS in 𝑁𝑋∗ .
Remark 4.8:
The intersection of any two NS(WπG)CS need not beNS(WπG)CS in general as seenfrom
the following example.

Example 4.9:
Let 𝑁𝑋∗ ={𝑟1∗ , 𝑟2∗ } and
letNSτ ={0NS, 𝑁𝑇∗ , 1NS}beNST on 𝑁𝑋∗ ,where
5 5 5 8 5 2
𝑁𝑇∗ = 〈r, , , , , , 〉.
10 10 10 10 10 10
8 5 2 2 5 8
Then NSSR∗1 = 〈r, , , , , , 〉and
10 10 10 10 10 10
5 5 5 3 5 7
R∗2 = 〈r, , , , , , 〉are NS(WπG)CS in 𝑁𝑋∗ ,
10 10 10 10 10 10
butR∗1 ∩‍ R∗2 is not aNS(W𝜋G)OS in 𝑁𝑋∗ .
Theorem 4.10:
ANSSR∗1 of aNSTS(𝑁𝑋∗ , 𝑁𝑆𝜏 )is a NS(W𝜋G)OSiffF1∗ ⊆‍NSint NScl R∗1 )wheneverF1∗ is a
NSCS and F1∗ ⊆‍ R∗1 .
Proof:
Necessary Part:
Suppose R∗1 is a NS(W𝜋G)OS in 𝑁𝑋∗ .Let F1∗ beNSCS in (𝑁𝑋∗ , 𝑁𝑆𝜏 )and F1∗ ⊆‍ R∗1 . ThenF1∗ C is a
NSOS in 𝑁𝑋∗ such that R∗1 C ⊆‍ F1∗ C .SinceR∗1 C is a NS(W𝜋G)CS, NScl(NSint R∗1 C ) ⊆‍ F1∗ C
. ThereforeNSint(NScl R∗1 C )⊆‍ F1∗ C . This implies F1∗ ⊆‍NSint NScl R∗1 ) .
Sufficient Part:
Let R∗1 beNSS of 𝑁𝑋∗ and letF1∗ ⊆‍NSint NScl R∗1 )whenever F1∗ is a NSCS and F1∗ ⊆‍
R∗1 . ThenR∗1 C ⊆F1∗ C and F1∗ C is a NSOS. By definition, NSint(NScl R∗1 C )⊆‍ F1∗ C . Therefore
NScl(NSint R∗1 C ) ⊆‍ F1∗ C . Hence

A is a NS(W𝜋G)OS of 𝑁𝑋∗ .
5.NEUTROSOPHICWEAKLY π GENERALIZED HOMEOMORPHISM
Definition 5.1:
Let (NX∗ , NSτ ) and (NY∗ , NSσ )be two NSTS. A bijection mapping Nf∗ :(NX∗ , NSτ ) →(NY∗ , NSσ )is
called an Neutrosophicweakly π generalized (NS(WπG)) homeomorphism if, both the
functions, Nf∗ and Nf∗−1 are NS(WπG) continuous maps.

Example 5.2:
Let NX∗ ={𝑟1∗ , 𝑟2∗ , 𝑟3∗ } ,NY∗ ={𝑠1∗ , 𝑠2∗ , 𝑠3∗ } ,
2 5 8 3 5 6 4 5 6
NT∗ 1 =〈r, , , , , , , , , 〉 and
10 10 10 10 10 10 10 10 10
8 5 2 6 5 3 6 5 4
NT∗ 2 =〈s, , , , , , , , , 〉.
10 10 10 10 10 10 10 10 10
Then NSτ = { 0NS, NT∗ 1 , 1NS } and NSσ = { 0NS, NT∗ 2 , 1NS }are NSTS on NX∗ and NY∗
respectively.
Define a bijection mapping Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )by Nf∗ 𝑟1∗ = 𝑠1∗ , Nf∗ 𝑟2∗ = 𝑠2∗ and
Nf∗ 𝑟3∗ = 𝑠3∗ . Then, Nf∗ and Nf∗−1 are NS(WπG) continuous maps. Therefore Nf∗ is a
NS(WπG) homeomorphism.
Proposition 5.3:
Every NS homeomorphism is a NS(WπG) homeomorphism.
Proof:
Let Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )be an (NS)homeomorphism. Then Nf∗ and Nf∗−1 are
(NS)continuous maps. This implies Nf∗ and Nf∗−1 are NS(WπG)continuous maps. Therefore
Nf∗ is a NS(WπG) homeomorphism.
Example 5.4:
Let NX∗ ={𝑟1∗ , 𝑟2∗ , 𝑟3∗ } ,NY∗ ={𝑠1∗ , 𝑠2∗ , 𝑠3∗ },
3 5 7 4 5 6 5 5 5
NT∗ 1 =〈r, , , , , , , , , 〉 and
10 10 10 10 10 10 10 10 10
7 5 3 7 5 3 6 5 4
NT∗ 2 =〈s, , , , , , , , , 〉.
10 10 10 10 10 10 10 10 10
Then NSτ = { 0NS, NT∗ 1 , 1NS } and NSσ = { 0NS, NT∗ 2 , 1NS } are NSTS on NX∗ and NY∗
respectively. thenbijective mapping Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )defined by Nf∗ 𝑟1∗ =
𝑠1∗ , Nf∗ 𝑟2∗ = 𝑠2∗ and
Nf∗ 𝑟3∗ = 𝑠3∗ .Then, Nf∗ is a NS(WπG) homeomorphism but not an (NS)homeomorphism,
since Nf∗ and Nf∗−1 are not (NS)continuous maps.
Proposition 5.5:
Every NS(α)homeomorphism is a NS(WπG)homeomorphism.

Proof:
Let (NX∗ , NSτ ) and (NY∗ , NSσ )be two NSTS. Suppose, Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )is a
NS(α) homeomorphism. Then both Nf∗ and Nf∗−1 are NS(α) continuous maps. This implies
Nf∗ and Nf∗−1 are NS(WπG) continuous maps. Therefore Nf∗ is a NS(WπG) homeomorphism.
Example 5.6:
Let NX∗ ={𝑟1∗ , 𝑟2∗ , 𝑟3∗ } ,NY∗ ={𝑠1∗ , 𝑠2∗ , 𝑠3∗ }
4 5 2 3 5 7 5 5 8
NT∗ 1 =〈r, , , , , , , , , 〉 and
10 10 10 10 10 10 10 10 10
7 5 3 8 5 2 8 5 2
NT∗ 2 =〈s, , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
respectively. Define a bijective mapping Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )defined by Nf∗ 𝑟1∗ =
𝑠1∗ , Nf∗ 𝑟2∗ = 𝑠2∗ and Nf∗ 𝑟3∗ = 𝑠3∗ . Then, Nf∗ is a NS(WπG) homeomorphism but not
an NS(α) homeomorphism, because Nf∗ and Nf∗−1 are not NS(α) continuous maps.
Proposition 5.7:
Every NS(G)homeomorphism is a NS(WπG) homeomorphism.
Proof:
Let (NX∗ , NSτ ) and (NY∗ , NSσ )be two NSTS and Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )be an
NS(G)homeomorphism. Then Nf∗ and Nf∗−1 are NS(G)continuous maps. This implies Nf∗
and Nf∗−1 are NS(WπG) continuous maps. So, Nf∗ is a NS(WπG) homeomorphism.
Example 5.8:
Let NX∗ ={𝑟1∗ , 𝑟2∗ , 𝑟3∗ } ,NY∗ ={𝑠1∗ , 𝑠2∗ , 𝑠3∗ }
2 5 8 3 5 7 4 5 6
NT∗ 1 =〈r, , , , , , , , , 〉 and
10 10 10 10 10 10 10 10 10
8 5 2 8 5 2 7 5 2
NT∗ 2 =〈s, , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
respectively. Consider a bijective mapping Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )defined by Nf∗ 𝑟1∗ =
𝑠1∗ , Nf∗ 𝑟2∗ = 𝑠2∗ and
Nf∗ 𝑟3∗ = 𝑠3∗ .Then, Nf∗ is a NS(WπG) homeomorphism but not an
NS(G)homeomorphism, since both Nf∗ and Nf∗−1 are not NS(G)continuous maps.

Proposition 5.9:
Every NS(α)Ghomeomorphism is a NS(WπG)homeomorphism.
Proof:
Let Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )be an NS(α)G homeomorphism. Then Nf∗ and Nf∗−1 are
NS(α)G continuous maps. This implies that both Nf∗ and Nf∗−1 are NS(WπG) continuous
maps. Therefore Nf∗ is a NS(WπG) homeomorphism
Example 5.10:
Let NX∗ ={𝑟1∗ , 𝑟2∗ , 𝑟3∗ } , NY∗ ={𝑠1∗ , 𝑠2∗ , 𝑠3∗ } and
5 5 5 6 5 4 6 5 4
NT∗ 1 =〈r, , , , , , , , , 〉 and
10 10 10 10 10 10 10 10 10
6 5 3 5 5 5 5 5 5
NT∗ 2 =〈s, , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
respectively. Consider a bijective mapping Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ ), given by Nf∗ 𝑟1∗ =
𝑠1∗ , Nf∗ 𝑟2∗ = 𝑠2∗ and
Nf∗ 𝑟3∗ = 𝑠3∗ .Then, Nf∗ is a NS(WπG) homeomorphism but not an NS(α)G
homeomorphism, since Nf∗ and Nf∗−1 are not NS(α)G continuous maps.
Proposition 5.11:
Let Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )be a bijective mapping from an NSTS (NX∗ , NSτ ) onto an
NSTS (NY∗ , NSσ ). Then the following statements are equivalent:
a) Nf∗ is a NS(WπG) open mapping,
b) Nf∗ is a NS(WπG) closed mapping,
c) Nf∗−1 : (NY∗ , NSσ )→(NX∗ , NSτ ) is a NS(WπG) continuous mapping.
Proof: (i) (a) ⇒(b): Let R∗1 be an NSCS in NX∗ , then R∗1 C is a NSOS in NX∗ . By
Definition, Nf∗ (R∗1 )C=( Nf∗ R∗1 )C is a NS(WπG) open set in NY∗ . Therefore Nf∗ (R∗1 ) is a
NS(WπG) closed set in NY∗ . Thus Nf∗ is a NS(WπG) closed mapping.
(ii) (b) ⇒(c): Let R∗1 be an NSCS in NX∗ . Since Nf∗ is a NS(WπG) closed mapping
, Nf∗ (R∗1 ) = Nf∗−1 −1 (R∗1 )is a NS(WπG) closed set in NY∗ . So, Nf∗−1 is a NS(WπG) continuous
mapping.

(iii)(c) ⇒(a): Let R∗1 be an NS open set in NX∗ . By Definition Nf∗−1 −1 (R∗1 ) = Nf∗ (R∗1 ) is a
NS(WπG) open set in NY∗ . Therefore Nf∗ is a NS(WπG) open mapping. Hence from (i) to
(iii), all the statements (a) to (c) in thi s proposition are equivalent.
Proposition 5.12: Let Nf∗ :(NX∗ , NSτ ), →(NY∗ , NSσ )be a bijective mapping from an NSTS (NX∗ ,
NSτ ) onto an NSTS (NY∗ , NSσ ). If Nf∗ is a NS(WπG) continuous mapping , then subsequent
statements are equivalent:
a) Nf∗ is a NS(WπG) closed mapping,
b) Nf∗ is a NS(WπG) open mapping,
c) Nf∗ is a NS(WπG) homeomorphism.
Example 5.13:
Let NX∗ ={𝑟1∗ , 𝑟2∗ , 𝑟3∗ } ,NY∗ ={𝑠1∗ , 𝑠2∗ , 𝑠3∗ } and NZ∗ ={𝑡1∗ , 𝑡2∗ , 𝑡3∗ } .
7 5 3 5 5 5 5 5 5
Let NT∗ 1 =〈r, , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
7 5 3 8 5 2 8 5 2
NT∗ 2 =〈s, , , , , , , , , 〉 and
10 10 10 10 10 10 10 10 10
8 5 2 8 5 2 7 5 3
NT∗ 3 =〈t, , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
Then, NSτ = { 0NS, NT∗ 1 , 1NS } and NSσ = { 0NS, NT∗ 2 , 1NS } andNSρ = { 0NS, NT∗ 3 , 1NS } are
NSTS on NX∗ ,NY∗ and NZ∗ respectively. Define a bijection mapping
Nf∗ :(NX∗ , NSτ )→(NY∗ , NSσ )by Nf∗ 𝑟1∗ = 𝑠1∗ ,Nf∗ 𝑟2∗ = 𝑠2∗ and Nf∗ 𝑟3∗ = 𝑠3∗ .and
Ng∗ : (NY∗ , NSσ )→(NZ∗ ,NSρ ) by Ng∗ 𝑟1∗ = 𝑡1∗ ,Ng∗ 𝑟2∗ = 𝑡2∗ and Ng∗ 𝑟3∗ = 𝑡3∗ .
Then, both the functions Nf∗ and Nf∗−1 are NS(WπG) continuous maps. Also Ng∗ and Ng∗−1
are NS(WπG) continuous maps. Therefore Nf∗ and Ng∗ are NS(WπG) homeomorphism. But
the composition Ng∗ ∘ Nf∗ : (NX∗ , NSτ )→(NZ∗ ,NSρ ) is not an NS(WπG) homeomorphism, since
Ng∗ ∘ Nf∗ is not an NS(WπG) continuous mapping

References :-
1. Arokiarani I, Dhavaseelan R, Jafari S ,and Parimala M:(2017) On Some New
Notions and Functions in Neutrosophic Topological Spaces, Neutrosophic Sets and
Systems, Vol. 16 , pp. 16-19.
2. doi.org/10.5281/zenodo.831915
3. Banupriya V and Chandrasekar S: 2019Neutrosophic(αG)s Continuity and
Neutrosophic(αG)s Irresolute Maps, Neutrosophic Sets and Systems, vol. 28, pp.
162-170. DOI: 10.5281/zenodo.3382531
4. Dhavaseelan R, and JafariS ,(2018). Generalized Neutrosophic closed sets, New
trends in Neutrosophic theory and applications ,Volume II,261-273.
5. Dhavaseelan R,Narmada DeviR ,Jafari.S and QaysHatem Imran:2019 Neutrosophic
alpha-m-continuity, Neutrosophic Sets and Systems, vol. 27, pp. 171-179.
6. DOI: 10.5281/zenodo.3275578
7. Dhavaseelan R, Jafari S, and Hanif page.md.: ,(2018)Neutrosophic generalized
-contra-continuity, creat. math. inform. 27,no.2, 133 – 139.
8. FlorentinSmarandache.:,(2002)Neutrosophic and NeutrosophicLogic,First
International Conference On Neutrosophic,Neutrosophic Logic, Set, Probability, and
Statistics University of New Mexico, Gallup, NM 87301, USA , smarand@unm.edu .
9. FloretinSmarandache.:,(2010)Neutrosophic Set: - A Generalization of
Neutrosophicset, Journal of DefenseResourses Management1,107-114
10. Ishwarya P and BageerathiK(2016).,On Neutrosophicsemiopen sets in Neutrosophic
topological spaces, International Jour. Of Math. Trends and Tech.214-223
11. Jayanthi D,(2018)αGeneralized closed Sets in Neutrosophic Topological Spaces,
International Journal of Mathematics Trends and Technology (IJMTT)- Special Issue
ICRMIT March .
12. Mary Margaret A, and Trinita Pricilla M.,(2017).Neutrosophic Vague Generalized
Pre-closed Sets in Neutrosophic Vague Topological Spaces,International Journal of
Mathematics And its Applications,Volume5, Issue 4-E , 747-759
13. MaheswariCSathyabama M and Chandrasekar S.,(2018):,Neutrosophic generalized
b-closed Sets In Neutrosophic Topological Spaces,Journal of physics Conf. Series
1139 012065. doi:10.1088/1742-6596/1139/1/012065

14. Rajesh Kannan T and Chandrasekar S,October,2018Neutrosophic ωα - Closed Sets in

Neutrosophic Topological Spaces, Journal of Computer and Mathematical Sciences,
Vol.9(10),1400-1408.
15. Rajesh Kannan T and Chandrasekar S, September/2019 Neutrosophic α-Continuity
Multifunction In
16. Neutrosophic Topological Spaces, The International journal of analytical and
experimental modal analysis ,Volume XI, Issue IX, ISSN NO: 0886- 9367
PP.1360-1368
17. Salama A A and Alblowi S A., (2012)Generalized Neutrosophic Set and Generalized
Neutrosophic Topological Spaces, Journal computer Sci. Engineering,
Vol.(ii),No.(7).
18. Salama A Aand Alblowi S A.,(2012) Neutrosophic set and Neutrosophic topological
space, ISOR J.mathematics,Vol.(iii),Issue(4),.pp-31-35.
19. Shanthi V K ChandrasekarS and SafinaBegam K,July(2018)Neutrosophic
Generalized Semi closed Sets In Neutrosophic Topological Spaces, International
Journal of Research in Advent Technology, Vol.(ii),6, No.7, , 1739-1743,
20. VenkateswaraRao V and SrinivasaRao Y., (2017)Neutrosophic Pre-open Sets and
Pre-closed Sets in NeutrosophicTopologs, International Journal of ChemTech
Research, Vol.(10),No.10, pp 449-458,
21. Suresh R and Palaniammal S, Neutrosophic Weakly Generalized open and Closed
Sets,Neutrosophic Sets and Systems(Communicated)
22. Suresh R and Palaniammal S, December/2019Neutrosophic Regular Weakly
Generalized Homoeomorphism, The International journal of analytical and
experimental modal analysis, Volume XI, Issue XII, ISSN NO: 0886-9367 Page
No:3781
23. Suresh R and Palaniammal S ,NeutrosophicCompletelyRWG Continuity Maps,
International Journal of Engineering and Advanced Technology(Communicated)
24. Suresh R and Palaniammal S ,NS(WG) Separation Axioms In Neutrosophic
Topological Spaces, (Communicated)
25. Suresh R and Palaniammal S, Neutrosophic Weakly Generalized open and Closed
Sets, Neutrosophic Sets and Systems(Communicated)
26. Suresh R and Palaniammal S, Neutrosophic Regular Weakly Generalized open and
Closed Sets, Neutrosophic Sets and Systems(Communicated)

27. Suresh R and PalaniammalS,Neutrosophic Weakly π Generalized Continuous

Mapping,Science, Technology and Development Journal (Accepted)

CHAPTER – 20
Application of Neutrosophicset on n- Normed Linear Space
MuralikrishnaPrakasam1 and Hemavathi Perumal2
1
PG and Research Department of Mathematics,
Muthurangam Government Arts College (Autonomous),
Vellore, Tamil Nadu, India.

2
Department of Mathematics, Saveetha School of Engineering, SIMATS,
Thandalam-602105. India.
Email :pmkrishna@rocketmail.com1, hemavathip.sse@saveetha.com2
1. Introduction
The idea of normed linear space plays a significant part in Functional Analysis.
Dimension of normed linear space has drawn in analysts to a more prominent
broaden. Zadeh[15]established fuzzy set in his spearheading work which is an
impressive theory fordealing with uncertainty. According to him, a fuzzy set assigns
a membership value from [0,1] to each element of a specified crisp universe set.This
concept set the groundwork for a large number of mathematical applications, as well
as a wide range of real-life problems.Felbin[4,5] introduced the notion of a fuzzy
normed linear space. It is demonstrated that fuzzy norms in a finite dimensional
fuzzy normed linear space are the same up to fuzzy equivalence. In addition, the
author analyzed the completion of fuzzy normed linear spaces and proved that all
finite dimensional fuzzy normed linear spaces are inevitably perfect.Gu et al. [6]
initiated the thought of fuzzy linear spaces. Krishna et al. [8] in which the necessary
and sufficient condition is separated in the fuzzy vector topology created by a fuzzy
norm. Also, the properties of separated and non-separated fuzzy norms, as well as
examples have been studied.Separation of fuzzy normed linear spaces has been

proposed by Cheng et al.[3] applied fuzzy linear operators in fuzzy normed space
and examined some interesting properties. Kim et al. [9] analyzed the characteristics
on strict convexity based on the linear n-normed spaces. The completeness of fuzzy
normed linear spaces propounded by Rhie et al. [11]. Smarandache[12]generalized
the intuitionistic fuzzy set and dealt the relationship between neutrosophic set and
intuitionistic set.
The concept of boundedness of a linear operator from one fuzzy normed linear
space to another is presented by Bag et al[1,2] and also two varieties (strong and
weak) of fuzzy bounded linear operators are established. Moreover, fuzzy normal
structure, fuzzy non-expansive mapping, and uniformly convex fuzzy normed linear
space notions are introduced, and fixed-point theorems for fuzzy non-expansive
mappings are demonstrated. Issac et.al [7] proposed the notion of intuitionistic
normed linear space and provided its related results. Sandeep Kumar et al. [13]
investigated some results on interval valued intuitionistic fuzzy n-normed linear
space.Maji [10]presented the concept about neutrosophicset in a different
aspect.Vijayabalajiet.al [14] introduced a novel and intriguing concept of
intuitionistic fuzzy n- normed linear space. Further, the Cauchy sequence and the
convergent sequence in intuitionistic fuzzy n- normed linear space were defined and
presented some findings on it.Recently, PrakasamMuralikrishna et al.[11] imposed
the neutrosophic approach on normed linear space. The objective of this study is to
extend the neutrosophic concept in to n-normed linear space. In addition, that some
of the engrossing results and properties of n-normed linear space based on the
neutrosophic concept are being discussed.
2.Preliminaries
This section reveals the basis definitions and results that are necessary for the
present work.
Definition 2.1.

A linear space (or vector space) 𝑉 over a field 𝐹consist of the following
1. A field 𝐹 of scalars.
2. A set 𝑉 of objects called vectors
3. A rule (or operation) called vector addition which associates with each pair of
vectors, 𝑢 , 𝑣 ∈ 𝑉 a vector 𝑢 + 𝑣 ∈ 𝑉 called the sum of 𝑢 and 𝑣 in such a
way that
 Addition is commutative,
 Addition is associative
 There is unique vector in 𝑢 in 𝑉 called the zero vector, such that𝑢 + 0 =

𝑢 ∀𝑢 ∈𝑉
 For each vector 𝑢 ∈ 𝑉, there is unique vectors − 𝑢 ∈ 𝑉 such that𝑢 + −𝑢 =
0.
4. A rule (or operation) called scalars multiplication which associates with each
scalar𝑎 ∈ 𝐹 and vector and 𝑢 ∈ 𝑉in such a way that
 1. 𝑢 = 𝑢 ∀ 𝑢 ∈ 𝑉 and 1 ∈ 𝐹
 𝑎𝑏 𝑢 = 𝑎 𝑏𝑢 ∀ 𝑎 , 𝑏 ∈ 𝐹and∀ 𝑢 ∈ 𝑉
 𝑎 𝑢 + 𝑣 = 𝑎𝑢 + 𝑎𝑣 ∀ 𝑎 ∈ 𝐹 and ∀ 𝑢 , 𝑣 ∈ 𝑉
 𝑎 + 𝑏 𝑢 = 𝑎𝑢 + 𝑏𝑢 ∀ 𝑎 , 𝑏 ∈ 𝐹 and ∀ 𝑢 ∈ 𝑉
It is denoted as ( 𝑉 , + , ∙ ) is a linear space.
Definition 2.2.[14]
A nonnegative function on a linear vector space𝑉 , ∥ ∙ ∥ ∶ 𝑉 → [ 0 , ∞)is called a
norm if
1. ∥ 𝑥 ∥ = 0 if and only if 𝑥 = 0 ;
2. ∥ 𝑥 + 𝑦 ∥ ≤ ∥ 𝑥 ∥ + ∥ 𝑦 ∥ for all 𝑥 , 𝑦 ∈ 𝑉(the triangular inequality)
3. ∥ 𝛼𝑥 ∥ = | 𝛼 | ∥ 𝑥 ∥ for all 𝑥 ∈ 𝑉 and 𝛼 ∈ 𝐹
Definition 2.3.[14]

A normed linear space is a linear space 𝑉 with a norm ∥ ∙ ∥𝑉 on it.
Definition 2.8.[14]
Let X be a linear space over the field F(real or complex) and ∗ is a continuous
t-norm. A fuzzy subset N on X ℝ (R-set of all real numbers) is called a fuzzy norm on
X if and only if for x,y X and c  F,
(N1) t  R with t ≤ 0, N(x,t) = 0
(N2)  t  R with t > 0 N(x,t) = 1, iff x = 0
(N3) t  R, t> 0
𝑡
N(cx,t) = N(x,|𝑐|). If ,c≠ 0
(N4) s,t R, x,y X,
N(x+y ,t+s) ≥ N(x,t)∗N(y,s)
(N5)lim𝑡→∞ 𝑁 𝑥, 𝑡 = 1.
The triplet (X,𝑁,∗) will be referred to as a fuzzy normed linear space.
Definition 2.9.[25]
A binary operation ∗ ∶ 0 , 1 × 0 ,1 → 0 ,1 is continuous t-norm if ∗
satisfies the following conditions:
1. ∗ is commutative and associative
2. ∗ is continuous
3. 𝑎 ∗ 1 = 𝑎, for all𝑎 ∈ 0 , 1
4. 𝑎 ∗ 𝑏 ≤ 𝑐 ∗ 𝑑 whenever 𝑎 ≤ 𝑐 and 𝑏 ≤ 𝑑 and𝑎 , 𝑏 , 𝑐 , 𝑑 ∈ 0 , 1 .
Definition 2.10 :
A binary operation ◊ ∶ 0 , 1 × 0 ,1 → 0 ,1 is continuous t-co-norm if
◊satisfies the following conditions:
1. ◊ is commutative and associative
2. ◊ is continuous

3. 𝑎 ◊ 0 = 𝑎, for all 𝑎 ∈ 0 , 1
4. 𝑎 ◊ 𝑏 ≤ 𝑐 ◊ 𝑑 whenever 𝑎 ≤ 𝑐 and 𝑏 ≤ 𝑑 and 𝑎 , 𝑏 , 𝑐 , 𝑑 ∈ 0 , 1 .
Definition 2.11
Let ∗ be a continuous t-norm, ◊be a continuous t-co-norm, and 𝑉 be a linear
space over the field 𝐹 ( = 𝑅 𝑜𝑟 𝐶 ). An intuitionistic fuzzy norm or in short 𝐼𝐹𝑁 on 𝑉
is an object of the form 𝐴 = { 𝑥, 𝑡 , 𝑁 𝑥 , 𝑡 , 𝑀 𝑥 , 𝑡 ∶ 𝑥 ,𝑡 ∈ 𝑉 × ℝ+, where
𝑁 , 𝑀 are fuzzy sets on 𝑉 × ℝ+,𝑁 denotes the degree of membership and 𝑀denotes
the degree of non-membership 𝑥 ,𝑡 ∈ 𝑉 × ℝ+ satisfying the following conditions:
1. 𝑁 𝑥, 𝑡 + 𝑀 𝑥, 𝑡 ≤ 1 ∀ 𝑥, 𝑡 ∈ 𝑉 × ℝ+
2. 𝑁 𝑥, 𝑡 > 0
3. 𝑁 𝑥, 𝑡 = 1 if and only if 𝑥 = 0
𝑡
4. 𝑁 𝑐𝑥, 𝑡 = 𝑁 𝑥, ,𝑐 ≠ 0 ,𝑐 ∈ 𝐹
𝑐
5. 𝑁 𝑥, 𝑠 ∗ 𝑁 𝑦, 𝑡 ≤ 𝑁(𝑥 + 𝑦 , 𝑠 + 𝑡)
6. 𝑁 𝑥, ⋅ is non – decreasing function of ℝ+ and lim𝑡→∞ 𝑁(𝑥, 𝑡) = 1
7. 𝑀 𝑥, 𝑡 > 0
8. 𝑀 𝑥, 𝑡 = 0 if and only if 𝑥 = 0
𝑡
9. 𝑀 𝑐𝑥, 𝑡 = 𝑀 𝑥, ,𝑐 ≠ 0 ,𝑐 ∈ 𝐹
𝑐
10. 𝑀 𝑥, 𝑠 ◊ 𝑀 𝑦, 𝑡 ≥ 𝑀(𝑥 + 𝑦 , 𝑠 + 𝑡)
11. 𝑀 𝑥, ⋅ is non – increasing function of ℝ+ and lim𝑡→∞ 𝑀(𝑥, 𝑡) = 0.
Then the quadruple ( 𝑉 , 𝐴 ,∗ , ◊ ) will be referred as a intuitionistic fuzzy
normed linear space.
3 .Neutrosophicstudy on n-Normed Linear Space
This section presents a unique approach of normed linear space using the
notion of Neutrosophic set. Further, some relevant results of Cauchy sequence on
Neutrosophic normed linear space are also examined.
3.1.Neutrosophicn-Normed Linear space

Here,Neutrosophicn-normed linear spaceis describedwith suitable example.
In addition, the convergence of sequence in N-n-𝒩LS and some properties also
studied.
Definition 3.1 :
Let ℋ be a space of points (objects). A Neutrosophic n-normed linear
space𝒩 (N-n-𝒩LS)on ℋ is characterized by a truth-membership function 𝜑, an
indeterminacy membership function 𝜙, and a falsity-membership function 𝜒, where
𝜑, 𝜙 𝑎𝑛𝑑 𝜒 and real standard and non-standard subset of ]ˉ0,1+ [ i.e., 𝜑, 𝜙, 𝜒 : X→
]ˉ0,1+[. Thus,the N-n-𝒩LS over ℋ is defined as:
𝒩 = < 𝐻, 𝜑 𝑕1 , 𝑕2 . . . 𝑕𝑛 , 𝓅 , 𝜙 𝑥𝑕1 , 𝑕2 . . . 𝑕𝑛 , 𝓅 , 𝜒 𝑕1 , 𝑕2 . . . 𝑕𝑛 , 𝓅
> (𝑕1 , 𝑕2 . . . 𝑕𝑛 ) ℋ 𝑛 }
On the same of 𝜑, 𝜙 𝑎𝑛𝑑 𝜒 there is no restriction and so ˉ 0 ≤ 𝑠𝑢𝑝𝜑 𝑥 +
𝑠𝑢𝑝𝜙 𝑥 + 𝑠𝑢𝑝 𝜒 𝑥 ≤ 3+ . Here 1+ = 1 + 𝜎, where 1 is its standard part and 𝜎 its
non-standard part.Also,ˉ0 = 0 − 𝜎where 0is its standard part and 𝜎its non-standard
part.
From philosophical point of view, a N-n-𝒩LS takes the value from real standard
or nonstandard subsets of] ˉ0,1+[. But to practice in real scientific and engineering
areas, it is difficult to use N-n-𝒩LS with value from real standard or nonstandard
subset of] ˉ0,1+[. Hence, we consider the N-n-𝒩LSwhich takes the value from the
subset of [0,1].
Definition 3.2.
Let ℚ be a linear space field 𝔽 = (ℛ 𝑜𝑟 𝒞 ) and ⊕be a continuous t – norm, ⨂
be a continuous t – co – norm. Then, a Neutrosophic subset𝒩: 〈𝜑, 𝜙, 𝜒〉 𝑜𝑛 ℚ  𝔽 is
called a Neutrosophicn-norm on ℚ if for 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑦1 , 𝑦2 , . . . 𝑦𝑛 ∈ ℚ and 𝜏 ∈ 𝔽(𝑐
being scalar), if the following conditions hold.
1. 0 ≤ 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 , 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 , 𝜂 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 ≤ 1, ∀ 𝜏 ∈ 𝑅
2. 0 ≤ 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 + 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 + 𝜂 𝑥1 , 2 , . . . 𝑥𝑛 , 𝜏 ≤ 3, ∀ 𝑡 ∈ 𝑅

3. 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 0 with𝜏 ≤ 0
4. 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 1 𝑤𝑖𝑡𝑕 𝜏 > 0 𝑖𝑓𝑓 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) = 0, the null vector

𝜏
5. 𝜑 𝑐𝑥1 , 𝑐𝑐𝑥2 , . . . 𝑥𝑛 , 𝜏 = 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , , ∀ 𝑐 ≠ 0, 𝜏 > 0
𝑐
6. 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠 ⊕ 𝜑 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝜏 ≤ 𝜑 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) + (𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) , 𝑠 +
𝑡 ∀ 𝑠 ,𝜏 ∈ 𝑅
7. 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , ⊕ is continuous non – decreasing function for
𝜏 > 0 , lim𝑡→∞ 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 1
8. 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 1 𝑤𝑖𝑡𝑕, 𝑡 ≤ 0
9. 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 0 𝑤𝑖𝑡𝑕 𝜏 > 0 𝑖𝑓𝑓 𝑥 = 0, the null vector

𝜏
10. 𝜙 𝑐𝑥1 , 𝑐𝑥2 , . . . 𝑐𝑥𝑛 , 𝜏 = 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , , ∀ 𝑐 ≠ 0, 𝑡 > 0
𝑐
11. 𝜙(𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠)⨂𝜙(𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝜏) ≥ 𝜙 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) + (𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) , 𝑠 +

𝑡 ∀ 𝑠 ,𝜏 ∈ 𝑅
12. 𝜙(𝑥1 , 𝑥2 , . . . 𝑥𝑛 ,⊕) is a continuous non-increasing function for 𝜏 > 0,
lim𝑡→∞ 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 0
13. 𝜒 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 1 𝑤𝑖𝑡𝑕, 𝜏 ≤ 0;
14. 𝜒 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 0 𝑤𝑖𝑡𝑕 𝜏 > 0 𝑖𝑓𝑓 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) = 0, the null vector;

𝜏
15. 𝜒 𝑐𝑥1 , 𝑐𝑥2 , . . . 𝑐𝑥𝑛 , 𝜏 = 𝜒 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , , ∀ 𝑐 ≠ 0, 𝜏 > 0
𝑐
16. 𝜒(𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠)⨂𝜒(𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝜏) ≥ 𝜒 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) + (𝑦1 , 𝑦2 , . . . 𝑦𝑛 ), 𝑠 +

𝜏 ∀ 𝑠 ,𝜏 ∈ 𝑅
17. 𝜙(𝑥1 , 𝑥2 , . . . 𝑥𝑛 ,⊕) is a continuous non-increasing function for 𝜏 > 0,
lim𝑡→∞ 𝜒 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 = 0;
Further( ℚ , 𝑁 ,⊕ , ⨂ ) is Neutrosophicn-normed linear space (N-n-𝒩LS).
Example3.3.
Let ( ℚ , ∥⊕,⊕. . .⊕ ∥ ) be an-normed linear space. Take
𝑎 ⊕ b = 𝑎𝑏 𝑎𝑛𝑑 𝑎⨂ 𝑏 = 𝑎 + 𝑏 − 𝑎𝑏. Define,

𝜏
𝑖𝑓 𝜏 > | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 |
𝜑(𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏) = 𝜏+| 𝑥 1 ,𝑥 2 ,...𝑥 𝑛 |
0 𝑜𝑡𝑕𝑒𝑟𝑤𝑖𝑠𝑒.

𝑥
𝑖𝑓 𝜏 > | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 |
𝜙(𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏) = 𝜏+| 𝑥 1 ,𝑥 2 ,...𝑥 𝑛 |
| 𝑥 1 ,𝑥 2 ,...𝑥 𝑛 |
𝑖𝑓 𝜏 > | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 |
𝜒(𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏) = 𝜏 ,
Then ( ℚ , 𝑁 ,⊕ , ⨂ ) is an N-n-𝒩LS.
Proof:
All the conditions are obvious except the condition (6),(11),(16). For 𝑠, 𝜏 > 0
because these are clearly true for 𝑠, 𝜏 ≤ 0.
Now𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑠 + 𝜏 − 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠 ⊕ 𝜑(𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝜏)
𝑠+𝜏 𝑠𝜏
= −
𝑠 + 𝜏 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 | 𝑠 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | (𝜏 + | 𝑦1 , 𝑦2 , . . . 𝑦𝑛 |)
𝑠+𝜏 𝑠𝜏
≥ −
𝑠 + 𝜏 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 𝜏 + | 𝑦1 , 𝑦2 , . . . 𝑦𝑛 |)
= 𝑠 + 𝜏 𝑠 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | 𝜏 + | 𝑦1 , 𝑦2 , . . . 𝑦𝑛 |
− 𝑠𝜏 𝑠 + 𝜏 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | + | 𝑦1 , 𝑦2 , . . . 𝑦𝑛 | /𝔑
Where 𝔑 = 𝑠 + 𝜏 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | + | 𝑦1 , 𝑦2 , . . . 𝑦𝑛 | 𝑠 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | 𝜏 +
| 𝑦1 , 𝑦2 , . . . 𝑦𝑛 |
= 𝜏 2 | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | 𝑠 2 | 𝑦1 , 𝑦2 , . . . 𝑦𝑛 | + 𝑠 + 𝜏 | (𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) | /𝔑
≥ 0.
Hence, 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠 ⊕ 𝜑 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑡 ≤ 𝜑 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑠 +
𝑡 ,∀ 𝑠 ,𝑡 ∈ 𝑅
𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠 ⨂𝜙 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑡 − 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑠 + 𝑡

𝑥1 , 𝑥2 , . . . 𝑥𝑛 𝑦1 , 𝑦2 , . . . 𝑦𝑛 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 )
= + −
𝑠 + 𝑥1 , 𝑥2 , . . . 𝑥𝑛 𝜏 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 𝑠 + 𝑥1 , 𝑥2 , . . . 𝑥𝑛 𝜏 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛
(𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) + (𝑦1 , 𝑦2 , . . . 𝑦𝑛 )
−
(𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) + (𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) + 𝑠 + 𝜏
| (𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) | + 𝜏| 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | + 𝑠||𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||

=
𝑠 + | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | (𝜏 + ||𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||)
||𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||
−
| (𝑥1 , 𝑥2 , . . . 𝑥𝑛 ) + (𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) | + 𝑠 + 𝜏
= { | 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 | + 𝑠 + 𝜏 (𝜏| 𝑥1 , 𝑥2 , . . . 𝑥𝑛 | + 𝑠| 𝑥1 , 𝑥2 , . . . 𝑥𝑛 |
+ ||(𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 )||) − ||𝑥1 , 𝑥2 , . . . 𝑥𝑛
+ 𝑦1 , 𝑦2 , . . . 𝑦𝑛 || 𝑠 + ||𝑥1 , 𝑥2 , . . . 𝑥𝑛 || (𝜏 + ||𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||)}/𝔔
Where 𝔔 = (𝑠 + 𝜏 + ||𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||)(𝑠 + ||𝑥1 , 𝑥2 , . . . 𝑥𝑛 ||)(𝜏 +

||𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||)
= 𝑠 + 𝜏 𝑡 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑠 𝑦1 , 𝑦2 , . . . 𝑦𝑛 + (𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 )
− 𝑠𝜏 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 /𝔔
≥ 𝑠 + 𝜏 𝜏 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑠 𝑦1 , 𝑦2 , . . . 𝑦𝑛 + (𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 )
− 𝑠𝜏 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 /𝔔
= 𝜏 2 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑠 𝑦1 , 𝑦2 , . . . 𝑦𝑛
+ 𝑠+𝜏 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) /𝔔 ≥ 0.
Hence,
𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠 ⨂𝜙 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝜏 ≥ 𝜙 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑠 + 𝜏 , ∀ 𝑠 , 𝜏
∈ ℝ.

Finally
𝜒 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠 ⨂𝜒 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝜏 ≥ 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑠 + 𝜏
||𝑥1 , 𝑥2 , . . . 𝑥𝑛 || ||𝑦1 , 𝑦2 , . . . 𝑦𝑛 || ||(𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 )||

= + −
𝑠 𝜏 𝑠𝜏
||𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||
−
𝑠+𝜏
𝜏 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑠 𝑦1 , 𝑦2 , . . . 𝑦𝑛 − ||(𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 )||

=
𝑠𝜏
||𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 ||
−
𝑠+𝜏
≥ 𝑠 2 𝑦1 , 𝑦2 , . . . 𝑦𝑛 + 𝜏 2 𝑥1 , 𝑥2 , . . . 𝑥𝑛
− 𝑠+𝜏 (𝑥1 , 𝑥2 , . . . 𝑥𝑛 )(𝑦1 , 𝑦2 , . . . 𝑦𝑛 ) /𝑠𝜏(𝑠 + 𝜏)
= 𝑠 𝑦1 , 𝑦2 , . . . 𝑦𝑛 𝑠 − 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝜏 𝑥1 , 𝑥2 , . . . 𝑥𝑛 𝜏 − 𝑦1 , 𝑦2 , . . . 𝑦𝑛 / 𝑠𝑡(𝑠
+ 𝜏) ≥ 0, (𝑎𝑠 𝑠 > 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝜏 > 𝑦1 , 𝑦2 , . . . 𝑦𝑛 ).
Thus, 𝜒 𝑥1 , 𝑥2 , . . . 𝑥𝑛 , 𝑠 ⨂𝜒 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝜏 ≥ 𝑥1 , 𝑥2 , . . . 𝑥𝑛 + 𝑦1 , 𝑦2 , . . . 𝑦𝑛 , 𝑠 +
𝜏 , ∀ 𝑠 , 𝜏 ∈ ℝ. This completes the proof.
Definition 3.4.
Let {𝜌1 , 𝜌2 , . . . 𝜌𝑛 } be a sequence of points in a N-n-𝒩LS ℚ, 𝑁,⊕, ⨂ . Then the
sequence converges to a point 𝑥 ∈ ℚif and only if for given 𝑚 ∈ 0,1 , 𝜏 > 0 there
exist 𝑖0  𝑁 (the set of natural numbers) such that

𝜑 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝜌, 𝜏 > 1 − 𝑚, 𝜙 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝜌, 𝜏 < 𝑚, 𝜒 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝜌, 𝜏 <,
 𝑛 ≥ 𝑖0 .
(or)

lim 𝜑 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝜌, 𝜏 = 1, lim 𝜙 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝜌, 𝜏
𝑛→∞ 𝑛→∞
= 0, lim 𝜒 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝜌, 𝜏 = 0, 𝜏 → ∞
𝑛→∞
Then the sequence { 𝜌1 , 𝜌2 , . . . 𝜌𝑛 } is called a convergent sequence in the
N-n-𝒩LS ℚ, 𝑁,⊕, ⨂ .
Theorem 3.5 :
If the sequence {𝜌1 , 𝜌2 , . . . 𝜌𝑛 } in a N-n-𝒩LS ℚ, 𝑁,⊕, ⨂ . is convergent, then the
point of convergence is unique.
Proof:
Let
lim𝑛→∞ 𝜌1 , 𝜌2 , . . . 𝜌𝑛 = 𝓊 𝑎𝑛𝑑 lim𝑛 →∞ 𝜌1 , 𝜌2 , . . . 𝜌𝑛 = 𝓋. 𝑓𝑜𝑟 𝓊 ≠ 𝓋. 𝑇𝑕𝑒𝑛 𝑓𝑜𝑟 𝑠, 𝜏 > 0,
lim 𝜑 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝑠 = 1, lim 𝜙 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝑠
𝑛→∞ 𝑛→∞
= 0, lim 𝜒 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝑠 = 0, 𝑎𝑠 𝑠 → ∞ 𝑎𝑛𝑑
𝑛→∞
lim 𝜑 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝜏 = 1, lim 𝜙 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝜏
𝑛→∞ 𝑛→∞
= 0, lim 𝜒 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝜏 = 0, 𝑎𝑠 𝜏 → ∞
𝑛→∞
Now,
𝜑 𝓊 − 𝓋, 𝑠 + 𝜏 = 𝜑(𝓊 − 𝜌1 , 𝜌2 , . . . 𝜌𝑛 + 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓋, 𝑠 + 𝜏) ≤
𝜑(𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝑠) ⊕ 𝜑(𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓋, 𝜏)
Taking limit as 𝑛 → ∞ and for s,𝜏𝑛 → ∞,
𝜑 𝓊 − 𝓋, 𝑠 + 𝜏 ≥ 1 ⊕ 1 = 1 𝑖. 𝑒. , 𝜑 𝓊 − 𝓋, 𝑠 + 𝜏 = 1
Further,
𝜙 𝓊 − 𝓋, 𝑠 + 𝜏 = 𝜙(𝓊 − 𝜌1 , 𝜌2 , . . . 𝜌𝑛 + 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓋, 𝑠 + 𝜏)
≤ 𝜙(𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝓊, 𝑠)⨂ 𝜙(𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝑦, 𝜏)
Taking limit as 𝑛 → ∞ and for s,𝜏𝑛 → ∞,
𝜙 𝓊 − 𝓋, 𝑠 + 𝜏 ≤ 0⨂ 0 = 0𝑖. 𝑒. , 𝜙 𝓊 − 𝓋, 𝑠 + 𝜏 = 0
Similarly, 𝜒 𝓊 − 𝓋, 𝑠 + 𝜏 = 0
Hence, 𝓊 = 𝓋 and this complete the proof.

Theorem 3.6 :
In an N-n-𝒩LS ℚ, 𝑁,⊕, ⨂ ., if lim𝑛→∞ 𝔛𝑛 = 𝔛 and lim𝑛→∞ 𝔜𝑛 = 𝔜 then

lim𝑛→∞ 𝔛𝑛 + 𝔜𝑛 = 𝔛 + 𝔜
Proof:
Here, for 𝑠, 𝑡 > 0

lim 𝜑 𝔛𝑛 − 𝔛, 𝑠 = 1, lim 𝜙 𝔛𝑛 − 𝔛, 𝑠 = 0, lim 𝜒 𝔛𝑛 − 𝔛, 𝑠 = 0, 𝑎𝑠 𝑠 → ∞ 𝑎𝑛𝑑
𝑛→∞ 𝑛→∞ 𝑛→∞
lim 𝜑 𝔜𝑛 − 𝔜, 𝜏 = 1, lim 𝜙 𝔜𝑛 − 𝔜, 𝜏 = 0, lim 𝜒 𝔜𝑛 − 𝔜, 𝜏 = 0, 𝑎𝑠 𝜏 → ∞ .

𝑛→∞ 𝑛→∞ 𝑛→∞
Now, lim𝑛→∞ 𝜑[ 𝔛𝑛 + 𝔜𝑛 ) − 𝔛 + 𝔜 , 𝑠 + 𝜏 ] = lim𝑛→∞ 𝜑[ 𝔛𝑛 − 𝔛) + 𝔜𝑛 −

𝔜 ,𝑠 + 𝜏 ],
≥ lim 𝜑 𝔛𝑛 − 𝔛, 𝑠 ⊕ lim 𝜑 𝔜𝑛 − 𝔜, 𝜏
𝑛 →∞ 𝑛→∞
= 1 ⊕ 1 = 1 𝑎𝑠 𝑠, 𝑡 → ∞
Hence lim𝑛→∞ 𝜑 𝔛𝑛 − 𝔜𝑛 ) − 𝔛 + 𝔜 , 𝑠 + 𝜏 = 1 𝑎𝑠, 𝑠, 𝜏 → ∞. 𝐴𝑔𝑎𝑖𝑛
lim 𝜙[ 𝔛𝑛 + 𝔜𝑛 ) − 𝔛 + 𝔜 , 𝑠 + 𝜏 ] = lim 𝜙[ 𝔛𝑛 − 𝔛) + 𝔜𝑛 − 𝔜 , 𝑠 + 𝜏 ]
𝑛 →∞ 𝑛→∞
≥ lim 𝜙 𝔛𝑛 − 𝔛, 𝑠 ⨂ lim 𝜙 𝔜𝑛 − 𝔜, 𝜏
𝑛→∞ 𝑛→∞
= 0⨂0 = 0 𝑎𝑠 𝑠, 𝜏 → ∞
𝑆𝑜, lim 𝜙[ 𝔛𝑛 + 𝔜𝑛 ) − 𝔛 + 𝔜 , 𝑠 + 𝜏 ] = 0 𝑎𝑠 𝑠, 𝜏 → ∞.
𝑛→∞
Similarly,
lim 𝜒[ 𝔛𝑛 + 𝔜𝑛 ) − 𝔛 + 𝔜 , 𝑠 + 𝜏 ] = 0 𝑎𝑠 𝑠, 𝜏 → ∞. 𝑎𝑛𝑑 𝑡𝑕𝑖𝑠 𝑒𝑛𝑑 𝑡𝑕𝑒 𝑡𝑕𝑒𝑜𝑟𝑒𝑚.
𝑛→∞
Theorem 3.7.
If lim𝑛→∞ 𝜌1 , 𝜌2 , . . . 𝜌𝑛 = 𝑥 and 0 ≠ 𝑐 𝔽, then lim𝑛 →∞ 𝑐(𝜌1 , 𝜌2 , . . . 𝜌𝑛 ) in an
N-n-𝒩LS ℚ, 𝑁,⊕, ⨂ .

Proof:
Here,
𝑡 𝑡
lim𝑛→∞ 𝜑 𝑐(𝜌1 , 𝜌2 , . . . 𝜌𝑛 ) − 𝑐𝑥, 𝑡 = lim 𝜑 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝑥, |𝑐| = 1, 𝑎𝑠 → ∞.
𝑛→∞ |𝑐|
𝑡 𝑡
lim 𝜙 𝑐(𝜌1 , 𝜌2 , . . . 𝜌𝑛 ) − 𝑐𝑥, 𝑡 = lim 𝜙 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝑥, = 1, 𝑎𝑠 → ∞.
𝑛→∞ 𝑛 →∞ 𝑐 𝑐
𝑡 𝑡
lim 𝜒 𝑐(𝜌1 , 𝜌2 , . . . 𝜌𝑛 ) − 𝑐𝑥, 𝑡 = lim 𝜒 𝜌1 , 𝜌2 , . . . 𝜌𝑛 − 𝑥, = 1, 𝑎𝑠 → ∞.
𝑛 →∞ 𝑛 →∞ |𝑐| |𝑐|
Thus, the theorem is proved.
4. Conclusion :
In this chapter, the operations of Neutrosophic n-normed linear space
were represented and applied in the sequences in a different manner.Further, the
convergence of sequence, characteristic of Cauchy sequence inNeutrosophic normed
linear space have been investigated. The basic characteristics and relevant properties
with examples of Neutrosophic n-normed linear space were interpreted. In future,
this can be extended in finite Dimensional Neutrosophic-n-Normed Linear Space and
Neutrosophic Metric Space.

References:
1. Bag, T.,Samanta, S.K., Fuzzy bounded linear operators, Fuzzy Sets and Systems
151 (2005) 513-547.
2. Bag, T.,Samanta, S.K., Fixed point theorems on fuzzy normed linear spaces,
Information science 176 (2006) 2910-2931.
3. Cheng, S.C.,Modeson, J.N., Fuzzy linear operators and fuzzy normed linear
spaces, Bull.Cal.Math.Soc 86 (1994) 429-436.
4. Felbin, C., Finite dimensional fuzzy normed linear spaces, Fuzzy sets and Systems
48(1992) 239-248.
5. Felbin, C., The completion of fuzzy normed linear space, Journal of Analysis and
Applications, 174(1993), No.2,428-440.
6. Gu, W., & Lu, T., Fuzzy linear spaces, Fuzzy Sets and Systems, vol 49(1992),
pp.377-380.
7. Issac, P., and Maya, K.., On the Intuitionistic fuzzy normed linear space (𝑹𝐧 ,𝑨),
Inter. J. Fuzzy Math. And Systems, 2(2),(2012),95-110.
8. Krishna, S.V., and Sarma, K.K.M., Separation of fuzzy normed linear spaces,
Fuzzy sets and Systems 63 (1994), no.2,207-217.
9. Kim, S.S., and Cho, Y.J., Strict convexity in linear n-normed spaces,
Demonstration Math., 29 (1996), No.4,739-744.
10. Maji, P.K.,Neutrosophic set, Annals of Fuzzy Mathematics and Informatics,
5(1),(2013), 157-168.
11. PrakasamMuralikrishna, DassSarath Kumar, Neutrosophis Approach on Normed
Linear Space, Neutrosophic Sets and Systems, 30 (2019), 225-239.

12. Rhie, G.S., Choi, B.M., and Kim, D.S., On the completeness of fuzzy normed linear
spaces, Math. Japon.45 (1997), no.1, 33-37.
13. Smarandache, F.,Neutrosophic set, a generalization of the intuitionistic fuzzy sets,
Inter. J.Pure Appl.Math.,24,(2005), 287-297.
14. SandeepKumar, Some results on Interval valued Intuitionistic Fuzzy n-Normed
linear space. International journal of Mathematics Archive 168-178.
15. Vijayabalaji, S., Anita, S.,Shanthi&Thillaigovindan, N., Interval valued fuzzy
n-normed linear space, Journal of Fundamental Sciences. 10(2007).
16. Zadeh, L.A., Fuzzy sets, information and Control, 89 (1965), 338-358.

CHAPTER – 21
PROPERTIES OF NEUTROSOPHIC NANO SEMI-OPEN SETS

R. Vijayalakshmi, 1 Mookambika.A.P.2
1.Assistant Professor, PG & Research Department of Mathematics,

Arignar Anna Government Arts College,Namakkal(DT),Tamil Nadu,India.
2.Assistant Professor, Department of Mathematics,Mahatma Gandhi Government Arts College,

New Mahe(PO),Mahe, Puducherry ,India
E-mail: viji_lakshmi80@rediffmail.com, mookiratna@gmail.com
1.1Introduction
Nano topological spaces introduced by M.L.Thivagar et.al can be expressed as a
collection of nano approximations and Neutrosophic sets established by F.Smarandache.
Neutrosophic set is illustrated by three functions: a membership, indeterminacy and a
nonmembership functions that are independently related. neutrosophic set have wide
range of applications in real life. M.L.Thivagar et al., developed Neutrosophicnano
topological spaces .Neutrosophicnano semi closed, Neutrosophicnano αclosed,
neutrosophicnano pre closed, neutrosophicnano semi pre closed and neutrosophicnano
regular closed are introduced by M.Parimala et al. Aim of the present chapter is we
studied about properties of Nano semi closure, neutrosophicnano semi interior in
neutrosophicnano topological spaces. After that we discussed about concepts of the
neutrosophic nano frontier in neutrosophic nano topological space.
Definition 1.1.1 :
Let A be 𝑁 𝑁 S of a 𝑁 𝑁 TS U. Then A is said to be Neutrosophic Nano semi-open
[written 𝑁 𝑁 (SO) ] set of U if there exists a Neutrosophic Nano open set 𝑁 𝑁 O such that
𝑁 𝑁 O ⊆A ⊆𝑁 𝑁 Cl (𝑁 𝑁 O).
Theorem 1.1.2 :
A subset A in a 𝑁 𝑁 TS U is 𝑁 𝑁 (SO) set if and only if
A ⊆𝑁 𝑁 Cl(𝑁 𝑁 Int (A)).

Proof :
Sufficiency: Let A ⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A)). Then for 𝑁 𝑁 O = 𝑁 𝑁 Int (A),
we have 𝑁 𝑁 O ⊆A ⊆𝑁 𝑁 Cl (𝑁 𝑁 O). Necessity: Let A be 𝑁 𝑁 (SO) set in U. Then 𝑁 𝑁 O
⊆A⊆𝑁 𝑁 Cl (𝑁 𝑁 O) for some Neutrosophic Nano open set 𝑁 𝑁 O. But 𝑁 𝑁 O ⊆𝑁 𝑁 Int (A) and
thus 𝑁 𝑁 Cl (𝑁 𝑁 O) ⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A)).Hence A ⊆𝑁 𝑁 Cl (𝑁 𝑁 O) ⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A)).
Theorem 1.1.3 :
Let A be 𝑁 𝑁 (SO) set in the 𝑁 𝑁 TS U and suppose A⊆B ⊆𝑁 𝑁 Cl (A). Then B is 𝑁 𝑁 (SO)
set in U.
Proof :
There exists a Neutrosophic Nano openset𝑁 𝑁 O such that 𝑁 𝑁 O ⊆A ⊆𝑁 𝑁 Cl (𝑁 𝑁 O).
Then 𝑁 𝑁 O ⊆B.But 𝑁 𝑁 Cl (A) ⊆𝑁 𝑁 Cl (𝑁 𝑁 O) and thus B ⊆𝑁 𝑁 Cl (𝑁 𝑁 O). Hence 𝑁 𝑁 O ⊆B
⊆𝑁 𝑁 Cl (𝑁 𝑁 O) and B is 𝑁 𝑁 (SO) set in U.
Theorem 1.1.4
Every Neutrosophic Nano open set in the 𝑁 𝑁 TS U is 𝑁 𝑁 (SO) set in U.
Proof :
Let A be Neutrosophic Nano open set in 𝑁 𝑁 TS U. Then A = 𝑁 𝑁 Int (A). Also 𝑁 𝑁 Int
(A) ⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A)). This implies that A ⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A)). Hence by Theorem 1.1..2 , A is
𝑁 𝑁 (SO) set in U.
Remark 1.1.5 :
The converse of the above theorem need not be true as shown by the following
example.
Example 1.1.6
Let U and 𝒜 be two non-empty finite sets,
where U is the universe and 𝒜 the set of attributes
U={F1,F2 ,F3, F4}are Fruits
Let 𝑈 𝑅 ={{ F1,F2 ,F3}, { F4}} be an equivalence relation

𝒜 = {Proteins, minerals, vitamins}are threeattributes ,its Neutrosphic values are given

below
4 5 3 3 2 2 9 5 8
F1 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
2 4 5 1 1 2 6 5 8
F2 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 5 3 4 2 2 9 5 8
F3 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 4 5 3 2 2 5 5 8
F4 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 ,N(M) ,𝑁(M),BN(M)}

2 4 5 1 1 2 6 5 8
N F =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 5 3 4 2 2 9 5 8
𝑁(F)= 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 5 3 2 2 2 8 5 8
BN(F)=〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
2 4 5 1 1 2 6 5 8
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 ,〈 , , , , , , , , 〉,
10 10 10 10 10 10 10 10 10
5 5 3 4 2 2 9 5 8
〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 5 3 2 2 2 8 5 8
〈 , , , , , , , , 〉,
10 10 10 10 10 10 10 10 10
4 4 5 3 2 2 5 5 8
〈 , , , , , , , , 〉}
10 10 10 10 10 10 10 10 10
3 4 5 2 7 2 6 5 8
F5 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
Here F5is 𝑁 𝑁 (SO) sets but are not Neutrosophic Nano open sets.
Theorem 1.1.7
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then union of two 𝑁 𝑁 (SO) sets is a 𝑁 𝑁 (SO) set in the
𝑁 𝑁 TS U.
Proof :
Let A and B are 𝑁 𝑁 (SO) sets in U. Then A⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A)) and B ⊆𝑁 𝑁 Cl (𝑁 𝑁 Int
(B)). Therefore A ∪B ⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A)) ∪𝑁 𝑁 Cl (𝑁 𝑁 Int (B)) = 𝑁 𝑁 Cl (𝑁 𝑁 Int (A) ∪𝑁 𝑁 Int (B))
⊆𝑁 𝑁 Cl (𝑁 𝑁 Int (A ∪B)) [ By Proposition 1.1.4 (15) ]. Hence A ∪B is 𝑁 𝑁 (SO) set in U.

Example 1.1.8
The members of U= {P1, P2, P3,P4}are pressure patient
Let 𝑈 𝑅 ={{P1, P2, P3}, {P4}} be an equivalence relation
𝒜 = {Salt food , colostreal food }are twoattributes
3 5 4 6 2 5
P1=〈 , , , , , 〉
10 10 10 10 10 10
2 6 7 5 3 1
P 2= 〈 , , , , , 〉
10 10 10 10 10 10
3 6 4 6 3 1
P3 = 〈 , , , , , 〉
10 10 10 10 10 10
2 5 7 5 2 5
P 4= 〈 , , , , , 〉.
10 10 10 10 10 10
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 ,N(F) ,𝑁(F),BN(F)}

2 5 7 5 2 5
N(F) = 〈
, , , , , 〉
10 10 10 10 10 10
3 6 4 6 3 1
𝑁(F) = 〈 , , , , , 〉
10 10 10 10 10 10
3 5 4 5 3 5
BN F = 〈 , , , , , 〉
10 10 10 10 10 10
2 5 7 5 2 5 3 6 4 6 3 1
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 , 〈 , , , , , 〉 ,〈 , , , , , 〉,
10 10 10 10 10 10 10 10 10 10 10 10
3 5 4 5 3 5 2 5 7 5 2 5
〈 , , , , , 〉,〈 , , , , , 〉}
10 10 10 10 10 10 10 10 10 10 10 10
is𝑁 𝑁 TS on U. Now, we define the two 𝑁 𝑁 (SO) sets as follows:
4 6 4 8 3 4
P5 = 〈 , , , , , 〉and
10 10 10 10 10 10
10 9 2 5 7 1
P6 =〈 , , , , , 〉.
10 10 10 10 10 10
10 9 2 8 7 4
But P5∪P6 = 〈 , , , , , 〉is a 𝑁 𝑁 (SO) set in U.
10 10 10 10 10 10
Theorem 1.1.9
Let A be 𝑁 𝑁 (SO) set in the 𝑁 𝑁 TS U and suppose A⊆B ⊆𝑁 𝑁 Cl (A). Then B is 𝑁 𝑁 (SO)
set in U.
Proof :
There exists a Neutrosophic Nano openset𝑁 𝑁 O such that 𝑁 𝑁 O ⊆A ⊆𝑁 𝑁 Cl (𝑁 𝑁 O).

Then 𝑁 𝑁 O ⊆B. But 𝑁 𝑁 Cl (A) ⊆𝑁 𝑁 Cl (𝑁 𝑁 O) and thus B ⊆𝑁 𝑁 Cl (𝑁 𝑁 O).Hence 𝑁 𝑁 O ⊆B

⊆𝑁 𝑁 Cl (𝑁 𝑁 O) and B is 𝑁 𝑁 (SO) set in U.
1.2.NEUTROSOPHIC NANO SEMI-CLOSED SETS IN NEUTROSOPHIC TOPOLOGICAL SPACES

In this section, the Neutrosophic Nano semi-closed set is introduced and studied
their properties.
Definition 1.2.1 :
Let A be 𝑁 𝑁 S of a 𝑁 𝑁 TS U. Then A is said to be Neutrosophic Nano semi-closed [
written 𝑁 𝑁 (SC) ] set of U if there exists a neutrosophicnano closed set 𝑁 𝑁 C such that
𝑁 𝑁 Int (𝑁 𝑁 C) ⊆A⊆𝑁 𝑁 C.
Theorem 1.2.2
A subset A in a 𝑁 𝑁 TS U is 𝑁 𝑁 CS set if and only if 𝑁 𝑁 Int (𝑁 𝑁 Cl (A))⊆A.
Proof :
Sufficiency:
Let 𝑁 𝑁 Int (𝑁 𝑁 Cl (A)) ⊆A. Then for 𝑁 𝑁 C = 𝑁 𝑁 Cl (A), we have 𝑁 𝑁 Int (𝑁 𝑁 C) ⊆A ⊆𝑁 𝑁 C.
Necessity:
Let A be 𝑁 𝑁 (SC) set in U. Then 𝑁 𝑁 Int (𝑁 𝑁 C) ⊆A⊆𝑁 𝑁 C for some Neutrosophic nano
closed set 𝑁 𝑁 C. But 𝑁 𝑁 Cl (A)⊆𝑁 𝑁 C and thus 𝑁 𝑁 Int (𝑁 𝑁 Cl(A))⊆𝑁 𝑁 Int (𝑁 𝑁 C)). Hence
𝑁 𝑁 Int (𝑁 𝑁 Cl (A))⊆𝑁 𝑁 Int (𝑁 𝑁 C)⊆A.
Theorem 1.2.3
Every Neutrosophicnano closed set in the 𝑁 𝑁 TS U is 𝑁 𝑁 (SC) set in U.
Proof :
Let A be Neutrosophicnano closed set in 𝑁 𝑁 TS U. Then A = 𝑁 𝑁 Cl (A). Also 𝑁 𝑁 Int
(𝑁 𝑁 Cl (A)) ⊆𝑁 𝑁 Cl (A). This implies that 𝑁 𝑁 Int (𝑁 𝑁 Cl (A)) ⊆A. Hence by Theorem 4.2 ,A is
𝑁 𝑁 (SC) set in U.

Remark 1.2.4 :
The converse of the above theorem need not be true as shown by the following
example.
Example 1.2.5 :
U={P1,P2 ,P3, P4}are Patients
Let 𝑈 𝑅 ={{ P1,P2 ,P3}, { P4}} be an equivalence relation
𝒜 = {Head ache, Temperature, Cold}are threeattributes
itsNeutrosphic values are given below
3 5 4 2 8 3 8 5 9
P1 = 〈 ,
10 10 10
, , 10 10 10
, , , 10 10 10
, , 〉
5 6 2 2 8 1 8 5 6
P2 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
3 5 5 2 8 4 8 5 9
P3 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 6 4 2 8 3 8 5 5
P4 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 ,N(M) ,𝑁(M),BN(M)}

3 5 5 2 8 4 8 5 9
N F =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 6 2 2 8 1 8 5 5
𝑁(F)= 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 5 3 2 8 2 8 5 8
BN(F)=〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
𝑁𝑁 𝜏 =
3 5 5 2 8 4 8 5 9 5 6 2 2 8 1 8 5 5
{0𝑁𝑁 , 1𝑁𝑁 ,〈 , , , , , , , , 〉,〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10
5 5 3 2 8 2 8 5 8 5 6 4 2 8 3 8 5 5
〈 , , , , , , , , 〉,〈 , , , , , , , , 〉}
10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10
5 5 3 4 2 2 9 5 8
P5 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
Here P5is 𝑁 𝑁 (SO) sets but are not Neutrosophic Nano open sets.
Also E is 𝑁 𝑁 (SC) set but is not Neutrosophicnano closed set.
Theorem 1.2.6 :
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then intersection of two 𝑁 𝑁 (SC) sets is a 𝑁 𝑁 (SC) set in

the 𝑁 𝑁 TS U.
Proof :
Let A and B are 𝑁 𝑁 (SC) sets in U. Then 𝑁 𝑁 Int (𝑁 𝑁 Cl (A)) ⊆A and 𝑁 𝑁 Int (𝑁 𝑁 Cl (B))
⊆B. Therefore A ∩ B ⊇𝑁 𝑁 Int (𝑁 𝑁 Cl (A))∩𝑁 𝑁 Int (𝑁 𝑁 Cl (B)) = 𝑁 𝑁 Int (𝑁 𝑁 Cl (A) ∩ 𝑁 𝑁 Cl (B))
⊇𝑁 𝑁 Int (𝑁 𝑁 Cl (A ∩ B)) [By Proposition2.4(14) ]. Hence A ∩ B is 𝑁 𝑁 (SC) set in U.
Example 1.2.7
U={P1,P2 ,P3, P4}are Patients
Let 𝑈 𝑅 ={{ P1,P2 ,P3}, { P4}} be an equivalence relation
𝒜 = {Temperature}are oneattributes
𝑈 𝑅 = {P1}{ P2,P3, P4}
10 5 7
P1 = 〈 , , 〉
10 10 10
0 9 2
P2 = 〈 , , 〉
10 10 10
10 9 2
P3 = 〈 , , 〉
10 10 10
10 6 7
P4 = 〈 , , 〉 .
10 10 10
Then 𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 ,N(M) ,𝑁(M),BN(M)}

0 5 7
N(F) = 〈 , , 〉
10 10 10
10 9 2
𝑁(F)=〈 , , 〉
10 10 10
7 5 2
BN(F)=〈 , , 〉
10 10 10
0 5 7 1 9 2 7 5 2 10 5 7
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 , , , , , , , , , , , , }
10 10 10 10 10 10 10 10 10 10 10 10
is𝑁 𝑁 TS on U. Now, we define the two 𝑁 𝑁 (SC) sets as follows :

7 5 2
P5 = 〈 , , 〉 and
10 10 10
2 0 8
P 6= 〈 , , 〉.
10 10 10
2 0 8
But P5∩ P6 = 〈 , , 〉is a 𝑁 𝑁 (SC) set in U.
10 10 10

Theorem 1.2.8 :
Let A be 𝑁 𝑁 (SC) set in the 𝑁 𝑁 TS U and suppose 𝑁 𝑁 Int (A) ⊆B ⊆A. Then B is
𝑁 𝑁 (SC) set in U.
Proof :
There exists a neutrosophicnano closed set 𝑁 𝑁 C such that 𝑁 𝑁 Int (𝑁 𝑁 C) ⊆A ⊆𝑁 𝑁 C.
Then B ⊆𝑁 𝑁 C.But 𝑁 𝑁 Int (𝑁 𝑁 C) ⊆𝑁 𝑁 Int (A) and thus 𝑁 𝑁 Int (𝑁 𝑁 C) ⊆B. Hence 𝑁 𝑁 Int
(𝑁 𝑁 C) ⊆B ⊆𝑁 𝑁 C and B is 𝑁 𝑁 (SC) set in U.
1.3 NEUTROSOPHIC NANO SEMI-INTERIOR IN NEUTROSOPHIC TOPOLOGICAL

SPACES
In this section, we introduce the Neutrosophic Nano semi-interior operator and their
properties in neutrosophic topological space.
Definition 1.3.1 :
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then for a neutrosophic subset A of U, the Neutrosophic
Nano semi-interior of A [𝑁 𝑁 S Int (A) for short ] is the union of all Neutrosophic Nano
semi-open sets of U contained in A.
That is, 𝑁 𝑁 S Int (A) =∪{G:G is a 𝑁 𝑁 (SO) set in U and G ⊆A}.
Proposition 1.3.2 :
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then for any neutrosophic subsets A and B of a 𝑁 𝑁 TS U
we have
(i) 𝑁 𝑁 S Int (A) ⊆A
(ii) A is 𝑁 𝑁 (SO) set in U ⇔ 𝑁 𝑁 S Int (A) = A
(iii) 𝑁 𝑁 S Int (𝑁 𝑁 S Int (A)) = 𝑁 𝑁 S Int (A)
(iv) If A⊆B then 𝑁 𝑁 S Int (A) ⊆𝑁 𝑁 S Int (B)
Proof :
(i) follows from Definition 1.3.1.
Let A be 𝑁 𝑁 (SO) set in U. Then A⊆𝑁 𝑁 S Int (A). By using (i) we get A = 𝑁 𝑁 S Int(A).

Conversely assume that A = 𝑁 𝑁 SInt (A). By using Definition 1.3.1, A is 𝑁 𝑁 (SO) set in U.
Thus (ii) is proved. By using (ii), 𝑁 𝑁 S Int (𝑁 𝑁 S Int (A)) = 𝑁 𝑁 S Int (A). This proves (iii). Since A
⊆B, by using (i), 𝑁 𝑁 S Int (A) ⊆A⊆B. That is 𝑁 𝑁 S Int (A) ⊆B. By (iii), 𝑁 𝑁 S Int (𝑁 𝑁 S Int (A))
⊆𝑁 𝑁 S Int (B).Thus 𝑁 𝑁 S Int (A) ⊆𝑁 𝑁 S Int (B). This proves (iv).
Theorem 1.3.3 :
Let (U, 𝑁𝑁 𝜏 )) be a 𝑁 𝑁 TS. Then for any neutrosophic subset A and B of a 𝑁 𝑁 TS,
we have
(i) 𝑁 𝑁 S Int ( A∩ B) = 𝑁 𝑁 S Int (A) ∩ 𝑁 𝑁 S Int (B)
(ii) 𝑁 𝑁 S Int (A ∪B) ⊇𝑁 𝑁 S Int (A) ∪𝑁 𝑁 S Int (B).
Proof :
Since A ∩ B ⊆A and A ∩ B ⊆B, by using Proposition 1.2 (iv), 𝑁 𝑁 S Int (A ∩ B) ⊆𝑁 𝑁 S
Int (A) and 𝑁 𝑁 S Int (A ∩ B) ⊆𝑁 𝑁 S Int (B).
This implies that 𝑁 𝑁 S Int (A ∩ B) ⊆𝑁 𝑁 S Int (A) ∩ 𝑁 𝑁 S Int (B) ----(1).
By using Proposition 1.2 (i), 𝑁 𝑁 S Int (A) ⊆A and 𝑁 𝑁 S Int (B) ⊆B.
This implies that 𝑁 𝑁 S Int (A) ∩ 𝑁 𝑁 S Int(B)⊆A∩B. Now applying Proposition 1.3.2 (iv), 𝑁 𝑁 S
Int ((𝑁 𝑁 S Int (A)∩𝑁 𝑁 S Int(B))⊆𝑁 𝑁 S Int (A∩B). By (1), 𝑁 𝑁 S Int (𝑁 𝑁 S Int (A))∩𝑁 𝑁 S Int (𝑁 𝑁 S
Int (B)) ⊆𝑁 𝑁 S Int (A ∩ B). By Proposition 1.3.2 (iii), 𝑁 𝑁 S Int (A)∩𝑁 𝑁 SInt(B)⊆𝑁 𝑁 S Int (A ∩ B)
----(2).
From (1) and (2), 𝑁 𝑁 S Int (A∩B) = 𝑁 𝑁 S Int (A)∩𝑁 𝑁 S
Int(B). This implies (i).
Since A⊆A∪B and B ⊆A∪B, by using Proposition 1.3.2 (iv), 𝑁 𝑁 S Int (A) ⊆𝑁 𝑁 S Int (A ∪B) and
𝑁 𝑁 S Int (B) ⊆𝑁 𝑁 S Int (A ∪B). This implies that 𝑁 𝑁 S Int (A) ∪𝑁 𝑁 S Int (B) ⊆𝑁 𝑁 S Int (A ∪B).
Hence (ii). The following example shows that the equality need not be hold in Theorem1.3.3
(ii).
Example 1.3.4 :
U={S1,S2 ,S3, S4}are Higher secondary student for wait for NEET entrance exam

𝒜 = {Physics, Chemistry, Biology}are three attributes are Exam subjects its Neutrosphic
values are given below
The members of U= {S1, S2, S3,S4}
Let 𝑈 𝑅 ={{S1 }, {S2, S3, S4}} be an equivalence relation
4 7 1 5 6 2 9 7 3
𝑆1 = 〈 , , , , , , , , 〉,
10 10 10 10 10 10 10 10 10
4 6 1 7 7 2 9 5 1
𝑆2 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 7 1 7 7 2 9 7 1
𝑆3 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 6 1 5 6 2 9 5 3
𝑆4 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 ,N(M) ,𝑁(M),BN(M)}
4 6 1 5 6 2 9 5 3
N F =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 7 1 7 7 2 9 7 1
𝑁(F)=〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
1 4 4 2 4 5 3 5 9
BN(F)=〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 6 1 5 6 2 9 5 3
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 , , , , , , , , , ,
10 10 10 10 10 10 10 10 10
4 7 1 7 7 2 9 7 1
, , , , , , , , ,
10 10 10 10 10 10 10 10 10
1 4 4 2 4 5 3 5 9
, , , , , , , , ,
10 10 10 10 10 10 10 10 10
4 6 1 5 6 2 9 5 3
, , , , , , , , }
10 10 10 10 10 10 10 10 10
7 6 1 7 6 1 9 5 1
S5 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 6 1 5 7 2 10 7 1
S6 = 〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
Then (U, 𝑁𝑁 𝜏 ) is a 𝑁 𝑁 TS. it follows that 𝑁 𝑁 S Int(S5∪ S6) ⊈‍ 𝑁 𝑁 S Int (S5) ∪𝑁 𝑁 S Int (S6).
1.4.NEUTROSOPHIC NANO SEMI-CLOSURE IN NEUTROSOPHIC TOPOLOGICAL SPACES

In this section, we introduce the concept of Neutrosophic Nano semi-closure
operators in a 𝑁 𝑁 TS.
Definition 1.4.1 :
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then for a neutrosophicnano subset A of U, the

Neutrosophic Nano semi-closure of A [𝑁 𝑁 (S)Cl(A) for short ] is the intersection of all

Neutrosophic Nano semi-closed sets of U contained in A. That is, 𝑁 𝑁 (S)Cl(A) = ∩ , K : K is a
𝑁 𝑁 (SC) set in U and K ⊇A }.
Proposition 1.4.2 :
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then for any neutrosophicnano subsets A of U,
(i) (𝑁 𝑁 S Int(A)C= 𝑁 𝑁 (S)Cl ((A)C),
(ii) (𝑁 𝑁 (S)Cl(A))C = 𝑁 𝑁 S Int ((A)C).
Proof :
By using Definition 1.4.1, 𝑁 𝑁 S Int (A) = ∪{ G : G is a 𝑁 𝑁 (SO) set in U and G ⊆A }.
Taking complement on both sides, (𝑁 𝑁 S Int (A))C= ( ∪ { G : G is a 𝑁 𝑁 (SO) set in U and G ⊆A
})C= ∩ , (G)C : (G) Cis a 𝑁 𝑁 (SC) set in U and (𝐴)𝐶 ⊆ (G) C
}. Replacing (G) C
by K, we get
(𝑁 𝑁 S Int (A)) C = ∩ , K : K is a 𝑁 𝑁 (SC) set in U and K ⊇(𝐴)𝐶 }. By Definition 6.1, (𝑁 𝑁 S Int
(A))C = 𝑁 𝑁 (S)Cl ( (A)C). This proves (i). By using (i), (𝑁 𝑁 S Int ((AC)))C = 𝑁 𝑁 (S)Cl((AC))C =
𝑁 𝑁 (S)Cl(A). Taking complement on both sides, we get 𝑁 𝑁 S Int ((A)C) = (𝑁 𝑁 (S)Cl (A))C. Hence
proved (ii).
Proposition 1.4.3 :
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then for any neutrosophic subsets A and B of a 𝑁 𝑁 TS U
we have
(i) A ⊆𝑁 𝑁 (S)Cl(A)
(ii) A is 𝑁 𝑁 (SC) set in U ⇔𝑁 𝑁 (S)Cl(A) = A
(iii) 𝑁 𝑁 (S)Cl(𝑁 𝑁 (S)Cl (A)) = 𝑁 𝑁 (S)Cl (A)
(iv) If A ⊆B then 𝑁 𝑁 (S)Cl(A) ⊆𝑁 𝑁 (S)Cl (B)
Proof :
(i) follows from Definition 6.1.
Let A be 𝑁 𝑁 (SC) set in U. By using Definition,
(𝐴)𝐶 is𝑁 𝑁 (SO) set in U. By Proposition 6.2 (ii),
𝑁 𝑁 S Int ((𝐴)𝐶 ) = (𝐴)𝐶 ⇔ (𝑁 𝑁 (S)Cl(A)) C = (𝐴)𝐶 ⇔𝑁 𝑁 (S)Cl (A) = A. Thus proved (ii).

By using (ii), 𝑁 𝑁 (S)Cl(𝑁 𝑁 (S)Cl (A)) = 𝑁 𝑁 (S)Cl (A) . This proves (iii).
Since A ⊆B, (B) C⊆ (A) C. By using Proposition 1.2 (iv), 𝑁 𝑁 S Int ((B) C) ⊆𝑁 𝑁 S Int ((A) C). Taking
complement on both sides, (𝑁 𝑁 S Int ((BC))) C⊇ (𝑁 𝑁 S Int ((A) C)) C. By Proposition 6.2 (ii),
𝑁 𝑁 (S)Cl(A) ⊆𝑁 𝑁 (S)Cl (B). This proves (iv).
Proposition 1.4.4 :
Let A be a neutrosophicnano set in a 𝑁 𝑁 TS U.
Then 𝑁 𝑁 Int (A) ⊆𝑁 𝑁 S Int (A) ⊆A ⊆𝑁 𝑁 (S)Cl (A) ⊆𝑁 𝑁 Cl (A).
Proof :
It follows from the definitions of corresponding operators.
Proposition 1.4.5 :
Let (U, 𝑁𝑁 𝜏 ) be a 𝑁 𝑁 TS. Then for a neutrosophic subset A and B of a 𝑁 𝑁 TS U, we
have
(i) 𝑁 𝑁 (S)Cl(A ∪B) = 𝑁 𝑁 (S)Cl (A) ∪𝑁 𝑁 (S)Cl (B) and
(ii) 𝑁 𝑁 (S)Cl(A ∩B) ⊆𝑁 𝑁 (S)Cl (A) ∩ 𝑁 𝑁 (S)Cl (B).
Proof :
Since 𝑁 𝑁 (S)Cl (A ∪B) = 𝑁 𝑁 (S)Cl (C (C(A ∪B))) , by using Proposition 1.4.2 (i),
𝑁 𝑁 (S)Cl (A ∪B) = (𝑁 𝑁 S Int ((A ∪B) C)) C
= (𝑁 𝑁 S Int ((𝐴)𝐶 ∩(B) C))C. Again using Proposition
1.4.3 (i), 𝑁 𝑁 (S)Cl(A ∪B) = (𝑁 𝑁 S Int ((A) C) C ∩ 𝑁 𝑁 S Int ((B) C)) = (𝑁 𝑁 S Int ((A) C)) C∪ (𝑁 𝑁 S Int
((B) C)) C. By using Proposition 1.4.2 (i), 𝑁 𝑁 (S)Cl(A ∪B) = 𝑁 𝑁 (S)Cl (((A) C)) C∪𝑁 𝑁 (S)Cl (((BC)) C)
= 𝑁 𝑁 (S)Cl (A)∪𝑁 𝑁 (S)Cl (B). Thus proved (i).
Since A ∩ B ⊆A and A ∩ B ⊆B, by using Proposition 1.4.3 (iv), 𝑁 𝑁 (S)Cl (A ∩ B) ⊆𝑁 𝑁 (S)Cl (A)
and 𝑁 𝑁 (S)Cl(A∩B) ⊆𝑁 𝑁 (S)Cl(B). This implies that 𝑁 𝑁 (S)Cl(A∩B) ⊆𝑁 𝑁 (S)Cl (A)∩ 𝑁 𝑁 (S)Cl
(B). This proves(ii).
The following example shows that the equality need not be hold in Proposition 1.4.5 (ii).
Example 1.4.6 :

U={P1,P2 ,P3, P4}are sugar patient

Let 𝑈 𝑅 ={{ P1,P2 ,P3},{P4}} be an equivalence relation
𝒜 = {Thirsty, Urinal, wait lose}are threeattributes
itsNeutrosphic values are given below
5 6 1 6 7 1 9 5 2
P1 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 5 2 8 6 3 9 7 3
P2 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 5 2 6 6 3 9 5 3
P3 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 6 1 8 7 1 9 7 2
P4 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 ,N(M) ,𝑁(M),BN(M)}

4 5 2 6 6 3 9 5 3
N F =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 5 1 8 7 1 9 7 2
𝑁(F)=〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
2 4 4 3 4 6 3 5 9
BN(F)=〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
4 5 2 6 6 3 9 5 3
𝑁𝑁 𝜏 = {0𝑁𝑁 , 1𝑁𝑁 , 〈 , , , , , , , , 〉,
10 10 10 10 10 10 10 10 10
5 5 1 8 7 1 9 7 2
〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
2 4 4 3 4 6 3 5 9
〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
5 6 1 8 7 1 9 7 2
〈 , , , , , , , , 〉}
10 10 10 10 10 10 10 10 10
Then (U, 𝑁𝑁 𝜏 ) is a 𝑁 𝑁 TS.

Consider the 𝑁 𝑁 Ss are
1 2 5 2 3 7 3 3 10
P5 =〈 , , , , , , , , 〉
10 10 10 10 10 10 10 10 10
2 4 4 1 2 8 2 5 9
and P6 = 〈 , , , , , , , , 〉.
10 10 10 10 10 10 10 10 10
Then 𝑁 𝑁 (S)Cl(P5) ∩ 𝑁 𝑁 (S)Cl (P6) ⊈‍ 𝑁 𝑁 (S)Cl (P5 ∩ P6).
Theorem 1.4.7 :
Let 𝑁𝑁 𝜏 be a 𝑁 𝑁 TS. Then for a neutrosophic subset A and B of U we have,
(i) 𝑁 𝑁 (S)Cl(A) ⊇A ∪𝑁 𝑁 (S)Cl (𝑁 𝑁 S Int (A)),
(ii) 𝑁 𝑁 S Int (A) ⊆A ∩ 𝑁 𝑁 S Int (𝑁 𝑁 (S)Cl(A)),

(iii) 𝑁 𝑁 Int (𝑁 𝑁 (S)Cl(A)) ⊆𝑁 𝑁 Int (𝑁 𝑁 Cl(A)),

(iii) 𝑁 𝑁 Int (𝑁 𝑁 (S)Cl(A)) ⊇𝑁 𝑁 Int (𝑁 𝑁 (S)Cl (𝑁 𝑁 S Int (A))).
(iv)
Proof :
By Proposition 1.4.3 (i), A ⊆ 𝑁 𝑁 (S)Cl (A) ---- (1). Again using Proposition 1.4.2 (i),
𝑁 𝑁 S Int (A) ⊆A. Then 𝑁 𝑁 (S)Cl(𝑁 𝑁 S Int (A)) ⊆𝑁 𝑁 (S)Cl (A) ---- (2). By (1) & (2) we have, A
∪𝑁 𝑁 (S)Cl(𝑁 𝑁 S Int (A)) ⊆𝑁 𝑁 (S)Cl (A). This proves (i).
By Proposition 1.4.2 (i), 𝑁 𝑁 S Int (A) ⊆A ---- (1). Again using proposition 1.4.3 (i), A
⊆𝑁 𝑁 (S)Cl(A). Then
𝑁 𝑁 S Int (A) ⊆𝑁 𝑁 S Int (𝑁 𝑁 (S)Cl(A)) ---- (2). From (1) & (2), we have 𝑁 𝑁 S Int (A) ⊆A ∩ 𝑁 𝑁 S
Int (𝑁 𝑁 (S)Cl(A)). This proves(ii).
By Proposition 1.4.4, 𝑁 𝑁 (S)Cl(A) ⊆𝑁 𝑁 Cl (A). We get 𝑁 𝑁 Int (𝑁 𝑁 (S)Cl(A)) ⊆𝑁 𝑁 Int (𝑁 𝑁 Cl (A)).
Hence (iii).
By (i), 𝑁 𝑁 (S)Cl(A) ⊇A ∪𝑁 𝑁 (S)Cl (𝑁 𝑁 S Int (A)). We have 𝑁 𝑁 Int (𝑁 𝑁 (S)Cl(A) ⊇𝑁 𝑁 Int (A
∪𝑁 𝑁 (S)Cl (𝑁 𝑁 S Int (A)) ). Since 𝑁 𝑁 Int (A ∪B) ⊇𝑁 𝑁 Int (A) ∪𝑁 𝑁 Int (B), 𝑁 𝑁 Int (𝑁 𝑁 (S)Cl (A)
⊇𝑁 𝑁 Int (A) ∪𝑁 𝑁 Int (𝑁 𝑁 (S)Cl (𝑁 𝑁 S Int (A))) ⊇ 𝑁 𝑁 Int (𝑁 𝑁 (S)Cl (𝑁 𝑁 S Int (A))). Hence (iv)

Reference :
[1] Salama.A and Alblowi.S.A., Generalized neutrosophic set and generalized
neutrosophic topological spaces, Journal Computer Sci. Engineering, Vol.2 No.7,
(2012),129-132.
[2] Smarandache.F, ”A unifying field in logics neutrosophyneutrosophic probability, set
and Logic”, Rehoboth American Research Press 1999.
[3] LellisThivagar.M and Carmel Richard.,Onnano forms of weakly open sets,
International Journal of Mathematics and Statistics Invention, Vol.1
No.1,(2013),31-37.
[4] M. LellisThivagar, SaeidJafari V. Sutha Devi V. Antonysamy., A novel approach to
nano topology via neutrosophic sets.,Neutrosophic Sets and Systems, Vol. 20,
2018.,86-93
[5] M.Parimala, R.Jeevitha, S.Jafari, F.Smarandache, M.Karthika, Neutrosophic Nano Αψ
Closed Sets In Neutrosophic Nano Topological Spaces, Jour of Adv Research in
Dynamical & Control Systems, Vol. 10, 10-Special Issue, 2018.,523-531
[6] Ishwarya, P and Bageerathi, K., On Neutrosophicsemiopen sets in
Neutrosophictopological spaces, International Jour. of Math. Trends and Tech.
2016, 214-223.

Neutrosophic System and Its Applications A New Wave

Uploaded by

Document Information

Original Title

Copyright

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Neutrosophic System and Its Applications A New Wave

Uploaded by

Copyright:

Neutrosophic System and its Applications “A New Wave" ISBN : 9781365528811

CERTAIN TYPES OF NEUTROSOPHIC GRAPHS

2. 𝐸 ⊆ 𝑉 × 𝑉 where 𝜇2 : 𝑉 × 𝑉 → [0,1] and 𝛾2 : 𝑉 × 𝑉 → [0,1] are such that

Lulu, Intetnational Publisher, United States. 1

𝜇2 (𝑣𝑖 , 𝑣𝑗 ) ≤ 𝑚𝑖𝑛{𝜇1 (𝑣𝑖 ), 𝜇1 (𝑣𝑗 )} (2.2)

3.Certain types of Neutrosophic Graphs:-

2. 𝐸 ⊆ 𝑉 × 𝑉where 𝜇2 : 𝑉 × 𝑉 → [0,1] , 𝜍2 : 𝑉 × 𝑉 → [0,1] and 𝛾2 : 𝑉 × 𝑉 → [0,1] are

Definition 3.2 : An neutrosophic graph 𝐺 = 〈𝑉, 𝐸〉 is said to be complete neutrosophic graph if

Lulu, Intetnational Publisher, United States. 2

𝛾2𝑖𝑗 = 𝑚𝑎𝑥(𝛾1𝑖 , 𝛾1𝑗 ), for every 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉.

𝑢≠𝑣 ‍𝛾2 (𝑢, 𝑣).

Definition 3.5 : The complement of a strong neutrosophic graph 𝐺 𝑜𝑛 𝐺 ∗ a Strong Neutrosophic

Lulu, Intetnational Publisher, United States. 3

that 𝐺 is given by the neutrosophic graph 𝐺 =< 𝑉, 𝐸 > on 𝐺 ∗ where 𝑉 = 𝑉 and 𝜇2 𝑣𝑖 , 𝑣𝑗 =

min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗 , 𝜍2 𝑣𝑖 , 𝑣𝑗 = min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗 ,𝛾2 𝑣𝑖 , 𝑣𝑗 = max 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗 . for all

Thus 𝜇2 = 𝜇2 , 𝜍2 = 𝜍2 , 𝑎𝑛𝑑 𝛾2 = 𝛾2 on 𝑉 , where 𝐸 = (𝜇2 , 𝜍2 , 𝛾2 ) is the strong

Proposition 3.1 : 𝐺 = 𝐺 if and only if 𝐺 is a strong neutrosophic graph.

Definition 3.6 : A strong neutrosophic graph 𝐺 is called self complementary if 𝐺 ≈ 𝐺.

Lulu, Intetnational Publisher, United States. 4

Clearly, 𝐺 = 𝐺. Hence 𝐺 is self complementary.

Proposition 3.2 : Let G be a strong neutrosophic graph. If

Proof. Let 𝐺 be a strong neutrosophic graph such that

for all 𝑣𝑖 , 𝑣𝑗 ∈ 𝑉. Then 𝐺 ≃ 𝐺 under the identity map 𝐼: 𝑉 → 𝑉 .Hence 𝐺 is self

Proposition 3.3 : Let G be a self complementary strong neutrosophic graphic. Then

𝑣𝑖 ≠𝑣𝑗 ‍𝜇2 𝑣𝑖 , 𝑣𝑗 = 𝑣𝑖 ≠𝑣𝑗 ‍min 𝜇1 𝑣𝑖 , 𝜇1 𝑣𝑗

𝑣𝑖 ≠𝑣𝑗 ‍𝜍2 𝑣𝑖 , 𝑣𝑗 = 𝑣𝑖 ≠𝑣𝑗 ‍min 𝜍1 𝑣𝑖 , 𝜍1 𝑣𝑗

𝑣𝑖 ≠𝑣𝑗 ‍𝛾2 𝑣𝑖 , 𝑣𝑗 = 𝑣𝑖 ≠𝑣𝑗 ‍max 𝛾1 𝑣𝑖 , 𝛾1 𝑣𝑗

Proposition 3.4 : Let 𝐺1 and 𝐺2 be strong neutrosophic graphics. 𝐺1 ≈ 𝐺2 .

= min[𝜇 (𝑓(𝑣𝑖 )), 𝜇 (𝑓(𝑣𝑗 ))]

Lulu.com, United States 5

=𝜇 (𝑓(𝑣𝑖 ), 𝑓(𝑣𝑗 )),

For all 𝑣𝑖 , 𝑣𝑗 ∈ 𝐸1 .Hence 𝐺1 ≈ 𝐺2 . The converse is straight forward.

Lulu.com, United States 6

1. M.Akram,B.Davvaz, Strong intuitionistic fuzzy graphs, Filomat 26:1 (2012), 177-196.

3. F.Harary, Graph Theory, Addition Westley, Third Printing,October 1972.

6. F. Smarandache, Neutrosophy and Neutrosophic Logic, First International Conference

7. F. Smarandache, Neutrosophic set, a generalisation of the intuitionistic fuzzy sets, Int.

8. L.A. Zadeh, Fuzzy sets, Information Control 8 (1965) 338-353.

Lulu.com, United States 7

NEUTROSOPHIC IMPLICATIVE 𝓝-IDEALS IN 𝑲𝑼-ALGEBRAS

Lulu.com, United States 8

In a KU-algebra P, the following hold:

Lulu.com, United States 9

A subset I of a KU-algebra P is called an ideal [7, 8] of P if it satisfies the following:

A KU-algebra P is said to be implicative [9] if it satisfies the following equality:

(∀ l11 , l22 ∈ P)(l22 ∈ I, l11 ⪯ l22 ⇒ l11 ∈ I).

A subset I of a KU-algebra P is called a commutative ideal (briefly, c-ideal) [5] of P if it

A subset I of a KU-algebra P is called a positive implicative ideal (briefly, pi-ideal) [5] of P

Any pi-ideal is an ideal, but the converse is not true.

Lemma 2.2: [6] A subset I of a KU-algebra P is a pi-ideal of P iff I is an ideal of P

Lulu.com, United States 10

satisfies the following condition:

For any family {λj |j ∈ Δ} of real numbers, we define

A 𝒩n (briefly, 𝒩n )-structure over P ([3]) is defined to be the structure:

We note that every 𝒩n -structure PN over P satisfies the condition:

(∀ l11 ∈ P)(−3 ≤ 𝕋N (l11 ) + 𝕀N (l11 ) + 𝔽N (l11 ) ≤ 0).

Definition 2.1 : [11] A 𝒩n -structure PN over a KU-algebra P is called a 𝒩n -subalgebra of P

Definition 2.2 : [11] A 𝒩n -structure PN over a KU-algebra P is called a 𝒩n -ideal of P if the

Lulu.com, United States 11

𝕋N (0) ≤ 𝕋N (l11 ) ≤∨ {𝕋N (l22 ∗ l11 ), 𝕋N (l22 )}

3. Neutrosophic Implicative 𝓝-Ideals :-

In what follows, let P denote a KU-algebra unless otherwise specified.

Definition 3.1 : A 𝒩n -structure PN over P is called a neutrosophic implicative 𝒩

be a 𝒩n -structure over P. Then PN is a 𝒩ni -ideal of P.

Lulu.com, United States 12

Example 3.2 : Consider a KU-algebra P = {0, a5 , b5 , c5 , d5 } with the following Cayley

3. xy=0 and yx=0 implies x=y ∀𝒙, 𝒚 ∈ 𝑿.