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

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

Recognition of Cancer With (Neutrosophic) SuperHyperGraph
Preprint · April 2023

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

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

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

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

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

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

A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 3.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [189],Definition 352
2.5,p.2). 353
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 354
pair S = (V, E), where 355
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 356
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 357
1, 2, . . . , n); 358
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 359
V; 360
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 361
1, 2, . . . , n0 ); 362
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 363
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 364
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 365
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n );
0 366
(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 . 367
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 368
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 369
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 370
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 371
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 372
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 373
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 374
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 375
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 376
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 377
Definition 3.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 378
(Ref. [189],Definition 2.7,p.3). 379
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 380
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 381
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 382
characterized as follow-up items. 383
(i) If |Vi | = 1, then Vi is called vertex; 384
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 385
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 386
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 387
HyperEdge; 388
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 389
SuperEdge; 390
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 391
SuperHyperEdge. 392
If we choose different types of binary operations, then we could get hugely diverse 393
types of general forms of Neutrosophic SuperHyperGraph (NSHG). 394
Definition 3.7 (t-norm). (Ref. [189], Definition 2.7, p.3). 395
A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following 396
for x, y, z, w ∈ [0, 1]: 397
(i) 1 ⊗ x = x; 398
(ii) x ⊗ y = y ⊗ x; 399
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 400
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 401
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)). 402
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 403
pair S = (V, E), where 404
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 405
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 406
1, 2, . . . , n); 407
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 408
V; 409
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 410
1, 2, . . . , n0 ); 411
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 412
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 413
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 414
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ).
0 415
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 416
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 417
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 418
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 419
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 420
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 421
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 422
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 423
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 424
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 425
Definition 3.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 426
(Ref. [189],Definition 2.7,p.3). 427
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 428
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 429
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 430
characterized as follow-up items. 431
(i) If |Vi | = 1, then Vi is called vertex; 432
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 433
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 434
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 435
HyperEdge; 436
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 437
SuperEdge; 438
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 439
SuperHyperEdge. 440
This SuperHyperModel is too messy and too dense. Thus there’s a need to have 441
some restrictions and conditions on SuperHyperGraph. The special case of this 442
SuperHyperGraph makes the patterns and regularities. 443
Definition 3.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the 444
number of elements of SuperHyperEdges are the same. 445
To get more visions on SuperHyperUniform, the some SuperHyperClasses are 446
introduced. It makes to have SuperHyperUniform more understandable. 447
Definition 3.13. Assume a Neutrosophic SuperHyperGraph. There are some 448
SuperHyperClasses as follows. 449
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as 450
intersection amid two given SuperHyperEdges with two exceptions; 451
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two 452
given SuperHyperEdges; 453
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 454
SuperHyperEdges; 455
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 456
given SuperHyperEdges and these SuperVertices, forming two separate sets, has 457
no SuperHyperEdge in common; 458
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid 459
two given SuperHyperEdges and these SuperVertices, forming multi separate sets, 460
has no SuperHyperEdge in common; 461
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two 462
given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 463
common SuperVertex. 464
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 465
SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either 466
of following conditions hold: 467
(i) Vi , Vi+1 ∈ Ei0 ; 468
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 469
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 470
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 471
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ Ei0 ; 472
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 473
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 474
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 475
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that 476
0 0
Vi , Vi+1 ∈ Ei0 . 477
Definition 3.15. (Characterization of the Neutrosophic SuperHyperPaths). 478
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. 479
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 480
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 481
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 482
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic 483
SuperHyperPath . 484
Definition 3.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths). 485
(Ref. [189],Definition 5.3,p.7). 486
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 487
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 488
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 489
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 490
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 491
Definition 3.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 492
(NSHE)). (Ref. [189],Definition 5.4,p.7). 493
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 494
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 495
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic 496
t-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 497
(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 498
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic 499
i-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 500
(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic 502
f-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 503
(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of 505
Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 506
SuperHyperVertex (NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj 507
where 1 ≤ i, j ≤ s. 508
Definition 3.18. (Different Neutrosophic Types of Neutrosophic 509
SuperHyperEulerian-Type-Cycle-Cut). 510
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 512
either V 0 or E 0 is called 513
(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 514
called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 515
0
∀E ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 516
called Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut criteria holds 517
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 518
(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 519
called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 520
∀V 0 ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 521
called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 522
∀V 0 ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 523
(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 524
rv-SuperHyperEulerian-Type-Cycle-Cut. 527
Definition 3.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Cut). 528
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 530
(i) an Extreme SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 531
rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 534
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 535
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 536
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 537
SuperHyperEdges and Extreme SuperHyperVertices such that they form the 538
Extreme SuperHyperEulerian-Type-Cycle-Cut; 539
(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 540
rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 543
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 544
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 545
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 546
SuperHyperEulerian-Type-Cycle-Cut; 548
(iii) an Extreme SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s 549
either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 550
re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, 551
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 552
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 553
contains the Extreme coefficients defined as the Extreme number of the maximum 554
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 555
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 556
Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to 558
its Extreme coefficient; 559
(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 560
it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 561
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a 563
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 564
Neutrosophic number of the maximum Neutrosophic cardinality of the 566
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 567
Neutrosophic coefficient; 571
(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 572
rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 575
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 576
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 577
SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 578
Extreme SuperHyperEulerian-Type-Cycle-Cut; 580
(vi) a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of 581
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 585
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 586
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 587
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 588
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; 589
(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 590
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 593
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 594
contains the Extreme coefficients defined as the Extreme number of the maximum 595
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 596
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 597
Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to 599
its Extreme coefficient; 600
(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 601
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 605
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
Neutrosophic number of the maximum Neutrosophic cardinality of the 607
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 608
Neutrosophic coefficient. 612
Definition 3.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Cut). 613
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 614
(i) an δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of Neutrosophic 615
SuperHyperEulerian-Type-Cycle-Cut such that either of the following expressions hold for 616
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 617
|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 618
Expression (3.1), holds if S is an δ−SuperHyperDefensive; 619
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of 620
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut such that either of the following 621
Neutrosophic expressions hold for the Neutrosophic cardinalities of 622
SuperHyperNeighbors of s ∈ S : 623
|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. 624
And the Expression (3.1), holds if S is a Neutrosophic 625
δ−SuperHyperDefensive. 626
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need 627
to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The 628
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 629
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 630
assign to the values. 631
Definition 3.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 632
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) holds. 633
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s 634
more ways to get Neutrosophic type-results to make a Neutrosophic more 635
understandable. 636

perEdges Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition
(3.22)

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.23)
Definition 3.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 637
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 638
holds. Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Cut, 639
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 640
SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutrosophic 641
SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic 642
SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 643
Neutrosophic SuperHyperWheel if the Table (2) holds. 644
It’s useful to define a “Neutrosophic” version of a Neutrosophic 645
SuperHyperEulerian-Type-Cycle-Cut. Since there’s more ways to get type-results to make a 646
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut more Neutrosophicly understandable. 647
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need 648
to “redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”. 649
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 650
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 651
assign to the values. 652
Definition 3.23. Assume a SuperHyperEulerian-Type-Cycle-Cut. It’s redefined a 653
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if the Table (3) holds. 654
4 Extreme SuperHyper But As The

Eulerian-Type-Cycle-Cut 655
Extensions Excerpt From Dense And Super 656
Forms 657
Definition 4.1. (Extreme event). 658
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 659
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Any Extreme k-subset of A of V is called 660
Extreme k-event and if k = 2, then Extreme subset of A of V is called Extreme 661
event. The following expression is called Extreme probability of A. 662
X
E(A) = E(a). (4.1)
a∈A
Definition 4.2. (Extreme Independent). 663
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. s Extreme k-events Ai , i ∈ I is called 665
Extreme s-independent if the following expression is called Extreme 666
s-independent criteria 667
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. 668
The following expression is called Extreme independent criteria 669
E(A ∩ B) = P (A)P (B). (4.2)
Definition 4.3. (Extreme Variable). 670
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Any k-function Eulerian-Type-Cycle-Cut like E 672
is called Extreme k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Cut like E 673
is called Extreme Variable. 674
The notion of independent on Extreme Variable is likewise. 675
Definition 4.4. (Extreme Expectation). 676
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. an Extreme k-Variable E has a number is 678
called Extreme Expectation if the following expression is called Extreme 679
Expectation criteria 680
X
Ex(E) = E(α)P (α).
α∈V
Definition 4.5. (Extreme Crossing). 681
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. an Extreme number is called Extreme 683
Crossing if the following expression is called Extreme Crossing criteria 684
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). 685
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let m and n propose special 686
Eulerian-Type-Cycle-Cut. Then with m ≥ 4n, 687
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme 688
random k-subset of V obtained by choosing each SuperHyperVertex of G Extreme 689
independently with probability Eulerian-Type-Cycle-Cut p := 4n/m, and set H := G[S] and 690
H := G[S]. 691
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: 692
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
693
Theorem 4.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 694
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let P be a SuperHyperSet of n 695
points in the plane, and let l be the Extreme number of SuperHyperLines√ in the plane 696
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 697
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet 698
P whose SuperHyperEdge are the segments between conseNeighborive points on the 699
SuperHyperLines which pass through at least k + 1 points of P. This Extreme 700
SuperHyperGraph has at least kl SuperHyperEdges and Extreme crossing at most l 701
choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or 702
3
l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Extreme Crossing Lemma, and again 703
l < 32n2 /k 3 . 704
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let P be a SuperHyperSet of n 706
points in the plane, and let k be the number of pairs of points of P at unit 707
SuperHyperDistance. Then k < 5n4/3 . 708
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 709
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Draw a SuperHyperUnit 710
SuperHyperCircle around each SuperHyperPoint of P. Let ni be the Extreme number of 711

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

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

= {E4 }.
C(N SHG)Extreme Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Eulerian-Type-Cycle-Cut
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 5 + 2z 3 .
818
straightforward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but 821
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 822
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 823
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no 824
Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 825
SuperHyperVertex, V3 , is excluded in every given Extreme 826
Figure 1. The Extreme SuperHyperGraphs Associated to the Extreme Notions of

Extreme SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (16.3)
SuperHyperEulerian-Type-Cycle-Cut. 827

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

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




= {E4 , E1 , E5 , E4 }.
= 3z 5 + z 3 .
= {V1 , V2 , {N }, {F }, V3 , {H}, V4 , V1 }.
= 2z 4 + 2z 3 + 3z 2 + 5z.
836

= {E1 }.
= z5.
= {Vi=15 }.
= z 7 + 2z 4 + z 3 + z 2 .
840


= {Ei=110 ,Ei=2332 ,E
12 ,E22 }.

= 22z 2 .
= {Vi ∈ VN SHG }.
X
= z |Vi ∈VN SHG | .
844

= {Ei=110 ,E17 ,E14 ,E13 ,E15 }.
= z 5 + z 4 + 12z 2 .
= {Vi ∈ VN SHG }.
X
848




= {E3 }.
= z5.
= {}.
= 2z 6 + 2z 5 + z 4 .
852

= {Ei=110 ,E23 ,E12 ,E22 }.
= z 11 + 12z 2 .
= {Vi ∈ VN SHG }.
X
856


= {E4 , E7 , E6 }.
= 3z 2 .
= {V12 , V13 , V14 }.
= 2z 5 + z 3 .
860

= {E1 , E6 , E5 , E4 , E7 }.
= z 3 + 4z 2 .
= {Vi ∈ VN SHG }.
X



864

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

= {E1 , E10 , E8 , E4 , E2 , E6 }.
= 6z 2 .
= {Vi ∈ VN SHG }.
= 3z 5 + z 4 + 2z 3 .

872

= {E1 }.
= z2.
= {V1 , V3 }.
= 2z 5 .
876

= {E1 }.
= z2.
= {V1 , V5 }.
= 2z 5 .


880

= {E4 }.
= z 10 .
= {Vi=817 }.
X
884

= {E4 }.
= z 10 .
= {Vi=817 }.
X
888




= {E4 }.
= z 10 .
= {Vi=817 }.
X
892

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

896

= {E6 }.
= z |E6 | .
= {VE6 }.
X
= z |VE6 |.
900
(4.4)
901


= {E2 }.
= z |E2 | .
= {VE2 }.
X
= z |VE2 |.
905
(4.6)
906



= {E4 }.
= z |E4 | .
= {VE4 }.
X
= z |VE4 |.
910
(4.8)
911
Proposition 4.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). 912
The all interior Extreme SuperHyperVertices belong to any Extreme 913
quasi-R-Eulerian-Type-Cycle-Cut if for any of them, and any of other corresponded Extreme 914
SuperHyperVertex, some interior Extreme SuperHyperVertices are mutually Extreme 915
SuperHyperNeighbors with no Extreme exception at all minus all Extreme 916
SuperHypeNeighbors to any amount of them. 917
Proposition 4.22. Assume a connected non-obvious Extreme SuperHyperGraph 918
ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only 919
the maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of 920
any given Extreme quasi-R-Eulerian-Type-Cycle-Cut minus all Extreme SuperHypeNeighbor to 921
some of them but not all of them. In other words, there’s only an unique Extreme 922
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Extreme SuperHyperVertices in 923
an Extreme quasi-R-Eulerian-Type-Cycle-Cut, minus all Extreme SuperHypeNeighbor to some of 924
them but not all of them. 925
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-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Cycle-Cut is at 926
least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 927
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 928
words, the maximum number of the Extreme SuperHyperEdges contains the maximum 929
Extreme number of Extreme SuperHyperVertices are renamed to Extreme Eulerian-Type-Cycle-Cut 930
in some cases but the maximum number of the Extreme SuperHyperEdge with the 931
maximum Extreme number of Extreme SuperHyperVertices, has the Extreme 932
SuperHyperVertices are contained in an Extreme R-Eulerian-Type-Cycle-Cut. 933
Proposition 4.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then
the Extreme number of type-result-R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut with the least Extreme cardinality, 934
the lower sharp Extreme bound for cardinality. 935
Proposition 4.25. Assume a connected loopless Extreme SuperHyperGraph 936
ESHG : (V, E). Then in the worst case, literally, 937
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−Cut

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Eulerian-Type-Cycle-Cut. In other words, the least cardinality, the lower 938
sharp bound for the cardinality, of an Extreme type-result-Eulerian-Type-Cycle-Cut is the 939
cardinality of 940

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP 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-Cycle-Cut
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-Cycle-Cut. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut. It’s
the contradiction to that fact on the generality. There are some counterexamples to
deny this statement. One of them comes from the setting of the graph titled path and
cycle as the counterexamples-classes or reversely direction star as the examples-classes,
are well-known classes in that setting and they could be considered as the
examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at 941
least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the 942
principles of the main definition since there’s no condition to be satisfied but the 943
condition is on the existence of the SuperHyperEdge instead of acting on the 944
SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the Extreme 945
SuperHyperSet has the necessary condition for the intended definition to be applied. 946
Thus the V \ V \ {z} is withdrawn not by the conditions of the main definition but by 947
the necessity of the pre-condition on the usage of the main definition. 948
The Extreme structure of the Extreme R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut. 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-Cycle-Cut has the Extreme cardinality of an Extreme SuperHyperEdge. Thus,
an Extreme R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut 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-Cycle-Cut” 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-Cycle-Cut 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-Cycle-Cut for the Extreme SuperHyperGraph as used Extreme 949
background in the Extreme terms of worst Extreme case and the common theme of the 950
lower Extreme bound occurred in the specific Extreme SuperHyperClasses of the 951
Extreme SuperHyperGraphs which are Extreme free-quasi-triangle. 952
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-Cycle-Cut. Those Extreme SuperHyperVertices are potentially included in an
Extreme style-R-Eulerian-Type-Cycle-Cut. 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-Cycle-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut. 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, 953
Extreme R-Eulerian-Type-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
954
Extreme R-Eulerian-Type-Cycle-Cut =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut, 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-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Cycle-Cut is 955
at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 956
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In 957
other words, the maximum number of the Extreme SuperHyperEdges contains the 958
maximum Extreme number of Extreme SuperHyperVertices are renamed to Extreme 959
Eulerian-Type-Cycle-Cut in some cases but the maximum number of the Extreme 960
SuperHyperEdge with the maximum Extreme number of Extreme SuperHyperVertices, 961
has the Extreme SuperHyperVertices are contained in an Extreme R-Eulerian-Type-Cycle-Cut. 962
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the 963
non-obvious Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses 964
some issues about the Extreme optimal SuperHyperObject. It specially delivers some 965
remarks on the Extreme SuperHyperSet of the Extreme SuperHyperVertices such that 966
there’s distinct amount of Extreme SuperHyperEdges for distinct amount of Extreme 967
SuperHyperVertices up to all taken from that Extreme SuperHyperSet of the Extreme 968
SuperHyperVertices but this Extreme SuperHyperSet of the Extreme 969
SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or it 970
doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious 971
SuperHyperModel, there’s at least one Extreme SuperHyperEdge containing at least all 972
Extreme SuperHyperVertices. Thus it forms an Extreme quasi-R-Eulerian-Type-Cycle-Cut 973
where the Extreme completion of the Extreme incidence is up in that. Thus it’s, 974
literarily, an Extreme embedded R-Eulerian-Type-Cycle-Cut. The SuperHyperNotions of 975
embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, 976
these types of SuperHyperSets only don’t satisfy on the maximum 977
SuperHyperCardinality. Thus the embedded setting is elected such that those 978
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re 979
Extreme SuperHyperOptimal. The less than two distinct types of Extreme 980
SuperHyperVertices are included in the minimum Extreme style of the embedded 981
Extreme R-Eulerian-Type-Cycle-Cut. The interior types of the Extreme SuperHyperVertices 982
are deciders. Since the Extreme number of SuperHyperNeighbors are only affected by 983
the interior Extreme SuperHyperVertices. The common connections, more precise and 984
more formal, the perfect unique connections inside the Extreme SuperHyperSet for any 985
distinct types of Extreme SuperHyperVertices pose the Extreme R-Eulerian-Type-Cycle-Cut. 986
Thus Extreme exterior SuperHyperVertices could be used only in one Extreme 987
SuperHyperEdge and in Extreme SuperHyperRelation with the interior Extreme 988
SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 989
Eulerian-Type-Cycle-Cut, there’s the usage of exterior Extreme SuperHyperVertices since 990
they’ve more connections inside more than outside. Thus the title “exterior” is more 991
relevant than the title “interior”. One Extreme SuperHyperVertex has no connection, 992
inside. Thus, the Extreme SuperHyperSet of the Extreme SuperHyperVertices with one 993
SuperHyperElement has been ignored in the exploring to lead on the optimal case 994
implying the Extreme R-Eulerian-Type-Cycle-Cut. The Extreme R-Eulerian-Type-Cycle-Cut with the 995
exclusion of the exclusion of all Extreme SuperHyperVertices in one Extreme 996
SuperHyperEdge and with other terms, the Extreme R-Eulerian-Type-Cycle-Cut with the 997
inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an 998
Extreme quasi-R-Eulerian-Type-Cycle-Cut. To sum them up, in a connected non-obvious 999
Extreme SuperHyperGraph ESHG : (V, E). There’s only one Extreme SuperHyperEdge 1000
E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct interior Extreme 1001
SuperHyperVertices inside of any given Extreme quasi-R-Eulerian-Type-Cycle-Cut minus all 1002
Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 1003
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two 1004
distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Cycle-Cut, minus 1005
all Extreme SuperHypeNeighbor to some of them but not all of them. 1006
The main definition of the Extreme R-Eulerian-Type-Cycle-Cut has two titles. an Extreme 1007
quasi-R-Eulerian-Type-Cycle-Cut and its corresponded quasi-maximum Extreme 1008
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme 1009
number, there’s an Extreme quasi-R-Eulerian-Type-Cycle-Cut with that quasi-maximum 1010
Extreme SuperHyperCardinality in the terms of the embedded Extreme 1011
SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then the 1012
Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme 1013
quasi-R-Eulerian-Type-Cycle-Cuts for all Extreme numbers less than its Extreme corresponded 1014
maximum number. The essence of the Extreme Eulerian-Type-Cycle-Cut ends up but this 1015
essence starts up in the terms of the Extreme quasi-R-Eulerian-Type-Cycle-Cut, again and 1016
more in the operations of collecting all the Extreme quasi-R-Eulerian-Type-Cycle-Cuts acted on 1017
the all possible used formations of the Extreme SuperHyperGraph to achieve one 1018
Extreme number. This Extreme number is 1019
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Cuts. 1020
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Type-Cycle-Cut be an 1021
Extreme number, an Extreme SuperHyperSet and an Extreme Eulerian-Type-Cycle-Cut. Then 1022
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Type-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Type-Cycle-Cut is 1023
re-formalized and redefined as follows. 1024
GExtreme Eulerian-Type-Cycle-Cut ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number
{SExtreme SuperHyperSet |
= zExtreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal 1025
technical definition for the Extreme Eulerian-Type-Cycle-Cut. 1026
GExtreme Eulerian-Type-Cycle-Cut =
{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 1027
Eulerian-Type-Cycle-Cut poses the upcoming expressions. 1028
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 1029
= maxzExtreme Number

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

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


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

1033
= max zExtreme Number

1034

Now, the extension of these types of approaches is up. Since the new term, “Extreme 1035
SuperHyperNeighborhood”, could be redefined as the collection of the Extreme 1036
SuperHyperVertices such that any amount of its Extreme SuperHyperVertices are 1037
incident to an Extreme SuperHyperEdge. It’s, literarily, another name for “Extreme 1038
Quasi-Eulerian-Type-Cycle-Cut” but, precisely, it’s the generalization of “Extreme 1039
Quasi-Eulerian-Type-Cycle-Cut” since “Extreme Quasi-Eulerian-Type-Cycle-Cut” happens “Extreme 1040
Eulerian-Type-Cycle-Cut” in an Extreme SuperHyperGraph as initial framework and 1041
background but “Extreme SuperHyperNeighborhood” may not happens “Extreme 1042
Eulerian-Type-Cycle-Cut” in an Extreme SuperHyperGraph as initial framework and 1043
preliminarily background since there are some ambiguities about the Extreme 1044
SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Extreme 1045
SuperHyperNeighborhood”, “Extreme Quasi-Eulerian-Type-Cycle-Cut”, and “Extreme 1046
Eulerian-Type-Cycle-Cut” are up. 1047
Thus, let 1048
zExtreme Number , NExtreme SuperHyperNeighborhood and 1049
GExtreme Eulerian-Type-Cycle-Cut be an Extreme number, an Extreme 1050
SuperHyperNeighborhood and an Extreme Eulerian-Type-Cycle-Cut and the new terms are up. 1051
GExtreme Eulerian-Type-Cycle-Cut ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
1052
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
1053
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
1054
And with go back to initial structure, 1055
GExtreme Eulerian-Type-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


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

1057
= max zExtreme Number

1058

Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 1059
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Cycle-Cut if for 1060
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 1061
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no 1062
Extreme exception at all minus all Extreme SuperHypeNeighbors to any amount of 1063
them. 1064
To make sense with the precise words in the terms of “R-’, the follow-up illustrations 1065
are coming up. 1066
The following Extreme SuperHyperSet of Extreme SuperHyperVertices is the simple

Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Cut.
The Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Cut. The

Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Eulerian-Type-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph 1067
ESHG : (V, E) is an Extreme type-SuperHyperSet with 1068
the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1069
Extreme SuperHyperVertices such that there’s no an Extreme SuperHyperEdge amid 1070
some Extreme SuperHyperVertices instead of all given by 1071
Extreme Eulerian-Type-Cycle-Cut 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-Cycle-Cut is up. The obvious
simple Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Cut 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-Cycle-Cut 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-Cycle-Cut. 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-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph 1072
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 1073
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices 1074
instead of all given by that Extreme type-SuperHyperSet called the Extreme 1075
Eulerian-Type-Cycle-Cut and it’s an Extreme Eulerian-Type-Cycle-Cut. Since it’s 1076
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-Cycle-Cut. There isn’t only less than
two Extreme SuperHyperVertices inside the intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Eulerian-Type-Cycle-Cut,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme

Eulerian-Type-Cycle-Cut, not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme 1077
SuperHyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded 1078
to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple 1079
Extreme type-SuperHyperSet called the 1080
“Extreme R-Eulerian-Type-Cycle-Cut” 1081
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 1082
Extreme R-Eulerian-Type-Cycle-Cut, 1083
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-Cycle-Cut amid those obvious
simple Extreme type-SuperHyperSets of the Extreme Eulerian-Type-Cycle-Cut, are
In a connected Extreme SuperHyperGraph ESHG : (V, E). 1084
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-Cycle-Cut. In other words, the least cardinality, the lower

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

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph 1139
ESHG : (V, E) is an Extreme type-SuperHyperSet with 1140
Extreme SuperHyperEdges[SuperHyperVertices] such that there’s no Extreme 1142
SuperHyperVertex of an Extreme SuperHyperEdge is common and there’s an Extreme 1143
SuperHyperEdge for all Extreme SuperHyperVertices. There are not only two Extreme 1144
SuperHyperVertices inside the intended Extreme SuperHyperSet. Thus the 1145
non-obvious Extreme Eulerian-Type-Cycle-Cut is up. The obvious simple Extreme 1146
type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Cut is an Extreme 1147
SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 1148
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 1149

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 1150
SuperHyperSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the 1151
Extreme Eulerian-Type-Cycle-Cut is up. To sum them up, the Extreme SuperHyperSet of the 1152
Extreme SuperHyperEdges[SuperHyperVertices], 1153

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 1154
Eulerian-Type-Cycle-Cut. Since the Extreme SuperHyperSet of the Extreme 1155
SuperHyperEdges[SuperHyperVertices], 1156

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph 1157
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 1158
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices 1159
given by that Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Cut and 1160
it’s an Extreme Eulerian-Type-Cycle-Cut. Since it’s 1161
Extreme SuperHyperEdges[SuperHyperVertices] such that there’s no Extreme 1163
SuperHyperVertex of an Extreme SuperHyperEdge is common and there’s an Extreme 1164
SuperHyperEdge for all Extreme SuperHyperVertices. There aren’t only less than three 1165
Extreme SuperHyperVertices inside the intended Extreme SuperHyperSet, 1166

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

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 1168
, not:
Eulerian-Type-Cycle-Cut 1169

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

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 1171
SuperHyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious 1172
simple Extreme type-SuperHyperSet called the 1173
“Extreme Eulerian-Type-Cycle-Cut ” 1174
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 1175
Extreme Eulerian-Type-Cycle-Cut , 1176
is only and only 1177

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

= {Ei }|Ei |=maxEj ∈EN SHG |Ej | .
i
{Ei }|E |=max
Ej ∈EN SHG j |E |
=z
= {V{Ei }|Ei |=maxE |Ej |
}.
j ∈EN SHG

X |{V{Ei }|E |=max }|
i Ej ∈EN SHG |Ej |
= z .
Proof. Let 1184
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
1185
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
Figure 23. an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut in the Example (16.5)
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). 1186
There’s a new way to redefine as 1187
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 1188
corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The 1189
latter is straightforward. 1190
Example 5.2. In the Figure (23), the connected Extreme SuperHyperPath 1191
ESHP : (V, E), is highlighted and featured. The Extreme SuperHyperSet, in the 1192
Extreme SuperHyperModel (23), is the SuperHyperEulerian-Type-Cycle-Cut. 1193
Proposition 5.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). 1194
Then 1195

|E |
= {Ei }i=1N SHG .
X
= z |Ei | .
Ei ∈EN SHG
|V
N SHG |
= {Vi }i=1 .
X
= z |Vi | .
Vi ∈VN SHG
Proof. Let 1196
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
1197
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). 1198

Example 5.4. In the Figure (24), the connected Extreme SuperHyperCycle 1203
N SHC : (V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in 1204
the Extreme SuperHyperModel (24), is the Extreme SuperHyperEulerian-Type-Cycle-Cut. 1205
Proposition 5.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 1206

= {Ei }|Ei |=maxEj ∈EN SHG |Ej | .
{Ei }|Ei |=maxE |Ej |
=z j ∈EN SHG

= {V{Ei }|Ei |=maxE |Ej |
}.
j ∈EN SHG

X |{V{Ei }|E |=max }|
i Ej ∈EN SHG |Ej |
= z .
Proof. Let 1207
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
1208
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
Figure 24. an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (16.7)
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s 1209
a new way to redefine as 1210

Example 5.6. In the Figure (25), the connected Extreme SuperHyperStar 1214
ESHS : (V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, by 1215
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the 1216
connected Extreme SuperHyperStar ESHS : (V, E), in the Extreme SuperHyperModel 1217
(25), is the Extreme SuperHyperEulerian-Type-Cycle-Cut. 1218
Proposition 5.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). 1219
Figure 25. an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (16.9)
Then 1220

= {Ei , Ej }Ei ∩Ej 6=∅ .
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

= {Vi , Vj }Vi ∈PNr SHG ,Vj ∈PNs SHG ,r6=s .
X
= z |Vi | .
{Vi ,Vj }Vi ∈P r ,Vj ∈P s ,r6=s
N SHG N SHG
Proof. Let 1221
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
1222
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). 1223

latter is straightforward. Then there’s no at least one SuperHyperEulerian-Type-Cycle-Cut. 1227
Thus the notion of quasi may be up but the SuperHyperNotions based on 1228
SuperHyperEulerian-Type-Cycle-Cut could be applied. There are only two SuperHyperParts. 1229
Thus every SuperHyperPart could have one SuperHyperVertex as the representative in 1230
the 1231
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Extreme 1232
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 1233
minimum-Extreme-of-SuperHyperPart SuperHyperEdges are attained in any solution 1234
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 1235
Example 5.8. In the Extreme Figure (26), the connected Extreme 1236
SuperHyperBipartite ESHB : (V, E), is Extreme highlighted and Extreme featured. 1237
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 1238
result, of the Extreme SuperHyperVertices of the connected Extreme 1239
SuperHyperBipartite ESHB : (V, E), in the Extreme SuperHyperModel (26), is the 1240
Extreme SuperHyperEulerian-Type-Cycle-Cut. 1241
Proposition 5.9. Assume a connected Extreme SuperHyperMultipartite 1242
ESHM : (V, E). Then 1243

= {Ei , Ej }Ei ∩Ej 6=∅ .
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

= {Vi , Vj }Vi ∈PNr SHG ,Vj ∈PNs SHG ,r6=s .
X
= z |Vi | .
{Vi ,Vj }Vi ∈P r ,Vj ∈P s ,r6=s
N SHG N SHG
Figure 26. Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions

of Extreme SuperHyperEulerian-Type-Cycle-Cut in the Example (16.11)
Proof. Let 1244
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
1245
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 1247

latter is straightforward. Then there’s no at least one SuperHyperEulerian-Type-Cycle-Cut. 1250
Thus the notion of quasi may be up but the SuperHyperNotions based on 1251
SuperHyperEulerian-Type-Cycle-Cut could be applied. There are only z 0 SuperHyperParts. 1252
Thus every SuperHyperPart could have one SuperHyperVertex as the representative in 1253
Figure 27. an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut in the Example (16.13)
the 1254
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite 1255
ESHM : (V, E). Thus only some SuperHyperVertices and only 1256
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
ESHM : (V, E). The latter is straightforward. 1259
Example 5.10. In the Figure (27), the connected Extreme SuperHyperMultipartite 1260
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme 1261
SuperHyperSet, by the Algorithm in previous Extreme result, of the Extreme 1262
SuperHyperVertices of the connected Extreme SuperHyperMultipartite ESHM : (V, E), 1263
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperEulerian-Type-Cycle-Cut. 1264
Proposition 5.11. Assume a connected Extreme SuperHyperWheel 1265
ESHW : (V, E ∪ E ∗ ). Then, 1266

|E |
= {Ei }i=1N SHG .
X
= z |Ei | .
Ei ∈EN SHG
|V
N SHG |
= {Vi }i=1 .
X
= z |Vi | .
Vi ∈VN SHG
Proof. Let 1267
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
1268
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 1270

latter is straightforward. Then there’s at least one SuperHyperEulerian-Type-Cycle-Cut. Thus 1273
the notion of quasi isn’t up and the SuperHyperNotions based on 1274
SuperHyperEulerian-Type-Cycle-Cut could be applied. The unique embedded 1275
SuperHyperEulerian-Type-Cycle-Cut proposes some longest SuperHyperEulerian-Type-Cycle-Cut 1276
excerpt from some representatives. The latter is straightforward. 1277
Example 5.12. In the Extreme Figure (28), the connected Extreme SuperHyperWheel 1278
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme 1279
SuperHyperSet, by the Algorithm in previous result, of the Extreme 1280
SuperHyperVertices of the connected Extreme SuperHyperWheel ESHW : (V, E), in 1281
the Extreme SuperHyperModel (28), is the Extreme SuperHyperEulerian-Type-Cycle-Cut. 1282
6 The Surveys of Mathematical Sets On The 1283
Results But As The Initial Motivation 1284
For the SuperHyperEulerian-Type-Cycle-Cut, Extreme SuperHyperEulerian-Type-Cycle-Cut, and the 1285
Extreme SuperHyperEulerian-Type-Cycle-Cut, some general results are introduced. 1286
Figure 28. an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions

of Extreme SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (16.15)
Remark 6.1. Let remind that the Extreme SuperHyperEulerian-Type-Cycle-Cut is “redefined” 1287
on the positions of the alphabets. 1288
Corollary 6.2. Assume Extreme SuperHyperEulerian-Type-Cycle-Cut. Then 1289
Extreme SuperHyperEulerian − T ype − Cycle − Cut =

{theSuperHyperEulerian − T ype − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − Cycle − Cut
|ExtremecardinalityamidthoseSuperHyperEulerian−T ype−Cycle−Cut. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 1290
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 1291
indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 1292
Corollary 6.3. Assume an Extreme SuperHyperGraph on the same identical letter of 1293
the alphabet. Then the notion of Extreme SuperHyperEulerian-Type-Cycle-Cut and 1294
SuperHyperEulerian-Type-Cycle-Cut coincide. 1295
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an 1297
Extreme SuperHyperEulerian-Type-Cycle-Cut if and only if it’s a SuperHyperEulerian-Type-Cycle-Cut. 1298
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 1300
SuperHyperEulerian-Type-Cycle-Cut if and only if it’s a longest SuperHyperEulerian-Type-Cycle-Cut. 1301
Corollary 6.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the 1302
same identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Cycle-Cut is its 1303
SuperHyperEulerian-Type-Cycle-Cut and reversely. 1304
Corollary 6.7. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, 1305
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on 1306
the same identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Cycle-Cut is 1307
its SuperHyperEulerian-Type-Cycle-Cut and reversely. 1308
Corollary 6.8. Assume an Extreme SuperHyperGraph. Then its Extreme 1309
SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut 1310
isn’t well-defined. 1311
Corollary 6.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 1312
Extreme SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its 1313
SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined. 1314
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1316
Then its Extreme SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its 1317
SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined. 1318
Corollary 6.11. Assume an Extreme SuperHyperGraph. Then its Extreme 1319
SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut is 1320
well-defined. 1321
Corollary 6.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 1322
its Extreme SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its 1323
SuperHyperEulerian-Type-Cycle-Cut is well-defined. 1324
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1326
Then its Extreme SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its 1327
SuperHyperEulerian-Type-Cycle-Cut is well-defined. 1328
Proposition 6.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 1329
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1330
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1331
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1332
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1333
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1334
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1335
Proposition 6.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 1336
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1337
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1338
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1339
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1340
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1341
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1342
Proposition 6.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 1343
independent SuperHyperSet is 1344
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1345
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1346
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1347
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1348
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1349
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1350
Proposition 6.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform 1351
SuperHyperGraph which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then V is a 1352
maximal 1353
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1354
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1355
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1356
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1357
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1358
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1359
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1360
Proposition 6.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 1361
SuperHyperUniform SuperHyperWheel. Then V is a maximal 1362
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1363
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1364
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1365
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1366
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1367
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1368
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1369
SuperHyperGraph which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then the 1371
number of 1372
(i) : the SuperHyperEulerian-Type-Cycle-Cut; 1373
(ii) : the SuperHyperEulerian-Type-Cycle-Cut; 1374
(iii) : the connected SuperHyperEulerian-Type-Cycle-Cut; 1375
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1376
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1377
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut. 1378
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1379
SuperHyperVertices coincide. 1380
SuperHyperGraph which is a SuperHyperWheel. Then the number of 1382
(i) : the dual SuperHyperEulerian-Type-Cycle-Cut; 1383
(ii) : the dual SuperHyperEulerian-Type-Cycle-Cut; 1384
(iii) : the dual connected SuperHyperEulerian-Type-Cycle-Cut; 1385
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1386
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1387
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut. 1388
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1389
SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1392
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1393
SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 1394
number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 1395
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1399
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1400
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1401
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1404
SuperHyperSet contains the half of multiplying r with the number of all the 1405
SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1406
is a 1407
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1411
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1412
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1413
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 1416
number of 1417
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1421
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1422
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1423
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 1424
multiplying r with the number of all the SuperHyperEdges plus one of all the 1425
SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 1426
Proposition 6.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number 1428
of connected component is |V − S| if there’s a SuperHyperSet which is a dual 1429
(iv) : SuperHyperEulerian-Type-Cycle-Cut; 1433
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1434
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1435
Proposition 6.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the 1436
number is at most O(ESHG) and the Extreme number is at most On (ESHG). 1437
Proposition 6.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 1438
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 1439
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1440
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1444
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1446
Proposition 6.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. 1447
The number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the 1448
setting of dual 1449
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1453
(v) : strong 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1454
(vi) : connected 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1455
SuperHyperComplete. Then there’s no independent SuperHyperSet. 1457
SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is 1459
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 1460
dual 1461
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1465
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1466
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1467
SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 1469
number is O(ESHG:(V,E))
2 + 1 and the Extreme number is 1470
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of a dual 1471
t>
2
(iv) : ( O(ESHG:(V,E))
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1477
Proposition 6.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1478
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is 1479
obtained for the individuals. Then the results also hold for the SuperHyperFamily 1480
N SHF : (V, E) of these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 1481
Proposition 6.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is 1482
a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such 1483
that 1484
(i) v ∈ Ns (x); 1485
(ii) vx ∈ E. 1486
Proposition 6.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is 1487
a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then 1488
(i) S is SuperHyperEulerian-Type-Cycle-Cut set; 1489
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1490
Proposition 6.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 1491
(i) Γ ≤ O; 1492
(ii) Γs ≤ On . 1493
Proposition 6.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 1494
connected. Then 1495
(i) Γ ≤ O − 1; 1496
(ii) Γs ≤ On − Σ3i=1 σi (x). 1497
Proposition 6.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1498
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1499
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1501
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1502
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only 1503
a dual SuperHyperEulerian-Type-Cycle-Cut. 1504
Proposition 6.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1505
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive 1506
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and 1508
{v1 , v3 , · · · .vn−1 }; 1509
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1510
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only 1511
dual SuperHyperEulerian-Type-Cycle-Cut. 1512
Proposition 6.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Cycle-Cut. Then 1513
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive 1514
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and 1516
{v1 , v3 , · · · , vn−1 }; 1517
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1518
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only 1519
Proposition 6.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Cycle-Cut. Then 1521
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1522
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1524
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1525
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only 1526
Proposition 6.40. Let ESHG : (V, E) be SuperHyperStar. Then 1528
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Cycle-Cut; 1529
(ii) Γ = 1; 1530
(iii) Γs = Σ3i=1 σi (c); 1531
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Cycle-Cut. 1532
Proposition 6.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1533
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual 1534
maximal SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1535
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1536
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1537
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual 1538
maximal SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1539
Proposition 6.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1540
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1541
(ii) Γ = b n2 c + 1; 1543
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 1544
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual SuperHyperDefensive 1545
Proposition 6.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1547
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive 1548
(ii) Γ = b n2 c; 1550

bnc ; 1551
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 1552
Proposition 6.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme 1554
SuperHyperStars with common Extreme SuperHyperVertex SuperHyperSet. Then 1555
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive 1556
SuperHyperEulerian-Type-Cycle-Cut for N SHF; 1557
(ii) Γ = m for N SHF : (V, E); 1558
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1559
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual 1560
SuperHyperEulerian-Type-Cycle-Cut for N SHF : (V, E). 1561
Proposition 6.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd 1562
SuperHyperComplete SuperHyperGraphs with common Extreme SuperHyperVertex 1563
SuperHyperSet. Then 1564
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 1565
SuperHyperEulerian-Type-Cycle-Cut for N SHF; 1566
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1567

b n c+1 for N SHF : (V, E); 1568
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal 1569
SuperHyperEulerian-Type-Cycle-Cut for N SHF : (V, E). 1570
Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1571
SuperHyperComplete SuperHyperGraphs with common Extreme SuperHyperVertex 1572
SuperHyperSet. Then 1573
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1574
SuperHyperEulerian-Type-Cycle-Cut for N SHF : (V, E); 1575
(ii) Γ = b n2 c for N SHF : (V, E); 1576

bnc for N SHF : (V, E); 1577
S={vi }i=1
bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperEulerian-Type-Cycle-Cut 1578
for N SHF : (V, E). 1579
following statements hold; 1581
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an 1582
t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is an 1583
s-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1584
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1585
t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is a dual 1586
s-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1587
following statements hold; 1589
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an 1590
t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is an 1591
s-SuperHyperPowerful SuperHyperEulerian-Type-Cycle-Cut; 1592
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1593
t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is a dual 1594
s-SuperHyperPowerful SuperHyperEulerian-Type-Cycle-Cut. 1595
Proposition 6.49. Let ESHG : (V, E) be a[an] 1596
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph. Then following statements 1597
hold; 1598
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 1599
2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1600
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 1601
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 1603
(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 1605
V-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1606
Proposition 6.50. Let ESHG : (V, E) is a[an] 1607
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph. Then following statements 1608
hold; 1609
(i) ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1610
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 1612
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 1614
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 1616
V-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1617
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is a 1619
SuperHyperComplete. Then following statements hold; 1620
(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1621
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

2 c + 1 if ESHG : (V, E) is a dual 1623
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 1625
(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1628
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is a 1630
SuperHyperComplete. Then following statements hold; 1631
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1

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

2 c + 1, then ESHG : (V, E) is a dual 1634
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1636
(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1637
(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1639
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is 1641
SuperHyperEulerian-Type-Cycle-Cut. Then following statements hold; 1642
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 1643
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1645
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 1647
2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1650
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is 1652
SuperHyperEulerian-Type-Cycle-Cut. Then following statements hold; 1653
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 1654
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1656
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 1658
2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1661
7 Extreme Applications in Cancer’s Extreme 1662
Recognition 1663
The cancer is the Extreme disease but the Extreme model is going to figure out what’s 1664
going on this Extreme phenomenon. The special Extreme case of this Extreme disease 1665
is considered and as the consequences of the model, some parameters are used. The cells 1666
are under attack of this disease but the moves of the cancer in the special region are the 1667
matter of mind. The Extreme recognition of the cancer could help to find some 1668
Extreme treatments for this Extreme disease. 1669
In the following, some Extreme steps are Extreme devised on this disease. 1670
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the 1671
long-term Extreme function. 1672
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme 1673
model [it’s called Extreme SuperHyperGraph] and the long Extreme cycle of the 1674
move from the cancer is identified by this research. Sometimes the move of the 1675
cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1676
and neutrality about the moves and the effects of the cancer on that region; this 1677
event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] 1678
to have convenient perception on what’s happened and what’s done. 1679
Step 3. (Extreme Model) There are some specific Extreme models, which are 1680
well-known and they’ve got the names, and some general Extreme models. The 1681
moves and the Extreme traces of the cancer on the complex tracks and between 1682
complicated groups of cells could be fantasized by an Extreme 1683
SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, 1684
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 1685
find either the Extreme SuperHyperEulerian-Type-Cycle-Cut or the Extreme 1686
SuperHyperEulerian-Type-Cycle-Cut in those Extreme Extreme SuperHyperModels. 1687
Figure 29. an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut
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 1688
Extreme SuperHyperBipartite as Extreme 1689
SuperHyperModel 1690
Step 4. (Extreme Solution) In the Extreme Figure (29), the Extreme 1691
SuperHyperBipartite is Extreme highlighted and Extreme featured. 1692
By using the Extreme Figure (29) and the Table (4), the Extreme 1693
SuperHyperBipartite is obtained. 1694
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous 1695
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme 1696
SuperHyperBipartite ESHB : (V, E), in the Extreme SuperHyperModel (29), is 1697
the Extreme SuperHyperEulerian-Type-Cycle-Cut. 1698
9 Case 2: The Increasing Extreme Steps Toward 1699
Extreme SuperHyperMultipartite as Extreme 1700
SuperHyperModel 1701
Step 4. (Extreme Solution) In the Extreme Figure (30), the Extreme 1702
SuperHyperMultipartite is Extreme highlighted and Extreme featured. 1703
Figure 30. an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

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


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). 1912
Then 1913
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 1914
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 1918
Extreme SuperHyperModel (23), is the SuperHyperDuality. 1922
Then 1924
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 1925
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

the Extreme SuperHyperModel (24), is the Extreme SuperHyperDuality. 1933
Proposition 12.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). 1934
Then 1935
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 1936
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

(25), is the Extreme SuperHyperDuality. 1946
Proposition 12.10. Assume a connected Extreme SuperHyperBipartite 1947
ESHB : (V, E). Then 1948
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 1949
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 1954
isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 1955
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 1956
SuperHyperVertex as the representative in the 1957
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite 1958
ESHB : (V, E). Thus only some SuperHyperVertices and only 1959
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperDuality. 1967

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

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1977
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 SuperHyperDuality. 1988
Proposition 12.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). 1989
Then, 1990
∗ ∗
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 1991
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 1992
ESHW : (V, E). There’s a new way to redefine as 1993

∃!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 1998
excerpt from some representatives. The latter is straightforward. 1999
SuperHyperWheel N SHW : (V, E), is Extreme highlighted and featured. The obtained 2001
Extreme SuperHyperSet, by the Algorithm in previous result, of the Extreme 2002
the Extreme SuperHyperModel (28), is the Extreme SuperHyperDuality. 2004
13 Extreme SuperHyperJoin But As The 2005
Forms 2007
Definition 13.1. (Different Extreme Types of Extreme SuperHyperJoin). 2008
(i) Extreme e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 2012
Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2013
(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 2014
Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2015
(iii) Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2017
Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2018
(iv) Extreme rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2019
Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2020
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 2022
re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 2023
Definition 13.2. ((Extreme) SuperHyperJoin). 2024
(i) an Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2027
Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 2028
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 2029
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 2030
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in 2031
the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 2032
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 2033
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2034
rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph 2036
such that they form the Extreme SuperHyperJoin; 2040
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2041
Extreme e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme 2042
v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and C(N SHG) for an 2043
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2049
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2051
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2061
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 2065
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 2066
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 2067
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 2068
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2072
such that they form the Extreme SuperHyperJoin; 2074
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 2075
(viii) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2085
SuperHyperJoin, is up. The Extreme Algorithm is Extremely straightforward. E1 2098
and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2099
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperJoin. 2104
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. 2106
every given Extreme SuperHyperJoin. 2112


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 2156
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 2157
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2161
Extreme SuperHyperModel (23), is the SuperHyperJoin. 2165
Then 2167

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

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

the Extreme SuperHyperModel (24), is the Extreme SuperHyperJoin. 2176
Then 2178
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 2179

(25), is the Extreme SuperHyperJoin. 2189
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 2192
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 2197
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2198
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2199
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite 2201
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperJoin. 2210

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

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 z 0 SuperHyperParts. Thus every SuperHyperPart could have one 2220
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. 2231
Then, 2233

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

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

straightforward. Then there’s at least one SuperHyperJoin. Thus the notion of quasi 2239
isn’t up and the SuperHyperNotions based on SuperHyperJoin could be applied. The 2240
unique embedded SuperHyperJoin proposes some longest SuperHyperJoin excerpt from 2241
some representatives. The latter is straightforward. 2242
the Extreme SuperHyperModel (28), is the Extreme SuperHyperJoin. 2247
14 Extreme SuperHyperPerfect But As The 2248
Forms 2250
Definition 14.1. (Different Extreme Types of Extreme SuperHyperPerfect). 2251
(i) Extreme e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 2255
that Va ∈ Ei , Ej ; 2256
(ii) Extreme re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 2257
that Va ∈ Ei , Ej ; and 2258
(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such 2260
that Vi , Vj ∈ Ea ; 2261
(iv) Extreme rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such 2262
that Vi , Vj ∈ Ea ; and 2263
(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 2265
Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme 2266
rv-SuperHyperPerfect. 2267
Definition 14.2. ((Extreme) SuperHyperPerfect). 2268
(i) an Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 2271
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 2273
Extreme SuperHyperVertices such that they form the Extreme 2277
SuperHyperPerfect; 2278
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 2279
rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 2281
such that they form the Extreme SuperHyperPerfect; 2285
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2286
Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2287
v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an 2288
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2294
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2296
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme 2306
e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2307
Extreme SuperHyperPerfect; 2313
(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme 2314
e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2315
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 2318
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 2320
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 2321
of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 2322
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2331
SuperHyperPerfect, is up. The Extreme Algorithm is Extremely straightforward. 2344
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 2350
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. 2358


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 2402
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 2403
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2407
Extreme SuperHyperModel (23), is the SuperHyperPerfect. 2411
Then 2413
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 2414
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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

(25), is the Extreme SuperHyperPerfect. 2435
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 2438
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 2443
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2444
applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2445
one SuperHyperVertex as the representative in the 2446
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite 2447
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperPerfect. 2456

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
is a longest SuperHyperPerfect taken from a connected Extreme 2460

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 z 0 SuperHyperParts. Thus every SuperHyperPart could have 2466
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. 2477
Then, 2479
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

straightforward. Then there’s at least one SuperHyperPerfect. Thus the notion of quasi 2485
isn’t up and the SuperHyperNotions based on SuperHyperPerfect could be applied. The 2486
unique embedded SuperHyperPerfect proposes some longest SuperHyperPerfect excerpt 2487
from some representatives. The latter is straightforward. 2488
the Extreme SuperHyperModel (28), is the Extreme SuperHyperPerfect. 2493
15 Extreme SuperHyperTotal But As The 2494
Forms 2496
Definition 15.1. (Different Extreme Types of Extreme SuperHyperTotal). 2497
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 2501
Va ∈ Ei , Ej ; 2502
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 2503
Va ∈ Ei , Ej ; and 2504
(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 2506
Vi , Vj ∈ Ea ; 2507
(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 2508
Vi , Vj ∈ Ea ; and 2509
(v) Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2511
Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme 2512
rv-SuperHyperTotal. 2513
Definition 15.2. ((Extreme) SuperHyperTotal). 2514
(i) an Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2517
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 2519
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2523
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2524
rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph 2526
such that they form the Extreme SuperHyperTotal; 2530
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2531
Extreme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme 2532
v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and C(N SHG) for an 2533
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2539
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2541
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2551
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 2555
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 2556
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2557
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2558
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2562
such that they form the Extreme SuperHyperTotal; 2564
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2565
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2575
SuperHyperTotal, is up. The Extreme Algorithm is Extremely straightforward. 2588
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperTotal. 2594
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. 2602


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 2646
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 2647
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2651
Extreme SuperHyperModel (23), is the SuperHyperTotal. 2655
Then 2657
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 2658
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. 2666
Then 2668
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 2669
P : ViEXT ERN AL , Ei , CEN T ER, Ej .


(25), is the Extreme SuperHyperTotal. 2679
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 2682
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

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 2703
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 2704
ESHM : (V, E). There’s a new way to redefine as 2705

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
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperTotal. 2721
Then, 2723
∗
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 2724
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel 2725

straightforward. Then there’s at least one SuperHyperTotal. Thus the notion of quasi 2729
isn’t up and the SuperHyperNotions based on SuperHyperTotal could be applied. The 2730
unique embedded SuperHyperTotal proposes some longest SuperHyperTotal excerpt 2731
from some representatives. The latter is straightforward. 2732
the Extreme SuperHyperModel (28), is the Extreme SuperHyperTotal. 2737
16 Extreme SuperHyperConnected But As The 2738
Forms 2740
Definition 16.1. (Different Extreme Types of Extreme SuperHyperConnected). 2741
(i) Extreme e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2745
such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2746
(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2747
such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2748
(iii) Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , 2750
such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2751
(iv) Extreme rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , 2752
such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2753
(v) Extreme SuperHyperConnected if it’s either of Extreme 2755
e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2756
v-SuperHyperConnected, and Extreme rv-SuperHyperConnected. 2757
Definition 16.2. ((Extreme) SuperHyperConnected). 2758
(i) an Extreme SuperHyperConnected if it’s either of Extreme 2761
v-SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) 2763
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2764
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 2765
Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 2766
Extreme SuperHyperConnected; 2768
(ii) a Extreme SuperHyperConnected if it’s either of Extreme 2769
for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2772
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 2773
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 2774
SuperHyperConnected; 2776
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2777
of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2778
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2780
the Extreme SuperHyperConnected; and the Extreme power is corresponded to its 2785
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 2787
Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2788
(v) an Extreme R-SuperHyperConnected if it’s either of Extreme 2797
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 2801
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 2802
the Extreme SuperHyperConnected; 2804
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme 2805
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 2809
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 2810
SuperHyperConnected; 2812
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s 2813
either of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, 2814
Extreme v-SuperHyperConnected, and Extreme rv-SuperHyperConnected and 2815
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2816
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 2823
Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2824
SuperHyperConnected, is up. The Extreme Algorithm is Extremely 2836
straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is 2837
a loop Extreme SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in 2838
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme 2839
SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme 2840
isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2841
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2842
Extreme SuperHyperConnected. 2843
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 2846
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2847
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 2848
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no 2849
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 2851


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 2915
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 2916
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 2920
Extreme SuperHyperModel (23), is the SuperHyperConnected. 2924
Then 2926
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 2927
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 2930
the Extreme SuperHyperModel (24), is the Extreme SuperHyperConnected. 2935
Then 2937
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 2938
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

(25), is the Extreme SuperHyperConnected. 2948
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 2951
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 2956
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 2957
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme 2960
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2961
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
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
is a longest SuperHyperConnected taken from a connected Extreme 2973

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
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperConnected. 2990
Then, 2992
∗
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 2993
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 2994

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

New Ideas On Super Nebulous by Hyper Nebbish of Eulerian-Type-Cycle-Cut 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-Cycle-Cut 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-Cycle-Cut In

Preprint · April 2023

465 PUBLICATIONS 15,122 CITATIONS

Number Graphs And Numbers View project

On Combinatorics View project

The user has requested enhancement of the downloaded file.

New Ideas On Super Nebulous By Hyper Nebbish Of 2

Eulerian-Type-Cycle-Cut In Recognition of Cancer With 3

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-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is 10

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 35

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

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

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

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

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

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

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 42

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 43

such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; an Extreme 44

SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 45

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 46

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 47

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 48

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

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

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 52

corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 54

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, 55

Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 56

v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and 57

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 58

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 59

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 60

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 61

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 62