Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/359623057
Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs
Preprint · March 2022

DOI: 10.13140/RG.2.2.29071.87200
CITATIONS
0
1 author:
Henry Garrett
122 PUBLICATIONS 126 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Neutrosophic Graphs View project
On Combinatorics View project
All content following this page was uploaded by Henry Garrett on 31 March 2022.
The user has requested enhancement of the downloaded file.

Finding Hamiltonian Neutrosophic Cycles in Classes of
Neutrosophic Graphs
Henry Garrett
Independent Researcher
DrHenryGarrett@gmail.com
Twitter’s ID: @DrHenryGarrett | DrHenryGarrett.wordpress.com

c
Abstract
New setting is introduced to study hamiltonian neutrosophic cycle and n-hamiltonian
neutrosophic cycle arising from finding and counting longest neutrosophic cycles
containing all vertices once in strong neutrosophic graphs based on neutrosophic cycles
and in neutrosophic graphs based on crisp cycles. Forming neutrosophic cycles from a
sequence of consecutive vertices is key type of approach to have these notions namely
hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle arising from
finding and counting longest neutrosophic cycles containing all vertices once in strong
neutrosophic graphs based on neutrosophic cycles and in neutrosophic graphs based on
crisp cycles. One number and one sequence are obtained but now both settings leads to
approach is on demand which is counting minimum cardinality and a sequence in the
terms of vertices, which have edges which form neutrosophic cycle and crisp cycles
concerning finding and counting longest neutrosophic cycles containing all vertices once.
Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then hamiltonian neutrosophic cycle
M(N T G) for a neutrosophic graph N T G : (V, E, σ, µ) is a sequence of consecutive
vertices x1 , x2 , · · · , xO(N T G) , x1 which is neutrosophic cycle; n-hamiltonian neutrosophic
cycle N (HN C) for a neutrosophic graph N T G : (V, E, σ, µ) is the number of sequences
of consecutive vertices x1 , x2 , · · · , xO(N T G) , x1 which are neutrosophic cycles. As
concluding results, there are some statements, remarks, examples and clarifications
about some classes of strong neutrosophic graphs namely (strong-)path-neutrosophic
graphs, (strong-)cycle-neutrosophic graphs, complete-neutrosophic graphs,
(strong-)star-neutrosophic graphs, (strong-)complete-bipartite-neutrosophic graphs,
(strong-)complete-t-partite-neutrosophic graphs and (strong-)wheel-neutrosophic graphs.
The clarifications are also presented in both sections “Setting of hamiltonian
neutrosophic cycle,” and “Setting of n-hamiltonian neutrosophic cycle,” for introduced
results and used classes. 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 to compare with other vertices.
Summation of three values of vertex makes one number and applying it to a comparison.
This approach facilitates identifying vertices which form hamiltonian neutrosophic cycle
and n-hamiltonian neutrosophic cycle arising from finding and counting longest
neutrosophic cycles containing all vertices once in strong neutrosophic graphs based on
neutrosophic cycles and in neutrosophic graphs based on crisp cycles. In both settings,
some classes of well-known (strong) neutrosophic graphs are studied. Some clarifications
for each result and each definition are provided. The cardinality of a set has eligibility
1/47
to define n-hamiltonian neutrosophic cycle but the sequence has eligibility to define
hamiltonian neutrosophic cycle. Some results get more frameworks and perspective
about these definitions. The way in that, a sequence of consecutive vertices forming a
longest neutrosophic cycles containing all vertices once, opens the way to do some
approaches. These notions are applied into strong neutrosophic graphs and
neutrosophic graphs as individuals but not family of them as drawbacks for these
notions. Finding special strong neutrosophic graphs and neutrosophic graphs which are
well-known, is an open way to pursue 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: Hamiltonian Neutrosophic Cycles, n-Hamiltonian Neutrosophic Cycles,

Classes of Neutrosophic Graphs
AMS Subject Classification: 05C17, 05C22, 05E45
1 Background 1
Chromatic number and neutrosophic chromatic number in Ref. [2], closing numbers 2
and super-closing numbers as (dual)resolving and (dual)coloring alongside 3
(dual)dominating in (neutrosophic)n-SuperHyperGraph in Ref. [3], co-degree and 4
degree of classes of neutrosophic hypergraphs in Ref. [4], different types of neutrosophic 5
chromatic number in Ref. [5], dimension and coloring alongside domination in 6
neutrosophic hypergraphs in Ref. [6], e-matching number and e-matching polynomials 7
in neutrosophic graphs in Ref. [7], independent set in neutrosophic graphs in Ref. [8], 8
some polynomials related to numbers in classes of (strong) neutrosophic graphs in 9
Ref. [9], three types of neutrosophic alliances based on connectedness and (strong) 10
edges in Ref. [10], neutrosophic chromatic number based on connectedness in Ref. [11], 11
are studied. Also, some studies and researches about neutrosophic graphs, are proposed 12
as a book in Ref. [1]. 13
In this section, I use two subsections to illustrate a perspective about the 14
background of this study. 15
1.1 Motivation and Contributions 16
In this study, there’s an idea which could be considered as a motivation. 17
Question 1.1. Is it possible to use mixed versions of ideas concerning “n-hamiltonian 18
neutrosophic cycle”, “hamiltonian neutrosophic cycle” and “(Strong) Neutrosophic 19
Graph” to define some notions which are applied to neutrosophic graphs? 20
It’s motivation to find notions to use in any classes of (strong) neutrosophic graphs. 21
Real-world applications about time table and scheduling are another thoughts which 22
lead to be considered as motivation. Lack of connection amid two edges have key roles 23
to assign hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle arising 24
from finding and counting longest neutrosophic cycles containing all vertices once in 25
strong neutrosophic graphs based on neutrosophic cycles and in neutrosophic graphs 26
based on crisp cycles. Thus they’re used to define new ideas which conclude to the 27
structure of hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle 28
arising from finding and counting longest neutrosophic cycles containing all vertices 29
once in strong neutrosophic graphs based on neutrosophic cycles and in neutrosophic 30
graphs based on crisp cycles. The concept of having common number of neutrosophic 31
cycle inspires us to study the behavior of vertices in the way that, some types of 32
numbers, hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle arising 33
2/47
based on crisp cycles are the cases of study in the setting of individuals. In both 36
settings, a corresponded number concludes the discussion. Also, there are some avenues 37
to extend these notions. 38
The framework of this study is as follows. In the beginning, I introduce basic 39
definitions to clarify about preliminaries. In subsection “Preliminaries”, new notions of 40
hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle arising from 41
finding and counting longest neutrosophic cycles containing all vertices once in strong 42
neutrosophic graphs based on neutrosophic cycles and in neutrosophic graphs based on 43
crisp cycles, are highlighted, are introduced and are clarified as individuals. In section 44
“Preliminaries”, sequence of consecutive vertices forming neutrosophic cycles and crisp 45
cycles have the key role in this way. General results are obtained and also, the results 46
about the basic notions of hamiltonian neutrosophic cycle and n-hamiltonian 47
neutrosophic cycle arising from finding and counting longest neutrosophic cycles 48
containing all vertices once in strong neutrosophic graphs based on neutrosophic cycles 49
and in neutrosophic graphs based on crisp cycles, are elicited. Some classes of (strong) 50
neutrosophic graphs are studied in the terms of hamiltonian neutrosophic cycle arising 51
based on crisp cycles, in section “Setting of hamiltonian neutrosophic cycle,” as 54
individuals. In section “Setting of hamiltonian neutrosophic cycle,” hamiltonian 55
neutrosophic cycle is applied into individuals. As concluding results, there are some 56
statements, remarks, examples and clarifications about some classes of (strong) 57
neutrosophic graphs namely strong-path-neutrosophic graphs, 58
(strong-)cycle-neutrosophic graphs, complete-neutrosophic graphs, 59
(strong-)star-neutrosophic graphs, (strong-)complete-bipartite-neutrosophic graphs, 60
(strong-)complete-t-partite-neutrosophic graphs and (strong-)wheel-neutrosophic graphs. 61
The clarifications are also presented in both sections “Setting of hamiltonian 62
neutrosophic cycle,” and “Setting of n-hamiltonian neutrosophic cycle,” for introduced 63
results and used classes. In section “Applications in Time Table and Scheduling”, two 64
applications are posed for quasi-complete and complete notions, namely 65
complete-neutrosophic graphs and (strong-)complete-t-neutrosophic graphs concerning 66
time table and scheduling when the suspicions are about choosing some subjects and 67
the mentioned models are considered as individual. In section “Open Problems”, some 68
problems and questions for further studies are proposed. In section “Conclusion and 69
Closing Remarks”, gentle discussion about results and applications is featured. In 70
section “Conclusion and Closing Remarks”, a brief overview concerning advantages and 71
limitations of this study alongside conclusions is formed. 72
1.2 Preliminaries 73
In this subsection, basic material which is used in this article, is presented. Also, new 74
ideas and their clarifications are elicited. 75
Basic idea is about the model which is used. First definition introduces basic model. 76
Definition 1.2. (Graph). 77
G = (V, E) is called a graph if V is a set of objects and E is a subset of V × V (E 78
is a set of 2-subsets of V ) where V is called vertex set and E is called edge set. 79
Every two vertices have been corresponded to at most one edge. 80
Neutrosophic graph is the foundation of results in this paper which is defined as 81
follows. Also, some related notions are demonstrated. 82
3/47
Definition 1.3. (Neutrosophic Graph And Its Special Case). 83
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. 84
(ii) : µ is called neutrosophic edge set. 85
(iii) : |V | is called order of NTG and it’s denoted by O(N T G). 86
P
(iv) : v∈V σ(v) is called neutrosophic order of NTG and it’s denoted by On (N T G). 87
(v) : |E| is called size of NTG and it’s denoted by S(N T G). 88
P P3
(vi) : e∈E i=1 µi (e) is called neutrosophic size of NTG and it’s denoted by 89
Sn (N T G). 90
Some classes of well-known neutrosophic graphs are defined. These classes of 91
neutrosophic graphs are used to form this study and the most results are about them. 92
Definition 1.4. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then 93
(i) : a sequence of vertices P : x0 , x1 , · · · , xO is called path where 94
xi xi+1 ∈ E, i = 0, 1, · · · , n − 1; 95
V
(ii) : strength of path P : x0 , x1 , · · · , xO is i=0,··· ,n−1 µ(xi xi+1 ); 96
(iii) : connectedness amid vertices x0 and xt is

_ ^
µ∞ (x0 , xt ) = µ(xi xi+1 );
P :x0 ,x1 ,··· ,xt i=0,··· ,t−1
(iv) : a sequence of vertices P : x0 , x1 , · · · , xO is called cycle where 97
xi xi+1 ∈ E, i = 0,V1, · · · , n − 1 and there are two edges xy and uv such that 98
µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 ); 99
(v) : it’s t-partite where V is partitioned to t parts, V1s1 , V2s2 , · · · , Vtst and the edge 100
s
xy implies x ∈ Visi and y ∈ Vj j where i = 6 j. If it’s complete, then it’s denoted by 101
Kσ1 ,σ2 ,··· ,σt where σi is σ on Visi instead V which mean x 6∈ Vi induces σi (x) = 0. 102
Also, |Vjsi | = si ; 103
(vi) : t-partite is complete bipartite if t = 2, and it’s denoted by Kσ1 ,σ2 ; 104
(vii) : complete bipartite is star if |V1 | = 1, and it’s denoted by S1,σ2 ; 105
(viii) : a vertex in V is center if the vertex joins to all vertices of a cycle. Then it’s 106
wheel and it’s denoted by W1,σ2 ; 107
(ix) : it’s complete where ∀uv ∈ V, µ(uv) = σ(u) ∧ σ(v); 108
(x) : it’s strong where ∀uv ∈ E, µ(uv) = σ(u) ∧ σ(v). 109
To make them concrete, I bring preliminaries of this article in two upcoming 110
definitions in other ways. 111
4/47
Definition 1.5. (Neutrosophic Graph And Its Special Case). 112
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 ).
|V | is called order of NTG and it’s denoted by O(N T G). Σv∈V σ(v) is called 113
neutrosophic order of NTG and it’s denoted by On (N T G). 114
Definition 1.6. Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then it’s complete 115
and denoted by CM T σ if ∀x, y ∈ V,xy ∈ E and µ(xy) = σ(x) ∧ σ(y); a sequence of 116
vertices P : x0 , x1 , · · · , xO(N T G) is called path and it’s denoted by P T H n where 117
xi xi+1 ∈ E, i = 0, 1, · · · , n − 1; a sequence of vertices P : x0 , x1 , · · · , xO(N T G) is called 118
cycle and denoted by CY C n where xi xi+1 ∈VE, i = 0, 1, · · · , n − 1 and there are two 119
edges xy and uv such that µ(xy) = µ(uv) = i=0,1,··· ,n−1 µ(vi vi+1 ); it’s t-partite 120
where V is partitioned to t parts, V1s1 , V2s2 , · · · , Vtst and the edge xy implies x ∈ Visi 121
s
and y ∈ Vj j where i 6= j. If it’s complete, then it’s denoted by CM T σ1 ,σ2 ,··· ,σt where 122
σi is σ on Visi instead V which mean x 6∈ Vi induces σi (x) = 0. Also, |Vjsi | = si ; 123
t-partite is complete bipartite if t = 2, and it’s denoted by CM T σ1 ,σ2 ; complete 124
bipartite is star if |V1 | = 1, and it’s denoted by ST R1,σ2 ; a vertex in V is center if the 125
vertex joins to all vertices of a cycle. Then it’s wheel and it’s denoted by W HL1,σ2 . 126
Remark 1.7. Using notations which is mixed with literatures, are reviewed. 127
1. N T G = (V, E, σ = (σ1 , σ2 , σ3 ), µ = (µ1 , µ2 , µ3 )), O(N T G), and On (N T G); 128
2. CM T σ , P T H n , CY C n , ST R1,σ2 , CM T σ1 ,σ2 , CM T σ1 ,σ2 ,··· ,σt , and W HL1,σ2 . 129
Definition 1.8. (Hamiltonian Neutrosophic Cycle). 130
Let N T G : (V, E, σ, µ) be a neutrosophic graph. Then 131
(i) hamiltonian neutrosophic cycle M(N T G) for a neutrosophic graph 132
N T G : (V, E, σ, µ) is a sequence of consecutive vertices x1 , x2 , · · · , xO(N T G) , x1 133
which is neutrosophic cycle; 134
(ii) n-hamiltonian neutrosophic cycle N (HN C) for a neutrosophic graph 135
N T G : (V, E, σ, µ) is the number of sequences of consecutive vertices 136
x1 , x2 , · · · , xO(N T G) , x1 which are neutrosophic cycles. 137
If we use the notion of neutrosophic cardinality in strong type of neutrosophic 138
graphs, then the next result holds. If not, the situation is complicated since it’s possible 139
to have all edges in the way that, there’s no value of a vertex for an edge. 140
Theorem 1.9. Let N T G : (V, E, σ, µ) be a neutrosophic graph. If N T G : (V, E, σ, µ) is 141
strong, then its crisp cycle is its neutrosophic cycle. 142
Proof. Suppose N T G : (V, E, σ, µ) is a neutrosophic graph. Consider u as a vertex of 143
crisp cycle CY C, such that σ(u) = min σ(x)x∈V (CY C) . u has two neighbors y, z in 144
CY C. Since N T G is strong, µ(uy) = µ(uz) = σ(u). It implies there are two weakest 145
edges in CY C. It means CY C is neutrosophic cycle. 146
For convenient usages, the word neutrosophic which is used in previous definition, 147
won’t be used, usually. 148
In next part, clarifications about main definition are given. To avoid confusion and 149
for convenient usages, examples are usually used after every part and names are used in 150
the way that, abbreviation, simplicity, and summarization are the matters of mind. 151
5/47
Example 1.10. In Figure (1), a complete-neutrosophic graph is illustrated. Some 152
points are represented in follow-up items as follows. 153
(i) If n1 , n2 is a sequence of consecutive vertices, then it’s obvious that there’s no

crisp cycle. It’s only a path and it’s only one edge but it is neither crisp cycle nor
neutrosophic cycle. The length of this path implies there’s no cycle since if the
length of a sequence of consecutive vertices is at most 2, then it’s impossible to
have cycle. So this neutrosophic path is neither a neutrosophic cycle nor crisp
cycle. The length of this path implies
n1 , n2
is corresponded to neither hamiltonian neutrosophic cycle M(N T G) nor 154
n-hamiltonian neutrosophic cycle N (N T G); 155
(ii) if n1 , n2 , n3 , n1 is a sequence of consecutive vertices, then it’s obvious that there’s

one crisp cycle. It’s also a path and there are three edges but it isn’t neutrosophic
cycle. The length of crisp cycle implies there’s one cycle since if the length of a
sequence of consecutive vertices is at most 3, then it’s possible to have cycle but
there aren’t two weakest edges which imply there is no neutrosophic cycle. So this
crisp cycle isn’t a neutrosophic cycle but it’s crisp cycle. The crisp length of this
crisp cycle implies
n1 , n2 , n3 , n1
isn’t corresponded to hamiltonian neutrosophic cycle M(N T G) and as its
consequences, length of this crisp cycle implies
n1 , n2 , n3 , n1
isn’t corresponded to n-hamiltonian neutrosophic cycle N (N T G); 156
(iii) if n1 , n2 , n3 , n4 , n1 is a sequence of consecutive vertices, then it’s obvious that

there’s two crisp cycles with length two and three. It’s also a path and there are
three edges but there are some crisp cycles but there are only two neutrosophic
cycles with length three, n1 , n3 , n4 , and with length four, n1 , n2 , n3 , n4 . The
length of this sequence implies there are some crisp cycles and there are two
neutrosophic cycles since if the length of a sequence of consecutive vertices is at
most 4 and it’s crisp complete, then it’s possible to have some crisp cycles and two
neutrosophic cycles with two different length three and four. So this neutrosophic
path forms some neutrosophic cycles and some crisp cycles. The length of this
path, four, implies
n1 , n2 , n3 , n4 , n1
is corresponded to hamiltonian neutrosophic cycle M(N T G) and it’s effective to 157
construct n-hamiltonian neutrosophic cycle N (N T G); 158
(iv) if n1 , n3 , n4 , n1 is a sequence of consecutive vertices, then it’s obvious that there’s

one crisp cycle. It’s also a path and there are three edges but it is also
neutrosophic cycle. The length of crisp cycle implies there’s one cycle since if the
length of a sequence of consecutive vertices is at most 3, then it’s possible to have
cycle but there are two weakest edges, n3 n4 and n1 n4 , which imply there is one
neutrosophic cycle. So this crisp cycle is a neutrosophic cycle and it’s crisp cycle.
The crisp length of this neutrosophic cycle, three, implies
n1 , n3 , n4 , n1
6/47
Figure 1. A Neutrosophic Graph in the Viewpoint of its hamiltonian neutrosophic
cycle and its n-hamiltonian neutrosophic cycle.
isn’t corresponded to hamiltonian neutrosophic cycle M(N T G). The vertex, n2 ,

isn’t in sequence related to this neutrosophic cycle. Thus it implies
n1 , n3 , n4 , n1
(v) M(N T G) : n1 , n2 , n3 , n4 , n1 is hamiltonian neutrosophic cycle and its 160
corresponded sets. are the sequences which have both the edges n1 n4 and n3 n4 . 161
Since these edges are two weakest edges in this complete-neutrosophic graph. 162
Other sequences even if they’re cycles having all vertices, once, are hamiltonian 163
cycles and not hamiltonian neutrosophic cycles; 164
(vi) N (N T G) = 1 is n-hamiltonian neutrosophic cycle. 165
2 Setting of hamiltonian neutrosophic cycle 166
In this section, I provide some results in the setting of hamiltonian neutrosophic cycle. 167
Some classes of neutrosophic graphs are chosen. Complete-neutrosophic graph, 168
path-neutrosophic graph, cycle-neutrosophic graph, star-neutrosophic graph, 169
bipartite-neutrosophic graph, and t-partite-neutrosophic graph, are both of cases of 170
study and classes which the results are about them. 171
Proposition 2.1. Let N T G : (V, E, σ, µ) be a complete-neutrosophic graph with two 172
weakest edges. Then 173
M(CM T σ ) : x1 , x2 , · · · , xO(CM T σ )−1 , xO(CM T σ ) , x1 .
Proof. Suppose CM T σ : (V, E, σ, µ) is a complete-neutrosophic graph. In other hand,

there’s a cycle if and only if O(CM T σ ) ≥ 3. It’s complete. So there’s at least one
neutrosophic cycle which its length is O(CM T σ ) = 3. By longest cycle is on demand,
the n-hamiltonian neutrosophic cycle is four. The length of longest cycle is O(CM T σ ).
Thus it’s hamiltonian neutrosophic cycle. Thus
M(CM T σ ) : x1 , x2 , · · · , xO(CM T σ )−1 , xO(CM T σ ) , x1 .
174
The clarifications about results are in progress as follows. A complete-neutrosophic 175
graph is related to previous result and it’s studied to apply the definitions on it. To 176
make it more clear, next part gives one special case to apply definitions and results on 177
7/47
it. Some items are devised to make more sense about new notions. A 178
complete-neutrosophic graph is related to previous result and it’s studied to apply the 179
definitions on it, too. 180
Example 2.2. In Figure (2), a complete-neutrosophic graph is illustrated. Some points 181
are represented in follow-up items as follows. 182

n1 , n2
is corresponded to neither hamiltonian neutrosophic cycle M(CM T σ ) nor 183
n-hamiltonian neutrosophic cycle N (CM T σ ); 184

crisp cycle implies
n1 , n2 , n3 , n1
isn’t corresponded to hamiltonian neutrosophic cycle M(CM T σ ) and as its
n1 , n2 , n3 , n1
isn’t corresponded to n-hamiltonian neutrosophic cycle N (CM T σ ); 185

path, four, implies
n1 , n2 , n3 , n4 , n1
is corresponded to hamiltonian neutrosophic cycle M(CM T σ ) and it’s effective to 186
construct n-hamiltonian neutrosophic cycle N (CM T σ ); 187

8/47
cycle.
n1 , n3 , n4 , n1
isn’t corresponded to hamiltonian neutrosophic cycle M(CM T σ ). The vertex, n2 ,

n1 , n3 , n4 , n1
(v) M(CM T σ ) : n1 , n2 , n3 , n4 , n1 is hamiltonian neutrosophic cycle and its 189
(vi) N (CM T σ ) = 1 is n-hamiltonian neutrosophic cycle. 194
Another class of neutrosophic graphs is addressed to path-neutrosophic graph. 195
Proposition 2.3. Let N T G : (V, E, σ, µ) be a strong-path-neutrosophic graph. Then
M(P T H n ) : Not Existed.
Proof. Suppose P T H n : (V, E, σ, µ) is a strong-path-neutrosophic graph. There’s no

crisp cycle. If P T H n : (V, E, σ, µ) isn’t a crisp cycle, then P T H n : (V, E, σ, µ) isn’t a
neutrosophic cycle. There’s no cycle from every version. Let x0 , x1 , · · · , xO(P T H n ) be a
path-neutrosophic graph. Since x0 , x1 , · · · , xO(P T H n ) is a sequence of consecutive
vertices, there’s no repetition of vertices in this sequence. So there’s no cycle.
hamiltonian neutrosophic cycle is corresponded to longest cycle with length O(P T H n )
but there’s no cycle. Thus it implies
M(P T H n ) : Not Existed.
196
Example 2.4. There are two sections for clarifications. 197
(a) In Figure (3), an odd-path-neutrosophic graph is illustrated. Some points are 198
represented in follow-up items as follows. 199
9/47
(i) If n1 , n2 is a sequence of consecutive vertices, then it’s obvious that there’s
no crisp cycle. It’s only a path and it’s only one edge but it is neither crisp
cycle nor neutrosophic cycle. The length of this path implies there’s no cycle
since if the length of a sequence of consecutive vertices is at most 2, then it’s
impossible to have cycle. So this neutrosophic path is neither a neutrosophic
cycle nor crisp cycle. The length of this path implies
n1 , n2
is corresponded to neither hamiltonian neutrosophic cycle M(P T H n ) nor 200
n-hamiltonian neutrosophic cycle N (P T H n ); 201
(ii) if n1 , n2 , n3 is a sequence of consecutive vertices, then it’s obvious that

there’s no crisp cycle. It’s also a path and there are two edges, n1 n2 and
n2 n3 , according to corresponded neutrosophic path but it isn’t neutrosophic
cycle. First step is to have at least one crisp cycle for finding longest cycle
containing all vertices once. Finding longest cycle containing all vertices once
has no result. Since there’s no cycle. Neutrosophic cycle is a crisp cycle with
at least two weakest edges. So this neutrosophic path is either a neutrosophic
cycle nor crisp cycle. The structure of this neutrosophic path implies
n1 , n2 , n3
is corresponded neither to hamiltonian neutrosophic cycle M(P T H n ) nor 202
(iii) if n1 , n2 , n3 , n4 is a sequence of consecutive vertices, then it’s obvious that

there’s no crisp cycle. It’s also a path and there are three edges, n1 n2 and
at least two weakest edges. So this neutrosophic path is neither a
neutrosophic cycle nor crisp cycle. So adding points has no effect to find a
crisp cycle. The structure of this neutrosophic path implies
n1 , n2 , n3 , n4
(iv) if n1 , n2 , n3 , n4 , n5 is a sequence of consecutive vertices, then it’s obvious

that there’s no crisp cycle. It’s also a path and there are four edges,
n1 n2 , n2 n3 and n4 n5 , according to corresponded neutrosophic path but it
isn’t neutrosophic cycle. First step is to have at least one crisp cycle for
finding longest cycle containing all vertices once. Finding longest cycle
containing all vertices once has no result. Since there’s no cycle.
Neutrosophic cycle is a crisp cycle with at least two weakest edges. So this
neutrosophic path is neither a neutrosophic cycle nor crisp cycle. So adding
vertices has no effect to find a crisp cycle. There is only one path amid two
given vertices. The structure of this neutrosophic path implies
n1 , n2 , n3 , n4 , n5
10/47
(v) There is no hamiltonian neutrosophic cycle and there are no corresponded 208
sets and sequences; 209
(vi) 0 is n-hamiltonian neutrosophic cycle and there are no corresponded sets and 210
sequences. 211
(b) In Figure (4), an even-path-neutrosophic graph is illustrated. Some points 212

n1 , n2

at least two weakest edges. So this neutrosophic path is either a neutrosophic
cycle nor crisp cycle. The structure of this neutrosophic path implies
n1 , n2 , n3

n1 , n2 , n3 , n4

isn’t neutrosophic cycle. First step is to have at least one crisp cyclefor
finding longest cycle containing all vertices once. Finding longest cycle
containing all vertices once has no result. Since there’s no cycle.
11/47
cycle.

cycle.
neutrosophic path is neither a neutrosophic cycle nor crisp cycle. So adding

vertices has no effect to find a crisp cycle. There is only one path amid two
given vertices. The structure of this neutrosophic path implies
n1 , n2 , n3 , n4 , n5
sequences. 225
Proposition 2.5. Let N T G : (V, E, σ, µ) be a strong-cycle-neutrosophic graph where 226
O(CY C n ) ≥ 3. Then 227
M(CY C n ) : x1 , x2 , · · · , xO(CY C n )−1 , xO(CY C n ) , x1 .
Proof. Suppose CY C n : (V, E, σ, µ) is a strong-cycle-neutrosophic graph. Let

x1 , x2 , · · · , xO(CY C n ) , x1 be a sequence of consecutive vertices of CY C n : (V, E, σ, µ)
such that
xi xi+1 ∈ E, i = 1, 2, · · · , O(CY C n ) − 1, xO(CY C n ) x1 ∈ E.
12/47
There are two paths amid two given vertices. The degree of every vertex is two. But
there’s one crisp cycle for every given vertex. So the efforts leads to one cycle for finding
a longest crisp cycle with length O(CY C n ). For a given vertex xi , the sequence of
consecutive vertices
xi , xi+1 , · · · , xi−2 , xi−1 , xi
is a corresponded crisp cycle for xi . Every cycle has same length. The length is
O(CY C n ). Thus the crisp cardinality of set of vertices forming longest crisp cycle is
O(CY C n ). By Theorem (1.9),
M(CY C n ) : x1 , x2 , · · · , xO(CY C n )−1 , xO(CY C n ) , x1 .
228
The clarifications about results are in progress as follows. An odd-cycle-neutrosophic 229
it. Some items are devised to make more sense about new notions. An 232
even-cycle-neutrosophic graph is related to previous result and it’s studied to apply the 233
(a) In Figure (5), an even-cycle-neutrosophic graph is illustrated. Some points are 236

n1 , n2
is corresponded to neither hamiltonian neutrosophic cycle M(CY C n ) nor 238
n-hamiltonian neutrosophic cycle N (CY C n ); 239

neutrosophic cycle nor crisp cycle. The structure of this neutrosophic path
implies
n1 , n2 , n3
is corresponded neither to hamiltonian neutrosophic cycle M(CY C n ) nor 240

13/47
n1 , n2 , n3 , n4
(iv) if n1 , n2 , n3 , n4 , n5 , n6 , n1 is a sequence of consecutive vertices, then it’s

obvious that there’s one cycle. It’s also a path and there are six edges,
n1 n2 , n2 n3 , n3 n4 , n4 n5 , n5 n6 and n6 n1 , according to corresponded
neutrosophic path and it’s neutrosophic cycle since it has two weakest edges,
n4 n5 and n5 n6 with same values (0.1, 0.1, 0.2). First step is to have at least
one crisp cycle for finding longest cycle containing all vertices once. Finding
longest cycle containing all vertices once has one result. Since there’s one
cycle. Neutrosophic cycle is a crisp cycle with at least two weakest edges. So
this neutrosophic path is both of a neutrosophic cycle and crisp cycle. So
adding vertices has effect on finding a crisp cycle. There are only two paths
amid two given vertices. The structure of this neutrosophic path implies
n1 , n2 , n3 , n4 , n5 , n6 , n1
is corresponded to both of hamiltonian neutrosophic cycle M(CY C n ) and 244
(v) M(CY C n ) : n1 , n2 , n3 , n4 , n5 , n6 , n1 is hamiltonian neutrosophic cycle; 246
(vi) N (CY C n ) = 1 is n-hamiltonian neutrosophic cycle. 247
(b) In Figure (6), an odd-cycle-neutrosophic graph is illustrated. Some points are 248

n1 , n2

cycle. First step is to have at least one crisp cycle for finding shortest cycle.
Finding shortest cycle has no result. Since there’s no cycle. Neutrosophic
cycle is a crisp cycle with at least two weakest edges. So this neutrosophic
path is either a neutrosophic cycle nor crisp cycle. The structure of this
neutrosophic path implies
n1 , n2 , n3
14/47
cycle.

path is neither a neutrosophic cycle nor crisp cycle. So adding points has no
effect to find a crisp cycle. The structure of this neutrosophic path implies
n1 , n2 , n3 , n4
(iv) if n1 , n2 , n3 , n4 , n5 , n1 is a sequence of consecutive vertices, then it’s obvious

that there’s one cycle. It’s also a path and there are five edges,
n1 n2 , n2 n3 , n3 n4 , n4 n5 and n5 n1 , according to corresponded neutrosophic
path and it isn’t neutrosophic cycle since it has only one weakest edge, n1 n2 ,
with value (0.2, 0.5, 0.4) and not more. First step is to have at least one crisp
cycle for finding longest cycle containing all vertices once. Finding longest
cycle containing all vertices once has one result. Since there’s one cycle.
neutrosophic path is not a neutrosophic cycle but it is a crisp cycle. So
n1 , n2 , n3 , n4 , n5 , n1
(v) M(CY C n ) : Not Existed is hamiltonian neutrosophic cycle; 258
(vi) N (CY C n ) = 0. 259
Proposition 2.7. Let N T G : (V, E, σ, µ) be a strong-star-neutrosophic graph with

center c. Then
M(ST R1,σ2 ) : Not Existed
Proof. Suppose ST R1,σ2 : (V, E, σ, µ) is a strong-star-neutrosophic graph. Every vertex
isn’t a neighbor for every given vertex. Every vertex is a neighbor for center.
15/47
cycle.
Furthermore, center is only neighbor for any given vertex. So center is only neighbor for
all vertices. It’s possible to have some paths amid two given vertices but there’s no crisp
cycle. In other words, if O(ST R1,σ2 ) > 2, then there are at least three vertices x, y and
z such that if x is a neighbor for y and z, then y and z aren’t neighbors and x is center.
To get more precise, if x and y are neighbors then either x or y is center. Every edge
have one common endpoint with other edges which is called center. Thus there is no
triangle but there are some edges. One edge has two endpoints which one of them is
center. There are no crisp cycle. Hence trying to find longest cycle containing all
vertices once, has no result. There is no crisp cycle. Then there is longest crisp cycle
containing all vertices once. So
M(ST R1,σ2 ) : Not Existed.
260
The clarifications about results are in progress as follows. A star-neutrosophic graph 261
is related to previous result and it’s studied to apply the definitions on it. To make it 262
more clear, next part gives one special case to apply definitions and results on it. Some 263
items are devised to make more sense about new notions. A star-neutrosophic graph is 264
related to previous result and it’s studied to apply the definitions on it, too. 265
Example 2.8. There is one section for clarifications. In Figure (7), a star-neutrosophic 266
graph is illustrated. Some points are represented in follow-up items as follows. 267

crisp cycle. It’s only a star and it’s only one edge but it is neither crisp cycle nor
neutrosophic cycle. The length of this star implies there’s no cycle since if the
have cycle. So this neutrosophic star has neither a neutrosophic cycle nor crisp
cycle. The length of this star implies
n1 , n2
is corresponded to neither hamiltonian neutrosophic cycle M(ST R1,σ2 ) nor 268
n-hamiltonian neutrosophic cycle N (ST R1,σ2 ); 269
(ii) if n1 , n2 , n3 is a sequence of consecutive vertices, then it’s obvious that there’s no

crisp cycle. It’s also a star and there are two edges, n1 n2 and n1 n3 , according to
corresponded neutrosophic star but it doesn’t have neutrosophic cycle. First step
is to have at least one crisp cycle for finding longest cycle containing all vertices
16/47
once. Finding longest cycle containing all vertices once, has no result. Since
there’s no cycle. Neutrosophic cycle is a crisp cycle with at least two weakest
edges. So this neutrosophic star has neither a neutrosophic cycle nor crisp cycle.
The structure of this neutrosophic star implies
n1 , n2 , n3
(iii) if n1 , n2 , n3 , n4 is a sequence of consecutive vertices, then it’s obvious that there’s

no crisp cycle. It’s also a star and there are three edges, n1 n2 , n1 n3 and n1 n4 ,
according to corresponded neutrosophic star but it doesn’t have neutrosophic
containing all vertices once. Finding longest cycle containing all vertices once, has
no result. Since there’s no cycle. Neutrosophic cycle is a crisp cycle with at least
two weakest edges. So this neutrosophic star has neither a neutrosophic cycle nor
crisp cycle. So adding vertices has no effect to find a crisp cycle. The structure of
this neutrosophic star implies
n1 , n2 , n3 , n4
(iv) if n1 , n2 , n3 , n4 , n5 is a sequence of consecutive vertices, then it’s obvious that

there’s no crisp cycle. It’s also a star and there are four edges, n1 n2 , n1 n3 , n1 n4
and n1 n5 , according to corresponded neutrosophic star but it isn’t neutrosophic
containing all vertices once. Finding longest cycle containing all vertices once has
crisp cycle. So adding vertices has no effect to find a crisp cycle. There are some
paths amid two given vertices. The structure of this neutrosophic star implies
n1 , n2 , n3 , n4 , n5
(v) M(ST R1,σ2 ) : Not Existed is hamiltonian neutrosophic cycle and there is no 276
corresponded set; 277
(vi) N (ST R1,σ2 ) = 0 is n-hamiltonian neutrosophic cycle. 278
Proposition 2.9. Let N T G : (V, E, σ, µ) be a strong-complete-bipartite-neutrosophic

graph. Then
M(CM Cσ1 ,σ2 ) : v1 , v2 , · · · , vO(CM Cσ1 ,σ2 )−1 , vO(CM Cσ1 ,σ2 ) , v1
where O(CM Cσ1 ,σ2 ) ≥ 4, |V1 | = |V2 |, v2i+1 ∈ V1 v2i ∈ V2 . And
M(CM Cσ1 ,σ2 ) : Not Existed
where O(CM Cσ1 ,σ2 ) ≤ 3. 279
17/47
cycle.
Proof. Suppose CM Cσ1 ,σ2 : (V, E, σ, µ) is a strong-complete-bipartite-neutrosophic

graph. Every vertex is a neighbor for all vertices in another part. If O(CM Cσ1 ,σ2 ) ≤ 3,
then it’s neutrosophic path implying
M(CM Cσ1 ,σ2 ) : Not Existed.
If O(CM Cσ1 ,σ2 ) ≥ 4, then it’s possible to have two vertices in every part. In this case,
four vertices form a crisp cycle which crisp cardinality of its vertices are four. It’s
impossible to have a crisp cycle which crisp cardinality of its vertices are three. Since the
sequence of consecutive vertices are x1 , x2 , x3 and there’s no edge more. It implies there
are two edges. It’s neutrosophic path but neither crisp cycle nor neutrosophic cycle. So
the first step of finding longest cycle containing all vertices once, is impossible but in
second step, there’s one crisp cycle corresponded to number four. By Theorem (1.9),
M(CM Cσ1 ,σ2 ) : v1 , v2 , · · · , vO(CM Cσ1 ,σ2 )−1 , vO(CM Cσ1 ,σ2 ) , v1
where O(CM Cσ1 ,σ2 ) ≥ 4, |V1 | = |V2 |, v2i+1 ∈ V1 v2i ∈ V2 . And
M(CM Cσ1 ,σ2 ) : Not Existed
where O(CM Cσ1 ,σ2 ) ≤ 3. 280
The clarifications about results are in progress as follows. A 281
complete-bipartite-neutrosophic graph is related to previous result and it’s studied to 282
apply the definitions on it. To make it more clear, next part gives one special case to 283
apply definitions and results on it. Some items are devised to make more senses about 284
new notions. A complete-bipartite-neutrosophic graph is related to previous result and 285
it’s studied to apply the definitions on it, too. 286
Example 2.10. There is one section for clarifications. In Figure (8), a 287
complete-bipartite-neutrosophic graph is illustrated. Some points are represented in 288
follow-up items as follows. 289

crisp cycle. It’s only a complete-bipartite and it’s only one edge but it is neither
crisp cycle nor neutrosophic cycle. The length of this complete-bipartite implies
there’s no cycle since if the length of a sequence of consecutive vertices is at most
2, then it’s impossible to have cycle. So this neutrosophic complete-bipartite has
neither a neutrosophic cycle nor crisp cycle. The length of this complete-bipartite
implies
n1 , n2
18/47
is corresponded to neither hamiltonian neutrosophic cycle M(CM Cσ1 ,σ2 ) nor 290
n-hamiltonian neutrosophic cycle N (CM Cσ1 ,σ2 ); 291

crisp cycle. It’s also a complete-bipartite and there are two edges, n1 n2 and n1 n3 ,
according to corresponded neutrosophic complete-bipartite but it doesn’t have
neutrosophic cycle. First step is to have at least one crisp cycle for finding longest
cycle containing all vertices once. Finding longest cycle containing all vertices
once has no result. Since there’s no cycle. Neutrosophic cycle is a crisp cycle with
at least two weakest edges. So this neutrosophic complete-bipartite has neither a
neutrosophic cycle nor crisp cycle. The structure of this neutrosophic
complete-bipartite implies
n1 , n2 , n3
(iii) if n1 , n2 , n4 is a sequence of consecutive vertices, then it’s obvious that there’s no

n1 , n2 , n4

there’s one crisp cycle. It’s also a complete-bipartite and there are four edges,
n1 n2 , n2 n4 , n4 n3 and n3 n1 , according to corresponded neutrosophic
complete-bipartite and it has neutrosophic cycle where n2 n4 and n3 n4 are two
weakest edges with same amount (0.3, 0.2, 0.3). First step is to have at least one
crisp cycle for finding longest cycle containing all vertices once. Finding longest
cycle containing all vertices once, only has one result. Since there’s one cycle.
neutrosophic complete-bipartite has both of a neutrosophic cycle and crisp cycle.
So adding vertices has some effects to find a crisp cycle. The structure of this
neutrosophic complete-bipartite implies
n1 , n2 , n3 , n4 , n1
is corresponded to hamiltonian neutrosophic cycle M(CM Cσ1 ,σ2 ) and uniqueness

of this cycle implies the sequence
n1 , n2 , n3 , n4 , n1
is corresponded to n-hamiltonian neutrosophic cycle N (CM Cσ1 ,σ2 ); 296
(v) M(CM Cσ1 ,σ2 ) : n1 , n2 , n3 , n4 , n1 is hamiltonian neutrosophic cycle and all edges 297
are used. Thus there’s no edge to be unused; 298
(vi) N (CM Cσ1 ,σ2 ) = 1 is n-hamiltonian neutrosophic cycle and all edges are used. 299
Thus there’s no edge to be unused. 300
19/47
Figure 8. A Neutrosophic Graph in the Viewpoint of hamiltonian neutrosophic cycle.
Proposition 2.11. Let N T G : (V, E, σ, µ) be a strong-complete-t-partite-neutrosophic

graph. Then
M(CM Cσ1 ,σ2 ,··· ,σt ) : v1 , v2 , · · · , vO(CM Cσ1 ,σ2 ,··· ,σt )−1 , vO(CM Cσ1 ,σ2 ,··· ,σt ) , v1
where t ≥ 3, |Vi | = |Vj |.
where t ≤ 2, O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 4, |V1 | = |V2 |, v2i+1 ∈ V1 v2i ∈ V2 . And
M(CM Cσ1 ,σ2 ,··· ,σt ) : Not Existed
where O(CM Cσ1 ,σ2 ,··· ,σt ) ≤ 2. 301
Proof. Suppose CM Cσ1 ,σ2 ,··· ,σt : (V, E, σ, µ) is a strong-complete-t-partite-neutrosophic

graph. Every vertex is a neighbor for all vertices in another part. If
O(CM Cσ1 ,σ2 ,··· ,σt ) ≤ 2, then it’s neutrosophic path implying
M(CM Cσ1 ,σ2 ,··· ,σt ) : Not Existed.
If t ≥ 3, O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 3, then it has crisp cycle implying
M(CM Cσ1 ,σ2 ,··· ,σt ) : v1 , v2 , · · · , vO(CM Cσ1 ,σ2 ,··· ,σt )−1 , vO(CM Cσ1 ,σ2 ,··· ,σt ) , v1 .
If t ≥ 2, O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 4, then it’s possible to have two vertices in every part. In
this case, four vertices form a crisp cycle which crisp cardinality of its vertices are four.
It’s impossible to have a crisp cycle which crisp cardinality of its vertices are three.
Since the sequence of consecutive vertices are x1 , x2 , x3 and there’s no edge more. It
implies there are two edges. It’s neutrosophic path but neither crisp cycle nor
neutrosophic cycle. So the first step of finding longest cycle containing all vertices once,
is impossible but in second step, there’s one crisp cycle corresponded to number four.
By Theorem (1.9),
where t ≥ 3, |Vi | = |Vj |.
M(CM Cσ1 ,σ2 ,··· ,σt ) : Not Existed
where O(CM Cσ1 ,σ2 ,··· ,σt ) ≤ 2. 302
20/47
complete-t-partite-neutrosophic graph is related to previous result and it’s studied to 304
apply definitions and results on it. Some items are devised to make more sense about 306
new notions. A complete-t-partite-neutrosophic graph is related to previous result and 307
complete-t-partite-neutrosophic graph is illustrated. Some points are represented in 310

crisp cycle. It’s only a complete-t-partite and it’s only one edge but it is neither
crisp cycle nor neutrosophic cycle. The length of this complete-t-partite implies
2, then it’s impossible to have cycle. So this neutrosophic complete-t-partite has
neither a neutrosophic cycle nor crisp cycle. The length of this complete-t-partite
implies
n1 , n2
is corresponded to neither hamiltonian neutrosophic cycle M(CM Cσ1 ,σ2 ,··· ,σt ) nor 312
n-hamiltonian neutrosophic cycle N (CM Cσ1 ,σ2 ,··· ,σt ); 313

crisp cycle. It’s also a complete-t-partite and there are two edges, n1 n2 and n1 n3 ,
according to corresponded neutrosophic complete-t-partite but it doesn’t have
at least two weakest edges. So this neutrosophic complete-t-partite has neither a
complete-t-partite implies
n1 , n2 , n3

n1 , n2 , n4

there’s one crisp cycle. It’s also a complete-t-partite and there are four edges,
complete-t-partite and it has neutrosophic cycle where n2 n4 and n5 n4 are two
weakest edge with same amount (0.3, 0.2, 0.3). First step is to have at least one
21/47
cycle.
crisp cycle for finding longest cycle. Finding longest cycle. only has one result.
Since there’s one cycle. But finding longest cycle containing all vertices once, has
no result. Since the vertex n3 isn’t in intended sequence. Neutrosophic cycle is a
crisp cycle with at least two weakest edges. So this neutrosophic
complete-t-partite has both of a neutrosophic cycle and crisp cycle. So adding
vertices has some effects to find a crisp cycle. The structure of this neutrosophic
n1 , n2 , n4 , n5 , n1
isn’t corresponded to hamiltonian neutrosophic cycle M(CM Cσ1 ,σ2 ,··· ,σt ).
|V1 | =
6 |V2 | and lack of n3 imply the sequence
n1 , n2 , n4 , n5 , n1
isn’t corresponded to n-hamiltonian neutrosophic cycle N (CM Cσ1 ,σ2 ,··· ,σt ); 318
(v) M(CM Cσ1 ,σ2 ,··· ,σt ) : Not Existed is hamiltonian neutrosophic cycle; 319
(vi) N (CM Cσ1 ,σ2 ,··· ,σt ) = 0 is about n-hamiltonian neutrosophic cycle. 320
Proposition 2.13. Let N T G : (V, E, σ, µ) be a strong-wheel-neutrosophic graph. Then
M(W HL1,σ2 ) : v1 , v2 , · · · , vO(W HL1,σ2 )−1 , vO(W HL1,σ2 ) , v1
where t ≥ 3.
M(W HL1,σ2 ) : Not Existed
where t ≥ 2. 321
Proof. Suppose W HL1,σ2 : (V, E, σ, µ) is a strong-wheel-neutrosophic graph. The

argument is elementary. Since all vertices of a path join to one vertex. By Theorem
(1.9),
M(W HL1,σ2 ) : v1 , v2 , · · · , vO(W HL1,σ2 )−1 , vO(W HL1,σ2 ) , v1
where t ≥ 3.
M(W HL1,σ2 ) : Not Existed
where t ≥ 2. 322
22/47
strong-wheel-neutrosophic graph is related to previous result and it’s studied to apply 324
the definitions on it. To make it more clear, next part gives one special case to apply 325
definitions and results on it. Some items are devised to make more sense about new 326
notions. A strong-wheel-neutrosophic graph is related to previous result and it’s studied 327
to apply the definitions on it, too. 328
wheel-neutrosophic graph is illustrated. Some points are represented in follow-up items 330
as follows. 331
(i) If s1 , s2 is a sequence of consecutive vertices, then it’s obvious that there’s no

crisp cycle. It’s only a wheel and it’s only one edge but it is neither crisp cycle nor
neutrosophic cycle. The length of this wheel implies there’s no cycle since if the
have cycle. So this neutrosophic wheel has neither a neutrosophic cycle nor crisp
cycle. The length of this wheel implies
s1 , s2
(ii) if s4 , s2 , s3 is a sequence of consecutive vertices, then it’s obvious that there’s no

crisp cycle. It’s also a wheel and there are two edges, s3 s2 and s4 s3 , according to
corresponded neutrosophic wheel but it doesn’t have neutrosophic cycle. First
step is to have at least one crisp cycle for finding longest cycle containing all
vertices once. Finding longest cycle containing all vertices once has no result.
Since there’s no cycle. Neutrosophic cycle is a crisp cycle with at least two
weakest edges. So this neutrosophic wheel has neither a neutrosophic cycle nor
crisp cycle. The structure of this neutrosophic wheel implies
s4 , s2 , s3
(iii) if s1 , s2 , s3 , s1 is a sequence of consecutive vertices, then it’s obvious that there’s

one crisp cycle. It’s also a wheel and there are three edges, s1 s2 , s2 s3 and s3 s1
according to corresponded neutrosophic wheel but it doesn’t have neutrosophic
one result. Since there’s one crisp cycle. Neutrosophic cycle is a crisp cycle with
at least two weakest edges. So this neutrosophic wheel has no neutrosophic cycle
but it has crisp cycle. The structure of this neutrosophic wheel implies
s1 , s2 , s3 , s1
isn’t corresponded to hamiltonian neutrosophic cycle M(N T G) and this structure

also implies
s1 , s2 , s3 , s1
(iv) if s1 , s3 , s4 , s1 is a sequence of consecutive vertices, then it’s obvious that there’s

23/47
cycle.
according to corresponded neutrosophic wheel and it has a neutrosophic cycle.

Since there’s one crisp cycle. Neutrosophic cycle is a crisp cycle with at least two
weakest edges. So this neutrosophic wheel has one neutrosophic cycle with two
weakest edges s1 s4 and s3 s4 concerning same values (0.1, 0.1, 0.5) and it has a
s1 , s3 , s4 , s1
isn’t corresponded to hamiltonian neutrosophic cycle M(N T G). First step is to
have at least one crisp cycle for finding longest cycle containing all vertices once.
Finding longest cycle containing all vertices once has no result. Since the vertex
s5 is unused in the sequence. Also, this reason implies
s1 , s3 , s4 , s1
(v) M(CY C n ) : s1 , s3 , s4 , s5 , s1 is hamiltonian neutrosophic cycle; 338
3 Setting of n-hamiltonian neutrosophic cycle 340
In this section, I provide some results in the setting of n-hamiltonian neutrosophic cycle. 341
Some classes of neutrosophic graphs are chosen. Complete-neutrosophic graph, 342
path-neutrosophic graph, cycle-neutrosophic graph, star-neutrosophic graph, 343
bipartite-neutrosophic graph, t-partite-neutrosophic graph, and wheel-neutrosophic 344
graph, are both of cases of study and classes which the results are about them. 345
Proposition 3.1. Let N T G : (V, E, σ, µ) be a complete-neutrosophic graph with two 346
weakest edges. Then 347
N (CM T σ ) = 1.
Proof. Suppose CM T σ : (V, E, σ, µ) is a complete-neutrosophic graph. In other hand,
there’s a cycle if and only if O(CM T σ ) ≥ 3. It’s complete. So there’s at least one
neutrosophic cycle which its length is O(CM T σ ) = 3. By longest cycle is on demand,
the n-hamiltonian neutrosophic cycle is four. The length of longest cycle is O(CM T σ ).
Thus it’s hamiltonian neutrosophic cycle. Thus
N (CM T σ ) = 1.
24/47
348
The clarifications about results are in progress as follows. A complete-neutrosophic 349
it. Some items are devised to make more sense about new notions. A 352
complete-neutrosophic graph is related to previous result and it’s studied to apply the 353
Example 3.2. In Figure (11), a complete-neutrosophic graph is illustrated. Some 355
points are represented in follow-up items as follows. 356

n1 , n2

crisp cycle implies
n1 , n2 , n3 , n1
n1 , n2 , n3 , n1

path, four, implies
n1 , n2 , n3 , n4 , n1
is corresponded to hamiltonian neutrosophic cycle M(CM T σ ) and it’s effective to 360
construct n-hamiltonian neutrosophic cycle N (CM T σ ); 361
25/47
Figure 11. A Neutrosophic Graph in the Viewpoint of its n-hamiltonian neutrosophic
cycle.

n1 , n3 , n4 , n1
isn’t corresponded to hamiltonian neutrosophic cycle M(CM T σ ). The vertex, n2 ,

n1 , n3 , n4 , n1
Another class of neutrosophic graphs is addressed to path-neutrosophic graph. 369
Proposition 3.3. Let N T G : (V, E, σ, µ) be a strong-path-neutrosophic graph. Then
N (P T H n ) = 0.
Proof. Suppose P T H n : (V, E, σ, µ) is a strong-path-neutrosophic graph. There’s no

crisp cycle. If P T H n : (V, E, σ, µ) isn’t a crisp cycle, then P T H n : (V, E, σ, µ) isn’t a
neutrosophic cycle. There’s no cycle from every version. Let x0 , x1 , · · · , xO(P T H n ) be a
path-neutrosophic graph. Since x0 , x1 , · · · , xO(P T H n ) is a sequence of consecutive
vertices, there’s no repetition of vertices in this sequence. So there’s no cycle.
hamiltonian neutrosophic cycle is corresponded to longest cycle with length O(P T H n )
but there’s no cycle. Thus it implies
N (P T H n ) = 0.
370
26/47
(a) In Figure (12), an odd-path-neutrosophic graph is illustrated. Some points are 372

n1 , n2

n1 , n2 , n3

n1 , n2 , n3 , n4

finding shortest cycle. Finding shortest cycle has no result. Since there’s no
this neutrosophic path is neither a neutrosophic cycle nor crisp cycle. So
adding vertices has no effect to find a crisp cycle. There is only one path
n1 , n2 , n3 , n4 , n5
27/47
sequences. 385
(b) In Figure (13), an even-path-neutrosophic graph is illustrated. Some points 386

n1 , n2

n1 , n2 , n3

n1 , n2 , n3 , n4

finding shortest cycle. Finding shortest cycle has no result. Since there’s no
this neutrosophic path is neither a neutrosophic cycle nor crisp cycle. So
adding vertices has no effect to find a crisp cycle. There is only one path
n1 , n2 , n3 , n4 , n5
28/47
cycle.

cycle.
sequences. 399
Proposition 3.5. Let N T G : (V, E, σ, µ) be a strong-cycle-neutrosophic graph where 400
O(CY C n ) ≥ 3. Then 401
N (CY C n ) = 1.
Proof. Suppose CY C n : (V, E, σ, µ) is a strong-cycle-neutrosophic graph. Let

x1 , x2 , · · · , xO(CY C n ) , x1 be a sequence of consecutive vertices of CY C n : (V, E, σ, µ)
such that
xi xi+1 ∈ E, i = 1, 2, · · · , O(CY C n ) − 1, xO(CY C n ) x1 ∈ E.
There are two paths amid two given vertices. The degree of every vertex is two. But
there’s one crisp cycle for every given vertex. So the efforts leads to one cycle for finding
a longest crisp cycle with length O(CY C n ). For a given vertex xi , the sequence of
consecutive vertices
xi , xi+1 , · · · , xi−2 , xi−1 , xi
29/47
is a corresponded crisp cycle for xi . Every cycle has same length. The length is
O(CY C n ). Thus the crisp cardinality of set of vertices forming longest crisp cycle is
O(CY C n ). By Theorem (1.9),
N (CY C n ) = 1.
402
The clarifications about results are in progress as follows. An odd-cycle-neutrosophic 403
it. Some items are devised to make more sense about new notions. An 406
even-cycle-neutrosophic graph is related to previous result and it’s studied to apply the 407
(a) In Figure (14), an even-cycle-neutrosophic graph is illustrated. Some points are 410

n1 , n2

path is neither a neutrosophic cycle nor crisp cycle. The structure of this
n1 , n2 , n3

n1 , n2 , n3 , n4
30/47
(iv) if n1 , n2 , n3 , n4 , n5 , n6 , n1 is a sequence of consecutive vertices, then it’s
obvious that there’s one cycle. It’s also a path and there are six edges,
n1 n2 , n2 n3 , n3 n4 , n4 n5 , n5 n6 and n6 n1 , according to corresponded
neutrosophic path and it’s neutrosophic cycle since it has two weakest edges,
n4 n5 and n5 n6 with same values (0.1, 0.1, 0.2). First step is to have at least
one crisp cycle for finding longest cycle containing all vertices once. Finding
longest cycle containing all vertices once has one result. Since there’s one
this neutrosophic path is both of a neutrosophic cycle and crisp cycle. So
n1 , n2 , n3 , n4 , n5 , n6 , n1
is corresponded to both of hamiltonian neutrosophic cycle M(CY C n ) and 418
(v) M(CY C n ) : n1 , n2 , n3 , n4 , n5 , n6 , n1 is hamiltonian neutrosophic cycle; 420
(b) In Figure (15), an odd-cycle-neutrosophic graph is illustrated. Some points are 422

n1 , n2

n1 , n2 , n3

n1 , n2 , n3 , n4
31/47
cycle.

cycle.
(iv) if n1 , n2 , n3 , n4 , n5 , n1 is a sequence of consecutive vertices, then it’s obvious

that there’s one cycle. It’s also a path and there are five edges,
n1 n2 , n2 n3 , n3 n4 , n4 n5 and n5 n1 , according to corresponded neutrosophic
path and it isn’t neutrosophic cycle since it has only one weakest edge, n1 n2 ,
with value (0.2, 0.5, 0.4) and not more. First step is to have at least one crisp
cycle containing all vertices once has one result. Since there’s one cycle.
neutrosophic path is not a neutrosophic cycle but it is a crisp cycle. So
n1 , n2 , n3 , n4 , n5 , n1
(v) M(CY C n ) : Not Existed is hamiltonian neutrosophic cycle; 432
(vi) N (CY C n ) = 0. 433
Proposition 3.7. Let N T G : (V, E, σ, µ) be a strong-star-neutrosophic graph with

center c. Then
N (ST R1,σ2 ) = 0.
32/47
Proof. Suppose ST R1,σ2 : (V, E, σ, µ) is a strong-star-neutrosophic graph. Every vertex
isn’t a neighbor for every given vertex. Every vertex is a neighbor for center.
Furthermore, center is only neighbor for any given vertex. So center is only neighbor for
all vertices. It’s possible to have some paths amid two given vertices but there’s no crisp
cycle. In other words, if O(ST R1,σ2 ) > 2, then there are at least three vertices x, y and
z such that if x is a neighbor for y and z, then y and z aren’t neighbors and x is center.
To get more precise, if x and y are neighbors then either x or y is center. Every edge
have one common endpoint with other edges which is called center. Thus there is no
triangle but there are some edges. One edge has two endpoints which one of them is
center. There are no crisp cycle. Hence trying to find longest cycle containing all
vertices once, has no result. There is no crisp cycle. Then there is longest crisp cycle
containing all vertices once. So
N (ST R1,σ2 ) = 0.
434
The clarifications about results are in progress as follows. A star-neutrosophic graph 435
is related to previous result and it’s studied to apply the definitions on it. To make it 436
more clear, next part gives one special case to apply definitions and results on it. Some 437
items are devised to make more sense about new notions. A star-neutrosophic graph is 438
related to previous result and it’s studied to apply the definitions on it, too. 439
star-neutrosophic graph is illustrated. Some points are represented in follow-up items as 441
follows. 442

crisp cycle. It’s only a star and it’s only one edge but it is neither crisp cycle nor
neutrosophic cycle. The length of this star implies there’s no cycle since if the
have cycle. So this neutrosophic star has neither a neutrosophic cycle nor crisp
cycle. The length of this star implies
n1 , n2

crisp cycle. It’s also a star and there are two edges, n1 n2 and n1 n3 , according to
corresponded neutrosophic star but it doesn’t have neutrosophic cycle. First step
is to have at least one crisp cycle for finding longest cycle containing all vertices
once. Finding longest cycle containing all vertices once, has no result. Since
there’s no cycle. Neutrosophic cycle is a crisp cycle with at least two weakest
edges. So this neutrosophic star has neither a neutrosophic cycle nor crisp cycle.
The structure of this neutrosophic star implies
n1 , n2 , n3
(iii) if n1 , n2 , n3 , n4 is a sequence of consecutive vertices, then it’s obvious that there’s

no crisp cycle. It’s also a star and there are three edges, n1 n2 , n1 n3 and n1 n4 ,
according to corresponded neutrosophic star but it doesn’t have neutrosophic
33/47
cycle.
containing all vertices once. Finding longest cycle containing all vertices once, has
crisp cycle. So adding vertices has no effect to find a crisp cycle. The structure of
this neutrosophic star implies
n1 , n2 , n3 , n4

there’s no crisp cycle. It’s also a star and there are four edges, n1 n2 , n1 n3 , n1 n4
and n1 n5 , according to corresponded neutrosophic star but it isn’t neutrosophic
crisp cycle. So adding vertices has no effect to find a crisp cycle. There are some
paths amid two given vertices. The structure of this neutrosophic star implies
n1 , n2 , n3 , n4 , n5
(v) M(ST R1,σ2 ) : Not Existed is hamiltonian neutrosophic cycle and there is no 451
corresponded set; 452
(vi) N (ST R1,σ2 ) = 0 is n-hamiltonian neutrosophic cycle. 453
Proposition 3.9. Let N T G : (V, E, σ, µ) be a strong-complete-bipartite-neutrosophic

graph. Then
O(CM Cσ1 ,σ2 )
N (CM Cσ1 ,σ2 ) =
2
where O(CM Cσ1 ,σ2 ) ≥ 4, |V1 | = |V2 | ≥ 3, v2i+1 ∈ V1 v2i ∈ V2 . And
N (CM Cσ1 ,σ2 ) = 0
where O(CM Cσ1 ,σ2 ) ≤ 3. 454
34/47
Proof. Suppose CM Cσ1 ,σ2 : (V, E, σ, µ) is a strong-complete-bipartite-neutrosophic
graph. Every vertex is a neighbor for all vertices in another part. If O(CM Cσ1 ,σ2 ) ≤ 3,
then it’s neutrosophic path implying
N (CM Cσ1 ,σ2 ) = 0.
If O(CM Cσ1 ,σ2 ) ≥ 4, then it’s possible to have two vertices in every part. In this case,
four vertices form a crisp cycle which crisp cardinality of its vertices are four. It’s
impossible to have a crisp cycle which crisp cardinality of its vertices are three. Since the
sequence of consecutive vertices are x1 , x2 , x3 and there’s no edge more. It implies there
are two edges. It’s neutrosophic path but neither crisp cycle nor neutrosophic cycle. So
the first step of finding longest cycle containing all vertices once, is impossible but in
second step, there’s one crisp cycle corresponded to number four. By Theorem (1.9),
O(CM Cσ1 ,σ2 )
N (CM Cσ1 ,σ2 ) =
2
where O(CM Cσ1 ,σ2 ) ≥ 4, |V1 | = |V2 | ≥ 3, v2i+1 ∈ V1 v2i ∈ V2 . And
N (CM Cσ1 ,σ2 ) = 0
where O(CM Cσ1 ,σ2 ) ≤ 3. 455
complete-bipartite-neutrosophic graph is related to previous result and it’s studied to 457
apply definitions and results on it. Some items are devised to make more senses about 459
new notions. A complete-bipartite-neutrosophic graph is related to previous result and 460
complete-bipartite-neutrosophic graph is illustrated. Some points are represented in 463

crisp cycle. It’s only a complete-bipartite and it’s only one edge but it is neither
crisp cycle nor neutrosophic cycle. The length of this complete-bipartite implies
2, then it’s impossible to have cycle. So this neutrosophic complete-bipartite has
neither a neutrosophic cycle nor crisp cycle. The length of this complete-bipartite
implies
n1 , n2

n1 , n2 , n3
35/47
n1 , n2 , n4

there’s one crisp cycle. It’s also a complete-bipartite and there are four edges,
complete-bipartite and it has neutrosophic cycle where n2 n4 and n3 n4 are two
weakest edges with same amount (0.3, 0.2, 0.3). First step is to have at least one
crisp cycle for finding longest cycle containing all vertices once. Finding longest
cycle containing all vertices once, only has one result. Since there’s one cycle.
neutrosophic complete-bipartite has both of a neutrosophic cycle and crisp cycle.
So adding vertices has some effects to find a crisp cycle. The structure of this
neutrosophic complete-bipartite implies
n1 , n2 , n3 , n4 , n1
is corresponded to hamiltonian neutrosophic cycle M(CM Cσ1 ,σ2 ) and uniqueness

of this cycle implies the sequence
n1 , n2 , n3 , n4 , n1
is corresponded to n-hamiltonian neutrosophic cycle N (CM Cσ1 ,σ2 ); 471
(v) M(CM Cσ1 ,σ2 ) : n1 , n2 , n3 , n4 , n1 is hamiltonian neutrosophic cycle and all edges 472
are used. Thus there’s no edge to be unused; 473
(vi) N (CM Cσ1 ,σ2 ) = 1 is n-hamiltonian neutrosophic cycle and all edges are used. 474
Thus there’s no edge to be unused. 475
Proposition 3.11. Let N T G : (V, E, σ, µ) be a strong-complete-t-partite-neutrosophic

graph. Then
O(CM Cσ1 ,σ2 ,··· ,σt )
N (CM Cσ1 ,σ2 ,··· ,σt ) =
2
where t ≥ 3, |Vi | = |Vj | ≥ 3.
O(CM Cσ1 ,σ2 ,··· ,σt )

N (CM Cσ1 ,σ2 ,··· ,σt ) =
2
N (CM Cσ1 ,σ2 ,··· ,σt ) = 0
where O(CM Cσ1 ,σ2 ,··· ,σt ) ≤ 2. 476
36/47
Figure 17. A Neutrosophic Graph in the Viewpoint of n-hamiltonian neutrosophic
cycle.
Proof. Suppose CM Cσ1 ,σ2 ,··· ,σt : (V, E, σ, µ) is a strong-complete-t-partite-neutrosophic

graph. Every vertex is a neighbor for all vertices in another part. If
O(CM Cσ1 ,σ2 ,··· ,σt ) ≤ 2, then it’s neutrosophic path implying
N (CM Cσ1 ,σ2 ,··· ,σt ) = 0
If t ≥ 3, O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 3, then it has crisp cycle implying
O(CM Cσ1 ,σ2 ,··· ,σt )

N (CM Cσ1 ,σ2 ,··· ,σt ) =
2
If t ≥ 2, O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 4, then it’s possible to have two vertices in every part. In
this case, four vertices form a crisp cycle which crisp cardinality of its vertices are four.
It’s impossible to have a crisp cycle which crisp cardinality of its vertices are three.
Since the sequence of consecutive vertices are x1 , x2 , x3 and there’s no edge more. It
implies there are two edges. It’s neutrosophic path but neither crisp cycle nor
neutrosophic cycle. So the first step of finding longest cycle containing all vertices once,
is impossible but in second step, there’s one crisp cycle corresponded to number four.
By Theorem (1.9),
O(CM Cσ1 ,σ2 ,··· ,σt )
N (CM Cσ1 ,σ2 ,··· ,σt ) =
2
where t ≥ 3, |Vi | = |Vj | ≥ 3.
O(CM Cσ1 ,σ2 ,··· ,σt )

N (CM Cσ1 ,σ2 ,··· ,σt ) =
2
N (CM Cσ1 ,σ2 ,··· ,σt ) = 0
where O(CM Cσ1 ,σ2 ,··· ,σt ) ≤ 2. 477
complete-t-partite-neutrosophic graph is related to previous result and it’s studied to 479
apply definitions and results on it. Some items are devised to make more sense about 481
new notions. A complete-t-partite-neutrosophic graph is related to previous result and 482
37/47
complete-t-partite-neutrosophic graph is illustrated. Some points are represented in 485

crisp cycle. It’s only a complete-t-partite and it’s only one edge but it is neither
crisp cycle nor neutrosophic cycle. The length of this complete-t-partite implies
2, then it’s impossible to have cycle. So this neutrosophic complete-t-partite has
neither a neutrosophic cycle nor crisp cycle. The length of this complete-t-partite
implies
n1 , n2

n1 , n2 , n3

n1 , n2 , n4

there’s one crisp cycle. It’s also a complete-t-partite and there are four edges,
complete-t-partite and it has neutrosophic cycle where n2 n4 and n5 n4 are two
weakest edge with same amount (0.3, 0.2, 0.3). First step is to have at least one
crisp cycle for finding longest cycle. Finding longest cycle. only has one result.
Since there’s one cycle. But finding longest cycle containing all vertices once, has
no result. Since the vertex n3 isn’t in intended sequence. Neutrosophic cycle is a
crisp cycle with at least two weakest edges. So this neutrosophic
complete-t-partite has both of a neutrosophic cycle and crisp cycle. So adding
38/47
cycle.
vertices has some effects to find a crisp cycle. The structure of this neutrosophic
n1 , n2 , n4 , n5 , n1
|V1 | =
n1 , n2 , n4 , n5 , n1
Proposition 3.13. Let N T G : (V, E, σ, µ) be a strong-wheel-neutrosophic graph. Then
N (W HL1,σ2 ) = 1
where t ≥ 3.
N (W HL1,σ2 ) = 0
where t ≥ 2. 496
Proof. Suppose W HL1,σ2 : (V, E, σ, µ) is a strong-wheel-neutrosophic graph. The

argument is elementary. Since all vertices of a path join to one vertex. By Theorem
(1.9),
N (W HL1,σ2 ) = 1
where t ≥ 3.
N (W HL1,σ2 ) = 0
where t ≥ 2. 497
strong-wheel-neutrosophic graph is related to previous result and it’s studied to apply 499
the definitions on it. To make it more clear, next part gives one special case to apply 500
definitions and results on it. Some items are devised to make more sense about new 501
notions. A strong-wheel-neutrosophic graph is related to previous result and it’s studied 502
to apply the definitions on it, too. 503
39/47
wheel-neutrosophic graph is illustrated. Some points are represented in follow-up items 505
as follows. 506
(i) If s1 , s2 is a sequence of consecutive vertices, then it’s obvious that there’s no

crisp cycle. It’s only a wheel and it’s only one edge but it is neither crisp cycle nor
neutrosophic cycle. The length of this wheel implies there’s no cycle since if the
have cycle. So this neutrosophic wheel has neither a neutrosophic cycle nor crisp
cycle. The length of this wheel implies
s1 , s2
(ii) if s4 , s2 , s3 is a sequence of consecutive vertices, then it’s obvious that there’s no

crisp cycle. It’s also a wheel and there are two edges, s3 s2 and s4 s3 , according to
corresponded neutrosophic wheel but it doesn’t have neutrosophic cycle. First
step is to have at least one crisp cycle for finding longest cycle containing all
vertices once. Finding longest cycle containing all vertices once has no result.
Since there’s no cycle. Neutrosophic cycle is a crisp cycle with at least two
weakest edges. So this neutrosophic wheel has neither a neutrosophic cycle nor
s4 , s2 , s3
(iii) if s1 , s2 , s3 , s1 is a sequence of consecutive vertices, then it’s obvious that there’s

according to corresponded neutrosophic wheel but it doesn’t have neutrosophic
one result. Since there’s one crisp cycle. Neutrosophic cycle is a crisp cycle with
at least two weakest edges. So this neutrosophic wheel has no neutrosophic cycle
but it has crisp cycle. The structure of this neutrosophic wheel implies
s1 , s2 , s3 , s1
isn’t corresponded to hamiltonian neutrosophic cycle M(N T G) and this structure

also implies
s1 , s2 , s3 , s1
(iv) if s1 , s3 , s4 , s1 is a sequence of consecutive vertices, then it’s obvious that there’s

according to corresponded neutrosophic wheel and it has a neutrosophic cycle.
Since there’s one crisp cycle. Neutrosophic cycle is a crisp cycle with at least two
weakest edges. So this neutrosophic wheel has one neutrosophic cycle with two
weakest edges s1 s4 and s3 s4 concerning same values (0.1, 0.1, 0.5) and it has a
s1 , s3 , s4 , s1
40/47
cycle.
isn’t corresponded to hamiltonian neutrosophic cycle M(N T G). First step is to

have at least one crisp cycle for finding longest cycle containing all vertices once.
Finding longest cycle containing all vertices once has no result. Since the vertex
s5 is unused in the sequence. Also, this reason implies
s1 , s3 , s4 , s1
(v) M(CY C n ) : s1 , s3 , s4 , s5 , s1 is hamiltonian neutrosophic cycle; 513
4 Applications in Time Table and Scheduling 515
In this section, two applications for time table and scheduling are provided where the 516
models are either complete models which mean complete connections are formed as 517
individual and family of complete models with common neutrosophic vertex set or 518
quasi-complete models which mean quasi-complete connections are formed as individual 519
and family of quasi-complete models with common neutrosophic vertex set. 520
Designing the programs to achieve some goals is general approach to apply on some 521
issues to function properly. Separation has key role in the context of this style. 522
Separating the duration of work which are consecutive, is the matter and it has 523
importance to avoid mixing up. 524
Step 1. (Definition) Time table is an approach to get some attributes to do the 525
work fast and proper. The style of scheduling implies special attention to the 526
tasks which are consecutive. 527
Step 2. (Issue) Scheduling of program has faced with difficulties to differ amid 528
consecutive sections. Beyond that, sometimes sections are not the same. 529
Step 3. (Model) The situation is designed as a model. The model uses data to assign 530
every section and to assign to relation amid sections, three numbers belong unit 531
interval to state indeterminacy, possibilities and determinacy. There’s one 532
restriction in that, the numbers amid two sections are at least the number of the 533
relations amid them. Table (1), clarifies about the assigned numbers to these 534
situations. 535
41/47
Table 1. Scheduling concerns its Subjects and its Connections as a neutrosophic graph
in a Model.
Sections of N T G n1 n2 · · · n5
Values (0.7, 0.9, 0.3) (0.4, 0.2, 0.8)· · · (0.4, 0.2, 0.8)
Connections of N T G E1 E2 · · · E6
Values (0.4, 0.2, 0.3) (0.5, 0.2, 0.3)· · · (0.3, 0.2, 0.3)

cycle and its n-hamiltonian neutrosophic cycle
4.1 Case 1: Complete-t-partite Model alongside its 536
hamiltonian neutrosophic cycle and its n-hamiltonian 537
neutrosophic cycle 538
Step 4. (Solution) The neutrosophic graph alongside its hamiltonian neutrosophic 539
cycle and its n-hamiltonian neutrosophic cycle as model, propose to use specific 540
number. Every subject has connection with some subjects. Thus the connection is 541
applied as possible and the model demonstrates quasi-full connections as 542
quasi-possible. Using the notion of strong on the connection amid subjects, causes 543
the importance of subject goes in the highest level such that the value amid two 544
consecutive subjects, is determined by those subjects. If the configuration is star, 545
the number is different. Also, it holds for other types such that complete, wheel, 546
path, and cycle. The collection of situations is another application of its 547
hamiltonian neutrosophic cycle and its n-hamiltonian neutrosophic cycle when the 548
notion of family is applied in the way that all members of family are from same 549
classes of neutrosophic graphs. As follows, There are five subjects which are 550
represented as Figure (20). This model is strong and even more it’s 551
quasi-complete. And the study proposes using specific number which is called its 552
hamiltonian neutrosophic cycle and its n-hamiltonian neutrosophic cycle. There 553
are also some analyses on other numbers in the way that, the clarification is 554
gained about being special number or not. Also, in the last part, there is one 555
neutrosophic number to assign to this model and situation to compare them with 556
same situations to get more precise. Consider Figure (20). In Figure (20), an 557
complete-t-partite-neutrosophic graph is illustrated. Some points are represented 558
in follow-up items as follows. 559

no crisp cycle. It’s only a complete-t-partite and it’s only one edge but it is
neither crisp cycle nor neutrosophic cycle. The length of this
42/47
complete-t-partite implies there’s no cycle since if the length of a sequence of
consecutive vertices is at most 2, then it’s impossible to have cycle. So this
neutrosophic complete-t-partite has neither a neutrosophic cycle nor crisp
cycle. The length of this complete-t-partite implies
n1 , n2
is corresponded to neither hamiltonian neutrosophic cycle 560
M(CM Cσ1 ,σ2 ,··· ,σt ) nor n-hamiltonian neutrosophic cycle 561
N (CM Cσ1 ,σ2 ,··· ,σt ); 562

there’s no crisp cycle. It’s also a complete-t-partite and there are two edges,
n1 n2 and n1 n3 , according to corresponded neutrosophic complete-t-partite
but it doesn’t have neutrosophic cycle. First step is to have at least one crisp
cycle containing all vertices once has no result. Since there’s no cycle.
cycle. The structure of this neutrosophic complete-t-partite implies
n1 , n2 , n3
N (CM Cσ1 ,σ2 ,··· ,σt ); 565
(iii) if n1 , n2 , n4 is a sequence of consecutive vertices, then it’s obvious that

there’s no crisp cycle. It’s also a complete-t-partite and there are two edges,
n1 n2 and n2 n4 , according to corresponded neutrosophic complete-t-partite
but it doesn’t have neutrosophic cycle. First step is to have at least one crisp
cycle containing all vertices once has no result. Since there’s no cycle.
cycle. The structure of this neutrosophic complete-t-partite implies
n1 , n2 , n4
N (CM Cσ1 ,σ2 ,··· ,σt ); 568

that there’s one crisp cycle. It’s also a complete-t-partite and there are four
edges, n1 n2 , n2 n4 , n4 n5 and n5 n1 , according to corresponded neutrosophic
complete-t-partite and it has neutrosophic cycle where n2 n4 and n5 n4 are
two weakest edge with same amount (0.3, 0.2, 0.3). First step is to have at
least one crisp cycle for finding longest cycle. Finding longest cycle. only has
one result. Since there’s one cycle. But finding longest cycle containing all
vertices once, has no result. Since the vertex n3 isn’t in intended sequence.
neutrosophic complete-t-partite has both of a neutrosophic cycle and crisp
cycle. So adding vertices has some effects to find a crisp cycle. The structure
of this neutrosophic complete-t-partite implies
n1 , n2 , n4 , n5 , n1
43/47
cycle and its n-hamiltonian neutrosophic cycle
|V1 | =
n1 , n2 , n4 , n5 , n1
4.2 Case 2: Complete Model alongside its A Neutrosophic 572
Graph in the Viewpoint of its hamiltonian neutrosophic 573
cycle and its n-hamiltonian neutrosophic cycle 574
Step 4. (Solution) The neutrosophic graph alongside its hamiltonian neutrosophic 575
cycle and its n-hamiltonian neutrosophic cycle as model, propose to use specific 576
number. Every subject has connection with every given subject in deemed way. 577
Thus the connection applied as possible and the model demonstrates full 578
connections as possible between parts but with different view where symmetry 579
amid vertices and edges are the matters. Using the notion of strong on the 580
connection amid subjects, causes the importance of subject goes in the highest 581
level such that the value amid two consecutive subjects, is determined by those 582
subjects. If the configuration is complete multipartite, the number is different. 583
Also, it holds for other types such that star, wheel, path, and cycle. The collection 584
of situations is another application of its hamiltonian neutrosophic cycle and its 585
n-hamiltonian neutrosophic cycle when the notion of family is applied in the way 586
that all members of family are from same classes of neutrosophic graphs. As 587
follows, There are four subjects which are represented in the formation of one 588
model as Figure (21). This model is neutrosophic strong as individual and even 589
more it’s complete. And the study proposes using specific number which is called 590
its hamiltonian neutrosophic cycle and its n-hamiltonian neutrosophic cycle for 591
this model. There are also some analyses on other numbers in the way that, the 592
clarification is gained about being special number or not. Also, in the last part, 593
there is one neutrosophic number to assign to these models as individual. A model 594
as a collection of situations to compare them with another model as a collection of 595
situations to get more precise. Consider Figure (21). There is one section for 596
clarifications. 597

44/47
n1 , n2
(ii) if n1 , n2 , n3 , n1 is a sequence of consecutive vertices, then it’s obvious that

there’s one crisp cycle. It’s also a path and there are three edges but it isn’t
neutrosophic cycle. The length of crisp cycle implies there’s one cycle since if
the length of a sequence of consecutive vertices is at most 3, then it’s
possible to have cycle but there aren’t two weakest edges which imply there
is no neutrosophic cycle. So this crisp cycle isn’t a neutrosophic cycle but it’s
crisp cycle. The crisp length of this crisp cycle implies
n1 , n2 , n3 , n1

n1 , n2 , n3 , n1
(iii) if n1 , n2 , n3 , n4 , n1 is a sequence of consecutive vertices, then it’s obvious

that there’s two crisp cycles with length two and three. It’s also a path and
there are three edges but there are some crisp cycles but there are only two
neutrosophic cycles with length three, n1 , n3 , n4 , and with length four,
n1 , n2 , n3 , n4 . The length of this sequence implies there are some crisp cycles
and there are two neutrosophic cycles since if the length of a sequence of
consecutive vertices is at most 4 and it’s crisp complete, then it’s possible to
have some crisp cycles and two neutrosophic cycles with two different length
three and four. So this neutrosophic path forms some neutrosophic cycles
and some crisp cycles. The length of this path, four, implies
n1 , n2 , n3 , n4 , n1
is corresponded to hamiltonian neutrosophic cycle M(CM T σ ) and it’s 601
effective to construct n-hamiltonian neutrosophic cycle N (CM T σ ); 602
(iv) if n1 , n3 , n4 , n1 is a sequence of consecutive vertices, then it’s obvious that

there’s one crisp cycle. It’s also a path and there are three edges but it is also
neutrosophic cycle. The length of crisp cycle implies there’s one cycle since if
the length of a sequence of consecutive vertices is at most 3, then it’s possible
to have cycle but there are two weakest edges, n3 n4 and n1 n4 , which imply
there is one neutrosophic cycle. So this crisp cycle is a neutrosophic cycle
and it’s crisp cycle. The crisp length of this neutrosophic cycle, three, implies
n1 , n3 , n4 , n1
isn’t corresponded to hamiltonian neutrosophic cycle M(CM T σ ). The vertex,

n2 , isn’t in sequence related to this neutrosophic cycle. Thus it implies
n1 , n3 , n4 , n1
45/47
corresponded sets. are the sequences which have both the edges n1 n4 and 605
n3 n4 . Since these edges are two weakest edges in this complete-neutrosophic 606
graph. Other sequences even if they’re cycles having all vertices, once, are 607
hamiltonian cycles and not hamiltonian neutrosophic cycles; 608
5 Open Problems 610
In this section, some questions and problems are proposed to give some avenues to 611
pursue this study. The structures of the definitions and results give some ideas to make 612
new settings which are eligible to extend and to create new study. 613
Notion concerning its hamiltonian neutrosophic cycle and its n-hamiltonian 614
neutrosophic cycle are defined in neutrosophic graphs. Neutrosophic number is also 615
reused. Thus, 616
Question 5.1. Is it possible to use other types of its hamiltonian neutrosophic cycle 617
and its n-hamiltonian neutrosophic cycle? 618
Question 5.2. Are existed some connections amid different types of its hamiltonian 619
neutrosophic cycle and its n-hamiltonian neutrosophic cycle in neutrosophic graphs? 620
Question 5.3. Is it possible to construct some classes of neutrosophic graphs which 621
have “nice” behavior? 622
Question 5.4. Which mathematical notions do make an independent study to apply 623
these types in neutrosophic graphs? 624
Problem 5.5. Which parameters are related to this parameter? 625
Problem 5.6. Which approaches do work to construct applications to create 626
independent study? 627
Problem 5.7. Which approaches do work to construct definitions which use all 628
definitions and the relations amid them instead of separate definitions to create 629
independent study? 630
6 Conclusion and Closing Remarks 631
In this section, concluding remarks and closing remarks are represented. The drawbacks 632
of this article are illustrated. Some benefits and advantages of this study are highlighted. 633
This study uses two definitions concerning hamiltonian neutrosophic cycle and 634
n-hamiltonian neutrosophic cycle arising from finding and counting longest neutrosophic 635
cycles containing all vertices once to study strong neutrosophic graphs based on 636
neutrosophic cycles and neutrosophic graphs based on crisp cycles. New neutrosophic 637
number is reused which is too close to the notion of neutrosophic number but it’s 638
different since it uses all values as type-summation on them. Comparisons amid number, 639
corresponded vertices and edges are done by using neutrosophic tool. The connections 640
of vertices which aren’t clarified by a neutrosophic cycle differ them from each other 641
and put them in different categories to represent a number which is called hamiltonian 642
neutrosophic cycle and n-hamiltonian neutrosophic cycle arising from finding and 643
counting longest neutrosophic cycles containing all vertices once in strong neutrosophic 644
graphs based on neutrosophic cycles and in neutrosophic graphs based on crisp cycles. 645
Further studies could be about changes in the settings to compare these notions amid 646
46/47
Table 2. A Brief Overview about Advantages and Limitations of this Study
Advantages Limitations
1. n-hamiltonian neutrosophic cycle 1. Connections amid Classes
2. hamiltonian neutrosophic cycle
3. Neutrosophic Number 2. Study on Families
4. Classes of (Strong) Neutrosophic Graphs
5. Counting Crisp Cycles and Neutrosophic Cycles 3. Same Models in Family
different settings of strong neutrosophic graphs theory. One way is finding some 647
relations amid all definitions of notions to make sensible definitions. In Table (2), some 648
limitations and advantages of this study are pointed out. 649
References 650
1. Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: 651
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 652
United States. ISBN: 978-1-59973-725-6 653
(http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 654
2. Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number ”, 655
Preprints 2021, 2021120177 (doi: 10.20944/preprints202112.0177.v1). 656
3. Henry Garrett, “Closing Numbers and Super-Closing Numbers as 657
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 658
(Neutrosophic)n-SuperHyperGraph”, Preprints 2022, 2022010145 (doi: 659
10.20944/preprints202201.0145.v1). 660
4. Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, 661
5. Henry Garrett, “Different Types of Neutrosophic Chromatic Number ”, Preprints 663
2021, 2021120335 (doi: 10.20944/preprints202112.0335.v1). 664
6. Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic 665
Hypergraphs”, Preprints 2021, 2021120448 (doi: 666
10.20944/preprints202112.0448.v1). 667
7. Henry Garrett, “e-Matching Number and e-Matching Polynomials in 668
Neutrosophic Graphs, ResearchGate 2022 (doi: 10.13140/RG.2.2.32516.60805). 669
8. Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 670
2022020334 (doi: 10.20944/preprints202202.0334.v1). 671
9. Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) 672
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.36280.83204). 673
10. Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness 674
and (Strong) Edges”, Preprints 2022, 2022010239 (doi: 675
10.20944/preprints202201.0239.v1). 676
11. Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, 677
47/47
View publication stats

Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs

Uploaded by

Document Information

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

Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs

Uploaded by

Copyright:

Available Formats

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

Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs

Preprint · March 2022

122 PUBLICATIONS 126 CITATIONS

Neutrosophic Graphs View project

On Combinatorics View project

The user has requested enhancement of the downloaded file.

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

Keywords: Hamiltonian Neutrosophic Cycles, n-Hamiltonian Neutrosophic Cycles,

and super-closing numbers as (dual)resolving and (dual)coloring alongside 3

(dual)dominating in (neutrosophic)n-SuperHyperGraph in Ref. [3], co-degree and 4

degree of classes of neutrosophic hypergraphs in Ref. [4], different types of neutrosophic 5

chromatic number in Ref. [5], dimension and coloring alongside domination in 6

neutrosophic hypergraphs in Ref. [6], e-matching number and e-matching polynomials 7

some polynomials related to numbers in classes of (strong) neutrosophic graphs in 9

as a book in Ref. [1]. 13

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

background of this study. 15

1.1 Motivation and Contributions 16

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

Question 1.1. Is it possible to use mixed versions of ideas concerning “n-hamiltonian 18

neutrosophic cycle”, “hamiltonian neutrosophic cycle” and “(Strong) Neutrosophic 19

Graph” to define some notions which are applied to neutrosophic graphs? 20

to assign hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle arising 24

strong neutrosophic graphs based on neutrosophic cycles and in neutrosophic graphs 26

structure of hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle 28

once in strong neutrosophic graphs based on neutrosophic cycles and in neutrosophic 30

numbers, hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle arising 33

strong neutrosophic graphs based on neutrosophic cycles and in neutrosophic graphs 35

to extend these notions. 38

The framework of this study is as follows. In the beginning, I introduce basic 39

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

hamiltonian neutrosophic cycle and n-hamiltonian neutrosophic cycle arising from 41

neutrosophic graphs based on neutrosophic cycles and in neutrosophic graphs based on 43

“Preliminaries”, sequence of consecutive vertices forming neutrosophic cycles and crisp 45

about the basic notions of hamiltonian neutrosophic cycle and n-hamiltonian 47

strong neutrosophic graphs based on neutrosophic cycles and in neutrosophic graphs 53

based on crisp cycles, in section “Setting of hamiltonian neutrosophic cycle,” as 54

individuals. In section “Setting of hamiltonian neutrosophic cycle,” hamiltonian 55

statements, remarks, examples and clarifications about some classes of (strong) 57

neutrosophic graphs namely strong-path-neutrosophic graphs, 58

(strong-)cycle-neutrosophic graphs, complete-neutrosophic graphs, 59

(strong-)star-neutrosophic graphs, (strong-)complete-bipartite-neutrosophic graphs, 60

(strong-)complete-t-partite-neutrosophic graphs and (strong-)wheel-neutrosophic graphs. 61

The clarifications are also presented in both sections “Setting of hamiltonian 62

neutrosophic cycle,” and “Setting of n-hamiltonian neutrosophic cycle,” for introduced 63

applications are posed for quasi-complete and complete notions, namely 65

complete-neutrosophic graphs and (strong-)complete-t-neutrosophic graphs concerning 66

Closing Remarks”, gentle discussion about results and applications is featured. In 70

limitations of this study alongside conclusions is formed. 72

ideas and their clarifications are elicited. 75

Definition 1.2. (Graph). 77

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

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

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

follows. Also, some related notions are demonstrated. 82

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

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

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

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

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

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

(iii) : connectedness amid vertices x0 and xt is

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