0175 - Article#175

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/369020072
New Ideas On Super Gap By Hyper Navigations Of Chord In Cancer's Recognition

With (Neutrosophic) SuperHyperGraph
Preprint · March 2023

DOI: 10.13140/RG.2.2.11172.14720
CITATIONS
1 author:
Henry Garrett
345 PUBLICATIONS 4,781 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Combinatorics View project
Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project
All content following this page was uploaded by Henry Garrett on 05 March 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 Gap By Hyper Navigations Of Chord In 2
Cancer’s Recognition With (Neutrosophic) 3
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
SuperHyperChord). Assume a Neutrosophic SuperHyperGraph (NSHG) S is an Chord 10
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 11
E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperChord 12

0
if there’s a SuperHyperCycle OCHC such that ∃a, b ∈ VOCHC , ab 6∈ EOCHC , 13
0
ab ∈ EN SHG \ EOCHC ; Neutrosophic re-SuperHyperChord if there’s a SuperHyperCycle 14
0 0
OCHC such that ∃a, b ∈ VOCHC , ab 6∈ EOCHC , ab ∈ EN SHG \ EOCHC ; and 15
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 16
v-SuperHyperChord if there’s a SuperHyperCycle OCHC such that ∃a, b ∈ VOCHC , 17

0 0
ab 6∈ EOCHC , ab ∈ EN SHG \ EOCHC ; Neutrosophic rv-SuperHyperChord if there’s a 18
0
SuperHyperCycle OCHC such that ∃a, b ∈ VOCHC , ab 6∈ EOCHC , 19
0
ab ∈ EN SHG \ EOCHC ; and 20
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 21
SuperHyperChord if it’s either of Neutrosophic e-SuperHyperChord, Neutrosophic 22
re-SuperHyperChord, Neutrosophic v-SuperHyperChord, and Neutrosophic 23
rv-SuperHyperChord. ((Neutrosophic) SuperHyperChord). Assume a Neutrosophic 24
SuperHyperGraph (NSHG) S is an Chorded pair S = (V, E). Consider a Neutrosophic 25
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 26
SuperHyperChord if it’s either of Neutrosophic e-SuperHyperChord, Neutrosophic 27
re-SuperHyperChord, Neutrosophic v-SuperHyperChord, and Neutrosophic 28
rv-SuperHyperChord and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 29
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 30
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 31
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 32
Extreme SuperHyperChord; a Neutrosophic SuperHyperChord if it’s either of 33
Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, Neutrosophic 34
v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for a 35
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 36
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 37
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 38
Neutrosophic SuperHyperVertices such that they form the Neutrosophic 39
SuperHyperChord; an Extreme SuperHyperChord SuperHyperPolynomial if it’s either 40
of Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, Neutrosophic 41
v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for an 42
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 43
contains the Extreme coefficients defined as the Extreme number of the maximum 44
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 45
of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 46
SuperHyperVertices such that they form the Extreme SuperHyperChord; and the 47
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 48
SuperHyperChord SuperHyperPolynomial if it’s either of Neutrosophic 49
e-SuperHyperChord, Neutrosophic re-SuperHyperChord, Neutrosophic 50
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 52
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 53
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 54
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 55
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 56
that they form the Neutrosophic SuperHyperChord; and the Neutrosophic power is 57
corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperChord if it’s 58
either of Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, 59
Neutrosophic v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and 60
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 61
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 62
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 63
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperChord; 64
a Neutrosophic V-SuperHyperChord if it’s either of Neutrosophic e-SuperHyperChord, 65
Neutrosophic re-SuperHyperChord, Neutrosophic v-SuperHyperChord, and 66
Neutrosophic rv-SuperHyperChord and C(N SHG) for a Neutrosophic 67
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 68
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 69
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 70
SuperHyperVertices such that they form the Neutrosophic SuperHyperChord; an 71
Extreme V-SuperHyperChord SuperHyperPolynomial if it’s either of Neutrosophic 72
v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for an 74
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 75
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 77
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 78
SuperHyperVertices such that they form the Extreme SuperHyperChord; and the 79
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 80
SuperHyperChord SuperHyperPolynomial if it’s either of Neutrosophic 81
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 84
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 85
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 86
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 87
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 88
SuperHyperVertices such that they form the Neutrosophic SuperHyperChord; and the 89
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific 90
research, new setting is introduced for new SuperHyperNotions, namely, a 91
SuperHyperChord and Neutrosophic SuperHyperChord. Two different types of 92
SuperHyperDefinitions are debut for them but the research goes further and the 93
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are 94
well-defined and well-reviewed. The literature review is implemented in the whole of 95
this research. For shining the elegancy and the significancy of this research, the 96
comparison between this SuperHyperNotion with other SuperHyperNotions and 97
fundamental SuperHyperNumbers are featured. The definitions are followed by the 98
examples and the instances thus the clarifications are driven with different tools. The 99
applications are figured out to make sense about the theoretical aspect of this ongoing 100
research. The “Cancer’s Recognition” are the under research to figure out the 101
challenges make sense about ongoing and upcoming research. The special case is up. 102
The cells are viewed in the deemed ways. There are different types of them. Some of 103
them are individuals and some of them are well-modeled by the group of cells. These 104
types are all officially called “SuperHyperVertex” but the relations amid them all 105
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 106
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 107
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 108
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are 109
posed to pursue this research. It’s also officially collected in the form of some questions 110
and some problems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then 111
δ−SuperHyperChord is a maximal of SuperHyperVertices with a maximum 112
cardinality such that either of the following expressions hold for the (Neutrosophic) 113
cardinalities of SuperHyperNeighbors of s ∈ S : there are 114
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 115
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 116
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperChord is a maximal 117
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 118
that either of the following expressions hold for the Neutrosophic cardinalities of 119
SuperHyperNeighbors of s ∈ S there are: 120
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 121
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, 122
holds if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds 123
if S is a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” 124
version of a SuperHyperChord . Since there’s more ways to get type-results to make a 125
SuperHyperChord more understandable. For the sake of having Neutrosophic 126
SuperHyperChord, there’s a need to “redefine” the notion of a “SuperHyperChord ”. 127
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 128
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 129
assign to the values. Assume a SuperHyperChord . It’s redefined a Neutrosophic 130
SuperHyperChord if the mentioned Table holds, concerning, “The Values of Vertices, 131
SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 132
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 133
of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of 134
Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The 135
Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 136
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 137
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 138
based on a SuperHyperChord . It’s the main. It’ll be disciplinary to have the 139
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 140
have all SuperHyperChord until the SuperHyperChord, then it’s officially called a 141
“SuperHyperChord” but otherwise, it isn’t a SuperHyperChord . There are some 142
instances about the clarifications for the main definition titled a “SuperHyperChord ”. 143
These two examples get more scrutiny and discernment since there are characterized in 144
the disciplinary ways of the SuperHyperClass based on a SuperHyperChord . For the 145
sake of having a Neutrosophic SuperHyperChord, there’s a need to “redefine” the 146
notion of a “Neutrosophic SuperHyperChord” and a “Neutrosophic SuperHyperChord ”. 147
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 148
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 150
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperChord 151
are redefined to a “Neutrosophic SuperHyperChord” if the intended Table holds. It’s 152
useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 153
to get Neutrosophic type-results to make a Neutrosophic SuperHyperChord more 154
understandable. Assume a Neutrosophic SuperHyperGraph. There are some 155
Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 156
SuperHyperChord, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, 157
and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 158
SuperHyperChord”, “Neutrosophic SuperHyperStar”, “Neutrosophic 159
SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 160
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 161
“Neutrosophic SuperHyperChord” where it’s the strongest [the maximum Neutrosophic 162
value from all the SuperHyperChord amid the maximum value amid all 163
SuperHyperVertices from a SuperHyperChord .] SuperHyperChord . A graph is a 164
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 165
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are 166
some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 167
intersection amid two given SuperHyperEdges with two exceptions; it’s 168
SuperHyperChord if it’s only one SuperVertex as intersection amid two given 169
SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid 170
all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 171
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, 172
has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one 173
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 174
forming multi separate sets, has no SuperHyperEdge in common; it’s a 175
SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 176
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 177
SuperVertex. The SuperHyperModel proposes the specific designs and the specific 178
architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 179
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and 180
“specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the 181
common and intended properties between “specific” cells and “specific group” of cells 182
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 183
degrees of determinacy, indeterminacy, and neutrality to have more precise 184
SuperHyperModel which in this case the SuperHyperModel is called “Neutrosophic”. In 185
the future research, the foundation will be based on the “Cancer’s Recognition” and the 186
results and the definitions will be introduced in redeemed ways. The recognition of the 187
cancer in the long-term function. The specific region has been assigned by the model 188
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 189
identified by this research. Sometimes the move of the cancer hasn’t be easily identified 190
since there are some determinacy, indeterminacy and neutrality about the moves and 191
the effects of the cancer on that region; this event leads us to choose another model [it’s 192
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s 193
happened and what’s done. There are some specific models, which are well-known and 194
they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 195
and the traces of the cancer on the complex tracks and between complicated groups of 196
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperChord, 197
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 198
The aim is to find either the longest SuperHyperChord or the strongest 199
SuperHyperChord in those Neutrosophic SuperHyperModels. For the longest 200
SuperHyperChord, called SuperHyperChord, and the strongest SuperHyperChord, 201
called Neutrosophic SuperHyperChord, some general results are introduced. Beyond 202
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 203
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form 204
any style of a SuperHyperChord. There isn’t any formation of any SuperHyperChord 205
but literarily, it’s the deformation of any SuperHyperChord. It, literarily, deforms and it 206
doesn’t form. A basic familiarity with Neutrosophic SuperHyperChord theory, 207
SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 208
Keywords: Neutrosophic SuperHyperGraph, SuperHyperChord, Cancer’s 209
Neutrosophic Recognition 210
AMS Subject Classification: 05C17, 05C22, 05E45 211
2 Applied Notions Under The Scrutiny Of The 212
Motivation Of This Scientific Research 213
In this scientific research, there are some ideas in the featured frameworks of 214
motivations. I try to bring the motivations in the narrative ways. Some cells have been 215
faced with some attacks from the situation which is caused by the cancer’s attacks. In 216
this case, there are some embedded analysis on the ongoing situations which in that, the 217
cells could be labelled as some groups and some groups or individuals have excessive 218
labels which all are raised from the behaviors to overcome the cancer’s attacks. In the 219
embedded situations, the individuals of cells and the groups of cells could be considered 220
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting 221
more proper analysis on this messy story. I’ve found the SuperHyperModels which are 222
officially called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this 223
SuperHyperModel, the cells and the groups of cells are defined as “SuperHyperVertices” 224
and the relations between the individuals of cells and the groups of cells are defined as 225
“SuperHyperEdges”. Thus it’s another motivation for us to do research on this 226
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get 227
worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 228
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy 229
and neutrality, for any object based on vague forms, namely, incomplete data, imprecise 230
data, and uncertain analysis. The latter model could be considered on the previous 231
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 232
called “Extreme SuperHyperGraphs”. The cancer is the disease but the model is going 233
to figure out what’s going on this phenomenon. The special case of this disease is 234
considered and as the consequences of the model, some parameters are used. The cells 235
are under attack of this disease but the moves of the cancer in the special region are the 236
matter of mind. The recognition of the cancer could help to find some treatments for 237
this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 238
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background 239
of this research. Sometimes the cancer has been happened on the region, full of cells, 240
groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 241
some SuperHyperNotions based on the connectivities of the moves of the cancer in the 242
forms of alliances’ styles with the formation of the design and the architecture are 243
formally called “ SuperHyperChord” in the themes of jargons and buzzwords. The prefix 244
“SuperHyper” refers to the theme of the embedded styles to figure out the background 245
for the SuperHyperNotions. The recognition of the cancer in the long-term function. 246
The specific region has been assigned by the model [it’s called SuperHyperGraph] and 247
the long cycle of the move from the cancer is identified by this research. Sometimes the 248
move of the cancer hasn’t be easily identified since there are some determinacy, 249
indeterminacy and neutrality about the moves and the effects of the cancer on that 250
region; this event leads us to choose another model [it’s said to be Extreme 251
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. 252
There are some specific models, which are well-known and they’ve got the names, and 253
some general models. The moves and the traces of the cancer on the complex tracks and 254
between complicated groups of cells could be fantasized by a Extreme SuperHyperPath 255
(-/SuperHyperChord, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 256
SuperHyperWheel). The aim is to find either the optimal SuperHyperChord or the 257
Extreme SuperHyperChord in those Extreme SuperHyperModels. Some general results 258
are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath 259
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 260
three SuperHyperEdges to form any style of a SuperHyperChord. There isn’t any 261
formation of any SuperHyperChord but literarily, it’s the deformation of any 262
SuperHyperChord. It, literarily, deforms and it doesn’t form. 263
Question 2.1. How to define the SuperHyperNotions and to do research on them to 264
find the “ amount of SuperHyperChord” of either individual of cells or the groups of 265
cells based on the fixed cell or the fixed group of cells, extensively, the “amount of 266
SuperHyperChord” based on the fixed groups of cells or the fixed groups of group of cells? 267
Question 2.2. What are the best descriptions for the “Cancer’s Recognition” in terms 268
of these messy and dense SuperHyperModels where embedded notions are illustrated? 269
It’s motivation to find notions to use in this dense model is titled 270
“SuperHyperGraphs”. Thus it motivates us to define different types of “ 271
SuperHyperChord” and “Extreme SuperHyperChord” on “SuperHyperGraph” and 272
“Extreme SuperHyperGraph”. Then the research has taken more motivations to define 273
SuperHyperClasses and to find some connections amid this SuperHyperNotion with 274
other SuperHyperNotions. It motivates us to get some instances and examples to make 275
clarifications about the framework of this research. The general results and some results 276
about some connections are some avenues to make key point of this research, “Cancer’s 277
Recognition”, more understandable and more clear. 278
The framework of this research is as follows. In the beginning, I introduce basic 279
definitions to clarify about preliminaries. In the subsection “Preliminaries”, initial 280
definitions about SuperHyperGraphs and Extreme SuperHyperGraph are 281
deeply-introduced and in-depth-discussed. The elementary concepts are clarified and 282
illustrated completely and sometimes review literature are applied to make sense about 283
what’s going to figure out about the upcoming sections. The main definitions and their 284
clarifications alongside some results about new notions, SuperHyperChord and Extreme 285
SuperHyperChord, are figured out in sections “ SuperHyperChord” and “Extreme 286
SuperHyperChord”. In the sense of tackling on getting results and in Chord to make 287
sense about continuing the research, the ideas of SuperHyperUniform and Extreme 288
SuperHyperUniform are introduced and as their consequences, corresponded 289
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results 290
on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As going back to 291
origin of the notions, there are some smart steps toward the common notions to extend 292
the new notions in new frameworks, SuperHyperGraph and Extreme SuperHyperGraph, 293
in the sections “Results on SuperHyperClasses” and “Results on Extreme 294
SuperHyperClasses”. The starter research about the general SuperHyperRelations and 295
as concluding and closing section of theoretical research are contained in the section 296
“General Results”. Some general SuperHyperRelations are fundamental and they are 297
well-known as fundamental SuperHyperNotions as elicited and discussed in the sections, 298
“General Results”, “ SuperHyperChord”, “Extreme SuperHyperChord”, “Results on 299
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious 300
questions about what’s done about the SuperHyperNotions to make sense about 301
excellency of this research and going to figure out the word “best” as the description 302
and adjective for this research as presented in section, “ SuperHyperChord”. The 303
keyword of this research debut in the section “Applications in Cancer’s Recognition” 304
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite 305
as SuperHyperModel” and “Case 2: The Increasing Steps Toward 306
SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 307
are some scrutiny and discernment on what’s done and what’s happened in this research 308
in the terms of “questions” and “problems” to make sense to figure out this research in 309
featured style. The advantages and the limitations of this research alongside about 310
what’s done in this research to make sense and to get sense about what’s figured out are 311
included in the section, “Conclusion and Closing Remarks”. 312
3 Extreme Preliminaries Of This Scientific 313
Research On the Redeemed Ways 314
In this section, the basic material in this scientific research, is referred to [Single Valued 315
Neutrosophic Set](Ref. [107],Definition 2.2,p.2), [Neutrosophic 316
Set](Ref. [107],Definition 2.1,p.1), [Neutrosophic SuperHyperGraph 317
(NSHG)](Ref. [107],Definition 2.5,p.2), [Characterization of the Neutrosophic 318
SuperHyperGraph (NSHG)](Ref. [107],Definition 2.7,p.3), [t-norm](Ref. [107], 319
Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyperGraph 320
(NSHG)](Ref. [107],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 321
SuperHyperPaths] (Ref. [107],Definition 5.3,p.7), and [Different Neutrosophic Types of 322
Neutrosophic SuperHyperEdges (NSHE)] (Ref. [107],Definition 5.4,p.7). Also, the new 323
ideas and their clarifications are addressed to Ref. [107]. 324
In this subsection, the basic material which is used in this scientific research, is 325
presented. Also, the new ideas and their clarifications are elicited. 326
Definition 3.1 (Neutrosophic Set). (Ref. [107],Definition 2.1,p.1). 327
Let X be a space 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 328
+
]− 0, 1 [. 329
Definition 3.2 (Single Valued Neutrosophic Set). (Ref. [107],Definition 2.2,p.2). 330
Let X be a space 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. [107],Definition 331
2.5,p.2). 332
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is an 333
Chorded pair S = (V, E), where 334
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 335
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 336
1, 2, . . . , n); 337
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 338
V; 339
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 340
1, 2, . . . , n0 ); 341
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 342
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 343
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 344
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n );
0 345
(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 . 346
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 347
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 348
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 349
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 350
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 351
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 352
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 353
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 354
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 355
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 356
Definition 3.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 357
(Ref. [107],Definition 2.7,p.3). 358
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an Chorded pair 359
S = (V, E). The Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic 360
SuperHyperVertices (NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) 361
could be characterized as follow-up items. 362
(i) If |Vi | = 1, then Vi is called vertex; 363
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 364
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 365
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 366
HyperEdge; 367
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 368
SuperEdge; 369
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 370
SuperHyperEdge. 371
If we choose different types of binary operations, then we could get hugely diverse 372
types of general forms of Neutrosophic SuperHyperGraph (NSHG). 373
Definition 3.7 (t-norm). (Ref. [107], Definition 2.7, p.3). 374
A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following 375
for x, y, z, w ∈ [0, 1]: 376
(i) 1 ⊗ x = x; 377
(ii) x ⊗ y = y ⊗ x; 378
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 379
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 380
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)). 381
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is an 382
Chorded pair S = (V, E), where 383
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 384
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 385
1, 2, . . . , n); 386
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 387
V; 388
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 389
1, 2, . . . , n0 ); 390
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 391
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 392
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 393
supp(Ei0 ) = V, (i0 = 1, 2, . . . , n0 ).
P
(viii) i0 394
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 395
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 396
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 397
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 398
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 399
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 400
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 401
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 402
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 403
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 404
Definition 3.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 405
(Ref. [107],Definition 2.7,p.3). 406
S = (V, E). The Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic 408
SuperHyperVertices (NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) 409
(i) If |Vi | = 1, then Vi is called vertex; 411
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 412
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 413
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 414
HyperEdge; 415
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 416
SuperEdge; 417
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 418
SuperHyperEdge. 419
This SuperHyperModel is too messy and too dense. Thus there’s a need to have 420
some restrictions and conditions on SuperHyperGraph. The special case of this 421
SuperHyperGraph makes the patterns and regularities. 422
Definition 3.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the 423
number of elements of SuperHyperEdges are the same. 424
To get more visions on SuperHyperUniform, the some SuperHyperClasses are 425
introduced. It makes to have SuperHyperUniform more understandable. 426
Definition 3.13. Assume a Neutrosophic SuperHyperGraph. There are some 427
SuperHyperClasses as follows. 428
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as 429
intersection amid two given SuperHyperEdges with two exceptions; 430
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two 431
given SuperHyperEdges; 432
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 433
SuperHyperEdges; 434
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 435
given SuperHyperEdges and these SuperVertices, forming two separate sets, has 436
no SuperHyperEdge in common; 437
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid 438
two given SuperHyperEdges and these SuperVertices, forming multi separate sets, 439
has no SuperHyperEdge in common; 440
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two 441
given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 442
common SuperVertex. 443
Definition 3.14. Let an Chorded 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 444
SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either 445
of following conditions hold: 446
(i) Vi , Vi+1 ∈ Ei0 ; 447
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 448
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 449
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 450
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ Ei0 ; 451
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 452
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 453
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 454
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that 455
0 0
Vi , Vi+1 ∈ Ei0 . 456
Definition 3.15. (Characterization of the Neutrosophic SuperHyperPaths). 457
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an Chorded 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 ,
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 459
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 460
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 461
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic 462
SuperHyperPath . 463
Definition 3.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths). 464
(Ref. [107],Definition 5.3,p.7). 465
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an Chorded 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 466
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 467
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 468
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 469
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 470
Definition 3.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 471
(NSHE)). (Ref. [107],Definition 5.4,p.7). 472
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 474
Then E is called 475
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic 476
t-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 477
(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 478
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic 479
i-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 480
(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic 482
f-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 483
(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of 485
Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 486
SuperHyperVertex (NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj 487
where 1 ≤ i, j ≤ s. 488
Definition 3.18. (Different Neutrosophic Types of Neutrosophic SuperHyperChord). 489
S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 491
E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 492
(i) Neutrosophic e-SuperHyperChord if there’s a SuperHyperCycle OCHC 493

0 0
such that ∃a, b ∈ VOCHC , ab 6∈ EOCHC , ab ∈ EN SHG \ EOCHC ; 494
(ii) Neutrosophic re-SuperHyperChord if there’s a SuperHyperCycle OCHC 495

0 0
such that ∃a, b ∈ VOCHC , ab 6∈ EOCHC , ab ∈ EN SHG \ EOCHC ; and 496
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 497
(iii) Neutrosophic v-SuperHyperChord if there’s a SuperHyperCycle OCHC 498

0 0
such that ∃a, b ∈ VOCHC , ab 6∈ EOCHC , ab ∈ EN SHG \ EOCHC ; 499
(iv) Neutrosophic rv-SuperHyperChord if there’s a SuperHyperCycle OCHC 500

0 0
such that ∃a, b ∈ VOCHC , ab 6∈ EOCHC , ab ∈ EN SHG \ EOCHC ; and 501
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 502
(v) Neutrosophic SuperHyperChord if it’s either of Neutrosophic 503
v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord. 505
Definition 3.19. ((Neutrosophic) SuperHyperChord). 506
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 508
Then E is called 509
(i) an Extreme SuperHyperChord if it’s either of Neutrosophic 510
v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for 512
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 513
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 514
Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 515
SuperHyperEdges and Extreme SuperHyperVertices such that they form the 516
Extreme SuperHyperChord; 517
(ii) a Neutrosophic SuperHyperChord if it’s either of Neutrosophic 518
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 522
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 523
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 524
Neutrosophic SuperHyperChord; 525
(iii) an Extreme SuperHyperChord SuperHyperPolynomial if it’s either of 526
Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, 527
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 529
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 530
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 531
an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 532
Extreme SuperHyperChord; and the Extreme power is corresponded to its 534
Extreme coefficient; 535
(iv) a Neutrosophic SuperHyperChord SuperHyperPolynomial if it’s either 536
of Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, 537
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 539
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 540
defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 541
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 542
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 543
SuperHyperChord; and the Neutrosophic power is corresponded to its 545
Neutrosophic coefficient; 546
(v) an Extreme V-SuperHyperChord if it’s either of Neutrosophic 547
v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for 549
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 550
Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 552
Extreme SuperHyperChord; 554
(vi) a Neutrosophic V-SuperHyperChord if it’s either of Neutrosophic 555
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 559
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 560
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 561
Neutrosophic SuperHyperChord; 562
(vii) an Extreme V-SuperHyperChord SuperHyperPolynomial if it’s either of 563
Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, 564
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 568
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 569
Extreme SuperHyperChord; and the Extreme power is corresponded to its 571
(viii) a Neutrosophic SuperHyperChord SuperHyperPolynomial if it’s either 573
of Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, 574
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 576
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 577
defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 578
the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 579
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 580
SuperHyperChord; and the Neutrosophic power is corresponded to its 582
Neutrosophic coefficient. 583
Definition 3.20. ((Extreme/Neutrosophic)δ−SuperHyperChord). 584
S = (V, E). Then 586
(i) an δ−SuperHyperChord is a Neutrosophic kind of Neutrosophic 587
SuperHyperChord such that either of the following expressions hold for the 588
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 589
|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 590
Expression (3.1), holds if S is an δ−SuperHyperDefensive; 591
(ii) a Neutrosophic δ−SuperHyperChord is a Neutrosophic kind of Neutrosophic 592
SuperHyperChord such that either of the following Neutrosophic expressions hold 593
Table 1. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy-

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

perEdges Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition
(3.22)
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 594
|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. 595
And the Expression (3.1), holds if S is a Neutrosophic 596
δ−SuperHyperDefensive. 597
For the sake of having a Neutrosophic SuperHyperChord, there’s a need to 598
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices 599
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. 600
In this procedure, there’s the usage of the position of labels to assign to the values. 601
Definition 3.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an Chorded 602
pair S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) 603
holds. 604
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s 605
more ways to get Neutrosophic type-results to make a Neutrosophic more 606
understandable. 607
Definition 3.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an Chorded 608
pair S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 609
holds. Thus Neutrosophic SuperHyperPath , SuperHyperChord, SuperHyperStar, 610
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 611
Neutrosophic SuperHyperPath, Neutrosophic SuperHyperCycle, 612
Neutrosophic SuperHyperStar, Neutrosophic SuperHyperBipartite, 613
Neutrosophic SuperHyperMultiPartite, and Neutrosophic 614
SuperHyperWheel if the Table (2) holds. 615
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperChord. 616
Since there’s more ways to get type-results to make a Neutrosophic SuperHyperChord 617
more Neutrosophicly understandable. 618
For the sake of having a Neutrosophic SuperHyperChord, there’s a need to 619
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperChord”. The 620

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.23)
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 621
assign to the values. 623
Definition 3.23. Assume a SuperHyperChord. It’s redefined a Neutrosophic 624
SuperHyperChord if the Table (3) holds. 625
4 Extreme SuperHyperChord But As The 626
Extensions Excerpt From Dense And Super 627
Forms 628
Example 4.1. Assume a Extreme SuperHyperGraph (NSHG) S is an Chorded pair 629
S = (V, E) in the mentioned Extreme Figures in every Extreme items. 630
• On the Figure (1), the Extreme SuperHyperNotion, namely, Extreme 631
SuperHyperChord, is up. The Extreme Algorithm is Extremely straightforward. 632
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 633
SuperHyperEdge and E4 is a Extreme SuperHyperEdge. Thus in the terms of 634
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 635
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no 636
Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme 637
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperChord. 638
C(N SHG)Extreme Chord = {E4 }.

C(N SHG)Extreme Chord SuperHyperPolynomial = z.
C(N SHG)Extreme V-Chord = {Vi }i6=2,3 .
C(N SHG)Extreme V-Chord SuperHyperPolynomial = z 2 .
639
E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is a Extreme 642
SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 643
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 644
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a 645
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every 646
given Extreme SuperHyperChord. 647

C(N SHG)Extreme V-Chord = {Vi }i6=3 .
Figure 1. The Extreme SuperHyperGraphs Associated to the Extreme Notions of

Extreme SuperHyperChord in the Extreme Example (16.3)
648

C(N SHG)Extreme V-Chord = {Vi }i=1,2,3 .
651

C(N SHG)Extreme Chord SuperHyperPolynomial = 8z.
C(N SHG)Extreme V-Chord = {V3 , V4 }.
C(N SHG)Extreme V-Chord SuperHyperPolynomial
= 2z 2 .
654
C(N SHG)Extreme Chord = {}.

C(N SHG)Extreme Chord SuperHyperPolynomial = 0.
C(N SHG)Extreme V-Chord = {}.
C(N SHG)Extreme V-Chord SuperHyperPolynomial = 0.
657





C(N SHG)Extreme Chord

= {Ei }22
i=12 .
C(N SHG)Extreme Chord SuperHyperPolynomial
= z 11 .
C(N SHG)Extreme V-Chord
= {Vi , Vi+10 , V21 , V22 }10
i=1 .
= z 22 .
660
C(N SHG)Extreme Chord =

{E17 }.
= az b .
C(N SHG)Extreme V-Chord =
{V8 , V10 }.
= az b .
663


{}.
= 0.
{}.
= 0.
666

= {Ei }22
i=12 .
= z 11 .
= {Vi , Vj+10 , V21 , V22 }10
i=1 .
= z 22 .
669




{E4 , E6 , E7 }.
= 3z.
{V12 , V13 }.
= 3z 2 .
672

{E1 , E3 }.
= z2.
C(N SHG)Extreme V-Chord = {V1 , V6 }.
= 3 × 3z 2 .
675


C(N SHG)Extreme Chord SuperHyperPolynomial = 0z 0 .
= {}.
C(N SHG)Extreme V-Chord SuperHyperPolynomial =
= 0z 0 .
678

{}.
= 0z 0 .
= 0z 0 .
681




C(N SHG)Extreme V-Chord SuperHyperPolynomial = 0z 0 .
684

687


690

= {}.
= 0z 0 .
693

= {}.
= 0z 0 .
696




= {}.
= 0z 0 .
= 0z 0 .
699

= {}.
= 0z 0 .
= {}.
= 0z 0 .
702




= {}.
= 0z 0 .
= {}.
= 0z 0 .
705


= {}.
= 0z 0 .
= {}.
= 0z 0 .
708
5 The Extreme Departures on The Theoretical 709
Results Toward Theoretical Motivations 710
The previous Extreme approach apply on the upcoming Extreme results on Extreme 711
SuperHyperClasses. 712
Proposition 5.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 713

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 714
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
715
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). 716
There’s a new way to redefine as 717
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 718
corresponded to ViEXT ERN AL in the literatures of SuperHyperChord. The latter is 719
straightforward. 720
Example 5.2. In the Figure (23), the connected Extreme SuperHyperPath 721
ESHP : (V, E), is highlighted and featured. The Extreme SuperHyperSet, in the 722
Extreme SuperHyperModel (23), is the SuperHyperChord. 723
Proposition 5.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). 724
Then 725

= {}.
= 0z 0
= {}.
= 0z 0
Figure 23. a Extreme SuperHyperPath Associated to the Notions of Extreme Super-

HyperChord in the Example (16.5)
Proof. Let 726
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
727
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). 728

Example 5.4. In the Figure (24), the connected Extreme SuperHyperCycle 733
N SHC : (V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in 734
the Extreme SuperHyperModel (24), is the Extreme SuperHyperChord. 735
Figure 24. a Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme

SuperHyperChord in the Extreme Example (16.7)
Proposition 5.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 736

= z0.
= {}.
= 0z 0 .
Proof. Let 737
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
738
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s 739
a new way to redefine as 740

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

SuperHyperChord in the Extreme Example (16.9)
Example 5.6. In the Figure (25), the connected Extreme SuperHyperStar 744
ESHS : (V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, by 745
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the 746
connected Extreme SuperHyperStar ESHS : (V, E), in the Extreme SuperHyperModel 747
(25), is the Extreme SuperHyperChord. 748
Proposition 5.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). 749
Then 750

= {Ei , Ej Ei ∈Pi , Ej ∈Pj , i6=j }.
= (|{Pi | |Pi | = min |Pj |}|)z |Pi |=minPj ∈EN SHG |Pj | .
Pj ∈EN SHG

= {V EXT ERN AL , V EXT ERN AL V EXT ERN AL ∈Pi , VjEXT ERN AL ∈Pj , i6=j }.

Pj ∈EN SHG
Proof. Let 751
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
752
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). 753

straightforward. Then there’s no at least one SuperHyperChord. Thus the notion of 757
quasi may be up but the SuperHyperNotions based on SuperHyperChord could be 758
applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 759
one SuperHyperVertex as the representative in the 760
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperChord taken from a connected Extreme SuperHyperBipartite 761
ESHB : (V, E). Thus only some SuperHyperVertices and only 762
minimum-Extreme-of-SuperHyperPart SuperHyperEdges are attained in any solution 763
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 764
Example 5.8. In the Extreme Figure (26), the connected Extreme 765
SuperHyperBipartite ESHB : (V, E), is Extreme highlighted and Extreme featured. 766
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 767
result, of the Extreme SuperHyperVertices of the connected Extreme 768
SuperHyperBipartite ESHB : (V, E), in the Extreme SuperHyperModel (26), is the 769
Extreme SuperHyperChord. 770
Proposition 5.9. Assume a connected Extreme SuperHyperMultipartite 771
Figure 26. Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions

of Extreme SuperHyperChord in the Example (16.11)
ESHM : (V, E). Then 772

= {Ei , Ej Ei ∈Pi , Ej ∈Pj , i6=j }.
Pj ∈EN SHG

= {V EXT ERN AL , V EXT ERN AL V EXT ERN AL ∈Pi , VjEXT ERN AL ∈Pj , i6=j }.

Pj ∈EN SHG
Proof. Let 773
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
774
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 SuperHyperChord taken from a connected Extreme SuperHyperMultipartite 775
ESHM : (V, E). There’s a new way to redefine as 776

straightforward. Then there’s no at least one SuperHyperChord. Thus the notion of 779
quasi may be up but the SuperHyperNotions based on SuperHyperChord could be 780
applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 781
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite 783
ESHM : (V, E). Thus only some SuperHyperVertices and only 784
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
ESHM : (V, E). The latter is straightforward. 787
Example 5.10. In the Figure (27), the connected Extreme SuperHyperMultipartite 788
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme 789
SuperHyperSet, by the Algorithm in previous Extreme result, of the Extreme 790
SuperHyperVertices of the connected Extreme SuperHyperMultipartite ESHM : (V, E), 791
in the Extreme SuperHyperModel (27), is the Extreme SuperHyperChord. 792
Proposition 5.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). 793
Then, 794
|E ∗ |
C(N SHG)Extreme Chord = {Ei∗ }i=1N SHG .
∗
= z |EN SHG | .
|E ∗ |
= {V EXT ERN AL ∈ Ei∗ }i=1N SHG .
∗
= z 2×|EN SHG | .
Proof. Let 795
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
Figure 27. a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperChord in the Example (16.13)
796
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperChord taken from a connected Extreme SuperHyperWheel 797
ESHW : (V, E). There’s a new way to redefine as 798

straightforward. Then there’s at least one SuperHyperChord. Thus the notion of quasi 801
isn’t up and the SuperHyperNotions based on SuperHyperChord could be applied. The 802
unique embedded SuperHyperChord proposes some longest SuperHyperChord excerpt 803
from some representatives. The latter is straightforward. 804
Example 5.12. In the Extreme Figure (28), the connected Extreme SuperHyperWheel 805
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme 806
SuperHyperSet, by the Algorithm in previous result, of the Extreme 807
SuperHyperVertices of the connected Extreme SuperHyperWheel ESHW : (V, E), in 808
the Extreme SuperHyperModel (28), is the Extreme SuperHyperChord. 809
6 The Surveys of Mathematical Sets On The 810
Results But As The Initial Motivation 811
For the SuperHyperChord, Extreme SuperHyperChord, and the Extreme 812
SuperHyperChord, some general results are introduced. 813
Figure 28. a Extreme SuperHyperWheel Extreme Associated to the Extreme Notions

of Extreme SuperHyperChord in the Extreme Example (16.15)
Remark 6.1. Let remind that the Extreme SuperHyperChord is “redefined” on the 814
positions of the alphabets. 815
Corollary 6.2. Assume Extreme SuperHyperChord. Then 816
Extreme SuperHyperChord =
{theSuperHyperChordof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperChord
|ExtremecardinalityamidthoseSuperHyperChord. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 817
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 818
indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 819
Corollary 6.3. Assume a Extreme SuperHyperGraph on the same identical letter of the 820
alphabet. Then the notion of Extreme SuperHyperChord and SuperHyperChord coincide. 821
Corollary 6.4. Assume a Extreme SuperHyperGraph on the same identical letter of 822
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Extreme 823
SuperHyperChord if and only if it’s a SuperHyperChord. 824
Corollary 6.5. Assume a Extreme SuperHyperGraph on the same identical letter of 825
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 826
SuperHyperChord if and only if it’s a longest SuperHyperChord. 827
Corollary 6.6. Assume SuperHyperClasses of a Extreme SuperHyperGraph on the 828
same identical letter of the alphabet. Then its Extreme SuperHyperChord is its 829
SuperHyperChord and reversely. 830
Corollary 6.7. Assume a Extreme SuperHyperPath(-/SuperHyperChord, 831
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on 832
the same identical letter of the alphabet. Then its Extreme SuperHyperChord is its 833
SuperHyperChord and reversely. 834
Corollary 6.8. Assume a Extreme SuperHyperGraph. Then its Extreme 835
SuperHyperChord isn’t well-defined if and only if its SuperHyperChord isn’t well-defined. 836
Corollary 6.9. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its 837
Extreme SuperHyperChord isn’t well-defined if and only if its SuperHyperChord isn’t 838
well-defined. 839
Then its Extreme SuperHyperChord isn’t well-defined if and only if its SuperHyperChord 842
isn’t well-defined. 843
Corollary 6.11. Assume a Extreme SuperHyperGraph. Then its Extreme 844
SuperHyperChord is well-defined if and only if its SuperHyperChord is well-defined. 845
Corollary 6.12. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its 846
Extreme SuperHyperChord is well-defined if and only if its SuperHyperChord is 847
well-defined. 848
Then its Extreme SuperHyperChord is well-defined if and only if its SuperHyperChord is 851
well-defined. 852
Proposition 6.14. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then V is 853
(i) : the dual SuperHyperDefensive SuperHyperChord; 854
(ii) : the strong dual SuperHyperDefensive SuperHyperChord; 855
(iii) : the connected dual SuperHyperDefensive SuperHyperChord; 856
(iv) : the δ-dual SuperHyperDefensive SuperHyperChord; 857
(v) : the strong δ-dual SuperHyperDefensive SuperHyperChord; 858
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperChord. 859
Proposition 6.15. Let N T G : (V, E, σ, µ) be a Extreme SuperHyperGraph. Then ∅ is 860
(i) : the SuperHyperDefensive SuperHyperChord; 861
(ii) : the strong SuperHyperDefensive SuperHyperChord; 862
(iii) : the connected defensive SuperHyperDefensive SuperHyperChord; 863
(iv) : the δ-SuperHyperDefensive SuperHyperChord; 864
(v) : the strong δ-SuperHyperDefensive SuperHyperChord; 865
(vi) : the connected δ-SuperHyperDefensive SuperHyperChord. 866
Proposition 6.16. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then an 867
independent SuperHyperSet is 868
(i) : the SuperHyperDefensive SuperHyperChord; 869
(ii) : the strong SuperHyperDefensive SuperHyperChord; 870
(iii) : the connected SuperHyperDefensive SuperHyperChord; 871
(iv) : the δ-SuperHyperDefensive SuperHyperChord; 872
(v) : the strong δ-SuperHyperDefensive SuperHyperChord; 873
(vi) : the connected δ-SuperHyperDefensive SuperHyperChord. 874
Proposition 6.17. Let ESHG : (V, E) be a Extreme SuperHyperUniform 875
SuperHyperGraph which is a SuperHyperChord/SuperHyperPath. Then V is a maximal 876
(i) : SuperHyperDefensive SuperHyperChord; 877
(ii) : strong SuperHyperDefensive SuperHyperChord; 878
(iii) : connected SuperHyperDefensive SuperHyperChord; 879
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperChord; 880
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperChord; 881
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperChord; 882
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 883
Proposition 6.18. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is a 884
SuperHyperUniform SuperHyperWheel. Then V is a maximal 885
(i) : dual SuperHyperDefensive SuperHyperChord; 886
(ii) : strong dual SuperHyperDefensive SuperHyperChord; 887
(iii) : connected dual SuperHyperDefensive SuperHyperChord; 888
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperChord; 889
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperChord; 890
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperChord; 891
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 892
SuperHyperGraph which is a SuperHyperChord/SuperHyperPath. Then the number of 894
(i) : the SuperHyperChord; 895
(ii) : the SuperHyperChord; 896
(iii) : the connected SuperHyperChord; 897
(iv) : the O(ESHG)-SuperHyperChord; 898
(v) : the strong O(ESHG)-SuperHyperChord; 899
(vi) : the connected O(ESHG)-SuperHyperChord. 900
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 901
SuperHyperVertices coincide. 902
SuperHyperGraph which is a SuperHyperWheel. Then the number of 904
(i) : the dual SuperHyperChord; 905
(ii) : the dual SuperHyperChord; 906
(iii) : the dual connected SuperHyperChord; 907
(iv) : the dual O(ESHG)-SuperHyperChord; 908
(v) : the strong dual O(ESHG)-SuperHyperChord; 909
(vi) : the connected dual O(ESHG)-SuperHyperChord. 910
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 911
SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 914
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 915
SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 916
number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 917
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperChord; 921
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperChord; 922
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperChord. 923
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 926
SuperHyperSet contains the half of multiplying r with the number of all the 927
SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 928
is a 929
(iv) : δ-SuperHyperDefensive SuperHyperChord; 933
(v) : strong δ-SuperHyperDefensive SuperHyperChord; 934
(vi) : connected δ-SuperHyperDefensive SuperHyperChord. 935
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 938
number of 939
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperChord; 943
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperChord; 944
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperChord. 945
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 946
multiplying r with the number of all the SuperHyperEdges plus one of all the 947
SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 948
Proposition 6.24. Let ESHG : (V, E) be a Extreme SuperHyperGraph. The number 950
of connected component is |V − S| if there’s a SuperHyperSet which is a dual 951
(iv) : SuperHyperChord; 955
(v) : strong 1-SuperHyperDefensive SuperHyperChord; 956
(vi) : connected 1-SuperHyperDefensive SuperHyperChord. 957
Proposition 6.25. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then the 958
number is at most O(ESHG) and the Extreme number is at most On (ESHG). 959
Proposition 6.26. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is 960
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 961
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 962
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperChord; 966
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperChord. 968
Proposition 6.27. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is ∅. 969
The number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the 970
setting of dual 971
(iv) : 0-SuperHyperDefensive SuperHyperChord; 975
(v) : strong 0-SuperHyperDefensive SuperHyperChord; 976
(vi) : connected 0-SuperHyperDefensive SuperHyperChord. 977
SuperHyperComplete. Then there’s no independent SuperHyperSet. 979
SuperHyperChord/SuperHyperPath/SuperHyperWheel. The number is 981
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 982
dual 983
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperChord; 987
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperChord; 988
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperChord. 989
SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 991
number is O(ESHG:(V,E))
2 + 1 and the Extreme number is 992
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of a dual 993
t>
2
(iv) : ( O(ESHG:(V,E))
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperChord. 999
Proposition 6.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1000
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is 1001
obtained for the individuals. Then the results also hold for the SuperHyperFamily 1002
N SHF : (V, E) of these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 1003
Proposition 6.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is 1004
a dual SuperHyperDefensive SuperHyperChord, then ∀v ∈ V \ S, ∃x ∈ S such that 1005
(i) v ∈ Ns (x); 1006
(ii) vx ∈ E. 1007
Proposition 6.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is 1008
a dual SuperHyperDefensive SuperHyperChord, then 1009
(i) S is SuperHyperChord set; 1010
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1011
Proposition 6.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 1012
(i) Γ ≤ O; 1013
(ii) Γs ≤ On . 1014
Proposition 6.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 1015
connected. Then 1016
(i) Γ ≤ O − 1; 1017
(ii) Γs ≤ On − Σ3i=1 σi (x). 1018
Proposition 6.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1019
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1020
SuperHyperChord; 1021
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1022
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1023
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only 1024
a dual SuperHyperChord. 1025
Proposition 6.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1026
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperChord; 1027
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and 1028
{v1 , v3 , · · · .vn−1 }; 1029
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1030
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only 1031
dual SuperHyperChord. 1032
Proposition 6.38. Let ESHG : (V, E) be an even SuperHyperChord. Then 1033
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive 1034
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and 1036
{v1 , v3 , · · · , vn−1 }; 1037
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1038
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only 1039
Proposition 6.39. Let ESHG : (V, E) be an odd SuperHyperChord. Then 1041
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1042
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1044
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1045
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only 1046
Proposition 6.40. Let ESHG : (V, E) be SuperHyperStar. Then 1048
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperChord; 1049
(ii) Γ = 1; 1050
(iii) Γs = Σ3i=1 σi (c); 1051
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperChord. 1052
Proposition 6.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1053
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual 1054
maximal SuperHyperDefensive SuperHyperChord; 1055
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1056
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1057
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual 1058
maximal SuperHyperDefensive SuperHyperChord. 1059
Proposition 6.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1060
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive 1061
(ii) Γ = b n2 c + 1; 1063
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 1064
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive 1065
SuperHyperChord. 1066
Proposition 6.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1067
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperChord; 1068
(ii) Γ = b n2 c; 1069

bnc ; 1070
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual maximal SuperHyperDefensive 1071
Proposition 6.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme 1073
SuperHyperStars with common Extreme SuperHyperVertex SuperHyperSet. Then 1074
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive 1075
SuperHyperChord for N SHF; 1076
(ii) Γ = m for N SHF : (V, E); 1077
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1078
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual 1079
SuperHyperChord for N SHF : (V, E). 1080
Proposition 6.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd 1081
SuperHyperComplete SuperHyperGraphs with common Extreme SuperHyperVertex 1082
SuperHyperSet. Then 1083
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 1084
SuperHyperChord for N SHF; 1085
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1086

b n c+1 for N SHF : (V, E); 1087
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperChord for 1088
N SHF : (V, E). 1089
Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1090
SuperHyperComplete SuperHyperGraphs with common Extreme SuperHyperVertex 1091
SuperHyperSet. Then 1092
bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperChord 1093
for N SHF : (V, E); 1094
(ii) Γ = b n2 c for N SHF : (V, E); 1095

bnc for N SHF : (V, E); 1096
S={vi }i=1
bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperChord for 1097
N SHF : (V, E). 1098
following statements hold; 1100
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an 1101
t-SuperHyperDefensive SuperHyperChord, then S is an s-SuperHyperDefensive 1102
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1104
t-SuperHyperDefensive SuperHyperChord, then S is a dual s-SuperHyperDefensive 1105
following statements hold; 1108
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an 1109
t-SuperHyperDefensive SuperHyperChord, then S is an s-SuperHyperPowerful 1110
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1112
t-SuperHyperDefensive SuperHyperChord, then S is a dual s-SuperHyperPowerful 1113
Proposition 6.49. Let ESHG : (V, E) be a[an] 1115
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph. Then following statements 1116
hold; 1117
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 1118
2-SuperHyperDefensive SuperHyperChord; 1119
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 1120
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 1122
(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 1124
V-SuperHyperDefensive SuperHyperChord. 1125
Proposition 6.50. Let ESHG : (V, E) is a[an] 1126
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph. Then following statements 1127
hold; 1128
(i) ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1129
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 1131
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 1133
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 1135
V-SuperHyperDefensive SuperHyperChord. 1136
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is a 1138
SuperHyperComplete. Then following statements hold; 1139
(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1

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

2 c + 1 if ESHG : (V, E) is a dual 1142
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 1144
(O − 1)-SuperHyperDefensive SuperHyperChord. 1147
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is a 1149
SuperHyperComplete. Then following statements hold; 1150
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1

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

2 c + 1, then ESHG : (V, E) is a dual 1153
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1155
(O − 1)-SuperHyperDefensive SuperHyperChord; 1156
(O − 1)-SuperHyperDefensive SuperHyperChord. 1158
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is SuperHyperChord. 1160
Then following statements hold; 1161
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 1162
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1164
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 1166
2-SuperHyperDefensive SuperHyperChord. 1169
[V-]SuperHyperUniform-strong-Extreme SuperHyperGraph which is SuperHyperChord. 1171
Then following statements hold; 1172
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 1173
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1175
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 1177
2-SuperHyperDefensive SuperHyperChord. 1180
7 Extreme Applications in Cancer’s Extreme 1181
Recognition 1182
The cancer is the Extreme disease but the Extreme model is going to figure out what’s 1183
going on this Extreme phenomenon. The special Extreme case of this Extreme disease 1184
is considered and as the consequences of the model, some parameters are used. The cells 1185
are under attack of this disease but the moves of the cancer in the special region are the 1186
matter of mind. The Extreme recognition of the cancer could help to find some 1187
Extreme treatments for this Extreme disease. 1188
In the following, some Extreme steps are Extreme devised on this disease. 1189
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the 1190
long-term Extreme function. 1191
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme 1192
model [it’s called Extreme SuperHyperGraph] and the long Extreme cycle of the 1193
move from the cancer is identified by this research. Sometimes the move of the 1194
cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1195
and neutrality about the moves and the effects of the cancer on that region; this 1196
event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] 1197
to have convenient perception on what’s happened and what’s done. 1198
Step 3. (Extreme Model) There are some specific Extreme models, which are 1199
well-known and they’ve got the names, and some general Extreme models. The 1200
moves and the Extreme traces of the cancer on the complex tracks and between 1201
complicated groups of cells could be fantasized by a Extreme 1202
SuperHyperPath(-/SuperHyperChord, SuperHyperStar, SuperHyperBipartite, 1203
SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1204
Extreme SuperHyperChord or the Extreme SuperHyperChord in those Extreme 1205
Extreme SuperHyperModels. 1206
8 Case 1: The Initial Extreme Steps Toward 1207
Extreme SuperHyperBipartite as Extreme 1208
SuperHyperModel 1209
Step 4. (Extreme Solution) In the Extreme Figure (29), the Extreme 1210
SuperHyperBipartite is Extreme highlighted and Extreme featured. 1211
Figure 29. a Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperChord
Table 4. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Extreme SuperHyperBipartite
By using the Extreme Figure (29) and the Table (4), the Extreme 1212
SuperHyperBipartite is obtained. 1213
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous 1214
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme 1215
SuperHyperBipartite ESHB : (V, E), in the Extreme SuperHyperModel (29), is 1216
the Extreme SuperHyperChord. 1217
9 Case 2: The Increasing Extreme Steps Toward 1218
Extreme SuperHyperMultipartite as Extreme 1219
SuperHyperModel 1220
Step 4. (Extreme Solution) In the Extreme Figure (30), the Extreme 1221
SuperHyperMultipartite is Extreme highlighted and Extreme featured. 1222
By using the Extreme Figure (30) and the Table (5), the Extreme 1223
SuperHyperMultipartite is obtained. 1224
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous 1225
SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (30), 1227
is the Extreme SuperHyperChord. 1228
Figure 30. a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperChord
Table 5. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Extreme SuperHyperMultipartite
10 Wondering Open Problems But As The 1229
Directions To Forming The Motivations 1230
In what follows, some “problems” and some “questions” are proposed. 1231
The SuperHyperChord and the Extreme SuperHyperChord are defined on a 1232
real-world application, titled “Cancer’s Recognitions”. 1233
Question 10.1. Which the else SuperHyperModels could be defined based on Cancer’s 1234
recognitions? 1235
Question 10.2. Are there some SuperHyperNotions related to SuperHyperChord and 1236
the Extreme SuperHyperChord? 1237
Question 10.3. Are there some Algorithms to be defined on the SuperHyperModels to 1238
compute them? 1239
Question 10.4. Which the SuperHyperNotions are related to beyond the 1240
SuperHyperChord and the Extreme SuperHyperChord? 1241
Problem 10.5. The SuperHyperChord and the Extreme SuperHyperChord do a 1242
SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperChord, 1243
are there else? 1244
Problem 10.6. Which the fundamental SuperHyperNumbers are related to these 1245
SuperHyperNumbers types-results? 1246
Problem 10.7. What’s the independent research based on Cancer’s recognitions 1247
concerning the multiple types of SuperHyperNotions? 1248
11 Conclusion and Closing Remarks 1249
In this section, concluding remarks and closing remarks are represented. The drawbacks 1250
of this research are illustrated. Some benefits and some advantages of this research are 1251
highlighted. 1252
This research uses some approaches to make Extreme SuperHyperGraphs more 1253
understandable. In this endeavor, two SuperHyperNotions are defined on the 1254
SuperHyperChord. For that sake in the second definition, the main definition of the 1255
Extreme SuperHyperGraph is redefined on the position of the alphabets. Based on the 1256
new definition for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme 1257
SuperHyperChord, finds the convenient background to implement some results based on 1258
that. Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of 1259
this research on the modeling of the regions where are under the attacks of the cancer 1260
to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To 1261
formalize the instances on the SuperHyperNotion, SuperHyperChord, the new 1262
SuperHyperClasses and SuperHyperClasses, are introduced. Some general results are 1263
gathered in the section on the SuperHyperChord and the Extreme SuperHyperChord. 1264
The clarifications, instances and literature reviews have taken the whole way through. 1265
In this research, the literature reviews have fulfilled the lines containing the notions and 1266
the results. The SuperHyperGraph and Extreme SuperHyperGraph are the 1267
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background 1268
of this research. Sometimes the cancer has been happened on the region, full of cells, 1269
groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 1270
some SuperHyperNotions based on the connectivities of the moves of the cancer in the 1271
longest and strongest styles with the formation of the design and the architecture are 1272
formally called “ SuperHyperChord” in the themes of jargons and buzzwords. The 1273
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 1274
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. SuperHyperChord
3. Extreme SuperHyperChord 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies
1275
research are, figured out, pointed out and spoken out. 1276
12 Extreme SuperHyperDuality But As The 1277
Forms 1279
Definition 12.1. (Different Extreme Types of Extreme SuperHyperDuality). 1280
Assume a Extreme SuperHyperGraph (NSHG) S is an Chorded pair S = (V, E). 1281
Consider a Extreme SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. 1282
Then either V 0 or E 0 is called 1283
(i) Extreme e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such 1284
that Va ∈ Ei , Ej ; 1285
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such 1286
that Va ∈ Ei , Ej and 1287
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such 1289
that Vi , Vj ∈ Ea ; 1290
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such 1291
that Vi , Vj ∈ Ea and 1292
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 1294
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme 1295
rv-SuperHyperDuality. 1296
Definition 12.2. ((Extreme) SuperHyperDuality). 1297
Consider a Extreme SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1299
(i) an Extreme SuperHyperDuality if it’s either of Extreme 1300
e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme 1301
v-SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an 1302
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 1303
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1304
SuperHyperEdges in the consecutive Extreme sequence of Extreme 1305
Extreme SuperHyperDuality; 1307
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 1308
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme 1309
rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 1310
N SHG : (V, E) is the maximum Extreme cardinality of the Extreme 1311
SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme cardinality 1312
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1313
that they form the Extreme SuperHyperDuality; 1314
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1315
Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme 1316
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1318
Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1323
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1325
v-SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for a 1327
a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1331
(v) an Extreme R-SuperHyperDuality if it’s either of Extreme 1335
SuperHyperVertices in the consecutive Extreme sequence of Extreme 1340
Extreme SuperHyperDuality; 1342
(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme 1343
of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of high 1347
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 1348
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 1349
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 1350
of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme 1351
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1360
of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1366
Extreme coefficient. 1369
SuperHyperDuality, is up. The Extreme Algorithm is Extremely straightforward. 1373
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 1379
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.
given Extreme SuperHyperDuality. 1387


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). 1430
Then 1431
C(N SHG)Extreme SuperHyperDuality =

|EESHG:(V,E) |Extreme Cardinality
= {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 1432
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 1436
Extreme SuperHyperModel (23), is the SuperHyperDuality. 1440
Then 1442
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 1443
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

(25), is the Extreme SuperHyperDuality. 1464
Proposition 12.10. Assume a connected Extreme SuperHyperBipartite 1465
ESHB : (V, E). Then 1466
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 1467
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 1472
isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 1473
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 1474
SuperHyperVertex as the representative in the 1475
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite 1476
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperDuality. 1485

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

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1495
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. 1506
Then, 1508
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 1509
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 1510

∃!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 1516
excerpt from some representatives. The latter is straightforward. 1517
SuperHyperWheel N SHW : (V, E), is Extreme highlighted and featured. The obtained 1519
Extreme SuperHyperSet, by the Algorithm in previous result, of the Extreme 1520
the Extreme SuperHyperModel (28), is the Extreme SuperHyperDuality. 1522
13 Extreme SuperHyperJoin But As The 1523
Forms 1525
Definition 13.1. (Different Extreme Types of Extreme SuperHyperJoin). 1526
(i) Extreme e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 1530
Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 1531
(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 1532
Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 1533
(iii) Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 1535
Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 1536
(iv) Extreme rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 1537
Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 1538
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 1540
re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 1541
Definition 13.2. ((Extreme) SuperHyperJoin). 1542
(i) an Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 1545
Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 1546
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 1547
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 1548
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in 1549
the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 1550
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 1551
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 1552
rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph 1554
that they form the Extreme SuperHyperJoin; 1558
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 1559
Extreme e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme 1560
v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and C(N SHG) for an 1561
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 1567
coefficient; 1568
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 1569
v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and C(N SHG) for a Extreme 1571
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1572
Extreme cardinality of the Extreme SuperHyperEdges of a Extreme 1574
SuperHyperSet S of high Extreme cardinality consecutive Extreme 1575
coefficient; 1578
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 1579
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 1581
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 1583
in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 1584
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 1585
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, 1586
rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph 1588
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality 1590
that they form the Extreme SuperHyperJoin; 1592
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 1593
v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and C(N SHG) for an 1595
coefficient; 1602
(viii) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 1603
v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and C(N SHG) for a Extreme 1605
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1606
Extreme cardinality of the Extreme SuperHyperVertices of a Extreme 1608
SuperHyperSet S of high Extreme cardinality consecutive Extreme 1609
coefficient. 1612
SuperHyperJoin, is up. The Extreme Algorithm is Extremely straightforward. E1 1616
and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 1617
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperJoin. 1622
C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 3z.
SuperHyperJoin, is up. The Extreme Algorithm is Extremely straightforward. 1624
given Extreme SuperHyperJoin. 1630


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 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 = {V3 , V13 , V8 }.
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
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .
Then 1674
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 1675
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 1679
Extreme SuperHyperModel (23), is the SuperHyperJoin. 1683
Then 1685

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

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

the Extreme SuperHyperModel (24), is the Extreme SuperHyperJoin. 1694
Then 1696
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 1697

(25), is the Extreme SuperHyperJoin. 1707
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 1710
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 1715
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 1716
There are only two SuperHyperParts. Thus every SuperHyperPart could have one 1717
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite 1719
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperJoin. 1728

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 1731
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperMultipartite 1732

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 1736
may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 1737
There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1738
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. 1749
Then, 1751

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

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

straightforward. Then there’s at least one SuperHyperJoin. Thus the notion of quasi 1757
isn’t up and the SuperHyperNotions based on SuperHyperJoin could be applied. The 1758
unique embedded SuperHyperJoin proposes some longest SuperHyperJoin excerpt from 1759
some representatives. The latter is straightforward. 1760
the Extreme SuperHyperModel (28), is the Extreme SuperHyperJoin. 1765
14 Extreme SuperHyperPerfect But As The 1766
Forms 1768
Definition 14.1. (Different Extreme Types of Extreme SuperHyperPerfect). 1769
(i) Extreme e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 1773
that Va ∈ Ei , Ej ; 1774
(ii) Extreme re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 1775
that Va ∈ Ei , Ej ; and 1776
(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such 1778
that Vi , Vj ∈ Ea ; 1779
(iv) Extreme rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such 1780
that Vi , Vj ∈ Ea ; and 1781
(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 1783
Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme 1784
rv-SuperHyperPerfect. 1785
Definition 14.2. ((Extreme) SuperHyperPerfect). 1786
(i) an Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 1789
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 1791
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 1795
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 1796
rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 1798
that they form the Extreme SuperHyperPerfect; 1802
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 1803
Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 1804
v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an 1805
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 1811
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 1813
v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for a 1815
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme 1823
e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 1824
SuperHyperVertices in the consecutive Extreme sequence of Extreme 1828
Extreme SuperHyperPerfect; 1830
(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme 1831
e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 1832
of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of high 1835
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 1836
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 1837
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 1838
of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme 1839
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 1848
SuperHyperPerfect, is up. The Extreme Algorithm is Extremely straightforward. 1861
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 1867
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.
given Extreme SuperHyperPerfect. 1875


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

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

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

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

(25), is the Extreme SuperHyperPerfect. 1952
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 1955
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 1960
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 1961
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite 1964
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperPerfect. 1973

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

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 1981
quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 1982
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. 1994
Then, 1996
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

straightforward. Then there’s at least one SuperHyperPerfect. Thus the notion of quasi 2002
isn’t up and the SuperHyperNotions based on SuperHyperPerfect could be applied. The 2003
unique embedded SuperHyperPerfect proposes some longest SuperHyperPerfect excerpt 2004
the Extreme SuperHyperModel (28), is the Extreme SuperHyperPerfect. 2010
15 Extreme SuperHyperTotal But As The 2011
Forms 2013
Definition 15.1. (Different Extreme Types of Extreme SuperHyperTotal). 2014
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 2018
Va ∈ Ei , Ej ; 2019
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 2020
Va ∈ Ei , Ej ; and 2021
(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 2023
Vi , Vj ∈ Ea ; 2024
(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 2025
Vi , Vj ∈ Ea ; and 2026
(v) Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2028
Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme 2029
rv-SuperHyperTotal. 2030
Definition 15.2. ((Extreme) SuperHyperTotal). 2031
(i) an Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2034
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 2036
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2040
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2041
rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph 2043
that they form the Extreme SuperHyperTotal; 2047
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2048
Extreme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme 2049
v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and C(N SHG) for an 2050
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 2056
coefficient; 2057
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2058
v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and C(N SHG) for a 2060
coefficient; 2067
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2068
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 2070
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 2072
in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 2073
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2074
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, 2075
rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph 2077
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality 2079
that they form the Extreme SuperHyperTotal; 2081
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2082
v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and C(N SHG) for an 2084
coefficient; 2091
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2092
v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and C(N SHG) for a 2094
coefficient. 2101
SuperHyperTotal, is up. The Extreme Algorithm is Extremely straightforward. 2105
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperTotal. 2111
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.
given Extreme SuperHyperTotal. 2119


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

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2168
Extreme SuperHyperModel (23), is the SuperHyperTotal. 2172
Then 2174
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 2175
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. 2183
Then 2185
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 2186
P : ViEXT ERN AL , Ei , CEN T ER, Ej .


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

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

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 2220
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 2221

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2225
quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2226
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. 2238
Then, 2240
∗
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 2241
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel 2242

straightforward. Then there’s at least one SuperHyperTotal. Thus the notion of quasi 2246
isn’t up and the SuperHyperNotions based on SuperHyperTotal could be applied. The 2247
unique embedded SuperHyperTotal proposes some longest SuperHyperTotal excerpt 2248
the Extreme SuperHyperModel (28), is the Extreme SuperHyperTotal. 2254
16 Extreme SuperHyperConnected But As The 2255
Forms 2257
Definition 16.1. (Different Extreme Types of Extreme SuperHyperConnected). 2258
(i) Extreme e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2262
such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2263
(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2264
such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2265
(iii) Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , 2267
such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2268
(iv) Extreme rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , 2269
such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2270
(v) Extreme SuperHyperConnected if it’s either of Extreme 2272
e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2273
v-SuperHyperConnected, and Extreme rv-SuperHyperConnected. 2274
Definition 16.2. ((Extreme) SuperHyperConnected). 2275
(i) an Extreme SuperHyperConnected if it’s either of Extreme 2278
v-SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) 2280
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2281
Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 2283
Extreme SuperHyperConnected; 2285
(ii) a Extreme SuperHyperConnected if it’s either of Extreme 2286
for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2289
cardinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet S of 2290
high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 2291
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 2292
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2293
of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2294
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2296
Extreme SuperHyperConnected; and the Extreme power is corresponded to its 2301
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 2303
Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2304
for a Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2306
(v) an Extreme R-SuperHyperConnected if it’s either of Extreme 2313
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2316
Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 2318
Extreme SuperHyperConnected; 2320
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme 2321
for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2324
cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of 2325
high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 2326
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 2327
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s 2328
either of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, 2329
Extreme v-SuperHyperConnected, and Extreme rv-SuperHyperConnected and 2330
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 2338
Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme 2339
for a Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2341
SuperHyperConnected, is up. The Extreme Algorithm is Extremely 2351
straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is 2352
a loop Extreme SuperHyperEdge and E4 is a Extreme SuperHyperEdge. Thus in 2353
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme 2354
SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme 2355
isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 2356
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2357
Extreme SuperHyperConnected. 2358
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 2361
E4 is a Extreme SuperHyperEdge. Thus in the terms of Extreme 2362
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 2363
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no 2364
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 2366


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 2430
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 2431
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 2435
Extreme SuperHyperModel (23), is the SuperHyperConnected. 2439
Then 2441
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 2442
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 2445
the Extreme SuperHyperModel (24), is the Extreme SuperHyperConnected. 2450
Then 2452
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 2453
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 2492
quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 2493
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. 2505
Then, 2507
∗
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 2508
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 2509

straightforward. Then there’s at least one SuperHyperConnected. Thus the notion of 2513
quasi isn’t up and the SuperHyperNotions based on SuperHyperConnected could be 2514
applied. The unique embedded SuperHyperConnected proposes some longest 2515
SuperHyperConnected excerpt from some representatives. The latter is 2516
the Extreme SuperHyperModel (28), is the Extreme SuperHyperConnected. 2522
17 Background 2523
There are some scientific researches covering the topic of this research. In what follows, 2524
there are some discussion and literature reviews about them date back on February 19, 2525
2023. 2526
First article is titled “properties of SuperHyperGraph and neutrosophic 2527
SuperHyperGraph” in Ref. [1] by Henry Garrett (2022). It’s first step toward the 2528
research on neutrosophic SuperHyperGraphs. This research article is published on the 2529
journal “Neutrosophic Sets and Systems” in issue 49 and the pages 531-561. In this 2530
research article, different types of notions like dominating, resolving, coloring, 2531
Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, 2532
zero forcing number, zero forcing neutrosophic- number, independent number, 2533
independent neutrosophic-number, clique number, clique neutrosophic-number, 2534
matching number, matching neutrosophic-number, girth, neutrosophic girth, 2535
1-zero-forcing number, 1-zero- forcing neutrosophic-number, failed 1-zero-forcing 2536
number, failed 1-zero-forcing neutrosophic-number, global- offensive alliance, t-offensive 2537
alliance, t-defensive alliance, t-powerful alliance, and global-powerful alliance are defined 2538
in SuperHyperGraph and neutrosophic SuperHyperGraph. Some Classes of 2539
SuperHyperGraph and Neutrosophic SuperHyperGraph are cases of research. Some 2540
results are applied in family of SuperHyperGraph and neutrosophic SuperHyperGraph. 2541
Thus this research article has concentrated on the vast notions and introducing the 2542
majority of notions. 2543
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and 2544
neutrosophic degree alongside chromatic numbers in the setting of some classes related 2545
to neutrosophic hypergraphs” in Ref. [2] by Henry Garrett (2022). In this research 2546
article, a novel approach is implemented on SuperHyperGraph and neutrosophic 2547
SuperHyperGraph based on general forms without using neutrosophic classes of 2548
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 2549
entitled “Journal of Current Trends in Computer Science Research (JCTCSR)” with 2550
ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 2551
06-14. The research article studies deeply with choosing neutrosophic hypergraphs 2552
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 2553
results based on initial background. 2554
The seminal paper and groundbreaking article is titled “Super Hyper Dominating 2555
and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions 2556
in Game Theory and Neutrosophic Super Hyper Classes” in Ref. [3] by Henry Garrett 2557
(2022). In this research article, a novel approach is implemented on SuperHyperGraph 2558
and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and 2559
using neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s 2560
published in prestigious and fancy journal is entitled “Journal of Mathematical 2561
Techniques and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math 2562
Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. The research 2563
article studies deeply with choosing directly neutrosophic SuperHyperGraph and 2564
SuperHyperGraph. It’s the breakthrough toward independent results based on initial 2565
background and fundamental SuperHyperNumbers. 2566
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 2567
and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 2568
Graphs Alongside Applications in Cancer’s Treatments” in Ref. [63] by Henry Garrett 2569
(2023). In this research article, a novel approach is implemented on SuperHyperGraph 2570
and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 2571
in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 2572
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 2573
ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 2574
pages 35-47. The research article studies deeply with choosing directly neutrosophic 2575
SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 2576
results based on initial background and fundamental SuperHyperNumbers. 2577
In some articles are titled “0039 — Closing Numbers and Super-Closing Numbers as 2578
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 2579
(Neutrosophic)n-SuperHyperGraph” in Ref. [5] by Henry Garrett (2022), “0049 — 2580
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [6] by Henry Garrett 2581
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 2582
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 2583
in Ref. [7] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 2584
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 2585
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [8] by 2586
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 2587
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [9] by Henry Garrett (2022), 2588
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 2589
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 2590
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 2591
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [10] by 2592
Henry Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The 2593
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s 2594
Recognition Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [11] by Henry 2595
Garrett (2022), “Neutrosophic Failed SuperHyperStable as the Survivors on the 2596
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 2597
SuperHyperGraphs” in Ref. [12] by Henry Garrett (2022), “Extremism of the Attacked 2598
Body Under the Cancer’s Circumstances Where Cancer’s Recognition Titled 2599
(Neutrosophic) SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), 2600
“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 2601
(Neutrosophic) SuperHyperGraphs” in Ref. [14] by Henry Garrett (2022), 2602
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 2603
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [15] by 2604
Henry Garrett (2022), “Neutrosophic 1-Failed SuperHyperForcing in the 2605
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 2606
Neutrosophic Recognition And Beyond” in Ref. [16] by Henry Garrett (2022), 2607
“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 2608
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [17] by Henry 2609
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 2610
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 2611
in Ref. [13] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 2612
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 2613
And (Neutrosophic) SuperHyperGraphs” in Ref. [18] by Henry Garrett (2022), 2614
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 2615
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [19] by 2616
Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 2617
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [20] by 2618
Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With 2619
SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 2620
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of 2621
Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [21] by 2622
Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic 2623
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [22] by 2624
Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees on 2625
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in 2626
Cancer’s Treatments” in Ref. [23] by Henry Garrett (2022), “SuperHyperDominating 2627
and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 2628
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [24] by Henry Garrett 2629
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 2630
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [77] by Henry Garrett (2023), 2631
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme 2632
Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial 2633
on (Neutrosophic) SuperHyperGraphs” in Ref. [78] by Henry Garrett (2023), “Extreme 2634
Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition in the 2635
Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) 2636
SuperHyperGraphs” in Ref. [79] by Henry Garrett (2023), “Indeterminacy On The All 2637
Possible Connections of Cells In Front of Cancer’s Attacks In The Terms of 2638
Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 2639
SuperHyperGraphs” in Ref. [80] by Henry Garrett (2023), “Perfect Directions Toward 2640
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 2641
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [83] by Henry Garrett 2642
(2023), “Demonstrating Complete Connections in Every Embedded Regions and 2643
Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 2644
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [84] by Henry 2645
Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 2646
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 2647
the Form of Neutrosophic SuperHyperGraphs” in Ref. [87] by Henry Garrett (2023), 2648
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 2649
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [90] by Henry 2650
Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 2651
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 2652
in Ref. [91] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 2653
Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 2654
Ref. [92] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 2655
Neutrosophic Recognition And Beyond” in Ref. [93] by Henry Garrett (2022), 2657
“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 2658
(Neutrosophic) SuperHyperGraphs” in Ref. [94] by Henry Garrett (2022), “Basic 2659
Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 2660
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 2661
in Ref. [95] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 2662
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” 2663
in Ref. [106] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries 2664
to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) 2665
in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [107] by Henry Garrett (2022), 2666
and [25–31, 33–76, 81, 82, 85, 86, 88, 89, 96–105], there are some endeavors to formalize the 2667
basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph. 2668
Some scientific studies and scientific researches about neutrosophic graphs, are 2669
proposed as book in Ref. [108] by Henry Garrett (2022) which is indexed by Google 2670
Scholar and has more than 3230 readers in Scribd. It’s titled “Beyond Neutrosophic 2671
Graphs” and published by Ohio: E-publishing: Educational Publisher 1091 West 1st 2672
Ave Grandview Heights, Ohio 43212 United State. This research book covers different 2673
types of notions and settings in neutrosophic graph theory and neutrosophic 2674
SuperHyperGraph theory. 2675
Also, some scientific studies and scientific researches about neutrosophic graphs, are 2676
proposed as book in Ref. [109] by Henry Garrett (2022) which is indexed by Google 2677
Scholar and has more than 4117 readers in Scribd. It’s titled “Neutrosophic Duality” 2678
and published by Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell 2679
Ave Ste 950 Miami, Florida 33131 United States. This research book presents different 2680
types of notions SuperHyperResolving and SuperHyperDominating in the setting of 2681
duality in neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This 2682
research book has scrutiny on the complement of the intended set and the intended set, 2683
simultaneously. It’s smart to consider a set but acting on its complement that what’s 2684
done in this research book which is popular in the terms of high readers in Scribd. 2685
See the seminal scientific researches [1–3]. The formalization of the notions on the 2686
framework of Extreme K-Chord In SuperHyperGraphs, Neutrosophic K-Chord In 2687
SuperHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory 2688
at [5–31, 33–107]. Two popular scientific research books in Scribd in the terms of high 2689
readers, 3230 and 4117 respectively, on neutrosophic science is on [108, 109]. 2690
– 2691
References 2692
1. Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic 2693
SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 2694
10.5281/zenodo.6456413). 2695
(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). 2696
(https://digitalrepository.unm.edu/nss journal/vol49/iss1/34). 2697
2. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 2698
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 2699
Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. 2700
3. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 2701
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 2702
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 2703
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 2704
4. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 2705
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 2706
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 2707
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 2708
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 2709
graphs-and-super-hyper-graphs-alongside-a.pdf) 2710
5. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 2711
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 2712
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 2713
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 2714
Research, https://doi.org/10.5281/zenodo.6319942. 2715
https://oa.mg/work/10.5281/zenodo.6319942 2716
6. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 2717
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 2718
2022. CERN European Organization for Nuclear Research, 2719
https://doi.org/10.13140/rg.2.2.35241.26724. 2720
https://oa.mg/work/10.13140/rg.2.2.35241.26724 2721
7. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 2722
Confrontation under Cancer’s Recognition as the Model in The Setting of 2723
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 2724
10.20944/preprints202301.0308.v1). 2725
8. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 2726
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 2727
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2728
2023010282 (doi: 10.20944/preprints202301.0282.v1). 2729
9. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 2730
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2731
2023010267 (doi: 10.20944/preprints202301.0267.v1). 2732
10. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 2733
Affected Cells Toward The Totality Under Cancer’s Recognition By New 2734
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 2735
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 2736
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 2737
10.20944/preprints202301.0265.v1). 2738
11. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 2739
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 2740
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2741
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 2742
12. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 2743
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 2744
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 2745
10.20944/preprints202301.0240.v1). 2746
13. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 2747
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 2748
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 2749
10.20944/preprints202301.0224.v1). 2750
14. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 2751
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2752
2023010105 (doi: 10.20944/preprints202301.0105.v1). 2753
15. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 2754
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 2755
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 2756
10.20944/preprints202301.0088.v1). 2757
16. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 2758
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 2760
17. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 2761
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2762
2023010043 (doi: 10.20944/preprints202301.0043.v1). 2763
18. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 2764
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 2765
10.20944/preprints202301.0105.v1). 2767
10.20944/preprints202301.0088.v1). 2771
20. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 2772
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2773
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 2774
21. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 2775
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 2776
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 2777
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 2778
2022120540 (doi: 10.20944/preprints202212.0540.v1). 2779
22. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 2780
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 2781
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 2782
23. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 2783
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 2784
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 2785
10.20944/preprints202212.0324.v1). 2786
24. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 2787
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 2788
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 2789
10.20944/preprints202211.0576.v1). 2790
25. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 2791
SuperHyperGraph By SuperHyperK-Chord As Hyper k-Actions On Super 2792
Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 2793
26. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 2794
SuperHyperK-Chord In Cancer’s Recognition With (Neutrosophic) 2795
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23299.58404). 2796
SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 2798
Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 2799
28. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 2800
SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 2801
SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 2804
Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 2805
30. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 2806
SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 2807
SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 2810
Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 2811
32. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 2812
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 2813
33. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 2815
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 2816
34. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 2818
SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 2819
SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 2822
Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 2823
36. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 2824
SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 2825
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 2828
Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 2829
38. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 2830
SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 2831
SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 2834
ResearchGate 2023, (doi: 10.13140/RG.2.2.11758.69441). 2835
40. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 2836
SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 2837
SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super 2840
Infections”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19360.87048). 2841
42. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 2842
SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 2843
43. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 2845
SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 2846
SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super 2849
Vacancy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19911.37285). 2850
SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 2852
46. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 2854
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 2855
47. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 2857
Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 2858
48. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 2860
SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 2861
Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 2862
49. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 2863
SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 2864
Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 2865
50. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 2866
SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 2867
51. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 2869
Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 2870
SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 2871
52. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 2872
Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 2873
SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 2874
53. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 2875
SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 2876
Hyper Covering Versus Super separations-VI”, ResearchGate 2023, (doi: 2877
10.13140/RG.2.2.29913.80482). 2878
Hyper Covering Versus Super separations-V”, ResearchGate 2023, (doi: 2881
10.13140/RG.2.2.33269.24809). 2882
Hyper Covering Versus Super separations-IV”, ResearchGate 2023, (doi: 2885
10.13140/RG.2.2.34946.96960). 2886
56. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 2887
Hyper Covering Versus Super separations-III”, ResearchGate 2023, (doi: 2889
10.13140/RG.2.2.14814.31040). 2890
Hyper Covering Versus Super separations-II”, ResearchGate 2023, (doi: 2893
10.13140/RG.2.2.15653.17125). 2894
Hyper Covering Versus Super separations-I”, ResearchGate 2023, (doi: 2897
10.13140/RG.2.2.25719.50089). 2898
59. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 2899
Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 2900
SuperHyperConnectivities”, ResearchGate 2023, (doi: 2901
10.13140/RG.2.2.29441.94562). 2902
60. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 2903
SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 2904
Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 2905
61. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 2906
the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 2907
On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 2908
62. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 2909
and Neutrosophic SuperHyperGraph On Super Interactions By Hyper 2910
Extensions of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 2911
63. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 2912
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 2913
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 2914
(2023) 35-47. 2915
64. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 2916
theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 2917
Recognition”, Preprints 2023, 2023010396 (doi: 2918
10.20944/preprints202301.0396.v1). 2919
65. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 2920
neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 2921
Recognition”, Preprints 2023, 2023010395 (doi: 2922
10.20944/preprints202301.0395.v1). 2923
66. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 2924
Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 2925
Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 2926
Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, 2927
(doi: 10.13140/RG.2.2.26240.51204). 2928
67. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 2929
Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 2930
Classes With Hyper Effects In The Background of the Framework is So-Called 2931
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 2932
10.13140/RG.2.2.12818.73925). 2933
68. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 2934
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 2935
Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 2936
10.13140/RG.2.2.26836.88960). 2937
69. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 2938
Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 2939
ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 2940
70. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 2941
Confrontation under Cancer’s Recognition as the Model in The Setting of 2942
10.20944/preprints202301.0308.v1). 2944
71. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 2945
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 2946
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2947
2023010282 (doi: 10.20944/preprints202301.0282.v1). 2948
72. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 2949
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 2950
(doi: 10.20944/preprints202301.0267.v1).). 2951
73. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 2952
Affected Cells Toward The Totality Under Cancer’s Recognition By New 2953
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 2954
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 2955
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 2956
10.20944/preprints202301.0265.v1). 2957
74. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 2958
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 2959
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2960
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 2961
75. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 2962
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 2963
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 2964
10.20944/preprints202301.0240.v1). 2965
76. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 2966
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 2967
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 2968
10.20944/preprints202301.0224.v1). 2969
77. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 2970
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 2971
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 2972
78. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 2973
The Cancer’s Extreme Recognition With Different Types of Extreme 2974
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 2975
79. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 2977
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 2978
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2979
2023, (doi: 10.13140/RG.2.2.32530.73922). 2980
80. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 2981
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 2982
SuperHyperClique on Cancer’s Recognition called Neutrosophic 2983
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 2984
81. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 2985
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 2986
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2987
2023, (doi: 10.13140/RG.2.2.32530.73922). 2988
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2990
2023010105 (doi: 10.20944/preprints202301.0105.v1). 2991
83. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 2992
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 2993
84. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 2995
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 2996
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 2997
10.20944/preprints202301.0105.v1). 3002
10.20944/preprints202301.0088.v1). 3006
87. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 3007
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 3008
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 3009
(doi: 10.13140/RG.2.2.17385.36968). 3010
Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3013
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3015
2023010043 (doi: 10.20944/preprints202301.0043.v1). 3016
90. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 3017
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 3018
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 3021
Special ViewPoints”, ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 3022
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 3024
2023, (doi: 10.13140/RG.2.2.35774.77123). 3025
Neutrosophic Recognition And Beyond ”, ResearchGate 2022, (doi: 3028
10.13140/RG.2.2.36141.77287). 3029
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3031
10.13140/RG.2.2.29430.88642). 3032
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3035
10.13140/RG.2.2.11369.16487). 3036
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3038
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3039
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 3041
98. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With 3043
Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses”, 3046
99. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With 3048
Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses”, 3051
ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 3058
102. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 3059
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 3060
Applications in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3061
10.20944/preprints202212.0324.v1). 3062
103. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3063
Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside 3064
Applications in Cancer’s Treatments”, ResearchGate 2022 (doi: 3065
10.13140/RG.2.2.23123.04641). 3066
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3069
10.20944/preprints202211.0576.v1). 3070
Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 3073
10.13140/RG.2.2.23324.56966). 3074
106. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating 3075
and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 3076
2022 (doi: 10.13140/RG.2.2.29173.86244). 3077
107. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 3078
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 3079
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 3080
10.13140/RG.2.2.25385.88160). 3081
108. Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: 3082
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 3083
United States. ISBN: 979-1-59973-725-6 3084
(http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 3085
109. Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL 3086
KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 3087
33131 United States. ISBN: 978-1-59973-743-0 3088
(http://fs.unm.edu/NeutrosophicDuality.pdf). 3089
View publication stats

0175 - Article#175

Uploaded by

Document Information

Original Description:

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

0175 - Article#175

Uploaded by

Copyright:

Available Formats

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

New Ideas On Super Gap By Hyper Navigations Of Chord In Cancer's Recognition

Preprint · March 2023

345 PUBLICATIONS 4,781 CITATIONS

On Combinatorics View project

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

The user has requested enhancement of the downloaded file.

New Ideas On Super Gap By Hyper Navigations Of Chord In 2

Cancer’s Recognition With (Neutrosophic) 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

SuperHyperChord). Assume a Neutrosophic SuperHyperGraph (NSHG) S is an Chord 10

pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 11

E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperChord 12

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 16

v-SuperHyperChord if there’s a SuperHyperCycle OCHC such that ∃a, b ∈ VOCHC , 17

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 21

SuperHyperChord if it’s either of Neutrosophic e-SuperHyperChord, Neutrosophic 22

re-SuperHyperChord, Neutrosophic v-SuperHyperChord, and Neutrosophic 23

rv-SuperHyperChord. ((Neutrosophic) SuperHyperChord). Assume a Neutrosophic 24

SuperHyperGraph (NSHG) S is an Chorded pair S = (V, E). Consider a Neutrosophic 25

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

SuperHyperChord if it’s either of Neutrosophic e-SuperHyperChord, Neutrosophic 27

re-SuperHyperChord, Neutrosophic v-SuperHyperChord, and Neutrosophic 28

rv-SuperHyperChord and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 29

is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 30

cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 31

Extreme SuperHyperChord; a Neutrosophic SuperHyperChord if it’s either of 33

Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, Neutrosophic 34

v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for a 35

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 36

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 37

of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 38

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 39

SuperHyperChord; an Extreme SuperHyperChord SuperHyperPolynomial if it’s either 40

of Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, Neutrosophic 41

v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for an 42

Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 43

Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 45

of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 46

Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 48

SuperHyperChord SuperHyperPolynomial if it’s either of Neutrosophic 49

e-SuperHyperChord, Neutrosophic re-SuperHyperChord, Neutrosophic 50

v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and C(N SHG) for a 51

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 52

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 53

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 54

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 55

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 56

corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperChord if it’s 58

either of Neutrosophic e-SuperHyperChord, Neutrosophic re-SuperHyperChord, 59

Neutrosophic v-SuperHyperChord, and Neutrosophic rv-SuperHyperChord and 60

cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 62

SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 63

a Neutrosophic V-SuperHyperChord if it’s either of Neutrosophic e-SuperHyperChord, 65

Neutrosophic re-SuperHyperChord, Neutrosophic v-SuperHyperChord, and 66

Neutrosophic rv-SuperHyperChord and C(N SHG) for a Neutrosophic 67

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

Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 69

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 70

SuperHyperVertices such that they form the Neutrosophic SuperHyperChord; an 71