New Ideas On Super Nebulous by Hyper Nebbish of Eulerian-Type-Path-Neighbor in Recognition of Cancer With (Neutrosophic) SuperHyperGraph

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/370155678
New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path-

Neighbor In Cancer's Recognition With (Neutrosophic) SuperHyperGraph
Preprint · April 2023

DOI: 10.5281/zenodo.7851550
CITATIONS
1 author:
Henry Garrett
453 PUBLICATIONS 13,324 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project
Featured Articles 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 On Super Decompensation By Hyper Decompress 2
Of Eulerian-Type-Path-Decomposition In Cancer’s 3
Recognition With (Neutrosophic) SuperHyperGraph 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
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 88
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
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 101
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 102
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 “Extreme 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 “Extreme SuperHyperGraphs”. The cancer is the disease but the model is going 255
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 Extreme 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
Extreme 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 an 277
Extreme 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 Extreme 280
SuperHyperEulerian-Type-Path-Neighbor in those Extreme SuperHyperModels. Some general 281
results are introduced. Beyond that in SuperHyperStar, all possible Extreme 282
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s 283
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 “Extreme SuperHyperEulerian-Type-Path-Neighbor” on 297
“SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the research has taken 298
more motivations to define SuperHyperClasses and to find some connections amid this 299
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 Extreme 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 Extreme SuperHyperEulerian-Type-Path-Neighbor, are figured out in sections “ 311
SuperHyperEulerian-Type-Path-Neighbor” and “Extreme SuperHyperEulerian-Type-Path-Neighbor”. In 312
the sense of tackling on getting results and in Eulerian-Type-Path-Neighbor to make sense about 313
continuing the research, the ideas of SuperHyperUniform and Extreme 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 Extreme SuperHyperClasses”. As going back 317
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 Extreme 319
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 320
Extreme 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
“Extreme SuperHyperEulerian-Type-Path-Neighbor”, “Results on SuperHyperClasses” and 326
“Results on Extreme 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 Extreme 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. [183],Definition 2.2,p.2), [Neutrosophic 343
Set](Ref. [183],Definition 2.1,p.1), [Neutrosophic SuperHyperGraph 344
(NSHG)](Ref. [183],Definition 2.5,p.2), [Characterization of the Neutrosophic 345
SuperHyperGraph (NSHG)](Ref. [183],Definition 2.7,p.3), [t-norm](Ref. [183], 346
Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyperGraph 347
(NSHG)](Ref. [183],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 348
SuperHyperPaths] (Ref. [183],Definition 5.3,p.7), and [Different Neutrosophic Types of 349
Neutrosophic SuperHyperEdges (NSHE)] (Ref. [183],Definition 5.4,p.7). Also, the new 350
ideas and their clarifications are addressed to Ref. [183]. 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. [183],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. [183],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. [183],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. [183],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. [183], 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. [183],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. [183],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. [183],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
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 539
(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
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 590
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 591
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
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 610
contains the Extreme coefficients defined as the Extreme number of the maximum 611
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 612
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 613
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
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 623
contains the Neutrosophic coefficients defined as the Neutrosophic number of the 624
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 625
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 626
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 627
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 Extreme SuperHyper But As The

Eulerian-Type-Path-Neighbor 673
Extensions Excerpt From Dense And Super 674
Forms 675
Definition 4.1. (Extreme event). 676
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 677
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Any Extreme k-subset of A of V is 678
called Extreme k-event and if k = 2, then Extreme subset of A of V is called 679
Extreme event. The following expression is called Extreme probability of A. 680
X
E(A) = E(a). (4.1)
a∈A
Definition 4.2. (Extreme Independent). 681
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. s Extreme k-events Ai , i ∈ I is called 683
Extreme s-independent if the following expression is called Extreme 684
s-independent criteria 685
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Extreme k-events of A and B is called Extreme independent. 686
The following expression is called Extreme independent criteria 687
E(A ∩ B) = P (A)P (B). (4.2)
Definition 4.3. (Extreme Variable). 688
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Any k-function Eulerian-Type-Path-Neighbor 690
like E is called Extreme k-Variable. If k = 2, then any 2-function 691
Eulerian-Type-Path-Neighbor like E is called Extreme Variable. 692
The notion of independent on Extreme Variable is likewise. 693
Definition 4.4. (Extreme Expectation). 694
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. an Extreme k-Variable E has a 696
number is called Extreme Expectation if the following expression is called Extreme 697
Expectation criteria 698
X
Ex(E) = E(α)P (α).
α∈V
Definition 4.5. (Extreme Crossing). 699
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. an Extreme number is called 701
Extreme Crossing if the following expression is called Extreme Crossing criteria 702
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 4.6. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 703
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let m and n propose special 704
Eulerian-Type-Path-Neighbor. Then with m ≥ 4n, 705
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme 706
random k-subset of V obtained by choosing each SuperHyperVertex of G Extreme 707
independently with probability Eulerian-Type-Path-Neighbor p := 4n/m, and set H := G[S] and 708
H := G[S]. 709
Define random variables X, Y, Z on V as follows: X is the Extreme number of

SuperHyperVertices, Y the Extreme number of SuperHyperEdges, and Z the Extreme
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 Extreme 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: 710
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
711
Theorem 4.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 712
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let P be a SuperHyperSet of n 713
points in the plane, and let l be the Extreme number of SuperHyperLines √ in the plane 714
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 715
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet 716
P whose SuperHyperEdge are the segments between conseNeighborive points on the 717
SuperHyperLines which pass through at least k + 1 points of P. This Extreme 718
SuperHyperGraph has at least kl SuperHyperEdges and Extreme crossing at most l 719
choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or 720
3
l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Extreme Crossing Lemma, and again 721
l < 32n2 /k 3 . 722
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let P be a SuperHyperSet of n 724
points in the plane, and let k be the number of pairs of points of P at unit 725
SuperHyperDistance. Then k < 5n4/3 . 726
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 727
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Draw a SuperHyperUnit 728
SuperHyperCircle around each SuperHyperPoint of P. Let ni be the Extreme number of 729

P n−1
these SuperHyperCircles passing through exactly i points of P. Then i = 0 ni = n 730
and k = 21 i = 0n−1 ini . Now form an Extreme SuperHyperGraph H with

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

= {E4 }.
C(N SHG)Extreme Eulerian-Type-Path-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Eulerian-Type-Path-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Eulerian-Type-Path-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .
Figure 1. The Extreme SuperHyperGraphs Associated to the Extreme Notions of

Extreme SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (16.3)
836
straightforward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but 839
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 840
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 841
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no 842
Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 843
SuperHyperVertex, V3 , is excluded in every given Extreme 844
SuperHyperEulerian-Type-Path-Neighbor. 845

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

straightforward. 849

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

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




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

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


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

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



870

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

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

878

= {E1 }.
= z3.
= {V1 }.
= z5.
882

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

886

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

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



894

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


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

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




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

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


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

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



922

= {Ei ∈ EN SHG \ {E1 }}.
= z |Ei ∈EN SHG \{E1 }| .
= {Vi ∈ VN SHG \ {VE1 }}.
= z |Vi ∈VN SHG \{VE1 }| .
926
Proposition 4.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). 927
The all interior Extreme SuperHyperVertices belong to any Extreme 928
quasi-R-Eulerian-Type-Path-Neighbor if for any of them, and any of other corresponded Extreme 929
SuperHyperVertex, some interior Extreme SuperHyperVertices are mutually Extreme 930
SuperHyperNeighbors with no Extreme exception at all minus all Extreme 931
SuperHypeNeighbors to any amount of them. 932
Proposition 4.22. Assume a connected non-obvious Extreme SuperHyperGraph 933
ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only 934
the maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of 935
any given Extreme quasi-R-Eulerian-Type-Path-Neighbor minus all Extreme SuperHypeNeighbor to 936
some of them but not all of them. In other words, there’s only an unique Extreme 937
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Extreme SuperHyperVertices in 938
an Extreme quasi-R-Eulerian-Type-Path-Neighbor, minus all Extreme SuperHypeNeighbor to some 939
of them but not all of them. 940
Proposition 4.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If

an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then
the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Neighbor is 941
at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 942
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 943
words, the maximum number of the Extreme SuperHyperEdges contains the maximum 944
Extreme number of Extreme SuperHyperVertices are renamed to Extreme 945
Eulerian-Type-Path-Neighbor in some cases but the maximum number of the Extreme 946
SuperHyperEdge with the maximum Extreme number of Extreme SuperHyperVertices, 947
has the Extreme SuperHyperVertices are contained in an Extreme R-Eulerian-Type-Path-Neighbor. 948
Proposition 4.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then
the Extreme number of type-result-R-Eulerian-Type-Path-Neighbor has, the least Extreme cardinality,
the lower sharp Extreme bound for Extreme cardinality, is the Extreme 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 an Extreme type-result-R-Eulerian-Type-Path-Neighbor with the least Extreme cardinality, 949
the lower sharp Extreme bound for cardinality. 950
Proposition 4.25. Assume a connected loopless Extreme SuperHyperGraph 951
ESHG : (V, E). Then in the worst case, literally, 952
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the 953
lower sharp bound for the cardinality, of an Extreme type-result-Eulerian-Type-Path-Neighbor is the 954
cardinality of 955

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Extreme 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 Extreme SuperHyperEdges nor
amount of SuperHyperVertices where amount refers to the Extreme number of
SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of
SuperHyperEdges or any number of SuperHyperEdges. Let us consider the Extreme
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 Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to

propose property such that there’s no Extreme SuperHyperVertex of an Extreme
SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme
SuperHyperVertices but the maximum Extreme cardinality indicates that these
Extreme type-SuperHyperSets couldn’t give us the Extreme lower bound in the term of
Extreme sharpness. In other words, the Extreme 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 Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but

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

contradiction to the supposition on the connected loopless Extreme SuperHyperGraph
ESHG : (V, E). Thus the minimum case never happens in the generality of the
connected loopless Extreme 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 Extreme SuperHyperClasses of the connected
loopless Extreme 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 956
least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the 957
principles of the main definition since there’s no condition to be satisfied but the 958
condition is on the existence of the SuperHyperEdge instead of acting on the 959
SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the Extreme 960
SuperHyperSet has the necessary condition for the intended definition to be applied. 961
Thus the V \ V \ {z} is withdrawn not by the conditions of the main definition but by 962
the necessity of the pre-condition on the usage of the main definition. 963
The Extreme structure of the Extreme R-Eulerian-Type-Path-Neighbor decorates the

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

distinct-covers-order-amount Extreme SuperHyperEdges for amount of Extreme
SuperHyperVertices taken from the Extreme SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices
Is an Extreme R-Eulerian-Type-Path-Neighbor for the Extreme SuperHyperGraph as used 964
Extreme background in the Extreme terms of worst Extreme case and the common 965
theme of the lower Extreme bound occurred in the specific Extreme SuperHyperClasses 966
of the Extreme SuperHyperGraphs which are Extreme free-quasi-triangle. 967
Assume an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of

the Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least
no Extreme SuperHyperEdge with others in common. Thus those Extreme
SuperHyperVertices have the eligibles to be contained in an Extreme
R-Eulerian-Type-Path-Neighbor. Those Extreme SuperHyperVertices are potentially included in
an Extreme style-R-Eulerian-Type-Path-Neighbor. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme 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
Extreme SuperHyperVertices of the Extreme 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 Extreme SuperHyperVertices and there’s only and only
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme
SuperHyperVertices Zi and Zj . The other definition for the Extreme SuperHyperEdge
E ∈ EESHG:(V,E) in the terms of Extreme R-Eulerian-Type-Path-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Eulerian-Type-Path-Neighbor but
with slightly differences in the maximum Extreme cardinality amid those Extreme
type-SuperHyperSets of the Extreme SuperHyperVertices. Thus the Extreme
SuperHyperSet of the Extreme SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

z
and
is formalized with mathematical literatures on the Extreme R-Eulerian-Type-Path-Neighbor. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the
Extreme 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, 968
Extreme R-Eulerian-Type-Path-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
969
Extreme R-Eulerian-Type-Path-Neighbor =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Eulerian-Type-Path-Neighbor where

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

SExtreme SuperHyperSet = GExtreme Eulerian-Type-Path-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Type-Path-Neighbor is 1040
re-formalized and redefined as follows. 1041
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number
{SExtreme SuperHyperSet |
= zExtreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal 1042
technical definition for the Extreme Eulerian-Type-Path-Neighbor. 1043
GExtreme Eulerian-Type-Path-Neighbor =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme 1044
Eulerian-Type-Path-Neighbor poses the upcoming expressions. 1045
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 1046
= max zExtreme Number
[zExtreme
Number ]Extreme Class

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

To get more visions in the closer look-up, there’s an overall overlook. 1048
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


1049
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
= zExtreme Number |

1050

1051

Now, the extension of these types of approaches is up. Since the new term, “Extreme 1052
SuperHyperNeighborhood”, could be redefined as the collection of the Extreme 1053
SuperHyperVertices such that any amount of its Extreme SuperHyperVertices are 1054
incident to an Extreme SuperHyperEdge. It’s, literarily, another name for “Extreme 1055
Quasi-Eulerian-Type-Path-Neighbor” but, precisely, it’s the generalization of “Extreme 1056
Quasi-Eulerian-Type-Path-Neighbor” since “Extreme Quasi-Eulerian-Type-Path-Neighbor” happens 1057
“Extreme Eulerian-Type-Path-Neighbor” in an Extreme SuperHyperGraph as initial framework 1058
and background but “Extreme SuperHyperNeighborhood” may not happens “Extreme 1059
Eulerian-Type-Path-Neighbor” in an Extreme SuperHyperGraph as initial framework and 1060
preliminarily background since there are some ambiguities about the Extreme 1061
SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Extreme 1062
SuperHyperNeighborhood”, “Extreme Quasi-Eulerian-Type-Path-Neighbor”, and “Extreme 1063
Eulerian-Type-Path-Neighbor” are up. 1064
Thus, let 1065
zExtreme Number , NExtreme SuperHyperNeighborhood and 1066
GExtreme Eulerian-Type-Path-Neighbor be an Extreme number, an Extreme 1067
SuperHyperNeighborhood and an Extreme Eulerian-Type-Path-Neighbor and the new terms are 1068
up. 1069
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
1070
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
1071
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
1072
And with go back to initial structure, 1073
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


1074
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
= zExtreme Number |

1075

1076

Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 1077
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Neighbor if for 1078
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 1079
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no 1080
Extreme exception at all minus all Extreme SuperHypeNeighbors to any amount of 1081
them. 1082
To make sense with the precise words in the terms of “R-’, the follow-up illustrations 1083
are coming up. 1084
The following Extreme SuperHyperSet of Extreme SuperHyperVertices is the simple

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

Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Eulerian-Type-Path-Neighbor C(ESHG) for an Extreme 1085
SuperHyperGraph ESHG : (V, E) is an Extreme type-SuperHyperSet with 1086
the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1087
Extreme SuperHyperVertices such that there’s no an Extreme SuperHyperEdge amid 1088
some Extreme SuperHyperVertices instead of all given by 1089
Extreme Eulerian-Type-Path-Neighbor is related to the Extreme SuperHyperSet of the

Extreme SuperHyperVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme
SuperHyperSet. Thus the non-obvious Extreme Eulerian-Type-Path-Neighbor is up. The obvious
simple Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Path-Neighbor is an
Extreme SuperHyperSet includes only one Extreme SuperHyperVertex. But the
Extreme SuperHyperSet of Extreme SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme
SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the
non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Path-Neighbor
is up. To sum them up, the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme

R-Eulerian-Type-Path-Neighbor. Since the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Eulerian-Type-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph 1090
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 1091
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices 1092
instead of all given by that Extreme type-SuperHyperSet called the Extreme 1093
Eulerian-Type-Path-Neighbor and it’s an Extreme Eulerian-Type-Path-Neighbor. Since it’s 1094
the maximum Extreme cardinality of an Extreme SuperHyperSet S of

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

Eulerian-Type-Path-Neighbor, not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme 1095
SuperHyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded 1096
to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple 1097
Extreme type-SuperHyperSet called the 1098
“Extreme R-Eulerian-Type-Path-Neighbor” 1099
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 1100
Extreme R-Eulerian-Type-Path-Neighbor, 1101
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated

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

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

sharp bound for the cardinality, of an Extreme R-Eulerian-Type-Path-Neighbor is the cardinality
of
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The 1103
all interior Extreme SuperHyperVertices belong to any Extreme 1104
quasi-R-Eulerian-Type-Path-Neighbor if for any of them, and any of other corresponded Extreme 1105
SuperHyperVertex, some interior Extreme SuperHyperVertices are mutually Extreme 1106
SuperHyperNeighbors with no Extreme exception at all minus all Extreme 1107
SuperHypeNeighbors to any amount of them. 1108
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme 1109
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. 1110
Consider all Extreme numbers of those Extreme SuperHyperVertices from that Extreme 1111
SuperHyperEdge excluding excluding more than r distinct Extreme 1112
SuperHyperVertices, exclude to any given Extreme SuperHyperSet of the Extreme 1113
SuperHyperVertices. Consider there’s an Extreme R-Eulerian-Type-Path-Neighbor with the least 1114
cardinality, the lower sharp Extreme bound for Extreme cardinality. Assume a 1115
connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme SuperHyperSet of 1116
the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet S of the 1117
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 1118
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme 1119
R-Eulerian-Type-Path-Neighbor. Since it doesn’t have 1120
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 1122
some SuperHyperVertices uniquely. The Extreme SuperHyperSet of the Extreme 1123
SuperHyperVertices VESHE ∪ {z} is the maximum Extreme cardinality of an Extreme 1124
SuperHyperSet S of Extreme SuperHyperVertices but it isn’t an Extreme 1125
R-Eulerian-Type-Path-Neighbor. Since it doesn’t do the Extreme procedure such that such 1126
that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 1127
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, 1128
sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme 1129
SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 1130
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme 1131
procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 1132
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme 1133
SuperHyperNeighborhood. Thus the obvious Extreme R-Eulerian-Type-Path-Neighbor, VESHE 1134
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme 1135
R-Eulerian-Type-Path-Neighbor, VESHE , is an Extreme SuperHyperSet, VESHE , includes only 1136
all Extreme SuperHyperVertices does forms any kind of Extreme pairs are titled 1137
Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 1138
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 1139
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme 1140
SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 1141
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a 1142
connected Extreme SuperHyperGraph ESHG : (V, E). Any Extreme 1143
R-Eulerian-Type-Path-Neighbor only contains all interior Extreme SuperHyperVertices and all 1144
exterior Extreme SuperHyperVertices from the unique Extreme SuperHyperEdge where 1145
there’s any of them has all possible Extreme SuperHyperNeighbors in and there’s all 1146
Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 1147
SuperHypeNeighbors to some of them not all of them but everything is possible about 1148
Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 1149
The SuperHyperNotion, namely, Eulerian-Type-Path-Neighbor, is up. There’s neither empty 1150
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of 1151
Extreme SuperHyperEdges[SuperHyperVertices] is the simple Extreme 1152
type-SuperHyperSet of the Extreme Eulerian-Type-Path-Neighbor. The Extreme SuperHyperSet 1153
of Extreme SuperHyperEdges[SuperHyperVertices], 1154

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph 1157
ESHG : (V, E) is an Extreme type-SuperHyperSet with 1158
Extreme SuperHyperEdges[SuperHyperVertices] such that there’s no Extreme 1160
SuperHyperVertex of an Extreme SuperHyperEdge is common and there’s an Extreme 1161
SuperHyperEdge for all Extreme SuperHyperVertices. There are not only two Extreme 1162
SuperHyperVertices inside the intended Extreme SuperHyperSet. Thus the 1163
non-obvious Extreme Eulerian-Type-Path-Neighbor is up. The obvious simple Extreme 1164
type-SuperHyperSet called the Extreme Eulerian-Type-Path-Neighbor is an Extreme 1165
SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 1166
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 1167

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 Extreme 1168
SuperHyperSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the 1169
Extreme Eulerian-Type-Path-Neighbor is up. To sum them up, the Extreme SuperHyperSet of 1170
the Extreme SuperHyperEdges[SuperHyperVertices], 1171

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph 1175
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 1176
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices 1177
given by that Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Path-Neighbor 1178
and it’s an Extreme Eulerian-Type-Path-Neighbor. Since it’s 1179
Extreme SuperHyperEdges[SuperHyperVertices] such that there’s no Extreme 1181
SuperHyperVertex of an Extreme SuperHyperEdge is common and there’s an Extreme 1182
SuperHyperEdge for all Extreme SuperHyperVertices. There aren’t only less than three 1183
Extreme SuperHyperVertices inside the intended Extreme SuperHyperSet, 1184

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

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

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

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 Extreme 1189
SuperHyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious 1190
simple Extreme type-SuperHyperSet called the 1191
“Extreme Eulerian-Type-Path-Neighbor ” 1192
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 1193
Extreme Eulerian-Type-Path-Neighbor , 1194
is only and only 1195

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 1196
5 The Extreme Departures on The Theoretical 1197
Results Toward Theoretical Motivations 1198
The previous Extreme approach apply on the upcoming Extreme results on Extreme 1199
SuperHyperClasses. 1200
Proposition 5.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 1201

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
Proof. Let 1202
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
1203
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 Extreme SuperHyperPath ESHP : (V, E). 1204
There’s a new way to redefine as 1205
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 1206
corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Path-Neighbor. 1207
The latter is straightforward. 1208
Example 5.2. In the Figure (23), the connected Extreme SuperHyperPath 1209
ESHP : (V, E), is highlighted and featured. The Extreme SuperHyperSet, in the 1210
Extreme SuperHyperModel (23), is the SuperHyperEulerian-Type-Path-Neighbor. 1211
Proposition 5.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). 1212
Then 1213

= {Ei ∈ EN SHG }.
= |EN SHG |z |Ei ∈EN SHG | .
= {Vi ∈ VN SHG }.
= |EN SHG |z |Vi ∈VN SHG | .
Figure 23. an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor in the Example (16.5)
Proof. Let 1214
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
1215
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 Extreme SuperHyperCycle ESHC : (V, E). 1216

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is 1218
Example 5.4. In the Figure (24), the connected Extreme SuperHyperCycle 1221
N SHC : (V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in 1222
the Extreme SuperHyperModel (24), is the Extreme SuperHyperEulerian-Type-Path-Neighbor. 1223
Figure 24. an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (16.7)
Proposition 5.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 1224

= {Ei }.
= z |Ei | .
= {VEEXT
i
ERN AL
}.
EXT ERN AL
= z |VEi |
.
Proof. Let 1225
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
1226
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s 1227
a new way to redefine as 1228

Figure 25. an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (16.9)
Example 5.6. In the Figure (25), the connected Extreme SuperHyperStar 1232
ESHS : (V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, by 1233
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the 1234
connected Extreme SuperHyperStar ESHS : (V, E), in the Extreme SuperHyperModel 1235
(25), is the Extreme SuperHyperEulerian-Type-Path-Neighbor. 1236
Proposition 5.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). 1237
Then 1238

= {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 1239
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
1240
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 Extreme SuperHyperBipartite ESHB : (V, E). 1241

The latter is straightforward. Then there’s no at least one 1245
SuperHyperEulerian-Type-Path-Neighbor. Thus the notion of quasi may be up but the 1246
SuperHyperNotions based on SuperHyperEulerian-Type-Path-Neighbor could be applied. There 1247
are only two SuperHyperParts. Thus every SuperHyperPart could have one 1248
SuperHyperVertex as the representative in the 1249
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Extreme 1250
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 1251
minimum-Extreme-of-SuperHyperPart SuperHyperEdges are attained in any solution 1252
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Example 5.8. In the Extreme Figure (26), the connected Extreme 1254
SuperHyperBipartite ESHB : (V, E), is Extreme highlighted and Extreme featured. 1255
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 1256
result, of the Extreme SuperHyperVertices of the connected Extreme 1257
SuperHyperBipartite ESHB : (V, E), in the Extreme SuperHyperModel (26), is the 1258
Extreme SuperHyperEulerian-Type-Path-Neighbor. 1259
Figure 26. Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions

of Extreme SuperHyperEulerian-Type-Path-Neighbor in the Example (16.11)
Proposition 5.9. Assume a connected Extreme SuperHyperMultipartite 1260
ESHM : (V, E). Then 1261

= {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 1262
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
1263
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 1265

The latter is straightforward. Then there’s no at least one 1268
SuperHyperEulerian-Type-Path-Neighbor. Thus the notion of quasi may be up but the 1269
SuperHyperNotions based on SuperHyperEulerian-Type-Path-Neighbor could be applied. There 1270
are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1271
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite 1273
ESHM : (V, E). Thus only some SuperHyperVertices and only 1274
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
ESHM : (V, E). The latter is straightforward. 1277
Example 5.10. In the Figure (27), the connected Extreme SuperHyperMultipartite 1278
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme 1279
SuperHyperSet, by the Algorithm in previous Extreme result, of the Extreme 1280
SuperHyperVertices of the connected Extreme SuperHyperMultipartite 1281
ESHM : (V, E), in the Extreme SuperHyperModel (27), is the Extreme 1282
Proposition 5.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). 1284
Then, 1285

= {Ei ∈ (EN SHG }.
= z |Ei ∈(EN SHG | .
= {V EXT ERN AL }.
EXT ERN AL
= z |V |
.
Proof. Let 1286
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
Figure 27. an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor in the Example (16.13)
1287
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 1289

The latter is straightforward. Then there’s at least one SuperHyperEulerian-Type-Path-Neighbor. 1292
Thus the notion of quasi isn’t up and the SuperHyperNotions based on 1293
SuperHyperEulerian-Type-Path-Neighbor could be applied. The unique embedded 1294
SuperHyperEulerian-Type-Path-Neighbor proposes some longest 1295
SuperHyperEulerian-Type-Path-Neighbor excerpt from some representatives. The latter is 1296
Example 5.12. In the Extreme Figure (28), the connected Extreme SuperHyperWheel 1298
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme 1299
SuperHyperSet, by the Algorithm in previous result, of the Extreme 1300
SuperHyperVertices of the connected Extreme SuperHyperWheel ESHW : (V, E), in 1301
the Extreme SuperHyperModel (28), is the Extreme SuperHyperEulerian-Type-Path-Neighbor. 1302
6 The Surveys of Mathematical Sets On The 1303
Results But As The Initial Motivation 1304
For the SuperHyperEulerian-Type-Path-Neighbor, Extreme SuperHyperEulerian-Type-Path-Neighbor, and the 1305
Extreme SuperHyperEulerian-Type-Path-Neighbor, some general results are introduced. 1306
Figure 28. an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions

of Extreme SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (16.15)
Remark 6.1. Let remind that the Extreme SuperHyperEulerian-Type-Path-Neighbor is 1307
“redefined” on the positions of the alphabets. 1308
Corollary 6.2. Assume Extreme SuperHyperEulerian-Type-Path-Neighbor. Then 1309
Extreme 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
|ExtremecardinalityamidthoseSuperHyperEulerian−T ype−P ath−N eighbor. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 1310
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 1311
indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 1312
Corollary 6.3. Assume an Extreme SuperHyperGraph on the same identical letter of 1313
the alphabet. Then the notion of Extreme SuperHyperEulerian-Type-Path-Neighbor and 1314
SuperHyperEulerian-Type-Path-Neighbor coincide. 1315
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an 1317
Extreme SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a SuperHyperEulerian-Type-Path-Neighbor. 1318
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 1320
SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a longest SuperHyperEulerian-Type-Path-Neighbor. 1321
Corollary 6.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the 1322
same identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Path-Neighbor is 1323
its SuperHyperEulerian-Type-Path-Neighbor and reversely. 1324
Corollary 6.7. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, 1325
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on 1326
the same identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Path-Neighbor 1327
is its SuperHyperEulerian-Type-Path-Neighbor and reversely. 1328
Corollary 6.8. Assume an Extreme SuperHyperGraph. Then its Extreme 1329
SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 1330
SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined. 1331
Corollary 6.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 1332
Extreme SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 1333
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1336
Then its Extreme SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 1337
Corollary 6.11. Assume an Extreme SuperHyperGraph. Then its Extreme 1339
SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its 1340
SuperHyperEulerian-Type-Path-Neighbor is well-defined. 1341
Corollary 6.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 1342
its Extreme SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its 1343
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1346
Then its Extreme SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its 1347
Proposition 6.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 1349
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1350
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1351
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1352
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1353
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1354
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1355
Proposition 6.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 1356
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1357
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1358
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1359
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1360
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1361
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1362
Proposition 6.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 1363
independent SuperHyperSet is 1364
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1365
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1366
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1367
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1368
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1369
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1370
Proposition 6.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform 1371
SuperHyperGraph which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then V is 1372
a maximal 1373
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1374
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1375
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1376
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1377
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1378
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1379
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1380
Proposition 6.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 1381
SuperHyperUniform SuperHyperWheel. Then V is a maximal 1382
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1383
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1384
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1385
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1386
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1387
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1388
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1389
SuperHyperGraph which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then the 1391
number of 1392
(i) : the SuperHyperEulerian-Type-Path-Neighbor; 1393
(ii) : the SuperHyperEulerian-Type-Path-Neighbor; 1394
(iii) : the connected SuperHyperEulerian-Type-Path-Neighbor; 1395
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1396
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1397
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 1398
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1399
SuperHyperVertices coincide. 1400
SuperHyperGraph which is a SuperHyperWheel. Then the number of 1402
(i) : the dual SuperHyperEulerian-Type-Path-Neighbor; 1403
(ii) : the dual SuperHyperEulerian-Type-Path-Neighbor; 1404
(iii) : the dual connected SuperHyperEulerian-Type-Path-Neighbor; 1405
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1406
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 1407
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 1408
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1409
SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1412
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1413
SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 1414
number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 1415
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1419
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1420
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1421
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1424
SuperHyperSet contains the half of multiplying r with the number of all the 1425
SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1426
is a 1427
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1431
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1432
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1433
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 1436
number of 1437
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1441
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1442
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1443
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 1444
multiplying r with the number of all the SuperHyperEdges plus one of all the 1445
SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 1446
Proposition 6.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number 1448
of connected component is |V − S| if there’s a SuperHyperSet which is a dual 1449
(iv) : SuperHyperEulerian-Type-Path-Neighbor; 1453
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1454
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1455
Proposition 6.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the 1456
number is at most O(ESHG) and the Extreme number is at most On (ESHG). 1457
Proposition 6.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 1458
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 1459
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1460
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1464
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1466
Proposition 6.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. 1467
The number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the 1468
setting of dual 1469
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1473
(v) : strong 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1474
(vi) : connected 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1475
SuperHyperComplete. Then there’s no independent SuperHyperSet. 1477
SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath/SuperHyperWheel. The number is 1479
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 1480
dual 1481
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1485
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1486
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1487
SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 1489
number is O(ESHG:(V,E))
2 + 1 and the Extreme number is 1490
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of a dual 1491
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. 1497
Proposition 6.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1498
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is 1499
obtained for the individuals. Then the results also hold for the SuperHyperFamily 1500
N SHF : (V, E) of these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 1501
Proposition 6.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is 1502
a dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S 1503
such that 1504
(i) v ∈ Ns (x); 1505
(ii) vx ∈ E. 1506
Proposition 6.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is 1507
a dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then 1508
(i) S is SuperHyperEulerian-Type-Path-Neighbor set; 1509
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1510
Proposition 6.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 1511
(i) Γ ≤ O; 1512
(ii) Γs ≤ On . 1513
Proposition 6.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 1514
connected. Then 1515
(i) Γ ≤ O − 1; 1516
(ii) Γs ≤ On − Σ3i=1 σi (x). 1517
Proposition 6.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1518
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1519
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1521
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1522
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only 1523
a dual SuperHyperEulerian-Type-Path-Neighbor. 1524
Proposition 6.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1525
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive 1526
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and 1528
{v1 , v3 , · · · .vn−1 }; 1529
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1530
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only 1531
dual SuperHyperEulerian-Type-Path-Neighbor. 1532
Proposition 6.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Path-Neighbor. Then 1533
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive 1534
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and 1536
{v1 , v3 , · · · , vn−1 }; 1537
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1538
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only 1539
Proposition 6.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Path-Neighbor. Then 1541
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1542
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1544
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1545
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only 1546
Proposition 6.40. Let ESHG : (V, E) be SuperHyperStar. Then 1548
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Path-Neighbor; 1549
(ii) Γ = 1; 1550
(iii) Γs = Σ3i=1 σi (c); 1551
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual 1552
Proposition 6.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1554
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual 1555
maximal SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1556
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1557
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1558
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual 1559
maximal SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1560
Proposition 6.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1561
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive 1562
(ii) Γ = b n2 c + 1; 1564
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

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

bnc ; 1572
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 1573
Proposition 6.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme 1575
SuperHyperStars with common Extreme SuperHyperVertex SuperHyperSet. Then 1576
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive 1577
SuperHyperEulerian-Type-Path-Neighbor for N SHF; 1578
(ii) Γ = m for N SHF : (V, E); 1579
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1580
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual 1581
SuperHyperEulerian-Type-Path-Neighbor for N SHF : (V, E). 1582
Proposition 6.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd 1583
SuperHyperComplete SuperHyperGraphs with common Extreme SuperHyperVertex 1584
SuperHyperSet. Then 1585
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 1586
SuperHyperEulerian-Type-Path-Neighbor for N SHF; 1587
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1588

b n c+1 for N SHF : (V, E); 1589
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal 1590
Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1592
SuperHyperComplete SuperHyperGraphs with common Extreme SuperHyperVertex 1593
SuperHyperSet. Then 1594
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1595
SuperHyperEulerian-Type-Path-Neighbor for N SHF : (V, E); 1596
(ii) Γ = b n2 c for N SHF : (V, E); 1597

bnc for N SHF : (V, E); 1598
S={vi }i=1
bnc
(iv) the SuperHyperSets S = {vi }i=1 2
are only dual maximal 1599
following statements hold; 1602
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an 1603
t-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then S is an 1604
s-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1605
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1606
t-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then S is a dual 1607
s-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1608
following statements hold; 1610
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an 1611
t-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then S is an 1612
s-SuperHyperPowerful SuperHyperEulerian-Type-Path-Neighbor; 1613
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1614
t-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then S is a dual 1615
s-SuperHyperPowerful SuperHyperEulerian-Type-Path-Neighbor. 1616
Proposition 6.49. Let ESHG : (V, E) be a[an] 1617
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph. Then following statements 1618
hold; 1619
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 1620
2-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1621
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 1622
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 1624
(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 1626
V-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1627
Proposition 6.50. Let ESHG : (V, E) is a[an] 1628
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph. Then following statements 1629
hold; 1630
(i) ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1631
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 1633
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 1635
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 1637
V-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1638
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is a 1640
SuperHyperComplete. Then following statements hold; 1641
(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1642
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

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

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

2 c + 1, then ESHG : (V, E) is a dual 1655
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1657
(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 1658
(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1660
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is 1662
SuperHyperEulerian-Type-Path-Neighbor. Then following statements hold; 1663
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 1664
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1666
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 1668
2-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1671
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is 1673
SuperHyperEulerian-Type-Path-Neighbor. Then following statements hold; 1674
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 1675
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1677
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 1679
2-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 1682
7 Extreme Applications in Cancer’s Extreme 1683
Recognition 1684
The cancer is the Extreme disease but the Extreme model is going to figure out what’s 1685
going on this Extreme phenomenon. The special Extreme case of this Extreme disease is 1686
considered and as the consequences of the model, some parameters are used. The cells 1687
are under attack of this disease but the moves of the cancer in the special region are the 1688
matter of mind. The Extreme recognition of the cancer could help to find some Extreme 1689
treatments for this Extreme disease. 1690
In the following, some Extreme steps are Extreme devised on this disease. 1691
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the 1692
long-term Extreme function. 1693
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model 1694
[it’s called Extreme SuperHyperGraph] and the long Extreme cycle of the move 1695
from the cancer is identified by this research. Sometimes the move of the cancer 1696
hasn’t be easily identified since there are some determinacy, indeterminacy and 1697
neutrality about the moves and the effects of the cancer on that region; this event 1698
leads us to choose another model [it’s said to be Extreme SuperHyperGraph] to 1699
have convenient perception on what’s happened and what’s done. 1700
Step 3. (Extreme Model) There are some specific Extreme models, which are 1701
well-known and they’ve got the names, and some general Extreme models. The 1702
moves and the Extreme traces of the cancer on the complex tracks and between 1703
complicated groups of cells could be fantasized by an Extreme 1704
SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, 1705
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 1706
find either the Extreme SuperHyperEulerian-Type-Path-Neighbor or the Extreme 1707
SuperHyperEulerian-Type-Path-Neighbor in those Extreme Extreme SuperHyperModels. 1708
Figure 29. an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor
Table 4. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Extreme SuperHyperBipartite
8 Case 1: The Initial Extreme Steps Toward 1709
Extreme SuperHyperBipartite as Extreme 1710
SuperHyperModel 1711
Step 4. (Extreme Solution) In the Extreme Figure (29), the Extreme 1712
SuperHyperBipartite is Extreme highlighted and Extreme featured. 1713
By using the Extreme Figure (29) and the Table (4), the Extreme 1714
SuperHyperBipartite is obtained. 1715
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous 1716
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme 1717
SuperHyperBipartite ESHB : (V, E), in the Extreme SuperHyperModel (29), is 1718
the Extreme SuperHyperEulerian-Type-Path-Neighbor. 1719
9 Case 2: The Increasing Extreme Steps Toward 1720
Extreme SuperHyperMultipartite as Extreme 1721
SuperHyperModel 1722
Step 4. (Extreme Solution) In the Extreme Figure (30), the Extreme 1723
SuperHyperMultipartite is Extreme highlighted and Extreme featured. 1724
Figure 30. an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor
Table 5. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Extreme SuperHyperMultipartite
By using the Extreme Figure (30) and the Table (5), the Extreme 1725
SuperHyperMultipartite is obtained. 1726
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 1727
of the Extreme SuperHyperVertices of the connected Extreme 1728
SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (30), 1729
is the Extreme SuperHyperEulerian-Type-Path-Neighbor. 1730
10 Wondering Open Problems But As The 1731
Directions To Forming The Motivations 1732
In what follows, some “problems” and some “questions” are proposed. 1733
The SuperHyperEulerian-Type-Path-Neighbor and the Extreme SuperHyperEulerian-Type-Path-Neighbor are 1734
defined on a real-world application, titled “Cancer’s Recognitions”. 1735
Question 10.1. Which the else SuperHyperModels could be defined based on Cancer’s 1736
recognitions? 1737
Question 10.2. Are there some SuperHyperNotions related to 1738
SuperHyperEulerian-Type-Path-Neighbor and the Extreme SuperHyperEulerian-Type-Path-Neighbor? 1739
Question 10.3. Are there some Algorithms to be defined on the SuperHyperModels to 1740
compute them? 1741
Question 10.4. Which the SuperHyperNotions are related to beyond the 1742
SuperHyperEulerian-Type-Path-Neighbor and the Extreme SuperHyperEulerian-Type-Path-Neighbor? 1743
Problem 10.5. The SuperHyperEulerian-Type-Path-Neighbor and the Extreme 1744
SuperHyperEulerian-Type-Path-Neighbor do a SuperHyperModel for the Cancer’s recognitions and 1745
they’re based on SuperHyperEulerian-Type-Path-Neighbor, are there else? 1746
Problem 10.6. Which the fundamental SuperHyperNumbers are related to these 1747
SuperHyperNumbers types-results? 1748
Problem 10.7. What’s the independent research based on Cancer’s recognitions 1749
concerning the multiple types of SuperHyperNotions? 1750
11 Conclusion and Closing Remarks 1751
In this section, concluding remarks and closing remarks are represented. The drawbacks 1752
of this research are illustrated. Some benefits and some advantages of this research are 1753
highlighted. 1754
This research uses some approaches to make Extreme SuperHyperGraphs more 1755
understandable. In this endeavor, two SuperHyperNotions are defined on the 1756
SuperHyperEulerian-Type-Path-Neighbor. For that sake in the second definition, the main definition 1757
of the Extreme SuperHyperGraph is redefined on the position of the alphabets. Based on 1758
the new definition for the Extreme SuperHyperGraph, the new SuperHyperNotion, 1759
Extreme SuperHyperEulerian-Type-Path-Neighbor, finds the convenient background to implement 1760
some results based on that. Some SuperHyperClasses and some Extreme 1761
SuperHyperClasses are the cases of this research on the modeling of the regions where 1762
are under the attacks of the cancer to recognize this disease as it’s mentioned on the title 1763
“Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 1764
SuperHyperEulerian-Type-Path-Neighbor, the new SuperHyperClasses and SuperHyperClasses, are 1765
introduced. Some general results are gathered in the section on the 1766
SuperHyperEulerian-Type-Path-Neighbor and the Extreme SuperHyperEulerian-Type-Path-Neighbor. The 1767
clarifications, instances and literature reviews have taken the whole way through. In this 1768
research, the literature reviews have fulfilled the lines containing the notions and the 1769
results. The SuperHyperGraph and Extreme SuperHyperGraph are the 1770
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of 1771
this research. Sometimes the cancer has been happened on the region, full of cells, groups 1772
of cells and embedded styles. In this segment, the SuperHyperModel proposes some 1773
SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 1774
and strongest styles with the formation of the design and the architecture are formally 1775
called “ SuperHyperEulerian-Type-Path-Neighbor” in the themes of jargons and buzzwords. The 1776
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 1777
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 Extreme SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Path-Neighbor
3. Extreme SuperHyperEulerian-Type-Path-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies
1778
research are, figured out, pointed out and spoken out. 1779
12 Extreme SuperHyperDuality But As The 1780
Forms 1782
Definition 12.1. (Different Extreme Types of Extreme SuperHyperDuality). 1783
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an 1784
Extreme SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 1785
V 0 or E 0 is called 1786
(i) Extreme e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such 1787
that Va ∈ Ei , Ej ; 1788
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such 1789
that Va ∈ Ei , Ej and 1790
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1791
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such 1792
that Vi , Vj ∈ Ea ; 1793
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such 1794
that Vi , Vj ∈ Ea and 1795
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1796
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 1797
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme 1798
rv-SuperHyperDuality. 1799
Definition 12.2. ((Extreme) SuperHyperDuality). 1800
Extreme SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1802
(i) an Extreme SuperHyperDuality if it’s either of Extreme 1803
e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme 1804
v-SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an 1805
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 1806
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1807
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1808
Extreme SuperHyperDuality; 1810
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 1811
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme 1812
rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 1813
N SHG : (V, E) is the maximum Extreme cardinality of the Extreme 1814
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1815
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1816
such that they form the Extreme SuperHyperDuality; 1817
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1818
Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme 1819
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1821
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1822
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 1823
an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1824
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1825
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1826
Extreme coefficient; 1827
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1828
(v) an Extreme R-SuperHyperDuality if it’s either of Extreme 1838
Extreme SuperHyperDuality; 1845
(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme 1846
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 1850
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 1851
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 1852
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 1853
of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme 1854
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 1858
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1859
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1863
Extreme coefficient. 1872
SuperHyperDuality, is up. The Extreme Algorithm is Extremely straightforward. 1876
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 1877
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of 1878
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 1879
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no 1880
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 1882
C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.
E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 1885
SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 1886
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 1887
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as 1888
an Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in 1889
every given Extreme SuperHyperDuality. 1890


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

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

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

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

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

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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

C(N SHG)Extreme 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)Extreme SuperHyperDuality = {E3i+1i=03 }.

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



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

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

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

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1939
Extreme SuperHyperModel (23), is the SuperHyperDuality. 1943
Then 1945
C(N SHG)Extreme SuperHyperDuality =

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

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

the Extreme SuperHyperModel (24), is the Extreme SuperHyperDuality. 1954
Proposition 12.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). 1955
Then 1956
C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

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

(25), is the Extreme SuperHyperDuality. 1967
Proposition 12.10. Assume a connected Extreme SuperHyperBipartite 1968
ESHB : (V, E). Then 1969
C(N SHG)Extreme 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) |
Extreme Cardinality
Proof. Let 1970
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 1975
isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 1976
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 1977
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite 1979
ESHB : (V, E). Thus only some SuperHyperVertices and only 1980
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperDuality. 1988

= {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 |
Extreme Cardinality
Proof. Let 1991
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Extreme 1992

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1998
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperVertices of the connected Extreme SuperHyperMultipartite ESHM : (V, E), 2008
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperDuality. 2009
Then, 2011
∗ ∗
C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
Extreme Cardinality
|z.
C(N SHG)Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 2012
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Extreme Cardinality +1
ESHG:(V,E) Extreme Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperWheel 2013
ESHW : (V, E). There’s a new way to redefine as 2014

∃!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 2019
excerpt from some representatives. The latter is straightforward. 2020
SuperHyperWheel N SHW : (V, E), is Extreme highlighted and featured. The obtained 2022
Extreme SuperHyperSet, by the Algorithm in previous result, of the Extreme 2023
the Extreme SuperHyperModel (28), is the Extreme SuperHyperDuality. 2025
13 Extreme SuperHyperJoin But As The 2026
Forms 2028
Definition 13.1. (Different Extreme Types of Extreme SuperHyperJoin). 2029
(i) Extreme e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 2033
Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2034
(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 2035
Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2036
(iii) Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2038
Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2039
(iv) Extreme rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2040
Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2041
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 2043
re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 2044
Definition 13.2. ((Extreme) SuperHyperJoin). 2045
(i) an Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2048
Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 2049
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 2050
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 2051
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in 2052
the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 2053
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 2054
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2055
rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph 2057
such that they form the Extreme SuperHyperJoin; 2061
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2062
Extreme e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme 2063
v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and C(N SHG) for an 2064
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2070
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2072
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2082
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 2086
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 2087
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 2088
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2089
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2093
such that they form the Extreme SuperHyperJoin; 2095
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 2096
(viii) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2106
SuperHyperJoin, is up. The Extreme Algorithm is Extremely straightforward. E1 2119
and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2120
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperJoin. 2125
C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .
SuperHyperJoin, is up. The Extreme Algorithm is Extremely straightforward. 2127
every given Extreme SuperHyperJoin. 2133


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

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

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

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

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

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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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

3 × 3z 2 .



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

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

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

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


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

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

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

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

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2182
Extreme SuperHyperModel (23), is the SuperHyperJoin. 2186
Then 2188

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

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

the Extreme SuperHyperModel (24), is the Extreme SuperHyperJoin. 2197
Then 2199
C(N SHG)Extreme Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

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

(25), is the Extreme SuperHyperJoin. 2210
C(N SHG)Extreme 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 |
Extreme Cardinality
Proof. Let 2213
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 2218
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2219
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2220
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite 2222
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperJoin. 2231

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 |
Extreme Cardinality
Proof. Let 2234
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperMultipartite 2235
ESHM : (V, E). There’s a new way to redefine as 2236

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 2239
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2240
There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 2241
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperJoin. 2252
Then, 2254

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

.
Proof. Let 2255
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperWheel 2256

straightforward. Then there’s at least one SuperHyperJoin. Thus the notion of quasi 2260
isn’t up and the SuperHyperNotions based on SuperHyperJoin could be applied. The 2261
unique embedded SuperHyperJoin proposes some longest SuperHyperJoin excerpt from 2262
some representatives. The latter is straightforward. 2263
the Extreme SuperHyperModel (28), is the Extreme SuperHyperJoin. 2268
14 Extreme SuperHyperPerfect But As The 2269
Forms 2271
Definition 14.1. (Different Extreme Types of Extreme SuperHyperPerfect). 2272
(i) Extreme e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 2276
that Va ∈ Ei , Ej ; 2277
(ii) Extreme re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 2278
that Va ∈ Ei , Ej ; and 2279
(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such 2281
that Vi , Vj ∈ Ea ; 2282
(iv) Extreme rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such 2283
that Vi , Vj ∈ Ea ; and 2284
(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 2286
Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme 2287
rv-SuperHyperPerfect. 2288
Definition 14.2. ((Extreme) SuperHyperPerfect). 2289
(i) an Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 2292
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 2294
Extreme SuperHyperVertices such that they form the Extreme 2298
SuperHyperPerfect; 2299
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 2300
rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 2302
such that they form the Extreme SuperHyperPerfect; 2306
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2307
Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2308
v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an 2309
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2315
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2317
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme 2327
e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2328
Extreme SuperHyperPerfect; 2334
(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme 2335
e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2336
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 2339
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2340
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 2341
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 2342
of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2343
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2352
SuperHyperPerfect, is up. The Extreme Algorithm is Extremely straightforward. 2365
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 2371
C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.
every given Extreme SuperHyperPerfect. 2379


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

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

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

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

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

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

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

3 × 4 × 4z 3 .

3 × 2z 2 .

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

3 × 3z 2 .



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

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

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

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



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

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

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

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2428
Extreme SuperHyperModel (23), is the SuperHyperPerfect. 2432
Then 2434
C(N SHG)Extreme SuperHyperPerfect =

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

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

the Extreme SuperHyperModel (24), is the Extreme SuperHyperPerfect. 2443
Then 2445
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

(25), is the Extreme SuperHyperPerfect. 2456
C(N SHG)Extreme 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)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 2459
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 2464
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2465
applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2466
one SuperHyperVertex as the representative in the 2467
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite 2468
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperPerfect. 2477

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)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 2480
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme 2481

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 2485
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2486
applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2487
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperPerfect. 2498
Then, 2500
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 2501
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperWheel 2502

straightforward. Then there’s at least one SuperHyperPerfect. Thus the notion of quasi 2506
isn’t up and the SuperHyperNotions based on SuperHyperPerfect could be applied. The 2507
unique embedded SuperHyperPerfect proposes some longest SuperHyperPerfect excerpt 2508
from some representatives. The latter is straightforward. 2509
the Extreme SuperHyperModel (28), is the Extreme SuperHyperPerfect. 2514
15 Extreme SuperHyperTotal But As The 2515
Forms 2517
Definition 15.1. (Different Extreme Types of Extreme SuperHyperTotal). 2518
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 2522
Va ∈ Ei , Ej ; 2523
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 2524
Va ∈ Ei , Ej ; and 2525
(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 2527
Vi , Vj ∈ Ea ; 2528
(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 2529
Vi , Vj ∈ Ea ; and 2530
(v) Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2532
Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme 2533
rv-SuperHyperTotal. 2534
Definition 15.2. ((Extreme) SuperHyperTotal). 2535
(i) an Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2538
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 2540
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2544
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2545
rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph 2547
such that they form the Extreme SuperHyperTotal; 2551
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2552
Extreme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme 2553
v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and C(N SHG) for an 2554
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2560
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2562
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2572
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 2576
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 2577
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2578
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2579
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2583
such that they form the Extreme SuperHyperTotal; 2585
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2586
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2596
SuperHyperTotal, is up. The Extreme Algorithm is Extremely straightforward. 2609
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperTotal. 2615
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.
every given Extreme SuperHyperTotal. 2623


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

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

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

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial 20z 10 .
C(N SHG)Extreme R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Extreme 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 R-SuperHyperTotal SuperHyperPolynomial =
3 × 4 × 4z 3 .

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

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 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)Extreme R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Extreme 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)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .
Then 2667
C(N SHG)Extreme SuperHyperTotal =

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

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2672
Extreme SuperHyperModel (23), is the SuperHyperTotal. 2676
Then 2678
C(N SHG)Extreme SuperHyperTotal =

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

the Extreme SuperHyperModel (24), is the Extreme SuperHyperTotal. 2687
Then 2689
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

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


(25), is the Extreme SuperHyperTotal. 2700
C(N SHG)Extreme 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)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 2703
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2708
quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2709
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperBipartite 2712
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperTotal. 2721

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)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 2724
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 2725
ESHM : (V, E). There’s a new way to redefine as 2726

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2729
quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2730
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperTotal. 2742
Then, 2744
∗
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)|Extreme Cardinality
|z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.
Proof. Let 2745
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel 2746

straightforward. Then there’s at least one SuperHyperTotal. Thus the notion of quasi 2750
isn’t up and the SuperHyperNotions based on SuperHyperTotal could be applied. The 2751
unique embedded SuperHyperTotal proposes some longest SuperHyperTotal excerpt 2752
from some representatives. The latter is straightforward. 2753
the Extreme SuperHyperModel (28), is the Extreme SuperHyperTotal. 2758
16 Extreme SuperHyperConnected But As The 2759
Forms 2761
Definition 16.1. (Different Extreme Types of Extreme SuperHyperConnected). 2762
(i) Extreme e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2766
such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2767
(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2768
such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2769
(iii) Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , 2771
such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2772
(iv) Extreme rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , 2773
such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2774
(v) Extreme SuperHyperConnected if it’s either of Extreme 2776
e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2777
v-SuperHyperConnected, and Extreme rv-SuperHyperConnected. 2778
Definition 16.2. ((Extreme) SuperHyperConnected). 2779
(i) an Extreme SuperHyperConnected if it’s either of Extreme 2782
v-SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) 2784
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2785
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 2786
Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 2787
Extreme SuperHyperConnected; 2789
(ii) a Extreme SuperHyperConnected if it’s either of Extreme 2790
for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2793
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 2794
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 2795
SuperHyperConnected; 2797
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2798
of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2799
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2801
the Extreme SuperHyperConnected; and the Extreme power is corresponded to its 2806
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 2808
Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2809
(v) an Extreme R-SuperHyperConnected if it’s either of Extreme 2818
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 2822
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 2823
the Extreme SuperHyperConnected; 2825
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme 2826
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 2830
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 2831
SuperHyperConnected; 2833
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s 2834
either of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, 2835
Extreme v-SuperHyperConnected, and Extreme rv-SuperHyperConnected and 2836
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2837
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 2844
Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2845
SuperHyperConnected, is up. The Extreme Algorithm is Extremely 2857
straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is 2858
a loop Extreme SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in 2859
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme 2860
SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme 2861
isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2862
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2863
Extreme SuperHyperConnected. 2864
C(N SHG)Extreme SuperHyperConnected = {E4 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.
straightforward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but 2867
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2868
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 2869
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no 2870
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 2872


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

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

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

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

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)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Extreme R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

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 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 R-SuperHyperConnected = {V1 , V5 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z 2 .


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 .

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)Extreme R-Quasi-SuperHyperConnected = {Vi+2i=011 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 10z.

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 .
Then 2936
C(N SHG)Extreme Quasi-SuperHyperConnected =

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

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 2941
Extreme SuperHyperModel (23), is the SuperHyperConnected. 2945
Then 2947
C(N SHG)Extreme Quasi-SuperHyperConnected =

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

The term “EXTERNAL” implies |N (ViEXT ERN AL )|
≥ |N (Vj )| where Vj is 2951
the Extreme SuperHyperModel (24), is the Extreme SuperHyperConnected. 2956
Then 2958
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

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

(25), is the Extreme SuperHyperConnected. 2969
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme 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)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 2972
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 2977
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 2978
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme 2981
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2982
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperConnected. 2990
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme 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)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 2993
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme 2994

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 2998
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 2999
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperConnected. 3011
Then, 3013
∗
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Extreme Cardinality |z.
C(N SHG)Extreme V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 3014
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 3015

straightforward. Then there’s at least one SuperHyperConnected. Thus the notion of 3019
quasi isn’t up and the SuperHyperNotions based on SuperHyperConnected could be 3020
applied. The unique embedded SuperHyperConnected proposes some longest 3021
SuperHyperConnected excerpt from some representatives. The latter is 3022
the Extreme SuperHyperModel (28), is the Extreme SuperHyperConnected. 3028
17 Background 3029
There are some scientific researches covering the topic of this research. In what follows, 3030
there are some discussion and literature reviews about them. 3031
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and 3032
neutrosophic degree alongside chromatic numbers in the setting of some classes related 3033
to neutrosophic hypergraphs” in Ref. [1] by Henry Garrett (2022). In this research 3034
article, a novel approach is implemented on SuperHyperGraph and neutrosophic 3035
SuperHyperGraph based on general forms without using neutrosophic classes of 3036
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 3037
entitled “Journal of Current Trends in Computer Science Research (JCTCSR)” with 3038
ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 3039
06-14. The research article studies deeply with choosing neutrosophic hypergraphs 3040
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 3041
results based on initial background. 3042
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and 3043
Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in 3044
Game Theory and Neutrosophic Super Hyper Classes” in Ref. [2] by Henry Garrett 3045
(2022). In this research article, a novel approach is implemented on SuperHyperGraph 3046
and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and using 3047
neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s published in 3048
prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 3049
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques 3050
Comput Math” in volume 1 and issue 3 with pages 242-263. The research article studies 3051
deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s 3052
the breakthrough toward independent results based on initial background and fundamental 3053
SuperHyperNumbers. 3054
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 3055
and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 3056
Graphs Alongside Applications in Cancer’s Treatments” in Ref. [3] by Henry Garrett 3057
(2023). In this research article, a novel approach is implemented on SuperHyperGraph 3058
and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 3059
in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 3060
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 3061
ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 3062
pages 35-47. The research article studies deeply with choosing directly neutrosophic 3063
SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 3064
results based on initial background and fundamental SuperHyperNumbers. 3065
In some articles are titled “0039 — Closing Numbers and Super-Closing Numbers as 3066
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 3067
(Neutrosophic)n-SuperHyperGraph” in Ref. [5] by Henry Garrett (2022), “0049 — 3068
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [6] by Henry Garrett 3069
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 3070
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 3071
in Ref. [7] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 3072
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 3073
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [8] by 3074
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3075
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [9] by Henry Garrett (2022), 3076
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 3077
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 3078
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 3079
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [10] by Henry 3080
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case 3081
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition 3082
Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [11] by Henry Garrett (2022), 3083
“Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 3084
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in 3085
Ref. [12] by Henry Garrett (2022), “Extremism of the Attacked Body Under the 3086
Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3087
SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 3088
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 3089
Ref. [14] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 3090
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 3091
Special ViewPoints” in Ref. [15] by Henry Garrett (2022), “Neutrosophic 1-Failed 3092
SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 3093
on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [16] by Henry Garrett 3094
(2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 3095
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [17] by Henry Garrett 3096
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 3097
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3098
in Ref. [13] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 3099
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 3100
And (Neutrosophic) SuperHyperGraphs” in Ref. [18] by Henry Garrett (2022), 3101
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 3102
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [19] by 3103
Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3104
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [20] by 3105
Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3106
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 3107
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 3108
(Neutrosophic) SuperHyperClasses” in Ref. [21] by Henry Garrett (2022), 3109
“SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With 3110
SuperHyperModeling of Cancer’s Recognitions” in Ref. [22] by Henry Garrett (2022), 3111
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 3112
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 3113
Treatments” in Ref. [23] by Henry Garrett (2022), “SuperHyperDominating and 3114
SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 3115
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [24] by Henry Garrett 3116
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 3117
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [153] by Henry 3118
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 3119
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set 3120
and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [154] by Henry Garrett 3121
(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 3122
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels 3123
Named (Neutrosophic) SuperHyperGraphs” in Ref. [155] by Henry Garrett (2023), 3124
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks 3125
In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called 3126
Neutrosophic SuperHyperGraphs” in Ref. [156] by Henry Garrett (2023), “Perfect 3127
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 3128
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [159] by 3129
Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded 3130
Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 3131
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [160] by Henry 3132
Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 3133
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 3134
the Form of Neutrosophic SuperHyperGraphs” in Ref. [163] by Henry Garrett (2023), 3135
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 3136
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [166] by Henry 3137
Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 3138
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3139
in Ref. [167] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 3140
Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 3141
Ref. [168] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 3142
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 3143
Recognition And Beyond” in Ref. [169] by Henry Garrett (2022), “(Neutrosophic) 3144
1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) 3145
SuperHyperGraphs” in Ref. [170] by Henry Garrett (2022), “Basic Notions on 3146
(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 3147
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [171] by Henry Garrett 3148
(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 3149
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [182] by Henry 3150
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 3151
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 3152
SuperHyperGraph (NSHG)” in Ref. [183] by Henry Garrett (2022), and [4–183], there 3153
are some endeavors to formalize the basic SuperHyperNotions about neutrosophic 3154
SuperHyperGraph and SuperHyperGraph alongside scientific research books at [184–287]. 3155
Two popular scientific research books in Scribd in the terms of high readers, 4190 and 3156
5189 respectively, on neutrosophic science is on [288, 289]. 3157
Some scientific studies and scientific researches about neutrosophic graphs, are 3158
proposed as book in Ref. [276] by Henry Garrett (2023) which is indexed by Google 3159
Scholar and has more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic 3160
Graphs” and published by Dr. Henry Garrett. This research book covers different types 3161
of notions and settings in neutrosophic graph theory and neutrosophic SuperHyperGraph 3162
theory. 3163
Also, some scientific studies and scientific researches about neutrosophic graphs, are 3164
proposed as book in Ref. [277] by Henry Garrett (2023) which is indexed by Google 3165
Scholar and has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” 3166
and published by Dr. Henry Garrett. This research book presents different types of 3167
notions SuperHyperResolving and SuperHyperDominating in the setting of duality in 3168
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research 3169
book has scrutiny on the complement of the intended set and the intended set, 3170
simultaneously. It’s smart to consider a set but acting on its complement that what’s 3171
done in this research book which is popular in the terms of high readers in Scribd. 3172
See the seminal scientific researches [1–3]. The formalization of the notions on the 3173
framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 3174
theory, and (Neutrosophic) SuperHyperGraphs theory at [4–183] alongside scientific 3175
research books at [184–287]. Two popular scientific research books in Scribd in the terms 3176
of high readers, 4331 and 5327 respectively, on neutrosophic science is on [288, 289]. 3177
References 3178
1. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 3179
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 3180
Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. 3181
2. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 3182
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 3183
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 3184
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 3185
3. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 3186
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 3187
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 3188
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 3189
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 3190
graphs-and-super-hyper-graphs-alongside-a.pdf) 3191
4. Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 3192
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 3193
Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 3194
(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 3195
research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by-eulerian- 3196
super-hyper-cycles-and-hamiltonian-sets-.pdf) 3197
5. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 3198
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 3199
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 3200
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 3201
Research, https://doi.org/10.5281/zenodo.6319942. 3202
https://oa.mg/work/10.5281/zenodo.6319942 3203
6. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 3204
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 3205
2022. CERN European Organization for Nuclear Research, 3206
https://doi.org/10.13140/rg.2.2.35241.26724. 3207
https://oa.mg/work/10.13140/rg.2.2.35241.26724 3208
7. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 3209
Confrontation under Cancer’s Recognition as the Model in The Setting of 3210
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 3211
10.20944/preprints202301.0308.v1). 3212
8. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 3213
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3214
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3215
2023010282 (doi: 10.20944/preprints202301.0282.v1). 3216
9. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 3217
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 3218
2023010267 (doi: 10.20944/preprints202301.0267.v1). 3219
10. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3220
Affected Cells Toward The Totality Under Cancer’s Recognition By New 3221
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3222
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3223
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3224
10.20944/preprints202301.0265.v1). 3225
11. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 3226
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3227
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3228
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3229
12. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3230
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3231
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3232
10.20944/preprints202301.0240.v1). 3233
13. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3234
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3235
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3236
10.20944/preprints202301.0224.v1). 3237
14. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3238
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3239
2023010105 (doi: 10.20944/preprints202301.0105.v1). 3240
15. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3241
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 3242
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 3243
10.20944/preprints202301.0088.v1). 3244
16. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3245
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3246
Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3247
17. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3248
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3249
2023010043 (doi: 10.20944/preprints202301.0043.v1). 3250
18. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3251
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3252
10.20944/preprints202301.0105.v1). 3254
10.20944/preprints202301.0088.v1). 3258
20. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3259
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3260
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3261
21. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3262
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 3263
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 3264
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3265
2022120540 (doi: 10.20944/preprints202212.0540.v1). 3266
22. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3267
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3268
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3269
23. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3270
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3271
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3272
10.20944/preprints202212.0324.v1). 3273
24. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3274
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3275
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3276
10.20944/preprints202211.0576.v1). 3277
25. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3278
SuperHyperGraph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super 3279
Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7851519). 3280
26. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3281
Eulerian-Type-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 3282
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7851550). 3283
SuperHyperGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress 3285
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333). 3286
28. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3287
Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 3288
SuperHyperGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super 3291
EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7834229). 3292
30. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 3293
Eulerian-Type-Path-Cut In Cancer’s Recognition With (Neutrosophic) 3294
SuperHyperGraph By Eulerian-Path-Neighbor As Hyper Nebbish On Super 3297
Eulerian-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 3300
SuperHyperGraph By Eulerian-Path-Decomposition As Hyper Decompress On 3303
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7819531). 3304
Eulerian-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 3306
SuperHyperGraph As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 3309
10.5281/zenodo.7812236). 3310
SuperHyperGraph By initial Eulerian-Path-Cut As Hyper initial Eulogy On 3312
Super initial EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7809365). 3313
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super 3315
EULA-Path-Cut”, Zenodo 2023, (doi: 10.5281/zenodo.7809358). 3316
38. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 3317
Eulerian-Path-Cut In Cancer’s Recognition With (Neutrosophic) 3318
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, 3321
Zenodo 2023, (doi: 10.5281/zenodo.7809328). 3322
SuperHyperGraph By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On 3324
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7806767). 3325
Hamiltonian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 3327
SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper 3330
Decompress On Super Decompensation”, Zenodo 2023, (doi: 3331
10.5281/zenodo.7804238). 3332
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With 3334
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 3335
10.5281/zenodo.7804228). 3336
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super 3338
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7799902). 3339
45. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 3340
Hamiltonian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3341
SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super 3344
SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress 3347
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). 3348
SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super 3350
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7791952). 3351
Hamiltonian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3353
SuperHyperGraph By Hamiltonian-Neighbor As Hyper Nebbish On Super 3356
Hamiltonian-Neighbor In Recognition of Cancer With (Neutrosophic) 3359
SuperHyperGraph By Hamiltonian-Decomposition As Hyper Decompress On 3362
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7787066). 3363
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) 3365
SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, 3368
Hamiltonian-Cut In Recognition of Cancer With (Neutrosophic) 3371
SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, 3374
Trace-Neighbor In Recognition of Cancer With (Neutrosophic) 3377
58. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3379
SuperHyperGraph By Trace-Decomposition As Hyper Decompress On Super 3380
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7771831). 3381
Trace-Decomposition In Cancer’s Recognition With (Neutrosophic) 3383
SuperHyperGraph By Trace-Cut As Hyper Nebbish On Super Nebulous”, 3386
ResearchGate 2023, (doi: 10.13140/RG.2.2.20913.25446). 3387
61. Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 3388
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 3389
(doi: 10.5281/zenodo.7764916). 3390
SuperHyperGraph By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, 3392
Edge-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 3395
SuperHyperGraph By Edge-Decomposition As Hyper Decompress On Super 3398
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22545.10089). 3399
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) 3401
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 3402
SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 3404
2023, (doi: 10.13140/RG.2.2.11377.76644). 3405
67. Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In 3406
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3407
2023, (doi: 10.13140/RG.2.2.23750.96329). 3408
SuperHyperGraph By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, 3410
Vertex-Neighbor In Cancer’s Recognition With (Neutrosophic) 3413
SuperHyperGraph By Vertex-Decomposition As Hyper Decompress On Super 3416
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 3417
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) 3419
SuperHyperGraph By Vertex-Cut As Hyper Vertu On Super Vertigo”, 3422
73. Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 3424
2023, (doi: 10.13140/RG.2.2.32467.25124). 3426
SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, 3428
75. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3430
Stable-Neighbor In Cancer’s Recognition With (Neutrosophic) 3431
SuperHyperGraph By Stable-Decompositions As Hyper Stain On Super Stagy”, 3434
77. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of 3436
Stable-Decompositions In Cancer’s Recognition With (Neutrosophic) 3437
SuperHyperGraph By Stable-Cut As Hyper Stain On Super Stagy”, 3440
79. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 3442
2023, (doi: 10.13140/RG.2.2.20170.24000). 3444
SuperHyperGraph By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, 3446
81. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3448
Clique-Neighbors In Cancer’s Recognition With (Neutrosophic) 3449
SuperHyperGraph By Clique-Decompositions As Hyper Decompile On Super 3452
Decommission”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18780.87683). 3453
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) 3455
SuperHyperGraph By Clique-Cut As Hyper Click On Super Cliche”, 3458
85. Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 3460
2023, (doi: 10.13140/RG.2.2.27392.30721). 3462
SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 3464
2023, (doi: 10.13140/RG.2.2.33028.40321). 3465
SuperHyperGraph By List- Coloring As Hyper List On Super Lisle”, 3467
88. Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 3469
2023, (doi: 10.13140/RG.2.2.16356.04489). 3471
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 3473
2023, (doi: 10.13140/RG.2.2.21756.21129). 3474
90. Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 3475
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, 3476
(doi: 10.13140/RG.2.2.30983.68009). 3477
SuperHyperGraph By Edge-Connectivity As Hyper Disclosure On Super 3479
Closure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28552.29445). 3480
92. Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of 3481
Edge-Connectivity In Cancer’s Recognition With (Neutrosophic) 3482
SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, 3485
94. Henry Garrett, “New Ideas On Super System By Hyper Explosions Of 3487
Vertex-Connectivity In Cancer’s Recognition With (Neutrosophic) 3488
SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, 3491
96. Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of 3493
Tree-Decomposition In Cancer’s Recognition With (Neutrosophic) 3494
SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, 3497
98. Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 3499
2023, (doi: 10.13140/RG.2.2.11172.14720). 3501
SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On 3503
Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). 3504
100. Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of 3505
SuperHyper(i,j)-Domination In Cancer’s Recognition With (Neutrosophic) 3506
SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On 3509
Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 3510
102. Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of 3511
SuperHyperEdge-Domination In Cancer’s Recognition With (Neutrosophic) 3512
SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super 3515
Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 3516
104. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 3517
SuperHyperK-Domination In Cancer’s Recognition With (Neutrosophic) 3518
SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 3521
Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 3522
106. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 3523
SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 3524
SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 3527
Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 3528
108. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 3529
SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 3530
SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 3533
Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 3534
110. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 3535
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 3536
111. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 3538
SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 3539
SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 3542
Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 3543
113. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 3544
SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 3545
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 3548
Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 3549
115. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 3550
SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 3551
SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 3554
117. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 3556
SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 3557
SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super Infections”, 3560
119. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 3562
SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 3563
120. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 3565
SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 3566
SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, 3569
SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 3572
123. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 3574
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 3575
124. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 3577
Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 3578
125. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3580
SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 3581
Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 3582
126. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3583
SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 3584
Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 3585
127. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 3586
SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 3587
128. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 3589
Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 3590
SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 3591
129. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 3592
Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 3593
SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 3594
130. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3595
SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3596
Hyper Covering Versus Super separations-VI”, ResearchGate 2023, (doi: 3597
10.13140/RG.2.2.29913.80482). 3598
Hyper Covering Versus Super separations-V”, ResearchGate 2023, (doi: 3601
10.13140/RG.2.2.33269.24809). 3602
Hyper Covering Versus Super separations-IV”, ResearchGate 2023, (doi: 3605
10.13140/RG.2.2.34946.96960). 3606
133. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3607
Hyper Covering Versus Super separations-III”, ResearchGate 2023, (doi: 3609
10.13140/RG.2.2.14814.31040). 3610
Hyper Covering Versus Super separations-II”, ResearchGate 2023, (doi: 3613
10.13140/RG.2.2.15653.17125). 3614
Hyper Covering Versus Super separations-I”, ResearchGate 2023, (doi: 3617
10.13140/RG.2.2.25719.50089). 3618
136. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 3619
Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 3620
SuperHyperConnectivities”, ResearchGate 2023, (doi: 3621
10.13140/RG.2.2.29441.94562). 3622
137. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 3623
SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 3624
Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 3625
138. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 3626
the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 3627
On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 3628
139. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 3629
and Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions 3630
of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 3631
140. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 3632
theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 3633
Recognition”, Preprints 2023, 2023010396 (doi: 3634
10.20944/preprints202301.0396.v1). 3635
141. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 3636
neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 3637
Recognition”, Preprints 2023, 2023010395 (doi: 3638
10.20944/preprints202301.0395.v1). 3639
142. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 3640
Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 3641
Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 3642
Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 3643
10.13140/RG.2.2.26240.51204). 3644
143. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 3645
Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 3646
Classes With Hyper Effects In The Background of the Framework is So-Called 3647
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 3648
10.13140/RG.2.2.12818.73925). 3649
144. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 3650
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 3651
Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 3652
10.13140/RG.2.2.26836.88960). 3653
145. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 3654
Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 3655
ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 3656
146. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 3657
Confrontation under Cancer’s Recognition as the Model in The Setting of 3658
10.20944/preprints202301.0308.v1). 3660
147. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 3661
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3662
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3663
2023010282 (doi: 10.20944/preprints202301.0282.v1). 3664
148. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3665
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 3666
(doi: 10.20944/preprints202301.0267.v1).). 3667
149. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3668
Affected Cells Toward The Totality Under Cancer’s Recognition By New 3669
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3670
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3671
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3672
10.20944/preprints202301.0265.v1). 3673
150. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 3674
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3675
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3676
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3677
151. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3678
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3679
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3680
10.20944/preprints202301.0240.v1). 3681
152. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3682
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3683
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3684
10.20944/preprints202301.0224.v1). 3685
153. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 3686
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 3687
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 3688
154. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 3689
The Cancer’s Extreme Recognition With Different Types of Extreme 3690
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 3691
155. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3693
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3694
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3695
2023, (doi: 10.13140/RG.2.2.32530.73922). 3696
156. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 3697
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 3698
SuperHyperClique on Cancer’s Recognition called Neutrosophic 3699
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 3700
157. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3701
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3702
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3703
2023, (doi: 10.13140/RG.2.2.32530.73922). 3704
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3706
2023010105 (doi: 10.20944/preprints202301.0105.v1). 3707
159. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 3708
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 3709
160. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 3711
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 3712
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 3713
10.20944/preprints202301.0105.v1). 3718
10.20944/preprints202301.0088.v1). 3722
163. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 3723
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 3724
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 3725
(doi: 10.13140/RG.2.2.17385.36968). 3726
Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3729
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3731
2023010043 (doi: 10.20944/preprints202301.0043.v1). 3732
166. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 3733
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 3734
In Special ViewPoints”, ResearchGate 2023, (doi: 3738
10.13140/RG.2.2.11447.80803). 3739
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 3741
2023, (doi: 10.13140/RG.2.2.35774.77123). 3742
Neutrosophic Recognition And Beyond”, ResearchGate 2022, (doi: 3745
10.13140/RG.2.2.36141.77287). 3746
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3748
10.13140/RG.2.2.29430.88642). 3749
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3752
10.13140/RG.2.2.11369.16487). 3753
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3755
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3756
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 3758
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3763
2022120540 (doi: 10.20944/preprints202212.0540.v1). 3764
Recognitions And Related (Neutrosophic) SuperHyperClasses”, ResearchGate 3768
2022, (doi: 10.13140/RG.2.2.14426.41923). 3769
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3772
ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 3775
178. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 3776
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3777
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3778
10.20944/preprints202212.0324.v1). 3779
179. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3780
Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside Applications 3781
in Cancer’s Treatments”, ResearchGate 2022 (doi: 3782
10.13140/RG.2.2.23123.04641). 3783
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3786
10.20944/preprints202211.0576.v1). 3787
Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 3790
10.13140/RG.2.2.23324.56966). 3791
182. Henry Garrett, “Basic Neutrosophic Notions Concerning 3792
SuperHyperDominating and Neutrosophic SuperHyperResolving in 3793
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244). 3794
183. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 3795
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 3796
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 3797
10.13140/RG.2.2.25385.88160). 3798
184. Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. 3799
Henry Garrett, 2023 (doi: 10.5281/zenodo.7848019). 3800
185. Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry 3801
Garrett, 2023 (doi: 10.5281/zenodo.7835063). 3802
186. Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry 3803
187. Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. 3805
188. Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 3807
2023 (doi: 10.5281/zenodo.7812750). 3808
189. Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 3809
190. Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. 3811
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 3812
191. Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. 3813
192. Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 3815
193. Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 3817
194. Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 3819
195. Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry 3821
196. Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry 3823
197. Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 3825
2023 (doi: 10.5281/zenodo.7783791). 3826
198. Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3827
2023 (doi: 10.5281/zenodo.7780123). 3828
199. Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry 3829
200. Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 3831
10.5281/zenodo.7637762). 3832
201. Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3833
(doi: 10.5281/zenodo.7766174). 3834
202. Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3835
2023 (doi: 10.5281/zenodo.7762232). 3836
203. Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry 3837
204. Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3839
(doi: 10.5281/zenodo.7754661). 3840
205. Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3841
2023 (doi: 10.5281/zenodo.7750995) . 3842
206. Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry 3843
207. Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3845
(doi: 10.5281/zenodo.7747236). 3846
208. Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 3847
2023 (doi: 10.5281/zenodo.7742587). 3848
209. Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry 3849
210. Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3851
(doi: 10.5281/zenodo.7734719). 3852
211. Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 3853
2023 (doi: 10.5281/zenodo.7730484). 3854
212. Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry 3855
213. Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3857
(doi: 10.5281/zenodo.7722865). 3858
214. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3859
10.5281/zenodo.7713563). 3860
215. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3861
10.5281/zenodo.7709116). 3862
216. Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 3863
2023 (doi: 10.5281/zenodo.7706415). 3864
217. Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 3865
2023 (doi: 10.5281/zenodo.7706063). 3866
218. Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 3867
2023 (doi: 10.5281/zenodo.7701906). 3868
219. Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3869
10.5281/zenodo.7700205). 3870
220. Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 3871
2023 (doi: 10.5281/zenodo.7694876). 3872
221. Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 3873
2023 (doi: 10.5281/zenodo.7679410). 3874
222. Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 3875
2023 (doi: 10.5281/zenodo.7675982). 3876
223. Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3877
(doi: 10.5281/zenodo.7672388). 3878
224. Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3879
10.5281/zenodo.7668648). 3880
225. Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3881
10.5281/zenodo.7662810). 3882
226. Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 3883
(doi: 10.5281/zenodo.7659162). 3884
227. Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 3885
10.5281/zenodo.7653233). 3886
228. Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 3887
10.5281/zenodo.7653204). 3888
229. Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 3889
10.5281/zenodo.7653142). 3890
230. Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 3891
10.5281/zenodo.7653117). 3892
231. Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 3893
10.5281/zenodo.7653089). 3894
232. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 3895
10.5281/zenodo.7651687). 3896
233. Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 3897
10.5281/zenodo.7651619). 3898
234. Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 3899
10.5281/zenodo.7651439). 3900
235. Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 3901
10.5281/zenodo.7650729). 3902
236. Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 3903
10.5281/zenodo.7647868). 3904
237. Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 3905
10.5281/zenodo.7647017). 3906
238. Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 3907
10.5281/zenodo.7644894). 3908
239. Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 3909
10.5281/zenodo.7641880). 3910
240. Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 3911
10.5281/zenodo.7632923). 3912
241. Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 3913
10.5281/zenodo.7623459). 3914
242. Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 3915
2023 (doi: 10.5281/zenodo.7606416). 3916
243. Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 3917
(doi: 10.5281/zenodo.7606416). 3918
244. Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 3919
10.5281/zenodo.7606404). 3920
245. Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 3921
10.5281/zenodo.7580018). 3922
246. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 3923
10.5281/zenodo.7580018). 3924
247. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 3925
10.5281/zenodo.7580018). 3926
248. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 3927
10.5281/zenodo.7579929). 3928
249. Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 3929
10.5281/zenodo.7563170). 3930
250. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 3931
10.5281/zenodo.7563164). 3932
251. Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 3933
10.5281/zenodo.7563160). 3934
252. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 3935
10.5281/zenodo.7563160). 3936
253. Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 3937
10.5281/zenodo.7563160). 3938
254. Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 3939
(doi: 10.5281/zenodo.7557063). 3940
255. Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 3941
10.5281/zenodo.7557009). 3942
256. Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 3943
(doi: 10.5281/zenodo.7539484). 3944
257. Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 3945
2023 (doi: 10.5281/zenodo.7523390). 3946
258. Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 3947
(doi: 10.5281/zenodo.7523390). 3948
259. Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 3949
2023 (doi: 10.5281/zenodo.7523390). 3950
260. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 3951
10.5281/zenodo.7574952). 3952
261. Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 3953
(doi: 10.5281/zenodo.7574992). 3954
262. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 3955
10.5281/zenodo.7523357). 3956
263. Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 3957
10.5281/zenodo.7523357). 3958
264. Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 3959
2023 (doi: 10.5281/zenodo.7504782). 3960
265. Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 3961
(doi: 10.5281/zenodo.7504782). 3962
266. Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 3963
2023 (doi: 10.5281/zenodo.7504782). 3964
267. Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 3965
10.5281/zenodo.7499395). 3966
268. Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 3967
10.5281/zenodo.7499395). 3968
269. Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 3969
10.5281/zenodo.7499395). 3970
270. Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 3971
2023 (doi: 10.5281/zenodo.7497450). 3972
271. Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 3973
(doi: 10.5281/zenodo.7497450). 3974
272. Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 3975
(doi: 10.5281/zenodo.7494862). 3976
273. Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 3977
10.5281/zenodo.7494862). 3978
274. Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 3979
(doi: 10.5281/zenodo.7494862). 3980
275. Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 3981
(doi: 10.5281/zenodo.7493845). 3982
276. Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 3983
10.5281/zenodo.7493845). 3984
277. Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 3985
(doi: 10.5281/zenodo.7493845). 3986
278. Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 3987
10.5281/zenodo.7539484). 3988
279. Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 3989
10.5281/zenodo.7523390). 3990
280. Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 3991
10.5281/zenodo.7523357). 3992
281. Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 3993
10.5281/zenodo.7504782). 3994
282. Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 3995
10.5281/zenodo.7499395). 3996
283. Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 3997
10.5281/zenodo.7497450). 3998
284. Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 3999
10.5281/zenodo.7494862). 4000
285. Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4001
10.5281/zenodo.7493845). 4002
286. Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4003
10.5281/zenodo.7480110). 4004
287. Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 4005
10.5281/zenodo.7378758). 4006
288. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 4007
10.5281/zenodo.6320305). 4008
289. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 4009
10.5281/zenodo.6677173). 4010
View publication stats

New Ideas On Super Nebulous by Hyper Nebbish of Eulerian-Type-Path-Neighbor in Recognition of Cancer With (Neutrosophic) SuperHyperGraph

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 On Super Nebulous by Hyper Nebbish of Eulerian-Type-Path-Neighbor in Recognition of Cancer With (Neutrosophic) SuperHyperGraph

Uploaded by

Copyright:

Available Formats

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

New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path-

Preprint · April 2023

453 PUBLICATIONS 13,324 CITATIONS

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

Featured Articles View project

The user has requested enhancement of the downloaded file.

New Ideas On Super Decompensation By Hyper Decompress 2

Recognition With (Neutrosophic) SuperHyperGraph 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