0044 - Co-Neighborhood in Neutrosophic Graphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/358266639
Co-Neighborhood in Neutrosophic Graphs
Preprint · February 2022

DOI: 10.13140/RG.2.2.17687.44964
CITATIONS READS
0 20
1 author:
Henry Garrett
97 PUBLICATIONS 65 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Combinatorics View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 01 February 2022.
The user has requested enhancement of the downloaded file.

Co-Neighborhood in Neutrosophic Graphs
Henry Garrett
Independent Researcher
DrHenryGarrett@gmail.com
Twitter’s ID: @DrHenryGarrett | DrHenryGarrett.wordpress.com

c
Abstract
New setting is introduced to study the co-neighborhood. co-neighborhood is about a set
of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has
the key role to define this notion. Also, neighborhood is defined based on strong edges.
Strong edge gets a framework as neighborhood and after that, too close vertices have
key role to define co-neighborhood based on strong edges. The structure of set is studied
and general results are obtained. Also, some classes of neutrosophic graphs excluding
empty, complete bipartite, bipartite and wheel and containing odd-path-neutrosophic
graphs, even-path-neutrosophic graphs, odd-cycle-neutrosophic graphs,
even-cycle-neutrosophic graphs, complete-neutrosophic graphs and star-neutrosophic
graphs are investigated in the terms of set, minimal set, number, and neutrosophic
number in both settings neighborhood and co-neighborhood. Neutrosophic number is
reused in this way. It’s applied to use the type of neutrosophic number in the way that,
three values of a vertex are used and they’ve same share to construct this number. It’s
called “modified neutrosophic number”. Summation of three values of vertex makes one
number and applying it to a set makes neutrosophic number of set. This approach
facilitates identifying minimal set and optimal set which form quasi-order and quasi-size.
Two different types of sets and numbers namely neutrosophic neighborhood,
neutrosophic t-neighborhood, neutrosophic co-neighborhood, neutrosophic
co-t-neighborhood, neutrosophic quasi-order, neutrosophic number, neutrosophic
quasi-size, co-neutrosophic number, neutrosophic quasi-vertex set, and neutrosophic
quasi-edge set are defined. Co-neighborhood identifies the sets in general vision but
minimal-set takes focus on the sets which deleting a vertex is impossible. Neutrosophic
number and co-neutrosophic number neutrosophic quasi-order, neutrosophic number
and neutrosophic quasi-size is about minimum cardinality amid the cardinalities of same
types in a given neutrosophic graph. New notions are applied in the setting of individual.
Family of neutrosophic graphs has an open avenue, in the way that, the family only
contains same classes of neutrosophic graphs. The results are about neutrosophic
neighborhood, neutrosophic t-neighborhood, neutrosophic co-neighborhood,
neutrosophic co-t-neighborhood, neutrosophic quasi-order, neutrosophic number,
neutrosophic quasi-size, co-neutrosophic number, neutrosophic quasi-vertex set, and
neutrosophic quasi-edge set, their corresponded sets and characterizing all
minimal-types sets neutrosophic neighborhood, neutrosophic t-neighborhood,
neutrosophic co-neighborhood, neutrosophic co-t-neighborhood, neutrosophic
quasi-vertex set, neutrosophic quasi-edge set, and other corresponded sets. Some classes
of neutrosophic graphs behave differently when the parity of vertices are different and in
1/21
this case, cycle, and path illustrate these behaviors. Two applications concerning
complete model as individual in the settings of quasi-order and quasi-size, under the
titles of time table and scheduling conclude the results and they give more clarifications
and closing remarks. In this study, there’s an open way to extend these results into the
family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t
studied but it seems that analogous results are determined. Slight progress is obtained
in the family of these models but there are open avenues to study family of other
models as same models and different models. There’s a question. How can be related to
each other, two sets partitioning the vertex set of a graph in the terms of vertex set and
edge set? The ideas of quasi-edge set and quasi-vertex set based on strong edges
illustrate open way to get results. A set is either quasi-vertex set or quasi-edge set when
two sets partitioning vertex set and edge set identify other vertices or edges. It leads us
to the notion of quasi-order and quasi-size. Different edges make different
neighborhoods but it’s used one style edge titled strong edge. These notions are applied
into neutrosophic graphs as individuals but not family of them as drawbacks for these
notions. Finding special neutrosophic graphs which are well-known, is an open way to
purse this study. Some problems are proposed to pursue this study. Basic familiarities
with graph theory and neutrosophic graph theory are proposed for this article.
Keywords: Co-Neighborhood, Quasi-Order, Quasi-Size

AMS Subject Classification: 05C17, 05C22, 05E45
1 Background 1
Fuzzy set in Ref. [16], neutrosophic set in Ref. [2], related definitions of other sets in 2
Refs. [2, 14, 15], graphs and new notions on them in Refs. [5–12], neutrosophic graphs 3
in Ref. [3], studies on neutrosophic graphs in Ref. [1], relevant definitions of other 4
graphs based on fuzzy graphs in Ref. [13], related definitions of other graphs based on 5
neutrosophic graphs in Ref. [4], are proposed. 6
In this section, I use two subsections to illustrate a perspective about the 7
background of this study. 8
1.1 Motivation and Contributions 9
In this study, there’s an idea which could be considered as a motivation. 10
Question 1.1. Is it possible to use mixed versions of ideas concerning 11
“t-Neighborhood”, “co-t-Neighborhood” and “Complete Neutrosophic Graph” to define 12
some notions which are applied to neutrosophic graphs? 13
It’s motivation to find notions to use in any classes of neutrosophic graphs. 14
Real-world applications about time table and scheduling are another thoughts which 15
lead to be considered as motivation. Connections amid two vertices have key roles to 16
assign neutrosophic neighborhood, neutrosophic t-neighborhood, neutrosophic 17
co-neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-order, 18
neutrosophic number, neutrosophic quasi-size, co-neutrosophic number, neutrosophic 19
quasi-vertex set and neutrosophic quasi-edge set. Thus they’re used to define new ideas 20
which conclude to the structure quasi-size and quasi-order. The concept of having 21
strong edge inspires me to study the behavior of strong edges in the way that, some 22
types of numbers and set, e.g., neutrosophic quasi-order, neutrosophic number, 23
neutrosophic quasi-size, co-neutrosophic number are the cases of study in the settings of 24
individuals. Also, there are some avenues to extend these notions. 25
2/21
The framework of this study is as follows. In the beginning, I introduce basic 26
definitions to clarify about preliminaries. In subsection “Preliminaries”, new notions of 27
neutrosophic neighborhood, neutrosophic t-neighborhood, neutrosophic 28
co-neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-order, 29
neutrosophic number, neutrosophic quasi-size, co-neutrosophic number, neutrosophic 30
quasi-vertex set and neutrosophic quasi-edge set are introduced and are clarified as 31
individuals. In section “Preliminaries”, general sets have the key role in this way. 32
General results are obtained and also, the results about the basic notions of 33
co-neighborhood are elicited. some classes of neutrosophic graphs are studied in the 34
terms of neutrosophic quasi-order, in section “Neutrosophic Quasi-Order,” as 35
individuals. In section “Neutrosophic Quasi-Size,”, both numbers have applied into 36
individuals. As a concluding results, there are some statements, remarks, examples and 37
clarfications about odd-path-neutrosophic graphs, even-path-neutrosophic graphs, 38
odd-cycle-neutrosophic graphs, even-cycle-neutrosophic graphs, complete-neutrosophic 39
graphs and star-neutrosophic graphs. The clarifications are also presented in both 40
sections “Neutrosophic Quasi-Order,” and “Neutrosophic Quasi-Size,” for introduced 41
results and used classes. In section “Applications in Time Table and Scheduling”, two 42
applications are posed for omplete-neutrosophic graphs concerning time table and 43
scheduling when the suspicions are about choosing some subjects and the mentioned 44
models are complete as individual. In section “Open Problems”, some problems and 45
questions for further studies are proposed. In section “Conclusion and Closing 46
Remarks”, gentle discussion about results and applications is featured. In section 47
“Conclusion and Closing Remarks”, a brief overview concerning advantages and 48
limitations of this study alongside conclusions is formed. 49
1.2 Preliminaries 50
In this subsection, basic material which is used in this article, is presented. Also, new 51
ideas and their clarifications are elicited. 52
Basic idea is about the model which is used. First definition introduces basic model. 53
Definition 1.2. (Graph). 54
G = (V, E) is called a graph if V is a set of objects and E is a subset of V × V (E 55
is a set of 2-subsets of V ) where V is called vertex set and E is called edge set. 56
Every two vertices have been corresponded to at most one edge. 57
Neutrosophic graph is the foundation of results in this paper which is defined as 58
follows. Also, some related notions are demonstrated. 59
Definition 1.3. (Neutrosophic Graph And Its Special Case). 60
N T G = (V, E, σ = (σ1 , σ2 , σ3 ), µ = (µ1 , µ2 , µ3 )) is called a neutrosophic graph if

it’s graph, σi : V → [0, 1], and µi : E → [0, 1]. We add one condition on it and we use
special case of neutrosophic graph but with same name. The added condition is as
follows, for every vi vj ∈ E,
µ(vi vj ) ≤ σ(vi ) ∧ σ(vj ).
(i) : σ is called neutrosophic vertex set. 61
(ii) : µ is called neutrosophic edge set. 62
(iii) : |V | is called order of NTG and it’s denoted by O(N T G). 63
(iv) : Σv∈V σ(v) is called neutrosophic order of NTG and it’s denoted by On (N T G). 64
(v) : |E| is called size of NTG and it’s denoted by S(N T G). 65
3/21
(vi) : Σe∈E Σ3i=1 µi (e) is called neutrosophic size of NTG and it’s denoted by 66
Sn (N T G). 67
Some classes of well-known neutrosophic graphs are defined. These classes of 68
neutrosophic graphs are used to form this study and the most results are about them. 69
Definition 1.4. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then 70
(i) : a sequence of vertices P : x0 , x1 , · · · , xn is called path where 71
xi xi+1 ∈ E, i = 0, 1, · · · , n − 1; 72
V
(ii) : strength of path P : x0 , x1 , · · · , xn is i=0,··· ,n−1 µ(xi xi+1 ); 73
(iii) : connectedness amid vertices x0 and xn is

^ ^
µ∞ (x, y) = µ(xi xi+1 );
P :x0 ,x1 ,··· ,xn i=0,··· ,n−1
(iv) : a sequence of vertices P : x0 , x1 , · · · , xn is called cycle where 74
xi xi+1 ∈ E, i = 0,V1, · · · , n − 1 and there are two edges xy and uv such that 75
µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 ); 76
(v) : it’s t-partite where V is partitioned to t parts, V1 , V2 , · · · , Vt and the edge xy 77
implies x ∈ Vi and y ∈ Vj where i 6= j. If it’s complete, then it’s denoted by 78
Kσ1 ,σ2 ,··· ,σt where σi is σ on Vi instead V which mean x 6∈ Vi induces σi (x) = 0; 79
(vi) : t-partite is complete bipartite if t = 2, and it’s denoted by Kσ1 ,σ2 ; 80
(vii) : complete bipartite is star if |V1 | = 1, and it’s denoted by S1,σ2 ; 81
(viii) : a vertex in V is center if the vertex joins to all vertices of a cycle. Then it’s 82
wheel and it’s denoted by W1,σ2 ; 83
(ix) : it’s complete where ∀uv ∈ V, µ(uv) = σ(u) ∧ σ(v); 84
(x) : it’s strong where ∀uv ∈ E, µ(uv) = σ(u) ∧ σ(v). 85
The notions of neighbor and neighborhood are about some vertices which have one 86
edge with a fixed vertex. These notions present vertices which are close to a fixed vertex 87
as possible. Based on strong edge, it’s possible to define different neighborhood as 88
follows. 89
Definition 1.5. (Neighborhood). 90
Let N T G : (V, E, σ, µ) be a neutrosophic graph. Suppose x ∈ V. Then
N (x) = {y ∈ V | xy ∈ E}.
Definition 1.6. (Co-Neighborhood). 91
Let N T G : (V, E, σ, µ) be a neutrosophic graph and t ∈ N. Suppose 92
xi ∈ V, i = 1, 2, · · · , t. Then 93
(i)
Nt (x1 , x2 , · · · , xt ) = {y ∈ V | xi y ∈ E, i = 1, 2, · · · , t}.
If minx1 ,x2 ,··· ,xt ∈V Nt [x1 , x2 , · · · , xt ] = V, then neutrosophic t-neighborhood
is called neutrosophic quasi-vertex set and t is called neutrosophic
quasi-order. Generally, when t isn’t fixed, it’s called neutrosophic
neighborhood. Neutrosophic number is
Σminx1 ,x2 ,··· ,xt ∈V Nt [x1 ,x2 ,··· ,xt ]=V Σ3j=1 σj (xi ).
4/21
Figure 1. A Neutrosophic Graph in the Viewpoint of its Quasi-Order and its Quasi-Size.
(ii)
Nt (x1 , x2 , · · · , xt ) = {e ∈ E | e = xi y ∈ E, i = 1, 2, · · · , t}.
If minx1 ,x2 ,··· ,xt ∈V Nt [x1 , x2 , · · · , xt ] = E, then neutrosophic
co-t-neighborhood is called neutrosophic quasi-edge set and t is called
neutrosophic quasi-size. Generally, when t isn’t fixed, it’s called
neutrosophic co-neighborhood. Co-neutrosophic number is
3
Σminx1 ,x2 ,··· ,xt ∈V Nt [x1 ,x2 ,··· ,xt ]=E Σj=1 σj (xi ).
For convenient usages, the word neutrosophic which is used in previous definition, 94
won’t be used, usually. 95
In next part, clarifications about main definition are given. To avoid confusion and 96
for convenient usages, examples are usually used after every part and names are used in 97
the way that, abbreviation, simplicity, and summarization are the matters of mind. 98
Example 1.7. In Figure (1), a complete neutrosophic graph is illustrated. Some points 99
are represented in follow-up items as follows. 100
(i) S = {n3 , n4 } is quasi-vertex set; 101
(ii) S = {n3 , n4 } isn’t quasi-edge set; 102
(iii) N2 (n3 , n4 ) = E \ {n1 n2 }; 103
(iv) N2 (n3 , n4 ) = V ; 104
(iv) Quasi-order is one; 105
(iv) Quasi-size is three; 106
(v) Neutrosophic number is 0.9 and corresponded set is {n4 }; 107
(vi) Co-neutrosophic number is 3.9 and corresponded set is {n1 , n3 , n4 }. 108
2 Neutrosophic Quasi-Order 109
In this section, the behaviors of some classes of neutrosophic graphs are studied where 110
the concepts of quasi-order and quasi-vertex set are applied. Parity of number of vertex 111
set is considered when the classes are paths or cycles. There an efforts to obtain optimal 112
set and optimal number in the terms of quasi-vertex set and quasi-order. 113
An odd path is a path with leaves with odd indexes. If first leaf is assigned to first 114
number, then the last leaf is also an odd number. Thus by every odd indexes are 115
neighbors of even indexes, the set with minimum numbers which cover all vertices, is 116
the set with vertices which have even indexes. 117
5/21
Figure 2. A Neutrosophic Graph in the Viewpoint of its Quasi-Order.
Proposition 2.1. Let N T G : (V, E, σ, µ) be an odd path. Then {x2 , x4 , · · · , xn−1 } is 118
related to quasi-order b n2 c. 119
Proof. Suppose N T G : (V, E, σ, µ) be an odd path. Thus N T G : (V, E, σ, µ) is 120
P : x1 , x2 , · · · , xn where n and 1 has same parity. There are two sets. {x1 , x3 , · · · , xn } 121
has quasi-order b n2 c + 1 but {x2 , x4 , · · · , xn−1 } has quasi-order b n2 c which is minimum 122
number amid these two sets. So {x2 , x4 , · · · , xn−1 } is related to quasi-order b n2 c. 123
{x2 , x4 , · · · , xn−1 } is quasi-vertex set which is optimal. 124
In next part, one odd-path-neutrosophic graph us depicted. Quasi-order and 125
corresponded set is computed. 126
Example 2.2. In Figure (2), an odd-path-neutrosophic graph is illustrated. Some 127
points are represented in follow-up items as follows. 128
(i) S = {n2 , n4 } is quasi-vertex set; 129
(ii) N2 (n2 , n4 ) = V ; 130
(iii) S = {n1 } isn’t quasi-vertex set; 131
(iv) N1 (n1 ) = {n2 } =

6 V; 132
(v) S = {n3 } isn’t quasi-vertex set; 133
(vi) N1 (n3 ) = {n2 , n4 } =

6 V; 134
(vii) Quasi-order is two; 135
(viii) Neutrosophic number is 3 and corresponded set is {n2 , n4 }. 136
In an even path, if one vertex indexed odd is leaf, then other vertex indexed even is 137
another leaf. Thus odd indexes are as same as even indexes to form quasi-order. As 138
optimal set, mentioned sets are only cases which are related. Other sets have more 139
number of vertices. 140
Proposition 2.3. Let N T G : (V, E, σ, µ) be an even path. Then {x2 , x4 , · · · , xn } is 141
related to quasi-order n2 . 142
Proof. Suppose N T G : (V, E, σ, µ) be an even path. Thus N T G : (V, E, σ, µ) is 143
P : x1 , x2 , · · · , xn where n and 1 has different parity. There are two sets. 144
{x1 , x3 , · · · , xn−1 } has quasi-order b n2 c and {x2 , x4 , · · · , xn } has quasi-order b n2 c which 145
is minimum number like first set. So {x2 , x4 , · · · , xn } and {x1 , x3 , · · · , xn−1 } are 146
related to quasi-order b n2 c. {x2 , x4 , · · · , xn } and {x1 , x3 , · · · , xn−1 } are quasi-vertex 147
sets which are optimal. 148
6/21
In next part, one even-path-neutrosophic graph is applied to compute its quasi-order 149
and its corresponded set. 150
Example 2.4. In Figure (3), an even-path-neutrosophic graph is illustrated. Some 151
(i) S = {n1 , n3 , n5 } is quasi-vertex set; 153
(ii) N2 (n1 , n3 , n5 ) = V ; 154
(iii) S = {n1 } isn’t quasi-vertex set since N1 (n1 ) = {n2 } =

6 V; 155
(iv) N1 (ni ) 6= V ; 156
(vi) N1 (n3 ) = {n2 , n4 } =

6 V; 158
(viii) Neutrosophic number is 4.5 and corresponded set is {n2 , n4 , n6 }. 160
Indexes in odd cycles imply first index and last index have same parity. In this case, 161
vertices concerning odd indexes have more number of members than vertices concerning 162
even indexes but both sets introduce quasi-order. Optimal set is a set of vertices having 163
even indexes and this set points out a quasi-order which is minimum amid all 164
quasi-order. 165
Proposition 2.5. Let N T G : (V, E, σ, µ) be an odd cycle. Then {x2 , x4 , · · · , xn−1 } is 166
related to quasi-order b n2 c. 167
Proof. Suppose N T G : (V, E, σ, µ) be an odd cycle. Thus N T G : (V, E, σ, µ) is 168
P : x1 , x2 , · · · , xn , x1 where n and 1 has same parity. There are two sets. 169
{x1 , x3 , · · · , xn } has quasi-order b n2 c + 1 but {x2 , x4 , · · · , xn−1 } has quasi-order b n2 c 170
which is minimum number amid these two sets. So {x2 , x4 , · · · , xn−1 } is related to 171
quasi-order b n2 c. {x2 , x4 , · · · , xn−1 } is quasi-vertex set which is optimal. 172
The clarifications about results are in progress as follows. An odd-cycle-neutrosophic 173
graph is related to previous result and it’s studied to apply the definitions on it. 174
Example 2.6. In Figure (4), an odd-cycle-neutrosophic graph is illustrated. Some 175
7/21
(ii) N2 (n1 , n3 , n5 ) = V ; 178
(iii) S = {n1 } isn’t quasi-vertex set since N1 (n1 ) = {n2 , n5 } =

6 V; 179
(iv) N1 (ni ) 6= V ; 180
(vi) N1 (n3 ) = {n2 , n4 } =

6 V; 182
(viii) Neutrosophic number is 2.6 and corresponded set is {n2 , n4 }. 184
Even cycle has vertices which could be assigned by indexes. In this case, the first 185
vertex and last vertex has different parity. Thus a set of vertices containing even 186
indexes has as same number of members as set of vertices containing odd indexes has. 187
Thus these sets are optimal and they introduce optimal number titled quasi-order. 188
Proposition 2.7. Let N T G : (V, E, σ, µ) be an even cycle. Then {x2 , x4 , · · · , xn } and 189
{x1 , x3 , · · · , xn−1 } are related to quasi-order n2 . 190
Proof. Suppose N T G : (V, E, σ, µ) be an even cycle. Thus N T G : (V, E, σ, µ) is 191
P : x1 , x2 , · · · , xn , x1 where n and 1 has different parity. There are two sets. 192
{x1 , x3 , · · · , xn−1 } has quasi-order b n2 c and {x2 , x4 , · · · , xn } has quasi-order b n2 c which 193
is minimum number like first set. So {x2 , x4 , · · · , xn } and {x1 , x3 , · · · , xn−1 } are 194
related to quasi-order b n2 c. {x2 , x4 , · · · , xn } and {x1 , x3 , · · · , xn−1 } are quasi-vertex 195
sets which are optimal. 196
To make it more clear, next part gives one special case to apply definitions and 197
results on it. Some items are devised to make more sense about new notions. An 198
even-cycle-neutrosophic graph is related to previous result and it’s studied to apply the 199
definitions on it. 200
Example 2.8. In Figure (5), an even-cycle-neutrosophic graph is illustrated. Some 201
(ii) N2 (n1 , n3 , n5 ) = V ; 204
(iii) S = {n1 } isn’t quasi-vertex set since N1 (n1 ) = {n2 , n5 } =

6 V; 205
(iv) N1 (ni , nj ) 6= V ; 206
8/21
(vi) N1 (n3 ) = {n2 , n4 } =

6 V; 208
(vii) Quasi-order is three; 209
In a complete neutrosophic graph, one vertex has common edges with all given 211
vertices. Thus the number of neighbors for every given vertex is exactly the number of 212
vertices minus one. Hence, the set containing one vertex is optimal set to introduce 213
optimal number titled quasi-order. 214
Proposition 2.9. Let N T G : (V, E, σ, µ) be complete. Then {x} is related to 215
quasi-order 1. 216
Proof. Let N T G : (V, E, σ, µ) be complete. Suppose x is a given vertex. Thus
N [x] = min Nt [x1 , x2 , · · · , xt ] = V.

x1 ,x2 ,··· ,xt ∈V
It implies the set {x} which is 1-neighborhood, is quasi-vertex set. Then {x} is related 217
to quasi-order 1. 218
results on it. Some items are devised to make more sense about new notions. A 220
complete-neutrosophic graph is related to previous result and it’s studied to apply the 221
Example 2.10. In Figure (6), an complete-neutrosophic graph is illustrated. Some 223
(ii) N2 (n1 , n3 , n5 ) = V ; 226
(iii) S = {n1 } is quasi-vertex set since N1 (n1 ) = V ; 227
(iv) N1 (ni , nj ) = V ; 228
(v) S = {n3 } is quasi-vertex set; 229
(vi) N1 (n3 ) = V ; 230
(vii) Quasi-order is one; 231
9/21
(viii) Neutrosophic number is 0.9 and corresponded set is {n4 }. 232
A star, has a center which is connected to all other vertices. A center has common 233
edge with every given vertex. Thus the set containing a center is optimal set and it’s 234
quasi-vertex set in an optimal way. Quasi-order is obtained by this set and this number 235
is also optimal. 236
Proposition 2.11. Let N T G : (V, E, σ, µ) be star. Then {x} is related to quasi-order 237
1. 238
Proof. Let N T G : (V, E, σ, µ) be star. Suppose c is the center. Thus
N [c] = min Nt [x1 , x2 , · · · , xt ] = V.

x1 ,x2 ,··· ,xt ∈V
It implies the set {c} which is 1-neighborhood, is quasi-vertex set. Then {c} is related 239
star-neutrosophic graph is related to previous result and it’s studied to apply the 243
Example 2.12. In Figure (7), a star-neutrosophic graph is illustrated. Some points are 245
represented in follow-up items as follows. 246
(ii) N2 (n1 , n3 , n5 ) = V ; 248
(iv) i, j 6= 1, N1 (ni , nj ) 6= V ; 250
(vi) N1 (n3 ) = {n1 } =

6 V; 252
10/21
3 Neutrosophic Quasi-Size 255
In this section, the behaviors of some classes of neutrosophic graphs are studied where 256
the concepts of quasi-size and quasi-edge set are applied. Parity of number of vertex set 257
is considered when the classes are either paths or cycles. There an efforts to obtain 258
optimal set and optimal number in the terms of quasi-vertex set and quasi-order. Also, 259
the classes of path, cycle and complete are studied. 260
An odd path is a path with leaves with odd indexes. If first leaf is assigned to first 261
number, then next vertex has distance 2 and index 3 from previous vertex. Every three 262
vertex introduces one vertex to be in the set. Thus by every other vertices indexes is in 263
a set, the set with minimum numbers which cover all edges, is the set with vertices 264
which have very other vertex in comparison to previous vertex. 265
Proposition 3.1. Let N T G : (V, E, σ, µ) be an odd path. Then either {x1 , x3 , · · · , xn } 266
or {x1 , x3 , · · · , xn−1 } are related to quasi-size b n3 c. 267
Proof. Suppose N T G : (V, E, σ, µ) be an odd path. Thus N T G : (V, E, σ, µ) is 268
P : x1 , x2 , · · · , xn where n and 1 has same parity. There is two sets. Either 269
{x1 , x3 , · · · , xn } or {x1 , x3 , · · · , xn−1 } has quasi-size b n3 c which are minimum number 270
amid these all sets. So either {x1 , x3 , · · · , xn } or {x1 , x3 , · · · , xn−1 } is related to 271
quasi-sizeb n3 c. Either {x1 , x3 , · · · , xn } or {x1 , x3 , · · · , xn−1 } are quasi-vertex set which 272
are optimal. 273
odd-path-neutrosophic graph is related to previous result and it’s studied to apply the 276
definitions on it. In next part, one odd-path-neutrosophic graph us depicted. Quasi-size 277
and corresponded set is computed. 278
Example 3.2. In Figure (8), an odd-path-neutrosophic graph is illustrated. Some 279
(i) S = {n2 , n4 } is quasi-edge set; 281
(ii) N2 (n2 , n4 ) = E; 282
(iii) S = {n1 } isn’t quasi-edge set; 283
(iv) N1 (n1 ) = {n1 n2 } =

6 E; 284
(v) S = {n3 } isn’t quasi-edge set; 285
(vi) N1 (n3 ) = {n3 n2 , n3 n4 } =

6 E; 286
11/21
Figure 8. A Neutrosophic Graph in the Viewpoint of its Quasi-Size.
(viii) Neutrosophic number is 3 and corresponded set is {n2 , n4 }. 288
In an even path, if one vertex indexed odd is leaf, then other vertex indexed even is 289
another leaf. Thus odd indexes are as mixed as even indexes to form quasi-size since the 290
distance between two vertices has to be three as possible.In other words, if first vertex 291
has index one, then next index has to be three and so on. The set in that, all vertices 292
have distance three as possible are the matter of minds and et cetera. As optimal set, 293
mentioned sets are only cases which are related. Other sets have more number of 294
vertices. 295
Proposition 3.3. Let N T G : (V, E, σ, µ) be an even path. Then {x2 , x4 , · · · , xn } is 296
related to quasi-size b n3 c. 297
Proof. Suppose N T G : (V, E, σ, µ) be an even path. Thus N T G : (V, E, σ, µ) is 298
P : x1 , x2 , · · · , xn where n and 1 has different parity. There are two sets. Either 299
{x1 , x3 , · · · , xn } or {x1 , x3 , · · · , xn−1 }. {x1 , x3 , · · · , xn } has quasi-size b n3 c and 300
{x1 , x3 , · · · , xn−1 } has quasi-size b n3 c which is minimum number like first set. So either 301
{x1 , x3 , · · · , xn } or {x1 , x3 , · · · , xn−1 } is related to quasi-size b n3 c. Either 302
{x1 , x3 , · · · , xn } or {x1 , x3 , · · · , xn−1 } is quasi-vertex set which is optimal. 303
even-path-neutrosophic graph is related to previous result and it’s studied to apply the 306
definitions on it. In next part, one even-path-neutrosophic graph is applied to compute 307
its quasi-size and its corresponded set. 308
Example 3.4. In Figure (9), an even-path-neutrosophic graph is illustrated. Some 309
(i) S = {n1 , n3 , n5 } is quasi-edge set; 311
(ii) N2 (n1 , n3 , n5 ) = E; 312
(iii) S = {n1 } isn’t quasi-edge set since N1 (n1 ) = {n1 n2 } =

6 E; 313
(iv) N1 (ni ) 6= E; 314
(vi) N1 (n3 ) = {n3 n2 , n3 n4 } =

6 E; 316
12/21
(vii) Quasi-size is two; 317
Indexes in odd cycles imply first index and last index have same parity. In this case, 319
vertices concerning odd indexes have more number of members than vertices concerning 320
even indexes but both sets don’t introduce quasi-size. Optimal set is a set of vertices 321
having indexes which are differed by two numbers. In other words, if first index is one, 322
then next index has to be three. And this set points out a quasi-size which is minimum 323
amid all quasi-sizes. 324
Proposition 3.5. Let N T G : (V, E, σ, µ) be an odd cycle. Then {x1 , x4 , · · · , xn−3 } is 325
Proof. Suppose N T G : (V, E, σ, µ) be an odd cycle. Thus N T G : (V, E, σ, µ) is 327
P : x1 , x2 , · · · , xn , x1 where n and 1 has same parity. There are two sets. 328
{x1 , x3 , · · · , xn } has quasi-size b n3 c and {x1 , x3 , · · · , xn−1 } has quasi-size b n3 c which are 329
minimum numbers amid all sets. So either {x1 , x3 , · · · , xn−1 } or {x1 , x3 , · · · , xn } is 330
related to quasi-size b n3 c. Either {x1 , x3 , · · · , xn−1 } or {x1 , x3 , · · · , xn } is quasi-edge set 331
which is optimal. 332
odd-cycle-neutrosophic graph is related to previous result and it’s studied to apply the 335
definitions on it. In next part, one odd-cycle-neutrosophic graph is applied to compute 336
its quasi-size and its corresponded set. The clarifications about results are in progress as 337
follows. An odd-cycle-neutrosophic graph is related to previous result and it’s studied to 338
apply the definitions on it. 339
Example 3.6. In Figure (10), an odd-cycle-neutrosophic graph is illustrated. Some 340
(ii) N2 (n1 , n3 , n5 ) = E; 343
(iii) S = {n1 } isn’t quasi-edge set since N1 (n1 ) = {n1 n2 , n1 n5 } =

6 E; 344
(iv) N1 (ni ) 6= E; 345
(vi) N1 (n3 ) = {n3 n2 , n3 n4 } =

6 E; 347
13/21
Even cycle has vertices which could be assigned by indexes. In this case, the first 350
vertex and last vertex has different parity. Thus a set of vertices containing even 351
indexes has as same number of members as set of vertices containing odd indexes has 352
but they aren’t optimal. Thus these sets aren’t optimal and they don’t introduce 353
optimal number titled quasi-size. The set containing vertices with indexes which are 354
differed by three, i.e. distance amid two indexes are three which imply if an index is 355
one, then next index is three, is a set which is quasi-edge set which is optimal and also, 356
it introduces quasi-size which is also optimal. 357
Proposition 3.7. Let N T G : (V, E, σ, µ) be an even cycle. Then {x1 , x4 , · · · , xn−3 } is 358
Proof. Suppose N T G : (V, E, σ, µ) be an even cycle. Thus N T G : (V, E, σ, µ) is 360
P : x1 , x2 , · · · , xn , x1 where n and 1 has different parity. There are two sets. 361
{x1 , x3 , · · · , xn−1 } has quasi-size b n3 c and {x1 , x3 , · · · , xn−1 } has quasi-size b n3 c which 362
is minimum number like first set. So either {x1 , x3 , · · · , xn } or {x1 , x3 , · · · , xn−1 } are 363
related to quasi-size b n3 c which this number is optimal. Either {x1 , x3 , · · · , xn } or 364
{x1 , x3 , · · · , xn−1 } is quasi-edge set which are optimal. 365
even-cycle-neutrosophic graph is related to previous result and it’s studied to apply the 368
definitions on it. In next part, one even-cycle-neutrosophic graph is applied to compute 369
follows. An even-cycle-neutrosophic graph is related to previous result and it’s studied 371
to apply the definitions on it. 372
Example 3.8. In Figure (11), an even-cycle-neutrosophic graph is illustrated. Some 373
(i) S = {n1 , n4 } is quasi-edge set; 375
(ii) N2 (n1 , n4 ) = E; 376
(iii) S = {n2 , n5 } is quasi-edge set; 377
(iv) N1 (n2 , n5 ) = E; 378
14/21
(vi) N1 (n3 ) = {n3 n2 , n3 n4 } =

6 E; 380
In a complete neutrosophic graph, one vertex has common edges with all given 383
vertices. Thus the number of co-neighbors for every given vertex is exactly the number 384
of vertices minus one. Hence, the set containing all vertices excluding one vertex is 385
optimal set to introduce optimal number titled quasi-size. It’s quasi-edge set as optimal 386
set. 387
Proposition 3.9. Let N T G : (V, E, σ, µ) be complete. Then {x1 , x2 , · · · , xn−1 } is 388
related to quasi-size n − 1. 389
Proof. Let N T G : (V, E, σ, µ) be complete. Suppose x is a given vertex. Thus
N [x1 , x2 , · · · , xn−1 ] = min Nt [x1 , x2 , · · · , xn−1 ] = E.

x1 ,x2 ,··· ,xn−1 ∈V
It implies the set {x1 , x2 , · · · , xn−1 } which is co-(n − 1)-neighborhood, is only 390
quasi-vertex set as optimal set. Then {x1 , x2 , · · · , xn−1 } is related to quasi-size 391
n − 1. 392
complete-neutrosophic graph is related to previous result and it’s studied to apply the 395
definitions on it. In next part, one complete-neutrosophic graph is applied to compute 396
follows. A complete-neutrosophic graph is related to previous result and it’s studied to 398
apply the definitions on it. 399
Example 3.10. In Figure (12), an complete-neutrosophic graph is illustrated. Some 400
(ii) N2 (n1 , n3 , n4 ) = E; 403
(iii) S = {n1 } isn’t quasi-edge set since N1 (n1 ) = {n1 ni }4i=2 6= E; 404
(iv) N1 (ni , nj ) 6= E; 405
15/21
(vi) N1 (n3 ) = {n3 ni }4i=1,i6=3 6= E; 407
A star, has a center which is connected to all other vertices. A center has common 410
edge with every given vertex. A center has all possible edges. Thus the set containing a 411
center is optimal set and it’s quasi-edge set in an optimal way. Quasi-size is obtained by 412
this set and this number is also optimal. 413
Proposition 3.11. Let N T G : (V, E, σ, µ) be star. Then {x} is related to quasi-size 1. 414
Proof. Let N T G : (V, E, σ, µ) be star. Suppose c is the center. Thus
N [c] = min Nt [x1 , x2 , · · · , xt ] = E.

x1 ,x2 ,··· ,xt ∈V
It implies the set {c} which is 1-neighborhood, is quasi-vertex set. Then {c} is related 415
star-neutrosophic graph is related to previous result and it’s studied to apply the 419
definitions on it. In next part, one star-neutrosophic graph is applied to compute its 420
quasi-size and its corresponded set. The clarifications about results are in progress as 421
follows. A star-neutrosophic graph is related to previous result and it’s studied to apply 422
the definitions on it. 423
Example 3.12. In Figure (13), a star-neutrosophic graph is illustrated. Some points 424
are represented in follow-up items as follows. 425
(ii) N2 (n1 , n3 , n5 ) = E; 427
(iii) S = {n1 } is quasi-edge set since N1 (n1 ) = E; 428
(iv) N1 (n4 , n5 ) 6= E; 429
(vi) N1 (n3 ) = {n1 n3 } =

6 E; 431
(vii) Quasi-size is one; 432
16/21
4 Applications in Time Table and Scheduling 434
In this section, two applications for time table and scheduling are provided where the 435
models are complete models which mean complete connections are formed as individual 436
and family of complete models with common neutrosophic vertex set. 437
Designing the programs to achieve some goals is general approach to apply on some 438
issues to function properly. Separation has key role in the context of this style. 439
Separating the duration of work which are consecutive, is the matter and it has 440
importance to avoid mixing up. 441
Step 1. (Definition) Time table is an approach to get some attributes to do the 442
work fast and proper. The style of scheduling implies special attention to the 443
tasks which are consecutive. 444
Step 2. (Issue) Scheduling of program has faced with difficulties to differ amid 445
consecutive section. Beyond that, sometimes sections are not the same. 446
Step 3. (Model) The situation is designed as a model. The model uses data to assign 447
every section and to assign to relation amid section, three numbers belong unit 448
interval to state indeterminacy, possibilities and determinacy. There’s one 449
restriction in that, the numbers amid two sections are at least the number of the 450
relation amid them. Table (1), clarifies about the assigned numbers to these 451
situation.
Table 1. Scheduling concerns its Subjects and its Connections as a neutrosophic graph
and its alliances in a Model.
Sections of N T G n1 n2 · · · n4
Values (0.6, 0.8, 0.2) (0.3, 0.9, 0.8)· · · (0.6, 0.2, 0.1)
Connections of N T G E1 E2 · · · E3
Values (0.3, 0.8, 0.2) (0.6, 0.3, 0.2)· · · (0.6, 0.2, 0.1)
452
4.1 Case 1: Complete Model And Its Quasi-Order 453
Step 4. (Solution) The neutrosophic graph and its quasi-order alliance as model, 454
propose to use specific set. Every subject has connection with every given subject. 455
Thus the connection is applied as possible and the model demonstrates full 456
connections as possible. Using the notion of strong on the connection amid 457
subjects, causes the importance of subject goes in the highest level such that the 458
17/21
value amid two consecutive subjects, is determined by those subjects. If the 459
configuration is complete, the set is different. Also, it holds for other types such 460
that star, wheel, path, and cycle. The collection of situations is another 461
application of quasi-order when the notion of family is applied in the way that all 462
members of family are from same classes of neutrosophic graphs. As follows, There 463
are four subjects which are represented as Figure (14). This model is strong. And 464
the study proposes using specific set of objects which is called quasi-order. There 465
are also some analyses on other sets in the way that, the clarification is gained 466
about being special set or not. Also, in the last part, there are two numbers to 467
assign to this model and situation to compare them with same situations to get 468
more precise. Consider Figure (14). In Figure (14), an complete-neutrosophic 469
graph is illustrated. Some points are represented in follow-up items as follows. 470
(ii) N2 (n1 , n3 , n5 ) = V ; 472
(iv) N1 (ni , nj ) = V ; 474
(v) S = {n3 } is quasi-vertex set; 475
(vi) N1 (n3 ) = V ; 476
4.2 Case 2: Complete Model And Its Quasi-Size 479
Step 4. (Solution) The neutrosophic graph and its quasi-size as model, propose to 480
use specific set. Every subject has connection with every given subject. Thus the 481
connection is applied as possible and the model demonstrates full connections as 482
possible. Using the notion of strong on the connection amid subjects, causes the 483
importance of subject goes in the highest level such that the value amid two 484
consecutive subjects, is determined by those subjects. If the configuration is 485
complete, the set is different. Also, it holds for other types such that star, wheel, 486
path, and cycle. The collection of situations is another application of quasi-size 487
when the notion of family is applied in the way that all members of family are 488
from same classes of neutrosophic graphs. As follows, There are four subjects 489
which are represented in the formation of one model as Figure (15). This model is 490
neutrosophic strong as individual. And the study proposes using specific set of 491
objects which is called quasi-size for this model. There are also some analyses on 492
other sets in the way that, the clarification is gained about being special set or 493
18/21
not. Also, in the last part, there are two numbers to assign to this model as 494
individual. A model as a collection of situations to compare them with another 495
model as a collection of situations to get more precise. Consider Figure (15). In 496
Figure (15), an complete-neutrosophic graph is illustrated. Some points are 497
represented in follow-up items as follows. 498
(ii) N2 (n1 , n3 , n4 ) = E; 500
(iii) S = {n1 } isn’t quasi-edge set since N1 (n1 ) = {n1 ni }4i=2 6= E; 501
(iv) N1 (ni , nj ) 6= E; 502
(vi) N1 (n3 ) = {n3 ni }4i=1,i6=3 6= E; 504
5 Open Problems 507
In this section, some questions and problems are proposed to give some avenues to 508
pursue this study. The structures of the definitions and results give some ideas to make 509
new settings which are eligible to extend and to create new study. 510
Notion concerning quasi-order and quasi-size are defined in neutrosophic graphs. 511
Neutrosophic number is also reused. Thus, 512
Question 5.1. Is it possible to use other types neighborhood and co-neighborhood 513
arising from different types of edges to define new quasi-order and quasi-size? 514
Question 5.2. Are existed some connections amid different types of quasi-order and 515
quasi-size in neutrosophic graphs? 516
Question 5.3. Is it possible to construct some classes of which have “nice” behavior? 517
Question 5.4. Which mathematical notions do make an independent study to apply 518
these types in neutrosophic graphs? 519
Problem 5.5. Which parameters are related to this parameter? 520
Problem 5.6. Which approaches do work to construct applications to create 521
independent study? 522
Problem 5.7. Which approaches do work to construct definitions which use all 523
definitions and the relations amid them instead of separate definitions to create 524
independent study? 525
19/21
6 Conclusion and Closing Remarks 526
In this section, concluding remarks and closing remarks are represented. The drawbacks 527
of this article are illustrated. Some benefits and advantages of this study are highlighted. 528
This study uses two definition concerning quasi-order and quasi-size arising 529
neighborhood and co-neighborhood to study neutrosophic graphs. New neutrosophic 530
number is reused which is too close to the notion of neutrosophic number but it’s 531
different since it uses all values as type-summation on them. The connections of vertices 532
which are clarified by general edges differ them from each other and put them in 533
different categories to represent a set which is called either quasi-order or quasi-size.
Table 2. A Brief Overview about Advantages and Limitations of this study

Advantages Limitations
1. Defining Quasi-Order 1. General Results
2. Defining Quasi-Size
3. Study on Complete Models 2. Study on Families
4. Defining t-Neighborhood
5. Defining co-t-Neighborhood 3. Same Models in Family

534
Further studies could be about changes in the settings to compare this notion amid 535
different settings of neutrosophic graphs theory. One way is finding some relations amid 536
all definitions of notions to make sensible definitions. In Table (2), some limitations and 537
advantages of this study are pointed out. 538
References 539
1. M. Akram, and G. Shahzadi, “Operations on Single-Valued Neutrosophic 540
Graphs”, Journal of uncertain systems 11 (1) (2017) 1-26. 541
2. K. Atanassov, “Intuitionistic fuzzy sets”, Fuzzy Sets Syst. 20 (1986) 87-96. 542
3. S. Broumi, M. Talea, A. Bakali and F. Smarandache, “Single-valued 543
neutrosophic graphs”, Journal of New Theory 10 (2016) 86-101. 544
4. N. Shah, and A. Hussain, “Neutrosophic soft graphs”, Neutrosophic Set and 545
Systems 11 (2016) 31-44. 546
5. Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number ”, 547
Preprints 2021, 2021120177 (doi: 10.20944/preprints202112.0177.v1). 548
6. Henry Garrett, “Closing Numbers and Super-Closing Numbers as 549
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 550
(Neutrosophic)n-SuperHyperGraph”, Preprints 2022, 2022010145 (doi: 551
10.20944/preprints202201.0145.v1). 552
7. Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, 553
8. Henry Garrett, “Different Types of Neutrosophic Chromatic Number ”, Preprints 555
2021, 2021120335 (doi: 10.20944/preprints202112.0335.v1). 556
20/21
9. Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic 557
Hypergraphs”, Preprints 2021, 2021120448 (doi: 558
10.20944/preprints202112.0448.v1). 559
10. Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12 ”, 560
ResearchGate 2021 (doi: 10.13140/RG.2.2.20690.48322). 561
11. Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness 562
and (Strong) Edges”, Preprints 2022, 2022010239 (doi: 563
10.20944/preprints202201.0239.v1). 564
12. Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, 565
13. A. Shannon and K.T. Atanassov, “A first step to a theory of the intuitionistic 567
fuzzy graphs”, Proceeding of FUBEST (Lakov, D., Ed.) Sofia (1994) 59-61. 568
14. F. Smarandache, “A Unifying field in logics neutrosophy: Neutrosophic 569
probability, set and logic, Rehoboth: ” American Research Press (1998). 570
15. H. Wang, F. Smarandache, Y. Zhang, and R. Sunderraman, “Single-valued 571
neutrosophic sets”, Multispace and Multistructure 4 (2010) 410-413. 572
16. L. A. Zadeh, “Fuzzy sets”, Information and Control 8 (1965) 338-353. 573
21/21
View publication stats

0044 - Co-Neighborhood in Neutrosophic Graphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

0044 - Co-Neighborhood in Neutrosophic Graphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Co-Neighborhood in Neutrosophic Graphs

Preprint · February 2022

On Combinatorics View project

Number Graphs And Numbers View project

The user has requested enhancement of the downloaded file.

Twitter’s ID: @DrHenryGarrett | DrHenryGarrett.wordpress.com

Keywords: Co-Neighborhood, Quasi-Order, Quasi-Size

neutrosophic graphs in Ref. [4], are proposed. 6

In this section, I use two subsections to illustrate a perspective about the 7

background of this study. 8

1.1 Motivation and Contributions 9

In this study, there’s an idea which could be considered as a motivation. 10

Question 1.1. Is it possible to use mixed versions of ideas concerning 11

“t-Neighborhood”, “co-t-Neighborhood” and “Complete Neutrosophic Graph” to define 12

some notions which are applied to neutrosophic graphs? 13

It’s motivation to find notions to use in any classes of neutrosophic graphs. 14

assign neutrosophic neighborhood, neutrosophic t-neighborhood, neutrosophic 17

co-neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-order, 18

neutrosophic number, neutrosophic quasi-size, co-neutrosophic number, neutrosophic 19

types of numbers and set, e.g., neutrosophic quasi-order, neutrosophic number, 23

individuals. Also, there are some avenues to extend these notions. 25

definitions to clarify about preliminaries. In subsection “Preliminaries”, new notions of 27

neutrosophic neighborhood, neutrosophic t-neighborhood, neutrosophic 28

co-neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-order, 29

neutrosophic number, neutrosophic quasi-size, co-neutrosophic number, neutrosophic 30

terms of neutrosophic quasi-order, in section “Neutrosophic Quasi-Order,” as 35

individuals. In section “Neutrosophic Quasi-Size,”, both numbers have applied into 36

clarfications about odd-path-neutrosophic graphs, even-path-neutrosophic graphs, 38

odd-cycle-neutrosophic graphs, even-cycle-neutrosophic graphs, complete-neutrosophic 39

sections “Neutrosophic Quasi-Order,” and “Neutrosophic Quasi-Size,” for introduced 41

Remarks”, gentle discussion about results and applications is featured. In section 47

“Conclusion and Closing Remarks”, a brief overview concerning advantages and 48

limitations of this study alongside conclusions is formed. 49

ideas and their clarifications are elicited. 52

Definition 1.2. (Graph). 54

G = (V, E) is called a graph if V is a set of objects and E is a subset of V × V (E 55

Every two vertices have been corresponded to at most one edge. 57

Neutrosophic graph is the foundation of results in this paper which is defined as 58

follows. Also, some related notions are demonstrated. 59

Definition 1.3. (Neutrosophic Graph And Its Special Case). 60

N T G = (V, E, σ = (σ1 , σ2 , σ3 ), µ = (µ1 , µ2 , µ3 )) is called a neutrosophic graph if

(i) : σ is called neutrosophic vertex set. 61

(ii) : µ is called neutrosophic edge set. 62

(iii) : |V | is called order of NTG and it’s denoted by O(N T G). 63

Some classes of well-known neutrosophic graphs are defined. These classes of 68

Definition 1.4. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then 70

(i) : a sequence of vertices P : x0 , x1 , · · · , xn is called path where 71

(iii) : connectedness amid vertices x0 and xn is

(iv) : a sequence of vertices P : x0 , x1 , · · · , xn is called cycle where 74

µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 ); 76

(v) : it’s t-partite where V is partitioned to t parts, V1 , V2 , · · · , Vt and the edge xy 77

implies x ∈ Vi and y ∈ Vj where i 6= j. If it’s complete, then it’s denoted by 78

(vi) : t-partite is complete bipartite if t = 2, and it’s denoted by Kσ1 ,σ2 ; 80

(vii) : complete bipartite is star if |V1 | = 1, and it’s denoted by S1,σ2 ; 81

wheel and it’s denoted by W1,σ2 ; 83

(ix) : it’s complete where ∀uv ∈ V, µ(uv) = σ(u) ∧ σ(v); 84

(x) : it’s strong where ∀uv ∈ E, µ(uv) = σ(u) ∧ σ(v). 85

as possible. Based on strong edge, it’s possible to define different neighborhood as 88

Definition 1.5. (Neighborhood). 90

Let N T G : (V, E, σ, µ) be a neutrosophic graph. Suppose x ∈ V. Then

Definition 1.6. (Co-Neighborhood). 91

Let N T G : (V, E, σ, µ) be a neutrosophic graph and t ∈ N. Suppose 92