Edge-Gap in SuperHyperGraphs

Edge-Gap In
SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures iv
List of Tables v
1 ABSTRACT 1
2 Background 11
Bibliography 17
3 Acknowledgements 41
4 Cancer In Extreme SuperHyperGraph 43
5 Extreme Edge-Gap 47
6 New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s

Recognition With (Neutrosophic) SuperHyperGraph 49
7 ABSTRACT 51
8 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 57
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61
10 Extreme SuperHyperEdge-Gap But As The Extensions Excerpt From

Dense And Super Forms 71
11 The Extreme Departures on The Theoretical Results Toward Theoretical

Motivations 113
iii
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
12 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 123
13 Extreme Applications in Cancer’s Extreme Recognition 135
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

ite as Extreme SuperHyperModel 137
15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

Multipartite as Extreme SuperHyperModel 139
16 Wondering Open Problems But As The Directions To Forming The

Motivations 141
17 Conclusion and Closing Remarks 143
18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

And Super Forms 159
20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

And Super Forms 187
22 Extreme SuperHyperConnected But As The Extensions Excerpt From

23 Background 215
Bibliography 221
24 Cancer In Neutrosophic SuperHyperGraph 245
25 Neutrosophic Edge-Gap 249
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Edge-Gap As Hyper Gape On Super Gab 251
27 ABSTRACT 253
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 259
29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 263

30 Neutrosophic SuperHyperEdge-Gap But As The Extensions Excerpt From

31 The Neutrosophic Departures on The Theoretical Results Toward

Theoretical Motivations 315
32 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 325
33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 337
34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

perBipartite as Neutrosophic SuperHyperModel 339
35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

SuperHyperMultipartite as Neutrosophic SuperHyperModel 341
36 Wondering Open Problems But As The Directions To Forming The

Motivations 343
37 Conclusion and Closing Remarks 345
38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 403
43 Background 417
Bibliography 423
44 Books’ Contributions 447
45 “SuperHyperGraph-Based Books”: | Featured Tweets 459
46 CV 487

List of Figures
10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

SuperHyperEdge-Gap in the Extreme Example (42.0.3) . . . . . . . . . . . . . . . . 77
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperEdge-

Gap in the Example (42.0.5) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperEdge-Gap in the Extreme Example (42.0.7) . . . . . . . . . . . . . . . . . 116
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperEdge-Gap in the Extreme Example (42.0.9) . . . . . . . . . . . . . . . . . 117
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperEdge-Gap in the Example (42.0.11) . . . . . . . . . . . . . . . . 119
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperEdge-Gap in the Example (42.0.13) . . . . . . . . . . . . . . . . . . . . . 121
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperEdge-Gap in the Extreme Example (42.0.15) . . . . . . . . . . . 122
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEdge-Gap . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.3) . . . . . . 279

30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperEdge-Gap in the Example (42.0.5) . . . . . . . . . . . . . . . . . . . . . . 316
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEdge-Gap in the Example (42.0.11) . . . . . . . 321
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperEdge-Gap in the Example (42.0.13) . . . . . . . . . . . . . . . . . . . . . 323
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.15) 324
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic


44.1 Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7923632). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 448
10.5281/zenodo.7923632). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 449
10.5281/zenodo.7923632). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 449
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi:
10.5281/zenodo.7916595). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 450
10.5281/zenodo.7916595). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 451
10.5281/zenodo.7916595). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 451
44.7 [HG171b] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7923786). . . . . . . . . . . . . . . . . . . . . . . . . . . 455
2023 (doi: 10.5281/zenodo.7923786). . . . . . . . . . . . . . . . . . . . . . . . . . . 456
2023 (doi: 10.5281/zenodo.7923786). . . . . . . . . . . . . . . . . . . . . . . . . . . 457
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 460

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 461
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 462
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 468



List of Tables
9.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23) 70
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 70

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 138

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 140
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 144

Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 272

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 340

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 342
37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 346
xi
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme 1
Edge-Gap In SuperHyperGraphs” and “Neutrosophic Edge-Gap In SuperHyperGraphs” about 2
some scientific research on Edge-Gap In SuperHyperGraphs by two (Extreme/Neutrosophic) 3

notions, namely, Extreme Edge-Gap In SuperHyperGraphs and Neutrosophic Edge-Gap In 4
SuperHyperGraphs. With scientific research on the basic scientific research properties, the 5
scientific research book starts to make Extreme Edge-Gap In SuperHyperGraphs theory 6
and Neutrosophic Edge-Gap In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 7
understandable. 8
9
In the some chapters, in some researches, new setting is introduced for new SuperHyperNotions, 10
namely, a Edge-Gap In SuperHyperGraphs and Neutrosophic Edge-Gap In SuperHyperGraphs . 11
Two different types of SuperHyperDefinitions are debut for them but the scientific research 12
goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based 13
on that are well-defined and well-reviewed. The literature review is implemented in the 14
whole of this research. For shining the elegancy and the significancy of this research, the 15
comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental 16
SuperHyperNumbers are featured. The definitions are followed by the examples and the 17
instances thus the clarifications are driven with different tools. The applications are figured out 18
to make sense about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” 19
are the under scientific research to figure out the challenges make sense about ongoing and 20
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 21
different types of them. Some of them are individuals and some of them are well-modeled by 22
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 23
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 24
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s 25
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 26
scientific research on theoretical segments and “Cancer’s Recognition”. Some avenues are 27
posed to pursue this research. It’s also officially collected in the form of some questions and 28
some problems. Assume a SuperHyperGraph. Then δ−Edge-Gap In SuperHyperGraphs 29
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 30
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 31
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 32
The first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, 33
1
holds if S is an δ−SuperHyperDefensive; a Neutrosophic δ−Edge-Gap In SuperHyperGraphs 34

is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 35
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 36
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 37
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 38
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 39
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 40

Edge-Gap In SuperHyperGraphs . Since there’s more ways to get type-results to make a 41
Edge-Gap In SuperHyperGraphs more understandable. For the sake of having Neutrosophic 42
Edge-Gap In SuperHyperGraphs, there’s a need to “redefine” the notion of a “Edge-Gap In 43
SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 44
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 45
of labels to assign to the values. Assume a Edge-Gap In SuperHyperGraphs . It’s redefined 46

a Neutrosophic Edge-Gap In SuperHyperGraphs if the mentioned Table holds, concerning, 47
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 48
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 49
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 50
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 51
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 52
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 53
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on a 54
Edge-Gap In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the foundation 55
of previous definition in the kind of SuperHyperClass. If there’s a need to have all Edge-Gap 56
In SuperHyperGraphs until the Edge-Gap In SuperHyperGraphs, then it’s officially called a 57
“Edge-Gap In SuperHyperGraphs” but otherwise, it isn’t a Edge-Gap In SuperHyperGraphs . 58

There are some instances about the clarifications for the main definition titled a “Edge-Gap 59
In SuperHyperGraphs ”. These two examples get more scrutiny and discernment since there 60
are characterized in the disciplinary ways of the SuperHyperClass based on a Edge-Gap In 61
SuperHyperGraphs . For the sake of having a Neutrosophic Edge-Gap In SuperHyperGraphs, 62
there’s a need to “redefine” the notion of a “Neutrosophic Edge-Gap In SuperHyperGraphs” 63
and a “Neutrosophic Edge-Gap In SuperHyperGraphs ”. The SuperHyperVertices and the 64

SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 65
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 66
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table 67
holds. And a Edge-Gap In SuperHyperGraphs are redefined to a “Neutrosophic Edge-Gap In 68
SuperHyperGraphs” if the intended Table holds. It’s useful to define “Neutrosophic” version 69
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 70
Neutrosophic Edge-Gap In SuperHyperGraphs more understandable. Assume a Neutrosophic 71
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 72
Thus SuperHyperPath, Edge-Gap In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, 73
SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neut- 74
rosophic Edge-Gap In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic 75

SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHy- 76
perWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic Edge-Gap 77
In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 78
the Edge-Gap In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices 79

from a Edge-Gap In SuperHyperGraphs .] Edge-Gap In SuperHyperGraphs . A graph is a 80

SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 81
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 82
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 83
SuperHyperEdges with two exceptions; it’s Edge-Gap In SuperHyperGraphs if it’s only one 84
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 85
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 86
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 87
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 88
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 89
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 90
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 91
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 92
the specific designs and the specific architectures. The SuperHyperModel is officially called 93
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 94
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 95
and the common and intended properties between “specific” cells and “specific group” of cells 96
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 97
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 98
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 99
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 100
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 101
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 102
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 103
identified since there are some determinacy, indeterminacy and neutrality about the moves 104
and the effects of the cancer on that region; this event leads us to choose another model [it’s 105
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 106
and what’s done. There are some specific models, which are well-known and they’ve got the 107
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 108
cancer on the complex tracks and between complicated groups of cells could be fantasized 109
by a Neutrosophic SuperHyperPath(-/Edge-Gap In SuperHyperGraphs, SuperHyperStar, 110

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 111
the longest Edge-Gap In SuperHyperGraphs or the strongest Edge-Gap In SuperHyperGraphs 112
in those Neutrosophic SuperHyperModels. For the longest Edge-Gap In SuperHyperGraphs, 113
called Edge-Gap In SuperHyperGraphs, and the strongest Edge-Gap In SuperHyperGraphs, 114
called Neutrosophic Edge-Gap In SuperHyperGraphs, some general results are introduced. 115
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 116
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 117
style of a Edge-Gap In SuperHyperGraphs. There isn’t any formation of any Edge-Gap In 118
SuperHyperGraphs but literarily, it’s the deformation of any Edge-Gap In SuperHyperGraphs. 119
It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory 120
and Neutrosophic SuperHyperGraph theory are proposed. 121

Keywords: SuperHyperGraph, (Neutrosophic) Edge-Gap In SuperHyperGraphs, Cancer’s 122
Recognition 123
AMS Subject Classification: 05C17, 05C22, 05E45 124

125
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 126
Notion, namely, Neutrosophic Edge-Gap In SuperHyperGraphs . Two different types of 127
SuperHyperDefinitions are debut for them but the scientific research goes further and the 128
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 129
and well-reviewed. The literature review is implemented in the whole of this research. For 130
shining the elegancy and the significancy of this research, the comparison between this SuperHy- 131
perNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. 132
The definitions are followed by the examples and the instances thus the clarifications are driven 133
with different tools. The applications are figured out to make sense about the theoretical aspect 134
of this ongoing research. The “Cancer’s Neutrosophic Recognition” are the under scientific 135
research to figure out the challenges make sense about ongoing and upcoming research. The 136
special case is up. The cells are viewed in the deemed ways. There are different types of them. 137
Some of them are individuals and some of them are well-modeled by the group of cells. These 138
types are all officially called “SuperHyperVertex” but the relations amid them all officially called 139
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” 140
are chosen and elected to scientific research about “Cancer’s Neutrosophic Recognition”. Thus 141
these complex and dense SuperHyperModels open up some avenues to scientific research on 142
theoretical segments and “Cancer’s Neutrosophic Recognition”. Some avenues are posed to 143
pursue this research. It’s also officially collected in the form of some questions and some 144
problems. Assume a SuperHyperGraph. Then an “δ−Edge-Gap In SuperHyperGraphs” is a 145
maximal Edge-Gap In SuperHyperGraphs of SuperHyperVertices with maximum cardinality 146
such that either of the following expressions hold for the (Neutrosophic) cardinalities of Super- 147
HyperNeighbors of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 148
The first Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, 149
holds if S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Edge-Gap In SuperHyperGraphs” 150
is a maximal Neutrosophic Edge-Gap In SuperHyperGraphs of SuperHyperVertices with 151
maximum Neutrosophic cardinality such that either of the following expressions hold for 152
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 153
|S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 154
The first Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second 155
Expression, holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define 156
“Neutrosophic” version of Edge-Gap In SuperHyperGraphs . Since there’s more ways to get 157
type-results to make Edge-Gap In SuperHyperGraphs more understandable. For the sake of 158
having Neutrosophic Edge-Gap In SuperHyperGraphs, there’s a need to “redefine” the notion 159
of “Edge-Gap In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are 160

assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 161
of the position of labels to assign to the values. Assume a Edge-Gap In SuperHyperGraphs 162
. It’s redefined Neutrosophic Edge-Gap In SuperHyperGraphs if the mentioned Table holds, 163
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 164
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 165
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 166
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 167
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 168
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 169
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 170

Edge-Gap In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the foundation 171
of previous definition in the kind of SuperHyperClass. If there’s a need to have all Edge-Gap 172
In SuperHyperGraphs until the Edge-Gap In SuperHyperGraphs, then it’s officially called 173
“Edge-Gap In SuperHyperGraphs” but otherwise, it isn’t Edge-Gap In SuperHyperGraphs . 174
There are some instances about the clarifications for the main definition titled “Edge-Gap 175
In SuperHyperGraphs ”. These two examples get more scrutiny and discernment since there 176
are characterized in the disciplinary ways of the SuperHyperClass based on Edge-Gap In 177
SuperHyperGraphs . For the sake of having Neutrosophic Edge-Gap In SuperHyperGraphs, 178
there’s a need to “redefine” the notion of “Neutrosophic Edge-Gap In SuperHyperGraphs” 179
and “Neutrosophic Edge-Gap In SuperHyperGraphs ”. The SuperHyperVertices and the 180
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic Super- 182
HyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And 183
Edge-Gap In SuperHyperGraphs are redefined “Neutrosophic Edge-Gap In SuperHyperGraphs” 184
if the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 185
Since there’s more ways to get Neutrosophic type-results to make Neutrosophic Edge-Gap In 186
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 187
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 188
Edge-Gap In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMulti- 189

Partite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Edge-Gap 190
In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 191
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 192
Table holds. A SuperHyperGraph has “Neutrosophic Edge-Gap In SuperHyperGraphs” where 193
it’s the strongest [the maximum Neutrosophic value from all Edge-Gap In SuperHyperGraphs 194
amid the maximum value amid all SuperHyperVertices from a Edge-Gap In SuperHyperGraphs 195
.] Edge-Gap In SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph 196
and the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 197
SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s 198
only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; 199
it’s Edge-Gap In SuperHyperGraphs if it’s only one SuperVertex as intersection amid two 200
given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid 201
all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 202
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 203
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 204
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 205
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 206
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 207
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 208
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 209
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 210
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 211
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 212
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 213
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 214
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 215
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 216

ways. The Neutrosophic recognition of the cancer in the long-term function. The specific region 217
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 218
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 219
identified since there are some determinacy, indeterminacy and neutrality about the moves 220
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 224
cancer on the complex tracks and between complicated groups of cells could be fantasized 225
by a Neutrosophic SuperHyperPath(-/Edge-Gap In SuperHyperGraphs, SuperHyperStar, 226
the longest Edge-Gap In SuperHyperGraphs or the strongest Edge-Gap In SuperHyperGraphs 228
in those Neutrosophic SuperHyperModels. For the longest Edge-Gap In SuperHyperGraphs, 229

called Edge-Gap In SuperHyperGraphs, and the strongest Edge-Gap In SuperHyperGraphs, 230
called Neutrosophic Edge-Gap In SuperHyperGraphs, some general results are introduced. 231
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 232
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 233
style of a Edge-Gap In SuperHyperGraphs. There isn’t any formation of any Edge-Gap In 234
SuperHyperGraphs but literarily, it’s the deformation of any Edge-Gap In SuperHyperGraphs. 235
It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory 236
and Neutrosophic SuperHyperGraph theory are proposed. 237
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Edge-Gap In SuperHyperGraphs, 238
Cancer’s Neutrosophic Recognition 239

241
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 242
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 243
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 244
Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 245
United State. This research book covers different types of notions and settings in neutrosophic 246
graph theory and neutrosophic SuperHyperGraph theory. 247
248
249
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 250
cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 251
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 252
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 253
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 254
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 255

256
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 257
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 258
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 259
Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 260
33131 United States. This research book presents different types of notions SuperHyperResolving 261

and Edge-Gap In SuperHyperGraphs in the setting of duality in neutrosophic graph theory and 262
neutrosophic SuperHyperGraph theory. This research book has scrutiny on the complement of 263
the intended set and the intended set, simultaneously. It’s smart to consider a set but acting on 264
its complement that what’s done in this research book which is popular in the terms of high 265
readers in Scribd. 266
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 267
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 268
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 269
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 270
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 271
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 272




CHAPTER 2 273
Background 274
There are some scientific researches covering the topic of this research. In what follows, there 275
are some discussion and literature reviews about them. 276
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 277
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 278
Neutrosophic Super Hyper Classes” in Ref. [HG1] by Henry Garrett (2022). In this research 279
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 280
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 281
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 282
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 283

abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 284
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph 285
and SuperHyperGraph. It’s the breakthrough toward independent results based on initial 286
background and fundamental SuperHyperNumbers. 287
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co- 288
Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 289
Applications in Cancer’s Treatments” in Ref. [HG2] by Henry Garrett (2023). In this research 290
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 291
perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 292
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 293
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 294
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 295
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 296
toward independent results based on initial background and fundamental SuperHyperNumbers. 297
The seminal paper and groundbreaking article is titled “A Research on Cancer’s Recognition 298
and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets 299
as Hyper Covering Versus Super separations” in Ref. [HG3] by Henry Garrett (2023). In 300
this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 301
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Recognition. 302
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 303
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 304
11
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutro- 308
sophic degree alongside chromatic numbers in the setting of some classes related to neutrosophic 309
hypergraphs” in Ref. [HG93] by Henry Garrett (2023). In this research article, a novel 310
approach is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based 311
on general forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s 312
published in prestigious and fancy journal is entitled “Journal of Current Trends in Com- 313
puter Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” 314
in volume 2 and issue 1 with pages 16-24. The research article studies deeply with choosing 315
neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough 316
toward independent results based on initial background. In some articles are titled “0039 | 317
Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside 318
(Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry Garrett 319
(2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] by 320

Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 321
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. 322
[HG6] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside The 323
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 324
SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [HG7] by Henry Garrett (2022), 325
“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic 326

SuperHyperGraphs” in Ref. [HG8] by Henry Garrett (2022), “The Shift Paradigm To Classify 327
Separately The Cells and Affected Cells Toward The Totality Under Cancer’s Recognition By 328
New Multiple Definitions On the Sets Polynomials Alongside Numbers In The (Neutrosophic) 329
SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” 330
in Ref. [HG9] by Henry Garrett (2022), “Breaking the Continuity and Uniformity of Cancer 331
In The Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s 332
Recognition Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett 333
(2022), “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 334
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. 335
[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Cir- 336
cumstances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. 337
[HG12] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 338

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), 339
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act 340
on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry 341
Garrett (2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 342
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 343

[HG15] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recogni- 344
tion by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by 345
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 346
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 347
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 348
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 349

SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 350
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 351
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 352
SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 353

SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 354

perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 355
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 356
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 357
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 358
rHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some 359
SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and Su- 360

perHyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry 361
Garrett (2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHy- 362
perGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. 363
[HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials 364
To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry 365
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s 366
Extreme Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial 367
on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme 368
Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Con- 369
nections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” 370
in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 371
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 372
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 373
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 374
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 375
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 376
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 377
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 378
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 379
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 380
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 381
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 382
in Ref. [HG31] by Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To 383
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 384

ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 385
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 386
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 387
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 388
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 389
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 390
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 391
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyper- 392
Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 393
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 394
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 395
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHy- 396
perGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; 397
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 398
HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; 399

HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; 401
HG260; HG261; HG262; HG263], there are some endeavors to formalize the basic Super- 416
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 417
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 418
HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 419
HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; HG106b; 422
HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; HG114b; 423

HG163b; HG164b; HG165b; HG166b; HG167b; HG168b; HG169b; HG170b]. Two 430
popular scientific research books in Scribd in the terms of high readers, 4190 and 5189 respect- 431
ively, on neutrosophic science is on [HG32b; HG44b]. 432
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 433
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 434
more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 435
by Dr. Henry Garrett. This research book covers different types of notions and settings in 436
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 437
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 438
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 439
has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 440
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 441
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 442
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 443
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 444
that what’s done in this research book which is popular in the terms of high readers in Scribd. 445

See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 446
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 447
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 448
HG261; HG262; HG263] alongside scientific research books at [HG60b; HG61b; HG62b; 467

HG166b; HG167b; HG168b; HG169b; HG170b]. Two popular scientific research books 480
in Scribd in the terms of high readers, 4331 and 5327 respectively, on neutrosophic science is on 481
[HG32b; HG44b]. 482

Bibliography 483
HG1 [1] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 484
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 485
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 486
10.33140/JMTCM.01.03.09) 487
HG2 [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 488
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 489
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 490
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 491
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 492
alongside-a.pdf) 493
HG3 [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 494
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 495
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 496
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 497

recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 498
hamiltonian-sets-.pdf) 499
HG93 [4] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 500
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 501
Trends Comp Sci Res 2(1) (2023) 16-24. (https://www.opastpublishers.com/open-access- 502
articles/neutrosophic-codegree-and-neutrosophic-degree-alongside-chromatic-numbers- 503
in-the-setting-of-some-classes-related-to-neut.pdf) 504
HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 505
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 506
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 507
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 508

https://oa.mg/work/10.5281/zenodo.6319942 509
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 510
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 511
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 512
https://oa.mg/work/10.13140/rg.2.2.35241.26724 513
17
HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 514
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 515
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 516
HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 517
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 518
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 519
10.20944/preprints202301.0282.v1). 520
HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 521
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 522
10.20944/preprints202301.0267.v1). 523
HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 524
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 525
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 526
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 527

(doi: 10.20944/preprints202301.0265.v1). 528
HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 529
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 530
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 531
prints202301.0262.v1). 532
HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 533
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 534
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 535
HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 536
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 537
2023010224, (doi: 10.20944/preprints202301.0224.v1). 538
HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 539
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 540
prints202301.0105.v1). 541
HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 542
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 543
HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 545
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 546
Preprints 2023, 2023010044 547
HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 548
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 549
10.20944/preprints202301.0043.v1). 550
HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 551
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 552

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 557
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 558
(doi: 10.20944/preprints202212.0549.v1). 559
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 560
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 561
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 562
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 563
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 564
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 565
(doi: 10.20944/preprints202212.0500.v1). 566
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 567
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 568
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 570
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 571
HG263 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 573
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 574
(doi: 10.5281/zenodo.7904698). 575
HG262 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 576
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 577
2023, (doi: 10.5281/zenodo.7904671). 578
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 580

Zenodo 2023, (doi: 10.5281/zenodo.7904529). 581
HG260 [28] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 582
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 583
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 584
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 586
10.5281/zenodo.7871026). 587
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 589
2023, (doi: 10.5281/zenodo.7874647). 590

By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 592
10.5281/zenodo.7857856). 593
HG256 [32] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 594
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 595
2023, (doi: 10.5281/zenodo.7857841). 596
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 598
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 601
HG253 [35] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 603
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 604
10.5281/zenodo.7853867). 605
HG252 [36] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 606
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 607
10.5281/zenodo.7853922). 608
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 610
(doi: 10.5281/zenodo.7851519). 611
HG250 [38] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 612
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 613
(doi: 10.5281/zenodo.7851550). 614
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 616
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 619
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 622
10.5281/zenodo.7834229). 623
HG246 [42] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 624
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 625
10.5281/zenodo.7834261). 626
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 628
10.5281/zenodo.7824560). 629

HG244 [44] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 630
(doi: 10.5281/zenodo.7824623). 632
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 634
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 637
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 640
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 642
2023, (doi: 10.5281/zenodo.7809365). 643
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 645
2023, (doi: 10.5281/zenodo.7809358). 646
HG238 [50] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 647

10.5281/zenodo.7809219). 649
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 651
10.5281/zenodo.7809328). 652
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 654
2023, (doi: 10.5281/zenodo.7806767). 655
HG235 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 656
2023, (doi: 10.5281/zenodo.7806838). 658
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 660
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 661
HG233 [55] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 662
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 663
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 664
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 666
10.5281/zenodo.7799902). 667

HG231 [57] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 668
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 669
(doi: 10.5281/zenodo.7804218). 670
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 672
(doi: 10.5281/zenodo.7796334). 673
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 675
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 678
10.5281/zenodo.7791952). 679
HG225 [61] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 680
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 681
10.5281/zenodo.7791982). 682
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 684
10.5281/zenodo.7790026). 685
HG223 [63] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 686
10.5281/zenodo.7790052). 688
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 690
2023, (doi: 10.5281/zenodo.7787066). 691
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 693
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 694
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 696
10.5281/zenodo.7781476). 697
HG219 [67] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 698
10.5281/zenodo.7783082). 700
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 702
10.5281/zenodo.7777857). 703
HG217 [69] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 704
10.5281/zenodo.7779286). 706

HG215 [70] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 707
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 708
(doi: 10.5281/zenodo.7771831). 709
HG214 [71] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 710
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 711
2023, (doi: 10.5281/zenodo.7772468). 712
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 714
10.13140/RG.2.2.20913.25446). 715
HG212 [73] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 716
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 717
odo.7764916). 718
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 720
10.13140/RG.2.2.11770.98247). 721
HG210 [75] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 722
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 723
10.13140/RG.2.2.12400.12808). 724
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 726
2023, (doi: 10.13140/RG.2.2.22545.10089). 727
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 729
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 730
HG207 [78] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 731
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 732
10.13140/RG.2.2.11377.76644). 733
HG206 [79] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 734
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 735
10.13140/RG.2.2.23750.96329). 736
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 738
10.13140/RG.2.2.31366.24641). 739
HG204 [81] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 740
10.13140/RG.2.2.34721.68960). 742
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 744
2023, (doi: 10.13140/RG.2.2.30212.81289). 745

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 747
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 750
10.13140/RG.2.2.24288.35842). 751
HG200 [85] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 752
10.13140/RG.2.2.32467.25124). 754
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.31025.45925). 757
HG198 [87] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 758
10.13140/RG.2.2.17184.25602). 760
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 762
10.13140/RG.2.2.23423.28327). 763
HG196 [89] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 764
10.13140/RG.2.2.28456.44805). 766
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 768
10.13140/RG.2.2.23525.68320). 769
HG194 [91] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 770
10.13140/RG.2.2.20170.24000). 772
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 774
10.13140/RG.2.2.36475.59683). 775
HG192 [93] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 776
10.13140/RG.2.2.29764.71046). 778
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 780
2023, (doi: 10.13140/RG.2.2.18780.87683). 781
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 783

Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 786
10.13140/RG.2.2.26134.01603). 787
HG188 [97] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 788
10.13140/RG.2.2.27392.30721). 790
HG187 [98] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 791
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 792
10.13140/RG.2.2.33028.40321). 793
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 795
10.13140/RG.2.2.21389.20966). 796
HG185 [100] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 797
10.13140/RG.2.2.16356.04489). 799
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 801
10.13140/RG.2.2.21756.21129). 802
HG183 [102] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 803
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 804
10.13140/RG.2.2.30983.68009). 805
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 807
10.13140/RG.2.2.28552.29445). 808
HG181 [104] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 809
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 810
(doi: 10.13140/RG.2.2.10936.21761). 811
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 813
10.13140/RG.2.2.35105.89447). 814
HG179 [106] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 815
(doi: 10.13140/RG.2.2.30072.72960). 817
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 819
10.13140/RG.2.2.31147.52003). 820
HG177 [108] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 821
10.13140/RG.2.2.32825.24163). 823

Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 825
10.13140/RG.2.2.13059.58401). 826
HG175 [110] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 827
10.13140/RG.2.2.11172.14720). 829
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 831
2023, (doi: 10.13140/RG.2.2.22011.80165). 832
HG173 [112] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 833
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 834
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 835
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 837
2023, (doi: 10.13140/RG.2.2.10493.84962). 838
HG171 [114] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 839
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 841
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 843
2023, (doi: 10.13140/RG.2.2.19944.14086). 844
HG169 [116] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 845
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 847
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 849
(doi: 10.13140/RG.2.2.33103.76968). 850
HG167 [118] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 851
(doi: 10.13140/RG.2.2.23037.44003). 853
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 855
(doi: 10.13140/RG.2.2.35646.56641). 856
HG165 [120] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 857
10.13140/RG.2.2.18030.48967). 859
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 861
(doi: 10.13140/RG.2.2.13973.81121). 862

HG163 [122] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 863
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 864
2023, (doi: 10.13140/RG.2.2.34106.47047). 865
HG162 [123] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 866
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 867
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 870
2023, (doi: 10.13140/RG.2.2.31956.88961). 871
HG160 [125] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 872
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 873
2023, (doi: 10.13140/RG.2.2.15179.67361). 874
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 876
10.13140/RG.2.2.21510.45125). 877
HG158 [127] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 878
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 879
2023, (doi: 10.13140/RG.2.2.13121.84321). 880
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 882
10.13140/RG.2.2.11758.69441). 883
HG156 [129] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 884
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 885
2023, (doi: 10.13140/RG.2.2.31891.35367). 886
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 888
10.13140/RG.2.2.19360.87048). 889
HG154 [131] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 890
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 891
10.13140/RG.2.2.32363.21286). 892
HG153 [132] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 893
10.13140/RG.2.2.23266.81602). 895
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 897
10.13140/RG.2.2.19911.37285). 898
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.11050.90569). 901

HG150 [135] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 902
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 903
2023, (doi: 10.13140/RG.2.2.17761.79206). 904
HG149 [136] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 905
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 906
HG148 [137] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 908
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 909
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 910
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 912
(doi: 10.13140/RG.2.2.30182.50241). 913
HG146 [139] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 914
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 915
HG145 [140] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 917
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 918
HG144 [141] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 920
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 921
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 922
HG143 [142] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 923
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 924
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 925
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 928
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 931
HG140 [145] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 932
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 933
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 934
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 937
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 940

HG137 [148] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 941
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 942
HG136 [149] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 944
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 945
2023, (doi: 10.13140/RG.2.2.17252.24968). 946
HG135 [150] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 947
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 948
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 949
HG134 [151] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 950
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 951

HG132 [152] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 953
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 954
2023010396 (doi: 10.20944/preprints202301.0396.v1). 955
HG131 [153] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 956
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 957
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 958
HG130 [154] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 959
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 960
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 961
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 962
HG129 [155] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 963

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 964
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 965

HG128 [156] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 967
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 968
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 969
HG127 [157] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 970
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 971
2023,(doi: 10.13140/RG.2.2.36745.93289). 972
HG126 [158] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 973
HG125 [159] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 976
10.20944/preprints202301.0282.v1). 979

HG124 [160] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 980
10.20944/preprints202301.0267.v1).). 982
(doi: 10.20944/preprints202301.0265.v1). 987
HG122 [162] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 988
prints202301.0262.v1). 991

2023010224, (doi: 10.20944/preprints202301.0224.v1). 997
HG24 [165] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 998
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 999

10.13140/RG.2.2.35061.65767). 1000
HG25 [166] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1001
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1002
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1003

10.13140/RG.2.2.18494.15680). 1004
HG26 [167] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1005
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1006
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1007

10.13140/RG.2.2.32530.73922). 1008
HG27 [168] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1009
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1010
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1011

10.13140/RG.2.2.15897.70243). 1012

10.13140/RG.2.2.32530.73922). 1016
prints202301.0105.v1). 1019

HG28 [171] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1020
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1021
HG29 [172] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1023
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1024
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1025
10.13140/RG.2.2.23172.19849). 1026
HG30 [175] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1033
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1034
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1035
10.13140/RG.2.2.17385.36968). 1036
Preprints 2023, 2023010044 1039

10.20944/preprints202301.0043.v1). 1042
HG31 [178] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1043
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1044
2023, (doi: 10.13140/RG.2.2.28945.92007). 1045
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1050
10.13140/RG.2.2.35774.77123). 1051

HG35 [182] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1055
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1056
10.13140/RG.2.2.29430.88642). 1057


(doi: 10.20944/preprints202212.0549.v1). 1063
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1065
10.13140/RG.2.2.19380.94084). 1066
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1074
(doi: 10.20944/preprints202212.0500.v1). 1077
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1079

10.13140/RG.2.2.20993.12640). 1080
HG952 [190] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1081

HG95 [191] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1084
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1085
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1086
HG37 [194] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1093
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1094
10.13140/RG.2.2.29173.86244). 1095

HG38 [195] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1096
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1097
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1098
HG170b [196] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1099
2023 (doi: 10.5281/zenodo.7905287). 1100
HG169b [197] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1101
Garrett, 2023 (doi: 10.5281/zenodo.7904586). 1102
HG168b [198] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1103
2023 (doi: 10.5281/zenodo.7874677). 1104
HG167b [199] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1105
(doi: 10.5281/zenodo.7857906). 1106
HG166b [200] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1107
2023 (doi: 10.5281/zenodo.7856329). 1108
HG165b [201] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1109
10.5281/zenodo.7854561). 1110
HG164b [202] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1111
2023 (doi: 10.5281/zenodo.7851893). 1112
HG163b [203] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1113

HG162b [204] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1115
(doi: 10.5281/zenodo.7835063). 1116
HG161b [205] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1117
(doi: 10.5281/zenodo.7826705). 1118
HG160b [206] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1119
2023 (doi: 10.5281/zenodo.7820680). 1120
HG159b [207] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1121
10.5281/zenodo.7812750). 1122
HG158b [208] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1123

HG157b [209] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1125

HG156b [210] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1127
2023 (doi: 10.5281/zenodo.7807782). 1128
HG155b [211] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1129
2023 (doi: 10.5281/zenodo.7804449). 1130

HG154b [212] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1131

HG153b [213] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1133
(doi: 10.5281/zenodo.7792307). 1134
HG152b [214] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1135
(doi: 10.5281/zenodo.7790728). 1136
HG151b [215] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1137
2023 (doi: 10.5281/zenodo.7787712). 1138
HG150b [216] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1139
10.5281/zenodo.7783791). 1140
HG149b [217] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1141
10.5281/zenodo.7780123). 1142
HG148b [218] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1143
(doi: 10.5281/zenodo.7773119). 1144
HG147b [219] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1145
odo.7637762). 1146
HG146b [220] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1147
10.5281/zenodo.7766174). 1148
HG145b [221] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1149
10.5281/zenodo.7762232). 1150
HG144b [222] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1151
(doi: 10.5281/zenodo.7758601). 1152
HG143b [223] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1153
10.5281/zenodo.7754661). 1154
HG142b [224] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1155
10.5281/zenodo.7750995) . 1156
HG141b [225] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1157
(doi: 10.5281/zenodo.7749875). 1158
HG140b [226] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1159
10.5281/zenodo.7747236). 1160
HG139b [227] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1161
10.5281/zenodo.7742587). 1162
HG138b [228] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1163
(doi: 10.5281/zenodo.7738635). 1164
HG137b [229] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1165
10.5281/zenodo.7734719). 1166

HG136b [230] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1167
10.5281/zenodo.7730484). 1168
HG135b [231] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1169
(doi: 10.5281/zenodo.7730469). 1170
HG134b [232] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1171
10.5281/zenodo.7722865). 1172
HG133b [233] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1173
odo.7713563). 1174
odo.7709116). 1176
HG131b [235] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1177
10.5281/zenodo.7706415). 1178
HG130b [236] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1179
10.5281/zenodo.7706063). 1180
HG129b [237] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1181
10.5281/zenodo.7701906). 1182
HG128b [238] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1183
odo.7700205). 1184
HG127b [239] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7694876). 1186
HG126b [240] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1187
10.5281/zenodo.7679410). 1188
HG125b [241] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1189
10.5281/zenodo.7675982). 1190
HG124b [242] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1191
10.5281/zenodo.7672388). 1192
HG123b [243] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1193
odo.7668648). 1194
HG122b [244] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1195
10.5281/zenodo.7662810). 1196
HG121b [245] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1197
10.5281/zenodo.7659162). 1198
HG120b [246] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1199
odo.7653233). 1200
HG119b [247] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1201
odo.7653204). 1202

HG118b [248] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1203
odo.7653142). 1204
HG117b [249] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1205
odo.7653117). 1206
HG116b [250] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1207
HG115b [251] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7651687). 1209
HG114b [252] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1210
odo.7651619). 1211
HG113b [253] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1212
odo.7651439). 1213
HG112b [254] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1214
odo.7650729). 1215
HG111b [255] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1216
odo.7647868). 1217
HG110b [256] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1218
odo.7647017). 1219
HG109b [257] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1220
odo.7644894). 1221
HG108b [258] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1222
HG107b [259] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1223
odo.7632923). 1224
HG106b [260] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1225
odo.7623459). 1226
HG105b [261] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1227
10.5281/zenodo.7606416). 1228
HG104b [262] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7606416). 1230
HG103b [263] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1231
odo.7606404). 1232
HG102b [264] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1233
10.5281/zenodo.7580018). 1234
HG101b [265] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1235
odo.7580018). 1236

odo.7580018). 1238
odo.7579929). 1240
HG98b [268] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7563170). 1242
HG97b [269] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1243
odo.7563164). 1244
HG96b [270] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1245
odo.7563160). 1246
odo.7563160). 1248
HG94b [272] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1249
10.5281/zenodo.7563160). 1250
HG93b [273] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1251
10.5281/zenodo.7557063). 1252
HG92b [274] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1253
10.5281/zenodo.7557009). 1254
HG91b [275] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7539484). 1256
HG90b [276] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1257
10.5281/zenodo.7523390). 1258
HG89b [277] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1259
10.5281/zenodo.7523390). 1260
HG88b [278] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1261
10.5281/zenodo.7523390). 1262
HG87b [279] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1263
odo.7574952). 1264
HG86b [280] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1265
10.5281/zenodo.7574992). 1266
odo.7523357). 1268
HG84b [282] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1269
10.5281/zenodo.7523357). 1270
HG83b [283] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1271
10.5281/zenodo.7504782). 1272

HG82b [284] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1273
10.5281/zenodo.7504782). 1274
HG81b [285] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1275
10.5281/zenodo.7504782). 1276
HG80b [286] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1277
10.5281/zenodo.7499395). 1278
HG79b [287] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1279
odo.7499395). 1280
HG78b [288] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1281
10.5281/zenodo.7499395). 1282
HG77b [289] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1283
10.5281/zenodo.7497450). 1284
HG76b [290] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1285
10.5281/zenodo.7497450). 1286
HG75b [291] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1287
10.5281/zenodo.7494862). 1288
HG74b [292] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1289
odo.7494862). 1290
HG73b [293] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1291
10.5281/zenodo.7494862). 1292
HG72b [294] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1293
10.5281/zenodo.7493845). 1294
HG71b [295] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1295
odo.7493845). 1296
HG70b [296] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1297
10.5281/zenodo.7493845). 1298
HG69b [297] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1299
odo.7539484). 1300
HG68b [298] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1301
odo.7523390). 1302
HG67b [299] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1303
odo.7523357). 1304
HG66b [300] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1305
odo.7504782). 1306
HG65b [301] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1307
odo.7499395). 1308

HG64b [302] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1309
odo.7497450). 1310
HG63b [303] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1311
odo.7494862). 1312
HG62b [304] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1313
odo.7493845). 1314
HG61b [305] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1315
odo.7480110). 1316
HG60b [306] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1317
odo.7378758). 1318
HG32b [307] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1319
odo.6320305). 1320
HG44b [308] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1321
odo.6677173). 1322

CHAPTER 3 1323
Acknowledgements 1324
The author is going to express his gratitude and his appreciation about the brains and their 1325
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1326
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1327 words of mind and th
to have the material and the contents which are only the way to flourish the minds, to grow minds of words, are too
1328
eligible to be in the stage
the notions, to advance the ways and to make the stable ways to be amid events and storms of 1329
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1330
ideas to be on the star lines of words and shining like stars, forever. 1331
41
CHAPTER 4 1332
Cancer In Extreme SuperHyperGraph 1333
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1334
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1335
as the consequences of the model, some parameters are used. The cells are under attack of this 1336
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1337
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1338
In the following, some Extreme steps are Extreme devised on this disease. 1339
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1340
function. 1341
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1342
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1343
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1344
since there are some determinacy, indeterminacy and neutrality about the moves and the 1345
effects of the cancer on that region; this event leads us to choose another model [it’s said 1346
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1347
what’s done. 1348
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1349
they’ve got the names, and some general Extreme models. The moves and the Extreme 1350
traces of the cancer on the complex tracks and between complicated groups of cells could be 1351
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1352
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1353
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1354
in those Extreme Extreme SuperHyperModels. 1355
Some cells have been faced with some attacks from the situation which is caused by the 1356
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1357
which in that, the cells could be labelled as some groups and some groups or individuals have 1358
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1359
the embedded situations, the individuals of cells and the groups of cells could be considered 1360
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1361
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1362
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1363
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1364
43
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1365
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1366
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1367
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1368
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1369
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1370
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1371

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1372
is going to figure out what’s going on this phenomenon. The special case of this disease is 1373
considered and as the consequences of the model, some parameters are used. The cells are 1374
under attack of this disease but the moves of the cancer in the special region are the matter of 1375
mind. The recognition of the cancer could help to find some treatments for this disease. The 1376
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1377
Recognition” and both bases are the background of this research. Sometimes the cancer has 1378
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1379
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1380
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1381
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1382
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1383
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1384
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1385
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1386
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1387
and neutrality about the moves and the effects of the cancer on that region; this event leads 1388
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1389
perception on what’s happened and what’s done. There are some specific models, which 1390
are well-known and they’ve got the names, and some general models. The moves and the 1391
traces of the cancer on the complex tracks and between complicated groups of cells could 1392
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1393
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1394
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1395

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1396
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1397
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1398
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1399
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1400
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1401
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1402
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1403
based on the fixed groups of cells or the fixed groups of group of cells? 1404
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1405
messy and dense SuperHyperModels where embedded notions are illustrated? 1406
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1407
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1408
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1409

research has taken more motivations to define SuperHyperClasses and to find some connections 1410
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1411
instances and examples to make clarifications about the framework of this research. The general 1412
results and some results about some connections are some avenues to make key point of this 1413
research, “Cancer’s Recognition”, more understandable and more clear. 1414
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1415
on the modeling of the regions where are under the attacks of the cancer to recognize 1416
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1417
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1418
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1419
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1420
instances and literature reviews have taken the whole way through. In this scientific research, 1421
the literature reviews have fulfilled the lines containing the notions and the results. The 1422
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1423
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1424
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1425
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1426
of the moves of the cancer in the longest and strongest styles with the formation of the design 1427
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1428
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1429
out the background for the SuperHyperNotions. 1430

CHAPTER 5 1431
Extreme Edge-Gap 1432
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1433
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1434
2023, (doi: 10.13140/RG.2.2.34953.52320). 1435

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1436
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1437
(doi: 10.13140/RG.2.2.33275.80161). 1438
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1439
10.13140/RG.2.2.11050.90569). 1441
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1442
10.13140/RG.2.2.17761.79206). 1444
10.13140/RG.2.2.19911.37285). 1447
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1448
10.13140/RG.2.2.23266.81602). 1450
10.13140/RG.2.2.19360.87048). 1453
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1454
10.13140/RG.2.2.32363.21286). 1456
10.13140/RG.2.2.11758.69441). 1459
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1460
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1461
10.13140/RG.2.2.31891.35367). 1462
10.13140/RG.2.2.21510.45125). 1465
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1466
10.13140/RG.2.2.13121.84321). 1468

CHAPTER 6 1469
New Ideas On Super Gab By Hyper Gape 1470
Of Edge-Gap In Cancer’s Recognition 1471
With (Neutrosophic) SuperHyperGraph 1472
49
CHAPTER 7 1473
ABSTRACT 1474
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEdge-Gap). 1475
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Edge-Gap pair S = (V, E). Consider 1476
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 1477
V 0 or E 0 is called Neutrosophic e-SuperHyperEdge-Gap if the following expression is called 1478
Neutrosophic e-SuperHyperEdge-Gap criteria holds 1479
Ea makes connectivity components;
Neutrosophic re-SuperHyperEdge-Gap if the following expression is called Neutrosophic e- 1480

SuperHyperEdge-Gap criteria holds 1481
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic v- 1482

SuperHyperEdge-Gap if the following expression is called Neutrosophic v-SuperHyperEdge-Gap 1483
criteria holds 1484
Va makes connectivity components;
Neutrosophic rv-SuperHyperEdge-Gap if the following expression is called Neutrosophic v- 1485

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic 1487

SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, Neutrosophic re- 1488
SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge- 1489
Gap. ((Neutrosophic) SuperHyperEdge-Gap). Assume a Neutrosophic SuperHyperGraph (NSHG) 1490
S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 1491
Then E is called an Extreme SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge- 1492

Gap, Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, and Neutrosophic 1493
rv-SuperHyperEdge-Gap and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the 1494
maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 1495
of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHy- 1496
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEdge- 1497
Gap; a Neutrosophic SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 1498
51
Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, and Neutrosophic 1499

rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 1500
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1501
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 1502
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEdge- 1503
Gap; an Extreme SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neutrosophic 1504
e-SuperHyperEdge-Gap, Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, 1505

and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) for an Extreme SuperHyperGraph 1506
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 1507
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 1508
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHy- 1509
Gap; and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 1511
SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 1512
rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 1514
is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined 1515
as the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 1516
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1517

utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1518
form the Neutrosophic SuperHyperEdge-Gap; and the Neutrosophic power is corresponded to 1519
its Neutrosophic coefficient; an Extreme V-SuperHyperEdge-Gap if it’s either of Neutrosophic 1520
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1523
Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 1524
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1525
Extreme SuperHyperEdge-Gap; a Neutrosophic V-SuperHyperEdge-Gap if it’s either of Neutrosophic 1526
and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic SuperHyperGraph 1528
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 1529
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 1530
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1531
the Neutrosophic SuperHyperEdge-Gap; an Extreme V-SuperHyperEdge-Gap SuperHyperPolyno- 1532
mial if it’s either of Neutrosophic e-SuperHyperEdge-Gap, Neutrosophic re-SuperHyperEdge-Gap, 1533
Neutrosophic v-SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) 1534

for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1535
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1536
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1537
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1538
they form the Extreme SuperHyperEdge-Gap; and the Extreme power is corresponded to its 1539
Extreme coefficient; a Neutrosophic SuperHyperEdge-Gap SuperHyperPolynomial if it’s either 1540

of Neutrosophic e-SuperHyperEdge-Gap, Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v- 1541
SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic 1542
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1543
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1544

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 1545

high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1546
SuperHyperVertices such that they form the Neutrosophic SuperHyperEdge-Gap; and the Neut- 1547
rosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1548
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperEdge-Gap and 1549
Neutrosophic SuperHyperEdge-Gap. Two different types of SuperHyperDefinitions are debut 1550
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1551
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1552
implemented in the whole of this research. For shining the elegancy and the significancy of this 1553
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1554
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1555
and the instances thus the clarifications are driven with different tools. The applications are 1556
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1557
Recognition” are the under research to figure out the challenges make sense about ongoing and 1558
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 1559
are different types of them. Some of them are individuals and some of them are well-modeled 1560
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 1561
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 1562
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 1563
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 1565
this research. It’s also officially collected in the form of some questions and some problems. 1566
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEdge-Gap is 1567
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1568

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1570
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1571
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEdge-Gap is a maximal 1572
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 1573
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 1574
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1575

if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1577
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1578
SuperHyperEdge-Gap . Since there’s more ways to get type-results to make a SuperHyperEdge-Gap 1579
more understandable. For the sake of having Neutrosophic SuperHyperEdge-Gap, there’s a 1580
need to “redefine” the notion of a “SuperHyperEdge-Gap ”. The SuperHyperVertices and the 1581
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperEdge-Gap 1583
. It’s redefined a Neutrosophic SuperHyperEdge-Gap if the mentioned Table holds, concerning, 1584
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 1585
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 1586
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 1587

SuperHyperEdge-Gap . It’s the main. It’ll be disciplinary to have the foundation of previous 1592
definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperEdge-Gap 1593
until the SuperHyperEdge-Gap, then it’s officially called a “SuperHyperEdge-Gap” but otherwise, 1594
it isn’t a SuperHyperEdge-Gap . There are some instances about the clarifications for the main 1595
definition titled a “SuperHyperEdge-Gap ”. These two examples get more scrutiny and discernment 1596
since there are characterized in the disciplinary ways of the SuperHyperClass based on a 1597
SuperHyperEdge-Gap . For the sake of having a Neutrosophic SuperHyperEdge-Gap, there’s a 1598
need to “redefine” the notion of a “Neutrosophic SuperHyperEdge-Gap” and a “Neutrosophic 1599
SuperHyperEdge-Gap ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1600
labels from the letters of the alphabets. In this procedure, there’s the usage of the position of 1601
labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutro- 1602
sophic SuperHyperGraph” if the intended Table holds. And a SuperHyperEdge-Gap are redefined 1603
to a “Neutrosophic SuperHyperEdge-Gap” if the intended Table holds. It’s useful to define “Neutro- 1604
sophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results 1605
to make a Neutrosophic SuperHyperEdge-Gap more understandable. Assume a Neutrosophic 1606
Thus SuperHyperPath, SuperHyperEdge-Gap, SuperHyperStar, SuperHyperBipartite, SuperHy- 1608
perMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 1609

SuperHyperEdge-Gap”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 1610
Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEdge-Gap” where it’s the 1612
strongest [the maximum Neutrosophic value from all the SuperHyperEdge-Gap amid the max- 1613
imum value amid all SuperHyperVertices from a SuperHyperEdge-Gap .] SuperHyperEdge-Gap . 1614
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1615

SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1616
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1617
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEdge-Gap if it’s only one 1618
and the common and intended properties between “specific” cells and “specific group” of 1630
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1631
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1632
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1633
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 1634
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 1635
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 1636

of the move from the cancer is identified by this research. Sometimes the move of the cancer 1637
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 1638
about the moves and the effects of the cancer on that region; this event leads us to choose 1639
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 1640
on what’s happened and what’s done. There are some specific models, which are well-known 1641
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 1642
and the traces of the cancer on the complex tracks and between complicated groups of cells 1643
could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEdge-Gap, SuperHyperStar, 1644
the longest SuperHyperEdge-Gap or the strongest SuperHyperEdge-Gap in those Neutrosophic 1646
SuperHyperModels. For the longest SuperHyperEdge-Gap, called SuperHyperEdge-Gap, and the 1647
strongest SuperHyperEdge-Gap, called Neutrosophic SuperHyperEdge-Gap, some general results 1648
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 1649
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 1650
to form any style of a SuperHyperEdge-Gap. There isn’t any formation of any SuperHyperEdge-Gap 1651
but literarily, it’s the deformation of any SuperHyperEdge-Gap. It, literarily, deforms and it doesn’t 1652
form. A basic familiarity with Neutrosophic SuperHyperEdge-Gap theory, SuperHyperGraphs, 1653
and Neutrosophic SuperHyperGraphs theory are proposed. 1654
Keywords: SuperHyperGraph, SuperHyperEdge-Gap, Cancer’s Recognition 1655

CHAPTER 8 1657
Applied Notions Under The Scrutiny Of 1658
The Motivation Of This Scientific 1659
Research 1660
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1661
try to bring the motivations in the narrative ways. Some cells have been faced with some 1662
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1663
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1664
as some groups and some groups or individuals have excessive labels which all are raised from 1665
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1666
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1667
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1668
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1669
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1670
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1671
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1672
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1673
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1674
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1675
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1676
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1677
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1678
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1679
The special case of this disease is considered and as the consequences of the model, some 1680
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1681
the special region are the matter of mind. The recognition of the cancer could help to find some 1682
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1683
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1684
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1685
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1686
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 1687
the formation of the design and the architecture are formally called “ SuperHyperEdge-Gap” in 1688
the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1689
57
embedded styles to figure out the background for the SuperHyperNotions. The recognition 1690
of the cancer in the long-term function. The specific region has been assigned by the model 1691
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 1692
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 1693
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 1694
cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1695
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1696
are some specific models, which are well-known and they’ve got the names, and some general 1697
models. The moves and the traces of the cancer on the complex tracks and between complicated 1698
groups of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperEdge-Gap, 1699
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 1700
aim is to find either the optimal SuperHyperEdge-Gap or the Extreme SuperHyperEdge-Gap in 1701
those Extreme SuperHyperModels. Some general results are introduced. Beyond that in 1702
SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1703
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 1704
a SuperHyperEdge-Gap. There isn’t any formation of any SuperHyperEdge-Gap but literarily, it’s 1705
the deformation of any SuperHyperEdge-Gap. It, literarily, deforms and it doesn’t form. 1706
amount of SuperHyperEdge-Gap” of either individual of cells or the groups of cells based on the 1708
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEdge-Gap” based on 1709
the fixed groups of cells or the fixed groups of group of cells? 1710
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1711
messy and dense SuperHyperModels where embedded notions are illustrated? 1712
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1713
it motivates us to define different types of “ SuperHyperEdge-Gap” and “Extreme SuperHyperEdge- 1714
Gap” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the research has 1715
taken more motivations to define SuperHyperClasses and to find some connections amid 1716
this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances 1717
and examples to make clarifications about the framework of this research. The general results 1718
and some results about some connections are some avenues to make key point of this research, 1719
“Cancer’s Recognition”, more understandable and more clear. 1720
The framework of this research is as follows. In the beginning, I introduce basic definitions 1721
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1722
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1723
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1724
review literature are applied to make sense about what’s going to figure out about the 1725
upcoming sections. The main definitions and their clarifications alongside some results 1726
about new notions, SuperHyperEdge-Gap and Extreme SuperHyperEdge-Gap, are figured out 1727
in sections “ SuperHyperEdge-Gap” and “Extreme SuperHyperEdge-Gap”. In the sense of 1728

tackling on getting results and in Edge-Gap to make sense about continuing the research, the 1729
ideas of SuperHyperUniform and Extreme SuperHyperUniform are introduced and as their 1730
consequences, corresponded SuperHyperClasses are figured out to debut what’s done in this 1731
section, titled “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1732
As going back to origin of the notions, there are some smart steps toward the common 1733
notions to extend the new notions in new frameworks, SuperHyperGraph and Extreme 1734

SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on Extreme 1735

SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 1736
concluding and closing section of theoretical research are contained in the section “General 1737
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1738
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 1739
“ SuperHyperEdge-Gap”, “Extreme SuperHyperEdge-Gap”, “Results on SuperHyperClasses” and 1740
“Results on Extreme SuperHyperClasses”. There are curious questions about what’s done about 1741
the SuperHyperNotions to make sense about excellency of this research and going to figure 1742
out the word “best” as the description and adjective for this research as presented in section, 1743
“ SuperHyperEdge-Gap”. The keyword of this research debut in the section “Applications in 1744
Cancer’s Recognition” with two cases and subsections “Case 1: The Initial Steps Toward 1745
SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps Toward 1746
SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there are 1747

some scrutiny and discernment on what’s done and what’s happened in this research in the 1748
terms of “questions” and “problems” to make sense to figure out this research in featured style. 1749
The advantages and the limitations of this research alongside about what’s done in this research 1750
to make sense and to get sense about what’s figured out are included in the section, “Conclusion 1751
and Closing Remarks”. 1752

CHAPTER 9 1753
Extreme Preliminaries Of This Scientific 1754
Research On the Redeemed Ways 1755
In this section, the basic material in this scientific research, is referred to [Single Valued 1756
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1757
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1758

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1759
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1760
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1761
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1762
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1763
their clarifications are addressed to Ref.[HG38]. 1764

In this subsection, the basic material which is used in this scientific research, is presented. Also, 1765
the new ideas and their clarifications are elicited. 1766
Definition 9.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Edge-Gap 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 ]− 0, 1 [. 1767
Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Edge-Gap 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}.
61
Definition 9.0.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 9.0.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 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 1768
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1769
where 1770
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1771
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 1, 2, . . . , n); 1772
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1773
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1774
1, 2, . . . , n0 ); 1775
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1776
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1777

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1778
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1779
0
(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 . 1780
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1781
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1782
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1783

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1784
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1785
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1786
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1787
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1788
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1789

Definition 9.0.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 1790

(Ref.[HG38],Definition 2.7,p.3). 1791
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1792
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1793
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1794
(i) If |Vi | = 1, then Vi is called vertex; 1795
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1796
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1797
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1798
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1799
SuperEdge; 1800
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1801
SuperHyperEdge. 1802
If we choose different types of binary operations, then we could get hugely diverse types of 1803
general forms of Neutrosophic SuperHyperGraph (NSHG). 1804
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1805

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1806
x, y, z, w ∈ [0, 1]: 1807
(i) 1 ⊗ x = x; 1808
(ii) x ⊗ y = y ⊗ x; 1809
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1810
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1811

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 .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 9.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 1812

where 1814

1, 2, . . . , n0 ); 1819
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1820
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1821
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1822
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1823
0


SuperEdge; 1843
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1846
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1847
makes the patterns and regularities. 1848
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1849
of elements of SuperHyperEdges are the same. 1850

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1851
makes to have SuperHyperUniform more understandable. 1852
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1853
Classes as follows. 1854
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1855
two given SuperHyperEdges with two exceptions; 1856
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1857
SuperHyperEdges; 1858
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1859
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1860
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1861
in common; 1862
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1863
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1864
SuperHyperEdge in common; 1865
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1866
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1867
SuperVertex. 1868
Definition 9.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 1869
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1870
(i) Vi , Vi+1 ∈ Ei0 ; 1871
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1872
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1873
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1874
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1875
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1876
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1877
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1878
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that Vi0 , Vi+1
0
∈ Ei0 . 1879

Definition 9.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) V1 to Neutrosophic
SuperHyperVertex (NSHV) Vs is sequence of Neutrosophic SuperHyperVertices (NSHV) and
Neutrosophic SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 1880
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1881
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1882
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1883
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1884
perPath . 1885
Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 1886
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1887
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1888
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1889
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1890
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1891

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1893
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1894
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic t-strength 1895

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 1896
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 1897
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic i-strength 1898


(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic f-strength 1901

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1904
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1905
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1906
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEdge-Gap). 1907

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1909
or E 0 is called 1910
(i) Neutrosophic e-SuperHyperEdge-Gap if the following expression is called Neutro- 1911
sophic e-SuperHyperEdge-Gap criteria holds 1912
(ii) Neutrosophic re-SuperHyperEdge-Gap if the following expression is called Neutro- 1913

sophic re-SuperHyperEdge-Gap criteria holds 1914
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 1915
(iii) Neutrosophic v-SuperHyperEdge-Gap if the following expression is called Neutro- 1916

sophic v-SuperHyperEdge-Gap criteria holds 1917
(iv) Neutrosophic rv-SuperHyperEdge-Gap if the following expression is called Neutro- 1918


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 1920
(v) Neutrosophic SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 1921

Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, and Neutro- 1922
sophic rv-SuperHyperEdge-Gap. 1923
Definition 9.0.19. ((Neutrosophic) SuperHyperEdge-Gap). 1924

(i) an Extreme SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 1927

sophic rv-SuperHyperEdge-Gap and C(N SHG) for an Extreme SuperHyperGraph N SHG : 1929
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 1930
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 1931
Extreme SuperHyperEdge-Gap; 1933

(ii) a Neutrosophic SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge- 1934

Gap, Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, and Neut- 1935
rosophic rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic SuperHyperGraph 1936
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 1937
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 1938
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1939
form the Neutrosophic SuperHyperEdge-Gap; 1940
(iii) an Extreme SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 1941

rosophic e-SuperHyperEdge-Gap, Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v- 1942
SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) for an Ex- 1943
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1944
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 1945
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1946
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1947
that they form the Extreme SuperHyperEdge-Gap; and the Extreme power is corresponded 1948
to its Extreme coefficient; 1949
(iv) a Neutrosophic SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 1950

SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) for a Neut- 1952
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1953
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 1954
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1955
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 1956
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1957
SuperHyperEdge-Gap; and the Neutrosophic power is corresponded to its Neutrosophic 1958
coefficient; 1959
(v) an Extreme V-SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 1960

treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 1964
(vi) a Neutrosophic V-SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge- 1967

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 1970
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1971
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1972
that they form the Neutrosophic SuperHyperEdge-Gap; 1973
(vii) an Extreme V-SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 1974


ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1979
(viii) a Neutrosophic SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 1983

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1988

coefficient. 1992
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEdge-Gap). 1993

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1994
(i) an δ−SuperHyperEdge-Gap is a Neutrosophic kind of Neutrosophic SuperHyperEdge-Gap 1995

such that either of the following expressions hold for the Neutrosophic cardinalities of 1996
SuperHyperNeighbors of s ∈ S : 1997
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 1998

(29.1), holds if S is an δ−SuperHyperDefensive; 1999
(ii) a Neutrosophic δ−SuperHyperEdge-Gap is a Neutrosophic kind of Neutrosophic 2000

SuperHyperEdge-Gap such that either of the following Neutrosophic expressions hold for 2001
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2002
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2003

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2004
For the sake of having a Neutrosophic SuperHyperEdge-Gap, there’s a need to “redefine” the 2005
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 2006
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 2007
of the position of labels to assign to the values. 2008
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2009
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2010
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2011
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2012

Table 9.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.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
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22)

136TBL4

136TBL1
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 2014
sophic SuperHyperPath , SuperHyperEdge-Gap, SuperHyperStar, SuperHyperBipartite, Super- 2015
HyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutro- 2016
sophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic SuperHy- 2017

perBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic SuperHy- 2018
perWheel if the Table (29.2) holds. 2019
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEdge-Gap. Since 2020

there’s more ways to get type-results to make a Neutrosophic SuperHyperEdge-Gap more 2021
Neutrosophicly understandable. 2022
Neutrosophic notion of “Neutrosophic SuperHyperEdge-Gap”. The SuperHyperVertices and the 2024
there’s the usage of the position of labels to assign to the values. 2026
136DEF1 Definition 9.0.23. Assume a SuperHyperEdge-Gap. It’s redefined a Neutrosophic 2027
SuperHyperEdge-Gap if the Table (29.3) holds. 2028

CHAPTER 10 2029
Extreme SuperHyper But As The Edge-Gap 2030
Extensions Excerpt From Dense And 2031
Super Forms 2032
Definition 10.0.1. (Extreme event). 2033

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2034
is a probability Edge-Gap. Any Extreme k-subset of A of V is called Extreme k-event and if 2035
k = 2, then Extreme subset of A of V is called Extreme event. The following expression is 2036
called Extreme probability of A. 2037
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2038

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2039
a probability Edge-Gap. s Extreme k-events Ai , i ∈ I is called Extreme s-independent if the 2040
following expression is called Extreme s-independent criteria 2041
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Extreme k-events of A and B is called Extreme independent. The 2042
following expression is called Extreme independent criteria 2043
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2044

a probability Edge-Gap. Any k-function Edge-Gap like E is called Extreme k-Variable. If k = 2, 2046
then any 2-function Edge-Gap like E is called Extreme Variable. 2047
The notion of independent on Extreme Variable is likewise. 2048
Definition 10.0.4. (Extreme Expectation). 2049
71
a probability Edge-Gap. an Extreme k-Variable E has a number is called Extreme Expectation 2051
if the following expression is called Extreme Expectation criteria 2052
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2053

is a probability Edge-Gap. an Extreme number is called Extreme Crossing if the following 2055
expression is called Extreme Crossing criteria 2056
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2057
S = (V, E) is a probability Edge-Gap. Let m and n propose special Edge-Gap. Then with m ≥ 4n, 2058
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Edge-Gap p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 2059
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
2060
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2061
Consider S = (V, E) is a probability Edge-Gap. Let P be a SuperHyperSet of n points in the plane, 2062
and let l be the Extreme number √of SuperHyperLines in the plane passing through at least k + 1 2063
of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2064
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2065

SuperHyperEdge are the segments between consecutive points on the SuperHyperLines which 2066
pass through at least k + 1 points of P. This Extreme SuperHyperGraph has at least kl 2067
SuperHyperEdges and Extreme crossing at most l choose two. Thus either kl < 4n, in which 2068
3
case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Extreme Crossing 2069
2 3
Lemma, and again l < 32n /k . 2070

and let k be the number of pairs of points of P at unit SuperHyperDistance. Then k < 5n4/3 . 2073
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2074
S = (V, E) is a probability Edge-Gap. Draw a SuperHyperUnit SuperHyperCircle around 2075
each SuperHyperPoint of P. Let ni be the Extreme number of these SuperHyperCircles 2076
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 2077
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2078
SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on the 2079

SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2080
n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3
Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 2081

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2082
as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2083
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2084
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2085
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2086
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2087
Consider S = (V, E) is a probability Edge-Gap. Let X be a nonnegative Extreme Variable and t a 2088
positive real number. Then 2089
E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality. 2090
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2091
Consider S = (V, E) is a probability Edge-Gap. Let Xn be a nonnegative integer-valued variable 2092
in a probability Edge-Gap (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as 2093
n → ∞. 2094
Proof. 2095
Consider S = (V, E) is a probability Edge-Gap. A special SuperHyperGraph in Gn,p almost surely 2097
has stability number at most d2p−1 log ne. 2098

S = (V, E) is a probability Edge-Gap. A special SuperHyperGraph in Gn,p is up. Let G ∈ Gn,p 2100
and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. The 2101
probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability 2102
that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 2103
Extreme SuperHyperGraph G. 2104
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2105
Extreme Variable for this Extreme Event. By equation, we have 2106
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .
Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 2107
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2108
X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 2109
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2110
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!
Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 2111
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2112
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2113
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2114
Definition 10.0.12. (Extreme Variance). 2115

a probability Edge-Gap. an Extreme k-Variable E has a number is called Extreme Variance if 2117
the following expression is called Extreme Variance criteria 2118
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Edge-Gap. Let X be an Extreme Variable and let t be a 2120
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Edge-Gap. Let X be an Extreme Variable and let t be a positive real 2123
number. Then 2124
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
2125
Consider S = (V, E) is a probability Edge-Gap. Let Xn be an Extreme Variable in a probability 2127
2
Edge-Gap (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E (Xn ), then 2128
E(Xn = 0) → 0 as n → ∞
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 2129
(V, E) is a probability Edge-Gap. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s Inequality, and 2130
observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 2131
when Xn = 0. 2132
Consider S = (V, E) is a probability Edge-Gap. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2134
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 2135
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2136
S = (V, E) is a probability Edge-Gap. As in the proof of related Theorem, the result is 2138
straightforward. 2139
Consider S = (V, E) is a probability Edge-Gap. Let G ∈ Gn,1/2 and let f and k ∗ be as defined in 2141
previous Theorem. Then either: 2142
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2143
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2144
S = (V, E) is a probability Edge-Gap. The latter is straightforward. 2146
Definition 10.0.17. (Extreme Threshold). 2147

is a probability Edge-Gap. Let P be a monotone property of SuperHyperGraphs (one which is 2149

preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is a function 2150
f (n) such that: 2151
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2152
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2153

Definition 10.0.18. (Extreme Balanced). 2154

a probability Edge-Gap. Let F be a fixed Extreme SuperHyperGraph. Then there is a threshold 2156
function for the property of containing a copy of F as an Extreme SubSuperHyperGraph is 2157
called Extreme Balanced. 2158
Consider S = (V, E) is a probability Edge-Gap. Let F be a nonempty balanced Extreme 2160
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2161
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2162
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2165
the mentioned Extreme Figures in every Extreme items. 2166
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEdge- 2167
Gap, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 2168
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 2169
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2170
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2171
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2172
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2173
SuperHyperEdge-Gap. 2174
C(N SHG)Extreme Edge-Gap

= {E4 }.
C(N SHG)Extreme Edge-Gap SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Edge-Gap
= {}.
C(N SHG)Extreme V-Edge-Gap SuperHyperPolynomial
= 0z 0 .
2175
Gap, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some 2177
empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the 2178
terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 2179
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2180
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2181
V3 , is excluded in every given Extreme SuperHyperEdge-Gap. 2182

= {E4 }.

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperEdge-Gap in the Extreme Example (42.0.3) 136NSHG1

= z3.
= {}.
= 0z 0 .
2183
Gap, is up. The Extreme Algorithm is Extremely straightforward. 2185

= {E4 }.
= z3.
= {}.
= 0z 0 .
2186



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

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V5 }.

= z7.
2192

= {}.
= 0z 0 .
= {}.
= 0z 0 .
2195

= {}.
= 0z 0 .
= {}.
= 0z 0 .
2198
• On the Figure (??), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEdge-Gap, 2199
is up. The Extreme Algorithm is Extremely straightforward. 2200

= {E4 }.
= z3.
= {}.

= 0z 0 .OntheF igure(30.9), theExtremeSuperHyperN otion, namely, ExtremeSuperHyperEdge −

= {}.
= 0z 0 .
= {}.
= 0z 0 .
2201
136NSHG9 • On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEdge- 2202

= {}.
= 0z 0 .

SuperHyperEdge-Gap in the Extreme Example (42.0.3)
= {}.
= 0z 0 .
2204

= {}.
= 0z 0 .
= {}.
= 0z 0 .
2207



= {Ei62 }.
X |E 6 |
= z i2 .
= {Vi31 , Vi87 }.
X |V 3 ,V 8 |
= z i1 i7 .
2210

= {}.
= 0z 0 .


= {}.
= 0z 0 .
2213

= {E1 , E2 }.
= 2z 2 .
= {V1 }.
= z5.
2216


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


= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V1 , V2 }.
= 2z 5 .
2222

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .

= {V2 , V23 }.
= 2z 5 .
2225

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V2 }.
= z5.
2228


Gap , is up. The Extreme Algorithm is Extremely straightforward. 2230

= {}.
= 0z 0 .
= {}.
= 0z 0 .
2231

= {}.
= 0z 0 .

= {V1 }.
= z6.
2234

= {E2 }.
= z 10 .
= {}.
= 0z 0 .
2237

SuperHyperEdge-Gap in the Extreme Example (42.0.3) 95NHG1

= {Ei ∈ (EN SHG \ {E1 })}.
X
= z |Ei ∈(EN SHG \{E1 })| .
= {}.
= 0z 0 .
2240

SuperHyperEdge-Gap in the Extreme Example (42.0.3) 95NHG2
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The 2241
all interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Edge-Gap if for any 2242
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2243
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2244
all minus all Extreme SuperHypeNeighbors to any amount of them. 2245
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2246

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2247
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2248
quasi-R-Edge-Gap minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2249
In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only 2250
two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Edge-Gap, minus all Extreme 2251
SuperHypeNeighbor to some of them but not all of them. 2252
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Edge-Gap is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Edge-Gap is at least the 2253
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2254
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2255
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2256
SuperHyperVertices are renamed to Extreme Edge-Gap in some cases but the maximum number of 2257

the Extreme SuperHyperEdge with the maximum Extreme number of Extreme SuperHyperVertices, 2258
has the Extreme SuperHyperVertices are contained in an Extreme R-Edge-Gap. 2259
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Edge-Gap has, the least Extreme cardinality, the lower sharp
Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Edge-Gap with the least Extreme cardinality, the lower sharp 2260
Extreme bound for cardinality. 2261
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2262
Then in the worst case, literally, 2263
C(N SHG)ExtremeQuasi−Edge−Gap
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Edge−GapSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Edge−Gap = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Edge−GapSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Edge-Gap. In other words, the least cardinality, the lower sharp bound 2264
for the cardinality, of an Extreme type-result-Edge-Gap is the cardinality of 2265
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Edge−GapSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Edge−Gap = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Edge−GapSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Edge-Gap since neither
amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where amount refers
to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any
kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-Edge-Gap. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Edge-Gap is the cardinality of
Then we’ve lost some connected loopless Extreme SuperHyperClasses of the connected loopless
Extreme SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the
SuperHyperStable is only up in this quasi-R-Edge-Gap. It’s the contradiction to that fact on
the generality. There are some counterexamples to deny this statement. One of them comes
from the setting of the graph titled path and cycle as the counterexamples-classes or reversely
direction star as the examples-classes, are well-known classes in that setting and they could be
considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Extreme SuperHyperSet has the necessary condition for the intended
definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main
definition but by the necessity of the pre-condition on the usage of the main definition.
The Extreme structure of the Extreme R-Edge-Gap decorates the Extreme SuperHyperVertices
don’t have received any Extreme connections so as this Extreme style implies different versions
of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of Extreme
SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum Extreme
groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex in
the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore, the
Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about the
Extreme R-Edge-Gap. Since at least two Extreme SuperHyperVertices involve to make a title in
the Extreme background of the Extreme SuperHyperGraph. The Extreme SuperHyperGraph is
obvious if it has no Extreme SuperHyperEdge but at least two Extreme SuperHyperVertices

make the Extreme version of Extreme SuperHyperEdge. Thus in the Extreme setting of
non-obvious Extreme SuperHyperGraph, there are at least one Extreme SuperHyperEdge.
It’s necessary to mention that the word “Simple” is used as Extreme adjective for the initial
Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop Extreme
version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said to be
loopless. The Extreme adjective “loop” on the basic Extreme framework engages one Extreme
SuperHyperVertex but it never happens in this Extreme setting. With these Extreme bases,
on an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus there’s
at least an Extreme R-Edge-Gap has the Extreme cardinality of an Extreme SuperHyperEdge.
Thus, an Extreme R-Edge-Gap has the Extreme cardinality at least an Extreme SuperHyperEdge.
Assume an Extreme SuperHyperSet V \ V \ {z}. This Extreme SuperHyperSet isn’t an Extreme
R-Edge-Gap since either the Extreme SuperHyperGraph is an obvious Extreme SuperHyperModel
thus it never happens since there’s no Extreme usage of this Extreme framework and even
more there’s no Extreme connection inside or the Extreme SuperHyperGraph isn’t obvious
and as its consequences, there’s an Extreme contradiction with the term “Extreme R-Edge-Gap”
since the maximum Extreme cardinality never happens for this Extreme style of the Extreme
SuperHyperSet and beyond that there’s no Extreme connection inside as mentioned in first
Extreme case in the forms of drawback for this selected Extreme SuperHyperSet. Let
Comes up. This Extreme case implies having the Extreme style of on-quasi-triangle Extreme
style on the every Extreme elements of this Extreme SuperHyperSet. Precisely, the Extreme
R-Edge-Gap is the Extreme SuperHyperSet of the Extreme SuperHyperVertices such that some
Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle Extreme style. The
Extreme cardinality of the v SuperHypeSet
Is the maximum in comparison to the Extreme SuperHyperSet

But the lower Extreme bound is up. Thus the minimum Extreme cardinality of the maximum
Extreme cardinality ends up the Extreme discussion. The first Extreme term refers to the
Extreme setting of the Extreme SuperHyperGraph but this key point is enough since there’s an
Extreme SuperHyperClass of an Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes an Extreme SuperHyperSet has only some amount Extreme
SuperHyperVertices from one Extreme SuperHyperEdge such that there’s no Extreme amount
of Extreme SuperHyperEdges more than one involving these some amount of these Extreme
SuperHyperVertices. The Extreme cardinality of this Extreme SuperHyperSet is the maximum
and the Extreme case is occurred in the minimum Extreme situation. To sum them up, the
Extreme SuperHyperSet
Has the maximum Extreme cardinality such that


Contains some Extreme SuperHyperVertices such that there’s distinct-covers-order-amount

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices

Is an Extreme R-Edge-Gap for the Extreme SuperHyperGraph as used Extreme background in

the Extreme terms of worst Extreme case and the common theme of the lower Extreme bound
occurred in the specific Extreme SuperHyperClasses of the Extreme SuperHyperGraphs which
are Extreme free-quasi-triangle.
Assume an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of the
Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least no Extreme
SuperHyperEdge with others in common. Thus those Extreme SuperHyperVertices have the
eligibles to be contained in an Extreme R-Edge-Gap. Those Extreme SuperHyperVertices are
potentially included in an Extreme style-R-Edge-Gap. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Extreme
SuperHyperVertices of the Extreme SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Extreme SuperHyperVertices and there’s only and only one
Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme SuperHyperVertices Zi and
Zj . The other definition for the Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the terms of
Extreme R-Edge-Gap is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Edge-Gap but with slightly differences
in the maximum Extreme cardinality amid those Extreme type-SuperHyperSets of the Extreme
SuperHyperVertices. Thus the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,
z
and
E
is formalized with mathematical literatures on the Extreme R-Edge-Gap. Let Zi ∼ Zj , be defined
as Zi and Zj are the Extreme SuperHyperVertices belong to the Extreme SuperHyperEdge
E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.

Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 2266
Extreme R-Edge-Gap =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2267
Extreme R-Edge-Gap =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Edge-Gap where E ∈ EESHG:(V,E) is fixed that

means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in an Extreme
Edge-Gap, Ex = E ∈ EESHG:(V,E) could be different and it’s not unique. To sum them up,
in a connected Extreme SuperHyperGraph ESHG : (V, E). If an Extreme SuperHyperEdge
E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme cardinality of the
Extreme R-Edge-Gap is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Edge-Gap is at least the 2268
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2269

with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2270
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2271
SuperHyperVertices are renamed to Extreme Edge-Gap in some cases but the maximum number 2272
of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme SuperHyper- 2273
Vertices, has the Extreme SuperHyperVertices are contained in an Extreme R-Edge-Gap. 2274
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2275
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2276
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2277
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2278
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2279
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2280
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2281
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2282
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVer- 2283
tices. Thus it forms an Extreme quasi-R-Edge-Gap where the Extreme completion of the Extreme 2284
incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Edge-Gap. The SuperHyper- 2285
Notions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, 2286
these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. 2287
Thus the embedded setting is elected such that those SuperHyperSets have the maximum 2288
Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. The less than two 2289
distinct types of Extreme SuperHyperVertices are included in the minimum Extreme style of 2290
the embedded Extreme R-Edge-Gap. The interior types of the Extreme SuperHyperVertices are 2291
deciders. Since the Extreme number of SuperHyperNeighbors are only affected by the interior 2292
Extreme SuperHyperVertices. The common connections, more precise and more formal, the 2293

perfect unique connections inside the Extreme SuperHyperSet for any distinct types of Extreme 2294
SuperHyperVertices pose the Extreme R-Edge-Gap. Thus Extreme exterior SuperHyperVertices 2295
could be used only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with 2296
the interior Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded 2297
Extreme Edge-Gap, there’s the usage of exterior Extreme SuperHyperVertices since they’ve more 2298
connections inside more than outside. Thus the title “exterior” is more relevant than the title 2299
“interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme 2300
SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has been 2301
ignored in the exploring to lead on the optimal case implying the Extreme R-Edge-Gap. The 2302
Extreme R-Edge-Gap with the exclusion of the exclusion of all Extreme SuperHyperVertices 2303
in one Extreme SuperHyperEdge and with other terms, the Extreme R-Edge-Gap with the 2304
inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme 2305
quasi-R-Edge-Gap. To sum them up, in a connected non-obvious Extreme SuperHyperGraph 2306

ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the 2307
maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of any given 2308
Extreme quasi-R-Edge-Gap minus all Extreme SuperHypeNeighbor to some of them but not all 2309
of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2310
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Edge-Gap, minus all 2311
Extreme SuperHypeNeighbor to some of them but not all of them. 2312

The main definition of the Extreme R-Edge-Gap has two titles. an Extreme quasi-R-Edge-Gap 2313
and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are two titles in the 2314
terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R-Edge-Gap with 2315
that quasi-maximum Extreme SuperHyperCardinality in the terms of the embedded Extreme 2316
SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then the Extreme 2317
quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi-R-Edge-Gaps for 2318
all Extreme numbers less than its Extreme corresponded maximum number. The essence of the 2319
Extreme Edge-Gap ends up but this essence starts up in the terms of the Extreme quasi-R-Edge-Gap, 2320
again and more in the operations of collecting all the Extreme quasi-R-Edge-Gaps acted on the all 2321
possible used formations of the Extreme SuperHyperGraph to achieve one Extreme number. 2322
This Extreme number is 2323
considered as the equivalence class for all corresponded quasi-R-Edge-Gaps. Let 2324
zExtreme Number , SExtreme SuperHyperSet and GExtreme Edge-Gap be an Extreme number, an Ex- 2325
treme SuperHyperSet and an Extreme Edge-Gap. Then 2326
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Edge-Gap ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Edge-Gap is re-formalized and redefined 2327
as follows. 2328
GExtreme Edge-Gap ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number
{SExtreme SuperHyperSet |


= zExtreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 2329
definition for the Extreme Edge-Gap. 2330
GExtreme Edge-Gap =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme Edge-Gap 2331
poses the upcoming expressions. 2332
GExtreme Edge-Gap =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2333
GExtreme Edge-Gap =
= maxzExtreme Number

= max |E| | E ∈ EESHG:(V,E) }.
And then, 2334
GExtreme Edge-Gap =


To get more visions in the closer look-up, there’s an overall overlook. 2335
GExtreme Edge-Gap ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


2336
GExtreme Edge-Gap =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
= zExtreme Number |

2337
GExtreme Edge-Gap =
= max zExtreme Number

2338
GExtreme Edge-Gap =

Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2339
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2340
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Super- 2341
HyperEdge. It’s, literarily, another name for “Extreme Quasi-Edge-Gap” but, precisely, it’s the 2342
generalization of “Extreme Quasi-Edge-Gap” since “Extreme Quasi-Edge-Gap” happens “Extreme 2343
Edge-Gap” in an Extreme SuperHyperGraph as initial framework and background but “Extreme 2344
SuperHyperNeighborhood” may not happens “Extreme Edge-Gap” in an Extreme SuperHyper- 2345
Graph as initial framework and preliminarily background since there are some ambiguities 2346
about the Extreme SuperHyperCardinality arise from it. To get orderly keywords, the terms, 2347
“Extreme SuperHyperNeighborhood”, “Extreme Quasi-Edge-Gap”, and “Extreme Edge-Gap” are up. 2348
Thus, let 2349
zExtreme Number , NExtreme SuperHyperNeighborhood and 2350

GExtreme Edge-Gap be an Extreme number, an Extreme SuperHyperNeighborhood and an Extreme 2351

and the new terms are up.
Edge-Gap 2352
GExtreme Edge-Gap ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2353
GExtreme Edge-Gap =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2354
GExtreme Edge-Gap =
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2355
GExtreme Edge-Gap =
And with go back to initial structure, 2356
GExtreme Edge-Gap ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =



2357
GExtreme Edge-Gap =
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
= zExtreme Number |

2358
GExtreme Edge-Gap =
= max zExtreme Number

2359
GExtreme Edge-Gap =

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

Is the simple Extreme type-SuperHyperSet of the Extreme R-Edge-Gap. The Extreme

SuperHyperSet of the Extreme SuperHyperVertices,

Is an Extreme R-Edge-Gap C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is an

Extreme type-SuperHyperSet with
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by
Extreme Edge-Gap is related to the Extreme SuperHyperSet of the Extreme SuperHyperVer-
tices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Edge-Gap is up. The obvious simple Extreme type-SuperHyperSet
called the Extreme Edge-Gap is an Extreme SuperHyperSet includes only one Extreme
SuperHyperVertex. But the Extreme SuperHyperSet of Extreme SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Edge-Gap is up. To sum them up, the Extreme
SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Edge-Gap. Since the
Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Edge-Gap C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is the
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an Extreme
SuperHyperEdge for some Extreme SuperHyperVertices instead of all given by that Extreme
type-SuperHyperSet called the Extreme Edge-Gap and it’s an Extreme Edge-Gap. Since it’s
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge for some amount Extreme
SuperHyperVertices instead of all given by that Extreme type-SuperHyperSet called the Extreme
Edge-Gap. There isn’t only less than two Extreme SuperHyperVertices inside the intended
Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Edge-Gap,

is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Edge-Gap , not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2360
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2361
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2362
the 2363
“Extreme R-Edge-Gap” 2364
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2365
Extreme R-Edge-Gap, 2366
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only an Extreme free-triangle embedded SuperHyperModel and an
Extreme on-triangle embedded SuperHyperModel but also it’s an Extreme stable embedded
SuperHyperModel. But all only non-obvious simple Extreme type-SuperHyperSets of the
Extreme R-Edge-Gap amid those obvious simple Extreme type-SuperHyperSets of the Extreme
Edge-Gap, are
In a connected Extreme SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Edge-Gap. In other words, the least cardinality, the lower sharp bound for the
cardinality, of an Extreme R-Edge-Gap is the cardinality of
2367
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2368
Extreme SuperHyperVertices belong to any Extreme quasi-R-Edge-Gap if for any of them, and any 2369
of other corresponded Extreme SuperHyperVertex, some interior Extreme SuperHyperVertices 2370
are mutually Extreme SuperHyperNeighbors with no Extreme exception at all minus all Extreme 2371
SuperHypeNeighbors to any amount of them. 2372

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2373
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2374
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2375
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2376
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2377
R-Edge-Gap with the least cardinality, the lower sharp Extreme bound for Extreme cardinality. 2378
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme SuperHyperSet 2379
of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet S of the 2380
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2381
Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Edge-Gap. Since it doesn’t have 2382
2383
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2384
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2385
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2386
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2387
but it isn’t an Extreme R-Edge-Gap. Since it doesn’t do the Extreme procedure such that 2388
such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2389
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2390
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2391
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2392
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2393
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2394
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Edge-Gap, VESHE is up. 2395
The obvious simple Extreme type-SuperHyperSet of the Extreme R-Edge-Gap, VESHE , is an 2396
Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms 2397
any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme 2398
SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme Super- 2399
HyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme 2400
SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme SuperHy- 2401
perEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme 2402
SuperHyperGraph ESHG : (V, E). Any Extreme R-Edge-Gap only contains all interior Extreme 2403
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2404
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2405
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2406
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2407
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2408

The SuperHyperNotion, namely, Edge-Gap, is up. There’s neither empty SuperHyperEdge 2409
nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2410
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme 2411
Edge-Gap. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2412
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Edge−GapSuperHyperP olynomial
= 2z b 2 c
.

C(N SHG)ExtremeR−Quasi−Edge−Gap = {Vi }si=1 , {Vj }tj=1 .

C(N SHG)ExtremeR−Quasi−Edge−GapSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Edge-Gap. The Extreme SuperHyperSet 2413
of the Extreme SuperHyperEdges[SuperHyperVertices], 2414
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Edge-Gap C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is an 2415

Extreme type-SuperHyperSet with 2416
2417
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2418
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2419
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Ex- 2420
treme SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the 2421
intended Extreme SuperHyperSet. Thus the non-obvious Extreme Edge-Gap is up. The obvious 2422
simple Extreme type-SuperHyperSet called the Extreme Edge-Gap is an Extreme SuperHyperSet 2423
includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet of the 2424
Extreme SuperHyperEdges[SuperHyperVertices], 2425
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2426
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Edge-Gap is up. To sum 2427
them up, the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2428
b c
= {E2i−1 }i=1 2
.


= 2z b 2 c
.
= az s + bz t .
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Edge-Gap. Since the 2429
Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2430
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Edge-Gap C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is the 2431
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an Extreme Supe- 2432
rHyperEdge for some Extreme SuperHyperVertices given by that Extreme type-SuperHyperSet 2433
called the Extreme Edge-Gap and it’s an Extreme Edge-Gap. Since it’s 2434
2435
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2436
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2437
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2438
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2439
intended Extreme SuperHyperSet, 2440
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Edge-Gap , 2441
b c
= {E2i−1 }i=1 2
.


= 2z b 2 c
.
= az s + bz t .
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme , not:

Edge-Gap 2442
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2443
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2444
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2445
SuperHyperSet called the 2446
“Extreme Edge-Gap ” 2447
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2448
Extreme Edge-Gap , 2449
is only and only 2450
b c
= {E2i−1 }i=1 2
.

= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2451

CHAPTER 11 2452
The Extreme Departures on The 2453
Theoretical Results Toward Theoretical 2454
Motivations 2455
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2456
SuperHyperClasses. 2457
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2458

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {VEi ∩Ej =1 }.
X |V
= z Ei ∩Ej =1 | .
Proof. Let 2459
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2460
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
113
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperEdge-

Gap in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2461
new way to redefine as 2462
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 corresponded to 2463
ViEXT ERN AL in the literatures of SuperHyperEdge-Gap. The latter is straightforward. 2464
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2465
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2466
(31.1), is the SuperHyperEdge-Gap. 2467
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2468

= {}.
= 0z 0 .

= {}.
= 0z 0 .
Proof. Let 2469
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2470
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 2471

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2475
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2476
SuperHyperModel (31.2), is the Extreme SuperHyperEdge-Gap. 2477
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2478

= {}.
= 0z 0 .
= {CEN T ER}.
= z |CEN T ER| .

Figure 11.2: an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme

SuperHyperEdge-Gap in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2479
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2480
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2481
way to redefine as 2482


Figure 11.3: an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme

SuperHyperEdge-Gap in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2485
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2486
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2487
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEdge-Gap. 2488
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2489

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2490
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
2491
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). There’s 2492
a new way to redefine as 2493

ViEXT ERN AL in the literatures of SuperHyperEdge-Gap. The latter is straightforward. Then 2495
there’s no at least one SuperHyperEdge-Gap. Thus the notion of quasi may be up but the 2496
SuperHyperNotions based on SuperHyperEdge-Gap could be applied. There are only two 2497
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 2498
representative in the 2499
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEdge-Gap taken from a connected Extreme SuperHyperBipartite ESHB : 2500
(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2501
SuperHyperEdges are attained in any solution 2502
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2503
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2504
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2505
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2506
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2507
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEdge-Gap. 2508

Figure 11.4: Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of

Extreme SuperHyperEdge-Gap in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2509
Then 2510

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2511
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2512
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEdge-Gap taken from a connected Extreme SuperHyperMultipartite 2513

ESHM : (V, E). There’s a new way to redefine as 2514

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2515
to ViEXT ERN AL in the literatures of SuperHyperEdge-Gap. The latter is straightforward. 2516
Then there’s no at least one SuperHyperEdge-Gap. Thus the notion of quasi may be up but 2517
the SuperHyperNotions based on SuperHyperEdge-Gap could be applied. There are only z 0 2518
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2521

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2524
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2526
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2527
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2528
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2529
the Extreme SuperHyperEdge-Gap. 2530
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2531

Then, 2532

Figure 11.5: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperEdge-Gap in the Example (42.0.13) 136NSHG22a
= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2533
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2534
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEdge-Gap taken from a connected Extreme SuperHyperWheel ESHW : 2535
(V, E). There’s a new way to redefine as 2536


Figure 11.6: an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of

Extreme SuperHyperEdge-Gap in the Extreme Example (42.0.15) 136NSHG23a
Then there’s at least one SuperHyperEdge-Gap. Thus the notion of quasi isn’t up and the 2539
SuperHyperNotions based on SuperHyperEdge-Gap could be applied. The unique embedded 2540
SuperHyperEdge-Gap proposes some longest SuperHyperEdge-Gap excerpt from some representatives. 2541
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2543
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2544
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2545
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2546
Extreme SuperHyperEdge-Gap. 2547

CHAPTER 12 2548
The Surveys of Mathematical Sets On 2549
The Results But As The Initial Motivation 2550
For the SuperHyperEdge-Gap, Extreme SuperHyperEdge-Gap, and the Extreme SuperHyperEdge-Gap, 2551
some general results are introduced. 2552
Remark 12.0.1. Let remind that the Extreme SuperHyperEdge-Gap is “redefined” on the positions 2553
of the alphabets. 2554
Corollary 12.0.2. Assume Extreme SuperHyperEdge-Gap. Then 2555
Extreme SuperHyperEdge − Gap =

{theSuperHyperEdge − Gapof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEdge − Gap
|ExtremecardinalityamidthoseSuperHyperEdge−Gap. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2556
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2557
and the neutrality, for i = 1, 2, 3, respectively. 2558
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2559
alphabet. Then the notion of Extreme SuperHyperEdge-Gap and SuperHyperEdge-Gap coincide. 2560
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperEdge- 2562
Gap if and only if it’s a SuperHyperEdge-Gap. 2563
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperEdge-Gap 2565
if and only if it’s a longest SuperHyperEdge-Gap. 2566
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2567
identical letter of the alphabet. Then its Extreme SuperHyperEdge-Gap is its SuperHyperEdge-Gap 2568
and reversely. 2569
123
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperEdge-Gap, SuperHyperStar, 2570

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of 2571
the alphabet. Then its Extreme SuperHyperEdge-Gap is its SuperHyperEdge-Gap and reversely. 2572
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEdge-Gap 2573
isn’t well-defined if and only if its SuperHyperEdge-Gap isn’t well-defined. 2574
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2575

Extreme SuperHyperEdge-Gap isn’t well-defined if and only if its SuperHyperEdge-Gap isn’t well- 2576
defined. 2577
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperEdge-Gap, SuperHyper- 2578

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2579
SuperHyperEdge-Gap isn’t well-defined if and only if its SuperHyperEdge-Gap isn’t well-defined. 2580
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEdge-Gap 2581
is well-defined if and only if its SuperHyperEdge-Gap is well-defined. 2582
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2583

Extreme SuperHyperEdge-Gap is well-defined if and only if its SuperHyperEdge-Gap is well-defined. 2584
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperEdge-Gap, SuperHyper- 2585

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2586
SuperHyperEdge-Gap is well-defined if and only if its SuperHyperEdge-Gap is well-defined. 2587
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2588
(i) : the dual SuperHyperDefensive SuperHyperEdge-Gap; 2589
(ii) : the strong dual SuperHyperDefensive SuperHyperEdge-Gap; 2590
(iii) : the connected dual SuperHyperDefensive SuperHyperEdge-Gap; 2591
(iv) : the δ-dual SuperHyperDefensive SuperHyperEdge-Gap; 2592
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEdge-Gap; 2593
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEdge-Gap. 2594
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2595
(i) : the SuperHyperDefensive SuperHyperEdge-Gap; 2596
(ii) : the strong SuperHyperDefensive SuperHyperEdge-Gap; 2597
(iii) : the connected defensive SuperHyperDefensive SuperHyperEdge-Gap; 2598
(iv) : the δ-SuperHyperDefensive SuperHyperEdge-Gap; 2599
(v) : the strong δ-SuperHyperDefensive SuperHyperEdge-Gap; 2600
(vi) : the connected δ-SuperHyperDefensive SuperHyperEdge-Gap. 2601
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2602
independent SuperHyperSet is 2603

(iii) : the connected SuperHyperDefensive SuperHyperEdge-Gap; 2606
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2610

which is a SuperHyperEdge-Gap/SuperHyperPath. Then V is a maximal 2611
(i) : SuperHyperDefensive SuperHyperEdge-Gap; 2612
(ii) : strong SuperHyperDefensive SuperHyperEdge-Gap; 2613
(iii) : connected SuperHyperDefensive SuperHyperEdge-Gap; 2614
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEdge-Gap; 2615
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEdge-Gap; 2616
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEdge-Gap; 2617
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2618
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2619

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2620
(i) : dual SuperHyperDefensive SuperHyperEdge-Gap; 2621
(ii) : strong dual SuperHyperDefensive SuperHyperEdge-Gap; 2622
(iii) : connected dual SuperHyperDefensive SuperHyperEdge-Gap; 2623
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEdge-Gap; 2624
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEdge-Gap; 2625
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEdge-Gap; 2626
which is a SuperHyperEdge-Gap/SuperHyperPath. Then the number of 2629
(i) : the SuperHyperEdge-Gap; 2630
(ii) : the SuperHyperEdge-Gap; 2631
(iii) : the connected SuperHyperEdge-Gap; 2632
(iv) : the O(ESHG)-SuperHyperEdge-Gap; 2633

(v) : the strong O(ESHG)-SuperHyperEdge-Gap; 2634
(vi) : the connected O(ESHG)-SuperHyperEdge-Gap. 2635
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2636
coincide. 2637

which is a SuperHyperWheel. Then the number of 2639
(i) : the dual SuperHyperEdge-Gap; 2640
(ii) : the dual SuperHyperEdge-Gap; 2641
(iii) : the dual connected SuperHyperEdge-Gap; 2642
(iv) : the dual O(ESHG)-SuperHyperEdge-Gap; 2643
(v) : the strong dual O(ESHG)-SuperHyperEdge-Gap; 2644
(vi) : the connected dual O(ESHG)-SuperHyperEdge-Gap. 2645
coincide. 2647

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2649
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2650
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2651
is a 2652
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEdge-Gap; 2656
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEdge-Gap; 2657
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEdge-Gap. 2658

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2661
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2662
SuperHyperPart is a 2663

(iv) : δ-SuperHyperDefensive SuperHyperEdge-Gap; 2667
(v) : strong δ-SuperHyperDefensive SuperHyperEdge-Gap; 2668
(vi) : connected δ-SuperHyperDefensive SuperHyperEdge-Gap. 2669

SuperHyperMultipartite. Then Then the number of 2672
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2679
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2680
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2682
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2683
(iv) : SuperHyperEdge-Gap; 2687
(v) : strong 1-SuperHyperDefensive SuperHyperEdge-Gap; 2688
(vi) : connected 1-SuperHyperDefensive SuperHyperEdge-Gap. 2689
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2690
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2691
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2692
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2693
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2694
t>
2

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEdge-Gap; 2698
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEdge-Gap. 2700
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2701
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2702
dual 2703
(iv) : 0-SuperHyperDefensive SuperHyperEdge-Gap; 2707
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2710
perComplete. Then there’s no independent SuperHyperSet. 2711
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2712
SuperHyperEdge-Gap/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2713

and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2714
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEdge-Gap; 2718
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEdge-Gap; 2719
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEdge-Gap. 2720
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2721
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2722
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2723
t>
2
setting of a dual 2724



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2731
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2732
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2733
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2734
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2735
SuperHyperDefensive SuperHyperEdge-Gap, then ∀v ∈ V \ S, ∃x ∈ S such that 2736
(i) v ∈ Ns (x); 2737
(ii) vx ∈ E. 2738
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2739
SuperHyperDefensive SuperHyperEdge-Gap, then 2740
(i) S is SuperHyperEdge-Gap set; 2741
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2742
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2743
(i) Γ ≤ O; 2744
(ii) Γs ≤ On . 2745
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2746
connected. Then 2747
(i) Γ ≤ O − 1; 2748
(ii) Γs ≤ On − Σ3i=1 σi (x). 2749
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2750
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperEdge- 2751

Gap; 2752
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2753
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2754
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2755
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2757
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEdge-Gap; 2758

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2759
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2760
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2761
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEdge-Gap. Then 2763
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEdge-Gap; 2764
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2765
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2766
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2767
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperEdge-Gap. Then 2769

Gap; 2771
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2773
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2774
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2776
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEdge-Gap; 2777
(ii) Γ = 1; 2778
(iii) Γs = Σ3i=1 σi (c); 2779
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEdge-Gap. 2780
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2781
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2782
SuperHyperDefensive SuperHyperEdge-Gap; 2783
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2784
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2785
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2786
SuperHyperDefensive SuperHyperEdge-Gap. 2787
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2788

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperEdge-Gap; 2789
(ii) Γ = b n2 c + 1; 2790
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2791
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEdge-Gap. 2792
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2793
bnc
2
(ii) Γ = b n2 c; 2795

bnc ; 2796
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive 2797
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2799

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2800
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEdge-Gap 2801

for N SHF; 2802
(ii) Γ = m for N SHF : (V, E); 2803
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2804
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEdge-Gap for 2805
N SHF : (V, E). 2806
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2807

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2808
b n c+1
2
is a dual maximal SuperHyperDefensive SuperHyperEdge- 2809
Gap for N SHF; 2810
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2811

b n c+1 for N SHF : (V, E); 2812
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperEdge-Gap for 2813
N SHF : (V, E). 2814
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2815

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2816
bnc
2
is a dual SuperHyperDefensive SuperHyperEdge-Gap for 2817
N SHF : (V, E); 2818

(ii) Γ = b n2 c for N SHF : (V, E); 2819

bnc for N SHF : (V, E); 2820
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEdge-Gap for N SHF : 2821
(V, E). 2822
following statements hold; 2824
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2825

SuperHyperEdge-Gap, then S is an s-SuperHyperDefensive SuperHyperEdge-Gap; 2826
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2827

SuperHyperEdge-Gap, then S is a dual s-SuperHyperDefensive SuperHyperEdge-Gap. 2828
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2831

SuperHyperEdge-Gap, then S is an s-SuperHyperPowerful SuperHyperEdge-Gap; 2832

SuperHyperEdge-Gap, then S is a dual s-SuperHyperPowerful SuperHyperEdge-Gap. 2834
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2835

SuperHyperGraph. Then following statements hold; 2836
(i) if ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2839
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 2841

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual V-SuperHyperDefensive 2843

Proposition 12.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Extreme 2845

(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2849

(iii) ∀a ∈ S, |Ns (a)∩V \S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive SuperHyperEdge- 2851
Gap; 2852

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual V-SuperHyperDefensive 2853


SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2856
(i) ∀a ∈ S, |Ns (a) ∩ S| b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2859
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 2861

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual (O − 1)-SuperHyperDefensive 2863


(i) if ∀a ∈ S, |Ns (a) ∩ S| b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 2869
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is (O − 1)-SuperHyperDefensive 2871
(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual (O − 1)- 2873


SuperHyperGraph which is SuperHyperEdge-Gap. Then following statements hold; 2876
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEdge- 2877
Gap; 2878
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2879

(iii) ∀a ∈ S, |Ns (a)∩V \S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive SuperHyperEdge- 2881

Gap; 2882
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2883

(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 2887

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2889
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 2891

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2893


CHAPTER 13 2895
Extreme Applications in Cancer’s 2896
Extreme Recognition 2897
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2898
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2899
as the consequences of the model, some parameters are used. The cells are under attack of this 2900
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2901
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2902
In the following, some Extreme steps are Extreme devised on this disease. 2903
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2904
function. 2905
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2906
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2907
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 2908
since there are some determinacy, indeterminacy and neutrality about the moves and the 2909
effects of the cancer on that region; this event leads us to choose another model [it’s said 2910
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2911
what’s done. 2912
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2913
they’ve got the names, and some general Extreme models. The moves and the Extreme 2914
traces of the cancer on the complex tracks and between complicated groups of cells could 2915
be fantasized by an Extreme SuperHyperPath(-/SuperHyperEdge-Gap, SuperHyperStar, 2916
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 2917
either the Extreme SuperHyperEdge-Gap or the Extreme SuperHyperEdge-Gap in those 2918
Extreme Extreme SuperHyperModels. 2919
135
CHAPTER 14 2920
Case 1: The Initial Extreme Steps 2921
Toward Extreme SuperHyperBipartite 2922
as Extreme SuperHyperModel 2923
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2924
is Extreme highlighted and Extreme featured. 2925
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBipartite 2926
is obtained. 2927
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2928
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEdge-Gap 136NSHGaa21aa
137
Belong to The Extreme SuperHyperBipartite

136TBLaa21aa
result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBipartite 2929

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperEdge- 2930
Gap. 2931

CHAPTER 15 2932
Case 2: The Increasing Extreme Steps 2933
Toward Extreme 2934
SuperHyperMultipartite as Extreme 2935
SuperHyperModel 2936
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2937
ite is Extreme highlighted and Extreme featured. 2938
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2939
partite is obtained. 2940
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 2941
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

139
Belong to The Extreme SuperHyperMultipartite

136TBLaa22aa
of the Extreme SuperHyperVertices of the connected Extreme SuperHyperMultipartite 2942

ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperEdge- 2943
Gap. 2944

CHAPTER 16 2945
Wondering Open Problems But As The 2946
Directions To Forming The Motivations 2947
In what follows, some “problems” and some “questions” are proposed. 2948
The SuperHyperEdge-Gap and the Extreme SuperHyperEdge-Gap are defined on a real-world 2949
application, titled “Cancer’s Recognitions”. 2950
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2951
recognitions? 2952
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEdge-Gap and the 2953
Extreme SuperHyperEdge-Gap? 2954
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2955
them? 2956
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEdge-Gap 2957
and the Extreme SuperHyperEdge-Gap? 2958
Problem 16.0.5. The SuperHyperEdge-Gap and the Extreme SuperHyperEdge-Gap do a SuperHyper- 2959
Model for the Cancer’s recognitions and they’re based on SuperHyperEdge-Gap, are there else? 2960
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2961
Numbers types-results? 2962
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2963
the multiple types of SuperHyperNotions? 2964
141
CHAPTER 17 2965
Conclusion and Closing Remarks 2966
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2967
research are illustrated. Some benefits and some advantages of this research are highlighted. 2968
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2969
In this endeavor, two SuperHyperNotions are defined on the SuperHyperEdge-Gap. For that sake 2970
in the second definition, the main definition of the Extreme SuperHyperGraph is redefined on 2971
the position of the alphabets. Based on the new definition for the Extreme SuperHyperGraph, 2972
the new SuperHyperNotion, Extreme SuperHyperEdge-Gap, finds the convenient background 2973
to implement some results based on that. Some SuperHyperClasses and some Extreme 2974
SuperHyperClasses are the cases of this research on the modeling of the regions where are 2975
under the attacks of the cancer to recognize this disease as it’s mentioned on the title “Cancer’s 2976
Recognitions”. To formalize the instances on the SuperHyperNotion, SuperHyperEdge-Gap, the 2977
new SuperHyperClasses and SuperHyperClasses, are introduced. Some general results are 2978
gathered in the section on the SuperHyperEdge-Gap and the Extreme SuperHyperEdge-Gap. The 2979
clarifications, instances and literature reviews have taken the whole way through. In this 2980
research, the literature reviews have fulfilled the lines containing the notions and the results. 2981
The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the 2982
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 2983
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 2984
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 2985
of the moves of the cancer in the longest and strongest styles with the formation of the design 2986
and the architecture are formally called “ SuperHyperEdge-Gap” in the themes of jargons and 2987
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 2988
the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues for this 2989
research are, figured out, pointed out and spoken out. 2990
143
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperEdge-Gap
3. Extreme SuperHyperEdge-Gap 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 2991
Extreme SuperHyperDuality But As The 2992
Super Forms 2994
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2995

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 2996
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 2997
(i) Extreme e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2998

Va ∈ Ei , Ej ; 2999
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3000
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3001
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3002
Vi , Vj ∈ Ea ; 3003
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3004
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3005
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3006
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3007

SuperHyperDuality. 3008
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3009

SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3011
(i) an Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3012

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3014
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3015
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3016
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3017
Extreme SuperHyperDuality; 3018
145
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3019

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3020
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3021
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3022
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3023
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3024
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3025

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3026
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3027
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3028
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3029
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3030
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3032
coefficient; 3033
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3034

Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3041
coefficient; 3042
(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3043

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3045
cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 3047
(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3050

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3052
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 3053

SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 3054
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3055
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3056

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3057
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3058
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3059
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3060
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3061


that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3063
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3065

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3070
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3071
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3072
Extreme coefficient. 3073
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3074
mentioned Extreme Figures in every Extreme items. 3075
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3076
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3077
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.
• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3084
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3085
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3086
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3087
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3088
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3089
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3090


ality, is up. The Extreme Algorithm is Extremely straightforward. 3092

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 .
• On the Figure (??), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDuality, 3101


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 .

C(N SHG)Extreme SuperHyperDuality =

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

.
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .
Proof. Let 3134
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

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3138
(31.1), is the SuperHyperDuality. 3141
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 3143
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.2), is the Extreme SuperHyperDuality. 3150
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 3152
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3160
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 3162
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

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3166
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3167
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3168
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite ESHB : 3171

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperDuality. 3179
Then 3181

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 3182
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3183


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3187
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3188
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperDuality. 3200
Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3201
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 3202
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 ESHW : 3203


∃!Ez∗ ∈ EESHG:(V,E)
∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 3208
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3209
Extreme SuperHyperDuality. 3215

CHAPTER 19 3216
Extreme SuperHyperJoin But As The 3217
Super Forms 3219
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3220

(i) Extreme e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3223

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3224
(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3225
Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |Extreme CARDINALITY = 3226

|Ej |Extreme CARDINALITY ; 3227
(iii) Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3228

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 3229
(iv) Extreme rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3230

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3231
|Vj |Extreme CARDINALITY ; 3232
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3233
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3234
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3235

(i) an Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3238

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3239
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3240
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3241
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3242
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3243
159
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3244

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme car- 3246
dinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 3247
that they form the Extreme SuperHyperJoin; 3249
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3250

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3251
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3252
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3253
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3254
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3255
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3256
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3257
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3258

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3262
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3266


SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3270
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3271
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3272

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3274
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3275
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3277
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3278
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3279

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3282

(viii) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3286

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3290
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3293
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3296
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3297
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3298
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3299

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

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3305
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3306
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3307
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3308
V3 , is excluded in every given Extreme SuperHyperJoin. 3310



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

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

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

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

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .
• On the Figure (??), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3321

4 × 5 × 5z 3 .

C(N SHG)Extreme SuperHyperJoin = {E3i+13i=0 , E23 }.

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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

3 × 3z 2 .




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

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

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

C(N SHG)Extreme SuperHyperJoin = {E3i+1i=03 }.

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


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

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

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

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. 3358
(31.1), is the SuperHyperJoin. 3361

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


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

SuperHyperModel (31.2), is the Extreme SuperHyperJoin. 3370
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 3372



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3380
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 3382
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3386
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3387
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3388
SuperHyperPart could have one SuperHyperVertex as the representative in the 3389
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3390

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperJoin. 3398
Then 3400

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


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3407
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperJoin. 3418

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

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

is a longest SuperHyperJoin taken from a connected Extreme SuperHyperWheel ESHW : (V, E). 3421
There’s a new way to redefine as 3422

at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 3425
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 3426
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 3427
Extreme SuperHyperJoin. 3432

CHAPTER 20 3433
Extreme SuperHyperPerfect But As The 3434
Super Forms 3436
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3437

(i) Extreme e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 3440

Va ∈ Ei , Ej ; 3441
(ii) Extreme re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 3442

Va ∈ Ei , Ej ; and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3443
(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3444

Vi , Vj ∈ Ea ; 3445
(iv) Extreme rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3446

Vi , Vj ∈ Ea ; and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3447
(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3448

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3449
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3450

(i) an Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3453

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3454
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3455
Extreme SuperHyperPerfect; 3459
173
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3460

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect 3461
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3465
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3466

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3467
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3468
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3473
coefficient; 3474
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3475

Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3482
coefficient; 3483
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3484

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3486
(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3491

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3493

Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3496
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3497

of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v- 3498
SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme 3499


that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3504
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3506

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3511
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3512
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3513
Extreme coefficient. 3514
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3517
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3518
SuperHyperPerfect. 3524
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.
Perfect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3526
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3527
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3531


fect, is up. The Extreme Algorithm is Extremely straightforward. 3533

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 .
• On the Figure (??), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPerfect, 3542


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 .

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

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3579
(31.1), is the SuperHyperPerfect. 3582
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 3584
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.2), is the Extreme SuperHyperPerfect. 3591
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3601
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 3603
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 3607
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3608
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3609
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite ESHB : 3612

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperPerfect. 3620

Then 3622

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



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3627
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3628
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3629
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperPerfect. 3641
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperWheel ESHW : 3644


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 3647
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 3648
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 3649
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 3650
Extreme SuperHyperPerfect. 3656

CHAPTER 21 3657
Extreme SuperHyperTotal But As The 3658
Super Forms 3660
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3661
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3664
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3665

Ei , Ej ; and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3666
(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3667
(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3668

and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3669
(v) Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3670

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3671
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3672

(i) an Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3675

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3676
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3679
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3680
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3681

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3682
187

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3686
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3687
e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3688

treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3689
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3690
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3691
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3692
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3694
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3695

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3696
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3698
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3699
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3700
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3702
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3703

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3704
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3707
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3708
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3709

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3710
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3711
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3714
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3715

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3716
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3717
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3720
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3721
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3722
coefficient; 3723
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3724

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3725

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3727
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3728
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3729
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3731
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3734
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3735
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3736
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3737
SuperHyperTotal. 3741
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.
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3743
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3744
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3745
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3746
V3 , is excluded in every given Extreme SuperHyperTotal. 3748



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 .
• On the Figure (??), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3759

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 .

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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3796
(31.1), is the SuperHyperTotal. 3799
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 |Extreme Cardinality −2
= {ViEXT ERN AL }i=1ESHG:(V,E) .
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z |EESHG:(V,E) |Extreme Cardinality −2
Proof. Let 3801
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


SuperHyperModel (31.2), is the Extreme SuperHyperTotal. 3808
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 3810
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperTotal. 3818

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 3820
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3824
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 3825
based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 3826
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperBipartite ESHB : 3828
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperTotal. 3836
Then 3838

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



based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 3845
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperTotal. 3856
∗
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 3858
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 3859



at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 3863
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 3864
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 3865
Extreme SuperHyperTotal. 3871

CHAPTER 22 3872
Extreme SuperHyperConnected But As 3873
The Extensions Excerpt From Dense And 3874
Super Forms 3875
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3876

(i) Extreme e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3879

(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 3881
that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |Extreme CARDINALITY = 3882

|Ej |Extreme CARDINALITY ; 3883
(iii) Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3884

(iv) Extreme rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 3886

that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3887
|Vj |Extreme CARDINALITY ; 3888
(v) Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3889

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3890
SuperHyperConnected. 3891
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3892
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3895

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3897
201
Extreme SuperHyperConnected; 3901
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3902

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3904
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3905
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3907
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3908

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3909
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3910
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3911
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3912
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3913
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3914
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 3915
corresponded to its Extreme coefficient; 3916
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3917


(v) an Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected,3926

Extreme SuperHyperConnected; 3932
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3933

is the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 3936
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 3939

of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3940

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

contains the Extreme coefficients defined as the Extreme number of the maximum 3943
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 3946
Extreme power is corresponded to its Extreme coefficient; 3947
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3948

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 3953

corresponded to its Extreme coefficient. 3956
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3959
nected, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3960

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.
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 3968
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3969
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 3973


nected, is up. The Extreme Algorithm is Extremely straightforward. 3975

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 .
• On the Figure (??), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3984
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 .
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3989

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 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 Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V2 , V3 , V4 }.

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 .

2 × 4 × 3z 4 .


C(N SHG)Extreme R-Quasi-SuperHyperConnected = {Vi+2i=011 }.


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

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

C(N SHG)Extreme Quasi-SuperHyperConnected =

|EESHG:(V,E) |
Extreme Cardinality
−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 4017
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 .

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4021
(31.1), is the SuperHyperConnected. 4024
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

.
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z ESHG:(V,E) Extreme Cardinality
Proof. Let 4026
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 .

SuperHyperModel (31.2), is the Extreme SuperHyperConnected. 4033
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 4035



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 4043
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 4045
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 4049
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 4050
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 4051
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4054

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4055
SuperHyperPart SuperHyperEdges are attained in any solution 4056
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4062
Then 4064
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 4065
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4066


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 4070
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 4071
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 4072
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperConnected. 4083
∗
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 4085
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 4086

ESHW : (V, E). There’s a new way to redefine as 4087


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4089
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4090
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4091
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4092
some representatives. The latter is straightforward. 4093
Extreme SuperHyperConnected. 4098

CHAPTER 23 4099
Background 4100

215













[HG32b; HG44b]. 4308

Bibliography 4309
10.33140/JMTCM.01.03.09) 4313


221
10.20944/preprints202301.0282.v1). 4346
10.20944/preprints202301.0267.v1). 4349

(doi: 10.20944/preprints202301.0265.v1). 4354
prints202301.0262.v1). 4358
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4364
prints202301.0105.v1). 4367
Preprints 2023, 2023010044 4373
10.20944/preprints202301.0043.v1). 4376

(doi: 10.20944/preprints202212.0549.v1). 4385
(doi: 10.20944/preprints202212.0500.v1). 4392
(doi: 10.5281/zenodo.7904698). 4401
2023, (doi: 10.5281/zenodo.7904671). 4404

10.5281/zenodo.7871026). 4413
2023, (doi: 10.5281/zenodo.7874647). 4416

10.5281/zenodo.7857856). 4419
2023, (doi: 10.5281/zenodo.7857841). 4422
10.5281/zenodo.7853867). 4431
10.5281/zenodo.7853922). 4434
(doi: 10.5281/zenodo.7851519). 4437
(doi: 10.5281/zenodo.7851550). 4440
10.5281/zenodo.7834229). 4449
10.5281/zenodo.7834261). 4452
10.5281/zenodo.7824560). 4455

(doi: 10.5281/zenodo.7824623). 4458
2023, (doi: 10.5281/zenodo.7809365). 4469
2023, (doi: 10.5281/zenodo.7809358). 4472

10.5281/zenodo.7809219). 4475
10.5281/zenodo.7809328). 4478
2023, (doi: 10.5281/zenodo.7806767). 4481
2023, (doi: 10.5281/zenodo.7806838). 4484
10.5281/zenodo.7799902). 4493

(doi: 10.5281/zenodo.7804218). 4496
(doi: 10.5281/zenodo.7796334). 4499
10.5281/zenodo.7791952). 4505
10.5281/zenodo.7791982). 4508
10.5281/zenodo.7790026). 4511
10.5281/zenodo.7790052). 4514
2023, (doi: 10.5281/zenodo.7787066). 4517
10.5281/zenodo.7781476). 4523
10.5281/zenodo.7783082). 4526
10.5281/zenodo.7777857). 4529
10.5281/zenodo.7779286). 4532

(doi: 10.5281/zenodo.7771831). 4535
2023, (doi: 10.5281/zenodo.7772468). 4538
10.13140/RG.2.2.20913.25446). 4541
odo.7764916). 4544
10.13140/RG.2.2.11770.98247). 4547
10.13140/RG.2.2.12400.12808). 4550
2023, (doi: 10.13140/RG.2.2.22545.10089). 4553
10.13140/RG.2.2.11377.76644). 4559
10.13140/RG.2.2.23750.96329). 4562
10.13140/RG.2.2.31366.24641). 4565
10.13140/RG.2.2.34721.68960). 4568
2023, (doi: 10.13140/RG.2.2.30212.81289). 4571

10.13140/RG.2.2.24288.35842). 4577
10.13140/RG.2.2.32467.25124). 4580
10.13140/RG.2.2.31025.45925). 4583
10.13140/RG.2.2.17184.25602). 4586
10.13140/RG.2.2.23423.28327). 4589
10.13140/RG.2.2.28456.44805). 4592
10.13140/RG.2.2.23525.68320). 4595
10.13140/RG.2.2.20170.24000). 4598
10.13140/RG.2.2.36475.59683). 4601
10.13140/RG.2.2.29764.71046). 4604
2023, (doi: 10.13140/RG.2.2.18780.87683). 4607

10.13140/RG.2.2.26134.01603). 4613
10.13140/RG.2.2.27392.30721). 4616
10.13140/RG.2.2.33028.40321). 4619
10.13140/RG.2.2.21389.20966). 4622
10.13140/RG.2.2.16356.04489). 4625
10.13140/RG.2.2.21756.21129). 4628
10.13140/RG.2.2.30983.68009). 4631
10.13140/RG.2.2.28552.29445). 4634
(doi: 10.13140/RG.2.2.10936.21761). 4637
10.13140/RG.2.2.35105.89447). 4640
(doi: 10.13140/RG.2.2.30072.72960). 4643
10.13140/RG.2.2.31147.52003). 4646
10.13140/RG.2.2.32825.24163). 4649

10.13140/RG.2.2.13059.58401). 4652
10.13140/RG.2.2.11172.14720). 4655
2023, (doi: 10.13140/RG.2.2.22011.80165). 4658
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4661
2023, (doi: 10.13140/RG.2.2.10493.84962). 4664
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4667
2023, (doi: 10.13140/RG.2.2.19944.14086). 4670
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4673
(doi: 10.13140/RG.2.2.33103.76968). 4676
(doi: 10.13140/RG.2.2.23037.44003). 4679
(doi: 10.13140/RG.2.2.35646.56641). 4682
10.13140/RG.2.2.18030.48967). 4685
(doi: 10.13140/RG.2.2.13973.81121). 4688

2023, (doi: 10.13140/RG.2.2.34106.47047). 4691
2023, (doi: 10.13140/RG.2.2.31956.88961). 4697
2023, (doi: 10.13140/RG.2.2.15179.67361). 4700
10.13140/RG.2.2.21510.45125). 4703
2023, (doi: 10.13140/RG.2.2.13121.84321). 4706
10.13140/RG.2.2.11758.69441). 4709
2023, (doi: 10.13140/RG.2.2.31891.35367). 4712
10.13140/RG.2.2.19360.87048). 4715
10.13140/RG.2.2.32363.21286). 4718
10.13140/RG.2.2.23266.81602). 4721
10.13140/RG.2.2.19911.37285). 4724
10.13140/RG.2.2.11050.90569). 4727

2023, (doi: 10.13140/RG.2.2.17761.79206). 4730
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4736
(doi: 10.13140/RG.2.2.30182.50241). 4739

2023, (doi: 10.13140/RG.2.2.17252.24968). 4772

2023010396 (doi: 10.20944/preprints202301.0396.v1). 4781
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4784


2023,(doi: 10.13140/RG.2.2.36745.93289). 4798
10.20944/preprints202301.0282.v1). 4805

10.20944/preprints202301.0267.v1).). 4808
(doi: 10.20944/preprints202301.0265.v1). 4813
prints202301.0262.v1). 4817

2023010224, (doi: 10.20944/preprints202301.0224.v1). 4823

10.13140/RG.2.2.35061.65767). 4826

10.13140/RG.2.2.18494.15680). 4830

10.13140/RG.2.2.32530.73922). 4834

10.13140/RG.2.2.15897.70243). 4838

10.13140/RG.2.2.32530.73922). 4842
prints202301.0105.v1). 4845

10.13140/RG.2.2.23172.19849). 4852
10.13140/RG.2.2.17385.36968). 4862
Preprints 2023, 2023010044 4865

10.20944/preprints202301.0043.v1). 4868
2023, (doi: 10.13140/RG.2.2.28945.92007). 4871
10.13140/RG.2.2.35774.77123). 4877

10.13140/RG.2.2.29430.88642). 4883


(doi: 10.20944/preprints202212.0549.v1). 4889
10.13140/RG.2.2.19380.94084). 4892
(doi: 10.20944/preprints202212.0500.v1). 4903

10.13140/RG.2.2.20993.12640). 4906

10.13140/RG.2.2.29173.86244). 4921

2023 (doi: 10.5281/zenodo.7905287). 4926
2023 (doi: 10.5281/zenodo.7874677). 4930
(doi: 10.5281/zenodo.7857906). 4932
2023 (doi: 10.5281/zenodo.7856329). 4934
10.5281/zenodo.7854561). 4936
2023 (doi: 10.5281/zenodo.7851893). 4938

(doi: 10.5281/zenodo.7835063). 4942
(doi: 10.5281/zenodo.7826705). 4944
2023 (doi: 10.5281/zenodo.7820680). 4946
10.5281/zenodo.7812750). 4948


2023 (doi: 10.5281/zenodo.7807782). 4954
2023 (doi: 10.5281/zenodo.7804449). 4956


(doi: 10.5281/zenodo.7792307). 4960
(doi: 10.5281/zenodo.7790728). 4962
2023 (doi: 10.5281/zenodo.7787712). 4964
10.5281/zenodo.7783791). 4966
10.5281/zenodo.7780123). 4968
(doi: 10.5281/zenodo.7773119). 4970
odo.7637762). 4972
10.5281/zenodo.7766174). 4974
10.5281/zenodo.7762232). 4976
(doi: 10.5281/zenodo.7758601). 4978
10.5281/zenodo.7754661). 4980
10.5281/zenodo.7750995) . 4982
(doi: 10.5281/zenodo.7749875). 4984
10.5281/zenodo.7747236). 4986
10.5281/zenodo.7742587). 4988
(doi: 10.5281/zenodo.7738635). 4990
10.5281/zenodo.7734719). 4992

10.5281/zenodo.7730484). 4994
(doi: 10.5281/zenodo.7730469). 4996
10.5281/zenodo.7722865). 4998
odo.7713563). 5000
odo.7709116). 5002
10.5281/zenodo.7706415). 5004
10.5281/zenodo.7706063). 5006
10.5281/zenodo.7701906). 5008
odo.7700205). 5010
10.5281/zenodo.7694876). 5012
10.5281/zenodo.7679410). 5014
10.5281/zenodo.7675982). 5016
10.5281/zenodo.7672388). 5018
odo.7668648). 5020
10.5281/zenodo.7662810). 5022
10.5281/zenodo.7659162). 5024
odo.7653233). 5026
odo.7653204). 5028

odo.7653142). 5030
odo.7653117). 5032
odo.7651687). 5035
odo.7651619). 5037
odo.7651439). 5039
odo.7650729). 5041
odo.7647868). 5043
odo.7647017). 5045
odo.7644894). 5047
odo.7632923). 5050
odo.7623459). 5052
10.5281/zenodo.7606416). 5054
10.5281/zenodo.7606416). 5056
odo.7606404). 5058
10.5281/zenodo.7580018). 5060
odo.7580018). 5062

odo.7580018). 5064
odo.7579929). 5066
10.5281/zenodo.7563170). 5068
odo.7563164). 5070
odo.7563160). 5072
odo.7563160). 5074
10.5281/zenodo.7563160). 5076
10.5281/zenodo.7557063). 5078
10.5281/zenodo.7557009). 5080
10.5281/zenodo.7539484). 5082
10.5281/zenodo.7523390). 5084
10.5281/zenodo.7523390). 5086
10.5281/zenodo.7523390). 5088
odo.7574952). 5090
10.5281/zenodo.7574992). 5092
odo.7523357). 5094
10.5281/zenodo.7523357). 5096
10.5281/zenodo.7504782). 5098

10.5281/zenodo.7504782). 5100
10.5281/zenodo.7504782). 5102
10.5281/zenodo.7499395). 5104
odo.7499395). 5106
10.5281/zenodo.7499395). 5108
10.5281/zenodo.7497450). 5110
10.5281/zenodo.7497450). 5112
10.5281/zenodo.7494862). 5114
odo.7494862). 5116
10.5281/zenodo.7494862). 5118
10.5281/zenodo.7493845). 5120
odo.7493845). 5122
10.5281/zenodo.7493845). 5124
odo.7539484). 5126
odo.7523390). 5128
odo.7523357). 5130
odo.7504782). 5132
odo.7499395). 5134

odo.7497450). 5136
odo.7494862). 5138
odo.7493845). 5140
odo.7480110). 5142
odo.7378758). 5144
odo.6320305). 5146
odo.6677173). 5148

CHAPTER 24 5149
Cancer In Neutrosophic 5150
SuperHyperGraph 5151
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5152
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5153
disease is considered and as the consequences of the model, some parameters are used. The cells 5154
are under attack of this disease but the moves of the cancer in the special region are the matter 5155
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5156
treatments for this Neutrosophic disease. 5157
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5158
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5159
term Neutrosophic function. 5160
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5161
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5162
move from the cancer is identified by this research. Sometimes the move of the cancer 5163
about the moves and the effects of the cancer on that region; this event leads us to 5165
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5166
perception on what’s happened and what’s done. 5167
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5168
known and they’ve got the names, and some general Neutrosophic models. The moves 5169
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5170
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5171
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5172
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5173
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5174
Models. 5175
Some cells have been faced with some attacks from the situation which is caused by the 5176
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5177
which in that, the cells could be labelled as some groups and some groups or individuals have 5178
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5179
the embedded situations, the individuals of cells and the groups of cells could be considered 5180
245
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5181
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5182
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5183
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5184
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5185
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5186
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5187
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5188
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5189
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5190
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5191
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5192
out what’s going on this phenomenon. The special case of this disease is considered and as the 5193
consequences of the model, some parameters are used. The cells are under attack of this disease 5194
but the moves of the cancer in the special region are the matter of mind. The recognition of 5195
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5196
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5197
both bases are the background of this research. Sometimes the cancer has been happened on the 5198
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5199
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5200
in the forms of alliances’ styles with the formation of the design and the architecture are 5201
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5202
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5203
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5204
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5205
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5206
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5207
names, and some general models. The moves and the traces of the cancer on the complex tracks 5211
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5212
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5213
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5214
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5215
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5216
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5217
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5218
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5219
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5220
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5222
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5223
based on the fixed groups of cells or the fixed groups of group of cells? 5224
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5225

these messy and dense SuperHyperModels where embedded notions are illustrated? 5226
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5228

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5229
Then the research has taken more motivations to define SuperHyperClasses and to find some 5230
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5231
some instances and examples to make clarifications about the framework of this research. The 5232
general results and some results about some connections are some avenues to make key point of 5233
this research, “Cancer’s Recognition”, more understandable and more clear. 5234
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5235
research on the modeling of the regions where are under the attacks of the cancer to 5236
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5237
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5238
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5239
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5240

instances and literature reviews have taken the whole way through. In this scientific research, 5241
the literature reviews have fulfilled the lines containing the notions and the results. The 5242
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5243
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5244
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5245
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5246
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5247
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5248
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5249
to figure out the background for the SuperHyperNotions. 5250

CHAPTER 25 5251
Neutrosophic Edge-Gap 5252
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5253
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5254
2023, (doi: 10.13140/RG.2.2.34953.52320). 5255

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5256
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5257
(doi: 10.13140/RG.2.2.33275.80161). 5258
10.13140/RG.2.2.11050.90569). 5261
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5262
10.13140/RG.2.2.17761.79206). 5264
10.13140/RG.2.2.19911.37285). 5267
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5268
10.13140/RG.2.2.23266.81602). 5270
10.13140/RG.2.2.19360.87048). 5273
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5274
10.13140/RG.2.2.32363.21286). 5276
10.13140/RG.2.2.11758.69441). 5279
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5280
10.13140/RG.2.2.31891.35367). 5282
10.13140/RG.2.2.21510.45125). 5285
249
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5286
10.13140/RG.2.2.13121.84321). 5288

CHAPTER 26 5289
New Ideas In Recognition of Cancer And 5290
Neutrosophic SuperHyperGraph By 5291
Edge-Gap As Hyper Gape On Super Gab 5292
251
CHAPTER 27 5293
ABSTRACT 5294
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEdge-Gap). 5295
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Edge-Gap pair S = (V, E). Consider 5296
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 5297
V 0 or E 0 is called Neutrosophic e-SuperHyperEdge-Gap if the following expression is called 5298
Neutrosophic e-SuperHyperEdge-Gap criteria holds 5299
Neutrosophic re-SuperHyperEdge-Gap if the following expression is called Neutrosophic e- 5300

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic v- 5302

SuperHyperEdge-Gap if the following expression is called Neutrosophic v-SuperHyperEdge-Gap 5303
criteria holds 5304
Neutrosophic rv-SuperHyperEdge-Gap if the following expression is called Neutrosophic v- 5305

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic 5307

SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, Neutrosophic re- 5308
SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge- 5309
Gap. ((Neutrosophic) SuperHyperEdge-Gap). Assume a Neutrosophic SuperHyperGraph (NSHG) 5310
S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 5311
Then E is called an Extreme SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge- 5312

Gap, Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v-SuperHyperEdge-Gap, and Neutrosophic 5313
rv-SuperHyperEdge-Gap and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the 5314
maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 5315
of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHy- 5316
Gap; a Neutrosophic SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 5318
253

rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 5320
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5321
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 5322
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEdge- 5323
Gap; an Extreme SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neutrosophic 5324

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 5327
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 5328
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHy- 5329
Gap; and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 5331
SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 5332
rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 5334
is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined 5335
as the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 5336
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5337

utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 5338
form the Neutrosophic SuperHyperEdge-Gap; and the Neutrosophic power is corresponded to 5339
its Neutrosophic coefficient; an Extreme V-SuperHyperEdge-Gap if it’s either of Neutrosophic 5340
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 5343
Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 5344
Extreme SuperHyperEdge-Gap; a Neutrosophic V-SuperHyperEdge-Gap if it’s either of Neutrosophic 5346
and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic SuperHyperGraph 5348
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 5349
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 5350
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5351
the Neutrosophic SuperHyperEdge-Gap; an Extreme V-SuperHyperEdge-Gap SuperHyperPolyno- 5352
mial if it’s either of Neutrosophic e-SuperHyperEdge-Gap, Neutrosophic re-SuperHyperEdge-Gap, 5353
Neutrosophic v-SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) 5354

for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 5355
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 5357
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5358
they form the Extreme SuperHyperEdge-Gap; and the Extreme power is corresponded to its 5359
Extreme coefficient; a Neutrosophic SuperHyperEdge-Gap SuperHyperPolynomial if it’s either 5360

of Neutrosophic e-SuperHyperEdge-Gap, Neutrosophic re-SuperHyperEdge-Gap, Neutrosophic v- 5361
SuperHyperEdge-Gap, and Neutrosophic rv-SuperHyperEdge-Gap and C(N SHG) for a Neutrosophic 5362
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5363
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5364

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 5365

high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 5366
SuperHyperVertices such that they form the Neutrosophic SuperHyperEdge-Gap; and the Neut- 5367
rosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5368
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperEdge-Gap and 5369
Neutrosophic SuperHyperEdge-Gap. Two different types of SuperHyperDefinitions are debut 5370
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5371
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5372
implemented in the whole of this research. For shining the elegancy and the significancy of this 5373
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5374
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5375
and the instances thus the clarifications are driven with different tools. The applications are 5376
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5377
Recognition” are the under research to figure out the challenges make sense about ongoing and 5378
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5379
are different types of them. Some of them are individuals and some of them are well-modeled 5380
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 5381
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 5382
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 5383
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 5385
this research. It’s also officially collected in the form of some questions and some problems. 5386
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEdge-Gap is 5387
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5388

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5390
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5391
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEdge-Gap is a maximal 5392
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 5393
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 5394
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5395

if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5397
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5398
SuperHyperEdge-Gap . Since there’s more ways to get type-results to make a SuperHyperEdge-Gap 5399
more understandable. For the sake of having Neutrosophic SuperHyperEdge-Gap, there’s a 5400
need to “redefine” the notion of a “SuperHyperEdge-Gap ”. The SuperHyperVertices and the 5401
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperEdge-Gap 5403
. It’s redefined a Neutrosophic SuperHyperEdge-Gap if the mentioned Table holds, concerning, 5404
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 5405
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 5406
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 5407

SuperHyperEdge-Gap . It’s the main. It’ll be disciplinary to have the foundation of previous 5412
definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperEdge-Gap 5413
until the SuperHyperEdge-Gap, then it’s officially called a “SuperHyperEdge-Gap” but otherwise, 5414
it isn’t a SuperHyperEdge-Gap . There are some instances about the clarifications for the main 5415
definition titled a “SuperHyperEdge-Gap ”. These two examples get more scrutiny and discernment 5416
since there are characterized in the disciplinary ways of the SuperHyperClass based on a 5417
SuperHyperEdge-Gap . For the sake of having a Neutrosophic SuperHyperEdge-Gap, there’s a 5418
need to “redefine” the notion of a “Neutrosophic SuperHyperEdge-Gap” and a “Neutrosophic 5419
SuperHyperEdge-Gap ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5420
labels from the letters of the alphabets. In this procedure, there’s the usage of the position of 5421
labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutro- 5422
sophic SuperHyperGraph” if the intended Table holds. And a SuperHyperEdge-Gap are redefined 5423
to a “Neutrosophic SuperHyperEdge-Gap” if the intended Table holds. It’s useful to define “Neutro- 5424
sophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results 5425
to make a Neutrosophic SuperHyperEdge-Gap more understandable. Assume a Neutrosophic 5426
Thus SuperHyperPath, SuperHyperEdge-Gap, SuperHyperStar, SuperHyperBipartite, SuperHy- 5428
perMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 5429

SuperHyperEdge-Gap”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 5430
Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEdge-Gap” where it’s the 5432
strongest [the maximum Neutrosophic value from all the SuperHyperEdge-Gap amid the max- 5433
imum value amid all SuperHyperVertices from a SuperHyperEdge-Gap .] SuperHyperEdge-Gap . 5434
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5435

SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5436
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5437
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEdge-Gap if it’s only one 5438
and the common and intended properties between “specific” cells and “specific group” of 5450
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 5451
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 5452
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 5453
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 5454
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 5455
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 5456

of the move from the cancer is identified by this research. Sometimes the move of the cancer 5457
about the moves and the effects of the cancer on that region; this event leads us to choose 5459
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 5460
on what’s happened and what’s done. There are some specific models, which are well-known 5461
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 5462
and the traces of the cancer on the complex tracks and between complicated groups of cells 5463
could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEdge-Gap, SuperHyperStar, 5464
the longest SuperHyperEdge-Gap or the strongest SuperHyperEdge-Gap in those Neutrosophic 5466
SuperHyperModels. For the longest SuperHyperEdge-Gap, called SuperHyperEdge-Gap, and the 5467
strongest SuperHyperEdge-Gap, called Neutrosophic SuperHyperEdge-Gap, some general results 5468
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 5469
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5470
to form any style of a SuperHyperEdge-Gap. There isn’t any formation of any SuperHyperEdge-Gap 5471
but literarily, it’s the deformation of any SuperHyperEdge-Gap. It, literarily, deforms and it doesn’t 5472
form. A basic familiarity with Neutrosophic SuperHyperEdge-Gap theory, SuperHyperGraphs, 5473
and Neutrosophic SuperHyperGraphs theory are proposed. 5474
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEdge-Gap, Cancer’s Neutrosophic 5475
Recognition 5476

CHAPTER 28 5478
Applied Notions Under The Scrutiny Of 5479
The Motivation Of This Scientific 5480
Research 5481
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5482
try to bring the motivations in the narrative ways. Some cells have been faced with some 5483
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5484
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5485
as some groups and some groups or individuals have excessive labels which all are raised from 5486
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5487
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5488
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5489
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5490
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5491
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5492
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5493
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5494
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5495
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5496
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5497
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5498
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5499
is the disease but the model is going to figure out what’s going on this phenomenon. The 5500
special case of this disease is considered and as the consequences of the model, some parameters 5501
are used. The cells are under attack of this disease but the moves of the cancer in the 5502
special region are the matter of mind. The recognition of the cancer could help to find some 5503
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5504
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5505
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 5508
259
embedded styles to figure out the background for the SuperHyperNotions. The recognition 5511
of the cancer in the long-term function. The specific region has been assigned by the model 5512
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 5513
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 5514
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5515
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5516
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5517
are some specific models, which are well-known and they’ve got the names, and some general 5518
models. The moves and the traces of the cancer on the complex tracks and between complicated 5519
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperEdge-Gap, 5520
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5521
is to find either the optimal SuperHyperEdge-Gap or the Neutrosophic SuperHyperEdge-Gap in 5522
those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 5523
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 5524
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 5525
of a SuperHyperEdge-Gap. There isn’t any formation of any SuperHyperEdge-Gap but literarily, it’s 5526
the deformation of any SuperHyperEdge-Gap. It, literarily, deforms and it doesn’t form. 5527
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5528
“ amount of SuperHyperEdge-Gap” of either individual of cells or the groups of cells based on the 5529
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEdge-Gap” based on 5530
the fixed groups of cells or the fixed groups of group of cells? 5531
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5532
these messy and dense SuperHyperModels where embedded notions are illustrated? 5533
Thus it motivates us to define different types of “ SuperHyperEdge-Gap” and “Neutrosophic 5535
SuperHyperEdge-Gap” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then the 5536
research has taken more motivations to define SuperHyperClasses and to find some connections 5537
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 5538
instances and examples to make clarifications about the framework of this research. The general 5539
results and some results about some connections are some avenues to make key point of this 5540
research, “Cancer’s Recognition”, more understandable and more clear. 5541
The framework of this research is as follows. In the beginning, I introduce basic definitions 5542
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5543
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5544
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5545
review literature are applied to make sense about what’s going to figure out about the 5546
upcoming sections. The main definitions and their clarifications alongside some results 5547
about new notions, SuperHyperEdge-Gap and Neutrosophic SuperHyperEdge-Gap, are figured 5548
out in sections “ SuperHyperEdge-Gap” and “Neutrosophic SuperHyperEdge-Gap”. In the sense 5549

of tackling on getting results and in Edge-Gap to make sense about continuing the research, 5550
the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5551
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5552
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5553
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5554
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5555

Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5556

Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5557
and as concluding and closing section of theoretical research are contained in the section “General 5558
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5559
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5560
“ SuperHyperEdge-Gap”, “Neutrosophic SuperHyperEdge-Gap”, “Results on SuperHyperClasses” 5561
and “Results on Neutrosophic SuperHyperClasses”. There are curious questions about what’s 5562
done about the SuperHyperNotions to make sense about excellency of this research and 5563
going to figure out the word “best” as the description and adjective for this research as 5564
presented in section, “ SuperHyperEdge-Gap”. The keyword of this research debut in the section 5565
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5566
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5567
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5568

are some scrutiny and discernment on what’s done and what’s happened in this research in 5569
the terms of “questions” and “problems” to make sense to figure out this research in featured 5570
style. The advantages and the limitations of this research alongside about what’s done in this 5571
research to make sense and to get sense about what’s figured out are included in the section, 5572
“Conclusion and Closing Remarks”. 5573

CHAPTER 29 5574
Neutrosophic Preliminaries Of This 5575
Scientific Research On the Redeemed 5576
Ways 5577
In this section, the basic material in this scientific research, is referred to [Single Valued 5578
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5579

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5580
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5581
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5582
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5583
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5584
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5585
their clarifications are addressed to Ref.[HG38]. 5586
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5587
the new ideas and their clarifications are elicited. 5588
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Edge-Gap 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 ]− 0, 1 [. 5589
Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Edge-Gap 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}.
263

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 .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 29.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 5590
where 5592
1, 2, . . . , n0 ); 5597
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5598
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5599

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5600
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 5601
0
(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 . 5602



SuperEdge; 5622
If we choose different types of binary operations, then we could get hugely diverse types of 5625
general forms of Neutrosophic SuperHyperGraph (NSHG). 5626
Definition 29.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 5627

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5628
x, y, z, w ∈ [0, 1]: 5629
(i) 1 ⊗ x = x; 5630
(ii) x ⊗ y = y ⊗ x; 5631
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5632
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5633

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 .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 29.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 5634

where 5636

1, 2, . . . , n0 ); 5641
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5642
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5643
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5644
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5645
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5657
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5658
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5659
SuperEdge; 5665
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5668
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5669
makes the patterns and regularities. 5670
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5671
of elements of SuperHyperEdges are the same. 5672

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5673
makes to have SuperHyperUniform more understandable. 5674
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5675
Classes as follows. 5676
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5677
two given SuperHyperEdges with two exceptions; 5678
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5679
SuperHyperEdges; 5680
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5681
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5682
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5683
in common; 5684
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5685
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5686
SuperHyperEdge in common; 5687
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5688
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5689
SuperVertex. 5690
Definition 29.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 5691
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5692
(i) Vi , Vi+1 ∈ Ei0 ; 5693
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5694
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5695
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5696
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5697
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5698
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5699
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5700
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that Vi0 , Vi+1
0
∈ Ei0 . 5701

Definition 29.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 5702
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5703
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5704
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5705
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5706
perPath . 5707
Definition 29.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 5708
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5709
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5710
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5711
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5712
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5713

(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic t-strength 5717

(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic i-strength 5720


(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic f-strength 5723

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5726
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5727
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5728
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEdge-Gap). 5729

(i) Neutrosophic e-SuperHyperEdge-Gap if the following expression is called Neutro- 5733
sophic e-SuperHyperEdge-Gap criteria holds 5734
(ii) Neutrosophic re-SuperHyperEdge-Gap if the following expression is called Neutro- 5735

sophic re-SuperHyperEdge-Gap criteria holds 5736
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 5737
(iii) Neutrosophic v-SuperHyperEdge-Gap if the following expression is called Neutro- 5738

(iv) Neutrosophic rv-SuperHyperEdge-Gap if the following expression is called Neutro- 5740


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 5742
(v) Neutrosophic SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 5743

sophic rv-SuperHyperEdge-Gap. 5745
Definition 29.0.19. ((Neutrosophic) SuperHyperEdge-Gap). 5746

(i) an Extreme SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 5749


(ii) a Neutrosophic SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge- 5756

form the Neutrosophic SuperHyperEdge-Gap; 5762
(iii) an Extreme SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 5763

(iv) a Neutrosophic SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 5772

coefficient; 5781
(v) an Extreme V-SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge-Gap, 5782

(vi) a Neutrosophic V-SuperHyperEdge-Gap if it’s either of Neutrosophic e-SuperHyperEdge- 5789

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 5792
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5793
that they form the Neutrosophic SuperHyperEdge-Gap; 5795
(vii) an Extreme V-SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 5796


(viii) a Neutrosophic SuperHyperEdge-Gap SuperHyperPolynomial if it’s either of Neut- 5805


coefficient. 5814
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEdge-Gap). 5815

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5816
(i) an δ−SuperHyperEdge-Gap is a Neutrosophic kind of Neutrosophic SuperHyperEdge-Gap 5817

such that either of the following expressions hold for the Neutrosophic cardinalities of 5818
SuperHyperNeighbors of s ∈ S : 5819
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 5820

(29.1), holds if S is an δ−SuperHyperDefensive; 5821
(ii) a Neutrosophic δ−SuperHyperEdge-Gap is a Neutrosophic kind of Neutrosophic 5822

SuperHyperEdge-Gap such that either of the following Neutrosophic expressions hold for 5823
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5824
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 5825

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5826
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 5828
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 5829
of the position of labels to assign to the values. 5830
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5832
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5833
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5834


136TBL3
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22)

136TBL4

136TBL1
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5836
sophic SuperHyperPath , SuperHyperEdge-Gap, SuperHyperStar, SuperHyperBipartite, Super- 5837
HyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutro- 5838
sophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic SuperHy- 5839

perBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic SuperHy- 5840
perWheel if the Table (29.2) holds. 5841
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEdge-Gap. Since 5842

there’s more ways to get type-results to make a Neutrosophic SuperHyperEdge-Gap more 5843
Neutrosophicly understandable. 5844
Neutrosophic notion of “Neutrosophic SuperHyperEdge-Gap”. The SuperHyperVertices and the 5846
there’s the usage of the position of labels to assign to the values. 5848
136DEF1 Definition 29.0.23. Assume a SuperHyperEdge-Gap. It’s redefined a Neutrosophic 5849
SuperHyperEdge-Gap if the Table (29.3) holds. 5850

CHAPTER 30 5851
Neutrosophic SuperHyper But As The Edge-Gap 5852
Super Forms 5854
Definition 30.0.1. (Neutrosophic event). 5855

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5856
is a probability Edge-Gap. Any Neutrosophic k-subset of A of V is called Neutrosophic k-event 5857
and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The following 5858
expression is called Neutrosophic probability of A. 5859
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5860

is a probability Edge-Gap. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic s- 5862
independent if the following expression is called Neutrosophic s-independent criteria 5863
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Neutrosophic k-events of A and B is called Neutrosophic independent. 5864

The following expression is called Neutrosophic independent criteria 5865
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 5866

is a probability Edge-Gap. Any k-function Edge-Gap like E is called Neutrosophic k-Variable. 5868
If k = 2, then any 2-function Edge-Gap like E is called Neutrosophic Variable. 5869
The notion of independent on Neutrosophic Variable is likewise. 5870
Definition 30.0.4. (Neutrosophic Expectation). 5871
273
is a probability Edge-Gap. A Neutrosophic k-Variable E has a number is called Neutrosophic 5873

Expectation if the following expression is called Neutrosophic Expectation criteria 5874
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5875

is a probability Edge-Gap. A Neutrosophic number is called Neutrosophic Crossing if the 5877

following expression is called Neutrosophic Crossing criteria 5878
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 30.0.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5879
Consider S = (V, E) is a probability Edge-Gap. Let m and n propose special Edge-Gap. Then with 5880
m ≥ 4n, 5881
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Neutrosophic

random k-subset of V obtained by choosing each SuperHyperVertex of G Neutrosophic
independently with probability Edge-Gap p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 5882
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5883
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5884
and let l be the Neutrosophic number of√ SuperHyperLines in the plane passing through at least 5886
k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5887
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 5888

whose SuperHyperEdge are the segments between consecutive points on the SuperHyperLines 5889
which pass through at least k + 1 points of P. This Neutrosophic SuperHyperGraph has at least 5890
kl SuperHyperEdges and Neutrosophic crossing at most l choose two. Thus either kl < 4n, in 5891
3
which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic 5892
2 3
Crossing Lemma, and again l < 32n /k . 5893

and let k be the number of pairs of points of P at unit SuperHyperDistance. Then k < 5n4/3 . 5896
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5897
S = (V, E) is a probability Edge-Gap. Draw a SuperHyperUnit SuperHyperCircle around 5898
each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 5899
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 5900
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 5901
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 5902

the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5903
n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3
Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 5904

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5905
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5906

cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5907
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5908
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5909
4/3 4/3
k < 4n + n < 5n . 5910
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5911
Consider S = (V, E) is a probability Edge-Gap. Let X be a nonnegative Neutrosophic Variable and 5912
t a positive real number. Then 5913
E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality. 5914
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5915
Consider S = (V, E) is a probability Edge-Gap. Let Xn be a nonnegative integer-valued variable 5916
in a probability Edge-Gap (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as 5917

n → ∞. 5918
Proof. 5919
Consider S = (V, E) is a probability Edge-Gap. A special SuperHyperGraph in Gn,p almost surely 5921
has stability number at most d2p−1 log ne. 5922

S = (V, E) is a probability Edge-Gap. A special SuperHyperGraph in Gn,p is up. Let G ∈ Gn,p 5924
and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. The 5925
probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability 5926
that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 5927
Neutrosophic SuperHyperGraph G. 5928
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5929
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5930
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .
Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 5931
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5932
X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 5933
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5934
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!
Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 5935
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5936
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5937
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5938
Definition 30.0.12. (Neutrosophic Variance). 5939

is a probability Edge-Gap. A Neutrosophic k-Variable E has a number is called Neutrosophic 5941
Variance if the following expression is called Neutrosophic Variance criteria 5942
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Edge-Gap. Let X be a Neutrosophic Variable and let t be a 5944
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Edge-Gap. Let X be a Neutrosophic Variable and let t be a positive 5947
real number. Then 5948
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
5949
Consider S = (V, E) is a probability Edge-Gap. Let Xn be a Neutrosophic Variable in a probability 5951
2
Edge-Gap (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E (Xn ), then 5952
E(Xn = 0) → 0 as n → ∞
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 5953
(V, E) is a probability Edge-Gap. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s Inequality, and 5954
observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 5955
when Xn = 0. 5956
Consider S = (V, E) is a probability Edge-Gap. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5958
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 5959
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5960
S = (V, E) is a probability Edge-Gap. As in the proof of related Theorem, the result is 5962
Consider S = (V, E) is a probability Edge-Gap. Let G ∈ Gn,1/2 and let f and k ∗ be as defined in 5965
previous Theorem. Then either: 5966
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5967
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5968
Definition 30.0.17. (Neutrosophic Threshold). 5971

is a probability Edge-Gap. Let P be a monotone property of SuperHyperGraphs (one which is 5973

preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for P is a 5974
function f (n) such that: 5975
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5976
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5977

Definition 30.0.18. (Neutrosophic Balanced). 5978

is a probability Edge-Gap. Let F be a fixed Neutrosophic SuperHyperGraph. Then there 5980
is a threshold function for the property of containing a copy of F as a Neutrosophic 5981
SubSuperHyperGraph is called Neutrosophic Balanced. 5982
Consider S = (V, E) is a probability Edge-Gap. Let F be a nonempty balanced Neutrosophic 5984
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 5985
threshold function for the property of containing F as a Neutrosophic SubSuperHyperGraph. 5986
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5989
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5990
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5991

SuperHyperEdge-Gap, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 5992
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 5993
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 5994
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 5995
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 5996
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 5997
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 5998
C(N SHG)Neutrosophic Edge-Gap

= {E4 }.
C(N SHG)Neutrosophic Edge-Gap SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Edge-Gap
= {}.
C(N SHG)Neutrosophic V-Edge-Gap SuperHyperPolynomial
= 0z 0 .
6000

E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 6003
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6004
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6005

is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6006
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6007
every given Neutrosophic SuperHyperEdge-Gap. 6008

Figure 30.1: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.3) 136NSHG1
= {E4 }.
= z3.
= {}.
= 0z 0 .
6009


= {E4 }.
= z3.
= {}.
= 0z 0 .
6012







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


= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V5 }.


= z7.
6018


= {}.
= 0z 0 .
= {}.
= 0z 0 .
6021



= {}.
= 0z 0 .
= {}.
= 0z 0 .
6024
• On the Figure (??), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6025


= {E4 }.
= z3.
= {}.


= 0z 0 .OntheF igure(30.9), theN eutrosophicSuperHyperN otion, namely, N eutrosophicSuperHyp

= {}.
= 0z 0 .
= {}.
= 0z 0 .
6027
136NSHG9 • On the Figure (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6028

= {}.
= 0z 0 .


Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.3)
= {}.
= 0z 0 .
6030


= {}.
= 0z 0 .
= {}.
= 0z 0 .
6033






= {Ei62 }.
X |E 6 |
= z i2 .
= {Vi31 , Vi87 }.
X |V 3 ,V 8 |
= z i1 i7 .
6036


= {}.
= 0z 0 .



= {}.
= 0z 0 .
6039

= {E1 , E2 }.
= 2z 2 .
= {V1 }.
= z5.
6042




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




= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V1 , V2 }.
= 2z 5 .
6048


= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .


= {V2 , V23 }.
= 2z 5 .
6051


= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V2 }.
= z5.
6054






= {}.
= 0z 0 .
= {}.
= 0z 0 .
6057


= {}.
= 0z 0 .


= {V1 }.
= z6.
6060


= {E2 }.
= z 10 .
= {}.
= 0z 0 .
6063


Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.3) 95NHG1


= {Ei ∈ (EN SHG \ {E1 })}.
X
= z |Ei ∈(EN SHG \{E1 })| .
= {}.
= 0z 0 .
6066


Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.3) 95NHG2
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6067
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Edge-Gap if for 6068
any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6069
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6070
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6071
them. 6072
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6073

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6074
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6075
Neutrosophic quasi-R-Edge-Gap minus all Neutrosophic SuperHypeNeighbor to some of them 6076
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6077
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6078

quasi-R-Edge-Gap, minus all Neutrosophic SuperHypeNeighbor to some of them but not all of 6079
them. 6080
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Edge-Gap is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Edge-Gap is at least 6081
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6082
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6083

words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6084
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Edge- 6085
Gap in some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 6086
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6087
SuperHyperVertices are contained in a Neutrosophic R-Edge-Gap. 6088
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Edge-Gap has, the least Neutrosophic cardinality, the
lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Edge-Gap with the least Neutrosophic cardinality, the lower 6089
sharp Neutrosophic bound for cardinality. 6090
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6091

(V, E). Then in the worst case, literally, 6092
C(N SHG)N eutrosophicQuasi−Edge−Gap

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Edge−GapSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Edge−Gap = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Edge−GapSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Edge-Gap. In other words, the least cardinality, the lower sharp 6093
bound for the cardinality, of a Neutrosophic type-result-Edge-Gap is the cardinality of 6094

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Edge−GapSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Edge−Gap = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Edge−GapSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Edge-Gap since neither
amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount
refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one
to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the
Neutrosophic SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic
SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of

Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

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

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-Edge-Gap. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Edge-Gap is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types
but the SuperHyperStable is only up in this quasi-R-Edge-Gap. It’s the contradiction to that fact
on the generality. There are some counterexamples to deny this statement. One of them comes
from the setting of the graph titled path and cycle as the counterexamples-classes or reversely
direction star as the examples-classes, are well-known classes in that setting and they could be
considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Edge-Gap decorates the Neutrosophic Super-
HyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic style
implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutrosophic
cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower Neutro-
sophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHyperVertices
have perfect Neutrosophic connections inside each of SuperHyperEdges and the outside of
this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used
Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from the fact
that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the targeted

Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore, the

Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect to
talk about the Neutrosophic R-Edge-Gap. Since at least two Neutrosophic SuperHyperVertices
involve to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of Neut-
rosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic version
of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be
loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework engages one
Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting. With these
Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one Neutrosophic
SuperHyperEdge thus there’s at least a Neutrosophic R-Edge-Gap has the Neutrosophic cardinality
of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Edge-Gap has the Neutrosophic
cardinality at least a Neutrosophic SuperHyperEdge. Assume a Neutrosophic SuperHyperSet
V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic R-Edge-Gap since either the
Neutrosophic SuperHyperGraph is an obvious Neutrosophic SuperHyperModel thus it never
happens since there’s no Neutrosophic usage of this Neutrosophic framework and even more
there’s no Neutrosophic connection inside or the Neutrosophic SuperHyperGraph isn’t obvious
and as its consequences, there’s a Neutrosophic contradiction with the term “Neutrosophic R-
Edge-Gap” since the maximum Neutrosophic cardinality never happens for this Neutrosophic style
of the Neutrosophic SuperHyperSet and beyond that there’s no Neutrosophic connection inside
as mentioned in first Neutrosophic case in the forms of drawback for this selected Neutrosophic
SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-
triangle Neutrosophic style on the every Neutrosophic elements of this Neutrosophic
SuperHyperSet. Precisely, the Neutrosophic R-Edge-Gap is the Neutrosophic SuperHyperSet of
the Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet
But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic
term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic

SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes

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

Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices

Is a Neutrosophic R-Edge-Gap for the Neutrosophic SuperHyperGraph as used Neutrosophic

background in the Neutrosophic terms of worst Neutrosophic case and the common theme of
the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses of the
Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Edge-Gap. Those
Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-Edge-Gap.
Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .
Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Edge-Gap is
{aE , bE , cE , . . . , zE } .

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

z
and
E
is formalized with mathematical literatures on the Neutrosophic R-Edge-Gap. Let Zi ∼ Zj , be
defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the Neutrosophic
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6095
Neutrosophic R-Edge-Gap =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6096
Neutrosophic R-Edge-Gap =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Edge-Gap where E ∈ EESHG:(V,E) is fixed

that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices but
in a Neutrosophic Edge-Gap, Ex = E ∈ EESHG:(V,E) could be different and it’s not unique.
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If a
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices,
then the Neutrosophic cardinality of the Neutrosophic R-Edge-Gap is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Edge-Gap is at least 6097
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6098
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6099
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6100
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Edge-Gap 6101
in some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 6102
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6103
SuperHyperVertices are contained in a Neutrosophic R-Edge-Gap. 6104
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6105
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6106

about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6107
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6108
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Su- 6109
perHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6110
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6111
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6112
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 6113

least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyperVer- 6114
tices. Thus it forms a Neutrosophic quasi-R-Edge-Gap where the Neutrosophic completion of the 6115
Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Edge-Gap. 6116
The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6117
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyper- 6118
Cardinality. Thus the embedded setting is elected such that those SuperHyperSets have the 6119
maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOptimal. 6120
The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6121
minimum Neutrosophic style of the embedded Neutrosophic R-Edge-Gap. The interior types 6122
of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6123
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6124
common connections, more precise and more formal, the perfect unique connections inside 6125
the Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices 6126
pose the Neutrosophic R-Edge-Gap. Thus Neutrosophic exterior SuperHyperVertices could be 6127
used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6128
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6129
embedded Neutrosophic Edge-Gap, there’s the usage of exterior Neutrosophic SuperHyperVertices 6130
since they’ve more connections inside more than outside. Thus the title “exterior” is more 6131
relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6132
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with 6133
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 6134
the Neutrosophic R-Edge-Gap. The Neutrosophic R-Edge-Gap with the exclusion of the exclusion 6135
of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other 6136
terms, the Neutrosophic R-Edge-Gap with the inclusion of all Neutrosophic SuperHyperVertices 6137
in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Edge-Gap. To sum them up, 6138
in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s only 6139
one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6140
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6141
quasi-R-Edge-Gap minus all Neutrosophic SuperHypeNeighbor to some of them but not all of 6142
them. In other words, there’s only an unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) 6143
has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Edge-Gap, 6144
minus all Neutrosophic SuperHypeNeighbor to some of them but not all of them. 6145
The main definition of the Neutrosophic R-Edge-Gap has two titles. a Neutrosophic quasi-R- 6146
Edge-Gap and its corresponded quasi-maximum Neutrosophic R-SuperHyperCardinality are two 6147
titles in the terms of quasi-R-styles. For any Neutrosophic number, there’s a Neutrosophic 6148
quasi-R-Edge-Gap with that quasi-maximum Neutrosophic SuperHyperCardinality in the terms of 6149
the embedded Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic SuperHy- 6150
perGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the collection of 6151
all the Neutrosophic quasi-R-Edge-Gaps for all Neutrosophic numbers less than its Neutrosophic 6152

corresponded maximum number. The essence of the Neutrosophic Edge-Gap ends up but this 6153
essence starts up in the terms of the Neutrosophic quasi-R-Edge-Gap, again and more in the 6154
operations of collecting all the Neutrosophic quasi-R-Edge-Gaps acted on the all possible used 6155
formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. This 6156
Neutrosophic number is 6157
considered as the equivalence class for all corresponded quasi-R-Edge-Gaps. Let 6158
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Edge-Gap be a Neutrosophic num- 6159
ber, a Neutrosophic SuperHyperSet and a Neutrosophic Edge-Gap. Then 6160
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Edge-Gap ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Edge-Gap is re-formalized and 6161
redefined as follows. 6162
GNeutrosophic Edge-Gap ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6163
definition for the Neutrosophic Edge-Gap. 6164
GNeutrosophic Edge-Gap =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic Edge-Gap 6165
poses the upcoming expressions. 6166
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |

To translate the statement to this mathematical literature, the formulae will be revised. 6167
= max zNeutrosophic Number

And then, 6168

To get more visions in the closer look-up, there’s an overall overlook. 6169
GNeutrosophic Edge-Gap ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6171
[zNeutrosophic
Number ]Neutrosophic Class

6172



Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6173
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6174

perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6175
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Edge-Gap” 6176
but, precisely, it’s the generalization of “Neutrosophic Quasi-Edge-Gap” since “Neutrosophic 6177
Quasi-Edge-Gap” happens “Neutrosophic Edge-Gap” in a Neutrosophic SuperHyperGraph as initial 6178
framework and background but “Neutrosophic SuperHyperNeighborhood” may not happens 6179
“Neutrosophic Edge-Gap” in a Neutrosophic SuperHyperGraph as initial framework and preliminar- 6180

ily background since there are some ambiguities about the Neutrosophic SuperHyperCardinality 6181
arise from it. To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, 6182
“Neutrosophic Quasi-Edge-Gap”, and “Neutrosophic Edge-Gap” are up. 6183
Thus, let 6184
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6185

GNeutrosophic Edge-Gap be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and 6186
a Neutrosophic Edge-Gap and the new terms are up. 6187
GNeutrosophic Edge-Gap ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6188
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6189
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |

6190
And with go back to initial structure, 6191
GNeutrosophic Edge-Gap ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6193

6194

Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior
Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Edge-Gap if for any of them,

and any of other corresponded Neutrosophic SuperHyperVertex, some interior Neutrosophic

SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no Neutrosophic
exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming
up.
The following Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices is the simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Edge-Gap.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Edge-Gap. The

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Edge-Gap C(ESHG) for an Neutrosophic SuperHyperGraph ESHG :

(V, E) is a Neutrosophic type-SuperHyperSet with
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Edge-Gap is related to the Neutrosophic SuperHyperSet of the Neutrosophic
SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic Super-
HyperSet. Thus the non-obvious Neutrosophic Edge-Gap is up. The obvious simple Neutrosophic
type-SuperHyperSet called the Neutrosophic Edge-Gap is a Neutrosophic SuperHyperSet includes
only one Neutrosophic SuperHyperVertex. But the Neutrosophic SuperHyperSet of Neutro-
sophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Edge-Gap is up. To sum them up, the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Edge-Gap.

Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}

or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Edge-Gap C(ESHG) for an Neutrosophic SuperHyperGraph ESHG : (V, E)
is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s
no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices instead of all
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Edge-Gap and it’s an
Neutrosophic Edge-Gap. Since it’s
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

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

Edge-Gap
not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6195
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6196
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6197
type-SuperHyperSet called the 6198
“Neutrosophic R-Edge-Gap” 6199
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6200
Neutrosophic R-Edge-Gap, 6201
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets

of the Neutrosophic R-Edge-Gap amid those obvious simple Neutrosophic type-SuperHyperSets of

the Neutrosophic Edge-Gap, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Edge-Gap. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a Neutrosophic R-Edge-Gap is the cardinality of
6202
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6203
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Edge-Gap if for 6204
any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6205
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6206
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6207
them. 6208
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6209
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6210
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6211
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6212
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6213
Consider there’s a Neutrosophic R-Edge-Gap with the least cardinality, the lower sharp Neutro- 6214
sophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic SuperHyperGraph 6215
ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6216
VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic SuperHyperVertices such 6217
that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices 6218
uniquely but it isn’t a Neutrosophic R-Edge-Gap. Since it doesn’t have 6219
6220
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6221
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6222
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6223
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6224
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Edge-Gap. 6225
Since it doesn’t do the Neutrosophic procedure such that such that there’s a Neutrosophic 6226
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there are at least 6227
one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected 6228
Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled 6229
its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the Neut- 6230
rosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s only 6231
one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6232

VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6233
Neutrosophic R-Edge-Gap, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet 6234
of the Neutrosophic R-Edge-Gap, VESHE , is a Neutrosophic SuperHyperSet, VESHE , includes 6235
only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs are 6236
titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6237
ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6238
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6239

SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6240
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6241
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Edge-Gap only contains all 6242
interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic SuperHyperVertices 6243
from the unique Neutrosophic SuperHyperEdge where there’s any of them has all possible Neut- 6244
rosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHyperNeighborhoods in 6245

with no exception minus all Neutrosophic SuperHypeNeighbors to some of them not all of them 6246
but everything is possible about Neutrosophic SuperHyperNeighborhoods and Neutrosophic 6247
SuperHyperNeighbors out. 6248
The SuperHyperNotion, namely, Edge-Gap, is up. There’s neither empty SuperHyperEdge 6249
nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6250
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6251

the Neutrosophic Edge-Gap. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6252
perEdges[SuperHyperVertices], 6253

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Edge−GapSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Edge−Gap = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Edge−GapSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Edge-Gap. The Neutrosophic 6254
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6255

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Edge-Gap C(ESHG) for an Neutrosophic SuperHyperGraph ESHG : (V, E) 6256
is a Neutrosophic type-SuperHyperSet with 6257

6258
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6260
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6261
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6262
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6263
non-obvious Neutrosophic Edge-Gap is up. The obvious simple Neutrosophic type-SuperHyperSet 6264
called the Neutrosophic Edge-Gap is a Neutrosophic SuperHyperSet includes only two Neut- 6265
rosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6266
SuperHyperEdges[SuperHyperVertices], 6267

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6268
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6269
Edge-Gap is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6270
perEdges[SuperHyperVertices], 6271

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Edge-Gap. Since 6272
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6273

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.


= az s + bz t .
Is an Neutrosophic Edge-Gap C(ESHG) for an Neutrosophic SuperHyperGraph ESHG : (V, E) 6274

is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6275
no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices given by that 6276

Neutrosophic type-SuperHyperSet called the Neutrosophic Edge-Gap and it’s an Neutrosophic 6277
Edge-Gap. Since it’s 6278
6279
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6281
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6282

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6283
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6284

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Edge-Gap , 6285

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

Edge-Gap 6286

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.


= az s + bz t .
Is the Neutrosophic SuperHyperSet, not: 6287

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6288
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6289
Neutrosophic type-SuperHyperSet called the 6290
“Neutrosophic Edge-Gap ” 6291
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6292
Neutrosophic Edge-Gap , 6293
is only and only 6294

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6295

CHAPTER 31 6296
The Neutrosophic Departures on The 6297
Theoretical Results Toward Theoretical 6298
Motivations 6299
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6300
Neutrosophic SuperHyperClasses. 6301
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6302

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {VEi ∩Ej =1 }.
X |V
= z Ei ∩Ej =1 | .
Proof. Let 6303
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6304
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
315
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6305

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6309
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6310
SuperHyperModel (31.1), is the SuperHyperEdge-Gap. 6311
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6312

= {}.
= 0z 0 .

= {}.
= 0z 0 .
Proof. Let 6313
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6314
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 6315

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6319
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6320
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEdge-Gap. 6321
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6322

= {}.
= 0z 0 .
= {CEN T ER}.
= z |CEN T ER| .

Figure 31.2: a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.7) 136NSHG19a
Proof. Let 6323
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6324
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6325


Figure 31.3: a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6329
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6330
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6331
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6332
the Neutrosophic SuperHyperEdge-Gap. 6333
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6334
Then 6335

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6336
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6337
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6338

ViEXT ERN AL in the literatures of SuperHyperEdge-Gap. The latter is straightforward. Then 6341
there’s no at least one SuperHyperEdge-Gap. Thus the notion of quasi may be up but the 6342
SuperHyperNotions based on SuperHyperEdge-Gap could be applied. There are only two 6343
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEdge-Gap taken from a connected Neutrosophic SuperHyperBipartite 6346
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6347
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6350
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6351
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6352
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6353
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6354

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEdge-Gap in the Example (42.0.11) 136NSHG21a
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6356
Then 6357

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6358
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

6359
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEdge-Gap taken from a connected Neutrosophic SuperHyperMultipartite 6360


Then there’s no at least one SuperHyperEdge-Gap. Thus the notion of quasi may be up but 6364
the SuperHyperNotions based on SuperHyperEdge-Gap could be applied. There are only z 0 6365
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6368
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6369
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6373
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6374
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6375
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6376
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEdge-Gap. 6377
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6378
Then, 6379

Figure 31.5: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6380
P :
CEN T ER, E2∗
6381
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEdge-Gap taken from a connected Neutrosophic SuperHyperWheel 6382


Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEdge-Gap in the Neutrosophic Example (42.0.15) 136NSHG23a
Then there’s at least one SuperHyperEdge-Gap. Thus the notion of quasi isn’t up and the 6386
SuperHyperNotions based on SuperHyperEdge-Gap could be applied. The unique embedded 6387
SuperHyperEdge-Gap proposes some longest SuperHyperEdge-Gap excerpt from some representatives. 6388
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6390
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6391
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6392
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6393
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEdge-Gap. 6394

CHAPTER 32 6395
The Surveys of Mathematical Sets On 6396
The Results But As The Initial Motivation 6397
For the SuperHyperEdge-Gap, Neutrosophic SuperHyperEdge-Gap, and the Neutrosophic 6398

SuperHyperEdge-Gap, some general results are introduced. 6399
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEdge-Gap is “redefined” on the 6400
positions of the alphabets. 6401
Corollary 32.0.2. Assume Neutrosophic SuperHyperEdge-Gap. Then 6402
N eutrosophic SuperHyperEdge − Gap =

{theSuperHyperEdge − Gapof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEdge − Gap
|N eutrosophiccardinalityamidthoseSuperHyperEdge−Gap. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6403
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6404
the neutrality, for i = 1, 2, 3, respectively. 6405
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6406
alphabet. Then the notion of Neutrosophic SuperHyperEdge-Gap and SuperHyperEdge-Gap coincide. 6407
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6408
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6409
SuperHyperEdge-Gap if and only if it’s a SuperHyperEdge-Gap. 6410
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6411
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperEdge-Gap 6412
if and only if it’s a longest SuperHyperEdge-Gap. 6413
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6414

identical letter of the alphabet. Then its Neutrosophic SuperHyperEdge-Gap is its SuperHyperEdge-Gap 6415
and reversely. 6416
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEdge-Gap, SuperHyper- 6417
Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 6418
325
letter of the alphabet. Then its Neutrosophic SuperHyperEdge-Gap is its SuperHyperEdge-Gap and 6419
reversely. 6420
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6421

Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6423
Neutrosophic SuperHyperEdge-Gap isn’t well-defined if and only if its SuperHyperEdge-Gap isn’t 6424
well-defined. 6425

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 6427
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6429

Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6431

Neutrosophic SuperHyperEdge-Gap is well-defined if and only if its SuperHyperEdge-Gap is well- 6432
defined. 6433

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 6435
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6437
(i) : the dual SuperHyperDefensive SuperHyperEdge-Gap; 6438
(ii) : the strong dual SuperHyperDefensive SuperHyperEdge-Gap; 6439
(iii) : the connected dual SuperHyperDefensive SuperHyperEdge-Gap; 6440
(iv) : the δ-dual SuperHyperDefensive SuperHyperEdge-Gap; 6441
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEdge-Gap; 6442
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEdge-Gap. 6443
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6444
(iii) : the connected defensive SuperHyperDefensive SuperHyperEdge-Gap; 6447
Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 6451
independent SuperHyperSet is 6452

(iii) : the connected SuperHyperDefensive SuperHyperEdge-Gap; 6455
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6459

Graph which is a SuperHyperEdge-Gap/SuperHyperPath. Then V is a maximal 6460
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEdge-Gap; 6464
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEdge-Gap; 6465
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEdge-Gap; 6466
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6468

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6469
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEdge-Gap; 6473
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEdge-Gap; 6474
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEdge-Gap; 6475
Graph which is a SuperHyperEdge-Gap/SuperHyperPath. Then the number of 6478
(i) : the SuperHyperEdge-Gap; 6479
(ii) : the SuperHyperEdge-Gap; 6480
(iii) : the connected SuperHyperEdge-Gap; 6481
(iv) : the O(ESHG)-SuperHyperEdge-Gap; 6482

(v) : the strong O(ESHG)-SuperHyperEdge-Gap; 6483
(vi) : the connected O(ESHG)-SuperHyperEdge-Gap. 6484
coincide. 6486

Graph which is a SuperHyperWheel. Then the number of 6488
(i) : the dual SuperHyperEdge-Gap; 6489
(ii) : the dual SuperHyperEdge-Gap; 6490
(iii) : the dual connected SuperHyperEdge-Gap; 6491
(iv) : the dual O(ESHG)-SuperHyperEdge-Gap; 6492
(v) : the strong dual O(ESHG)-SuperHyperEdge-Gap; 6493
(vi) : the connected dual O(ESHG)-SuperHyperEdge-Gap. 6494
coincide. 6496
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6497

perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6498
Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6499
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6500
SuperHyperVertices is a 6501
O(ESHG)
O(ESHG)
O(ESHG)

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6509
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6510
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6511
SuperHyperPart is a 6512

(iv) : δ-SuperHyperDefensive SuperHyperEdge-Gap; 6516
(v) : strong δ-SuperHyperDefensive SuperHyperEdge-Gap; 6517
(vi) : connected δ-SuperHyperDefensive SuperHyperEdge-Gap. 6518

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6520
plete SuperHyperMultipartite. Then Then the number of 6521
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6528
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6529
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6531
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6532
(iv) : SuperHyperEdge-Gap; 6536
Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6539
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6540
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6541
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6542
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 6543
t>
2



Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6550
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6551
of dual 6552
(iv) : 0-SuperHyperDefensive SuperHyperEdge-Gap; 6556

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6560
SuperHyperEdge-Gap/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 6562

and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6563
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEdge-Gap; 6567
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEdge-Gap; 6568
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEdge-Gap. 6569

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number 6571
is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), 6572
t>
2
in the setting of a dual 6573



Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6580
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6581
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6582
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6583
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6584

a dual SuperHyperDefensive SuperHyperEdge-Gap, then ∀v ∈ V \ S, ∃x ∈ S such that 6585
(i) v ∈ Ns (x); 6586
(ii) vx ∈ E. 6587
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6588

a dual SuperHyperDefensive SuperHyperEdge-Gap, then 6589
(i) S is SuperHyperEdge-Gap set; 6590
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6591
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6592
(i) Γ ≤ O; 6593
(ii) Γs ≤ On . 6594
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6595
connected. Then 6596
(i) Γ ≤ O − 1; 6597
(ii) Γs ≤ On − Σ3i=1 σi (x). 6598
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6599

Gap; 6601
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6603
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6604
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6606
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEdge-Gap; 6607

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6608
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6609
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6610
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEdge-Gap. Then 6612
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEdge-Gap; 6613
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6614
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6615
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6616
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEdge-Gap. Then 6618

Gap; 6620
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6622
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6623
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6625
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEdge-Gap; 6626
(ii) Γ = 1; 6627
(iii) Γs = Σ3i=1 σi (c); 6628
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEdge-Gap. 6629
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6630
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6631
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6633
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6634
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6635
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6637

b n c+1
2
(ii) Γ = b n2 c + 1; 6639

b n c+1 ; 6640
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperEdge-Gap. 6641
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6642
bnc
2
(ii) Γ = b n2 c; 6644

bnc ; 6645
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive 6646
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6648

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6649
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEdge-Gap 6650

for N SHF; 6651
(ii) Γ = m for N SHF : (V, E); 6652
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6653
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEdge-Gap for 6654
N SHF : (V, E). 6655
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6656

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6657
b n c+1
2
is a dual maximal SuperHyperDefensive SuperHyperEdge- 6658
Gap for N SHF; 6659
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6660

b n c+1 for N SHF : (V, E); 6661
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperEdge-Gap for 6662
N SHF : (V, E). 6663
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6664

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6665
bnc
2
is a dual SuperHyperDefensive SuperHyperEdge-Gap for 6666
N SHF : (V, E); 6667

(ii) Γ = b n2 c for N SHF : (V, E); 6668

bnc for N SHF : (V, E); 6669
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEdge-Gap for N SHF : 6670
(V, E). 6671
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6674

SuperHyperEdge-Gap, then S is an s-SuperHyperDefensive SuperHyperEdge-Gap; 6675

SuperHyperEdge-Gap, then S is a dual s-SuperHyperDefensive SuperHyperEdge-Gap. 6677
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6680

SuperHyperEdge-Gap, then S is an s-SuperHyperPowerful SuperHyperEdge-Gap; 6681

SuperHyperEdge-Gap, then S is a dual s-SuperHyperPowerful SuperHyperEdge-Gap. 6683
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6684

(i) if ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6688
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 6690

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual V-SuperHyperDefensive 6692

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6694

(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6698

(iii) ∀a ∈ S, |Ns (a)∩V \S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive SuperHyperEdge- 6700
Gap; 6701

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual V-SuperHyperDefensive 6702


(i) ∀a ∈ S, |Ns (a) ∩ S| b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6708
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 6710

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual (O − 1)-SuperHyperDefensive 6712


(i) if ∀a ∈ S, |Ns (a) ∩ S| b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 6718
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is (O − 1)-SuperHyperDefensive 6720
(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual (O − 1)- 6722


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEdge- 6726
Gap; 6727
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6728

(iii) ∀a ∈ S, |Ns (a)∩V \S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive SuperHyperEdge- 6730

Gap; 6731
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6732

(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 6736

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6738
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 6740

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6742


CHAPTER 33 6744
Neutrosophic Applications in Cancer’s 6745
Neutrosophic Recognition 6746
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6747
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6748
disease is considered and as the consequences of the model, some parameters are used. The cells 6749
are under attack of this disease but the moves of the cancer in the special region are the matter 6750
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6751
treatments for this Neutrosophic disease. 6752
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6753
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6754
term Neutrosophic function. 6755
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6756
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6757
move from the cancer is identified by this research. Sometimes the move of the cancer 6758
about the moves and the effects of the cancer on that region; this event leads us to 6760
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6761
perception on what’s happened and what’s done. 6762
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6763
known and they’ve got the names, and some general Neutrosophic models. The moves 6764
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6765
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEdge- 6766
Gap, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 6767
The aim is to find either the Neutrosophic SuperHyperEdge-Gap or the Neutrosophic 6768
SuperHyperEdge-Gap in those Neutrosophic Neutrosophic SuperHyperModels. 6769
337
CHAPTER 34 6770
Case 1: The Initial Neutrosophic Steps 6771
Toward Neutrosophic 6772
SuperHyperBipartite as Neutrosophic 6773
SuperHyperModel 6774
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6775
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6776
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

339
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6777
perBipartite is obtained. 6778
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6779
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6780
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6781
(34.1), is the Neutrosophic SuperHyperEdge-Gap. 6782

CHAPTER 35 6783
Case 2: The Increasing Neutrosophic 6784
Steps Toward Neutrosophic 6785
SuperHyperMultipartite as 6786
Neutrosophic SuperHyperModel 6787
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6788
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6789
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6790
perMultipartite is obtained. 6791
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6792
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

341
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6793

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6794
Neutrosophic SuperHyperEdge-Gap. 6795

CHAPTER 36 6796
Wondering Open Problems But As The 6797
Directions To Forming The Motivations 6798
In what follows, some “problems” and some “questions” are proposed. 6799
The SuperHyperEdge-Gap and the Neutrosophic SuperHyperEdge-Gap are defined on a real-world 6800
application, titled “Cancer’s Recognitions”. 6801
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6802
recognitions? 6803
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEdge-Gap and the 6804
Neutrosophic SuperHyperEdge-Gap? 6805
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6806
them? 6807
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEdge-Gap 6808
and the Neutrosophic SuperHyperEdge-Gap? 6809
Problem 36.0.5. The SuperHyperEdge-Gap and the Neutrosophic SuperHyperEdge-Gap do a 6810

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperEdge-Gap, are 6811
there else? 6812
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6813
Numbers types-results? 6814
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6815
the multiple types of SuperHyperNotions? 6816
343
CHAPTER 37 6817
Conclusion and Closing Remarks 6818
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6819
research are illustrated. Some benefits and some advantages of this research are highlighted. 6820
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6821
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEdge-Gap. For 6822
that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph is 6823
redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6824
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEdge-Gap, finds the 6825
convenient background to implement some results based on that. Some SuperHyperClasses and 6826
some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 6827
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 6828
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 6829
SuperHyperEdge-Gap, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some 6830
general results are gathered in the section on the SuperHyperEdge-Gap and the Neutrosophic 6831
SuperHyperEdge-Gap. The clarifications, instances and literature reviews have taken the whole 6832
way through. In this research, the literature reviews have fulfilled the lines containing the 6833
notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 6834
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 6835
based on the connectivities of the moves of the cancer in the longest and strongest styles with 6838
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 6841
benefits and avenues for this research are, figured out, pointed out and spoken out. 6842
345
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEdge-Gap
3. Neutrosophic SuperHyperEdge-Gap 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6843
Neutrosophic SuperHyperDuality But As 6844
Super Forms 6846
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6847

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6851

Va ∈ Ei , Ej ; 6852
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6853

Va ∈ Ei , Ej and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6854
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6855

Vi , Vj ∈ Ea ; 6856
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6857

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6858
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6859

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6860
sophic rv-SuperHyperDuality. 6861
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6862

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6865

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6867
347
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6872

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6874
form the Neutrosophic SuperHyperDuality; 6878
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6879
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6880

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6881
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 6886
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6888

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6890
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6896
coefficient; 6897
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6898

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6900
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6905

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6906
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6907
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6908
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6909
that they form the Neutrosophic SuperHyperDuality; 6911
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6912

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6913
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6914

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6916
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6919
power is corresponded to its Extreme coefficient; 6920
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6921

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6923

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6929
coefficient. 6930
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6931
the mentioned Neutrosophic Figures in every Neutrosophic items. 6932

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6934
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6935
C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.

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


every given Neutrosophic SuperHyperDuality. 6949




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

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


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

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

C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .

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


4 × 5 × 5z 3 .

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.

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


4 × 5 × 5z 3 .

3 × 3z 2 .



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


3 × 3z 2 .





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



(1 × 1 × 2)z.


(2 × 2 × 2)z.

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

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







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

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

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


SuperHyperModel (31.1), is the SuperHyperDuality. 7000
C(N SHG)Neutrosophic SuperHyperDuality =

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7009
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.

Proof. Let 7011


the Neutrosophic SuperHyperDuality. 7020
Then 7022
C(N SHG)Neutrosophic Quasi-SuperHyperDuality

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 |
Neutrosophic Cardinality
Proof. Let 7023
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7029
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7032

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7042

(V, E). Then 7043

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

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


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7049
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7050
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 Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7062
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7063
Then, 7064
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
|z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 7065
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Neutrosophic Cardinality +1
ESHG:(V,E) Neutrosophic Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperWheel 7066


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7071
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7072
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7078

CHAPTER 39 7079
Neutrosophic SuperHyperJoin But As 7080
Super Forms 7082
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7083

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7087
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7089

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = 7090
|Ej |NEUTROSOPHIC CARDINALITY ; 7091
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7092

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7094

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7095
|Vj |NEUTROSOPHIC CARDINALITY ; 7096
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7097

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7098
rv-SuperHyperJoin. 7099
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7100

(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7103

361

Extreme SuperHyperJoin; 7109
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7110

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7112
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7113
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7114
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7115
Neutrosophic SuperHyperJoin; 7116
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7117

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7118
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7119
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7124
coefficient; 7125
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7126

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7127
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7128
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7129
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7130
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7131
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7132

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7133
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7134
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7135

Extreme SuperHyperJoin; 7141
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7142

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7144
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7145
Neutrosophic SuperHyperJoin; 7148

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7149

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7151

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7156
its Extreme coefficient; 7157
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7158

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7160
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7161

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7162
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7163
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7166
coefficient. 7167
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7171


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

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


every given Neutrosophic SuperHyperJoin. 7186




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

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


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V5 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

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

C(N SHG)Neutrosophic SuperHyperJoin = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z 3 .

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


4 × 5 × 5z 3 .

C(N SHG)Neutrosophic SuperHyperJoin = {E3i+13i=0 , E23 }.

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


4 × 5 × 5z 3 .

3 × 3z 2 .



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


3 × 3z 2 .





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



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


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

C(N SHG)Neutrosophic SuperHyperJoin = {E3i+1i=03 }.

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




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



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

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

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


SuperHyperModel (31.1), is the SuperHyperJoin. 7237

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7246
C(N SHG)Neutrosophic Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

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

Proof. Let 7248


the Neutrosophic SuperHyperJoin. 7257
Then 7259
C(N SHG)Neutrosophic Quasi-SuperHyperJoin

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.


i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

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

based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 7266
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7268

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7279

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

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7281


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 7286
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 Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperJoin. 7297

Then, 7299

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

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


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7305
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7306
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7307
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7312

CHAPTER 40 7313
Neutrosophic SuperHyperPerfect But As 7314
Super Forms 7316
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7317

(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 7321

Va ∈ Ei , Ej ; 7322
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \E 0 , ∃!Ej ∈ E 0 , such that 7323

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7324
(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7325

Vi , Vj ∈ Ea ; 7326
(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7327

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7328
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7329

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7330
rv-SuperHyperPerfect. 7331
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7332

(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7335

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7337
375
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7342

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7344
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7345
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7346
form the Neutrosophic SuperHyperPerfect; 7348
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7349

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7350
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7351
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7358

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7360
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7366
coefficient; 7367
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7368

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7370
(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic e- 7375

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7376
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7377
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7378
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7379
that they form the Neutrosophic SuperHyperPerfect; 7381
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7382

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7384

(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7391

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7393

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7399
coefficient. 7400

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7404

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

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


every given Neutrosophic SuperHyperPerfect. 7419





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

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


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperPerfect = {E3i+13i=0 , E3i+243i=0 }.

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

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


3 × 4 × 4z 3 .

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

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


3 × 4 × 4z 3 .


3 × 2z 2 .


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



3 × 3z 2 .






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


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



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

C(N SHG)Neutrosophic SuperHyperPerfect = {E3i+1i=03 }.

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





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

C(N SHG)Neutrosophic SuperHyperPerfect =

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

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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7470
C(N SHG)Neutrosophic SuperHyperPerfect =

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


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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperPerfect. 7479
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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



the Neutrosophic SuperHyperPerfect. 7490
Then 7492
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect

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

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


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 7497
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7498
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7499
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7502

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7513

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

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



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 7518
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 7519
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 7520
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 Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperPerfect. 7532
Then, 7534
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7536


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7539
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7540
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7541
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7542
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7548

CHAPTER 41 7549
Neutrosophic SuperHyperTotal But As 7550
Super Forms 7552
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7553

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7557

Va ∈ Ei , Ej ; 7558
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7559

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7560
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7561

Vi , Vj ∈ Ea ; 7562
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7563

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7564
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7565

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7566
rv-SuperHyperTotal. 7567
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7568

(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7571

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7573
Extreme SuperHyperTotal; 7577
389
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7578

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7580
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7581
Neutrosophic SuperHyperTotal; 7584
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7585
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7586

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7587
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7592
coefficient; 7593
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7594
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7595

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7596
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7597
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7598
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7599
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7600
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7601
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7602
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7603

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7605
Extreme SuperHyperTotal; 7609
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7610

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7612
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7613
Neutrosophic SuperHyperTotal; 7616
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7617

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7618
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7619

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7624
its Extreme coefficient; 7625
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7626
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7627

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7628
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7629
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7630
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7631
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7632
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7633
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7634

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7638

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

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


every given Neutrosophic SuperHyperTotal. 7653




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

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


C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperTotal = {Ei+19i=0 }.

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




3 × 4 × 4z 3 .


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


3 × 4 × 4z 3 .

C(N SHG)Extreme SuperHyperTotal = {E1 , E6 , E7 , E8 }.



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









4 × 3z 3 .


4 × 3z 4 .


2 × 4 × 3z 4 .



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


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

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

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


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

C(N SHG)Neutrosophic SuperHyperTotal =

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

SuperHyperModel (31.1), is the SuperHyperTotal. 7704
C(N SHG)Neutrosophic SuperHyperTotal =

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

Proof. Let 7706
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Neutrosophic Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperTotal. 7713
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

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


the Neutrosophic SuperHyperTotal. 7724
Then 7726
C(N SHG)Neutrosophic SuperHyperTotal

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

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

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7733
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7735

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7746

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

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7748


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7753
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperTotal. 7764
Then, 7766
∗
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality
|z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.

Proof. Let 7767
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7768


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7772
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7773
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7774
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7780

CHAPTER 42 7781
Neutrosophic SuperHyperConnected But 7782
As The Extensions Excerpt From Dense 7783
And Super Forms 7784
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7785

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7789
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7790
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7791

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7792
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7793
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7794

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7795
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7796

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7797
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7798
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7799
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7800
rosophic rv-SuperHyperConnected. 7801
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7802

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7805
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7806
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7807
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 7808
403
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 7809
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 7810
form the Extreme SuperHyperConnected; 7811
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7812

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7813
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7814
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 7815
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 7816
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 7817

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7818
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7819
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7820

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7821
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7822
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7828

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7829
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7830
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7831
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7832
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7833
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 7834

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7835
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 7836
Neutrosophic coefficient; 7837
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7838

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7840
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7841
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7842
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 7843
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7844
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7845

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 7847
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 7848
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 7849
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 7850
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7851

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7852

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7855
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 7856

and the Extreme power is corresponded to its Extreme coefficient; 7860
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7861

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7864
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7865
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7866
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 7867

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7868
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 7869
Neutrosophic coefficient. 7870
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7873
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7874
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7876
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7877

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7878
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7879
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7880
C(N SHG)Neutrosophic SuperHyperConnected = {E4 }.

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

every given Neutrosophic SuperHyperConnected. 7888


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

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

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

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


C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z 3 .
• On the Figure (??), the Neutrosophic SuperHyperNotion, namely, Neutrosophic SuperHy- 7899
perConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7900
C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.

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

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

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

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-SuperHyperConnected = {V1 , V5 }.



4 × 3z 3 .

4 × 3z 4 .


2 × 4 × 3z 4 .

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


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

= 3 × 6z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

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

SuperHyperModel (31.1), is the SuperHyperConnected. 7939
C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

|EESHG:(V,E) |
−2
= {Ei }i=1 .
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperConnected. 7948
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

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



the Neutrosophic SuperHyperConnected. 7959
Then 7961
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

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

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

there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 7967
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7968
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7971

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7982
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

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

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

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7984


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7988
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7989
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7990
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperConnected. 8001
Then, 8003
∗
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 8004
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8005


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8008
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8009
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8010
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8011
some representatives. The latter is straightforward. 8012
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8017

CHAPTER 43 8018
Background 8019

417













[HG32b; HG44b]. 8227

Bibliography 8228
10.33140/JMTCM.01.03.09) 8232


423
10.20944/preprints202301.0282.v1). 8265
10.20944/preprints202301.0267.v1). 8268

(doi: 10.20944/preprints202301.0265.v1). 8273
prints202301.0262.v1). 8277
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8283
prints202301.0105.v1). 8286
Preprints 2023, 2023010044 8292
10.20944/preprints202301.0043.v1). 8295

(doi: 10.20944/preprints202212.0549.v1). 8304
(doi: 10.20944/preprints202212.0500.v1). 8311
(doi: 10.5281/zenodo.7904698). 8320
2023, (doi: 10.5281/zenodo.7904671). 8323

10.5281/zenodo.7871026). 8332
2023, (doi: 10.5281/zenodo.7874647). 8335

10.5281/zenodo.7857856). 8338
2023, (doi: 10.5281/zenodo.7857841). 8341
10.5281/zenodo.7853867). 8350
10.5281/zenodo.7853922). 8353
(doi: 10.5281/zenodo.7851519). 8356
(doi: 10.5281/zenodo.7851550). 8359
10.5281/zenodo.7834229). 8368
10.5281/zenodo.7834261). 8371
10.5281/zenodo.7824560). 8374

(doi: 10.5281/zenodo.7824623). 8377
2023, (doi: 10.5281/zenodo.7809365). 8388
2023, (doi: 10.5281/zenodo.7809358). 8391

10.5281/zenodo.7809219). 8394
10.5281/zenodo.7809328). 8397
2023, (doi: 10.5281/zenodo.7806767). 8400
2023, (doi: 10.5281/zenodo.7806838). 8403
10.5281/zenodo.7799902). 8412

(doi: 10.5281/zenodo.7804218). 8415
(doi: 10.5281/zenodo.7796334). 8418
10.5281/zenodo.7791952). 8424
10.5281/zenodo.7791982). 8427
10.5281/zenodo.7790026). 8430
10.5281/zenodo.7790052). 8433
2023, (doi: 10.5281/zenodo.7787066). 8436
10.5281/zenodo.7781476). 8442
10.5281/zenodo.7783082). 8445
10.5281/zenodo.7777857). 8448
10.5281/zenodo.7779286). 8451

(doi: 10.5281/zenodo.7771831). 8454
2023, (doi: 10.5281/zenodo.7772468). 8457
10.13140/RG.2.2.20913.25446). 8460
odo.7764916). 8463
10.13140/RG.2.2.11770.98247). 8466
10.13140/RG.2.2.12400.12808). 8469
2023, (doi: 10.13140/RG.2.2.22545.10089). 8472
10.13140/RG.2.2.11377.76644). 8478
10.13140/RG.2.2.23750.96329). 8481
10.13140/RG.2.2.31366.24641). 8484
10.13140/RG.2.2.34721.68960). 8487
2023, (doi: 10.13140/RG.2.2.30212.81289). 8490

10.13140/RG.2.2.24288.35842). 8496
10.13140/RG.2.2.32467.25124). 8499
10.13140/RG.2.2.31025.45925). 8502
10.13140/RG.2.2.17184.25602). 8505
10.13140/RG.2.2.23423.28327). 8508
10.13140/RG.2.2.28456.44805). 8511
10.13140/RG.2.2.23525.68320). 8514
10.13140/RG.2.2.20170.24000). 8517
10.13140/RG.2.2.36475.59683). 8520
10.13140/RG.2.2.29764.71046). 8523
2023, (doi: 10.13140/RG.2.2.18780.87683). 8526

10.13140/RG.2.2.26134.01603). 8532
10.13140/RG.2.2.27392.30721). 8535
10.13140/RG.2.2.33028.40321). 8538
10.13140/RG.2.2.21389.20966). 8541
10.13140/RG.2.2.16356.04489). 8544
10.13140/RG.2.2.21756.21129). 8547
10.13140/RG.2.2.30983.68009). 8550
10.13140/RG.2.2.28552.29445). 8553
(doi: 10.13140/RG.2.2.10936.21761). 8556
10.13140/RG.2.2.35105.89447). 8559
(doi: 10.13140/RG.2.2.30072.72960). 8562
10.13140/RG.2.2.31147.52003). 8565
10.13140/RG.2.2.32825.24163). 8568

10.13140/RG.2.2.13059.58401). 8571
10.13140/RG.2.2.11172.14720). 8574
2023, (doi: 10.13140/RG.2.2.22011.80165). 8577
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8580
2023, (doi: 10.13140/RG.2.2.10493.84962). 8583
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8586
2023, (doi: 10.13140/RG.2.2.19944.14086). 8589
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8592
(doi: 10.13140/RG.2.2.33103.76968). 8595
(doi: 10.13140/RG.2.2.23037.44003). 8598
(doi: 10.13140/RG.2.2.35646.56641). 8601
10.13140/RG.2.2.18030.48967). 8604
(doi: 10.13140/RG.2.2.13973.81121). 8607

2023, (doi: 10.13140/RG.2.2.34106.47047). 8610
2023, (doi: 10.13140/RG.2.2.31956.88961). 8616
2023, (doi: 10.13140/RG.2.2.15179.67361). 8619
10.13140/RG.2.2.21510.45125). 8622
2023, (doi: 10.13140/RG.2.2.13121.84321). 8625
10.13140/RG.2.2.11758.69441). 8628
2023, (doi: 10.13140/RG.2.2.31891.35367). 8631
10.13140/RG.2.2.19360.87048). 8634
10.13140/RG.2.2.32363.21286). 8637
10.13140/RG.2.2.23266.81602). 8640
10.13140/RG.2.2.19911.37285). 8643
10.13140/RG.2.2.11050.90569). 8646

2023, (doi: 10.13140/RG.2.2.17761.79206). 8649
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8655
(doi: 10.13140/RG.2.2.30182.50241). 8658

2023, (doi: 10.13140/RG.2.2.17252.24968). 8691

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8700
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8703


2023,(doi: 10.13140/RG.2.2.36745.93289). 8717
10.20944/preprints202301.0282.v1). 8724

10.20944/preprints202301.0267.v1).). 8727
(doi: 10.20944/preprints202301.0265.v1). 8732
prints202301.0262.v1). 8736

2023010224, (doi: 10.20944/preprints202301.0224.v1). 8742

10.13140/RG.2.2.35061.65767). 8745

10.13140/RG.2.2.18494.15680). 8749

10.13140/RG.2.2.32530.73922). 8753

10.13140/RG.2.2.15897.70243). 8757

10.13140/RG.2.2.32530.73922). 8761
prints202301.0105.v1). 8764

10.13140/RG.2.2.23172.19849). 8771
10.13140/RG.2.2.17385.36968). 8781
Preprints 2023, 2023010044 8784

10.20944/preprints202301.0043.v1). 8787
2023, (doi: 10.13140/RG.2.2.28945.92007). 8790
10.13140/RG.2.2.35774.77123). 8796

10.13140/RG.2.2.29430.88642). 8802


(doi: 10.20944/preprints202212.0549.v1). 8808
10.13140/RG.2.2.19380.94084). 8811
(doi: 10.20944/preprints202212.0500.v1). 8822

10.13140/RG.2.2.20993.12640). 8825

10.13140/RG.2.2.29173.86244). 8840

2023 (doi: 10.5281/zenodo.7905287). 8845
2023 (doi: 10.5281/zenodo.7874677). 8849
(doi: 10.5281/zenodo.7857906). 8851
2023 (doi: 10.5281/zenodo.7856329). 8853
10.5281/zenodo.7854561). 8855
2023 (doi: 10.5281/zenodo.7851893). 8857

(doi: 10.5281/zenodo.7835063). 8861
(doi: 10.5281/zenodo.7826705). 8863
2023 (doi: 10.5281/zenodo.7820680). 8865
10.5281/zenodo.7812750). 8867


2023 (doi: 10.5281/zenodo.7807782). 8873
2023 (doi: 10.5281/zenodo.7804449). 8875


(doi: 10.5281/zenodo.7792307). 8879
(doi: 10.5281/zenodo.7790728). 8881
2023 (doi: 10.5281/zenodo.7787712). 8883
10.5281/zenodo.7783791). 8885
10.5281/zenodo.7780123). 8887
(doi: 10.5281/zenodo.7773119). 8889
odo.7637762). 8891
10.5281/zenodo.7766174). 8893
10.5281/zenodo.7762232). 8895
(doi: 10.5281/zenodo.7758601). 8897
10.5281/zenodo.7754661). 8899
10.5281/zenodo.7750995) . 8901
(doi: 10.5281/zenodo.7749875). 8903
10.5281/zenodo.7747236). 8905
10.5281/zenodo.7742587). 8907
(doi: 10.5281/zenodo.7738635). 8909
10.5281/zenodo.7734719). 8911

10.5281/zenodo.7730484). 8913
(doi: 10.5281/zenodo.7730469). 8915
10.5281/zenodo.7722865). 8917
odo.7713563). 8919
odo.7709116). 8921
10.5281/zenodo.7706415). 8923
10.5281/zenodo.7706063). 8925
10.5281/zenodo.7701906). 8927
odo.7700205). 8929
10.5281/zenodo.7694876). 8931
10.5281/zenodo.7679410). 8933
10.5281/zenodo.7675982). 8935
10.5281/zenodo.7672388). 8937
odo.7668648). 8939
10.5281/zenodo.7662810). 8941
10.5281/zenodo.7659162). 8943
odo.7653233). 8945
odo.7653204). 8947

odo.7653142). 8949
odo.7653117). 8951
odo.7651687). 8954
odo.7651619). 8956
odo.7651439). 8958
odo.7650729). 8960
odo.7647868). 8962
odo.7647017). 8964
odo.7644894). 8966
odo.7632923). 8969
odo.7623459). 8971
10.5281/zenodo.7606416). 8973
10.5281/zenodo.7606416). 8975
odo.7606404). 8977
10.5281/zenodo.7580018). 8979
odo.7580018). 8981

odo.7580018). 8983
odo.7579929). 8985
10.5281/zenodo.7563170). 8987
odo.7563164). 8989
odo.7563160). 8991
odo.7563160). 8993
10.5281/zenodo.7563160). 8995
10.5281/zenodo.7557063). 8997
10.5281/zenodo.7557009). 8999
10.5281/zenodo.7539484). 9001
10.5281/zenodo.7523390). 9003
10.5281/zenodo.7523390). 9005
10.5281/zenodo.7523390). 9007
odo.7574952). 9009
10.5281/zenodo.7574992). 9011
odo.7523357). 9013
10.5281/zenodo.7523357). 9015
10.5281/zenodo.7504782). 9017

10.5281/zenodo.7504782). 9019
10.5281/zenodo.7504782). 9021
10.5281/zenodo.7499395). 9023
odo.7499395). 9025
10.5281/zenodo.7499395). 9027
10.5281/zenodo.7497450). 9029
10.5281/zenodo.7497450). 9031
10.5281/zenodo.7494862). 9033
odo.7494862). 9035
10.5281/zenodo.7494862). 9037
10.5281/zenodo.7493845). 9039
odo.7493845). 9041
10.5281/zenodo.7493845). 9043
odo.7539484). 9045
odo.7523390). 9047
odo.7523357). 9049
odo.7504782). 9051
odo.7499395). 9053

odo.7497450). 9055
odo.7494862). 9057
odo.7493845). 9059
odo.7480110). 9061
odo.7378758). 9063
odo.6320305). 9065
odo.6677173). 9067

CHAPTER 44 9068
Books’ Contributions 9069
“Books’ Contributions”: | Featured Threads 9070

The following references are cited by chapters. 9071
9072
[Ref264] 9073
Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s Recognition 9074
With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7923632). 9075
9076
[Ref265] 9077
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9078
Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zenodo.7916595). 9079
9080
The links to the contributions of this scientific research book are listed below. 9081
[HG264] 9082

9085
[TITLE] “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s Recogni- 9086
tion With (Neutrosophic) SuperHyperGraph” 9087
9088
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9089
https://www.researchgate.net/publication/370658916 9090
9091
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9092
https://www.scribd.com/document/644493371 9093
9094
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9095
https://zenodo.org/record/7923632 9096
9097
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9098
https://www.academia.edu/101601205 9099
9100
[ADDRESSED CITATION] 9101
447
Figure 44.1: Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-
Gap In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7923632).

[ASSIGNED NUMBER] #264 Article 9104
[DATE] May 2023 9105
[DOI] 10.5281/zenodo.7923632 9106
[LICENSE] CC BY-NC-ND 4.0 9107
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9108
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9109

ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9110
9111
[HG265] 9112
9115
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9116
Edge-Gap As Hyper Gape On Super Gab” 9117
9118
https://www.researchgate.net/publication/370631848 9120
9121
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9122
https://www.scribd.com/document/644110565 9123
9124
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9125
9127

10.5281/zenodo.7923632).
10.5281/zenodo.7923632).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi:
10.5281/zenodo.7916595).
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9128

https://www.academia.edu/101521585 9129
9130

[ASSIGNED NUMBER] #265 Article 9134
[DATE] May 2023 9135
[DOI] 10.5281/zenodo.7916595 9136
[LICENSE] CC BY-NC-ND 4.0 9137

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9138
[AVAILABLE AT TWITTER’S IDS] 9139
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9140
googlebooks GooglePlay 9141
9142
[ASSIGNED NUMBER] | Book #171 9143

HG171b
Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 9145
odo.7923786). 9146
[TITLE] Edge-Gap In SuperHyperGraphs 9147
#Latest_Updates 9148
#The_Links 9149

10.5281/zenodo.7916595).
10.5281/zenodo.7916595).

9153
9155
#The_Links 9156
9157
[ASSIGNED NUMBER] | Book #171 9158
9159
[TITLE] Edge-Gap In SuperHyperGraphs 9160
9161
9165
– 9166
9167
[PUBLISHER] 9168
(Paperback): https://www.amazon.com/dp/- 9169
(Hardcover): https://www.amazon.com/dp/- 9170

(Kindle Edition): https://www.amazon.com/dp/- 9171
9172
– 9173
9174
[ISBN] 9175
(Paperback): - 9176
(Hardcover): - 9177
(Kindle Edition): CC BY-NC-ND 4.0 9178
(EBook): CC BY-NC-ND 4.0 9179
9180
– 9181
9182
[PRINT LENGTH] 9183
(Paperback): - pages 9184
(Hardcover): - pages 9185
(Kindle Edition): - pages 9186
(E-Book): - pages 9187
9188
– 9189
9190
9192
#The_Links 9193
9194
https://www.researchgate.net/publication/- 9196
9197
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9198

https://drhenrygarrett.wordpress.com/2023/07/22/ 9199
Edge-Gap-In-SuperHyperGraphs/ 9200
9201
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9202
https://www.scribd.com/document/- 9203
9204
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9205

https://www.academia.edu/- 9206
9207
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9208
9210
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9211
https://books.google.com/books/about?id=- 9212
9213
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9214
https://play.google.com/store/books/details?id=- 9215

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9216

9217
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9218
9219
https://drhenrygarrett.wordpress.com/2023/07/22/ 9220
Edge-Gap-In-SuperHyperGraphs/ 9221
9222
– 9223
9224
[POSTED BY] Dr. Henry Garrett 9225
9226
[DATE] May 011, 2023 9227

9228
[POSTED IN] 171 | Edge-Gap In SuperHyperGraphs 9229
9230
[TAGS] 9231
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9232
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9233
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9234
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9235
neutrosophic SuperHyperGraphs, Neutrosophic Edge-Gap In SuperHyperGraphs, Open Prob- 9236
lems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 9237
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 9238
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 9239
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 9240

SuperHyperGraphs, Edge-Gap In SuperHyperGraphs, SuperHyperModeling, SuperHyperVer- 9241
tices, Theoretical Research, Vertex, Vertices. 9242
In this scientific research book, there are some scientific research chapters on “Extreme 9243
Edge-Gap In SuperHyperGraphs” and “Neutrosophic Edge-Gap In SuperHyperGraphs” about 9244
some scientific research on Edge-Gap In SuperHyperGraphs by two (Extreme/Neutrosophic) 9245
notions, namely, Extreme Edge-Gap In SuperHyperGraphs and Neutrosophic Edge-Gap In 9246

SuperHyperGraphs. With scientific research on the basic scientific research properties, the 9247
scientific research book starts to make Extreme Edge-Gap In SuperHyperGraphs theory 9248
and Neutrosophic Edge-Gap In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9249
understandable. 9250

HG171b1.png
Figure 44.7: [HG171b] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7923786).

HG171b2.png
2023 (doi: 10.5281/zenodo.7923786).

HG171b3.png
2023 (doi: 10.5281/zenodo.7923786).

CHAPTER 45 9251
“SuperHyperGraph-Based Books”: | 9252
Featured Tweets 9253
“SuperHyperGraph-Based Books”: | Featured Tweets 9254
459
Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.2: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.3: “SuperHyperGraph-Based Books”: | Featured Tweets #69
























CHAPTER 46 9255
CV 9256
487
9257
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.
Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic
Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups
Activities: Traveling, Painting, Writing, Reading books and Papers
Professional Experiences
2017 - Present Continuous Member AMS
I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.
2017 - 2019 Continuous Member EMS
The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress
Awards and Achievements
Dec 2022 Award: Selected as a Reviewer @SciencePG
Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG
My name and affiliation is listed on the journal’s reviewer page:
http://www.sciencepg.com/journal/peerreviewers?journalid=303.
My name and affiliation is listed on the journal’s personal
page:https://membership.sciencepg.com/DrHenryGarrett
PDF: https://drhenrygarrett.files.wordpress.com/2023/04/certificate_for_reviewer.pdf
Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM
Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR
Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International
Association
Award: Distinguished Achievements

Honorary Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf
9258
Journal Referee
Sep 2022 Editorial Board Member to JMTCM JMTCM
Editorial Board Member to Journal of Mathematical Techniques and Computational

Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Editorial Board Member to JCTCSR JCTCSR
Editorial Board Member to Journal of Current Trends in Computer Science

Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
9259
Publications: Articles
2023 245 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
@ResearchGate: https://www.researchgate.net/publication/369977142
@Scribd: https://www.scribd.com/document/637993759
@ZENODO_ORG: https://zenodo.org/record/7824560
@academia: https://www.academia.edu/100136177
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

9260

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript

9261
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress

Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

9262
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
Zenodo 2023, (doi: 10.5281/zenodo.7793372).
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript

9263
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

9264
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9265
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
9266
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

9267
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

9268
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript

9269
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor
10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

9270
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript

9271
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In
10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript

9272
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

9273
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript

9274
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

9275
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript

9276
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
9277
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

9278

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript

9279
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

9280

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
9281
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript

9282
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
9283
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
9284
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition

Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
9285
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9286
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
9287
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

9288
2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
9289
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

9290
2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
9291
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
9292
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9293
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).
9294

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
9295
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
2021 0013 | Matroid And Its Outlines Manuscript
Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
2021 0012 | Matroid And Its Relations Manuscript
Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
2021 0011 | Metric Number in Dimension Manuscript
Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
9296
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7820680).
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9297
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9298
[HG157b] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Nhu4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Nhu4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1JK83H9
(Hardcover): https://www.amazon.com/dp/B0C1J3J6GZ
(Kindle Edition): https://www.amazon.com/dp/B0C1VXHLYJ
ISBN
(Paperback): 9798390583968
(Hardcover): 9798390584002
2023 156 | Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs Amazon
[HG156b] Henry Garrett, “”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7807782).
@googlebooks:https://books.google.com/books/about?id=pu-3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=pu-3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Cut-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1PBHJ
(Hardcover): https://www.amazon.com/dp/B0C1HVLC8V
(Kindle Edition): https://www.amazon.com/dp/B0C1SZJYH8
ISBN
(Paperback): 9798390476758
(Hardcover): 9798390476789
2023 155 | SuperHyperDuality Amazon

9299
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

9300
[HG153b] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7792307).
@googlebooks:https://books.google.com/books/about?id=4By3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=4By3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C12DH1TZ
(Hardcover): https://www.amazon.com/dp/B0C12JFJGM
(Kindle Edition): https://www.amazon.com/dp/B0C18V22Y2
ISBN
(Paperback): 9798389815193
(Hardcover): 9798389815209
2023 152 | Hamiltonian-Neighbor In SuperHyperGraphs Amazon
[HG152b] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7790728).
@googlebooks:https://books.google.com/books/about?id=hA63EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hA63EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C128T8FP
(Hardcover): https://www.amazon.com/dp/B0C12DHG8K
(Kindle Edition): https://www.amazon.com/dp/B0C16YJ5KL
ISBN
(Paperback): 9798389655539
(Hardcover): 9798389655638
2023 151 | Hamiltonian-Decomposition In SuperHyperGraphs Amazon

9301
[HG151b] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=84u2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=84u2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-
(Paperback): https://www.amazon.com/dp/B0C12D3JBS
(Hardcover): https://www.amazon.com/dp/B0C12D3K6P
(Kindle Edition): https://www.amazon.com/dp/B0C147QGJC
ISBN
(Paperback): 9798389394353
(Hardcover): 9798389394629
2023 150 | Hamiltonian-Cut In SuperHyperGraphs Amazon
[HG150b] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7783791).
@googlebooks:https://books.google.com/books/about?id=3Gy2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=3Gy2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPJTY4
(Hardcover): https://www.amazon.com/dp/B0C12528LZ
(Kindle Edition): https://www.amazon.com/dp/B0BZYLS8NZ
ISBN
(Paperback): 9798389221505
(Hardcover): 9798389222076
2023 149 | Trace-Neighbor In SuperHyperGraphs Amazon

9302
[HG149b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7780123).
@googlebooks:https://books.google.com/books/about?id=Tie2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Tie2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPDKDF
(Hardcover): https://www.amazon.com/dp/B0BZFP49GT
(Kindle Edition): https://www.amazon.com/dp/B0BZVLWRSD
ISBN
(Paperback): 9798389040786
(Hardcover): 9798389040946
2023 148 | Trace-Decomposition In SuperHyperGraphs Amazon
[HG148b] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7773119).
@googlebooks:https://books.google.com/books/about?id=y8a1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=y8a1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPFVRT
(Hardcover): https://www.amazon.com/dp/B0BZFP491Q
(Kindle Edition): https://www.amazon.com/dp/B0BZP8555H
ISBN
(Paperback): 9798388702937
(Hardcover): 9798388702999

9303
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9304
[HG145b] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7762232).
@googlebooks:https://books.google.com/books/about?id=q021EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q021EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBY449B
(Hardcover): https://www.amazon.com/dp/B0BZFCBXYR
(Kindle Edition): https://www.amazon.com/dp/B0BZCP4DSW
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388173157
2023 144 | Edge-Decomposition In SuperHyperGraphs Amazon
[HG144b] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7758601).
@googlebooks:https://books.google.com/books/about?id=5Pm0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5Pm0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBGNQTR
(Hardcover): https://www.amazon.com/dp/B0BZ6SNCXJ
(Kindle Edition): https://www.amazon.com/dp/B0BZ7WZF48
ISBN
(Paperback): 9798388014078
(Hardcover): 9798388014962
2023 143 | Edge-Cut In SuperHyperGraphs Amazon

9305
[HG143b] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7754661).
@googlebooks:https://books.google.com/books/about?id=L u0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=L u0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZ324MLT
(Hardcover): https://www.amazon.com/dp/B0BZ34DF21
(Kindle Edition): https://www.amazon.com/dp/B0BZ3Z9J8W
ISBN
(Paperback): 9798387863837
(Hardcover): 9798387865688
2023 142 | Vertex-Neighbor In SuperHyperGraphs Amazon
[HG142b] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7750995).
@googlebooks:https://books.google.com/books/about?id=5JO0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5JO0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR8YN3V
(Hardcover): https://www.amazon.com/dp/B0BYRL26L7
(Kindle Edition): https://www.amazon.com/dp/B0BYYW89VD
ISBN
(Paperback): 9798387725944
(Hardcover): 9798387727511
2023 141 | Vertex-Decomposition In SuperHyperGraphs Amazon

9306
[HG141b] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7749875).
@googlebooks:https://books.google.com/books/about?id=-oS0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=-oS0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR862GV
(Hardcover): https://www.amazon.com/dp/B0BYR7TZXZ
(Kindle Edition): https://www.amazon.com/dp/B0BYX3144B
ISBN
(Paperback): 9798387614910
(Hardcover): 9798387616792
2023 140 | Vertex-Cut In SuperHyperGraphs Amazon
[HG140b] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7747236).
@googlebooks:https://books.google.com/books/about?id=fmC0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=fmC0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRC9P2F
(Hardcover): https://www.amazon.com/dp/B0BYR7YKMC
(Kindle Edition): https://www.amazon.com/dp/B0BYX1HCTN
ISBN
(Paperback): 9798387610660
(Hardcover): 9798387611964
2023 139 | Stable-Neighbor In SuperHyperGraphs Amazon

9307
[HG139b] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7742587).
@googlebooks:https://books.google.com/books/about?id=5y60EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5y60EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR5PWBJ
(Hardcover): https://www.amazon.com/dp/B0BYRBV5KL
(Kindle Edition): https://www.amazon.com/dp/B0BYVK1CCH
ISBN
(Paperback): 9798387498947
(Hardcover): 9798387510786
2023 138 | Stable-Decompositions In SuperHyperGraphs Amazon
[HG138b] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7738635).
@googlebooks:https://books.google.com/books/about?id=q-CzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q-CzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR86GDV
(Hardcover): https://www.amazon.com/dp/B0BYR5GCRQ
(Kindle Edition): https://www.amazon.com/dp/B0BYVFCRJ3
ISBN
(Paperback): 9798387492839
(Hardcover): 9798387495489
2023 137 | Stable-Cut In SuperHyperGraphs Amazon

9308
[HG137b] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7734719).
@googlebooks:https://books.google.com/books/about?id=oKmzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=oKmzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRNDT1Z
(Hardcover): https://www.amazon.com/dp/B0BYR5GF4P
(Kindle Edition): https://www.amazon.com/dp/B0BYS8MJD6
ISBN
(Paperback): 9798387367335
(Hardcover): 9798387369513
2023 136 | Clique-Neighbors In SuperHyperGraphs Amazon
[HG136b] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7730484).
@googlebooks:https://books.google.com/books/about?id=NXyzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=NXyzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Neighbors-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM8JSFJ
(Hardcover): https://www.amazon.com/dp/B0BYLPSR1C
(Kindle Edition): https://www.amazon.com/dp/B0BYBQK51T
ISBN
(Paperback): 9798386938741
(Hardcover): 9798386938772
2023 135 | Clique-Decompositions In SuperHyperGraphs Amazon

9309
[HG135b] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7730469).
@googlebooks:https://books.google.com/books/about?id=D3yzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=D3yzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM1CV3S
(Hardcover): https://www.amazon.com/dp/B0BYLXRXTJ
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386938598
(Hardcover): 9798386938635
2023 134 | Clique-Cut In SuperHyperGraphs Amazon
[HG134b] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7722865).
@googlebooks:https://books.google.com/books/about?id=BEuzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=BEuzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYLPSHS5
(Hardcover): https://www.amazon.com/dp/B0BYM4QTKG
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386709860
(Hardcover): 9798386709891
2023 133 | Space In SuperHyperGraphs Amazon

9310
[HG133b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7713563).
@googlebooks:https://books.google.com/books/about?id=je-yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=je-yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/List-Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNPGDB5
(Hardcover): https://www.amazon.com/dp/B0BXNCSNBJ
(Kindle Edition): https://www.amazon.com/dp/B0BXYYCS5H
ISBN
(Paperback): 9798386468965
(Hardcover): 9798386469030
2023 0132 | Space In SuperHyperGraphs Amazon
[HG132b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7709116).
@googlebooks:https://books.google.com/books/about?id=M56yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=M56yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Space-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 131 | Edge-Connectivity In SuperHyperGraphs Amazon

9311
[HG131b] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7706415).
@googlebooks:https://books.google.com/books/about?id=9XKyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=9XKyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNDNSNQ
(Hardcover): https://www.amazon.com/dp/B0BXN418BY
(Kindle Edition): https://www.amazon.com/dp/B0BXQTPCWV
ISBN
(Paperback): 9798386227593
(Hardcover): 9798386229306
2023 130 | Vertex-Connectivity In SuperHyperGraphs Amazon
[HG130b] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7706063).
@googlebooks:https://books.google.com/books/about?id=12myEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=12myEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN7F5VZ
(Hardcover): https://www.amazon.com/dp/B0BXN6NP8X
(Kindle Edition): https://www.amazon.com/dp/B0BXR1ZMKJ
ISBN
(Paperback): 9798386225056
(Hardcover): 9798386225872
2023 129 | Tree-Decomposition In SuperHyperGraphs Amazon

9312
[HG129b] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7701906).
@googlebooks:https://books.google.com/books/about?id=FBmyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=FBmyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/04/22/Tree-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN4X4MD
(Hardcover): https://www.amazon.com/dp/B0BXNK5C1D
(Kindle Edition): https://www.amazon.com/dp/B0BXM1FT1M
ISBN
(Paperback): 9798386069155
(Hardcover): 9798386070076
2023 128 | Chord In SuperHyperGraphs Amazon
[HG128b] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7700205).
@googlebooks:https://books.google.com/books/about?id=mfSxEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=mfSxEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Chord-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW3HR3CT
(Hardcover): https://www.amazon.com/dp/B0BW2KMGVJ
(Kindle Edition): https://www.amazon.com/dp/B0BXJYTWD3
ISBN
(Paperback): 9798385981755
(Hardcover): 9798385984046
2023 127 | (i,j)-Domination In SuperHyperGraphs Amazon

9313
[HG127b] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7694876).
@googlebooks:https://books.google.com/books/about?id=QoexEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=QoexEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/(i,j)-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2GWHR4
(Hardcover): https://www.amazon.com/dp/B0BW3HG682
(Kindle Edition): https://www.amazon.com/dp/B0BXDK4WLM
ISBN
(Paperback): 9798385701025
(Hardcover): 9798385701797
2023 0126 | Edge-Domination In SuperHyperGraphs Amazon
[HG126b] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7679410).
@googlebooks:https://books.google.com/books/about?id=PEiwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=PEiwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/28/Edge-Domination-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2QM56Q
(Hardcover): https://www.amazon.com/dp/B0BW3GJNWL
(Kindle Edition): https://www.amazon.com/dp/B0BWWXGLX6
ISBN
(Paperback): 9798379089597
(Hardcover): 9798379090531
2023 0125 | K-Domination In SuperHyperGraphs Amazon

9314
[HG125b] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7675982).
@googlebooks:https://books.google.com/books/about?id=WyKwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=WyKwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/27/K-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 124 | K-Number In SuperHyperGraphs Amazon
[HG124b] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7672388).
@googlebooks:https://books.google.com/books/about?id=TtCvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TtCvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/K-Number-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/- @ZENODO_ORG:
https://zenodo.org/record/7672388
(Paperback): https://www.amazon.com/dp/B0BW32LV1S
(Hardcover): https://www.amazon.com/dp/B0BW31GSZB
(Kindle Edition): https://www.amazon.com/dp/B0BWR36VFF
ISBN
(Paperback): 9798378775477
(Hardcover): 9798378776733
2023 123 | Order In SuperHyperGraphs Amazon

9315
[HG123b] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7668648).
@googlebooks:https://books.google.com/books/about?id=U56vEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=U56vEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/Order-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2KJKJD
(Hardcover): https://www.amazon.com/dp/B0BW2BSXTG
(Kindle Edition): https://www.amazon.com/dp/B0BWMKNH7H
ISBN
(Paperback): 9798378647705
(Hardcover): 9798378648146
2023 122 | Coloring In SuperHyperGraphs Amazon
[HG122b] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7662810).
@googlebooks:https://books.google.com/books/about?id=jGavEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jGavEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW28MKQP
(Hardcover): https://www.amazon.com/dp/B0BW35Y9YW
(Kindle Edition): https://www.amazon.com/dp/B0BWN81GT3
ISBN
(Paperback): 9798378499175
(Hardcover): 9798378499717
2023 121 || “Dimension In SuperHyperGraphs” Amazon

9316
[HG9121b] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7659162).
@googlebooks:https://books.google.com/books/about?id=nAOvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=nAOvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Dimension-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW38DB6M
(Hardcover): https://www.amazon.com/dp/B0BW2KMB1J
(Kindle Edition): https://www.amazon.com/dp/B0BWCW6KJL
ISBN
(Paperback): 9798378343188
(Hardcover): 9798378343812
2023 120 || “Cancer In SuperHyperGraphs” Amazon
[HG120b] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653233).
@googlebooks:https://books.google.com/books/about?id=ZdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=ZdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/Cancer-in-
SuperHyperGraphs/
@Scribd:https://www.scribd.com/document/-
|| Cancer in SuperHyperGraphs
Link (Paperback): https://www.amazon.com/dp/B0BW3BK14G
(Hardcover): https://www.amazon.com/dp/B0BW2K9GPL (Kindle Edition):
https://www.amazon.com/dp/B0BW6JCNY1
ISBN (Paperback): 9798378064847 (Hardcover): 9798378065530 (Kindle Edition): CC BY-NC-
ND 4.0
2023 0119 || “SuperHyperWheel” Amazon

9317
[HG119b] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653204).
SuperHyperWheel
@googlebooks:https://books.google.com/books/about?id=S9muEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=S9muEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperWheel/
|| SuperHyperWheel
Link (Paperback): https://www.amazon.com/dp/B0BW2BX6X1
(Hardcover): https://www.amazon.com/dp/B0BW23H1M2 (Kindle Edition):
https://www.amazon.com/dp/B0BW6H5TVG
ND 4.0
2023 0118 || “SuperHyperMultipartite” Amazon
[HG118b] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653142).
SuperHyperMultipartite
@googlebooks:https://books.google.com/books/about?id=SdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=SdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperMultipartite/
|| SuperHyperMultipartite
Link (Paperback): https://www.amazon.com/dp/B0BW358WXN
(Hardcover): https://www.amazon.com/dp/B0BW2CR178 (Kindle Edition):
https://www.amazon.com/dp/B0BW6FTXNH
ND 4.0
2023 0117 || “SuperHyperBipartite” Amazon

9318
[HG117b] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653117).
SuperHyperBipartite
@googlebooks:https://books.google.com/books/about?id=s9iuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=s9iuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperBipartite/
|| SuperHyperBipartite
Link (Paperback): https://www.amazon.com/dp/B0BW267JRF
(Hardcover): https://www.amazon.com/dp/B0BW2ZSL9D (Kindle Edition):
https://www.amazon.com/dp/B0BW6G294W
ND 4.0
2023 0116 || “SuperHyperStar” Amazon
[HG116b] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653089).
SuperHyperStar
@googlebooks:https://books.google.com/books/about?id=8deuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8deuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperStar/
|| SuperHyperStar
Link (Paperback): https://www.amazon.com/dp/B0BW2XKM25
(Hardcover): https://www.amazon.com/dp/B0BW2RKDDX (Kindle Edition):
https://www.amazon.com/dp/B0BW6CTTXM
ND 4.0
2023 0115 || “SuperHyperCycle” Amazon

9319
[HG115b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651687).
SuperHyperCycle
@googlebooks:https://books.google.com/books/about?id=u8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperCycle/
|| SuperHyperCycle
Link (Paperback): https://www.amazon.com/dp/B0BW2XKLRW
(Hardcover): https://www.amazon.com/dp/B0BW2R9SSF (Kindle Edition):
https://www.amazon.com/dp/B0BW5G2J68
ND 4.0
2023 0114 || “SuperHyperPath” Amazon
[HG114b] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651619).
SuperHyperPath
@googlebooks:https://books.google.com/books/about?id=t8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=t8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/
|| SuperHyperPath
Link (Paperback): https://www.amazon.com/dp/B0BW2B6DPZ
(Hardcover): https://www.amazon.com/dp/B0BW2B6DP3 (Kindle Edition):
https://www.amazon.com/dp/B0BW5D6T17
ND 4.0
2023 0113 || “SuperHyperDomination” Amazon

9320
[HG113b] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651439).
SuperHyperDomination
@googlebooks:https://books.google.com/books/about?id=scSuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=scSuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDomination/
|| SuperHyperDomination
Link (Paperback): https://www.amazon.com/dp/B0BW2R9STC
(Hardcover): https://www.amazon.com/dp/B0BW3BJZRF (Kindle Edition):
https://www.amazon.com/dp/B0BW5FPZC8
ND 4.0
2023 0112 || “SuperHyperDominating” Amazon
[HG112b] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7650729).
SuperHyperDominating
@googlebooks:https://books.google.com/books/about?id=17uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=17uuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDominating/
|| SuperHyperDominating
Link (Paperback): https://www.amazon.com/dp/B0BW2K99NB (Hardcover):
https://www.amazon.com/dp/B0BW2PWT1G (Kindle Edition):
https://www.amazon.com/dp/B0BW4SFRXP
ISBN (Paperback): 9798377922339 (Hardcover): 9798377923053 (Kindle Edition): CC BY-
NC-ND 4.0
2023 0111 || “SuperHyperConnected” Amazon

9321
[HG111b] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647868).
SuperHyperConnected
@googlebooks:https://books.google.com/books/about?id=AmquEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=AmquEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/17/SuperHyperConnected/
|| SuperHyperConnected
Link (Paperback): https://www.amazon.com/dp/B0BW2LMPN5
(Hardcover): https://www.amazon.com/dp/B0BW358DDG (Kindle Edition):
https://www.amazon.com/dp/B0BW2ZBHG7
ND 4.0
2023 0110 || “SuperHyperTotal” Amazon
[HG110b] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647017).
SuperHyperTotal
@googlebooks:https://books.google.com/books/about?id=81uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=81uuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/17/superhypertotal/
|| SuperHyperTotal
Link (Paperback): https://www.amazon.com/dp/B0BW35VNQS
(Hardcover): https://www.amazon.com/dp/B0BW2CQZJZ (Kindle Edition):
https://www.amazon.com/dp/B0BW1TZTPX
ND 4.0
2023 0109 || “SuperHyperPerfect” Amazon

9322
[HG109b] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7644894).
SuperHyperPerfect
@googlebooks:https://books.google.com/books/about?id=JymuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=JymuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/16/SuperHyperPerfect/
|| SuperHyperPerfect
Link (Paperback): https://www.amazon.com/dp/B0BVSXB7TC
(Hardcover): https://www.amazon.com/dp/B0BVT8FRC2 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6CGKZ
ND 4.0
2023 0108 || “SuperHyperJoin” Amazon
[HG108b] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7641880).
SuperHyperJoin
@googlebooks:https://books.google.com/books/about?id=TeStEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TeStEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/15/superhyperjoin/
|| SuperHyperJoin
Link (Paperback): https://www.amazon.com/dp/B0BVT7HJ1K
(Hardcover): https://www.amazon.com/dp/B0BVSXX9W5 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6P9KC
ND 4.0
2023 0107 || “Path SuperHyperColoring” Amazon
[HG107b] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7632923).
|| Path SuperHyperColoring
@googlebooks: https://books.google.com/books/about?id=o3ytEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=o3ytEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BVDRFXXF (Hardcover):
https://www.amazon.com/dp/B0BVDMJ5MJ (Kindle Edition):
ND 4.0
9323
2023 0106 || “SuperHyperDensity” Amazon
[HG106b] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7623459).
|| SuperHyperDensity
Link (Paperback): https://www.amazon.com/dp/B0BV49Y61R (Hardcover):
https://www.amazon.com/dp/B0BV4DYQZL (Kindle Edition):
ND 4.0
@googlebooks: https://books.google.com/books/about?id=HdusEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=HdusEAAAQBAJ
2023 0105 || “Neutrosophic SuperHyperConnectivities” Amazon
[HG105b] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023.
Link (Paperback): https://www.amazon.com/dp/B0BTXCX57J (Hardcover):

https://www.amazon.com/dp/B0BTRXKGTX (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=YeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=YeurEAAAQBAJ
2023 Book 104 || “Extreme SuperHyperConnectivities” Amazon
[HG104b] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606416).
Link (Paperback): https://www.amazon.com/dp/B0BTRYB2S4 (Hardcover):

https://www.amazon.com/dp/B0BTT6VT96 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=X-urEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=X-urEAAAQBAJ
2023 Book 103 || “SuperHyperConnectivities” Amazon

9324
[HG103b] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606404).
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=UeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=UeurEAAAQBAJ
2023 Book 102 || “Neutrosophic SuperHyperCycle” Amazon
[HG102b] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT6ZXQ8V (Hardcover):

https://www.amazon.com/dp/B0BT7DZTBW (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=OCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=OCeqEAAAQBAJ
@WordPress: -
2023 Book 101 || “Extreme SuperHyperCycle” Amazon
[HG101b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=MCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=MCeqEAAAQBAJ
@WordPress: -
2023 Book 100 || “Extreme SuperHyperCycle” Amazon
[HG100b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT7HS2CD (Hardcover):

https://www.amazon.com/dp/B0BT75DHQ2 (Kindle Edition):
ND 4.0
2023 Book 99 || “SuperHyperCycle” Amazon

9325
[HG99b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7579929).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=LieqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=LieqEAAAQBAJ
@WordPress: -
2023 0098 | Neutrosophic SuperHyperGirth Amazon
[HG98b] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563170).
https://amazon.com/dp/B0BSV66BWV
https://amazon.com/dp/B0BSV7CZH4
9798374731323
9798374736922
CC BY-NC-ND 4.0
@googlebooks: http://books.google.com/books/about?id=yL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yL-qEAAAQBAJ
@WordPress: -
@Scribd: -
2023 0097 | Extreme SuperHyperGirth Amazon
[HG97b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563164).
https://www.amazon.com/dp/B0BSJPZV9J
https://www.amazon.com/dp/B0BSJPYVWJ
9798374731309
9798374736915
CC BY-NC-ND 4.0
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367351526E xtremeS uperHyperGirth
@Scribd: -
2023 0096 | “SuperHyperGirth” Amazon

9326
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

9327
[HG92b] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557009).
@googlebooks: http://books.google.com/books/about?id=47mqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=47mqEAAAQBAJ
https://www.amazon.com/dp/B0BSJDJSN7
https://www.amazon.com/dp/B0BSLKWW3F
9798374564266
9798374564785
CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0091 | “Overlook On SuperHyperMatching” Amazon
[HG91b] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: http://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
2023 0090 | “Neutrosophic Failed SuperHyperClique” Amazon
[HG90b] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=h7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=h7qqEAAAQBAJ
2023 0089 | “Extreme Failed SuperHyperClique” Amazon
[HG89b] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=gbqqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gbqqEAAAQBAJ
2023 0088 | “Overlook On Failed SuperHyperClique” Amazon
[HG88b] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=e7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=e7qqEAAAQBAJ
2023 0087 | “Extreme SuperHyperClique” Amazon

9328
[HG87b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574952).
Link (Paperback): https://www.amazon.com/dp/B0BT6WSZLD (Hardcover):

https://www.amazon.com/dp/B0BT743MW2 (Kindle Edition): ISBN (Paperback):
9798375140049 (Hardcover): 9798375141510 (Kindle Edition): CC BY-NC-ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=52 pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
@WordPress: -
2023 0086 | “Neutrosophic SuperHyperClique” Amazon
[HG86b] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574992).
@googlebooks: http://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BT6RD41C (Hardcover):
https://www.amazon.com/dp/B0BT733BB2 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
@WordPress: -
2023 0085 | “Extreme SuperHyperClique” Amazon
[HG85b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=52 pEAAAQBAJ

@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
2023 0084 | “Overlook On SuperHyperClique” Amazon
[HG84b] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=Cf6pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Cf6pEAAAQBAJ
9329
2023 0083 | “Neutrosophic Failed SuperHyperStable” Amazon
[HG83b] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=cLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cLuqEAAAQBAJ
2023 0082 | “Extreme Failed SuperHyperStable” Amazon
[HG82b] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=aruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=aruqEAAAQBAJ
2023 0081 | “Overlook On Failed SuperHyperStable” Amazon
[HG81b] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=YruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=YruqEAAAQBAJ
2023 0080 | “Neutrosophic SuperHyperStable” Amazon
[HG80b] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=gLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gLyqEAAAQBAJ
2023 0079 | “Extreme SuperHyperStable” Amazon
[HG79b] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=CryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=CryqEAAAQBAJ
2023 0078 | “Overlook On SuperHyperStable” Amazon
[HG78b] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=hLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=hLuqEAAAQBAJ
2023 0077 | Neutrosophic Failed SuperHyperForcing Amazon

9330
“Neutrosophic Failed SuperHyperForcing”
[HG77b] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=yLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yLyqEAAAQBAJ
2023 0076 | Extreme Failed SuperHyperForcing Amazon
[HG76b] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
“Extreme Failed SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=wLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=wLyqEAAAQBAJ
2023 0075 | Neutrosophic SuperHyperForcing Amazon
[HG75b] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Neutrosophic SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=5LyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=5LyqEAAAQBAJ
2023 0074 | Extreme SuperHyperForcing Amazon
[HG74b] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Extreme SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=3ryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=3ryqEAAAQBAJ
2023 0073 | Overlook On SuperHyperForcing Amazon
[HG73b] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Overlook On SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=zryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=zryqEAAAQBAJ
2023 0072 | Neutrosophic SuperHyperAlliances Amazon

9331
[HG72b] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Neutrosophic SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=cr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cr2qEAAAQBAJ
2023 0071 | Extreme SuperHyperAlliances Amazon
[HG71b] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Extreme SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=ZL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=ZL2qEAAAQBAJ
2023 0070 | Overlook On SuperHyperAlliances Amazon
[HG70b] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Overlook On SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=Sr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Sr2qEAAAQBAJ
2023 0069 | SuperHyperMatching Amazon
[HG69b] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: https://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/16/superhypermatching-
published-version/
Link
(Paperback): https://www.amazon.com/dp/B0BSDPXX1P
(Hardcover): https://www.amazon.com/dp/B0BSDC1L66
(Kindle Edition):
ISBN
(Paperback): 9798373872683
(Hardcover): 9798373875424
ASIN : B0BSDPXX1P Publisher : Independently published (January 15, 2023) Language
: English Paperback : 582 pages ISBN-13 : 979-8373872683 Item Weight : 3.6 pounds
Dimensions : 8.5 x 1.37 x 11 inches
ASIN : B0BSDC1L66 Publisher : Independently published (January 16, 2023) Language
: English Hardcover : 548 pages ISBN-13 : 979-8373875424 Item Weight : 3.3 pounds
9332
2023 0068 | Failed SuperHyperClique Amazon
[HG68b] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
https://www.amazon.com/dp/B0BRZ67NYN
https://www.amazon.com/dp/B0BRYZTK24
9798373274227
9798373277273
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/11/failed-superhyperclique-
published-version
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language
ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
: English Hardcover : 460 pages ISBN-13 : 979-8373277273 Item Weight : 2.78 pounds
2023 0067 | SuperHyperClique Amazon
[HG67b] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
https://www.amazon.com/dp/B0BRWK4S1Y
https://www.amazon.com/dp/B0BRM24YJX
9798373040471
9798373041935
@ZENODOO RG : zenodo.org/record/7523357
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/10/superhyperclique-published-
version-2/
ASIN : B0BRWK4S1Y Publisher : Independently published (January 8, 2023) Language
ASIN : B0BRM24YJX Publisher : Independently published (January 8, 2023) Language :
English Hardcover : 388 pages ISBN-13 : 979-8373041935 Item Weight : 2.36 pounds Dimensions
: 8.25 x 1.1 x 11 inches
2023 0066 | Failed SuperHyperStable Amazon

9333
[HG66b] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
https://www.amazon.com/dp/B0BRNG7DC8
https://www.amazon.com/dp/B0BRLVN39L
9798372597976
9798372599765
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/06/failed-superhyperstable-
published-version/
ASIN : B0BRNG7DC8 Publisher : Independently published (January 4, 2023) Language
ASIN : B0BRLVN39L Publisher : Independently published (January 4, 2023) Language :
: 8.25 x 0.91 x 11 inches
2023 0065 | SuperHyperStable Amazon
[HG65b] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
https://www.amazon.com/dp/B0BRDG5Z4Y
https://www.amazon.com/dp/B0BRJPG56M
9798372248519
9798372252011
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/03/superhyperstable-published-
version/
ASIN : B0BRDG5Z4Y Publisher : Independently published (January 2, 2023) Language
Dimensions : 8.27 x 0.7 x 11.69 inches
ASIN : B0BRJPG56M Publisher : Independently published (January 2, 2023) Language :
: 8.25 x 0.87 x 11 inches
2023 0064 | Failed SuperHyperForcing Amazon

9334
[HG64b] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=vryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vryqEAAAQBAJ
https://www.amazon.com/dp/B0BRH5B4QM
https://www.amazon.com/dp/B0BRGX4DBJ
9798372123649
9798372124509
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/01/failed-superhyperforcing-
published-version/
ASIN : B0BRH5B4QM Publisher : Independently published (January 1, 2023) Language
ASIN : B0BRGX4DBJ Publisher : Independently published (January 1, 2023) Language :
: 8.25 x 0.98 x 11 inches
2022 0063 | SuperHyperForcing Amazon
[HG63b] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language :
: 8.25 x 0.86 x 11 inches
https://www.amazon.com/dp/B0BRDG1KN1 https://www.amazon.com/dp/B0BRDFFQMF
9798371873347 9798371874092
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/30/superhyperforcing-
published-versian/
2022 0062 | SuperHyperAlliances Amazon

9335
[HG62b] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
ASIN : B0BR6YC3HG Publisher : Independently published (December 27, 2022) Language

ASIN : B0BR7CBTC6 Publisher : Independently published (December 27, 2022) Language :
: 8.25 x 0.64 x 11 inches
https://www.amazon.com/dp/B0BR6YC3HG https://www.amazon.com/dp/B0BR7CBTC6
9798371488343 9798371494849
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/28/superhyperalliances-
published-version/
2022 0061 | SuperHyperGraphs Amazon
[HG61b] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7480110).
@googlebooks: http://books.google.com/books/about?id=iL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=iL2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wor
ASIN : B0BR1NHY4Z Publisher : Independently published (December 24, 2022) Language :
English Paperback : 117 pages ISBN-13 : 979-8371090133 Item Weight : 13 ounces Dimensions
: 8.5 x 0.28 x 11 inches
ASIN : B0BQXTHTXY Publisher : Independently published (December 24, 2022) Language :
English Hardcover : 117 pages ISBN-13 : 979-8371093240 Item Weight : 12.6 ounces Dimensions
: 8.25 x 0.47 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BR1NHY4Z (Hardcover):
https://www.amazon.com/dp/B0BQXTHTXY (Kindle Edition):
ND 4.0
2022 0060 | Neut. SuperHyperEdges Amazon

9336
[HG60b] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7378758).
@GooglePlay: https://play.google.com/store/books/details?id=rr2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2022/11/29/neut-superhyperedges-
published-version/
ASIN : B0BNH11ZDY Publisher : Independently published (November 27, 2022) Language :
: 8.5 x 0.26 x 11 inches
ASIN : B0BNGZGPP6 Publisher : Independently published (November 27, 2022) Language :
: 8.25 x 0.45 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BNH11ZDY (Hardcover):
https://www.amazon.com/dp/B0BNGZGPP6
ND 4.0
2022 0059 | Neutrosophic k-Number Amazon
ASIN : B0BF3P5X4N Publisher : Independently published (September 14, 2022) Language

ASIN : B0BF2XCDZM Publisher : Independently published (September 14, 2022) Language :
: 8.25 x 0.57 x 11 inches
2022 0058 | Neutrosophic Schedule Amazon
ASIN : B0BBJWJJZF Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJLPWKH Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 1.35 x 11 inches
2022 0057 | Neutrosophic Wheel Amazon
ASIN : B0BBJRHXXG Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBK3KG82 Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.65 x 11 inches
2022 0056 | Neutrosophic t-partite Amazon
ASIN : B0BBJLZCHS Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJDFGJS Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.75 x 11 inches
2022 0055 | Neutrosophic Bipartite Amazon

9337
ASIN : B0BB5Z9GHW Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBGG9RDZ Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.72 x 11 inches
2022 0054 | Neutrosophic Star Amazon
ASIN : B0BB5ZHSSZ Publisher : Independently published (August 22, 2022) Language :

English Paperback : 215 pages ISBN-13 : 979-8847794374 Item Weight : 1.4 pounds Dimensions
: 8.5 x 0.51 x 11 inches
ASIN : B0BBC4BL9P Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.7 x 11 inches
2022 0053 | Neutrosophic Cycle Amazon
ASIN : B0BB62NZQK Publisher : Independently published (August 22, 2022) Language

ASIN : B0BB65QMKQ Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 1 x 11 inches
2022 0052 | Neutrosophic Path Amazon
ASIN : B0BB67WCXL Publisher : Independently published (August 8, 2022) Language :

English Paperback : 315 pages ISBN-13 : 979-8847730570 Item Weight : 2 pounds Dimensions
: 8.5 x 0.74 x 11 inches
ASIN : B0BB5Z9FXL Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 0.93 x 11 inches
2022 0051 | Neutrosophic Complete Amazon
ASIN : B0BB6191KN Publisher : Independently published (August 8, 2022) Language

ASIN : B0BB5RRQN7 Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 0.73 x 11 inches
2022 0050 | Neutrosophic Dominating Amazon
ASIN : B0BB5QV8WT Publisher : Independently published (August 8, 2022) Language

ASIN : B0BB61WL9M Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 1.03 x 11 inches
2022 0049 | Neutrosophic Resolving Amazon
ASIN : B0BBCJMRH8 Publisher : Independently published (August 8, 2022) Language

ASIN : B0BBCB6DFC Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 1.06 x 11 inches
2022 0048 | Neutrosophic Stable Amazon

9338
ASIN : B0B7QGTNFW Publisher : Independently published (July 28, 2022) Language :

English Paperback : 133 pages ISBN-13 : 979-8842880348 Item Weight : 14.6 ounces Dimensions
: 8.5 x 0.32 x 11 inches
ASIN : B0B7QJWQ35 Publisher : Independently published (July 28, 2022) Language :
: 8.25 x 0.51 x 11 inches
2022 0047 | Neutrosophic Total Amazon
ASIN : B0B7GLB23F Publisher : Independently published (July 25, 2022) Language : English
Paperback : 137 pages ISBN-13 : 979-8842357741 Item Weight : 14.9 ounces Dimensions : 8.5
x 0.33 x 11 inches
ASIN : B0B6XVTDYC Publisher : Independently published (July 25, 2022) Language :
: 8.25 x 0.52 x 11 inches
2022 0046 | Neutrosophic Perfect Amazon
ASIN : B0B7CJHCYZ Publisher : Independently published (July 22, 2022) Language :

: 8.5 x 0.3 x 11 inches
ASIN : B0B7C732Z1 Publisher : Independently published (July 22, 2022) Language : English
Hardcover : 127 pages ISBN-13 : 979-8842028757 Item Weight : 13.6 ounces Dimensions : 8.25
x 0.49 x 11 inches
2022 0045 | Neutrosophic Joint Set Amazon
ASIN : B0B6L8WJ77 Publisher : Independently published (July 15, 2022) Language : English
Paperback : 139 pages ISBN-13 : 979-8840802199 Item Weight : 15 ounces Dimensions : 8.5 x
0.33 x 11 inches
ASIN : B0B6L9GJWR Publisher : Independently published (July 15, 2022) Language :
: 8.25 x 0.52 x 11 inches
August 30, 0044 | Neutrosophic Duality GLOBAL

2022 KNOWLEDGE -
Publishing
House&Amazon&Google
Scholar&UNM
[HG44b] H. Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6677173).
Neutrosophic Duality, GLOBAL KNOWLEDGE - Publishing House:
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131
United States. ISBN: 978-1-59973-743-0
Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing
House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0
(http://fs.unm.edu/NeutrosophicDuality.pdf).
ASIN : B0B4SJ8Y44 Publisher : Independently published (June 22, 2022) Language : English
Paperback : 115 pages ISBN-13 : 979-8837647598 Item Weight : 12.8 ounces Dimensions : 8.5
x 0.27 x 11 inches
ASIN : B0B46B4CXT Publisher : Independently published (June 22, 2022) Language : English
Hardcover : 115 pages ISBN-13 : 979-8837649981 Item Weight : 12.5 ounces Dimensions : 8.25
x 0.46 x 11 inches
GLOBAL KNOWLEDGE - Publishing House: http://fs.unm.edu/NeutrosophicDuality.pdf
UNM: http://fs.unm.edu/NeutrosophicDuality.pdf
Google Scholar: https://books.google.com/books?id=dWWkEAAAQBAJ
Paperback: https://www.amazon.com/dp/B0B4SJ8Y44
Hardcover: https://www.amazon.com/dp/B0B46B4CXT
2022 0043 | Neutrosophic Path-Coloring Amazon
9339
ASIN : B0B3F2BZC4 Publisher : Independently published (June 7, 2022) Language : English

Paperback : 161 pages ISBN-13 : 979-8834894469 Item Weight : 1.08 pounds Dimensions : 8.5
x 0.38 x 11 inches
ASIN : B0B3FGPGQ3 Publisher : Independently published (June 7, 2022) Language :
: 8.25 x 0.57 x 11 inches
2022 0042 | Neutrosophic Density Amazon
ASIN : B0B19CDX7W Publisher : Independently published (May 15, 2022) Language :

: 8.5 x 0.35 x 11 inches
ASIN : B0B14PLPGL Publisher : Independently published (May 15, 2022) Language :
: 8.25 x 0.53 x 11 inches
2022 0041 | Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Google Commerce Ltd
Publisher Infinite Study Seller Google Commerce Ltd Published on Apr 27, 2022 Pages
30 Features Original pages Best for web, tablet, phone, eReader Language English Genres
Antiques & Collectibles / Reference Content protection This content is DRM free GooglePlay
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Front Cover Henry
Garrett Infinite Study, 27 Apr 2022 - Antiques & Collectibles - 30 pages GoogleBooks
Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph”,
Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 893 10.5281/zenodo.6456413).
(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf).
2022 0040 | Neutrosophic Connectivity Amazon
ASIN : B09YQJG2ZV Publisher : Independently published (April 26, 2022) Language :

: 8.5 x 0.29 x 11 inches
ASIN : B09YQJG2DZ Publisher : Independently published (April 26, 2022) Language :
: 8.25 x 0.48 x 11 inches
2022 0039 | Neutrosophic Cycles Amazon
ASIN : B09X4KVLQG Publisher : Independently published (April 8, 2022) Language

ASIN : B09X4LZ3HL Publisher : Independently published (April 8, 2022) Language : English
Hardcover : 169 pages ISBN-13 : 979-8449144157 Item Weight : 1.09 pounds Dimensions : 8.25
x 0.59 x 11 inches
2022 0038 | Girth in Neutrosophic Graphs Amazon
ASIN : B09WQ5PFV8 Publisher : Independently published (March 29, 2022) Language

ASIN : B09WQQGXPZ Publisher : Independently published (March 29, 2022) Language :
: 8.25 x 0.58 x 11 inches
2022 0037 | Matching Number in Neutrosophic Graphs Amazon
ASIN : B09W7FT8GM Publisher : Independently published (March 22, 2022) Language

ASIN : B09W4HF99L Publisher : Independently published (March 22, 2022) Language :
English Hardcover : 153 pages ISBN-13 : 979-8437539057 Item Weight : 1 pounds Dimensions
: 8.25 x 0.55 x 11 inches
9340
2022 0036 | Clique Number in Neutrosophic Graph Amazon
ASIN : B09TV82Q7T Publisher : Independently published (March 7, 2022) Language

ASIN : B09TZBPWJG Publisher : Independently published (March 7, 2022) Language :
: 8.25 x 0.56 x 11 inches
2022 0035 | Independence in Neutrosophic Graphs Amazon
ASIN : B09TF227GG Publisher : Independently published (February 27, 2022) Language :

English Paperback : 149 pages ISBN-13 : 979-8424231681 Item Weight : 1 pounds Dimensions
: 8.5 x 0.35 x 11 inches
ASIN : B09TL1LSKD Publisher : Independently published (February 27, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0034 | Zero Forcing Number in Neutrosophic Graphs Amazon
ASIN : B09SW2YVKB Publisher : Independently published (February 18, 2022) Language :

: 8.5 x 0.35 x 11 inches
ASIN : B09SWLK7BG Publisher : Independently published (February 18, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0033 | Neutrosophic Quasi-Order Amazon
ASIN : B09S3RXQ5C Publisher : Independently published (February 8, 2022) Language :

: 8.5 x 0.26 x 11 inches
ASIN : B09S232DQH Publisher : Independently published (February 8, 2022) Language :
: 8.25 x 0.43 x 11 inches
Jan 29, 2022 0032 | Beyond Neutrosophic Graphs E-

publishing&Amazon&Google
Scholar&UNM
[HG32b] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6320305).
Beyond Neutrosophic Graphs, E-publishing:
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States
ISBN 978-1-59973-725-6
Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
ASIN : B0BBCQJQG5 Publisher : Independently published (August 8, 2022) Language
ASIN : B0BBC4BJZ5 Publisher : Independently published (August 8, 2022) Language : English
Hardcover : 257 pages ISBN-13 : 979-8847567497 Item Weight : 1.61 pounds Dimensions : 8.25
x 0.8 x 11 inches
E-publishing: Educational Publisher: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
UNM: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
Google Scholar:https://books.google.com/books?id=cWWkEAAAQBAJ
Paperback: https://www.amazon.com/gp/product/B0BBCQJQG5
Hardcover: https://www.amazon.com/Beyond-Neutrosophic-Graphs-Henry-
Garrett/dp/B0BBC4BJZ5
2022 0031 | Neutrosophic Alliances Amazon

9341
ASIN : B09RB5XLVB Publisher : Independently published (January 26, 2022) Language :

: 8.5 x 0.21 x 11 inches
ASIN : B09R39MTSW Publisher : Independently published (January 26, 2022) Language :

: 8.25 x 0.4 x 11 inches
2022 0030 | Neutrosophic Hypergraphs Amazon
ASIN : B09PMBKVD4 Publisher : Independently published (January 7, 2022) Language :

: 8.5 x 0.19 x 11 inches
ASIN : B09PP8VZ3D Publisher : Independently published (January 7, 2022) Language :
: 8.25 x 0.38 x 11 inches
2022 0029 | Collections of Articles Amazon
-
ASIN : B09PHHDDQK Publisher : Independently published (January 2, 2022) Language :
: 8.25 x 1.47 x 11 inches
2022 0028 | Collections of Math Amazon
-
ASIN : B09PHBWT5D Publisher : Independently published (January 1, 2022) Language :
: 8.25 x 1.28 x 11 inches
2022 0027 | Collections of US Amazon
-
ASIN : B09PHBT924 Publisher : Independently published (December 31, 2021) Language :
: 8.25 x 0.81 x 11 inches
2021 0026 | Neutrosophic Chromatic Number Amazon
ASIN : B09NRD25MG Publisher : Independently published (December 20, 2021) Language

: English Paperback : 67 pages ISBN-13 : 979-8787858174 Item Weight : 8.2 ounces Dimensions
: 8.5 x 0.16 x 11 inches Language : English
-
2021 0025 | Simple Ideas Amazon
ASIN : B09MYTN6NT Publisher : Independently published (December 9, 2021) Language :

: 8.5 x 0.11 x 11 inches
-
2021 0024 | Neutrosophic Graphs Amazon
ASIN : B09MYXVNF9 Publisher : Independently published (December 7, 2021) Language

: English Paperback : 55 pages ISBN-13 : 979-8780775652 Item Weight : 7 ounces Dimensions
: 8.5 x 0.13 x 11 inches
-
2021 0023 | List Amazon

9342
ASIN : B09M554XCL Publisher : Independently published (November 20, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0022 | Theorems Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0021 | Dimension Amazon
ASIN : B09K2BBQG7 Publisher : Independently published (October 25, 2021) Language :

English Paperback : 55 pages ISBN-13 : 979-8753577146 Item Weight : 7 ounces Dimensions :
8.5 x 0.13 x 11 inches
-
2021 0020 | Beyond The Graph Theory Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0019 | Located Heart And Memories Amazon
ASIN : B09F14PL8T Publisher : Independently published (August 31, 2021) Language :

8.5 x 0.14 x 11 inches
-
2021 0018 | Number Graphs And Numbers Amazon
ASIN : B099BQRSF8 Publisher : Independently published (July 14, 2021) Language : English
Paperback : 32 pages ISBN-13 : 979-8537474135 Item Weight : 4.8 ounces Dimensions : 8.5 x
0.08 x 11 inches
-
2021 0017 | First Place Is Reserved Amazon
ASIN : B098CWD5PT Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.13 x 11 inches
-
2021 0016 | Detail-oriented Groups And Ideas Amazon
ASIN : B098CYYG3Q Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.17 x 11 inches
-
2021 0015 | Definition And Its Necessities Amazon
ASIN : B098DHRJFD Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.19 x 11 inches
-
9343
2021 0014 | Words And Their Directionss Amazon
ASIN : B098CYS8G2 Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.16 x 11 inches
-
2021 0013 | Tattooed Heart But Forever Amazon
ASIN : B098CR8HM6 Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.11 x 11 inches
-
2021 0012 | Metric Number In Dimension Amazon
ASIN : B0913597TV Publication date : March 24, 2021 Language : English File size : 28445
KB Text-to-Speech : Enabled Enhanced typesetting : Enabled X-Ray : Not Enabled Word
Wise : Not Enabled Print length : 48 pages Lending : Not Enabled Kindle
-
2021 0011 | Domination Theory And Beyond Amazon
ASIN : B098DMMZ87 Publisher : Independently published (June 30, 2021) Language

-
2021 0010 | Vital Glory Amazon
ASIN : B08PVNJYRM Publication date : December 6, 2020 Language : English File size
: 1544 KB Simultaneous device usage : Unlimited Text-to-Speech : Enabled Screen Reader :
Supported Enhanced typesetting : Enabled X-Ray : Not Enabled Word Wise : Enabled Print
length : 24 pages Lending : Enabled Kindle
-
2021 0009 | Análisis de modelos y orientación más allá AmazonUK&MoreBooks
Análisis de modelos y orientación más allá Planteamiento y problemas en dos modelos

Ediciones Nuestro Conocimiento (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59902-
2 ISBN-10:6203599026EAN:9786203599022Book language:Blurb/Shorttext:El enfoque para la
resolución de problemas es una selección obvia para hacer la investigación y el análisis de la
situación que puede provocar las perspectivas vagas que queremos no ser para extraer ideas
creativas y nuevas que queremos ser. Estudio simultáneamente dos modelos. Este estudio se
basa tanto en la investigación como en la discusión que el autor piensa que puede ser útil
para entender y hacer crecer nuestra fantası́a y la realidad juntas.Publishing house: Ediciones
Nuestro Conocimiento Website: https://sciencia-scripts.com By (author) : Henry Garrett
Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Dos modelos, optimización de rutas y transporte, Two Models, Optimizing Routes
and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/análisis-de-modelos-y-orientación-más-
allá/isbn/978-620-3-59902-2
Product details Publisher : Ediciones Nuestro Conocimiento (6 April 2021) Language :
Spanish ISBN-10 : 6203599026 ISBN-13 : 978-6203599022 Dimensions : 15 x 0.4 x 22 cm
Paperback:
https://www.amazon.co.uk/Análisis-modelos-orientación-allá-Planteamiento/dp/6203599026
2021 0008 | Анализ моделей и руководство за пределами Amazon&MoreBooks

9344
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях Sciencia Scripts (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59908-4 ISBN-
10:6203599085EAN:9786203599084Book language: Russian Blurb/Shorttext:Подход к реше-
нию проблем является очевидным выбором для проведения исследований и анализа си-
туации, которая может вызвать смутные перспективы, которыми мы не хотим быть для
извлечения творческих и новых идей, которыми мы хотим быть. Я одновременно изучаю
две модели. Это исследование основано как на исследовании, так и на обсуждении, кото-
рое, по мнению автора, может быть полезным для понимания и развития наших фантазий
и реальности вместе.Publishing house: Sciencia Scripts Website: https://sciencia-scripts.com
By (author) : Генри Гарретт Number of pages:68Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Две модели, оптимизация маршрутов и
транспорта, Two Models, Optimizing Routes and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/анализ-моделей-и-руководство-за-
пределами/isbn/978-620-3-59908-4
Анализ моделей и руководство за пределами: Подход и проблемы в двух моделях

(Russian Edition) Publisher : Sciencia Scripts (April 6, 2021) Language : Russian Paperback :
68 pages ISBN-10 : 6203599085 ISBN-13 : 978-6203599084 Item Weight : 5.3 ounces Dimensions
: 5.91 x 0.16 x 8.66 inches
2021 0007 | Análise e Orientação de Modelos Além Amazon | MoreBooks |

Walmart
Análise e Orientação de Modelos Além Abordagem e Problemas em Dois Modelos Edições
Nosso Conhecimento (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59907-7 ISBN-
10:6203599077EAN:9786203599077Book language:Blurb/Shorttext:A abordagem para resolver
problemas é uma seleção óbvia para fazer pesquisa e análise da situação, que pode trazer
as perspectivas vagas que queremos não ser para extrair idéias criativas e novas idéias que
queremos ser. Eu estudo simultaneamente dois modelos. Este estudo é baseado tanto na
pesquisa como na discussão que o autor pensa que pode ser útil para compreender e fazer crescer
juntos a nossa fantasia e realidade.Publishing house: Edições Nosso Conhecimento Website:
https://sciencia-scripts.com By (author) : Henry Garrett Number of pages:64Published
on:2021-04-06Stock:Available Category: Mathematics Price:39.90 Keywords:Dois Modelos,
Otimização de Rotas e Transporte, Two Models, Optimizing Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/análise-e-orientação-de-modelos-
além/isbn/978-620-3-59907-7
Henry Garrett Análise e Orientação de Modelos Além (Paperback) About this item
Product details
A abordagem para resolver problemas é uma seleção óbvia para fazer pesquisa e análise da
situação, que pode trazer as perspectivas vagas que queremos não ser para extrair idéias
criativas e novas idéias que queremos ser. Eu estudo simultaneamente dois modelos. Este
estudo é baseado tanto na pesquisa como na discussão que o autor pensa que pode ser útil
para compreender e fazer crescer juntos a nossa fantasia e realidade. Análise e Orientação de
Modelos Além (Paperback) We aim to show you accurate product information. Manufacturers,
suppliers and others provide what you see here, and we have not verified it. See our disclaimer
Specifications
Language Portuguese Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 64 Author Henry Garrett Title Análise e Orientação de Modelos Além ISBN-13
9786203599077 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599077 Walmart
Análise e Orientação de Modelos Além: Abordagem e Problemas em Dois Modelos

(Portuguese Edition) Publisher : Edições Nosso Conhecimento (April 6, 2021) Language :
Portuguese Paperback : 64 pages ISBN-10 : 6203599077 ISBN-13 : 978-6203599077 Item Weight
: 3.67 ounces Dimensions : 5.91 x 0.15 x 8.66 inches
2021 0006 | Analizy modelowe i wytyczne wykraczaja˛ce poza Amazon&MoreBooks

9345
Analizy modelowe i wytyczne wykraczaja˛ce poza Podejście i problemy w dwóch
modelach Wydawnictwo Nasza Wiedza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-
59906-0 ISBN-10:6203599069EAN:9786203599060Book language:Blurb/Shorttext:Podejście do
rozwia˛zywania problemów jest oczywistym wyborem do prowadzenia badań i analizowania
sytuacji, które moga˛ wywo lywać niejasne perspektywy, których nie chcemy dla wydobycia
kreatywnych i nowych pomys lów, które chcemy. I jednocześnie studiować dwa modele.
Badanie to oparte jest zarówno na badaniach jak i dyskusji, które zdaniem autora moga˛
być przydatne do zrozumienia i rozwoju naszych fantazji i rzeczywistości razem.Publishing
house: Wydawnictwo Nasza Wiedza Website: https://sciencia-scripts.com By (author) : Henry
Garrett Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics
Price:39.90 Keywords:Dwa modele, optymalizacja tras i transportu, Two Models, Optimizing
Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/analizy-modelowe-i-wytyczne-wykraczaja˛ce-
poza/isbn/978-620-3-59906-0
Analizy modelowe i wytyczne wykraczaja˛ce poza: Podejście i problemy w dwóch modelach
(Polish Edition) Publisher : Wydawnictwo Nasza Wiedza (April 6, 2021) Language : Polish
Paperback : 64 pages ISBN-10 : 6203599069 ISBN-13 : 978-6203599060 Item Weight : 3.67
ounces Dimensions : 5.91 x 0.15 x 8.66 inches
2021 0005 | Modelanalyses en begeleiding daarna Amazon&MoreBooks
Modelanalyses en begeleiding daarna Aanpak en problemen in twee modellen

Uitgeverij Onze Kennis (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59905-3
ISBN-10:6203599050EAN:9786203599053Book language:Blurb/Shorttext:De aanpak voor het
oplossen van problemen is een voor de hand liggende keuze voor het doen van onderzoek en het
analyseren van de situatie die de vage perspectieven kan oproepen die we niet willen zijn voor
het extraheren van creatieve en nieuwe ideeën die we willen zijn. Ik bestudeer tegelijkertijd twee
modellen. Deze studie is gebaseerd op zowel onderzoek als discussie waarvan de auteur denkt dat
ze nuttig kunnen zijn voor het begrijpen en laten groeien van onze fantasieën en de werkelijkheid
samen.Publishing house: Uitgeverij Onze Kennis Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Twee modellen, optimalisering van routes en transport,
Two Models, Optimizing Routes and Transportation
MoreBooks
Modelanalyses en begeleiding daarna: Aanpak en problemen in twee modellen (Dutch
Edition) Publisher : Uitgeverij Onze Kennis (April 6, 2021) Language : Dutch Paperback : 64
pages ISBN-10 : 6203599050 ISBN-13 : 978-6203599053 Item Weight : 3.99 ounces Dimensions
: 5.91 x 0.15 x 8.66 inches
2021 0004 | Analisi dei modelli e guida oltre Amazon | MoreBooks |

Walmart
9346
Analisi dei modelli e guida oltre Approccio e problemi in due modelli Edizioni
Sapienza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59904-6 ISBN-
10:6203599042EAN:9786203599046Book language:Blurb/Shorttext:L’approccio per risolvere
i problemi è una selezione ovvia per fare ricerca e analisi della situazione che può suscitare
le prospettive vaghe che non vogliamo essere per estrarre idee creative e nuove che vogliamo
essere. Studio contemporaneamente due modelli. Questo studio si basa sia sulla ricerca che
sulla discussione che l’autore pensa possa essere utile per capire e far crescere insieme la nostra
fantasia e la realtà.Publishing house: Edizioni Sapienza Website: https://sciencia-scripts.com
By (author) : Henry Garrett Number of pages:60Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Due modelli, ottimizzazione dei percorsi e del
trasporto, Two Models, Optimizing Routes and Transportation
MoreBooks Henry Garrett Analisi dei modelli e guida oltre (Paperback) About this item
Product details
L’approccio per risolvere i problemi è una selezione ovvia per fare ricerca e analisi della
situazione che può suscitare le prospettive vaghe che non vogliamo essere per estrarre idee
creative e nuove che vogliamo essere. Studio contemporaneamente due modelli. Questo studio
si basa sia sulla ricerca che sulla discussione che l’autore pensa possa essere utile per capire e far
crescere insieme la nostra fantasia e la realtà. Analisi dei modelli e guida oltre (Paperback) We
aim to show you accurate product information. Manufacturers, suppliers and others provide
what you see here, and we have not verified it. See our disclaimer Specifications
Publisher KS Omniscriptum Publishing Book Format Paperback Number of Pages 60 Author
Henry Garrett Title Analisi dei modelli e guida oltre ISBN-13 9786203599046 Publication Date
April, 2021 Assembled Product Dimensions (L x W x H) 9.00 x 6.00 x 1.50 Inches ISBN-10
6203599042 Walmart
Analisi dei modelli e guida oltre: Approccio e problemi in due modelli (Italian Edition)
Publisher : Edizioni Sapienza (April 6, 2021) Language : Italian Paperback : 60 pages ISBN-10
: 6203599042 ISBN-13 : 978-6203599046 Item Weight : 3.53 ounces Dimensions : 5.91 x 0.14 x
8.66 inches
2021 0003 | Analyses de modèles et orientations au-delà Amazon | MoreBooks |

Walmart
Analyses de modèles et orientations au-delà Approche et problèmes dans deux
modèles Editions Notre Savoir (2021-04-06 ) eligible for voucher eligible for voucher
ISBN-13: 978-620-3-59903-9 ISBN-10:6203599034EAN:9786203599039Book language: French
Blurb/Shorttext:L’approche pour résoudre les problèmes est une sélection évidente pour faire
la recherche et l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne
voulons pas être pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie
simultanément deux modèles. Cette étude est basée à la fois sur la recherche et la discussion,
ce qui, selon l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité
ensemble.Publishing house: Editions Notre Savoir Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Two Models, Optimizing Routes and Transportation, Deux
modèles, optimisation des itinéraires et des transports
MoreBooks:
https://www.morebooks.shop/store/gb/book/analyses-de-modèles-et-orientations-au-
delà/isbn/978-620-3-59903-9
Henry Garrett Analyses de modèles et orientations au-delà (Paperback) About this item
Product details
L’approche pour résoudre les problèmes est une sélection évidente pour faire la recherche et
l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne voulons pas être
pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie simultanément
deux modèles. Cette étude est basée à la fois sur la recherche et la discussion, ce qui, selon
l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité ensemble.
Analyses de modèles et orientations au-delà (Paperback) We aim to show you accurate product
information. Manufacturers, suppliers and others provide what you see here, and we have not
verified it. See our disclaimer Specifications
Language French Publisher KS Omniscriptum Publishing Book Format Paperback Number of
Pages 64 Author Henry Garrett Title Analyses de modèles et orientations au-delà ISBN-13
9786203599039 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599034 Walmart
Analyses de modèles et orientations au-delà: Approche et problèmes dans deux modèles

(French Edition) Publisher : Editions Notre Savoir (April 6, 2021) Language : French Paperback
: 64 pages ISBN-10 : 6203599034 ISBN-13 : 978-6203599039 Item Weight : 3.67 ounces
Dimensions : 5.91 x 0.15 x 8.66 inches
9347
2021 0002 | Modell-Analysen und Anleitungen darüber hinaus Amazon | MoreBooks |
Walmart | eBay
eligible for voucher ISBN-13: 978-620-3-59901-5 ISBN-
10:6203599018EAN:9786203599015Book language: German Blurb/Shorttext:Die
Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann.Publishing house: Verlag
Unser Wissen Website: https://sciencia-scripts.com By (author) : Henry Garrett Number
of pages:68Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Zwei Modelle, Optimierung von Routen und Transport, Two Models, Optimizing
Routes and Transportation
MoreBooksHenry Garrett Modell-Analysen und Anleitungen darüber hinaus (Paperback)
About this item
Product details
Die Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann. Modell-Analysen und
Anleitungen darüber hinaus (Paperback) We aim to show you accurate product information.
Manufacturers, suppliers and others provide what you see here, and we have not verified it.
See our disclaimer Specifications
Language German Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 68 Author Henry Garrett Title Modell-Analysen und Anleitungen darüber hinaus
ISBN-13 9786203599015 Publication Date April, 2021 Assembled Product Dimensions (L x W
x H) 9.00 x 6.00 x 1.50 Inches ISBN-10 6203599018
Walmart
Seller assumes all responsibility for this listing. Item specifics Condition: New: A new, unread,
unused book in perfect condition with no missing or damaged pages. See the ... Read
moreabout the condition ISBN: 9786203599015 EAN: 9786203599015 Publication Year: 2021
Type: Textbook Format: Paperback Language: German Publication Name: Modell-Analysen
Und Anleitungen Daruber Hinaus Item Height: 229mm Author: Henry Garrett Publisher:
Verlag Unser Wissen Item Width: 152mm Subject: Mathematics Item Weight: 113g Number of
Pages: 68 Pages About this product Product Information Die Herangehensweise zur Loesung
von Problemen ist eine offensichtliche Auswahl fur die Forschung und Analyse der Situation, die
die vagen Perspektiven, die wir nicht sein wollen, fur die Extraktion von kreativen und neuen
Ideen, die wir sein wollen, hervorbringen kann. Ich studiere gleichzeitig zwei Modelle. Diese
Studie basiert sowohl auf der Forschung als auch auf der Diskussion, von der der Autor denkt,
dass sie fur das Verstandnis und das Zusammenwachsen unserer Fantasie und Realitat nutzlich
sein kann. Product Identifiers Publisher Verlag Unser Wissen ISBN-13 9786203599015 eBay
Product ID (ePID) 11049032082 Product Key Features Publication Name Modell-Analysen
Und Anleitungen Daruber Hinaus Format Paperback Language German Subject Mathematics
Publication Year 2021 Type Textbook Author Henry Garrett Number of Pages 68 Pages
Dimensions Item Height 229mm Item Width 152mm Item Weight 113g Additional Product
Features Title
A uthorHenryGarrett
eBay
Modell-Analysen und Anleitungen darüber hinaus: Ansatz und Probleme in zwei Modellen
(German Edition) Publisher : Verlag Unser Wissen (April 6, 2021) Language : German
Paperback : 68 pages ISBN-10 : 6203599018 ISBN-13 : 978-6203599015 Item Weight : 3.99
ounces Dimensions : 5.91 x 0.16 x 8.66 inches Paperback
2021 0001 | Model Analyses and Guidance Beyond Amazon&MoreBooks

9348
Model Analyses and Guidance Beyond Approach and Problems in Two Models LAP
LAMBERT Academic Publishing (2020-12-02 ) eligible for voucher ISBN-13: 978-620-3-19506-
4 ISBN-10:6203195065EAN:9786203195064Book language: English Blurb/Shorttext:Approach
for solving problems is an obvious selection for doing research and analysis the situation
which may elicit the vague perspectives which we want not to be for extracting creative
and new ideas which we want to be. I simultaneously study two models. This study is based
both research and discussion which the author thinks that may be useful for understanding
and growing our fantasizing and reality together.Publishing house: LAP LAMBERT
Academic Publishing Website: https://www.lap-publishing.com/ By (author) : Henry Garrett
Number of pages:52Published on:2020-12-02Stock:Available Category: Mathematics Price:39.90
Keywords:Two Models, Optimizing Routes and Transportation
MoreBooks
Model Analyses and Guidance Beyond: Approach and Problems in Two Models Publisher :
LAP LAMBERT Academic Publishing (December 2, 2020) Language : English Paperback : 52
pages ISBN-10 : 6203195065 ISBN-13 : 978-6203195064 Item Weight : 3.39 ounces Dimensions
: 5.91 x 0.12 x 8.66 inches
9349
Participating in Seminars
I’ve participated in all virtual conferences which are listed below [Some of them without selective process].
–https://web.math.princeton.edu/ pds/onlinetalks/talks.html
...
Also, I’ve participated in following events [Some of them without selective process]:
-The Hidden NORMS seminar

-Talk Math With Your Friends (TMWYF)
-MATHEMATICS COLLOQUIUM: https://www.csulb.edu/mathematics-statistics/mathematics-colloquium
-Lathisms: Cafe Con Leche
-Big Math network
...
I’m in mailing list in following [Some of them without selective process] organizations:
-[Algebraic-graph-theory] AGT Seminar (lists-uwaterloo-ca)

-Combinatorics Lectures Online (https://web.math.princeton.edu/ pds/onlinetalks/talks.html)
-Women in Combinatorics
-CMSA-Seminar (unsw-au)
-OURFA2M2 Online Undergraduate Resource Fair for the Advancement and Alliance of Marginalized Mathematicians
...
9350
Social Accounts
I’ve listed my accounts below.
-My website [Covering all my contributions containing articles and books as free access to download with PDF
extension and more]: https://drhenrygarrett.wordpress.com
-Amazon [Some of my all books, here]: https://www.amzn.com/author/drhenrygarrett
-Twitter: @DrHenryGarrett (www.twitter.com/DrHenryGarrett)
– ResearchGate: https://www.researchgate.net/profile/Henry-Garrett-2
-Academia: https://independent.academia.edu/drhenrygarrett/
-Scribd: https://www.scribd.com/user/596815491/Henry-Garrett
-Scholar: https://scholar.google.com/citations?hl=enuser=SUjFCmcAAAAJview_op=list_workssortby=pubdate
-LinkedIn: https://www.linkedin.com/in/drhenrygarrett/
9351
Certificate of Reviewer
Reference: AJCST Date: December 11, 2022
The certificate is awarded to
Henry Garrett, Department of Mathematics, City University of New York, New York, United States
In recognition of the appointment as a Reviewer of American Journal of Computer Science and Technology(AJCST)
ISSN Print: 2640-0111; ISSN Online: 2640-012X
https://www.sciencepg.com/j/ajcst
from December 11, 2022 to December 11, 2024
9352
9353
9354
Henry Garrett
01/23/2022
9355
References
2017-2022 Dr. Henry Garrett WEBSITE
Department of Mathematics, Independent Researcher, Manhattan, NY, USA.

E-mail address: DrHenryGarrett @gmail.com
2017-2022 Dr. Henry Garrett WEBSITE
Department of Mathematics, Independent Researcher, Manhattan, NY, USA.

E-mail address: HenryGarrettNY @gmail.com
DrHenryGarrett.wordpress.com · Twitter.com/DrHenryGarrett
9356

Edge-Gap in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Edge-Gap in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Edge-Gap In

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61

10 Extreme SuperHyperEdge-Gap But As The Extensions Excerpt From

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 135

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 143

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 245

25 Neutrosophic Edge-Gap 249

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

Henry Garrett · Independent Researcher · Department of Mathematics ·

30 Neutrosophic SuperHyperEdge-Gap But As The Extensions Excerpt From

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 337

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 345

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 447

45 “SuperHyperGraph-Based Books”: | Featured Tweets 459

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.18The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperEdge-

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 460

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.22“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 478

Henry Garrett · Independent Researcher · Department of Mathematics ·

9.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

14.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

15.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 144

29.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

34.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges