New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous

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

Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous
Preprint · April 2023

DOI: 10.5281/zenodo.7851519
CITATIONS
1 author:
Henry Garrett
452 PUBLICATIONS 13,219 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Metric Dimension in fuzzy(neutrosophic) Graphs View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 21 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 Eulerian-Type-Path-Neighbor As 3
Hyper Nebbish On Super Nebulous 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
SuperHyperEulerian-Type-Path-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) 10
S is a Eulerian-Type-Path-Neighbor 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-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called 13
Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 14
∀N (Ea ) ∈ P : P is
a SuperHyperPath and it has
the maximum number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called 15
Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 16
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 17
v-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutrosophic 18
v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 19
∀N (Va ) ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called 20
Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 21
∀N (Va ) ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 22
SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 23
e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, 24
Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic 25
rv-SuperHyperEulerian-Type-Path-Neighbor. ((Neutrosophic) SuperHyperEulerian-Type-Path-Neighbor). 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 SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 29
rv-SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor; a Neutrosophic 36
SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 37
rv-SuperHyperEulerian-Type-Path-Neighbor 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
SuperHyperEulerian-Type-Path-Neighbor; an Extreme SuperHyperEulerian-Type-Path-Neighbor 45
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, 46
Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 47
v-SuperHyperEulerian-Type-Path-Neighbor, 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 SuperHyperEulerian-Type-Path-Neighbor; and the Extreme power is 54
corresponded to its Extreme coefficient; a Neutrosophic 55
SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial if it’s either of Neutrosophic 56
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 SuperHyperEulerian-Type-Path-Neighbor; and the Neutrosophic power is 65
corresponded to its Neutrosophic coefficient; an Extreme 66
V-SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor; a Neutrosophic 74
V-SuperHyperEulerian-Type-Path-Neighbor 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
SuperHyperEulerian-Type-Path-Neighbor; an Extreme V-SuperHyperEulerian-Type-Path-Neighbor 83
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, 84
Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 85
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 SuperHyperEulerian-Type-Path-Neighbor; 92
and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 93
SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor; 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 SuperHyperEulerian-Type-Path-Neighbor 105
and Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 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
δ−SuperHyperEulerian-Type-Path-Neighbor 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 δ−SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor . Since there’s more ways to get 139
type-results to make a SuperHyperEulerian-Type-Path-Neighbor more understandable. For the 140
sake of having Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a need to 141
“redefine” the notion of a “SuperHyperEulerian-Type-Path-Neighbor ”. 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 SuperHyperEulerian-Type-Path-Neighbor . It’s redefined a Neutrosophic 145
SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor . 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 SuperHyperEulerian-Type-Path-Neighbor until 156
the SuperHyperEulerian-Type-Path-Neighbor, then it’s officially called a 157
“SuperHyperEulerian-Type-Path-Neighbor” but otherwise, it isn’t a 158
SuperHyperEulerian-Type-Path-Neighbor . There are some instances about the clarifications for 159
the main definition titled a “SuperHyperEulerian-Type-Path-Neighbor ”. These two examples 160
get more scrutiny and discernment since there are characterized in the disciplinary ways 161
of the SuperHyperClass based on a SuperHyperEulerian-Type-Path-Neighbor . For the sake of 162
having a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a need to “redefine” the 163
notion of a “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” and a “Neutrosophic 164
SuperHyperEulerian-Type-Path-Neighbor ”. 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 SuperHyperEulerian-Type-Path-Neighbor are redefined to a “Neutrosophic 169
SuperHyperEulerian-Type-Path-Neighbor” 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 SuperHyperEulerian-Type-Path-Neighbor 172
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some 173
Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 174
SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, SuperHyperBipartite, 175
SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 176
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”, “Neutrosophic 177
SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic 178
SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 179
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” 180
where it’s the strongest [the maximum Neutrosophic value from all the 181
SuperHyperEulerian-Type-Path-Neighbor amid the maximum value amid all 182
SuperHyperVertices from a SuperHyperEulerian-Type-Path-Neighbor .] 183
SuperHyperEulerian-Type-Path-Neighbor . A graph is a SuperHyperUniform if it’s a 184
SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 185
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 186
follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 187
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Path-Neighbor if it’s only 188
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 189
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s 190
SuperHyperBipartite it’s only one SuperVertex as intersection amid two given 191
SuperHyperEdges and these SuperVertices, forming two separate sets, has no 192
SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 193
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi 194
separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only 195
one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 196
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel 197
proposes the specific designs and the specific architectures. The SuperHyperModel is 198
officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this 199
SuperHyperModel, The “specific” cells and “specific group” of cells are 200
SuperHyperModeled as “SuperHyperVertices” and the common and intended properties 201
between “specific” cells and “specific group” of cells are SuperHyperModeled as 202
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, 203
indeterminacy, and neutrality to have more precise SuperHyperModel which in this case 204
the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation 205
will be based on the “Cancer’s Recognition” and the results and the definitions will be 206
introduced in redeemed ways. The recognition of the cancer in the long-term function. 207
The specific region has been assigned by the model [it’s called SuperHyperGraph] and 208
the long cycle of the move from the cancer is identified by this research. Sometimes the 209
move of the cancer hasn’t be easily identified since there are some determinacy, 210
indeterminacy and neutrality about the moves and the effects of the cancer on that 211
region; this event leads us to choose another model [it’s said to be Neutrosophic 212
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. 213
There are some specific models, which are well-known and they’ve got the names, and 214
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer 215
on the complex tracks and between complicated groups of cells could be fantasized by a 216
Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, 217
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 218
either the longest SuperHyperEulerian-Type-Path-Neighbor or the strongest 219
SuperHyperEulerian-Type-Path-Neighbor in those Neutrosophic SuperHyperModels. For the 220
longest SuperHyperEulerian-Type-Path-Neighbor, called SuperHyperEulerian-Type-Path-Neighbor, and 221
the strongest SuperHyperEulerian-Type-Path-Neighbor, called Neutrosophic 222
SuperHyperEulerian-Type-Path-Neighbor, 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 SuperHyperEulerian-Type-Path-Neighbor. There isn’t any formation of any 226
SuperHyperEulerian-Type-Path-Neighbor but literarily, it’s the deformation of any 227
SuperHyperEulerian-Type-Path-Neighbor. It, literarily, deforms and it doesn’t form. A basic 228
familiarity with Neutrosophic SuperHyperEulerian-Type-Path-Neighbor theory, 229
SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 230
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Path-Neighbor, 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 “ SuperHyperEulerian-Type-Path-Neighbor” 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 (-/SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, 278
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 279
either the optimal SuperHyperEulerian-Type-Path-Neighbor or the Neutrosophic 280
SuperHyperEulerian-Type-Path-Neighbor 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
SuperHyperEulerian-Type-Path-Neighbor. There isn’t any formation of any 285
SuperHyperEulerian-Type-Path-Neighbor but literarily, it’s the deformation of any 286
SuperHyperEulerian-Type-Path-Neighbor. 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 SuperHyperEulerian-Type-Path-Neighbor” 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 SuperHyperEulerian-Type-Path-Neighbor” 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
SuperHyperEulerian-Type-Path-Neighbor” and “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” 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, SuperHyperEulerian-Type-Path-Neighbor 310
and Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, are figured out in sections “ 311
SuperHyperEulerian-Type-Path-Neighbor” and “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”. 312
In the sense of tackling on getting results and in Eulerian-Type-Path-Neighbor 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”, “ SuperHyperEulerian-Type-Path-Neighbor”, 325
“Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”, “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, “ SuperHyperEulerian-Type-Path-Neighbor”. 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. [181],Definition 2.2,p.2), [Neutrosophic 343
Set](Ref. [181],Definition 2.1,p.1), [Neutrosophic SuperHyperGraph 344
(NSHG)](Ref. [181],Definition 2.5,p.2), [Characterization of the Neutrosophic 345
SuperHyperGraph (NSHG)](Ref. [181],Definition 2.7,p.3), [t-norm](Ref. [181], 346
Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyperGraph 347
(NSHG)](Ref. [181],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 348
SuperHyperPaths] (Ref. [181],Definition 5.3,p.7), and [Different Neutrosophic Types of 349
Neutrosophic SuperHyperEdges (NSHE)] (Ref. [181],Definition 5.4,p.7). Also, the new 350
ideas and their clarifications are addressed to Ref. [181]. 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. [181],Definition 2.1,p.1). 354
Let X be a Eulerian-Type-Path-Neighbor 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. [181],Definition 2.2,p.2). 357
Let X be a Eulerian-Type-Path-Neighbor 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. [181],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. [181],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. [181], 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. [181],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. [181],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. [181],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
SuperHyperEulerian-Type-Path-Neighbor). 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-SuperHyperEulerian-Type-Path-Neighbor if the following expression 520
is called Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 521
∀N (Ea ) ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor if the following 522
expression is called Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor 523
criteria holds 524
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 525
(iii) Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor if the following expression 526
is called Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 527
∀N (Va ) ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor if the following 528
expression is called Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor 529
criteria holds 530
∀N (Va ) ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 531
(v) Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 532
e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 533
re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 534
rv-SuperHyperEulerian-Type-Path-Neighbor. 536
Definition 3.19. ((Neutrosophic) SuperHyperEulerian-Type-Path-Neighbor). 537
(i) an Extreme SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 540
rv-SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor; 549
(ii) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of 550
Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, 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
SuperHyperEulerian-Type-Path-Neighbor; 559
(iii) an Extreme SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial if 560
it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, 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 SuperHyperEulerian-Type-Path-Neighbor; and the Extreme power is 570
corresponded to its Extreme coefficient; 571
(iv) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor; and the 583
Neutrosophic power is corresponded to its Neutrosophic coefficient; 584
(v) an Extreme V-SuperHyperEulerian-Type-Path-Neighbor if it’s either of 585
SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 592
Extreme SuperHyperEulerian-Type-Path-Neighbor; 594
(vi) a Neutrosophic V-SuperHyperEulerian-Type-Path-Neighbor if it’s either of 595
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-SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial 605
if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 606
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 612
Extreme SuperHyperEulerian-Type-Path-Neighbor; and the Extreme power is 615
corresponded to its Extreme coefficient; 616
(viii) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor 617
SuperHyperPolynomial if it’s either of Neutrosophic 618
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 625
they form the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; and the 628
Neutrosophic power is corresponded to its Neutrosophic coefficient. 629
Definition 3.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Path-Neighbor). 630
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 631
(i) an δ−SuperHyperEulerian-Type-Path-Neighbor is a Neutrosophic kind of 632
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor such that either of the following 633
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of 634
s∈S: 635
|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 636
Expression (3.1), holds if S is an δ−SuperHyperDefensive; 637
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Path-Neighbor is a Neutrosophic kind 638
of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor such that either of the following 639
Neutrosophic expressions hold for the Neutrosophic cardinalities of 640
SuperHyperNeighbors of s ∈ S : 641
|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. 642
And the Expression (3.1), holds if S is a Neutrosophic 643
δ−SuperHyperDefensive. 644
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a 645
need to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The 646
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 647
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 648
assign to the values. 649
Definition 3.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 650
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) holds. 651
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 652
more ways to get Neutrosophic type-results to make a Neutrosophic more 653
understandable. 654
Definition 3.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 655
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 656
holds. Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Path-Neighbor, 657
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 658
SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutrosophic 659
SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic 660
SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 661
Neutrosophic SuperHyperWheel if the Table (2) holds. 662
It’s useful to define a “Neutrosophic” version of a Neutrosophic 663
SuperHyperEulerian-Type-Path-Neighbor. Since there’s more ways to get type-results to make a 664
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor more Neutrosophicly understandable. 665
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a 666
need to “redefine” the Neutrosophic notion of “Neutrosophic 667
SuperHyperEulerian-Type-Path-Neighbor”. The SuperHyperVertices and the SuperHyperEdges 668
are assigned by the labels from the letters of the alphabets. In this procedure, there’s 669
the usage of the position of labels to assign to the values. 670
Definition 3.23. Assume a SuperHyperEulerian-Type-Path-Neighbor. It’s redefined a 671
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if the Table (3) holds. 672

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

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

Lemma 4.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 706
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let m and n 707
propose special Eulerian-Type-Path-Neighbor. Then with m ≥ 4n, 708
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a 709
Neutrosophic random k-subset of V obtained by choosing each SuperHyperVertex of G 710
Neutrosophic independently with probability Eulerian-Type-Path-Neighbor p := 4n/m, and set 711
H := G[S] and H := G[S]. 712
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: 713
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
714
Theorem 4.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 715
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let P be a 716
SuperHyperSet of n points in the plane, and let l be the Neutrosophic number of 717
SuperHyperLines
√ in the plane passing through at least k + 1 of these points, where 718
1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 719
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex 720
SuperHyperSet P whose SuperHyperEdge are the segments between conseNeighborive 721
points on the SuperHyperLines which pass through at least k + 1 points of P. This 722
Neutrosophic SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic 723
crossing at most l choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , 724
3
or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and 725
again l < 32n2 /k 3 . 726
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let P be a 728
SuperHyperSet of n points in the plane, and let k be the number of pairs of points of P 729
at unit SuperHyperDistance. Then k < 5n4/3 . 730
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 731
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Draw a SuperHyperUnit 732
SuperHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic 733
number of these SuperHyperCircles passing through exactly i points of P. Then 734
i = 0n−1 ni = n and k = 21 i = 0n−1 ini . Now form a Neutrosophic

P P
735
SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 736
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints 737
on the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 738
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 739
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel 740
SuperHyperEdges, so as to obtain a simple Neutrosophic SuperHyperGraph G with 741
e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) because G is formed from at most n 742
SuperHyperCircles, and any two SuperHyperCircles cross at most twice. Thus either 743
3
e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 744
4/3 4/3
by the Neutrosophic Crossing Lemma, and k < 4n + n < 5n . 745
Proposition 4.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 746
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be a 747
nonnegative Neutrosophic Variable and t a positive real number. Then 748
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. 749
Corollary 4.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 750
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let Xn be a 751
nonnegative integer-valued variable in a probability Eulerian-Type-Path-Neighbor (Vn , En ), n ≥ 1. 752
If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as n → ∞. 753
Proof. 754
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. A special 756
SuperHyperGraph in Gn,p almost surely has stability number at most d2p−1 log ne. 757
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. A special SuperHyperGraph 759
in Gn,p is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 760
SuperHyperVertices of G, where k ∈ N. The probability that S is a stable 761
SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability that none of the 762
(k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 763
Neutrosophic SuperHyperGraph G. 764
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote 765
the indicator Neutrosophic Variable for this Neutrosophic Event. By equation, we have 766
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 767
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 768
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: 769
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 770
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 771
grows at least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because 772
X is integer-valued and nonnegative, we deduce from Corollary that P (X = 0) → 1 as 773
n → ∞. Consequently, a Neutrosophic SuperHyperGraph in Gn,p almost surely has 774
stability number at most k. 775
Definition 4.12. (Neutrosophic Variance). 776
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. A Neutrosophic k-Variable E has a 778
number is called Neutrosophic Variance if the following expression is called 779
Neutrosophic Variance criteria 780
2
V x(E) = Ex((X − Ex(X)) ).
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be a 782
Neutrosophic Variable and let t be a positive real number. Then 783
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be a Neutrosophic 785
Variable and let t be a positive real number. Then 786
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
787
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let Xn be a 789
Neutrosophic Variable in a probability Eulerian-Type-Path-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 790
and V (Xn ) << E 2 (Xn ), then 791
E(Xn = 0) → 0 as n → ∞
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Set X := Xn and 793
t := |Ex(Xn )| in Chebyshev’s Inequality, and observe that 794
E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 795
when Xn = 0. 796
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let G ∈ Gn,1/2 . For 798
0 ≤ k ≤ n, set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for 799
which f (k) is less than one. Then almost surely α(G) takes one of the three values 800
k ∗ − 2, k ∗ − 1, k ∗ . 801
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. As in the proof of related 803
Theorem, the result is straightforward. 804
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let G ∈ Gn,1/2 and 806
let f and k ∗ be as defined in previous Theorem. Then either: 807
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, 808
or 809
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 810
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. The latter is 812
straightforward. 813
Definition 4.17. (Neutrosophic Threshold). 814
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let P be a monotone property of 816
SuperHyperGraphs (one which is preserved when SuperHyperEdges are added). Then a 817
Neutrosophic Threshold for P is a function f (n) such that: 818
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 819
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 820
Definition 4.18. (Neutrosophic Balanced). 821
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let F be a fixed Neutrosophic 823
SuperHyperGraph. Then there is a threshold function for the property of containing a 824
copy of F as a Neutrosophic SubSuperHyperGraph is called Neutrosophic Balanced. 825
S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let F be a 827
nonempty balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l 828
SuperHyperEdges. Then n−k/l is a threshold function for the property of containing F 829
as a Neutrosophic SubSuperHyperGraph. 830
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. The latter is 832
Example 4.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 834
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 835
• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 836
SuperHyperEulerian-Type-Path-Neighbor, is up. The Neutrosophic Algorithm is 837
Neutrosophicly straightforward. E1 and E3 are some empty Neutrosophic 838
SuperHyperEdges but E2 is a loop Neutrosophic SuperHyperEdge and E4 is a 839
Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 840
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 841
E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 842
there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 843
the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 844
Figure 1. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (16.3)
SuperHyperEulerian-Type-Path-Neighbor. 845
C(N SHG)Neutrosophic Eulerian-Type-Path-Neighbor

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

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

856
Neutrosophicly straightforward. 859

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

= {E1 }.
= z3.
= {V3 }.
= z2.


864

= {Ei }.
= z5.
= {V5 }.
= z7.

868

= {Ei }.
= z2.
= {Vi }.
= z6.
872

= {E17 }.
= z5.
= {V14 }.
= z5.

876

= {E4 }.
= z3.
= {V14 }.
= z5.
880

= {E23 }.
= z 11 .
= {V17 }.
= z5.



884

= {E3 }.
= z5.
= {V14 }.
= z5.
888

= {E1 }.
= z3.
= {V1 }.
= z5.
Figure 10. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example
(16.3)
892

= {E1 }.
= z5.
= {V8 }
= z8.
896

(16.3)

(16.3)

(16.3)

= {E1 }.
= z2.
= {V1 }.
= z5.
900

= {E1 }.
= z2.
= {V1 }.
= z5.
904

(16.3)

(16.3)

= {E1 }.
= z2.
= {V1 }.
= z5.
908

= {Ei ∈ EN SHG }.
= z |Ei ∈EN SHG | .
= {Vi ∈ VN SHG }.
= z |Vi ∈VN SHG | .
912

(16.3)

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
916

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
920

(16.3)

(16.3)

(16.3)

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
924

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.

(16.3)
928

= {E2 }.
= z 10 .
= {V2 , {R}, {M6 }, {L6 }, {F }, {P }, {J}, {M }, V1 , V3 }.
= z 5 + 2z 3 + 7z.
932

(16.3)

(16.3)

= {Ei ∈ EN SHG \ {E1 }}.
= z |Ei ∈EN SHG \{E1 }| .
= {Vi ∈ VN SHG \ {VE1 }}.
= z |Vi ∈VN SHG \{VE1 }| .
936
Proposition 4.21. Assume a connected Neutrosophic SuperHyperGraph 937
ESHG : (V, E). The all interior Neutrosophic SuperHyperVertices belong to any 938
Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor if for any of them, and any of other 939
corresponded Neutrosophic SuperHyperVertex, some interior Neutrosophic 940
SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 941
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 942
amount of them. 943
Proposition 4.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph 944
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has 945
only the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices 946
inside of any given Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor minus all Neutrosophic 947
SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an 948
unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 949
Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor, minus 950
all Neutrosophic SuperHypeNeighbor to some of them but not all of them. 951
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-Eulerian-Type-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic 952
R-Eulerian-Type-Path-Neighbor is at least the maximum Neutrosophic number of Neutrosophic 953
SuperHyperVertices of the Neutrosophic SuperHyperEdges with the maximum number of 954
the Neutrosophic SuperHyperEdges. In other words, the maximum number of the 955
Neutrosophic SuperHyperEdges contains the maximum Neutrosophic number of 956
Neutrosophic SuperHyperVertices are renamed to Neutrosophic Eulerian-Type-Path-Neighbor in 957
some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 958
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the 959
Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Path-Neighbor. 960
Proposition 4.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).

Then the Neutrosophic number of type-result-R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor with the least Neutrosophic 961
cardinality, the lower sharp Neutrosophic bound for cardinality. 962
Proposition 4.25. Assume a connected loopless Neutrosophic SuperHyperGraph 963
ESHG : (V, E). Then in the worst case, literally, 964
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the 965
lower sharp bound for the cardinality, of a Neutrosophic type-result-Eulerian-Type-Path-Neighbor is 966
the cardinality of 967

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. 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 968
least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the 969
principles of the main definition since there’s no condition to be satisfied but the 970
condition is on the existence of the SuperHyperEdge instead of acting on the 971
SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the 972
Neutrosophic SuperHyperSet has the necessary condition for the intended definition to 973
be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main 974
definition but by the necessity of the pre-condition on the usage of the main definition. 975
The Neutrosophic structure of the Neutrosophic R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. 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-Eulerian-Type-Path-Neighbor has the Neutrosophic cardinality of a Neutrosophic
SuperHyperEdge. Thus, a Neutrosophic R-Eulerian-Type-Path-Neighbor has the Neutrosophic
cardinality at least a Neutrosophic SuperHyperEdge. Assume a Neutrosophic
SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic
R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor” 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor for the Neutrosophic SuperHyperGraph as 976
used Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case 977
and the common theme of the lower Neutrosophic bound occurred in the specific 978
Neutrosophic SuperHyperClasses of the Neutrosophic SuperHyperGraphs which are 979
Neutrosophic free-quasi-triangle. 980
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-Eulerian-Type-Path-Neighbor. Those Neutrosophic
SuperHyperVertices are potentially included in a Neutrosophic
style-R-Eulerian-Type-Path-Neighbor. 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-Eulerian-Type-Path-Neighbor
is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Type-Path-Neighbor

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-Eulerian-Type-Path-Neighbor.

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, 981
Neutrosophic R-Eulerian-Type-Path-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
982
Neutrosophic R-Eulerian-Type-Path-Neighbor =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor where

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

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Path-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Type-Path-Neighbor is 1059
re-formalized and redefined as follows. 1060
GNeutrosophic Eulerian-Type-Path-Neighbor ∈ ∪zNeutrosophic Number

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

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

To get more visions in the closer look-up, there’s an overall overlook. 1067
GNeutrosophic Eulerian-Type-Path-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

1069

1070

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

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
1090
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
1091
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
1092
And with go back to initial structure, 1093
GNeutrosophic Eulerian-Type-Path-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

1095

1096

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

the simple Neutrosophic type-SuperHyperSet of the Neutrosophic
R-Eulerian-Type-Path-Neighbor.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic

R-Eulerian-Type-Path-Neighbor. The Neutrosophic SuperHyperSet of the Neutrosophic
SuperHyperVertices,
Is an Neutrosophic R-Eulerian-Type-Path-Neighbor C(ESHG) for an Neutrosophic 1105
SuperHyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 1106
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S 1107
of Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic 1108
SuperHyperEdge amid some Neutrosophic SuperHyperVertices instead of all given by 1109
Neutrosophic Eulerian-Type-Path-Neighbor 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 Eulerian-Type-Path-Neighbor
is up. The obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic
Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor is up. To sum them up, the Neutrosophic SuperHyperSet of
Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic

R-Eulerian-Type-Path-Neighbor. Since the Neutrosophic SuperHyperSet of the Neutrosophic
SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Eulerian-Type-Path-Neighbor C(ESHG) for an Neutrosophic 1110
SuperHyperGraph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of 1111
Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge 1112
for some Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic 1113
type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Neighbor and it’s an 1114
Neutrosophic Eulerian-Type-Path-Neighbor. Since it’s 1115
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 Eulerian-Type-Path-Neighbor.
There isn’t only less than two Neutrosophic SuperHyperVertices inside the intended
Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Eulerian-Type-Path-Neighbor,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic

Eulerian-Type-Path-Neighbor, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic 1116
SuperHyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded 1117
to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple 1118
Neutrosophic type-SuperHyperSet called the 1119
“Neutrosophic R-Eulerian-Type-Path-Neighbor” 1120
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 1121
Neutrosophic R-Eulerian-Type-Path-Neighbor, 1122
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-Eulerian-Type-Path-Neighbor amid
those obvious simple Neutrosophic type-SuperHyperSets of the Neutrosophic
Eulerian-Type-Path-Neighbor, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1123
To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph

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

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

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1180
Eulerian-Type-Path-Neighbor. The Neutrosophic SuperHyperSet of the Neutrosophic 1181
SuperHyperEdges[SuperHyperVertices], 1182

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Type-Path-Neighbor C(ESHG) for an Neutrosophic 1183
SuperHyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 1184
of Neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no 1186
Neutrosophic SuperHyperVertex of a Neutrosophic SuperHyperEdge is common and 1187
there’s an Neutrosophic SuperHyperEdge for all Neutrosophic SuperHyperVertices. 1188
There are not only two Neutrosophic SuperHyperVertices inside the intended 1189
Neutrosophic SuperHyperSet. Thus the non-obvious Neutrosophic Eulerian-Type-Path-Neighbor 1190
is up. The obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic 1191
Eulerian-Type-Path-Neighbor is a Neutrosophic SuperHyperSet includes only two 1192
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the 1193
Neutrosophic SuperHyperEdges[SuperHyperVertices], 1194

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic 1195
SuperHyperSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the 1196
Neutrosophic Eulerian-Type-Path-Neighbor is up. To sum them up, the Neutrosophic 1197
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 1198

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1199
Eulerian-Type-Path-Neighbor. Since the Neutrosophic SuperHyperSet of the Neutrosophic 1200
SuperHyperEdges[SuperHyperVertices], 1201

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Type-Path-Neighbor C(ESHG) for an Neutrosophic 1202
SuperHyperGraph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of 1203
Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge 1204
for some Neutrosophic SuperHyperVertices given by that Neutrosophic 1205
type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Neighbor and it’s an 1206
Neutrosophic Eulerian-Type-Path-Neighbor. Since it’s 1207
of Neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no 1209
Neutrosophic SuperHyperVertex of a Neutrosophic SuperHyperEdge is common and 1210
there’s an Neutrosophic SuperHyperEdge for all Neutrosophic SuperHyperVertices. 1211
There aren’t only less than three Neutrosophic SuperHyperVertices inside the intended 1212
Neutrosophic SuperHyperSet, 1213

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Eulerian-Type-Path-Neighbor , 1214

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1215
Eulerian-Type-Path-Neighbor, not: 1216

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Neutrosophic SuperHyperSet, not: 1217

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Neutrosophic 1218
SuperHyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious 1219
simple Neutrosophic type-SuperHyperSet called the 1220
“Neutrosophic Eulerian-Type-Path-Neighbor ” 1221
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 1222
Neutrosophic Eulerian-Type-Path-Neighbor , 1223
is only and only 1224

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1225
5 The Neutrosophic Departures on The Theoretical 1226
Results Toward Theoretical Motivations 1227
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 1228
Neutrosophic SuperHyperClasses. 1229
Proposition 5.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). 1230
Then 1231

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

SuperHyperEulerian-Type-Path-Neighbor in the Example (16.5)
be a longest path taken from a connected Neutrosophic SuperHyperPath 1234
ESHP : (V, E). There’s a new way to redefine as 1235
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 1236
corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Path-Neighbor. 1237
The latter is straightforward. 1238
Example 5.2. In the Figure (23), the connected Neutrosophic SuperHyperPath 1239
ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 1240
Neutrosophic SuperHyperModel (23), is the SuperHyperEulerian-Type-Path-Neighbor. 1241
Proposition 5.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 1242
Then 1243

= {Ei ∈ EN SHG }.
= |EN SHG |z |Ei ∈EN SHG | .
= {Vi ∈ VN SHG }.
= |EN SHG |z |Vi ∈VN SHG | .
Proof. Let 1244
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
1245
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 1246
ESHC : (V, E). There’s a new way to redefine as 1247

Example 5.4. In the Figure (24), the connected Neutrosophic SuperHyperCycle 1251
N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 1252
SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 1253
Proposition 5.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1255
Then 1256

= {Ei }.
= z |Ei | .
= {VEEXT
i
ERN AL
}.
EXT ERN AL
= z |VEi |
.
Proof. Let 1257
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions

1258
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1259
There’s a new way to redefine as 1260

Example 5.6. In the Figure (25), the connected Neutrosophic SuperHyperStar 1264
ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 1265
by the Algorithm in previous Neutrosophic result, of the Neutrosophic 1266
SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 1267
the Neutrosophic SuperHyperModel (25), is the Neutrosophic 1268
Proposition 5.7. Assume a connected Neutrosophic SuperHyperBipartite 1270
Figure 25. a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (16.9)
ESHB : (V, E). Then 1271

= {Ei ∈ PNmin
SHG }.
min
= z |Ei ∈PN SHG | .
= {VEEXT
i ∈P
ERN AL
min }.
N SHG

|VEEXT ERN AL
∈P min
|
=z i N SHG .
Proof. Let 1272
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
1273
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 1274
ESHB : (V, E). There’s a new way to redefine as 1275

The latter is straightforward. Then there’s no at least one 1278
SuperHyperEulerian-Type-Path-Neighbor. Thus the notion of quasi may be up but the 1279
SuperHyperNotions based on SuperHyperEulerian-Type-Path-Neighbor could be applied. There 1280
are only two SuperHyperParts. Thus every SuperHyperPart could have one 1281
SuperHyperVertex as the representative in the 1282
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Neutrosophic 1283
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 1284
minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1285
solution 1286
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Example 5.8. In the Neutrosophic Figure (26), the connected Neutrosophic 1288
SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 1289
featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1290
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 1291
Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1292
SuperHyperModel (26), is the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 1293
Proposition 5.9. Assume a connected Neutrosophic SuperHyperMultipartite 1294
ESHM : (V, E). Then 1295

= {Ei ∈ PNmin
SHG }.
min
= z |Ei ∈PN SHG | .
= {VEEXT
i ∈P
ERN AL
min }.
N SHG

|VEEXT ERN AL
∈P min
|
=z i N SHG .
Figure 26. Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutro-

sophic Notions of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Example (16.11)
Proof. Let 1296
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
1297
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
SuperHyperMultipartite ESHM : (V, E). There’s a new way to redefine as 1299

The latter is straightforward. Then there’s no at least one 1302
SuperHyperEulerian-Type-Path-Neighbor. Thus the notion of quasi may be up but the 1303
SuperHyperNotions based on SuperHyperEulerian-Type-Path-Neighbor could be applied. There 1304
are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1305
Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Example (16.13)
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 1307
ESHM : (V, E). Thus only some SuperHyperVertices and only 1308
solution 1310
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
ESHM : (V, E). The latter is straightforward. 1312
Example 5.10. In the Figure (27), the connected Neutrosophic 1313
SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 1314
The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 1315
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 1316
SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 1317
is the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 1318
Proposition 5.11. Assume a connected Neutrosophic SuperHyperWheel 1319
ESHW : (V, E). Then, 1320

= {Ei ∈ (EN SHG }.
= z |Ei ∈(EN SHG | .
= {V EXT ERN AL }.
EXT ERN AL
= z |V |
.
Proof. Let 1321
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
1322
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 1324

The latter is straightforward. Then there’s at least one SuperHyperEulerian-Type-Path-Neighbor. 1327
Thus the notion of quasi isn’t up and the SuperHyperNotions based on 1328
SuperHyperEulerian-Type-Path-Neighbor could be applied. The unique embedded 1329
SuperHyperEulerian-Type-Path-Neighbor proposes some longest 1330
SuperHyperEulerian-Type-Path-Neighbor excerpt from some representatives. The latter is 1331
SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 1334
obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 1335
Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 1336
ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 1337
6 The Surveys of Mathematical Sets On The 1339
Results But As The Initial Motivation 1340
For the SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, and 1341
the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, some general results are introduced. 1342
Figure 28. a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neu-

trosophic Notions of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic
Example (16.15)
Remark 6.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is 1343
“redefined” on the positions of the alphabets. 1344
Corollary 6.2. Assume Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. Then 1345
N eutrosophic SuperHyperEulerian − T ype − P ath − N eighbor =

{theSuperHyperEulerian − T ype − P ath − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − P ath − N eighbor
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−T ype−P ath−N eighbor. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on 1346
the SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 1347
indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 1348
Corollary 6.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 1349
of the alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor and 1350
SuperHyperEulerian-Type-Path-Neighbor coincide. 1351
of the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a 1353
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a 1354
of the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a 1357
strongest SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a longest 1358
Corollary 6.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 1360
same identical letter of the alphabet. Then its Neutrosophic 1361
SuperHyperEulerian-Type-Path-Neighbor is its SuperHyperEulerian-Type-Path-Neighbor and reversely. 1362
Corollary 6.7. Assume a Neutrosophic 1363
SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, SuperHyperBipartite, 1364
SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of the alphabet. 1365
Then its Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is its SuperHyperEulerian-Type-Path-Neighbor 1366
and reversely. 1367
Corollary 6.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 1368
SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 1369
SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined. 1370
Corollary 6.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 1371
its Neutrosophic SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 1372
SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 1376
SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 1377
Corollary 6.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 1379
SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its 1380
SuperHyperEulerian-Type-Path-Neighbor is well-defined. 1381
Corollary 6.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 1382
Then its Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its 1383
SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 1387
SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its 1388
Proposition 6.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V 1390
is 1391
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1392
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1393
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1394
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1395
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1396
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1397
Proposition 6.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then 1398
∅ is 1399
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1400
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1401
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1402
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1403
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1404
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1405
Proposition 6.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 1406
independent SuperHyperSet is 1407
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1408
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1409
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1410
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1411
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1412
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1413
Proposition 6.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1414
SuperHyperGraph which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then V is 1415
a maximal 1416
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1417
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1418
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1419
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1420
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1421
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1422
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1423
Proposition 6.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 1424
SuperHyperUniform SuperHyperWheel. Then V is a maximal 1425
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1426
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1427
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1428
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1429
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1430
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1431
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1432
SuperHyperGraph which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then the 1434
number of 1435
(i) : the SuperHyperEulerian-Type-Path-Neighbor; 1436
(ii) : the SuperHyperEulerian-Type-Path-Neighbor; 1437
(iii) : the connected SuperHyperEulerian-Type-Path-Neighbor; 1438
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1439
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1440
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 1441
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1442
SuperHyperVertices coincide. 1443
SuperHyperGraph which is a SuperHyperWheel. Then the number of 1445
(i) : the dual SuperHyperEulerian-Type-Path-Neighbor; 1446
(ii) : the dual SuperHyperEulerian-Type-Path-Neighbor; 1447
(iii) : the dual connected SuperHyperEulerian-Type-Path-Neighbor; 1448
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1449
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1450
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 1451
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1452
SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1455
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1456
SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 1457
number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 1458
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1462
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1463
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1464
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1467
SuperHyperSet contains the half of multiplying r with the number of all the 1468
SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1469
is a 1470
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1474
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1475
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1476
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 1479
number of 1480
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1484
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1485
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1486
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 1487
multiplying r with the number of all the SuperHyperEdges plus one of all the 1488
SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 1489
Proposition 6.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The 1491
number of connected component is |V − S| if there’s a SuperHyperSet which is a dual 1492
(iv) : SuperHyperEulerian-Type-Path-Neighbor; 1496
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1497
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1498
Proposition 6.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 1499
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 1500
Proposition 6.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1501
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 1502
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1503
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1507
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1509
∅. The number is 0 and the Neutrosophic number is 0, for an independent 1511
SuperHyperSet in the setting of dual 1512
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1516
(v) : strong 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1517
(vi) : connected 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1518
SuperHyperComplete. Then there’s no independent SuperHyperSet. 1520
SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath/SuperHyperWheel. The number is 1522
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting 1523
of a dual 1524
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1528
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1529
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1530
SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 1532
number is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is 1533
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of a dual 1534
t>
2
(iv) : ( O(ESHG:(V,E))
(v) : strong ( O(ESHG:(V,E))

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

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

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

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

2
for N SHF : (V, E); 1634
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal 1635
Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1637
SuperHyperComplete SuperHyperGraphs with common Neutrosophic SuperHyperVertex 1638
SuperHyperSet. Then 1639
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1640
SuperHyperEulerian-Type-Path-Neighbor for N SHF : (V, E); 1641
(ii) Γ = b n2 c for N SHF : (V, E); 1642

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

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

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

2 c + 1, then ESHG : (V, E) is a dual 1700
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1702
(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1703
(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1705
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1707
SuperHyperEulerian-Type-Path-Neighbor. Then following statements hold; 1708
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 1709
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1711
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 1713
2-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1716
[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1718
SuperHyperEulerian-Type-Path-Neighbor. Then following statements hold; 1719
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 1720
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1722
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 1724
2-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1727
7 Neutrosophic Applications in Cancer’s 1728
Neutrosophic Recognition 1729
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out 1730
what’s going on this Neutrosophic phenomenon. The special Neutrosophic case of this 1731
Neutrosophic disease is considered and as the consequences of the model, some 1732
parameters are used. The cells are under attack of this disease but the moves of the 1733
cancer in the special region are the matter of mind. The Neutrosophic recognition of the 1734
cancer could help to find some Neutrosophic treatments for this Neutrosophic disease. 1735
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 1736
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in 1737
the long-term Neutrosophic function. 1738
Step 2. (Neutrosophic Issue) The specific region has been assigned by the 1739
Neutrosophic model [it’s called Neutrosophic SuperHyperGraph] and the long 1740
Neutrosophic cycle of the move from the cancer is identified by this research. 1741
Sometimes the move of the cancer hasn’t be easily identified since there are some 1742
determinacy, indeterminacy and neutrality about the moves and the effects of the 1743
cancer on that region; this event leads us to choose another model [it’s said to be 1744
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1745
and what’s done. 1746
Figure 29. a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutro-

sophic SuperHyperEulerian-Type-Path-Neighbor
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which 1747
are well-known and they’ve got the names, and some general Neutrosophic models. 1748
The moves and the Neutrosophic traces of the cancer on the complex tracks and 1749
between complicated groups of cells could be fantasized by a Neutrosophic 1750
SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, 1751
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 1752
find either the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor or the Neutrosophic 1753
SuperHyperEulerian-Type-Path-Neighbor in those Neutrosophic Neutrosophic 1754
SuperHyperModels. 1755
8 Case 1: The Initial Neutrosophic Steps 1756
Toward Neutrosophic SuperHyperBipartite as 1757
Neutrosophic SuperHyperModel 1758
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (29), the 1759
Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 1760
featured. 1761
By using the Neutrosophic Figure (29) and the Table (4), the Neutrosophic 1762
SuperHyperBipartite is obtained. 1763
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1764
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 1765
connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1766
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 SuperHyperEulerian-Type-Path-Neighbor
9 Case 2: The Increasing Neutrosophic Steps 1768
Toward Neutrosophic SuperHyperMultipartite as 1769
Neutrosophic SuperHyperModel 1770
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (30), the 1771
Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and Neutrosophic 1772
featured. 1773
By using the Neutrosophic Figure (30) and the Table (5), the Neutrosophic 1774
SuperHyperMultipartite is obtained. 1775
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1776
previous result, of the Neutrosophic SuperHyperVertices of the connected 1777
Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 1778
Table 5. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Neutrosophic SuperHyperMultipartite
10 Wondering Open Problems But As The 1780
Directions To Forming The Motivations 1781
In what follows, some “problems” and some “questions” are proposed. 1782
The SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor 1783
are defined on a real-world application, titled “Cancer’s Recognitions”. 1784
Question 10.1. Which the else SuperHyperModels could be defined based on Cancer’s 1785
recognitions? 1786
Question 10.2. Are there some SuperHyperNotions related to 1787
SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor? 1788
Question 10.3. Are there some Algorithms to be defined on the SuperHyperModels to 1789
compute them? 1790
Question 10.4. Which the SuperHyperNotions are related to beyond the 1791
SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor? 1792
Problem 10.5. The SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic 1793
SuperHyperEulerian-Type-Path-Neighbor do a SuperHyperModel for the Cancer’s recognitions and 1794
they’re based on SuperHyperEulerian-Type-Path-Neighbor, are there else? 1795
Problem 10.6. Which the fundamental SuperHyperNumbers are related to these 1796
SuperHyperNumbers types-results? 1797
Problem 10.7. What’s the independent research based on Cancer’s recognitions 1798
concerning the multiple types of SuperHyperNotions? 1799
11 Conclusion and Closing Remarks 1800
In this section, concluding remarks and closing remarks are represented. The drawbacks 1801
of this research are illustrated. Some benefits and some advantages of this research are 1802
highlighted. 1803
This research uses some approaches to make Neutrosophic SuperHyperGraphs more 1804
understandable. In this endeavor, two SuperHyperNotions are defined on the 1805
SuperHyperEulerian-Type-Path-Neighbor. For that sake in the second definition, the main definition 1806
of the Neutrosophic SuperHyperGraph is redefined on the position of the alphabets. 1807
Based on the new definition for the Neutrosophic SuperHyperGraph, the new 1808
SuperHyperNotion, Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, finds the convenient 1809
background to implement some results based on that. Some SuperHyperClasses and some 1810
Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 1811
regions where are under the attacks of the cancer to recognize this disease as it’s 1812
mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the 1813
SuperHyperNotion, SuperHyperEulerian-Type-Path-Neighbor, the new SuperHyperClasses and 1814
SuperHyperClasses, are introduced. Some general results are gathered in the section on 1815
the SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 1816
The clarifications, instances and literature reviews have taken the whole way through. In 1817
this research, the literature reviews have fulfilled the lines containing the notions and the 1818
results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 1819
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of 1820
this research. Sometimes the cancer has been happened on the region, full of cells, groups 1821
of cells and embedded styles. In this segment, the SuperHyperModel proposes some 1822
SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 1823
and strongest styles with the formation of the design and the architecture are formally 1824
called “ SuperHyperEulerian-Type-Path-Neighbor” in the themes of jargons and buzzwords. The 1825
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 1826
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. SuperHyperEulerian-Type-Path-Neighbor
3. Neutrosophic SuperHyperEulerian-Type-Path-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies
1827
research are, figured out, pointed out and spoken out. 1828
12 Neutrosophic SuperHyperDuality But As The 1829
Extensions Excerpt From Dense And Super 1830
Forms 1831
Definition 12.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 1832
(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 1836
such that Va ∈ Ei , Ej ; 1837
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 1838
such that Va ∈ Ei , Ej and 1839
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1840
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1841
such that Vi , Vj ∈ Ea ; 1842
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1843
such that Vi , Vj ∈ Ea and 1844
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1845
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1846
e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1847
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality. 1848
Definition 12.2. ((Neutrosophic) SuperHyperDuality). 1849
(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic 1852
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1854
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1855
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1856
Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1857
Extreme SuperHyperDuality; 1859
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1860
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1863
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1864
Neutrosophic SuperHyperDuality; 1867
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1868
Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1869
Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1870
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1871
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1872
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 1873
an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1874
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1875
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1876
Extreme coefficient; 1877
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1878
of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1879
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1881
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1882
defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1883
SuperHyperDuality; and the Neutrosophic power is corresponded to its 1887
Neutrosophic coefficient; 1888
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic 1889
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 1894
the Extreme SuperHyperDuality; 1896
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic 1897
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1901
Neutrosophic SuperHyperDuality; 1904
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 1905
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 1910
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1911
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1913
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1915
SuperHyperDuality; and the Neutrosophic power is corresponded to its 1924
Neutrosophic coefficient. 1925
SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1929
straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is 1930
a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 1931
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one 1932
Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, 1933
V3 is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge 1934
has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , 1935
is excluded in every given Neutrosophic SuperHyperDuality. 1936
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 1939
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 1940
SuperHyperDuality. 1945


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 2008
ESHP : (V, E). Then 2009
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 2010
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 2014
Neutrosophic SuperHyperModel (23), is the SuperHyperDuality. 2018
Proposition 12.6. Assume a connected Neutrosophic SuperHyperCycle 2019
ESHC : (V, E). Then 2020
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 2021
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Then 2032
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 2033
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperDuality. 2043
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 2046
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 2051
isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 2052
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2053
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic 2055
solution 2058
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperModel (26), is the Neutrosophic SuperHyperDuality. 2065

= {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 2068
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic 2069

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 2075
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
solution 2080
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is the Neutrosophic SuperHyperDuality. 2088
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 2091
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 2092
ESHW : (V, E). There’s a new way to redefine as 2093

∃!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 2098
excerpt from some representatives. The latter is straightforward. 2099
13 Neutrosophic SuperHyperJoin But As The 2106
Forms 2108
Definition 13.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 2109
(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 2113
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2114
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2115
such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2116
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 2118
that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2119
(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 2120
that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2121
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 2123
e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2124
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin. 2125
Definition 13.2. ((Neutrosophic) SuperHyperJoin). 2126
(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 2129
Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and 2130
Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 2131
Extreme SuperHyperJoin; 2136
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 2137
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 2139
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2140
Neutrosophic SuperHyperJoin; 2144
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2145
Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2146
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 2147
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2148
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2153
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2155
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 2158
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2159
Neutrosophic number of the maximum Neutrosophic cardinality of the 2160
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 2164
coefficient; 2165
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic 2166
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2169
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 2170
Extreme SuperHyperJoin; 2173
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic 2174
Neutrosophic SuperHyperJoin; 2181
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 2182
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2190
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2192
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 2201
coefficient. 2202
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2206
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 2207
E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 2208
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 2209
there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 2210
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2211
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 2212
Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2213
SuperHyperJoin. 2214
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 2288
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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

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

Then 2310
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 2311

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperJoin. 2321
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 2324
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 2329
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2330
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2331
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 2333
ESHB : (V, E). Thus only some SuperHyperVertices and only 2334
solution 2336
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperModel (26), is the Neutrosophic SuperHyperJoin. 2343

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 2346
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic 2347

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

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

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

straightforward. Then there’s at least one SuperHyperJoin. Thus the notion of quasi 2374
isn’t up and the SuperHyperNotions based on SuperHyperJoin could be applied. The 2375
unique embedded SuperHyperJoin proposes some longest SuperHyperJoin excerpt from 2376
some representatives. The latter is straightforward. 2377
14 Neutrosophic SuperHyperPerfect But As The 2384
Forms 2386
Definition 14.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 2387
(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 2391
such that Va ∈ Ei , Ej ; 2392
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 2393
such that Va ∈ Ei , Ej ; and 2394
(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 2396
such that Vi , Vj ∈ Ea ; 2397
(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 2398
such that Vi , Vj ∈ Ea ; and 2399
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 2401
e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 2402
v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect. 2403
Definition 14.2. ((Neutrosophic) SuperHyperPerfect). 2404
(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic 2407
v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 2409
Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 2412
Extreme SuperHyperPerfect; 2414
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 2415
Neutrosophic SuperHyperPerfect; 2422
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2423
Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2424
Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 2425
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2431
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 2433
of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2434
SuperHyperPerfect; and the Neutrosophic power is corresponded to its 2442
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic 2444
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 2449
the Extreme SuperHyperPerfect; 2451
(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic 2452
Neutrosophic SuperHyperPerfect; 2459
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 2460
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2468
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 2470
SuperHyperPerfect; and the Neutrosophic power is corresponded to its 2479
SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2484
SuperHyperPerfect. 2492
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 2566
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2570
Neutrosophic SuperHyperModel (23), is the SuperHyperPerfect. 2574
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 2577
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperPerfect. 2599
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 2602
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 2607
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2608
applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2609
one SuperHyperVertex as the representative in the 2610
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic 2611
solution 2614
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperModel (26), is the Neutrosophic SuperHyperPerfect. 2621

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 2624
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic 2625

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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 2648

straightforward. Then there’s at least one SuperHyperPerfect. Thus the notion of quasi 2652
isn’t up and the SuperHyperNotions based on SuperHyperPerfect could be applied. The 2653
unique embedded SuperHyperPerfect proposes some longest SuperHyperPerfect excerpt 2654
from some representatives. The latter is straightforward. 2655
15 Neutrosophic SuperHyperTotal But As The 2662
Forms 2664
Definition 15.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 2665
(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2669
that Va ∈ Ei , Ej ; 2670
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2671
that Va ∈ Ei , Ej ; and 2672
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2674
that Vi , Vj ∈ Ea ; 2675
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2676
that Vi , Vj ∈ Ea ; and 2677
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2679
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2680
v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal. 2681
Definition 15.2. ((Neutrosophic) SuperHyperTotal). 2682
(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic 2685
v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2687
Extreme SuperHyperTotal; 2692
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2693
v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2695
Neutrosophic SuperHyperTotal; 2700
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2701
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2702
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2709
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2711
SuperHyperTotal; and the Neutrosophic power is corresponded to its 2720
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic 2722
Extreme SuperHyperTotal; 2729
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic 2730
Neutrosophic SuperHyperTotal; 2737
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2738
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2746
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2748
SuperHyperTotal; and the Neutrosophic power is corresponded to its 2757
SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2762
SuperHyperTotal. 2770
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 2844
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2848
Neutrosophic SuperHyperModel (23), is the SuperHyperTotal. 2852
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 2855
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 2866
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 2867
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperTotal. 2877
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 2880
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

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 2902
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic 2903

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2907
quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2908
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
solution 2914
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is the Neutrosophic SuperHyperTotal. 2922
∗
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 2925
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel 2926

straightforward. Then there’s at least one SuperHyperTotal. Thus the notion of quasi 2930
isn’t up and the SuperHyperNotions based on SuperHyperTotal could be applied. The 2931
unique embedded SuperHyperTotal proposes some longest SuperHyperTotal excerpt 2932
from some representatives. The latter is straightforward. 2933
16 Neutrosophic SuperHyperConnected But As 2940
The Extensions Excerpt From Dense And Super 2941
Forms 2942
Definition 16.1. (Different Neutrosophic Types of Neutrosophic 2943
SuperHyperConnected). 2944
(i) Neutrosophic e-SuperHyperConnected if 2948
∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such 2949
that Va 6∈ Ei , Ej ; 2950
(ii) Neutrosophic re-SuperHyperConnected if 2951
∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such 2952
that Va 6∈ Ei , Ej ; and 2953
(iii) Neutrosophic v-SuperHyperConnected if 2955
∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such 2956
that Vi , Vj 6∈ Ea ; 2957
(iv) Neutrosophic rv-SuperHyperConnected if 2958
∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that 2959
Vi , Vj 6∈ Ea ; and 2960
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2962
e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2963
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected. 2964
Definition 16.2. ((Neutrosophic) SuperHyperConnected). 2965
(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic 2968
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2970
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2971
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2972
of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of 2973
the Extreme SuperHyperConnected; 2975
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2976
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 2979
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2980
Neutrosophic SuperHyperConnected; 2983
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2984
of Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, 2985
Neutrosophic v-SuperHyperConnected, and Neutrosophic 2986
rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 2987
coefficients defined as the Extreme number of the maximum Extreme cardinality 2989
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 2990
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2991
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and 2992
the Extreme power is corresponded to its Extreme coefficient; 2993
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s 2994
either of Neutrosophic e-SuperHyperConnected, Neutrosophic 2995
re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 2996
Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 2997
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 3000
they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 3003
corresponded to its Neutrosophic coefficient; 3004
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic 3005
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3008
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 3009
of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 3010
the Extreme SuperHyperConnected; 3012
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic 3013
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 3016
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 3017
they form the Neutrosophic SuperHyperConnected; 3020
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s 3021
Neutrosophic rv-SuperHyperConnected and C(N SHG) for an Extreme 3024
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 3027
Extreme SuperHyperConnected; and the Extreme power is corresponded to its 3030
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s 3032
Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 3035
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 3038
they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 3041
corresponded to its Neutrosophic coefficient. 3042
SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3046
SuperHyperConnected. 3054
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 3128
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 3132
Neutrosophic SuperHyperModel (23), is the SuperHyperConnected. 3136
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 3139
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 3150
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 3151
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperConnected. 3161
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 3164
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 3169
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 3170
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic 3173
solution 3176
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
SuperHyperModel (26), is the Neutrosophic SuperHyperConnected. 3183
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 3186
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 3191
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 3192
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
solution 3198
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is the Neutrosophic SuperHyperConnected. 3206
∗
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 3209
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 3211

straightforward. Then there’s at least one SuperHyperConnected. Thus the notion of 3214
quasi isn’t up and the SuperHyperNotions based on SuperHyperConnected could be 3215
applied. The unique embedded SuperHyperConnected proposes some longest 3216
SuperHyperConnected excerpt from some representatives. The latter is 3217
17 Background 3225
There are some scientific researches covering the topic of this research. In what follows, 3226
there are some discussion and literature reviews about them. 3227
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and 3228
neutrosophic degree alongside chromatic numbers in the setting of some classes related 3229
to neutrosophic hypergraphs” in Ref. [1] by Henry Garrett (2022). In this research 3230
article, a novel approach is implemented on SuperHyperGraph and neutrosophic 3231
SuperHyperGraph based on general forms without using neutrosophic classes of 3232
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 3233
entitled “Journal of Current Trends in Computer Science Research (JCTCSR)” with 3234
ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 3235
06-14. The research article studies deeply with choosing neutrosophic hypergraphs 3236
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 3237
results based on initial background. 3238
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and 3239
Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in 3240
Game Theory and Neutrosophic Super Hyper Classes” in Ref. [2] by Henry Garrett 3241
(2022). In this research article, a novel approach is implemented on SuperHyperGraph 3242
and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and using 3243
neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s published in 3244
prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 3245
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques 3246
Comput Math” in volume 1 and issue 3 with pages 242-263. The research article studies 3247
deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s 3248
the breakthrough toward independent results based on initial background and fundamental 3249
SuperHyperNumbers. 3250
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 3251
and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 3252
Graphs Alongside Applications in Cancer’s Treatments” in Ref. [3] by Henry Garrett 3253
(2023). In this research article, a novel approach is implemented on SuperHyperGraph 3254
and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 3255
in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 3256
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 3257
ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 3258
pages 35-47. The research article studies deeply with choosing directly neutrosophic 3259
SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 3260
results based on initial background and fundamental SuperHyperNumbers. 3261
In some articles are titled “0039 — Closing Numbers and Super-Closing Numbers as 3262
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 3263
(Neutrosophic)n-SuperHyperGraph” in Ref. [5] by Henry Garrett (2022), “0049 — 3264
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [6] by Henry Garrett 3265
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 3266
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 3267
in Ref. [7] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 3268
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 3269
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [8] by 3270
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3271
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [9] by Henry Garrett (2022), 3272
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 3273
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 3274
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 3275
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [10] by Henry 3276
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case 3277
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition 3278
Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [11] by Henry Garrett (2022), 3279
“Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 3280
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in 3281
Ref. [12] by Henry Garrett (2022), “Extremism of the Attacked Body Under the 3282
Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3283
SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 3284
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 3285
Ref. [14] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 3286
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 3287
Special ViewPoints” in Ref. [15] by Henry Garrett (2022), “Neutrosophic 1-Failed 3288
SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 3289
on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [16] by Henry Garrett 3290
(2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 3291
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [17] by Henry Garrett 3292
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 3293
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3294
in Ref. [13] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 3295
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 3296
And (Neutrosophic) SuperHyperGraphs” in Ref. [18] by Henry Garrett (2022), 3297
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 3298
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [19] by 3299
Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3300
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [20] by 3301
Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3302
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 3303
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 3304
(Neutrosophic) SuperHyperClasses” in Ref. [21] by Henry Garrett (2022), 3305
“SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With 3306
SuperHyperModeling of Cancer’s Recognitions” in Ref. [22] by Henry Garrett (2022), 3307
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 3308
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 3309
Treatments” in Ref. [23] by Henry Garrett (2022), “SuperHyperDominating and 3310
SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 3311
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [24] by Henry Garrett 3312
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 3313
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [151] by Henry 3314
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 3315
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set 3316
and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [152] by Henry Garrett 3317
(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 3318
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels 3319
Named (Neutrosophic) SuperHyperGraphs” in Ref. [153] by Henry Garrett (2023), 3320
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks 3321
In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called 3322
Neutrosophic SuperHyperGraphs” in Ref. [154] by Henry Garrett (2023), “Perfect 3323
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 3324
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [157] by 3325
Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded 3326
Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 3327
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [158] by Henry 3328
Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 3329
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 3330
the Form of Neutrosophic SuperHyperGraphs” in Ref. [161] by Henry Garrett (2023), 3331
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 3332
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [164] by Henry 3333
Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 3334
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3335
in Ref. [165] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 3336
Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 3337
Ref. [166] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 3338
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 3339
Recognition And Beyond” in Ref. [167] by Henry Garrett (2022), “(Neutrosophic) 3340
1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) 3341
SuperHyperGraphs” in Ref. [168] by Henry Garrett (2022), “Basic Notions on 3342
(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 3343
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [169] by Henry Garrett 3344
(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 3345
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [180] by Henry 3346
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 3347
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 3348
SuperHyperGraph (NSHG)” in Ref. [181] by Henry Garrett (2022), and [4–181], there 3349
are some endeavors to formalize the basic SuperHyperNotions about neutrosophic 3350
SuperHyperGraph and SuperHyperGraph alongside scientific research books at [182–285]. 3351
Two popular scientific research books in Scribd in the terms of high readers, 4190 and 3352
5189 respectively, on neutrosophic science is on [286, 287]. 3353
Some scientific studies and scientific researches about neutrosophic graphs, are 3354
proposed as book in Ref. [274] by Henry Garrett (2023) which is indexed by Google 3355
Scholar and has more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic 3356
Graphs” and published by Dr. Henry Garrett. This research book covers different types 3357
of notions and settings in neutrosophic graph theory and neutrosophic SuperHyperGraph 3358
theory. 3359
Also, some scientific studies and scientific researches about neutrosophic graphs, are 3360
proposed as book in Ref. [275] by Henry Garrett (2023) which is indexed by Google 3361
Scholar and has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” 3362
and published by Dr. Henry Garrett. This research book presents different types of 3363
notions SuperHyperResolving and SuperHyperDominating in the setting of duality in 3364
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research 3365
book has scrutiny on the complement of the intended set and the intended set, 3366
simultaneously. It’s smart to consider a set but acting on its complement that what’s 3367
done in this research book which is popular in the terms of high readers in Scribd. 3368
See the seminal scientific researches [1–3]. The formalization of the notions on the 3369
framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 3370
theory, and (Neutrosophic) SuperHyperGraphs theory at [4–181] alongside scientific 3371
research books at [182–285]. Two popular scientific research books in Scribd in the terms 3372
of high readers, 4331 and 5327 respectively, on neutrosophic science is on [286, 287]. 3373
References 3374
1. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 3375
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 3376
Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. 3377
2. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 3378
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 3379
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 3380
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 3381
3. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 3382
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 3383
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 3384
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 3385
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 3386
graphs-and-super-hyper-graphs-alongside-a.pdf) 3387
4. Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 3388
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 3389
Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 3390
(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 3391
research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by-eulerian- 3392
super-hyper-cycles-and-hamiltonian-sets-.pdf) 3393
5. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 3394
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 3395
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 3396
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 3397
Research, https://doi.org/10.5281/zenodo.6319942. 3398
https://oa.mg/work/10.5281/zenodo.6319942 3399
6. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 3400
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 3401
2022. CERN European Organization for Nuclear Research, 3402
https://doi.org/10.13140/rg.2.2.35241.26724. 3403
https://oa.mg/work/10.13140/rg.2.2.35241.26724 3404
7. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 3405
Confrontation under Cancer’s Recognition as the Model in The Setting of 3406
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 3407
10.20944/preprints202301.0308.v1). 3408
8. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 3409
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3410
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3411
2023010282 (doi: 10.20944/preprints202301.0282.v1). 3412
9. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 3413
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 3414
2023010267 (doi: 10.20944/preprints202301.0267.v1). 3415
10. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3416
Affected Cells Toward The Totality Under Cancer’s Recognition By New 3417
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3418
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3419
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3420
10.20944/preprints202301.0265.v1). 3421
11. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 3422
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3423
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3424
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3425
12. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3426
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3427
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3428
10.20944/preprints202301.0240.v1). 3429
13. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3430
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3431
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3432
10.20944/preprints202301.0224.v1). 3433
14. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3434
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3435
2023010105 (doi: 10.20944/preprints202301.0105.v1). 3436
15. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3437
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 3438
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 3439
10.20944/preprints202301.0088.v1). 3440
16. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3441
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3442
Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3443
17. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3444
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3445
2023010043 (doi: 10.20944/preprints202301.0043.v1). 3446
18. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3447
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3448
10.20944/preprints202301.0105.v1). 3450
10.20944/preprints202301.0088.v1). 3454
20. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3455
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3456
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3457
21. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3458
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 3459
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 3460
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3461
2022120540 (doi: 10.20944/preprints202212.0540.v1). 3462
22. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3463
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3464
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3465
23. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3466
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3467
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3468
10.20944/preprints202212.0324.v1). 3469
24. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3470
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3471
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3472
10.20944/preprints202211.0576.v1). 3473
25. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3474
SuperHyperGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress 3475
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333). 3476
26. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3477
Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 3478
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7840206). 3479
SuperHyperGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super 3481
EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7834229). 3482
28. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 3483
Eulerian-Type-Path-Cut In Cancer’s Recognition With (Neutrosophic) 3484
SuperHyperGraph By Eulerian-Path-Neighbor As Hyper Nebbish On Super 3487
Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7824560). 3488
30. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3489
Eulerian-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 3490
SuperHyperGraph By Eulerian-Path-Decomposition As Hyper Decompress On 3493
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7819531). 3494
Eulerian-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 3496
SuperHyperGraph As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 3499
10.5281/zenodo.7812236). 3500
SuperHyperGraph By initial Eulerian-Path-Cut As Hyper initial Eulogy On 3502
Super initial EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7809365). 3503
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super 3505
EULA-Path-Cut”, Zenodo 2023, (doi: 10.5281/zenodo.7809358). 3506
36. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 3507
Eulerian-Path-Cut In Cancer’s Recognition With (Neutrosophic) 3508
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, 3511
Zenodo 2023, (doi: 10.5281/zenodo.7809328). 3512
SuperHyperGraph By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On 3514
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7806767). 3515
Hamiltonian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 3517
SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper 3520
Decompress On Super Decompensation”, Zenodo 2023, (doi: 3521
10.5281/zenodo.7804238). 3522
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With 3524
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 3525
10.5281/zenodo.7804228). 3526
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super 3528
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7799902). 3529
43. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 3530
Hamiltonian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3531
SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super 3534
SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress 3537
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). 3538
SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super 3540
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7791952). 3541
Hamiltonian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3543
SuperHyperGraph By Hamiltonian-Neighbor As Hyper Nebbish On Super 3546
Hamiltonian-Neighbor In Recognition of Cancer With (Neutrosophic) 3549
SuperHyperGraph By Hamiltonian-Decomposition As Hyper Decompress On 3552
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7787066). 3553
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) 3555
SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, 3558
Hamiltonian-Cut In Recognition of Cancer With (Neutrosophic) 3561
SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, 3564
Trace-Neighbor In Recognition of Cancer With (Neutrosophic) 3567
56. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3569
SuperHyperGraph By Trace-Decomposition As Hyper Decompress On Super 3570
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7771831). 3571
Trace-Decomposition In Cancer’s Recognition With (Neutrosophic) 3573
SuperHyperGraph By Trace-Cut As Hyper Nebbish On Super Nebulous”, 3576
ResearchGate 2023, (doi: 10.13140/RG.2.2.20913.25446). 3577
59. Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 3578
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 3579
(doi: 10.5281/zenodo.7764916). 3580
SuperHyperGraph By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, 3582
Edge-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 3585
SuperHyperGraph By Edge-Decomposition As Hyper Decompress On Super 3588
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22545.10089). 3589
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) 3591
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 3592
SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 3594
2023, (doi: 10.13140/RG.2.2.11377.76644). 3595
65. Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In 3596
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3597
2023, (doi: 10.13140/RG.2.2.23750.96329). 3598
SuperHyperGraph By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, 3600
Vertex-Neighbor In Cancer’s Recognition With (Neutrosophic) 3603
SuperHyperGraph By Vertex-Decomposition As Hyper Decompress On Super 3606
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 3607
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) 3609
SuperHyperGraph By Vertex-Cut As Hyper Vertu On Super Vertigo”, 3612
71. Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 3614
2023, (doi: 10.13140/RG.2.2.32467.25124). 3616
SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, 3618
73. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3620
Stable-Neighbor In Cancer’s Recognition With (Neutrosophic) 3621
SuperHyperGraph By Stable-Decompositions As Hyper Stain On Super Stagy”, 3624
75. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of 3626
Stable-Decompositions In Cancer’s Recognition With (Neutrosophic) 3627
SuperHyperGraph By Stable-Cut As Hyper Stain On Super Stagy”, 3630
77. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 3632
2023, (doi: 10.13140/RG.2.2.20170.24000). 3634
SuperHyperGraph By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, 3636
79. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3638
Clique-Neighbors In Cancer’s Recognition With (Neutrosophic) 3639
SuperHyperGraph By Clique-Decompositions As Hyper Decompile On Super 3642
Decommission”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18780.87683). 3643
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) 3645
SuperHyperGraph By Clique-Cut As Hyper Click On Super Cliche”, 3648
83. Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 3650
2023, (doi: 10.13140/RG.2.2.27392.30721). 3652
SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 3654
2023, (doi: 10.13140/RG.2.2.33028.40321). 3655
SuperHyperGraph By List- Coloring As Hyper List On Super Lisle”, 3657
86. Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 3659
2023, (doi: 10.13140/RG.2.2.16356.04489). 3661
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 3663
2023, (doi: 10.13140/RG.2.2.21756.21129). 3664
88. Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 3665
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, 3666
(doi: 10.13140/RG.2.2.30983.68009). 3667
SuperHyperGraph By Edge-Connectivity As Hyper Disclosure On Super 3669
Closure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28552.29445). 3670
90. Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of 3671
Edge-Connectivity In Cancer’s Recognition With (Neutrosophic) 3672
SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, 3675
92. Henry Garrett, “New Ideas On Super System By Hyper Explosions Of 3677
Vertex-Connectivity In Cancer’s Recognition With (Neutrosophic) 3678
SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, 3681
94. Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of 3683
Tree-Decomposition In Cancer’s Recognition With (Neutrosophic) 3684
SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, 3687
96. Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 3689
2023, (doi: 10.13140/RG.2.2.11172.14720). 3691
SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On 3693
Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). 3694
98. Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of 3695
SuperHyper(i,j)-Domination In Cancer’s Recognition With (Neutrosophic) 3696
SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On 3699
Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 3700
100. Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of 3701
SuperHyperEdge-Domination In Cancer’s Recognition With (Neutrosophic) 3702
SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super 3705
Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 3706
102. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 3707
SuperHyperK-Domination In Cancer’s Recognition With (Neutrosophic) 3708
SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 3711
Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 3712
104. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 3713
SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 3714
SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 3717
Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 3718
106. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 3719
SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 3720
SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 3723
Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 3724
108. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 3725
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 3726
109. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 3728
SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 3729
SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 3732
Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 3733
111. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 3734
SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 3735
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 3738
Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 3739
113. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 3740
SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 3741
SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 3744
115. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 3746
SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 3747
SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super Infections”, 3750
117. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 3752
SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 3753
118. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 3755
SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 3756
SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, 3759
SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 3762
121. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 3764
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 3765
122. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 3767
Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 3768
123. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3770
SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 3771
Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 3772
124. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3773
SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 3774
Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 3775
125. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 3776
SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 3777
126. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 3779
Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 3780
SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 3781
127. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 3782
Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 3783
SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 3784
128. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3785
SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3786
Hyper Covering Versus Super separations-VI”, ResearchGate 2023, (doi: 3787
10.13140/RG.2.2.29913.80482). 3788
Hyper Covering Versus Super separations-V”, ResearchGate 2023, (doi: 3791
10.13140/RG.2.2.33269.24809). 3792
Hyper Covering Versus Super separations-IV”, ResearchGate 2023, (doi: 3795
10.13140/RG.2.2.34946.96960). 3796
131. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3797
Hyper Covering Versus Super separations-III”, ResearchGate 2023, (doi: 3799
10.13140/RG.2.2.14814.31040). 3800
Hyper Covering Versus Super separations-II”, ResearchGate 2023, (doi: 3803
10.13140/RG.2.2.15653.17125). 3804
Hyper Covering Versus Super separations-I”, ResearchGate 2023, (doi: 3807
10.13140/RG.2.2.25719.50089). 3808
134. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 3809
Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 3810
SuperHyperConnectivities”, ResearchGate 2023, (doi: 3811
10.13140/RG.2.2.29441.94562). 3812
135. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 3813
SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 3814
Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 3815
136. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 3816
the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 3817
On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 3818
137. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 3819
and Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions 3820
of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 3821
138. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 3822
theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 3823
Recognition”, Preprints 2023, 2023010396 (doi: 3824
10.20944/preprints202301.0396.v1). 3825
139. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 3826
neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 3827
Recognition”, Preprints 2023, 2023010395 (doi: 3828
10.20944/preprints202301.0395.v1). 3829
140. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 3830
Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 3831
Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 3832
Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 3833
10.13140/RG.2.2.26240.51204). 3834
141. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 3835
Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 3836
Classes With Hyper Effects In The Background of the Framework is So-Called 3837
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 3838
10.13140/RG.2.2.12818.73925). 3839
142. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 3840
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 3841
Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 3842
10.13140/RG.2.2.26836.88960). 3843
143. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 3844
Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 3845
ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 3846
144. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 3847
Confrontation under Cancer’s Recognition as the Model in The Setting of 3848
10.20944/preprints202301.0308.v1). 3850
145. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 3851
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3852
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3853
2023010282 (doi: 10.20944/preprints202301.0282.v1). 3854
146. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3855
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 3856
(doi: 10.20944/preprints202301.0267.v1).). 3857
147. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3858
Affected Cells Toward The Totality Under Cancer’s Recognition By New 3859
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3860
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3861
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3862
10.20944/preprints202301.0265.v1). 3863
148. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 3864
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3865
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3866
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3867
149. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3868
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3869
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3870
10.20944/preprints202301.0240.v1). 3871
150. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3872
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3873
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3874
10.20944/preprints202301.0224.v1). 3875
151. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 3876
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 3877
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 3878
152. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 3879
The Cancer’s Extreme Recognition With Different Types of Extreme 3880
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 3881
153. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3883
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3884
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3885
2023, (doi: 10.13140/RG.2.2.32530.73922). 3886
154. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 3887
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 3888
SuperHyperClique on Cancer’s Recognition called Neutrosophic 3889
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 3890
155. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3891
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3892
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3893
2023, (doi: 10.13140/RG.2.2.32530.73922). 3894
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3896
2023010105 (doi: 10.20944/preprints202301.0105.v1). 3897
157. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 3898
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 3899
158. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 3901
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 3902
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 3903
10.20944/preprints202301.0105.v1). 3908
10.20944/preprints202301.0088.v1). 3912
161. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 3913
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 3914
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 3915
(doi: 10.13140/RG.2.2.17385.36968). 3916
Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3919
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3921
2023010043 (doi: 10.20944/preprints202301.0043.v1). 3922
164. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 3923
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 3924
In Special ViewPoints”, ResearchGate 2023, (doi: 3928
10.13140/RG.2.2.11447.80803). 3929
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 3931
2023, (doi: 10.13140/RG.2.2.35774.77123). 3932
Neutrosophic Recognition And Beyond”, ResearchGate 2022, (doi: 3935
10.13140/RG.2.2.36141.77287). 3936
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3938
10.13140/RG.2.2.29430.88642). 3939
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3942
10.13140/RG.2.2.11369.16487). 3943
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3945
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3946
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 3948
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3953
2022120540 (doi: 10.20944/preprints202212.0540.v1). 3954
Recognitions And Related (Neutrosophic) SuperHyperClasses”, ResearchGate 3958
2022, (doi: 10.13140/RG.2.2.14426.41923). 3959
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3962
ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 3965
176. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 3966
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3967
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3968
10.20944/preprints202212.0324.v1). 3969
177. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3970
Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside Applications 3971
in Cancer’s Treatments”, ResearchGate 2022 (doi: 3972
10.13140/RG.2.2.23123.04641). 3973
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3976
10.20944/preprints202211.0576.v1). 3977
Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 3980
10.13140/RG.2.2.23324.56966). 3981
180. Henry Garrett, “Basic Neutrosophic Notions Concerning 3982
SuperHyperDominating and Neutrosophic SuperHyperResolving in 3983
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244). 3984
181. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 3985
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 3986
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 3987
10.13140/RG.2.2.25385.88160). 3988
182. Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. 3989
Henry Garrett, 2023 (doi: 10.5281/zenodo.7848019). 3990
183. Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry 3991
Garrett, 2023 (doi: 10.5281/zenodo.7835063). 3992
184. Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry 3993
185. Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. 3995
186. Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 3997
2023 (doi: 10.5281/zenodo.7812750). 3998
187. Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 3999
188. Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. 4001
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 4002
189. Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. 4003
190. Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 4005
191. Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 4007
192. Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 4009
193. Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry 4011
194. Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry 4013
195. Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 4015
2023 (doi: 10.5281/zenodo.7783791). 4016
196. Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4017
2023 (doi: 10.5281/zenodo.7780123). 4018
197. Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry 4019
198. Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 4021
10.5281/zenodo.7637762). 4022
199. Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4023
(doi: 10.5281/zenodo.7766174). 4024
200. Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4025
2023 (doi: 10.5281/zenodo.7762232). 4026
201. Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry 4027
202. Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4029
(doi: 10.5281/zenodo.7754661). 4030
203. Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4031
2023 (doi: 10.5281/zenodo.7750995) . 4032
204. Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry 4033
205. Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4035
(doi: 10.5281/zenodo.7747236). 4036
206. Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4037
2023 (doi: 10.5281/zenodo.7742587). 4038
207. Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry 4039
208. Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4041
(doi: 10.5281/zenodo.7734719). 4042
209. Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 4043
2023 (doi: 10.5281/zenodo.7730484). 4044
210. Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry 4045
211. Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4047
(doi: 10.5281/zenodo.7722865). 4048
212. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4049
10.5281/zenodo.7713563). 4050
213. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4051
10.5281/zenodo.7709116). 4052
214. Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 4053
2023 (doi: 10.5281/zenodo.7706415). 4054
215. Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 4055
2023 (doi: 10.5281/zenodo.7706063). 4056
216. Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 4057
2023 (doi: 10.5281/zenodo.7701906). 4058
217. Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4059
10.5281/zenodo.7700205). 4060
218. Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 4061
2023 (doi: 10.5281/zenodo.7694876). 4062
219. Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 4063
2023 (doi: 10.5281/zenodo.7679410). 4064
220. Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 4065
2023 (doi: 10.5281/zenodo.7675982). 4066
221. Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4067
(doi: 10.5281/zenodo.7672388). 4068
222. Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4069
10.5281/zenodo.7668648). 4070
223. Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4071
10.5281/zenodo.7662810). 4072
224. Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4073
(doi: 10.5281/zenodo.7659162). 4074
225. Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4075
10.5281/zenodo.7653233). 4076
226. Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 4077
10.5281/zenodo.7653204). 4078
227. Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 4079
10.5281/zenodo.7653142). 4080
228. Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 4081
10.5281/zenodo.7653117). 4082
229. Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 4083
10.5281/zenodo.7653089). 4084
230. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4085
10.5281/zenodo.7651687). 4086
231. Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 4087
10.5281/zenodo.7651619). 4088
232. Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 4089
10.5281/zenodo.7651439). 4090
233. Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 4091
10.5281/zenodo.7650729). 4092
234. Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 4093
10.5281/zenodo.7647868). 4094
235. Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 4095
10.5281/zenodo.7647017). 4096
236. Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 4097
10.5281/zenodo.7644894). 4098
237. Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 4099
10.5281/zenodo.7641880). 4100
238. Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 4101
10.5281/zenodo.7632923). 4102
239. Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 4103
10.5281/zenodo.7623459). 4104
240. Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 4105
2023 (doi: 10.5281/zenodo.7606416). 4106
241. Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 4107
(doi: 10.5281/zenodo.7606416). 4108
242. Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4109
10.5281/zenodo.7606404). 4110
243. Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4111
10.5281/zenodo.7580018). 4112
244. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4113
10.5281/zenodo.7580018). 4114
245. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4115
10.5281/zenodo.7580018). 4116
246. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4117
10.5281/zenodo.7579929). 4118
247. Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4119
10.5281/zenodo.7563170). 4120
248. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4121
10.5281/zenodo.7563164). 4122
249. Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4123
10.5281/zenodo.7563160). 4124
250. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4125
10.5281/zenodo.7563160). 4126
251. Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4127
10.5281/zenodo.7563160). 4128
252. Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 4129
(doi: 10.5281/zenodo.7557063). 4130
253. Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4131
10.5281/zenodo.7557009). 4132
254. Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 4133
(doi: 10.5281/zenodo.7539484). 4134
255. Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 4135
2023 (doi: 10.5281/zenodo.7523390). 4136
256. Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 4137
(doi: 10.5281/zenodo.7523390). 4138
257. Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 4139
2023 (doi: 10.5281/zenodo.7523390). 4140
258. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4141
10.5281/zenodo.7574952). 4142
259. Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 4143
(doi: 10.5281/zenodo.7574992). 4144
260. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4145
10.5281/zenodo.7523357). 4146
261. Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4147
10.5281/zenodo.7523357). 4148
262. Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 4149
2023 (doi: 10.5281/zenodo.7504782). 4150
263. Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 4151
(doi: 10.5281/zenodo.7504782). 4152
264. Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 4153
2023 (doi: 10.5281/zenodo.7504782). 4154
265. Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4155
10.5281/zenodo.7499395). 4156
266. Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4157
10.5281/zenodo.7499395). 4158
267. Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4159
10.5281/zenodo.7499395). 4160
268. Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 4161
2023 (doi: 10.5281/zenodo.7497450). 4162
269. Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 4163
(doi: 10.5281/zenodo.7497450). 4164
270. Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 4165
(doi: 10.5281/zenodo.7494862). 4166
271. Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4167
10.5281/zenodo.7494862). 4168
272. Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 4169
(doi: 10.5281/zenodo.7494862). 4170
273. Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 4171
(doi: 10.5281/zenodo.7493845). 4172
274. Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4173
10.5281/zenodo.7493845). 4174
275. Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 4175
(doi: 10.5281/zenodo.7493845). 4176
276. Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4177
10.5281/zenodo.7539484). 4178
277. Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4179
10.5281/zenodo.7523390). 4180
278. Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4181
10.5281/zenodo.7523357). 4182
279. Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4183
10.5281/zenodo.7504782). 4184
280. Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4185
10.5281/zenodo.7499395). 4186
281. Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4187
10.5281/zenodo.7497450). 4188
282. Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4189
10.5281/zenodo.7494862). 4190
283. Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4191
10.5281/zenodo.7493845). 4192
284. Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4193
10.5281/zenodo.7480110). 4194
285. Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 4195
10.5281/zenodo.7378758). 4196
286. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 4197
10.5281/zenodo.6320305). 4198
287. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 4199
10.5281/zenodo.6677173). 4200
View publication stats

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous

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 Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous

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

452 PUBLICATIONS 13,219 CITATIONS

Metric Dimension in fuzzy(neutrosophic) Graphs View project

Number Graphs And Numbers View project

The user has requested enhancement of the downloaded file.

New Ideas In Recognition of Cancer And Neutrosophic 2

Hyper Nebbish On Super Nebulous 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

SuperHyperEulerian-Type-Path-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) 10

S is a Eulerian-Type-Path-Neighbor 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-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called 13

Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 14

Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called 15

Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 16

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

v-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutrosophic 18

v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 19

Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called 20

Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 21

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

SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 23

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, 24

Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic 25

rv-SuperHyperEulerian-Type-Path-Neighbor. ((Neutrosophic) SuperHyperEulerian-Type-Path-Neighbor). 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 SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 29

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, 30

Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic 31

rv-SuperHyperEulerian-Type-Path-Neighbor 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 SuperHyperEulerian-Type-Path-Neighbor; a Neutrosophic 36

SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 37

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, 38

Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic 39

rv-SuperHyperEulerian-Type-Path-Neighbor 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

SuperHyperEulerian-Type-Path-Neighbor; an Extreme SuperHyperEulerian-Type-Path-Neighbor 45

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, 46

Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 47

v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic 48

rv-SuperHyperEulerian-Type-Path-Neighbor 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 55

SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial if it’s either of Neutrosophic 56

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, 57

Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic 58

rv-SuperHyperEulerian-Type-Path-Neighbor 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