New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/369787658
New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By

Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy
Preprint · April 2023

DOI: 10.5281/zenodo.7799902
CITATIONS
1 author:
Henry Garrett
421 PUBLICATIONS 9,876 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Algebraic Structures and Algebraic Hyperstructures View project
Metric Dimension in fuzzy(neutrosophic) Graphs View project
All content following this page was uploaded by Henry Garrett on 04 April 2023.
The user has requested enhancement of the downloaded file.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
New Ideas In Recognition of Cancer And Neutrosophic 2
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As 3
Hyper Hamper On Super Hammy 4
Henry Garrett · Independent Researcher · Department of Mathematics · 6
DrHenryGarrett@gmail.com · Manhattan, NY, USA 7
1 ABSTRACT 8
In this scientific research, (Different Neutrosophic Types of Neutrosophic 9
SuperHyperHamiltonian-Type-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) 10
S is a Hamiltonian-Type-Cycle-Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet 11
V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 12
Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called 13
Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 14
∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called 15
Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 16
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 17
v-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutrosophic 18
v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 19
∀Va ∈ C : C is
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called 20
Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 21
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 22
SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 23
e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, 24
Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic 25
rv-SuperHyperHamiltonian-Type-Cycle-Cut. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Cut). 26
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 27
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an 28
Extreme SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 29
rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 32
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 33
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 34
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 35
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; a Neutrosophic 36
SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 37
rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 40
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 41
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 42
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 43
Neutrosophic SuperHyperVertices such that they form the Neutrosophic 44
SuperHyperHamiltonian-Type-Cycle-Cut; an Extreme SuperHyperHamiltonian-Type-Cycle-Cut 45
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, 46
Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 47
v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic 48
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 50
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 51
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 52
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 53
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is 54
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 55
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 60
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 61
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 62
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 63
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 64
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is 65
corresponded to its Neutrosophic coefficient; an Extreme 66
V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 67
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 71
of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 72
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 73
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; a Neutrosophic 74
V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 75
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 79
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 80
SuperHyperHamiltonian-Type-Cycle-Cut; an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut 83
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 89
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 90
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 91
SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; 92
and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 93
SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 94
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 98
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 99
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 100
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is 103
corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 104
introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Type-Cycle-Cut and 105
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. Two different types of 106
SuperHyperDefinitions are debut for them but the research goes further and the 107
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are 108
well-defined and well-reviewed. The literature review is implemented in the whole of 109
this research. For shining the elegancy and the significancy of this research, the 110
comparison between this SuperHyperNotion with other SuperHyperNotions and 111
fundamental SuperHyperNumbers are featured. The definitions are followed by the 112
examples and the instances thus the clarifications are driven with different tools. The 113
applications are figured out to make sense about the theoretical aspect of this ongoing 114
research. The “Cancer’s Recognition” are the under research to figure out the 115
challenges make sense about ongoing and upcoming research. The special case is up. 116
The cells are viewed in the deemed ways. There are different types of them. Some of 117
them are individuals and some of them are well-modeled by the group of cells. These 118
types are all officially called “SuperHyperVertex” but the relations amid them all 119
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 120
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 121
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 122
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are 123
posed to pursue this research. It’s also officially collected in the form of some questions 124
and some problems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then 125
δ−SuperHyperHamiltonian-Type-Cycle-Cut is a maximal of SuperHyperVertices with a 126
maximum cardinality such that either of the following expressions hold for the 127
(Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there are 128
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 129
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 130
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Cut 131
is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 132
cardinality such that either of the following expressions hold for the Neutrosophic 133
cardinalities of SuperHyperNeighbors of s ∈ S there are: 134
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 135
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, 136
holds if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds 137
if S is a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” 138
version of a SuperHyperHamiltonian-Type-Cycle-Cut . Since there’s more ways to get 139
type-results to make a SuperHyperHamiltonian-Type-Cycle-Cut more understandable. For the 140
sake of having Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, there’s a need to 141
“redefine” the notion of a “SuperHyperHamiltonian-Type-Cycle-Cut ”. The SuperHyperVertices 142
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. 143
In this procedure, there’s the usage of the position of labels to assign to the values. 144
Assume a SuperHyperHamiltonian-Type-Cycle-Cut . It’s redefined a Neutrosophic 145
SuperHyperHamiltonian-Type-Cycle-Cut if the mentioned Table holds, concerning, “The Values 146
of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The 147
Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 148
The Number of Position in Alphabet”, “The Values of The SuperVertices&The 149
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of 150
Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 151
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get 152
structural examples and instances, I’m going to introduce the next SuperHyperClass of 153
SuperHyperGraph based on a SuperHyperHamiltonian-Type-Cycle-Cut . It’s the main. It’ll be 154
disciplinary to have the foundation of previous definition in the kind of 155
SuperHyperClass. If there’s a need to have all SuperHyperHamiltonian-Type-Cycle-Cut until the 156
SuperHyperHamiltonian-Type-Cycle-Cut, then it’s officially called a 157
“SuperHyperHamiltonian-Type-Cycle-Cut” but otherwise, it isn’t a 158
SuperHyperHamiltonian-Type-Cycle-Cut . There are some instances about the clarifications for 159
the main definition titled a “SuperHyperHamiltonian-Type-Cycle-Cut ”. These two examples get 160
more scrutiny and discernment since there are characterized in the disciplinary ways of 161
the SuperHyperClass based on a SuperHyperHamiltonian-Type-Cycle-Cut . For the sake of 162
having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, there’s a need to “redefine” the 163
notion of a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut” and a “Neutrosophic 164
SuperHyperHamiltonian-Type-Cycle-Cut ”. The SuperHyperVertices and the SuperHyperEdges 165
are assigned by the labels from the letters of the alphabets. In this procedure, there’s 166
the usage of the position of labels to assign to the values. Assume a Neutrosophic 167
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended 168
Table holds. And a SuperHyperHamiltonian-Type-Cycle-Cut are redefined to a “Neutrosophic 169
SuperHyperHamiltonian-Type-Cycle-Cut” if the intended Table holds. It’s useful to define 170
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get 171
Neutrosophic type-results to make a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 172
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some 173
Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 174
SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, 175
SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 176
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut”, “Neutrosophic 177
SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic 178
SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 179
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut” 180
where it’s the strongest [the maximum Neutrosophic value from all the 181
SuperHyperHamiltonian-Type-Cycle-Cut amid the maximum value amid all SuperHyperVertices 182
from a SuperHyperHamiltonian-Type-Cycle-Cut .] SuperHyperHamiltonian-Type-Cycle-Cut . A graph is 183
a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 184
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are 185
some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 186
intersection amid two given SuperHyperEdges with two exceptions; it’s 187
SuperHyperHamiltonian-Type-Cycle-Cut if it’s only one SuperVertex as intersection amid two 188
given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 189
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as 190
intersection amid two given SuperHyperEdges and these SuperVertices, forming two 191
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 192
only one SuperVertex as intersection amid two given SuperHyperEdges and these 193
SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s a 194
SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 195
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 196
SuperVertex. The SuperHyperModel proposes the specific designs and the specific 197
architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 198
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and 199
“specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the 200
common and intended properties between “specific” cells and “specific group” of cells 201
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 202
degrees of determinacy, indeterminacy, and neutrality to have more precise 203
SuperHyperModel which in this case the SuperHyperModel is called “Neutrosophic”. In 204
the future research, the foundation will be based on the “Cancer’s Recognition” and the 205
results and the definitions will be introduced in redeemed ways. The recognition of the 206
cancer in the long-term function. The specific region has been assigned by the model 207
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 208
identified by this research. Sometimes the move of the cancer hasn’t be easily identified 209
since there are some determinacy, indeterminacy and neutrality about the moves and 210
the effects of the cancer on that region; this event leads us to choose another model [it’s 211
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s 212
happened and what’s done. There are some specific models, which are well-known and 213
they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 214
and the traces of the cancer on the complex tracks and between complicated groups of 215
cells could be fantasized by a Neutrosophic 216
SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, 217
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 218
either the longest SuperHyperHamiltonian-Type-Cycle-Cut or the strongest 219
SuperHyperHamiltonian-Type-Cycle-Cut in those Neutrosophic SuperHyperModels. For the 220
longest SuperHyperHamiltonian-Type-Cycle-Cut, called SuperHyperHamiltonian-Type-Cycle-Cut, and 221
the strongest SuperHyperHamiltonian-Type-Cycle-Cut, called Neutrosophic 222
SuperHyperHamiltonian-Type-Cycle-Cut, some general results are introduced. Beyond that in 223
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 224
not enough since it’s essential to have at least three SuperHyperEdges to form any style 225
of a SuperHyperHamiltonian-Type-Cycle-Cut. There isn’t any formation of any 226
SuperHyperHamiltonian-Type-Cycle-Cut but literarily, it’s the deformation of any 227
SuperHyperHamiltonian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. A basic 228
familiarity with Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut theory, 229
SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 230
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Type-Cycle-Cut, 231
Cancer’s Neutrosophic Recognition 232
AMS Subject Classification: 05C17, 05C22, 05E45 233
2 Applied Notions Under The Scrutiny Of The 234
Motivation Of This Scientific Research 235
In this scientific research, there are some ideas in the featured frameworks of 236
motivations. I try to bring the motivations in the narrative ways. Some cells have been 237
faced with some attacks from the situation which is caused by the cancer’s attacks. In 238
this case, there are some embedded analysis on the ongoing situations which in that, the 239
cells could be labelled as some groups and some groups or individuals have excessive 240
labels which all are raised from the behaviors to overcome the cancer’s attacks. In the 241
embedded situations, the individuals of cells and the groups of cells could be considered 242
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting 243
more proper analysis on this messy story. I’ve found the SuperHyperModels which are 244
officially called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this 245
SuperHyperModel, the cells and the groups of cells are defined as “SuperHyperVertices” 246
and the relations between the individuals of cells and the groups of cells are defined as 247
“SuperHyperEdges”. Thus it’s another motivation for us to do research on this 248
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get 249
worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 250
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy 251
and neutrality, for any object based on vague forms, namely, incomplete data, imprecise 252
data, and uncertain analysis. The latter model could be considered on the previous 253
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 254
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is 255
going to figure out what’s going on this phenomenon. The special case of this disease is 256
considered and as the consequences of the model, some parameters are used. The cells 257
are under attack of this disease but the moves of the cancer in the special region are the 258
matter of mind. The recognition of the cancer could help to find some treatments for 259
this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 260
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background 261
of this research. Sometimes the cancer has been happened on the region, full of cells, 262
groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 263
some SuperHyperNotions based on the connectivities of the moves of the cancer in the 264
forms of alliances’ styles with the formation of the design and the architecture are 265
formally called “ SuperHyperHamiltonian-Type-Cycle-Cut” in the themes of jargons and 266
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 267
figure out the background for the SuperHyperNotions. The recognition of the cancer in 268
the long-term function. The specific region has been assigned by the model [it’s called 269
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this 270
research. Sometimes the move of the cancer hasn’t be easily identified since there are 271
some determinacy, indeterminacy and neutrality about the moves and the effects of the 272
cancer on that region; this event leads us to choose another model [it’s said to be 273
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and 274
what’s done. There are some specific models, which are well-known and they’ve got the 275
names, and some general models. The moves and the traces of the cancer on the 276
complex tracks and between complicated groups of cells could be fantasized by a 277
Neutrosophic SuperHyperPath (-/SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, 278
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 279
either the optimal SuperHyperHamiltonian-Type-Cycle-Cut or the Neutrosophic 280
SuperHyperHamiltonian-Type-Cycle-Cut in those Neutrosophic SuperHyperModels. Some 281
general results are introduced. Beyond that in SuperHyperStar, all possible 282
Neutrosophic SuperHyperPath s have only two SuperHyperEdges but it’s not enough 283
since it’s essential to have at least three SuperHyperEdges to form any style of a 284
SuperHyperHamiltonian-Type-Cycle-Cut. There isn’t any formation of any 285
SuperHyperHamiltonian-Type-Cycle-Cut but literarily, it’s the deformation of any 286
SuperHyperHamiltonian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. 287
Question 2.1. How to define the SuperHyperNotions and to do research on them to 288
find the “ amount of SuperHyperHamiltonian-Type-Cycle-Cut” of either individual of cells or the 289
groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount 290
of SuperHyperHamiltonian-Type-Cycle-Cut” based on the fixed groups of cells or the fixed groups of 291
group of cells? 292
Question 2.2. What are the best descriptions for the “Cancer’s Recognition” in terms 293
of these messy and dense SuperHyperModels where embedded notions are illustrated? 294
It’s motivation to find notions to use in this dense model is titled 295
“SuperHyperGraphs”. Thus it motivates us to define different types of “ 296
SuperHyperHamiltonian-Type-Cycle-Cut” and “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut” 297
on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then the research has 298
taken more motivations to define SuperHyperClasses and to find some connections amid 299
this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 300
instances and examples to make clarifications about the framework of this research. The 301
general results and some results about some connections are some avenues to make key 302
point of this research, “Cancer’s Recognition”, more understandable and more clear. 303
The framework of this research is as follows. In the beginning, I introduce basic 304
definitions to clarify about preliminaries. In the subsection “Preliminaries”, initial 305
definitions about SuperHyperGraphs and Neutrosophic SuperHyperGraph are 306
deeply-introduced and in-depth-discussed. The elementary concepts are clarified and 307
illustrated completely and sometimes review literature are applied to make sense about 308
what’s going to figure out about the upcoming sections. The main definitions and their 309
clarifications alongside some results about new notions, SuperHyperHamiltonian-Type-Cycle-Cut 310
and Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, are figured out in sections “ 311
SuperHyperHamiltonian-Type-Cycle-Cut” and “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut”. 312
In the sense of tackling on getting results and in Hamiltonian-Type-Cycle-Cut to make sense 313
about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 314
SuperHyperUniform are introduced and as their consequences, corresponded 315
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results 316
on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. As going 317
back to origin of the notions, there are some smart steps toward the common notions to 318
extend the new notions in new frameworks, SuperHyperGraph and Neutrosophic 319
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 320
Neutrosophic SuperHyperClasses”. The starter research about the general 321
SuperHyperRelations and as concluding and closing section of theoretical research are 322
contained in the section “General Results”. Some general SuperHyperRelations are 323
fundamental and they are well-known as fundamental SuperHyperNotions as elicited 324
and discussed in the sections, “General Results”, “ SuperHyperHamiltonian-Type-Cycle-Cut”, 325
“Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut”, “Results on SuperHyperClasses” and 326
“Results on Neutrosophic SuperHyperClasses”. There are curious questions about what’s 327
done about the SuperHyperNotions to make sense about excellency of this research and 328
going to figure out the word “best” as the description and adjective for this research as 329
presented in section, “ SuperHyperHamiltonian-Type-Cycle-Cut”. The keyword of this research 330
debut in the section “Applications in Cancer’s Recognition” with two cases and 331
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 332
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite 333
as SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and 334
discernment on what’s done and what’s happened in this research in the terms of 335
“questions” and “problems” to make sense to figure out this research in featured style. 336
The advantages and the limitations of this research alongside about what’s done in this 337
research to make sense and to get sense about what’s figured out are included in the 338
section, “Conclusion and Closing Remarks”. 339
3 Neutrosophic Preliminaries Of This Scientific 340
Research On the Redeemed Ways 341
In this section, the basic material in this scientific research, is referred to [Single Valued 342
Neutrosophic Set](Ref. [162],Definition 2.2,p.2), [Neutrosophic 343
Set](Ref. [162],Definition 2.1,p.1), [Neutrosophic SuperHyperGraph 344
(NSHG)](Ref. [162],Definition 2.5,p.2), [Characterization of the Neutrosophic 345
SuperHyperGraph (NSHG)](Ref. [162],Definition 2.7,p.3), [t-norm](Ref. [162], 346
Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyperGraph 347
(NSHG)](Ref. [162],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 348
SuperHyperPaths] (Ref. [162],Definition 5.3,p.7), and [Different Neutrosophic Types of 349
Neutrosophic SuperHyperEdges (NSHE)] (Ref. [162],Definition 5.4,p.7). Also, the new 350
ideas and their clarifications are addressed to Ref. [162]. 351
In this subsection, the basic material which is used in this scientific research, is 352
presented. Also, the new ideas and their clarifications are elicited. 353
Definition 3.1 (Neutrosophic Set). (Ref. [162],Definition 2.1,p.1). 354
Let X be a Hamiltonian-Type-Cycle-Cut of points (objects) with generic elements in X

denoted by x; then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}

+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a
truth-membership function, an indeterminacy-membership function, and a
falsity-membership function of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of 355
+
]− 0, 1 [. 356
Definition 3.2 (Single Valued Neutrosophic Set). (Ref. [162],Definition 2.2,p.2). 357
Let X be a Hamiltonian-Type-Cycle-Cut of points (objects) with generic elements in X

denoted by x. A single valued Neutrosophic set A (SVNS A) is characterized by
truth-membership function TA (x), an indeterminacy-membership function IA (x), and a
falsity-membership function FA (x). For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1].
A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
Definition 3.3. The degree of truth-membership,

indeterminacy-membership and falsity-membership of the subset X ⊂ A of
the single valued Neutrosophic set A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,

and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 3.4. The support of X ⊂ A of the single valued Neutrosophic set

A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 3.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [162],Definition 358
2.5,p.2). 359
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 360
pair S = (V, E), where 361
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 362
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 363
1, 2, . . . , n); 364
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 365
V; 366
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 367
1, 2, . . . , n0 ); 368
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 369
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 370
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 371
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n );
0 372
(ix) and the following conditions hold:
TV0 (Ei0 ) ≤ min[TV 0 (Vi ), TV 0 (Vj )]Vi ,Vj ∈Ei0 ,
IV0 (Ei0 ) ≤ min[IV 0 (Vi ), IV 0 (Vj )]Vi ,Vj ∈Ei0 ,

and FV0 (Ei0 ) ≤ min[FV 0 (Vi ), FV 0 (Vj )]Vi ,Vj ∈Ei0
where i0 = 1, 2, . . . , n0 . 373
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 374
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 375
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 376
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 377
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 378
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 379
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 380
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 381
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 382
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 383
Definition 3.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 384
(Ref. [162],Definition 2.7,p.3). 385
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 386
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 387
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 388
characterized as follow-up items. 389
(i) If |Vi | = 1, then Vi is called vertex; 390
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 391
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 392
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 393
HyperEdge; 394
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 395
SuperEdge; 396
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 397
SuperHyperEdge. 398
If we choose different types of binary operations, then we could get hugely diverse 399
types of general forms of Neutrosophic SuperHyperGraph (NSHG). 400
Definition 3.7 (t-norm). (Ref. [162], Definition 2.7, p.3). 401
A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following 402
for x, y, z, w ∈ [0, 1]: 403
(i) 1 ⊗ x = x; 404
(ii) x ⊗ y = y ⊗ x; 405
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 406
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 407
Definition 3.8. The degree of truth-membership, indeterminacy-membership

and falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X} (with respect to t-norm Tnorm ):
TA (X) = Tnorm [TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = Tnorm [IA (vi ), IA (vj )]vi ,vj ∈X ,

and FA (X) = Tnorm [FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 3.9. The support of X ⊂ A of the single valued Neutrosophic set
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 3.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 408
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 409
pair S = (V, E), where 410
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 411
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 412
1, 2, . . . , n); 413
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 414
V; 415
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 416
1, 2, . . . , n0 ); 417
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 418
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 419
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 420
supp(Ei0 ) = V, (i0 = 1, 2, . . . , n0 ).
P
(viii) i0 421
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 422
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 423
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 424
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 425
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 426
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 427
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 428
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 429
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 430
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 431
Definition 3.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 432
(Ref. [162],Definition 2.7,p.3). 433
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 434
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 435
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 436
characterized as follow-up items. 437
(i) If |Vi | = 1, then Vi is called vertex; 438
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 439
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 440
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 441
HyperEdge; 442
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 443
SuperEdge; 444
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 445
SuperHyperEdge. 446
This SuperHyperModel is too messy and too dense. Thus there’s a need to have 447
some restrictions and conditions on SuperHyperGraph. The special case of this 448
SuperHyperGraph makes the patterns and regularities. 449
Definition 3.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the 450
number of elements of SuperHyperEdges are the same. 451
To get more visions on SuperHyperUniform, the some SuperHyperClasses are 452
introduced. It makes to have SuperHyperUniform more understandable. 453
Definition 3.13. Assume a Neutrosophic SuperHyperGraph. There are some 454
SuperHyperClasses as follows. 455
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as 456
intersection amid two given SuperHyperEdges with two exceptions; 457
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two 458
given SuperHyperEdges; 459
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 460
SuperHyperEdges; 461
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 462
given SuperHyperEdges and these SuperVertices, forming two separate sets, has 463
no SuperHyperEdge in common; 464
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid 465
two given SuperHyperEdges and these SuperVertices, forming multi separate sets, 466
has no SuperHyperEdge in common; 467
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two 468
given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 469
common SuperVertex. 470
Definition 3.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG)

S. Then a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic
SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic 471
SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either 472
of following conditions hold: 473
(i) Vi , Vi+1 ∈ Ei0 ; 474
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 475
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 476
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 477
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ Ei0 ; 478
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 479
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 480
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 481
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that 482
0 0
Vi , Vi+1 ∈ Ei0 . 483
Definition 3.15. (Characterization of the Neutrosophic SuperHyperPaths). 484
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a

Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV)
V1 to Neutrosophic SuperHyperVertex (NSHV) Vs is sequence of Neutrosophic
SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 485
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 486
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 487
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 488
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic 489
SuperHyperPath . 490
Definition 3.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths). 491
(Ref. [162],Definition 5.3,p.7). 492
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A

Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV)
V1 to Neutrosophic SuperHyperVertex (NSHV) Vs is sequence of Neutrosophic
SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 493
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 494
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 495
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 496
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 497
Definition 3.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 498
(NSHE)). (Ref. [162],Definition 5.4,p.7). 499
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 500
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 501
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic 502
t-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 503
(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 504
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic 505
i-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 506
(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic 508
f-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 509
(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of 511
Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 512
SuperHyperVertex (NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj 513
where 1 ≤ i, j ≤ s. 514
Definition 3.18. (Different Neutrosophic Types of Neutrosophic 515
SuperHyperHamiltonian-Type-Cycle-Cut). 516
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 518
either V 0 or E 0 is called 519
(i) Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression 520
is called Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 521
∀Ea ∈ C : C is
(ii) Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut if the following 522
expression is called Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut 523
criteria holds 524
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 525
(iii) Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression 526
is called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 527
∀Va ∈ C : C is
(iv) Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut if the following 528
expression is called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut 529
criteria holds 530
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 531
(v) Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 532
e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 533
re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 534
rv-SuperHyperHamiltonian-Type-Cycle-Cut. 536
Definition 3.19. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Cut). 537
(i) an Extreme SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 540
rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme 544
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 545
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 546
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 547
SuperHyperEdges and Extreme SuperHyperVertices such that they form the 548
Extreme SuperHyperHamiltonian-Type-Cycle-Cut; 549
(ii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of 550
Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 551
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 555
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 556
SuperHyperHamiltonian-Type-Cycle-Cut; 559
(iii) an Extreme SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if 560
it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 561
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 565
contains the Extreme coefficients defined as the Extreme number of the maximum 566
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 567
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 568
Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is corresponded 570
to its Extreme coefficient; 571
(iv) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 572
SuperHyperPolynomial if it’s either of Neutrosophic 573
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 578
contains the Neutrosophic coefficients defined as the Neutrosophic number of the 579
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 580
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 581
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 582
they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the 583
Neutrosophic power is corresponded to its Neutrosophic coefficient; 584
(v) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 585
SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 592
Extreme SuperHyperHamiltonian-Type-Cycle-Cut; 594
(vi) a Neutrosophic V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of 595
Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 596
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 600
the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 601
(vii) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial 605
if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 606
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 612
Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is corresponded 615
to its Extreme coefficient; 616
(viii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 617
SuperHyperPolynomial if it’s either of Neutrosophic 618
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 625
they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the 628
Neutrosophic power is corresponded to its Neutrosophic coefficient. 629
Definition 3.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Type-Cycle-Cut). 630
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 631
(i) an δ−SuperHyperHamiltonian-Type-Cycle-Cut is a Neutrosophic kind of Neutrosophic 632
SuperHyperHamiltonian-Type-Cycle-Cut such that either of the following expressions hold 633
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 634
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ;

|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ.
The Expression (3.1), holds if S is an δ−SuperHyperOffensive. And the 635
Expression (3.1), holds if S is an δ−SuperHyperDefensive; 636
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Cut is a Neutrosophic kind 637
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut such that either of the following 638
Neutrosophic expressions hold for the Neutrosophic cardinalities of 639
SuperHyperNeighbors of s ∈ S : 640
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ;

|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ.
The Expression (3.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. 641
And the Expression (3.1), holds if S is a Neutrosophic 642
δ−SuperHyperDefensive. 643
For the sake of having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, there’s a 644
need to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The 645
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 646
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 647
assign to the values. 648
Definition 3.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 649
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) holds. 650
Table 1. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy-

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.23)
The Values of The Vertices The Number of Position in Alphabet
The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
The Values of The SuperHyperEdges The maximum Values of Its Endpoints

perEdges Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition
(3.22)
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s 651
more ways to get Neutrosophic type-results to make a Neutrosophic more 652
understandable. 653
Definition 3.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 654
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 655
holds. Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Type-Cycle-Cut, 656
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 657
SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutrosophic 658
SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic 659
SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 660
Neutrosophic SuperHyperWheel if the Table (2) holds. 661
It’s useful to define a “Neutrosophic” version of a Neutrosophic 662
SuperHyperHamiltonian-Type-Cycle-Cut. Since there’s more ways to get type-results to make a 663
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut more Neutrosophicly understandable. 664
For the sake of having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, there’s a 665
need to “redefine” the Neutrosophic notion of “Neutrosophic 666
SuperHyperHamiltonian-Type-Cycle-Cut”. The SuperHyperVertices and the SuperHyperEdges 667
are assigned by the labels from the letters of the alphabets. In this procedure, there’s 668
the usage of the position of labels to assign to the values. 669
Definition 3.23. Assume a SuperHyperHamiltonian-Type-Cycle-Cut. It’s redefined a 670
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if the Table (3) holds. 671

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.23)
4 Neutrosophic SuperHyper But As Hamiltonian-Type-Cycle-Cut 672
The Extensions Excerpt From Dense And Super 673
Forms 674
Definition 4.1. (Neutrosophic event). 675
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Any Neutrosophic k-subset of A of V 677
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is 678
called Neutrosophic event. The following expression is called Neutrosophic 679
probability of A. 680
X
E(A) = E(a). (4.1)
a∈A
Definition 4.2. (Neutrosophic Independent). 681
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. s Neutrosophic k-events Ai , i ∈ I is 683
called Neutrosophic s-independent if the following expression is called 684
Neutrosophic s-independent criteria 685
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Neutrosophic k-events of A and B is called Neutrosophic 686
independent. The following expression is called Neutrosophic independent 687
criteria 688
E(A ∩ B) = P (A)P (B). (4.2)

Definition 4.3. (Neutrosophic Variable). 689
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Any k-function Hamiltonian-Type-Cycle-Cut 691
like E is called Neutrosophic k-Variable. If k = 2, then any 2-function 692
Hamiltonian-Type-Cycle-Cut like E is called Neutrosophic Variable. 693
The notion of independent on Neutrosophic Variable is likewise. 694
Definition 4.4. (Neutrosophic Expectation). 695
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a 697
number is called Neutrosophic Expectation if the following expression is called 698
Neutrosophic Expectation criteria 699
X
Ex(E) = E(α)P (α).
α∈V
Definition 4.5. (Neutrosophic Crossing). 700
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A Neutrosophic number is called 702
Neutrosophic Crossing if the following expression is called Neutrosophic 703
Crossing criteria 704
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.

Lemma 4.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 705
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let m and n 706
propose special Hamiltonian-Type-Cycle-Cut. Then with m ≥ 4n, 707
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a 708
Neutrosophic random k-subset of V obtained by choosing each SuperHyperVertex of G 709
Neutrosophic independently with probability Hamiltonian-Type-Cycle-Cut p := 4n/m, and set 710
H := G[S] and H := G[S]. 711
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of

SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the
Neutrosophic number of crossings of H. The trivial bound noted above, when applied to
H, yields the inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds)

and E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 712
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
713
Theorem 4.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 714
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let P be a 715
SuperHyperSet of n points in the plane, and let l be the Neutrosophic number of 716
SuperHyperLines
√ in the plane passing through at least k + 1 of these points, where 717
1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 718
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex 719
SuperHyperSet P whose SuperHyperEdge are the segments between conseNeighborive 720
points on the SuperHyperLines which pass through at least k + 1 points of P. This 721
Neutrosophic SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic 722
crossing at most l choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , 723
3
or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and 724
again l < 32n2 /k 3 . 725
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let P be a 727
SuperHyperSet of n points in the plane, and let k be the number of pairs of points of P 728
at unit SuperHyperDistance. Then k < 5n4/3 . 729
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 730
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Draw a SuperHyperUnit 731
SuperHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic 732
number of these SuperHyperCircles passing through exactly i points of P. Then 733
i = 0n−1 ni = n and k = 21 i = 0n−1 ini . Now form a Neutrosophic

P P
734
SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 735
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints 736
on the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 737
n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3
Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 738
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel 739
SuperHyperEdges, so as to obtain a simple Neutrosophic SuperHyperGraph G with 740
e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) because G is formed from at most n 741
SuperHyperCircles, and any two SuperHyperCircles cross at most twice. Thus either 742
3
e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 743
4/3 4/3
by the Neutrosophic Crossing Lemma, and k < 4n + n < 5n . 744
Proposition 4.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 745
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be a 746
nonnegative Neutrosophic Variable and t a positive real number. Then 747
E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality. 748
Corollary 4.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 749
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let Xn be a 750
nonnegative integer-valued variable in a probability Hamiltonian-Type-Cycle-Cut (Vn , En ), n ≥ 1. 751
If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as n → ∞. 752
Proof. 753
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A special 755
SuperHyperGraph in Gn,p almost surely has stability number at most d2p−1 log ne. 756
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A special SuperHyperGraph 758
in Gn,p is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 759
SuperHyperVertices of G, where k ∈ N. The probability that S is a stable 760
SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability that none of the 761
(k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 762
Neutrosophic SuperHyperGraph G. 763
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote 764
the indicator Neutrosophic Variable for this Neutrosophic Event. By equation, we have 765
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .
Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 766
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 767
X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 768
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 769
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!
Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k 770
grows at least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because 771
X is integer-valued and nonnegative, we deduce from Corollary that P (X = 0) → 1 as 772
n → ∞. Consequently, a Neutrosophic SuperHyperGraph in Gn,p almost surely has 773
stability number at most k. 774
Definition 4.12. (Neutrosophic Variance). 775
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a 777
number is called Neutrosophic Variance if the following expression is called 778
Neutrosophic Variance criteria 779
2
V x(E) = Ex((X − Ex(X)) ).
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be a 781
Neutrosophic Variable and let t be a positive real number. Then 782
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be a Neutrosophic 784
Variable and let t be a positive real number. Then 785
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
786
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let Xn be a 788
Neutrosophic Variable in a probability Hamiltonian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 789
and V (Xn ) << E 2 (Xn ), then 790
E(Xn = 0) → 0 as n → ∞
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Set X := Xn and 792
t := |Ex(Xn )| in Chebyshev’s Inequality, and observe that 793
E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 794
when Xn = 0. 795
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let G ∈ Gn,1/2 . For 797
0 ≤ k ≤ n, set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for 798
which f (k) is less than one. Then almost surely α(G) takes one of the three values 799
k ∗ − 2, k ∗ − 1, k ∗ . 800
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. As in the proof of related 802
Theorem, the result is straightforward. 803
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let G ∈ Gn,1/2 and 805
let f and k ∗ be as defined in previous Theorem. Then either: 806
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, 807
or 808
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 809
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. The latter is 811
straightforward. 812
Definition 4.17. (Neutrosophic Threshold). 813
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let P be a monotone property of 815
SuperHyperGraphs (one which is preserved when SuperHyperEdges are added). Then a 816
Neutrosophic Threshold for P is a function f (n) such that: 817
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 818
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 819
Definition 4.18. (Neutrosophic Balanced). 820
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let F be a fixed Neutrosophic 822
SuperHyperGraph. Then there is a threshold function for the property of containing a 823
copy of F as a Neutrosophic SubSuperHyperGraph is called Neutrosophic Balanced. 824
S = (V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let F be a 826
nonempty balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l 827
SuperHyperEdges. Then n−k/l is a threshold function for the property of containing F 828
as a Neutrosophic SubSuperHyperGraph. 829
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. The latter is 831
Example 4.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 833
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 834
• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 835
SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 836
Neutrosophicly straightforward. E1 and E3 are some empty Neutrosophic 837
SuperHyperEdges but E2 is a loop Neutrosophic SuperHyperEdge and E4 is a 838
Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 839
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 840
E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 841
there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 842
the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 843
Figure 1. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (16.3)
SuperHyperHamiltonian-Type-Cycle-Cut. 844
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 5 + 2z 3 .
845
Neutrosophicly straightforward. E1 , E2 and E3 are some empty Neutrosophic 848
SuperHyperEdges but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms 849
of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 850
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is 851
Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it 852
as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is 853
excluded in every given Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 854

= {E4 }.
= z3.
= {V1 , V2 , V4 }.
= z 5 + z 3 + z.

855
Neutrosophicly straightforward. 858

= {E4 }.
= z3.
= {V1 , V2 , V3 }.
= z8 + z4 + z3.
859

= {E4 }.
= z5.
= {V1 , V2 , V3 , {N }, {F }}.
= z 4 + z 3 + z 2 + 2z.


863

= {E1 }.
= z5.
= {V1 , V2 , V3 , V4 , V5 }.
= z 7 + 2z 4 + z 3 + z 2 .

867

= {Ei=110 , Ej=2232 , E12 }.
= 22z 2 .
= {Vi ∈ VN SHG }.
X
= ai z bj .
871

= {E15 , E13 , E16 , E14 , E17 , E12 }.
= 2z 5 + z 4 + 3z 2 .
= {Vi ∈ VN SHG }.
X
= ai z bj .

875

= {E3 }.
= z5.
= {Vi=811 , V!4 }.
= z 6 + 3z 5 + z 4 .
879




= {Ei=110 , E22 , E12 }.
= z 11 + 11z 2 .
= {Vi ∈ VN SHG }.
X
= ai z bj .
883

= {E1 , E6 , E2 , E7 , E3 , E4 }.
= 2z 5 + z 4 + 3z 2 .
= {Vi ∈ VN SHG }.
X
= ai z bj .
887
Figure 10. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

= {E1 , E6 , E3 , E8 }.
= 2z 3 + 2z 2 .
= {Vi ∈ VN SHG }.
X
= ai z bj .
891

= {E1 }.
= z5.
= {V1 , V2 , V3 , V7 , V8 }.
= z 8 + z 7 + 3z 5 .

(16.3)
895

= {E9 , E6 , E3 , E8 }.
= 2z 3 + 2z 2 .
= {Vi ∈ VN SHG }.
X
= ai z bj .
899

(16.3)

(16.3)

(16.3)

= {}.
= 0z 0 .
= {}.
= 0z 0 .
903

(16.3)

= {E4 }.
= z2.
= {V3 , V4 }.
= z4 + z3.
907

= {E4 }.
= z 10 .
= {Vi=817 }.
X
= ai z bj .
911

(16.3)

= {E4 }.
= z 10 .
= {Vi=817 }.
X
= ai z bj .
915

= {E4 }.
= z 10 .
= {Vi=817 }.
X
= ai z bj .
919

(16.3)

(16.3)

(16.3)

= {Ei=112 }.
X
= ai z bj .
= {Vi ∈ VN SHG }.
X
= ai z bj .
923

= {E6 }.
= z bj .
= {Vi ∈ VE6 }.
X
= ai z bj .
927

(16.3)

= {E1 , E2 }.
= z 10 + z 2 .
= {VE2 }.
= z 5 + 2z 3 + 7z.
931

(16.3)

(16.3)

= {E2 }.
= z 10 .
= {Vi ∈ VN SHG }.
= z 5 + 2z 3 + 7z.
935
Proposition 4.21. Assume a connected Neutrosophic SuperHyperGraph 936
ESHG : (V, E). The all interior Neutrosophic SuperHyperVertices belong to any 937
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut if for any of them, and any of other 938
corresponded Neutrosophic SuperHyperVertex, some interior Neutrosophic 939
SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 940
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 941
amount of them. 942
Proposition 4.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph 943
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has 944
only the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices 945
inside of any given Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut minus all Neutrosophic 946
SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an 947
unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 948
Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut, minus 949
all Neutrosophic SuperHypeNeighbor to some of them but not all of them. 950
Proposition 4.23. Assume a connected Neutrosophic SuperHyperGraph

ESHG : (V, E). If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z
Neutrosophic SuperHyperVertices, then the Neutrosophic cardinality of the Neutrosophic
R-Hamiltonian-Type-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic 951
R-Hamiltonian-Type-Cycle-Cut is at least the maximum Neutrosophic number of Neutrosophic 952
SuperHyperVertices of the Neutrosophic SuperHyperEdges with the maximum number of 953
the Neutrosophic SuperHyperEdges. In other words, the maximum number of the 954
Neutrosophic SuperHyperEdges contains the maximum Neutrosophic number of 955
Neutrosophic SuperHyperVertices are renamed to Neutrosophic Hamiltonian-Type-Cycle-Cut in 956
some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 957
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the 958
Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Type-Cycle-Cut. 959
Proposition 4.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).

Then the Neutrosophic number of type-result-R-Hamiltonian-Type-Cycle-Cut has, the least
Neutrosophic cardinality, the lower sharp Neutrosophic bound for Neutrosophic
cardinality, is the Neutrosophic cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Hamiltonian-Type-Cycle-Cut with the least Neutrosophic 960
cardinality, the lower sharp Neutrosophic bound for cardinality. 961
Proposition 4.25. Assume a connected loopless Neutrosophic SuperHyperGraph 962
ESHG : (V, E). Then in the worst case, literally, 963
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the 964
lower sharp bound for the cardinality, of a Neutrosophic type-result-Hamiltonian-Type-Cycle-Cut is 965
the cardinality of 966
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).

The SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a
quasi-R-Hamiltonian-Type-Cycle-Cut since neither amount of Neutrosophic SuperHyperEdges
nor amount of SuperHyperVertices where amount refers to the Neutrosophic number of
SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of
SuperHyperEdges or any number of SuperHyperEdges. Let us consider the
Neutrosophic SuperHyperSet
V \V \{aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the

eligibilities to propose property such that there’s no Neutrosophic SuperHyperVertex of
a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic
SuperHyperEdge for all Neutrosophic SuperHyperVertices but the maximum
Neutrosophic cardinality indicates that these Neutrosophic type-SuperHyperSets
couldn’t give us the Neutrosophic lower bound in the term of Neutrosophic sharpness.
In other words, the Neutrosophic SuperHyperSet
V \V \{aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

sometimes the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a

contradiction to the supposition on the connected loopless Neutrosophic
SuperHyperGraph ESHG : (V, E). Thus the minimum case never happens in the
generality of the connected loopless Neutrosophic SuperHyperGraphs. Thus if we
assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Hamiltonian-Type-Cycle-Cut is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the

connected loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and
their quasi-types but the SuperHyperStable is only up in this
quasi-R-Hamiltonian-Type-Cycle-Cut. It’s the contradiction to that fact on the generality. There
are some counterexamples to deny this statement. One of them comes from the setting
of the graph titled path and cycle as the counterexamples-classes or reversely direction
star as the examples-classes, are well-known classes in that setting and they could be
considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at 967
least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the 968
principles of the main definition since there’s no condition to be satisfied but the 969
condition is on the existence of the SuperHyperEdge instead of acting on the 970
SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the 971
Neutrosophic SuperHyperSet has the necessary condition for the intended definition to 972
be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main 973
definition but by the necessity of the pre-condition on the usage of the main definition. 974
The Neutrosophic structure of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut decorates

the Neutrosophic SuperHyperVertices don’t have received any Neutrosophic connections
so as this Neutrosophic style implies different versions of Neutrosophic
SuperHyperEdges with the maximum Neutrosophic cardinality in the terms of
Neutrosophic SuperHyperVertices are spotlight. The lower Neutrosophic bound is to
have the maximum Neutrosophic groups of Neutrosophic SuperHyperVertices have
perfect Neutrosophic connections inside each of SuperHyperEdges and the outside of
this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the
used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken
from the fact that it’s simple. If there’s no more than one Neutrosophic
SuperHyperVertex in the targeted Neutrosophic SuperHyperSet, then there’s no
Neutrosophic connection. Furthermore, the Neutrosophic existence of one Neutrosophic
SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Hamiltonian-Type-Cycle-Cut. Since at least two Neutrosophic SuperHyperVertices involve to
make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic
SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the
Neutrosophic version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic
setting of non-obvious Neutrosophic SuperHyperGraph, there are at least one
Neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is
used as Neutrosophic adjective for the initial Neutrosophic SuperHyperGraph, induces
there’s no Neutrosophic appearance of the loop Neutrosophic version of the
Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be
loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic
setting. With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s
at least one Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic
R-Hamiltonian-Type-Cycle-Cut has the Neutrosophic cardinality of a Neutrosophic
SuperHyperEdge. Thus, a Neutrosophic R-Hamiltonian-Type-Cycle-Cut has the Neutrosophic
cardinality at least a Neutrosophic SuperHyperEdge. Assume a Neutrosophic
SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic
R-Hamiltonian-Type-Cycle-Cut since either the Neutrosophic SuperHyperGraph is an obvious
Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic
connection inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its
consequences, there’s a Neutrosophic contradiction with the term “Neutrosophic
R-Hamiltonian-Type-Cycle-Cut” since the maximum Neutrosophic cardinality never happens for
this Neutrosophic style of the Neutrosophic SuperHyperSet and beyond that there’s no
Neutrosophic connection inside as mentioned in first Neutrosophic case in the forms of
drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of
on-quasi-triangle Neutrosophic style on the every Neutrosophic elements of this
Neutrosophic SuperHyperSet. Precisely, the Neutrosophic R-Hamiltonian-Type-Cycle-Cut is the
Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that some
Neutrosophic amount of the Neutrosophic SuperHyperVertices are on-quasi-triangle
Neutrosophic style. The Neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet
But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality
of the maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The
first Neutrosophic term refers to the Neutrosophic setting of the Neutrosophic
SuperHyperGraph but this key point is enough since there’s a Neutrosophic
SuperHyperClass of a Neutrosophic SuperHyperGraph has no on-quasi-triangle
Neutrosophic style amid some amount of its Neutrosophic SuperHyperVertices. This

Neutrosophic setting of the Neutrosophic SuperHyperModel proposes a Neutrosophic
SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from one
Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of
Neutrosophic SuperHyperEdges more than one involving these some amount of these
Neutrosophic SuperHyperVertices. The Neutrosophic cardinality of this Neutrosophic
SuperHyperSet is the maximum and the Neutrosophic case is occurred in the minimum
Neutrosophic situation. To sum them up, the Neutrosophic SuperHyperSet
Has the maximum Neutrosophic cardinality such that
Contains some Neutrosophic SuperHyperVertices such that there’s

distinct-covers-order-amount Neutrosophic SuperHyperEdges for amount of
Neutrosophic SuperHyperVertices taken from the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices
Is a Neutrosophic R-Hamiltonian-Type-Cycle-Cut for the Neutrosophic SuperHyperGraph as 975
used Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case 976
and the common theme of the lower Neutrosophic bound occurred in the specific 977
Neutrosophic SuperHyperClasses of the Neutrosophic SuperHyperGraphs which are 978
Neutrosophic free-quasi-triangle. 979
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic

number of the Neutrosophic SuperHyperVertices. Then every Neutrosophic
SuperHyperVertex has at least no Neutrosophic SuperHyperEdge with others in
common. Thus those Neutrosophic SuperHyperVertices have the eligibles to be
contained in a Neutrosophic R-Hamiltonian-Type-Cycle-Cut. Those Neutrosophic
SuperHyperVertices are potentially included in a Neutrosophic
style-R-Hamiltonian-Type-Cycle-Cut. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge

E ∈ EESHG:(V,E) . Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the
Neutrosophic SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal
definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic
SuperHyperVertices Zi and Zj . The other definition for the Neutrosophic
SuperHyperEdge E ∈ EESHG:(V,E) in the terms of Neutrosophic R-Hamiltonian-Type-Cycle-Cut
is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut

but with slightly differences in the maximum Neutrosophic cardinality amid those
Neutrosophic type-SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the
Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z
and
is formalized with mathematical literatures on the Neutrosophic R-Hamiltonian-Type-Cycle-Cut.

E
Let Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong
to the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 980
Neutrosophic R-Hamiltonian-Type-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
981
Neutrosophic R-Hamiltonian-Type-Cycle-Cut =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut where

E ∈ EESHG:(V,E) is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic
intended SuperHyperVertices but in a Neutrosophic Hamiltonian-Type-Cycle-Cut,
Ex = E ∈ EESHG:(V,E) could be different and it’s not unique. To sum them up, in a
connected Neutrosophic SuperHyperGraph ESHG : (V, E). If a Neutrosophic
SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then the
Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic 982
R-Hamiltonian-Type-Cycle-Cut is at least the maximum Neutrosophic number of Neutrosophic 983
SuperHyperVertices of the Neutrosophic SuperHyperEdges with the maximum number 984
of the Neutrosophic SuperHyperEdges. In other words, the maximum number of the 985
Neutrosophic SuperHyperEdges contains the maximum Neutrosophic number of 986
Neutrosophic SuperHyperVertices are renamed to Neutrosophic Hamiltonian-Type-Cycle-Cut in 987
some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 988
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the 989
Neutrosophic SuperHyperVertices are contained in a Neutrosophic 990
R-Hamiltonian-Type-Cycle-Cut. 991
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the 992
non-obvious Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel 993
addresses some issues about the Neutrosophic optimal SuperHyperObject. It specially 994
delivers some remarks on the Neutrosophic SuperHyperSet of the Neutrosophic 995
SuperHyperVertices such that there’s distinct amount of Neutrosophic 996
SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up to all 997
taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 998
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either 999
has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum 1000
Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 1001
least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic 1002
SuperHyperVertices. Thus it forms a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut where 1003
the Neutrosophic completion of the Neutrosophic incidence is up in that. Thus it’s, 1004
literarily, a Neutrosophic embedded R-Hamiltonian-Type-Cycle-Cut. The SuperHyperNotions of 1005
embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, 1006
these types of SuperHyperSets only don’t satisfy on the maximum 1007
SuperHyperCardinality. Thus the embedded setting is elected such that those 1008
SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re 1009
Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic 1010
SuperHyperVertices are included in the minimum Neutrosophic style of the embedded 1011
Neutrosophic R-Hamiltonian-Type-Cycle-Cut. The interior types of the Neutrosophic 1012
SuperHyperVertices are deciders. Since the Neutrosophic number of 1013
SuperHyperNeighbors are only affected by the interior Neutrosophic 1014
SuperHyperVertices. The common connections, more precise and more formal, the 1015
perfect unique connections inside the Neutrosophic SuperHyperSet for any distinct 1016
types of Neutrosophic SuperHyperVertices pose the Neutrosophic 1017
R-Hamiltonian-Type-Cycle-Cut. Thus Neutrosophic exterior SuperHyperVertices could be used 1018
only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation 1019
with the interior Neutrosophic SuperHyperVertices in that Neutrosophic 1020
SuperHyperEdge. In the embedded Neutrosophic Hamiltonian-Type-Cycle-Cut, there’s the usage 1021
of exterior Neutrosophic SuperHyperVertices since they’ve more connections inside more 1022
than outside. Thus the title “exterior” is more relevant than the title “interior”. One 1023
Neutrosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic 1024
SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyperElement 1025
has been ignored in the exploring to lead on the optimal case implying the Neutrosophic 1026
R-Hamiltonian-Type-Cycle-Cut. The Neutrosophic R-Hamiltonian-Type-Cycle-Cut with the exclusion of 1027
the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic 1028
SuperHyperEdge and with other terms, the Neutrosophic R-Hamiltonian-Type-Cycle-Cut with 1029
the inclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic 1030
SuperHyperEdge, is a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut. To sum them up, in a 1031
connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s only 1032
one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 1033
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 1034
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor 1035
to some of them but not all of them. In other words, there’s only an unique 1036
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic 1037
SuperHyperVertices in an Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut, minus all 1038
Neutrosophic SuperHypeNeighbor to some of them but not all of them. 1039
The main definition of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut has two titles. a 1040
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut and its corresponded quasi-maximum 1041
Neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For 1042
any Neutrosophic number, there’s a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut with 1043
that quasi-maximum Neutrosophic SuperHyperCardinality in the terms of the 1044
embedded Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic 1045
SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the 1046
collection of all the Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cuts for all Neutrosophic 1047
numbers less than its Neutrosophic corresponded maximum number. The essence of the 1048
Neutrosophic Hamiltonian-Type-Cycle-Cut ends up but this essence starts up in the terms of the 1049
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut, again and more in the operations of 1050
collecting all the Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cuts acted on the all possible 1051
used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 1052
number. This Neutrosophic number is 1053
considered as the equivalence class for all corresponded 1054
quasi-R-Hamiltonian-Type-Cycle-Cuts. Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and 1055
GNeutrosophic Hamiltonian-Type-Cycle-Cut be a Neutrosophic number, a Neutrosophic 1056
SuperHyperSet and a Neutrosophic Hamiltonian-Type-Cycle-Cut. Then 1057
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Hamiltonian-Type-Cycle-Cut is 1058
re-formalized and redefined as follows. 1059
GNeutrosophic Hamiltonian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal 1060
technical definition for the Neutrosophic Hamiltonian-Type-Cycle-Cut. 1061
GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic 1062
Hamiltonian-Type-Cycle-Cut poses the upcoming expressions. 1063
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 1064
= max zNeutrosophic Number

= max |E| | E ∈ EESHG:(V,E) }.
And then, 1065

To get more visions in the closer look-up, there’s an overall overlook. 1066


1067
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

1068

1069

Now, the extension of these types of approaches is up. Since the new term, 1070
“Neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the 1071
Neutrosophic SuperHyperVertices such that any amount of its Neutrosophic 1072
SuperHyperVertices are incident to a Neutrosophic SuperHyperEdge. It’s, literarily, 1073
another name for “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Cut” but, precisely, it’s the 1074
generalization of “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Cut” since “Neutrosophic 1075
Quasi-Hamiltonian-Type-Cycle-Cut” happens “Neutrosophic Hamiltonian-Type-Cycle-Cut” in a 1076
Neutrosophic SuperHyperGraph as initial framework and background but 1077
“Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic 1078
Hamiltonian-Type-Cycle-Cut” in a Neutrosophic SuperHyperGraph as initial framework and 1079
preliminarily background since there are some ambiguities about the Neutrosophic 1080
SuperHyperCardinality arise from it. To get orderly keywords, the terms, 1081
“Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Cut”, 1082
and “Neutrosophic Hamiltonian-Type-Cycle-Cut” are up. 1083
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 1084
GNeutrosophic Hamiltonian-Type-Cycle-Cut be a Neutrosophic number, a Neutrosophic 1085
SuperHyperNeighborhood and a Neutrosophic Hamiltonian-Type-Cycle-Cut and the new terms 1086
are up. 1087

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
1088
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
1089
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
1090
And with go back to initial structure, 1091


1092
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

1093
[zNeutrosophic
Number ]Neutrosophic Class

1094

Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior 1095
Neutrosophic SuperHyperVertices belong to any Neutrosophic 1096
quasi-R-Hamiltonian-Type-Cycle-Cut if for any of them, and any of other corresponded 1097
Neutrosophic SuperHyperVertex, some interior Neutrosophic SuperHyperVertices are 1098
mutually Neutrosophic SuperHyperNeighbors with no Neutrosophic exception at all 1099
minus all Neutrosophic SuperHypeNeighbors to any amount of them. 1100
To make sense with the precise words in the terms of “R-’, the follow-up illustrations 1101
are coming up. 1102
The following Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices is

the simple Neutrosophic type-SuperHyperSet of the Neutrosophic
R-Hamiltonian-Type-Cycle-Cut.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic

R-Hamiltonian-Type-Cycle-Cut. The Neutrosophic SuperHyperSet of the Neutrosophic
SuperHyperVertices,
Is an Neutrosophic R-Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic 1103
SuperHyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 1104
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S

of Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic
SuperHyperEdge amid some Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Hamiltonian-Type-Cycle-Cut is related to the Neutrosophic SuperHyperSet of
the Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended

Neutrosophic SuperHyperSet. Thus the non-obvious Neutrosophic Hamiltonian-Type-Cycle-Cut
is up. The obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic
Hamiltonian-Type-Cycle-Cut is a Neutrosophic SuperHyperSet includes only one Neutrosophic
SuperHyperVertex. But the Neutrosophic SuperHyperSet of Neutrosophic

SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic
SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the
non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic
R-Hamiltonian-Type-Cycle-Cut is up. To sum them up, the Neutrosophic SuperHyperSet of
Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic

R-Hamiltonian-Type-Cycle-Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic
SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic 1105
SuperHyperGraph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of 1106
Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge 1107
for some Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic 1108
type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Cut and it’s an 1109
Neutrosophic Hamiltonian-Type-Cycle-Cut. Since it’s 1110
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S

of Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic
SuperHyperEdge for some amount Neutrosophic SuperHyperVertices instead of all given
by that Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Cut.
There isn’t only less than two Neutrosophic SuperHyperVertices inside the intended
Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Hamiltonian-Type-Cycle-Cut,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic

Hamiltonian-Type-Cycle-Cut, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic 1111
SuperHyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded 1112
to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple 1113
Neutrosophic type-SuperHyperSet called the 1114
“Neutrosophic R-Hamiltonian-Type-Cycle-Cut” 1115
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 1116
Neutrosophic R-Hamiltonian-Type-Cycle-Cut, 1117
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated

SuperHyperModeling. It’s also, not only a Neutrosophic free-triangle embedded
SuperHyperModel and a Neutrosophic on-triangle embedded SuperHyperModel but also
it’s a Neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple
Neutrosophic type-SuperHyperSets of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut amid
those obvious simple Neutrosophic type-SuperHyperSets of the Neutrosophic
Hamiltonian-Type-Cycle-Cut, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1118
To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph

ESHG : (V, E). Then in the worst case, literally,
is a Neutrosophic R-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the

lower sharp bound for the cardinality, of a Neutrosophic R-Hamiltonian-Type-Cycle-Cut is the
cardinality of
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1119
The all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic 1120
quasi-R-Hamiltonian-Type-Cycle-Cut if for any of them, and any of other corresponded 1121
Neutrosophic SuperHyperVertex, some interior Neutrosophic SuperHyperVertices are 1122
mutually Neutrosophic SuperHyperNeighbors with no Neutrosophic exception at all 1123
minus all Neutrosophic SuperHypeNeighbors to any amount of them. 1124
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a 1125
Neutrosophic SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic 1126
SuperHyperVertices r. Consider all Neutrosophic numbers of those Neutrosophic 1127
SuperHyperVertices from that Neutrosophic SuperHyperEdge excluding excluding more 1128
than r distinct Neutrosophic SuperHyperVertices, exclude to any given Neutrosophic 1129
SuperHyperSet of the Neutrosophic SuperHyperVertices. Consider there’s a 1130
Neutrosophic R-Hamiltonian-Type-Cycle-Cut with the least cardinality, the lower sharp 1131
Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 1132
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the 1133
Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of 1134
the Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge 1135
to have some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic 1136
R-Hamiltonian-Type-Cycle-Cut. Since it doesn’t have 1137
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S 1138
of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge 1139
to have some SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the 1140
Neutrosophic SuperHyperVertices VESHE ∪ {z} is the maximum Neutrosophic 1141
cardinality of a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices but 1142
it isn’t a Neutrosophic R-Hamiltonian-Type-Cycle-Cut. Since it doesn’t do the Neutrosophic 1143
procedure such that such that there’s a Neutrosophic SuperHyperEdge to have some 1144
Neutrosophic SuperHyperVertices uniquely [there are at least one Neutrosophic 1145
SuperHyperVertex outside implying there’s, sometimes in the connected Neutrosophic 1146
SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled its 1147
Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 1148
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 1149
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic 1150
SuperHyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. 1151
Thus the obvious Neutrosophic R-Hamiltonian-Type-Cycle-Cut, VESHE is up. The obvious 1152
simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut, 1153
VESHE , is a Neutrosophic SuperHyperSet, VESHE , includes only all Neutrosophic 1154
SuperHyperVertices does forms any kind of Neutrosophic pairs are titled 1155
Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 1156
ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 1157
SuperHyperVertices VESHE , is the 1158
maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 1159
SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a 1160
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 1161
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any 1162
Neutrosophic R-Hamiltonian-Type-Cycle-Cut only contains all interior Neutrosophic 1163
SuperHyperVertices and all exterior Neutrosophic SuperHyperVertices from the unique 1164
Neutrosophic SuperHyperEdge where there’s any of them has all possible Neutrosophic 1165
SuperHyperNeighbors in and there’s all Neutrosophic SuperHyperNeighborhoods in 1166
with no exception minus all Neutrosophic SuperHypeNeighbors to some of them not all 1167
of them but everything is possible about Neutrosophic SuperHyperNeighborhoods and 1168
Neutrosophic SuperHyperNeighbors out. 1169
The SuperHyperNotion, namely, Hamiltonian-Type-Cycle-Cut, is up. There’s neither empty 1170
SuperHyperEdge nor loop SuperHyperEdge. The following Neutrosophic 1171
SuperHyperSet of Neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple 1172
Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Type-Cycle-Cut. The 1173
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperEdges[SuperHyperVertices], 1174
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1175
Hamiltonian-Type-Cycle-Cut. The Neutrosophic SuperHyperSet of the Neutrosophic 1176
SuperHyperEdges[SuperHyperVertices], 1177

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Neutrosophic Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic 1178
SuperHyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 1179
of Neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no 1181
Neutrosophic SuperHyperVertex of a Neutrosophic SuperHyperEdge is common and 1182
there’s an Neutrosophic SuperHyperEdge for all Neutrosophic SuperHyperVertices. 1183
There are not only two Neutrosophic SuperHyperVertices inside the intended 1184
Neutrosophic SuperHyperSet. Thus the non-obvious Neutrosophic Hamiltonian-Type-Cycle-Cut 1185
is up. The obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic 1186
Hamiltonian-Type-Cycle-Cut is a Neutrosophic SuperHyperSet includes only two Neutrosophic 1187
SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 1188

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic 1190
SuperHyperSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the 1191
Neutrosophic Hamiltonian-Type-Cycle-Cut is up. To sum them up, the Neutrosophic 1192
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 1193

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1194
Hamiltonian-Type-Cycle-Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic 1195

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Neutrosophic Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic 1197
SuperHyperGraph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of 1198
Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge 1199
for some Neutrosophic SuperHyperVertices given by that Neutrosophic 1200
type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Cut and it’s an 1201
Neutrosophic Hamiltonian-Type-Cycle-Cut. Since it’s 1202
of Neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no 1204
Neutrosophic SuperHyperVertex of a Neutrosophic SuperHyperEdge is common and 1205
there’s an Neutrosophic SuperHyperEdge for all Neutrosophic SuperHyperVertices. 1206
There aren’t only less than three Neutrosophic SuperHyperVertices inside the intended 1207
Neutrosophic SuperHyperSet, 1208

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Thus the non-obvious Neutrosophic Hamiltonian-Type-Cycle-Cut , 1209

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1210
Hamiltonian-Type-Cycle-Cut, not: 1211

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the Neutrosophic SuperHyperSet, not: 1212

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Neutrosophic 1213
SuperHyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious 1214
simple Neutrosophic type-SuperHyperSet called the 1215
“Neutrosophic Hamiltonian-Type-Cycle-Cut ” 1216
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 1217
Neutrosophic Hamiltonian-Type-Cycle-Cut, 1218
is only and only 1219

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1220
5 The Neutrosophic Departures on The Theoretical 1221
Results Toward Theoretical Motivations 1222
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 1223
Neutrosophic SuperHyperClasses. 1224
Proposition 5.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). 1225
Then 1226

= {Eimax }.
max
= z |Ei |
.
= {Vi ∈ Eimax }.
X
= ai z bj .
Proof. Let 1227
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
1228
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath 1229
ESHP : (V, E). There’s a new way to redefine as 1230
ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is 1231
corresponded to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. 1232
The latter is straightforward. 1233
Example 5.2. In the Figure (23), the connected Neutrosophic SuperHyperPath 1234
ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 1235
Neutrosophic SuperHyperModel (23), is the SuperHyperHamiltonian-Type-Cycle-Cut. 1236
Proposition 5.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 1237
Then 1238

= {Ei ∈ EN SHG }.
X
= ai z bj .
= {Vi ∈ VN SHG }.
X
= ai z bj .
1239
Proof. Let 1240
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
Figure 23. a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Type-Cycle-Cut in the Example (16.5)
1241
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle 1242
ESHC : (V, E). There’s a new way to redefine as 1243

Example 5.4. In the Figure (24), the connected Neutrosophic SuperHyperCycle 1247
N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 1248
SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 1249
Proposition 5.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1251
Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions

Then 1252

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 1253
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
1254
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1255
There’s a new way to redefine as 1256

Figure 25. a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (16.9)
Example 5.6. In the Figure (25), the connected Neutrosophic SuperHyperStar 1260
ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 1261
by the Algorithm in previous Neutrosophic result, of the Neutrosophic 1262
SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 1263
the Neutrosophic SuperHyperModel (25), is the Neutrosophic 1264
Proposition 5.7. Assume a connected Neutrosophic SuperHyperBipartite 1266
ESHB : (V, E). Then 1267

= {Vi ∈ P min }.
X
= ai z bj .
= {Vi ∈ P min }.
X
= ai z bj .
Proof. Let 1268
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|P i |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
1269
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG
is a longest path taken from a connected Neutrosophic SuperHyperBipartite 1270
ESHB : (V, E). There’s a new way to redefine as 1271

The latter is straightforward. Then there’s no at least one 1274
SuperHyperHamiltonian-Type-Cycle-Cut. Thus the notion of quasi may be up but the 1275
SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle-Cut could be applied. There 1276
are only two SuperHyperParts. Thus every SuperHyperPart could have one 1277
SuperHyperVertex as the representative in the 1278
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperHamiltonian-Type-Cycle-Cut taken from a connected Neutrosophic 1279
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 1280
minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1281
solution 1282
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Example 5.8. In the Neutrosophic Figure (26), the connected Neutrosophic 1284
SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 1285
featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1286
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 1287
Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1288
SuperHyperModel (26), is the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 1289
Figure 26. Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutro-

sophic Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Example (16.11)
Proposition 5.9. Assume a connected Neutrosophic SuperHyperMultipartite 1290
ESHM : (V, E). Then 1291

= {Vi ∈ P min }.
X
= ai z bj .
= {Vi ∈ P min }.
X
= ai z bj .
Proof. Let 1292
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
1293
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|P i |=minP ∈E |Pj |
j N SHG
SuperHyperMultipartite ESHM : (V, E). There’s a new way to redefine as 1295

The latter is straightforward. Then there’s no at least one 1298
SuperHyperHamiltonian-Type-Cycle-Cut. Thus the notion of quasi may be up but the 1299
SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle-Cut could be applied. There 1300
are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1301
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 1303
ESHM : (V, E). Thus only some SuperHyperVertices and only 1304
solution 1306
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
ESHM : (V, E). The latter is straightforward. 1308
Example 5.10. In the Figure (27), the connected Neutrosophic 1309
SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 1310
The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 1311
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 1312
SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 1313
is the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 1314
Proposition 5.11. Assume a connected Neutrosophic SuperHyperWheel 1315
ESHW : (V, E). Then, 1316

= {Ei=1|EN SHG |−1 , Ea∗ , Eb∗ }.
X
= ai z bj .
= {Vi ∈ VN SHG }.
X
= ai z bj .
Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Example (16.13)
Proof. Let 1317
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
1318
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 1320

The latter is straightforward. Then there’s at least one SuperHyperHamiltonian-Type-Cycle-Cut. 1323
Thus the notion of quasi isn’t up and the SuperHyperNotions based on 1324
SuperHyperHamiltonian-Type-Cycle-Cut could be applied. The unique embedded 1325
SuperHyperHamiltonian-Type-Cycle-Cut proposes some longest SuperHyperHamiltonian-Type-Cycle-Cut 1326
excerpt from some representatives. The latter is straightforward. 1327
SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 1329
obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 1330
Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 1331
ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 1332
Figure 28. a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neu-

trosophic Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic
Example (16.15)
6 The Surveys of Mathematical Sets On The 1334
Results But As The Initial Motivation 1335
For the SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, and 1336
the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, some general results are introduced. 1337
Remark 6.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is 1338
“redefined” on the positions of the alphabets. 1339
Corollary 6.2. Assume Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. Then 1340
N eutrosophic SuperHyperHamiltonian − T ype − Cycle − Cut =

{theSuperHyperHamiltonian − T ype − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − T ype − Cycle − Cut
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−T ype−Cycle−Cut. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on 1341
the SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 1342
indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 1343
Corollary 6.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 1344
of the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut and 1345
SuperHyperHamiltonian-Type-Cycle-Cut coincide. 1346
of the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a 1348
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if and only if it’s a 1349
of the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a 1352
strongest SuperHyperHamiltonian-Type-Cycle-Cut if and only if it’s a longest 1353
Corollary 6.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 1355
same identical letter of the alphabet. Then its Neutrosophic 1356
SuperHyperHamiltonian-Type-Cycle-Cut is its SuperHyperHamiltonian-Type-Cycle-Cut and reversely. 1357
Corollary 6.7. Assume a Neutrosophic 1358
SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, 1359
SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of the alphabet. 1360
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is its SuperHyperHamiltonian-Type-Cycle-Cut 1361
and reversely. 1362
Corollary 6.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 1363
SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its 1364
SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined. 1365
Corollary 6.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 1366
its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its 1367
SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 1371
SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its 1372
Corollary 6.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 1374
SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its 1375
SuperHyperHamiltonian-Type-Cycle-Cut is well-defined. 1376
Corollary 6.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 1377
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its 1378
SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 1382
SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its 1383
Proposition 6.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V 1385
is 1386
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1387
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1388
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1389
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1390
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1391
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1392
Proposition 6.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then 1393
∅ is 1394
(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1395
(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1396
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1397
(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1398
(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1399
(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1400
Proposition 6.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 1401
independent SuperHyperSet is 1402
(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1403
(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1404
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1405
(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1406
(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1407
(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1408
Proposition 6.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1409
SuperHyperGraph which is a SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath. Then V is 1410
a maximal 1411
(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1412
(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1413
(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1414
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1415
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1416
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1417
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1418
Proposition 6.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 1419
SuperHyperUniform SuperHyperWheel. Then V is a maximal 1420
(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1421
(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1422
(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1423
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1424
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1425
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1426
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1427
SuperHyperGraph which is a SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath. Then the 1429
number of 1430
(i) : the SuperHyperHamiltonian-Type-Cycle-Cut; 1431
(ii) : the SuperHyperHamiltonian-Type-Cycle-Cut; 1432
(iii) : the connected SuperHyperHamiltonian-Type-Cycle-Cut; 1433
(iv) : the O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 1434
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 1435
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut. 1436
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1437
SuperHyperVertices coincide. 1438
SuperHyperGraph which is a SuperHyperWheel. Then the number of 1440
(i) : the dual SuperHyperHamiltonian-Type-Cycle-Cut; 1441
(ii) : the dual SuperHyperHamiltonian-Type-Cycle-Cut; 1442
(iii) : the dual connected SuperHyperHamiltonian-Type-Cycle-Cut; 1443
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 1444
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 1445
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut. 1446
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1447
SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1450
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1451
SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 1452
number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 1453
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1457
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1458
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1459
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1462
SuperHyperSet contains the half of multiplying r with the number of all the 1463
SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1464
is a 1465
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1469
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1470
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1471
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 1474
number of 1475
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1479
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1480
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1481
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 1482
multiplying r with the number of all the SuperHyperEdges plus one of all the 1483
SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 1484
Proposition 6.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The 1486
number of connected component is |V − S| if there’s a SuperHyperSet which is a dual 1487
(iv) : SuperHyperHamiltonian-Type-Cycle-Cut; 1491
(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1492
(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1493
Proposition 6.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 1494
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 1495
Proposition 6.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1496
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 1497
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1498
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1502
(v) : strong ( O(ESHG:(V,E))

(vi) : connected ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1504
∅. The number is 0 and the Neutrosophic number is 0, for an independent 1506
SuperHyperSet in the setting of dual 1507
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1511
(v) : strong 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1512
(vi) : connected 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1513
SuperHyperComplete. Then there’s no independent SuperHyperSet. 1515
SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is 1517
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting 1518
of a dual 1519
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1523
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1524
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1525
SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 1527
number is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is 1528
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of a dual 1529
t>
2
(iv) : ( O(ESHG:(V,E))
(v) : strong ( O(ESHG:(V,E))

(vi) : connected ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1535
Proposition 6.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1536
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the 1537
result is obtained for the individuals. Then the results also hold for the 1538
SuperHyperFamily N SHF : (V, E) of these specific SuperHyperClasses of the 1539
Neutrosophic SuperHyperGraphs. 1540
Proposition 6.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If 1541
S is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S 1542
such that 1543
(i) v ∈ Ns (x); 1544
(ii) vx ∈ E. 1545
Proposition 6.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If 1546
S is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then 1547
(i) S is SuperHyperHamiltonian-Type-Cycle-Cut set; 1548
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1549
Proposition 6.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. 1550
Then 1551
(i) Γ ≤ O; 1552
(ii) Γs ≤ On . 1553
Proposition 6.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph 1554
which is connected. Then 1555
(i) Γ ≤ O − 1; 1556
(ii) Γs ≤ On − Σ3i=1 σi (x). 1557
Proposition 6.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1558
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1559
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1561
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1562
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only 1563
a dual SuperHyperHamiltonian-Type-Cycle-Cut. 1564
Proposition 6.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1565
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive 1566
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and 1568
{v1 , v3 , · · · .vn−1 }; 1569
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1570
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only 1571
dual SuperHyperHamiltonian-Type-Cycle-Cut. 1572
Proposition 6.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Type-Cycle-Cut. Then 1573
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive 1574
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and 1576
{v1 , v3 , · · · , vn−1 }; 1577
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1578
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only 1579
Proposition 6.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Type-Cycle-Cut. Then 1581
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1582
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1584
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1585
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only 1586
Proposition 6.40. Let ESHG : (V, E) be SuperHyperStar. Then 1588
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Type-Cycle-Cut; 1589
(ii) Γ = 1; 1590
(iii) Γs = Σ3i=1 σi (c); 1591
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual 1592
Proposition 6.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1594
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual 1595
maximal SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1596
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1597
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1598
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual 1599
maximal SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1600
Proposition 6.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1601
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1602
(ii) Γ = b n2 c + 1; 1604
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 1605
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual SuperHyperDefensive 1606
Proposition 6.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1608
bn
2c
(ii) Γ = b n2 c; 1611

bnc ; 1612
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 1613
Proposition 6.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic 1615
SuperHyperStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 1616
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive 1617
SuperHyperHamiltonian-Type-Cycle-Cut for N SHF; 1618
(ii) Γ = m for N SHF : (V, E); 1619
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1620
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual 1621
SuperHyperHamiltonian-Type-Cycle-Cut for N SHF : (V, E). 1622
Proposition 6.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd 1623
SuperHyperComplete SuperHyperGraphs with common Neutrosophic SuperHyperVertex 1624
SuperHyperSet. Then 1625
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 1626
SuperHyperHamiltonian-Type-Cycle-Cut for N SHF; 1627
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1628

b n c+1 for N SHF : (V, E); 1629
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal 1630
Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1632
SuperHyperComplete SuperHyperGraphs with common Neutrosophic SuperHyperVertex 1633
SuperHyperSet. Then 1634
bn
2c
SuperHyperHamiltonian-Type-Cycle-Cut for N SHF : (V, E); 1636
(ii) Γ = b n2 c for N SHF : (V, E); 1637

bnc for N SHF : (V, E); 1638
S={vi }i=1
bnc
(iv) the SuperHyperSets S = {vi }i=1 2
are only dual maximal 1639
Then following statements hold; 1642
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an 1643
t-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then S is an 1644
s-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1645
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1646
t-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then S is a dual 1647
s-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1648
Then following statements hold; 1650
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an 1651
t-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then S is an 1652
s-SuperHyperPowerful SuperHyperHamiltonian-Type-Cycle-Cut; 1653
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1654
t-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then S is a dual 1655
s-SuperHyperPowerful SuperHyperHamiltonian-Type-Cycle-Cut. 1656
Proposition 6.49. Let ESHG : (V, E) be a[an] 1657
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph. Then following 1658
statements hold; 1659
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 1660
2-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1661
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 1662
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 1664
(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 1666
V-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1667
Proposition 6.50. Let ESHG : (V, E) is a[an] 1668
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph. Then following 1669
statements hold; 1670
(i) ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1671
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 1673
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 1675
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 1677
V-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1678
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is a 1680
SuperHyperComplete. Then following statements hold; 1681
(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1682
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

2 c + 1 if ESHG : (V, E) is a dual 1684
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 1686
(O − 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1689
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is a 1691
SuperHyperComplete. Then following statements hold; 1692
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c + 1, then ESHG : (V, E) is an 1693
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

2 c + 1, then ESHG : (V, E) is a dual 1695
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1697
(O − 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 1698
(O − 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1700
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1702
SuperHyperHamiltonian-Type-Cycle-Cut. Then following statements hold; 1703
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 1704
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1706
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 1708
2-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1711
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1713
SuperHyperHamiltonian-Type-Cycle-Cut. Then following statements hold; 1714
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 1715
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1717
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 1719
2-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 1722
7 Neutrosophic Applications in Cancer’s 1723
Neutrosophic Recognition 1724
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out 1725
what’s going on this Neutrosophic phenomenon. The special Neutrosophic case of this 1726
Neutrosophic disease is considered and as the consequences of the model, some 1727
parameters are used. The cells are under attack of this disease but the moves of the 1728
cancer in the special region are the matter of mind. The Neutrosophic recognition of the 1729
cancer could help to find some Neutrosophic treatments for this Neutrosophic disease. 1730
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 1731
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in 1732
the long-term Neutrosophic function. 1733
Figure 29. a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutro-

sophic SuperHyperHamiltonian-Type-Cycle-Cut
Step 2. (Neutrosophic Issue) The specific region has been assigned by the 1734
Neutrosophic model [it’s called Neutrosophic SuperHyperGraph] and the long 1735
Neutrosophic cycle of the move from the cancer is identified by this research. 1736
Sometimes the move of the cancer hasn’t be easily identified since there are some 1737
determinacy, indeterminacy and neutrality about the moves and the effects of the 1738
cancer on that region; this event leads us to choose another model [it’s said to be 1739
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1740
and what’s done. 1741
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which 1742
are well-known and they’ve got the names, and some general Neutrosophic models. 1743
The moves and the Neutrosophic traces of the cancer on the complex tracks and 1744
between complicated groups of cells could be fantasized by a Neutrosophic 1745
SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, 1746
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 1747
find either the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut or the Neutrosophic 1748
SuperHyperHamiltonian-Type-Cycle-Cut in those Neutrosophic Neutrosophic 1749
SuperHyperModels. 1750
8 Case 1: The Initial Neutrosophic Steps 1751
Toward Neutrosophic SuperHyperBipartite as 1752
Neutrosophic SuperHyperModel 1753
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (29), the 1754
Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 1755
featured. 1756
By using the Neutrosophic Figure (29) and the Table (4), the Neutrosophic 1757
SuperHyperBipartite is obtained. 1758
Table 4. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Neutrosophic SuperHyperBipartite
Figure 30. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1759
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 1760
connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1761
9 Case 2: The Increasing Neutrosophic Steps 1763
Toward Neutrosophic SuperHyperMultipartite as 1764
Neutrosophic SuperHyperModel 1765
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (30), the 1766
Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and Neutrosophic 1767
featured. 1768
By using the Neutrosophic Figure (30) and the Table (5), the Neutrosophic 1769
SuperHyperMultipartite is obtained. 1770
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1771
previous result, of the Neutrosophic SuperHyperVertices of the connected 1772
Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 1773
Table 5. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Neutrosophic SuperHyperMultipartite
10 Wondering Open Problems But As The 1775
Directions To Forming The Motivations 1776
In what follows, some “problems” and some “questions” are proposed. 1777
The SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 1778
are defined on a real-world application, titled “Cancer’s Recognitions”. 1779
Question 10.1. Which the else SuperHyperModels could be defined based on Cancer’s 1780
recognitions? 1781
Question 10.2. Are there some SuperHyperNotions related to 1782
SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut? 1783
Question 10.3. Are there some Algorithms to be defined on the SuperHyperModels to 1784
compute them? 1785
Question 10.4. Which the SuperHyperNotions are related to beyond the 1786
SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut? 1787
Problem 10.5. The SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic 1788
SuperHyperHamiltonian-Type-Cycle-Cut do a SuperHyperModel for the Cancer’s recognitions and 1789
they’re based on SuperHyperHamiltonian-Type-Cycle-Cut, are there else? 1790
Problem 10.6. Which the fundamental SuperHyperNumbers are related to these 1791
SuperHyperNumbers types-results? 1792
Problem 10.7. What’s the independent research based on Cancer’s recognitions 1793
concerning the multiple types of SuperHyperNotions? 1794
11 Conclusion and Closing Remarks 1795
In this section, concluding remarks and closing remarks are represented. The drawbacks 1796
of this research are illustrated. Some benefits and some advantages of this research are 1797
highlighted. 1798
This research uses some approaches to make Neutrosophic SuperHyperGraphs more 1799
understandable. In this endeavor, two SuperHyperNotions are defined on the 1800
SuperHyperHamiltonian-Type-Cycle-Cut. For that sake in the second definition, the main definition 1801
of the Neutrosophic SuperHyperGraph is redefined on the position of the alphabets. 1802
Based on the new definition for the Neutrosophic SuperHyperGraph, the new 1803
SuperHyperNotion, Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, finds the convenient 1804
background to implement some results based on that. Some SuperHyperClasses and some 1805
Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 1806
regions where are under the attacks of the cancer to recognize this disease as it’s 1807
mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the 1808
SuperHyperNotion, SuperHyperHamiltonian-Type-Cycle-Cut, the new SuperHyperClasses and 1809
SuperHyperClasses, are introduced. Some general results are gathered in the section on 1810
the SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 1811
The clarifications, instances and literature reviews have taken the whole way through. In 1812
this research, the literature reviews have fulfilled the lines containing the notions and the 1813
results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 1814
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of 1815
this research. Sometimes the cancer has been happened on the region, full of cells, groups 1816
of cells and embedded styles. In this segment, the SuperHyperModel proposes some 1817
SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 1818
and strongest styles with the formation of the design and the architecture are formally 1819
called “ SuperHyperHamiltonian-Type-Cycle-Cut” in the themes of jargons and buzzwords. The 1820
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 1821
background for the SuperHyperNotions. In the Table (6), benefits and avenues for this
Table 6. An Overlook On This Research And Beyond

Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Type-Cycle-Cut
3. Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies
1822
research are, figured out, pointed out and spoken out. 1823
12 Neutrosophic SuperHyperDuality But As The 1824
Extensions Excerpt From Dense And Super 1825
Forms 1826
Definition 12.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 1827
(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 1831
such that Va ∈ Ei , Ej ; 1832
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 1833
such that Va ∈ Ei , Ej and 1834
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1835
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1836
such that Vi , Vj ∈ Ea ; 1837
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1838
such that Vi , Vj ∈ Ea and 1839
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1840
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1841
e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1842
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality. 1843
Definition 12.2. ((Neutrosophic) SuperHyperDuality). 1844
(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic 1847
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1849
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1850
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1851
Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1852
Extreme SuperHyperDuality; 1854
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1855
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1858
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1859
Neutrosophic SuperHyperDuality; 1862
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1863
Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1864
Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1865
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1866
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1867
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 1868
an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1869
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1870
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1871
Extreme coefficient; 1872
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1873
of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1874
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1876
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1877
defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1878
SuperHyperDuality; and the Neutrosophic power is corresponded to its 1882
Neutrosophic coefficient; 1883
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic 1884
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 1889
the Extreme SuperHyperDuality; 1891
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic 1892
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1896
Neutrosophic SuperHyperDuality; 1899
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 1900
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 1905
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1906
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1908
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1910
SuperHyperDuality; and the Neutrosophic power is corresponded to its 1919
Neutrosophic coefficient. 1920
SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1924
straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is 1925
a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 1926
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one 1927
Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, 1928
V3 is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge 1929
has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , 1930
is excluded in every given Neutrosophic SuperHyperDuality. 1931
C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 3z.
straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 1934
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 1935
SuperHyperDuality. 1940


C(N SHG)Neutrosophic SuperHyperDuality = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+17i=0 }.
C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .

4 × 5 × 5z 3 .
C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+13i=0 , V15 }.

4 × 5 × 5z 3 .

3 × 3z 2 .

C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4

3 × 3z 2 .



(2 × 1 × 2) + (2 × 4 × 5)z.

(1 × 1 × 2)z.

(2 × 2 × 2)z.
C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V2i+1i=05 }.



C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
Proposition 12.4. Assume a connected Neutrosophic SuperHyperPath 2003
ESHP : (V, E). Then 2004
C(N SHG)Neutrosophic SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality
= {ViEXT ERN AL }i=1 3

.
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 2005
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Neutrosophic Cardinality , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality .
3 3

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 2009
Neutrosophic SuperHyperModel (23), is the SuperHyperDuality. 2013
Proposition 12.6. Assume a connected Neutrosophic SuperHyperCycle 2014
ESHC : (V, E). Then 2015
C(N SHG)Neutrosophic SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality

.
Proof. Let 2016
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Then 2027
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 2028
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperDuality. 2038
C(N SHG)Neutrosophic Quasi-SuperHyperDuality

= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
X
=( (min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |)choose|Pi ESHG:(V,E) |)
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
= {ViEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality
Proof. Let 2041
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

straightforward. Then there’s at least one SuperHyperDuality. Thus the notion of quasi 2046
isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 2047
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2048
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic 2050
solution 2053
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperModel (26), is the Neutrosophic SuperHyperDuality. 2060

= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Proof. Let 2063
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic 2064

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 2070
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
solution 2075
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is the Neutrosophic SuperHyperDuality. 2083
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
|z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 2086
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Neutrosophic Cardinality +1
ESHG:(V,E) Neutrosophic Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperWheel 2087
ESHW : (V, E). There’s a new way to redefine as 2088

∃!Ez∗ ∈ EESHG:(V,E)
∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∃!Ez∗ ∈ EESHG:(V,E)
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .
The unique embedded SuperHyperDuality proposes some longest SuperHyperDuality 2093
excerpt from some representatives. The latter is straightforward. 2094
13 Neutrosophic SuperHyperJoin But As The 2101
Forms 2103
Definition 13.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 2104
(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 2108
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2109
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2110
such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2111
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 2113
that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2114
(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 2115
that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2116
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 2118
e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2119
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin. 2120
Definition 13.2. ((Neutrosophic) SuperHyperJoin). 2121
(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 2124
Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and 2125
Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 2126
Extreme SuperHyperJoin; 2131
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 2132
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 2134
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2135
Neutrosophic SuperHyperJoin; 2139
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2140
Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2141
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 2142
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2143
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2148
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2150
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 2153
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2154
Neutrosophic number of the maximum Neutrosophic cardinality of the 2155
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 2159
coefficient; 2160
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic 2161
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2164
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 2165
Extreme SuperHyperJoin; 2168
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic 2169
Neutrosophic SuperHyperJoin; 2176
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 2177
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2185
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2187
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 2196
coefficient. 2197
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2201
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 2202
E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 2203
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 2204
there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 2205
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2206
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 2207
Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2208
SuperHyperJoin. 2209
C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z 3 .


C(N SHG)Neutrosophic SuperHyperJoin = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 15z 2 .

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V5 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic SuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V3i+17i=0 }.
C(N SHG)Neutrosophic SuperHyperJoin = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .

4 × 5 × 5z 3 .
C(N SHG)Neutrosophic SuperHyperJoin = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic R-SuperHyperJoin = {V3i+13i=0 , V15 }.

4 × 5 × 5z 3 .

3 × 3z 2 .

C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , Vii610=5,7,8 }.
i=4

3 × 3z 2 .



(1 × 5 × 5) + (1 × 2 + 1)z 3 .

C(N SHG)Neutrosophic R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .

C(N SHG)Neutrosophic R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .
C(N SHG)Neutrosophic SuperHyperJoin = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-SuperHyperJoin = {V2i+1i=05 }.


C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 10z.

C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .
C(N SHG)Neutrosophic SuperHyperJoin =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin

.
Proof. Let 2283
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2287
Neutrosophic SuperHyperModel (23), is the SuperHyperJoin. 2291

= {Ei }i=1 3
.
= 3z 3 .

.
Proof. Let 2294
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Then 2305
C(N SHG)Neutrosophic Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperJoin SuperHyperPolynomial
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.
Proof. Let 2306

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperJoin. 2316
C(N SHG)Neutrosophic Quasi-SuperHyperJoin

= (PERFECT MATCHING).
{Ei ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Proof. Let 2319
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 2324
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2325
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2326
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 2328
ESHB : (V, E). Thus only some SuperHyperVertices and only 2329
solution 2331
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperModel (26), is the Neutrosophic SuperHyperJoin. 2338

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Proof. Let 2341
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic 2342

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 2346
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2347
There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 2348
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
solution 2353
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is the Neutrosophic SuperHyperJoin. 2361

= {Ei }i=1 3
.
= 3z 3 .

.
Proof. Let 2364
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel 2365

straightforward. Then there’s at least one SuperHyperJoin. Thus the notion of quasi 2369
isn’t up and the SuperHyperNotions based on SuperHyperJoin could be applied. The 2370
unique embedded SuperHyperJoin proposes some longest SuperHyperJoin excerpt from 2371
some representatives. The latter is straightforward. 2372
14 Neutrosophic SuperHyperPerfect But As The 2379
Forms 2381
Definition 14.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 2382
(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 2386
such that Va ∈ Ei , Ej ; 2387
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 2388
such that Va ∈ Ei , Ej ; and 2389
(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 2391
such that Vi , Vj ∈ Ea ; 2392
(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 2393
such that Vi , Vj ∈ Ea ; and 2394
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 2396
e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 2397
v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect. 2398
Definition 14.2. ((Neutrosophic) SuperHyperPerfect). 2399
(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic 2402
v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 2404
Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 2407
Extreme SuperHyperPerfect; 2409
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 2410
Neutrosophic SuperHyperPerfect; 2417
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2418
Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2419
Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 2420
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2426
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 2428
of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2429
SuperHyperPerfect; and the Neutrosophic power is corresponded to its 2437
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic 2439
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 2444
the Extreme SuperHyperPerfect; 2446
(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic 2447
Neutrosophic SuperHyperPerfect; 2454
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 2455
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2463
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 2465
SuperHyperPerfect; and the Neutrosophic power is corresponded to its 2474
SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2479
SuperHyperPerfect. 2487
C(N SHG)Neutrosophic SuperHyperPerfect = {E4 }.

C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = 3z.


C(N SHG)Neutrosophic SuperHyperPerfect = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = 15z 2 .

C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Neutrosophic SuperHyperPerfect = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V3i+17i=0 }.
C(N SHG)Neutrosophic SuperHyperPerfect = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .

3 × 4 × 4z 3 .
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V3i+13i=0 , V15 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .

3 × 4 × 4z 3 .

3 × 2z 2 .

C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 , Vii610=5,7,8 }.
i=4

3 × 3z 2 .



C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V2 , V7 , V17 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 5 × 5) + (1 × 2 + 1)z 3 .

C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .

C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .
C(N SHG)Neutrosophic SuperHyperPerfect = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V2i+1i=05 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 2z 6 .



C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V3 , V6 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .
C(N SHG)Neutrosophic SuperHyperPerfect =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect

.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 2561
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2565
Neutrosophic SuperHyperModel (23), is the SuperHyperPerfect. 2569
C(N SHG)Neutrosophic SuperHyperPerfect =

= {Ei }i=1 3
.
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect

.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 2572
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Then 2583
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 2584

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperPerfect. 2594
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 2597
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 2602
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2603
applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2604
one SuperHyperVertex as the representative in the 2605
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic 2606
solution 2609
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperModel (26), is the Neutrosophic SuperHyperPerfect. 2616

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 2619
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic 2620

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 2624
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2625
applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2626
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
solution 2631
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is the Neutrosophic SuperHyperPerfect. 2639
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 2642

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 2643

straightforward. Then there’s at least one SuperHyperPerfect. Thus the notion of quasi 2647
isn’t up and the SuperHyperNotions based on SuperHyperPerfect could be applied. The 2648
unique embedded SuperHyperPerfect proposes some longest SuperHyperPerfect excerpt 2649
from some representatives. The latter is straightforward. 2650
15 Neutrosophic SuperHyperTotal But As The 2657
Forms 2659
Definition 15.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 2660
(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2664
that Va ∈ Ei , Ej ; 2665
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2666
that Va ∈ Ei , Ej ; and 2667
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2669
that Vi , Vj ∈ Ea ; 2670
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2671
that Vi , Vj ∈ Ea ; and 2672
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2674
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2675
v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal. 2676
Definition 15.2. ((Neutrosophic) SuperHyperTotal). 2677
(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic 2680
v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2682
Extreme SuperHyperTotal; 2687
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2688
v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2690
Neutrosophic SuperHyperTotal; 2695
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2696
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2697
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2704
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2706
SuperHyperTotal; and the Neutrosophic power is corresponded to its 2715
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic 2717
Extreme SuperHyperTotal; 2724
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic 2725
Neutrosophic SuperHyperTotal; 2732
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2733
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2741
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2743
SuperHyperTotal; and the Neutrosophic power is corresponded to its 2752
SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2757
SuperHyperTotal. 2765
C(N SHG)Neutrosophic Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.


C(N SHG)Neutrosophic Quasi- = {E4 , E2 }.

C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {V1 , V4 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = 15z 2 .

C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Neutrosophic SuperHyperTotal = {Ei+19i=0 }.

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 20z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial = 20z 10 .
C(N SHG)Extreme SuperHyperTotal = {E12 , E13 , E14 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
3 × 4 × 4z 3 .

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Extreme Quasi-SuperHyperTotal = {E5 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
3 × 4 × 4z 3 .
C(N SHG)Extreme SuperHyperTotal = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V5 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme SuperHyperTotal = {E1 , E2 }.

C(N SHG)Extreme R-SuperHyperTotal = {V1 , Vii68=4,5,6 }.
i=1




4 × 3z 3 .

C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 , V6 , V17 }.
4 × 3z 4 .

C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 , V6 , V17 }.
2 × 4 × 3z 4 .

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = 11z 10 .

C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
= |(|V | − 1)z 2 .
C(N SHG)Neutrosophic SuperHyperTotal = {E1 , E2 }.

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {V1 , V2 }.

C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .
C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2
Proof. Let 2839
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2843
Neutrosophic SuperHyperModel (23), is the SuperHyperTotal. 2847
C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2
Proof. Let 2850
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Neutrosophic Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1

Then 2861
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.
Proof. Let 2862
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperTotal. 2872
C(N SHG)Neutrosophic SuperHyperTotal

= {Ea ∈ EPi ESHG:(V,E) ,
i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
= {VaEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 2875
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2880
quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2881
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic 2884
solution 2887
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
SuperHyperModel (26), is the Neutrosophic SuperHyperTotal. 2894

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 2897
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic 2898

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2902
quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2903
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
solution 2909
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is the Neutrosophic SuperHyperTotal. 2917
∗
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality
|z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.
Proof. Let 2920
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel 2921

straightforward. Then there’s at least one SuperHyperTotal. Thus the notion of quasi 2925
isn’t up and the SuperHyperNotions based on SuperHyperTotal could be applied. The 2926
unique embedded SuperHyperTotal proposes some longest SuperHyperTotal excerpt 2927
from some representatives. The latter is straightforward. 2928
16 Neutrosophic SuperHyperConnected But As 2935
The Extensions Excerpt From Dense And Super 2936
Forms 2937
Definition 16.1. (Different Neutrosophic Types of Neutrosophic 2938
SuperHyperConnected). 2939
(i) Neutrosophic e-SuperHyperConnected if 2943
∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such 2944
that Va 6∈ Ei , Ej ; 2945
(ii) Neutrosophic re-SuperHyperConnected if 2946
∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such 2947
that Va 6∈ Ei , Ej ; and 2948
(iii) Neutrosophic v-SuperHyperConnected if 2950
∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such 2951
that Vi , Vj 6∈ Ea ; 2952
(iv) Neutrosophic rv-SuperHyperConnected if 2953
∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that 2954
Vi , Vj 6∈ Ea ; and 2955
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2957
e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2958
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected. 2959
Definition 16.2. ((Neutrosophic) SuperHyperConnected). 2960
(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic 2963
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2965
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2966
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2967
of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of 2968
the Extreme SuperHyperConnected; 2970
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2971
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 2974
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2975
Neutrosophic SuperHyperConnected; 2978
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2979
of Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, 2980
Neutrosophic v-SuperHyperConnected, and Neutrosophic 2981
rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 2982
coefficients defined as the Extreme number of the maximum Extreme cardinality 2984
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 2985
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2986
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and 2987
the Extreme power is corresponded to its Extreme coefficient; 2988
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s 2989
either of Neutrosophic e-SuperHyperConnected, Neutrosophic 2990
re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 2991
Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 2992
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2995
they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 2998
corresponded to its Neutrosophic coefficient; 2999
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic 3000
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3003
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 3004
of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 3005
the Extreme SuperHyperConnected; 3007
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic 3008
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 3011
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 3012
they form the Neutrosophic SuperHyperConnected; 3015
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s 3016
Neutrosophic rv-SuperHyperConnected and C(N SHG) for an Extreme 3019
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 3022
Extreme SuperHyperConnected; and the Extreme power is corresponded to its 3025
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s 3027
Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 3030
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 3033
they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 3036
corresponded to its Neutrosophic coefficient. 3037
SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3041
SuperHyperConnected. 3049
C(N SHG)Neutrosophic SuperHyperConnected = {E4 }.

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperConnected = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = 3z.


C(N SHG)Neutrosophic SuperHyperConnected = {E1 , E2 , E4 }.

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {V1 , V4 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial = 15z 2 .

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Neutrosophic Quasi-SuperHyperConnected = {Ei+19i=0 }.

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial 20z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+19i=0 }.
C(N SHG)Extreme SuperHyperConnected = {E12 , E13 , E14 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperConnected = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial =
3 × 4 × 4z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .
C(N SHG)Extreme SuperHyperConnected = {E5 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
3 × 4 × 4z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V5 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme SuperHyperConnected = {E1 , E2 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , Vii68=4,5,6 }.
i=1
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = z 5 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E9 , E6 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 3z 3 .
C(N SHG)Extreme R-SuperHyperConnected = {V1 , V5 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z 2 .

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V1 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V2 , V3 , V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme SuperHyperConnected = {E2 , E3 , E4 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
4 × 3z 3 .

C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial =
4 × 3z 4 .

C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial =
2 × 4 × 3z 4 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+2i=011 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 10z.
C(N SHG)Extreme R-SuperHyperConnected = {V1 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.

C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E4 }.

C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
= 3 × 6z 3 .
C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

−2
= {Ei }i=1 .
C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic −2
=z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected
= {ViEXT ERN AL }i=1 Cardinality
.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 3123
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 3127
Neutrosophic SuperHyperModel (23), is the SuperHyperConnected. 3131
C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

−2
= {Ei }i=1 .
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected
= {ViEXT ERN AL }i=1 Cardinality
.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 3134
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

Then 3145
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |EESHG:(V,E) |Neutrosophic Cardinality z.
C(N SHG)Neutrosophic R-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 3146
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperConnected. 3156
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Neutrosophic V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 3159
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 3164
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 3165
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic 3168
solution 3171
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
SuperHyperModel (26), is the Neutrosophic SuperHyperConnected. 3178
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Neutrosophic V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 3181
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 3186
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 3187
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
solution 3193
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is the Neutrosophic SuperHyperConnected. 3201
∗
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 3204
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 3206

straightforward. Then there’s at least one SuperHyperConnected. Thus the notion of 3209
quasi isn’t up and the SuperHyperNotions based on SuperHyperConnected could be 3210
applied. The unique embedded SuperHyperConnected proposes some longest 3211
SuperHyperConnected excerpt from some representatives. The latter is 3212
17 Background 3220
There are some scientific researches covering the topic of this research. In what follows, 3221
there are some discussion and literature reviews about them. 3222
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and 3223
neutrosophic degree alongside chromatic numbers in the setting of some classes related 3224
to neutrosophic hypergraphs” in Ref. [1] by Henry Garrett (2022). In this research 3225
article, a novel approach is implemented on SuperHyperGraph and neutrosophic 3226
SuperHyperGraph based on general forms without using neutrosophic classes of 3227
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 3228
entitled “Journal of Current Trends in Computer Science Research (JCTCSR)” with 3229
ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 3230
06-14. The research article studies deeply with choosing neutrosophic hypergraphs 3231
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 3232
results based on initial background. 3233
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and 3234
Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in 3235
Game Theory and Neutrosophic Super Hyper Classes” in Ref. [2] by Henry Garrett 3236
(2022). In this research article, a novel approach is implemented on SuperHyperGraph 3237
and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and using 3238
neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s published in 3239
prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 3240
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques 3241
Comput Math” in volume 1 and issue 3 with pages 242-263. The research article studies 3242
deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s 3243
the breakthrough toward independent results based on initial background and fundamental 3244
SuperHyperNumbers. 3245
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 3246
and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 3247
Graphs Alongside Applications in Cancer’s Treatments” in Ref. [3] by Henry Garrett 3248
(2023). In this research article, a novel approach is implemented on SuperHyperGraph 3249
and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 3250
in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 3251
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 3252
ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 3253
pages 35-47. The research article studies deeply with choosing directly neutrosophic 3254
SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 3255
results based on initial background and fundamental SuperHyperNumbers. 3256
In some articles are titled “0039 — Closing Numbers and Super-Closing Numbers as 3257
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 3258
(Neutrosophic)n-SuperHyperGraph” in Ref. [5] by Henry Garrett (2022), “0049 — 3259
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [6] by Henry Garrett 3260
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 3261
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 3262
in Ref. [7] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 3263
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 3264
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [8] by 3265
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3266
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [9] by Henry Garrett (2022), 3267
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 3268
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 3269
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 3270
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [10] by Henry 3271
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case 3272
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition 3273
Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [11] by Henry Garrett (2022), 3274
“Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 3275
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in 3276
Ref. [12] by Henry Garrett (2022), “Extremism of the Attacked Body Under the 3277
Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3278
SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 3279
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 3280
Ref. [14] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 3281
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 3282
Special ViewPoints” in Ref. [15] by Henry Garrett (2022), “Neutrosophic 1-Failed 3283
SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 3284
on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [16] by Henry Garrett 3285
(2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 3286
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [17] by Henry Garrett 3287
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 3288
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3289
in Ref. [13] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 3290
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 3291
And (Neutrosophic) SuperHyperGraphs” in Ref. [18] by Henry Garrett (2022), 3292
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 3293
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [19] by 3294
Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3295
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [20] by 3296
Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3297
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 3298
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 3299
(Neutrosophic) SuperHyperClasses” in Ref. [21] by Henry Garrett (2022), 3300
“SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With 3301
SuperHyperModeling of Cancer’s Recognitions” in Ref. [22] by Henry Garrett (2022), 3302
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 3303
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 3304
Treatments” in Ref. [23] by Henry Garrett (2022), “SuperHyperDominating and 3305
SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 3306
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [24] by Henry Garrett 3307
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 3308
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [132] by Henry 3309
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 3310
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set 3311
and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [133] by Henry Garrett 3312
(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 3313
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels 3314
Named (Neutrosophic) SuperHyperGraphs” in Ref. [134] by Henry Garrett (2023), 3315
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks 3316
In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called 3317
Neutrosophic SuperHyperGraphs” in Ref. [135] by Henry Garrett (2023), “Perfect 3318
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 3319
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [138] by 3320
Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded 3321
Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 3322
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [139] by Henry 3323
Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 3324
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 3325
the Form of Neutrosophic SuperHyperGraphs” in Ref. [142] by Henry Garrett (2023), 3326
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 3327
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [145] by Henry 3328
Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 3329
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3330
in Ref. [146] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 3331
Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 3332
Ref. [147] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 3333
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 3334
Recognition And Beyond” in Ref. [148] by Henry Garrett (2022), “(Neutrosophic) 3335
1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) 3336
SuperHyperGraphs” in Ref. [149] by Henry Garrett (2022), “Basic Notions on 3337
(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 3338
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [150] by Henry Garrett 3339
(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 3340
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [161] by Henry 3341
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 3342
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 3343
SuperHyperGraph (NSHG)” in Ref. [162] by Henry Garrett (2022), and [4–162], there 3344
are some endeavors to formalize the basic SuperHyperNotions about neutrosophic 3345
SuperHyperGraph and SuperHyperGraph alongside scientific research books at [163–257]. 3346
Two popular scientific research books in Scribd in the terms of high readers, 4190 and 3347
5189 respectively, on neutrosophic science is on [258, 259]. 3348
Some scientific studies and scientific researches about neutrosophic graphs, are 3349
proposed as book in Ref. [246] by Henry Garrett (2023) which is indexed by Google 3350
Scholar and has more than 4190 readers in Scribd. It’s titled “Beyond Neutrosophic 3351
Graphs” and published by Dr. Henry Garrett. This research book covers different types 3352
of notions and settings in neutrosophic graph theory and neutrosophic SuperHyperGraph 3353
theory. 3354
Also, some scientific studies and scientific researches about neutrosophic graphs, are 3355
proposed as book in Ref. [247] by Henry Garrett (2023) which is indexed by Google 3356
Scholar and has more than 5189 readers in Scribd. It’s titled “Neutrosophic Duality” 3357
and published by Dr. Henry Garrett. This research book presents different types of 3358
notions SuperHyperResolving and SuperHyperDominating in the setting of duality in 3359
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research 3360
book has scrutiny on the complement of the intended set and the intended set, 3361
simultaneously. It’s smart to consider a set but acting on its complement that what’s 3362
done in this research book which is popular in the terms of high readers in Scribd. 3363
See the seminal scientific researches [1–3]. The formalization of the notions on the 3364
framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 3365
theory, and (Neutrosophic) SuperHyperGraphs theory at [4–162] alongside scientific 3366
research books at [163–257]. Two popular scientific research books in Scribd in the terms 3367
of high readers, 4190 and 5189 respectively, on neutrosophic science is on [258, 259]. 3368
References 3369
1. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 3370
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 3371
Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. 3372
2. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 3373
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 3374
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 3375
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 3376
3. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 3377
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 3378
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 3379
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 3380
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 3381
graphs-and-super-hyper-graphs-alongside-a.pdf) 3382
4. Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 3383
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 3384
Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 3385
(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 3386
research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by-eulerian- 3387
super-hyper-cycles-and-hamiltonian-sets-.pdf) 3388
5. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 3389
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 3390
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 3391
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 3392
Research, https://doi.org/10.5281/zenodo.6319942. 3393
https://oa.mg/work/10.5281/zenodo.6319942 3394
6. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 3395
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 3396
2022. CERN European Organization for Nuclear Research, 3397
https://doi.org/10.13140/rg.2.2.35241.26724. 3398
https://oa.mg/work/10.13140/rg.2.2.35241.26724 3399
7. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 3400
Confrontation under Cancer’s Recognition as the Model in The Setting of 3401
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 3402
10.20944/preprints202301.0308.v1). 3403
8. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 3404
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3405
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3406
2023010282 (doi: 10.20944/preprints202301.0282.v1). 3407
9. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 3408
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 3409
2023010267 (doi: 10.20944/preprints202301.0267.v1). 3410
10. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3411
Affected Cells Toward The Totality Under Cancer’s Recognition By New 3412
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3413
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3414
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3415
10.20944/preprints202301.0265.v1). 3416
11. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 3417
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3418
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3419
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3420
12. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3421
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3422
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3423
10.20944/preprints202301.0240.v1). 3424
13. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3425
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3426
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3427
10.20944/preprints202301.0224.v1). 3428
14. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3429
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3430
2023010105 (doi: 10.20944/preprints202301.0105.v1). 3431
15. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3432
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 3433
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 3434
10.20944/preprints202301.0088.v1). 3435
16. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3436
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3437
Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3438
17. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3439
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3440
2023010043 (doi: 10.20944/preprints202301.0043.v1). 3441
18. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3442
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3443
10.20944/preprints202301.0105.v1). 3445
10.20944/preprints202301.0088.v1). 3449
20. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3450
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3451
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3452
21. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3453
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 3454
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 3455
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3456
2022120540 (doi: 10.20944/preprints202212.0540.v1). 3457
22. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3458
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3459
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3460
23. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3461
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3462
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3463
10.20944/preprints202212.0324.v1). 3464
24. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3465
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3466
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3467
10.20944/preprints202211.0576.v1). 3468
25. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3469
SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super 3470
Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7796334). 3471
SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress 3473
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). 3474
SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super 3476
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7791952). 3477
28. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 3478
Hamiltonian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3479
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7791982). 3480
SuperHyperGraph By Hamiltonian-Neighbor As Hyper Nebbish On Super 3482
Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7790026). 3483
30. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3484
Hamiltonian-Neighbor In Recognition of Cancer With (Neutrosophic) 3485
SuperHyperGraph By Hamiltonian-Decomposition As Hyper Decompress On 3488
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7787066). 3489
32. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3490
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) 3491
SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, 3494
Zenodo 2023, (doi: 10.5281/zenodo.7781476). 3495
34. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 3496
Hamiltonian-Cut In Recognition of Cancer With (Neutrosophic) 3497
SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, 3500
Zenodo 2023, (doi: 10.5281/zenodo.7777857). 3501
Trace-Neighbor In Recognition of Cancer With (Neutrosophic) 3503
37. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3505
SuperHyperGraph By Trace-Decomposition As Hyper Decompress On Super 3506
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7771831). 3507
Trace-Decomposition In Cancer’s Recognition With (Neutrosophic) 3509
SuperHyperGraph By Trace-Cut As Hyper Nebbish On Super Nebulous”, 3512
ResearchGate 2023, (doi: 10.13140/RG.2.2.20913.25446). 3513
40. Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 3514
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 3515
(doi: 10.5281/zenodo.7764916). 3516
SuperHyperGraph By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, 3518
Edge-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 3521
SuperHyperGraph By Edge-Decomposition As Hyper Decompress On Super 3524
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22545.10089). 3525
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) 3527
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 3528
SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 3530
2023, (doi: 10.13140/RG.2.2.11377.76644). 3531
46. Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In 3532
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3533
2023, (doi: 10.13140/RG.2.2.23750.96329). 3534
SuperHyperGraph By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, 3536
Vertex-Neighbor In Cancer’s Recognition With (Neutrosophic) 3539
SuperHyperGraph By Vertex-Decomposition As Hyper Decompress On Super 3542
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 3543
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) 3545
SuperHyperGraph By Vertex-Cut As Hyper Vertu On Super Vertigo”, 3548
52. Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 3550
2023, (doi: 10.13140/RG.2.2.32467.25124). 3552
SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, 3554
54. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3556
Stable-Neighbor In Cancer’s Recognition With (Neutrosophic) 3557
SuperHyperGraph By Stable-Decompositions As Hyper Stain On Super Stagy”, 3560
56. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of 3562
Stable-Decompositions In Cancer’s Recognition With (Neutrosophic) 3563
SuperHyperGraph By Stable-Cut As Hyper Stain On Super Stagy”, 3566
58. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 3568
2023, (doi: 10.13140/RG.2.2.20170.24000). 3570
SuperHyperGraph By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, 3572
60. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3574
Clique-Neighbors In Cancer’s Recognition With (Neutrosophic) 3575
SuperHyperGraph By Clique-Decompositions As Hyper Decompile On Super 3578
Decommission”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18780.87683). 3579
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) 3581
SuperHyperGraph By Clique-Cut As Hyper Click On Super Cliche”, 3584
64. Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 3586
2023, (doi: 10.13140/RG.2.2.27392.30721). 3588
SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 3590
2023, (doi: 10.13140/RG.2.2.33028.40321). 3591
SuperHyperGraph By List- Coloring As Hyper List On Super Lisle”, 3593
67. Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 3595
2023, (doi: 10.13140/RG.2.2.16356.04489). 3597
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 3599
2023, (doi: 10.13140/RG.2.2.21756.21129). 3600
69. Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 3601
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, 3602
(doi: 10.13140/RG.2.2.30983.68009). 3603
SuperHyperGraph By Edge-Connectivity As Hyper Disclosure On Super 3605
Closure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28552.29445). 3606
71. Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of 3607
Edge-Connectivity In Cancer’s Recognition With (Neutrosophic) 3608
SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, 3611
73. Henry Garrett, “New Ideas On Super System By Hyper Explosions Of 3613
Vertex-Connectivity In Cancer’s Recognition With (Neutrosophic) 3614
SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, 3617
75. Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of 3619
Tree-Decomposition In Cancer’s Recognition With (Neutrosophic) 3620
SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, 3623
77. Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 3625
2023, (doi: 10.13140/RG.2.2.11172.14720). 3627
SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On 3629
Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). 3630
79. Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of 3631
SuperHyper(i,j)-Domination In Cancer’s Recognition With (Neutrosophic) 3632
SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On 3635
Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 3636
81. Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of 3637
SuperHyperEdge-Domination In Cancer’s Recognition With (Neutrosophic) 3638
SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super 3641
Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 3642
83. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 3643
SuperHyperK-Domination In Cancer’s Recognition With (Neutrosophic) 3644
SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 3647
Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 3648
85. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 3649
SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 3650
SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 3653
Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 3654
87. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 3655
SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 3656
SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 3659
Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 3660
89. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 3661
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 3662
90. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 3664
SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 3665
SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 3668
Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 3669
92. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 3670
SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 3671
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 3674
Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 3675
94. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 3676
SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 3677
SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 3680
96. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 3682
SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 3683
SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super Infections”, 3686
98. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 3688
SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 3689
99. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 3691
SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 3692
SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, 3695
SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 3698
102. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 3700
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 3701
103. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 3703
Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 3704
104. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3706
SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 3707
Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 3708
105. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3709
SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 3710
Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 3711
106. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 3712
SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 3713
107. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 3715
Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 3716
SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 3717
108. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 3718
Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 3719
SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 3720
109. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3721
SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3722
Hyper Covering Versus Super separations-VI”, ResearchGate 2023, (doi: 3723
10.13140/RG.2.2.29913.80482). 3724
Hyper Covering Versus Super separations-V”, ResearchGate 2023, (doi: 3727
10.13140/RG.2.2.33269.24809). 3728
Hyper Covering Versus Super separations-IV”, ResearchGate 2023, (doi: 3731
10.13140/RG.2.2.34946.96960). 3732
112. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3733
Hyper Covering Versus Super separations-III”, ResearchGate 2023, (doi: 3735
10.13140/RG.2.2.14814.31040). 3736
Hyper Covering Versus Super separations-II”, ResearchGate 2023, (doi: 3739
10.13140/RG.2.2.15653.17125). 3740
Hyper Covering Versus Super separations-I”, ResearchGate 2023, (doi: 3743
10.13140/RG.2.2.25719.50089). 3744
115. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 3745
Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 3746
SuperHyperConnectivities”, ResearchGate 2023, (doi: 3747
10.13140/RG.2.2.29441.94562). 3748
116. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 3749
SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 3750
Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 3751
117. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 3752
the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 3753
On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 3754
118. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 3755
and Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions 3756
of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 3757
119. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 3758
theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 3759
Recognition”, Preprints 2023, 2023010396 (doi: 3760
10.20944/preprints202301.0396.v1). 3761
120. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 3762
neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 3763
Recognition”, Preprints 2023, 2023010395 (doi: 3764
10.20944/preprints202301.0395.v1). 3765
121. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 3766
Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 3767
Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 3768
Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 3769
10.13140/RG.2.2.26240.51204). 3770
122. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 3771
Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 3772
Classes With Hyper Effects In The Background of the Framework is So-Called 3773
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 3774
10.13140/RG.2.2.12818.73925). 3775
123. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 3776
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 3777
Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 3778
10.13140/RG.2.2.26836.88960). 3779
124. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 3780
Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 3781
ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 3782
125. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 3783
Confrontation under Cancer’s Recognition as the Model in The Setting of 3784
10.20944/preprints202301.0308.v1). 3786
126. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 3787
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3788
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3789
2023010282 (doi: 10.20944/preprints202301.0282.v1). 3790
127. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3791
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 3792
(doi: 10.20944/preprints202301.0267.v1).). 3793
128. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3794
Affected Cells Toward The Totality Under Cancer’s Recognition By New 3795
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3796
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3797
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3798
10.20944/preprints202301.0265.v1). 3799
129. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 3800
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3801
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3802
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3803
130. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3804
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3805
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3806
10.20944/preprints202301.0240.v1). 3807
131. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3808
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3809
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3810
10.20944/preprints202301.0224.v1). 3811
132. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 3812
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 3813
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 3814
133. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 3815
The Cancer’s Extreme Recognition With Different Types of Extreme 3816
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 3817
134. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3819
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3820
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3821
2023, (doi: 10.13140/RG.2.2.32530.73922). 3822
135. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 3823
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 3824
SuperHyperClique on Cancer’s Recognition called Neutrosophic 3825
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 3826
136. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3827
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3828
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3829
2023, (doi: 10.13140/RG.2.2.32530.73922). 3830
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3832
2023010105 (doi: 10.20944/preprints202301.0105.v1). 3833
138. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 3834
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 3835
139. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 3837
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 3838
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 3839
10.20944/preprints202301.0105.v1). 3844
10.20944/preprints202301.0088.v1). 3848
142. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 3849
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 3850
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 3851
(doi: 10.13140/RG.2.2.17385.36968). 3852
Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3855
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3857
2023010043 (doi: 10.20944/preprints202301.0043.v1). 3858
145. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 3859
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 3860
In Special ViewPoints”, ResearchGate 2023, (doi: 3864
10.13140/RG.2.2.11447.80803). 3865
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 3867
2023, (doi: 10.13140/RG.2.2.35774.77123). 3868
Neutrosophic Recognition And Beyond”, ResearchGate 2022, (doi: 3871
10.13140/RG.2.2.36141.77287). 3872
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3874
10.13140/RG.2.2.29430.88642). 3875
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3878
10.13140/RG.2.2.11369.16487). 3879
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3881
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3882
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 3884
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3889
2022120540 (doi: 10.20944/preprints202212.0540.v1). 3890
Recognitions And Related (Neutrosophic) SuperHyperClasses”, ResearchGate 3894
2022, (doi: 10.13140/RG.2.2.14426.41923). 3895
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3898
ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 3901
157. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 3902
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3903
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3904
10.20944/preprints202212.0324.v1). 3905
158. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3906
Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside Applications 3907
in Cancer’s Treatments”, ResearchGate 2022 (doi: 3908
10.13140/RG.2.2.23123.04641). 3909
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3912
10.20944/preprints202211.0576.v1). 3913
Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 3916
10.13140/RG.2.2.23324.56966). 3917
161. Henry Garrett, “Basic Neutrosophic Notions Concerning 3918
SuperHyperDominating and Neutrosophic SuperHyperResolving in 3919
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244). 3920
162. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 3921
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 3922
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 3923
10.13140/RG.2.2.25385.88160). 3924
163. Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 3925
Henry Garrett, 2023 (doi: 10.5281/zenodo.7793875). 3926
164. Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 3927
Garrett, 2023 (doi: 10.5281/zenodo.7792307). 3928
165. Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry 3929
166. Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry 3931
167. Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 3933
2023 (doi: 10.5281/zenodo.7783791). 3934
168. Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3935
2023 (doi: 10.5281/zenodo.7780123). 3936
169. Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry 3937
170. Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 3939
10.5281/zenodo.7637762). 3940
171. Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3941
(doi: 10.5281/zenodo.7766174). 3942
172. Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3943
2023 (doi: 10.5281/zenodo.7762232). 3944
173. Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry 3945
174. Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3947
(doi: 10.5281/zenodo.7754661). 3948
175. Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3949
2023 (doi: 10.5281/zenodo.7750995) . 3950
176. Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry 3951
177. Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3953
(doi: 10.5281/zenodo.7747236). 3954
178. Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3955
2023 (doi: 10.5281/zenodo.7742587). 3956
179. Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry 3957
180. Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3959
(doi: 10.5281/zenodo.7734719). 3960
181. Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 3961
2023 (doi: 10.5281/zenodo.7730484). 3962
182. Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry 3963
183. Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3965
(doi: 10.5281/zenodo.7722865). 3966
184. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3967
10.5281/zenodo.7713563). 3968
185. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3969
10.5281/zenodo.7709116). 3970
186. Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 3971
2023 (doi: 10.5281/zenodo.7706415). 3972
187. Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 3973
2023 (doi: 10.5281/zenodo.7706063). 3974
188. Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 3975
2023 (doi: 10.5281/zenodo.7701906). 3976
189. Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3977
10.5281/zenodo.7700205). 3978
190. Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 3979
2023 (doi: 10.5281/zenodo.7694876). 3980
191. Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 3981
2023 (doi: 10.5281/zenodo.7679410). 3982
192. Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 3983
2023 (doi: 10.5281/zenodo.7675982). 3984
193. Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3985
(doi: 10.5281/zenodo.7672388). 3986
194. Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3987
10.5281/zenodo.7668648). 3988
195. Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3989
10.5281/zenodo.7662810). 3990
196. Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3991
(doi: 10.5281/zenodo.7659162). 3992
197. Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3993
10.5281/zenodo.7653233). 3994
198. Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 3995
10.5281/zenodo.7653204). 3996
199. Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 3997
10.5281/zenodo.7653142). 3998
200. Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 3999
10.5281/zenodo.7653117). 4000
201. Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 4001
10.5281/zenodo.7653089). 4002
202. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4003
10.5281/zenodo.7651687). 4004
203. Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 4005
10.5281/zenodo.7651619). 4006
204. Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 4007
10.5281/zenodo.7651439). 4008
205. Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 4009
10.5281/zenodo.7650729). 4010
206. Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 4011
10.5281/zenodo.7647868). 4012
207. Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 4013
10.5281/zenodo.7647017). 4014
208. Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 4015
10.5281/zenodo.7644894). 4016
209. Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 4017
10.5281/zenodo.7641880). 4018
210. Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 4019
10.5281/zenodo.7632923). 4020
211. Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 4021
10.5281/zenodo.7623459). 4022
212. Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 4023
2023 (doi: 10.5281/zenodo.7606416). 4024
213. Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 4025
(doi: 10.5281/zenodo.7606416). 4026
214. Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4027
10.5281/zenodo.7606404). 4028
215. Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4029
10.5281/zenodo.7580018). 4030
216. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4031
10.5281/zenodo.7580018). 4032
217. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4033
10.5281/zenodo.7580018). 4034
218. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4035
10.5281/zenodo.7579929). 4036
219. Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4037
10.5281/zenodo.7563170). 4038
220. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4039
10.5281/zenodo.7563164). 4040
221. Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4041
10.5281/zenodo.7563160). 4042
222. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4043
10.5281/zenodo.7563160). 4044
223. Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4045
10.5281/zenodo.7563160). 4046
224. Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 4047
(doi: 10.5281/zenodo.7557063). 4048
225. Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4049
10.5281/zenodo.7557009). 4050
226. Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 4051
(doi: 10.5281/zenodo.7539484). 4052
227. Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 4053
2023 (doi: 10.5281/zenodo.7523390). 4054
228. Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 4055
(doi: 10.5281/zenodo.7523390). 4056
229. Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 4057
2023 (doi: 10.5281/zenodo.7523390). 4058
230. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4059
10.5281/zenodo.7574952). 4060
231. Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 4061
(doi: 10.5281/zenodo.7574992). 4062
232. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4063
10.5281/zenodo.7523357). 4064
233. Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4065
10.5281/zenodo.7523357). 4066
234. Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 4067
2023 (doi: 10.5281/zenodo.7504782). 4068
235. Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 4069
(doi: 10.5281/zenodo.7504782). 4070
236. Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 4071
2023 (doi: 10.5281/zenodo.7504782). 4072
237. Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4073
10.5281/zenodo.7499395). 4074
238. Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4075
10.5281/zenodo.7499395). 4076
239. Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4077
10.5281/zenodo.7499395). 4078
240. Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 4079
2023 (doi: 10.5281/zenodo.7497450). 4080
241. Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 4081
(doi: 10.5281/zenodo.7497450). 4082
242. Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 4083
(doi: 10.5281/zenodo.7494862). 4084
243. Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4085
10.5281/zenodo.7494862). 4086
244. Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 4087
(doi: 10.5281/zenodo.7494862). 4088
245. Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 4089
(doi: 10.5281/zenodo.7493845). 4090
246. Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4091
10.5281/zenodo.7493845). 4092
247. Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 4093
(doi: 10.5281/zenodo.7493845). 4094
248. Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4095
10.5281/zenodo.7539484). 4096
249. Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4097
10.5281/zenodo.7523390). 4098
250. Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4099
10.5281/zenodo.7523357). 4100
251. Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4101
10.5281/zenodo.7504782). 4102
252. Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4103
10.5281/zenodo.7499395). 4104
253. Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4105
10.5281/zenodo.7497450). 4106
254. Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4107
10.5281/zenodo.7494862). 4108
255. Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4109
10.5281/zenodo.7493845). 4110
256. Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4111
10.5281/zenodo.7480110). 4112
257. Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 4113
10.5281/zenodo.7378758). 4114
258. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 4115
10.5281/zenodo.6320305). 4116
259. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 4117
10.5281/zenodo.6677173). 4118
View publication stats

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy

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

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy

Uploaded by

Copyright:

Available Formats

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

New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By

Preprint · April 2023

421 PUBLICATIONS 9,876 CITATIONS

On Algebraic Structures and Algebraic Hyperstructures View project

Metric Dimension in fuzzy(neutrosophic) Graphs View project

The user has requested enhancement of the downloaded file.

New Ideas In Recognition of Cancer And Neutrosophic 2

Hyper Hamper On Super Hammy 4

Henry Garrett · Independent Researcher · Department of Mathematics · 6

DrHenryGarrett@gmail.com · Manhattan, NY, USA 7

In this scientific research, (Different Neutrosophic Types of Neutrosophic 9

SuperHyperHamiltonian-Type-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) 10

S is a Hamiltonian-Type-Cycle-Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet 11

V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 12

Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called 13

Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 14

Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called 15

Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 16

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 17

v-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutrosophic 18

v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 19

Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called 20

Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 21

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 22

SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 23

e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, 24

Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic 25

rv-SuperHyperHamiltonian-Type-Cycle-Cut. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Cut). 26

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 27

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an 28

Extreme SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 29

e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, 30

Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic 31

rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 32

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 33

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 34

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 35

that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; a Neutrosophic 36

SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 37

e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, 38

Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic 39

rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 40

SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 41

Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 42

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 43

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 44

SuperHyperHamiltonian-Type-Cycle-Cut; an Extreme SuperHyperHamiltonian-Type-Cycle-Cut 45

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, 46

Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 47

v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic 48

rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 49

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 50

Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 52

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 53

corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 55

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, 56

Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 57

v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic 58

rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 59

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 60

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 61

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 62