Reverse Strict Connective in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/371854024
Reverse Strict Connective In SuperHyperGraphs
Book · June 2023

DOI: 10.5281/zenodo.8080167
CITATIONS
1 author:
Henry Garrett
513 PUBLICATIONS 23,337 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Fuzzy Logic View project
Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project
All content following this page was uploaded by Henry Garrett on 26 June 2023.
The user has requested enhancement of the downloaded file.

Reverse Strict Connective
In SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures vi
List of Tables xi
1 ABSTRACT 1
2 Background 13
Bibliography 19
3 Acknowledgements 45
4 Cancer In Extreme SuperHyperGraph 47
5 Extreme Reverse Strict Connective 51
6 New Ideas On Super Con By Hyper Conceit Of Reverse Strict Connect-

ive In Recognition of Cancer With (Neutrosophic) SuperHyperGraph 53
7 ABSTRACT 55
8 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 61
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 65
10 Extreme SuperHyperReverse Strict Connective But As The Extensions Ex-

cerpt From Dense And Super Forms 77
11 The Extreme Departures on The Theoretical Results Toward Theoretical

Motivations 119
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 129
13 Extreme Applications in Cancer’s Extreme Recognition 141
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

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

Motivations 147
17 Conclusion and Closing Remarks 149
18 Extreme SuperHyperDuality But As The Extensions Excerpt From

Dense And Super Forms 151
19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 221
Bibliography 227
24 Cancer In Neutrosophic SuperHyperGraph 253
25 Neutrosophic Reverse Strict Connective 257
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Reverse Strict Connective As Hyper Conceit On Super Con 259
27 ABSTRACT 261
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 271

30 Neutrosophic SuperHyperReverse Strict Connective But As The Extensions

Excerpt From Dense And Super Forms 283
31 The Neutrosophic Departures on The Theoretical Results Toward

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

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

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

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

Motivations 357
37 Conclusion and Closing Remarks 359
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 417
43 Background 431
Bibliography 437
44 Books’ Contributions 463
45 “SuperHyperGraph-Based Books”: | Featured Tweets 475
46 CV 503

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

SuperHyperReverse Strict Connective in the Extreme Example (42.0.3) . . . . . . . . . . 83
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

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

perReverse Strict Connective in the Example (42.0.5) . . . . . . . . . . . . . . . . . . . . 120
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperReverse Strict Connective in the Example (42.0.11) . . . . . . . . . . 125
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperReverse Strict Connective in the Example (42.0.13) . . . . . . . . . . . . . . . 127
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperReverse Strict Connective in the Extreme Example (42.0.15) . . . . 128
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

perReverse Strict Connective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperReverse Strict Connective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic Example (42.0.3) 289


30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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 SuperHyperReverse Strict Connective in the Example (42.0.11) . 333
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG290] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse
Strict Connective In Recognition of Cancer With (Neutrosophic) SuperHyper-
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.8080068). . . . . . . . . . . . . . . . . 464
44.4 [HG291] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Strict Connective As Hyper Conceit On Super Con”,
Zenodo 2023, (doi: 10.5281/zenodo.8080100). . . . . . . . . . . . . . . . . . . . . . 466
44.7 [HG185b] Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.8080167). . . . . . . . . . . . . . . . . . 471
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 476

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 477
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 478
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 484



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) 74
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 75

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 144

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 146
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 150

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 354

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 356
37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 360
xi
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme Reverse 1
Strict Connective In SuperHyperGraphs” and “Neutrosophic Reverse Strict Connective In 2
SuperHyperGraphs” about some scientific research on Reverse Strict Connective In SuperHyper- 3

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

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

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 41
Reverse Strict Connective In SuperHyperGraphs . Since there’s more ways to get type-results 42
to make a Reverse Strict Connective In SuperHyperGraphs more understandable. For the 43
sake of having Neutrosophic Reverse Strict Connective In SuperHyperGraphs, there’s a need 44
to “redefine” the notion of a “Reverse Strict Connective In SuperHyperGraphs ”. The Su- 45
perHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 46
the alphabets. In this procedure, there’s the usage of the position of labels to assign to 47
the values. Assume a Reverse Strict Connective In SuperHyperGraphs . It’s redefined a 48
Neutrosophic Reverse Strict Connective In SuperHyperGraphs if the mentioned Table holds, 49
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 50
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 51
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 52
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 53
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 54
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 55
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 56
on a Reverse Strict Connective In SuperHyperGraphs . It’s the main. It’ll be disciplinary 57
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 58

need to have all Reverse Strict Connective In SuperHyperGraphs until the Reverse Strict 59
Connective In SuperHyperGraphs, then it’s officially called a “Reverse Strict Connective In 60
SuperHyperGraphs” but otherwise, it isn’t a Reverse Strict Connective In SuperHyperGraphs . 61
There are some instances about the clarifications for the main definition titled a “Reverse Strict 62
Connective In SuperHyperGraphs ”. These two examples get more scrutiny and discernment 63
since there are characterized in the disciplinary ways of the SuperHyperClass based on a 64
Reverse Strict Connective In SuperHyperGraphs . For the sake of having a Neutrosophic 65
Reverse Strict Connective In SuperHyperGraphs, there’s a need to “redefine” the notion of a 66
“Neutrosophic Reverse Strict Connective In SuperHyperGraphs” and a “Neutrosophic Reverse 67
Strict Connective In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges 68
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 69
of the position of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s 70
redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a Reverse Strict 71
Connective In SuperHyperGraphs are redefined to a “Neutrosophic Reverse Strict Connective 72
In SuperHyperGraphs” if the intended Table holds. It’s useful to define “Neutrosophic” version 73
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 74
Neutrosophic Reverse Strict Connective In SuperHyperGraphs more understandable. Assume 75

a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 76
intended Table holds. Thus SuperHyperPath, Reverse Strict Connective In SuperHyperGraphs, 77
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 78
“Neutrosophic SuperHyperPath”, “Neutrosophic Reverse Strict Connective In SuperHyper- 79

Graphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic 80

SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 81
SuperHyperGraph has a “Neutrosophic Reverse Strict Connective In SuperHyperGraphs” where 82
it’s the strongest [the maximum Neutrosophic value from all the Reverse Strict Connective 83
In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a Reverse 84
Strict Connective In SuperHyperGraphs .] Reverse Strict Connective In SuperHyperGraphs 85
. A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements 86

of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are 87
some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 88
intersection amid two given SuperHyperEdges with two exceptions; it’s Reverse Strict Con- 89
nective In SuperHyperGraphs if it’s only one SuperVertex as intersection amid two given 90
SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 91
SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 92
given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHy- 93
perEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection 94
amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has 95
no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex as 96
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 97
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 98
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 99
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 100
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 101
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 102
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 103
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 104
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 105
Recognition” and the results and the definitions will be introduced in redeemed ways. The 106
recognition of the cancer in the long-term function. The specific region has been assigned 107
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 108
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 109
since there are some determinacy, indeterminacy and neutrality about the moves and the 110
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 111
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 112
done. There are some specific models, which are well-known and they’ve got the names, and 113
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 114
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 115
SuperHyperPath(-/Reverse Strict Connective In SuperHyperGraphs, SuperHyperStar, SuperHy- 116
perBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 117
Reverse Strict Connective In SuperHyperGraphs or the strongest Reverse Strict Connective In 118
SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest Reverse Strict 119
Connective In SuperHyperGraphs, called Reverse Strict Connective In SuperHyperGraphs, and 120
the strongest Reverse Strict Connective In SuperHyperGraphs, called Neutrosophic Reverse 121
Strict Connective In SuperHyperGraphs, some general results are introduced. Beyond that 122
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 123
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 124
Reverse Strict Connective In SuperHyperGraphs. There isn’t any formation of any Reverse 125

Strict Connective In SuperHyperGraphs but literarily, it’s the deformation of any Reverse Strict 126
Connective In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A basic familiarity 127
with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are proposed. 128
Keywords: SuperHyperGraph, (Neutrosophic) Reverse Strict Connective In SuperHyper- 129
Graphs, Cancer’s Recognition 130

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

is a maximal Neutrosophic Reverse Strict Connective In SuperHyperGraphs of SuperHyperVer- 159
tices with maximum Neutrosophic cardinality such that either of the following expressions hold 160
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 161
|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 162
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 163
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 164

version of Reverse Strict Connective In SuperHyperGraphs . Since there’s more ways to get 165
type-results to make Reverse Strict Connective In SuperHyperGraphs more understandable. 166
For the sake of having Neutrosophic Reverse Strict Connective In SuperHyperGraphs, there’s 167
a need to “redefine” the notion of “Reverse Strict Connective In SuperHyperGraphs ”. The 168
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 169
of the alphabets. In this procedure, there’s the usage of the position of labels to assign 170

to the values. Assume a Reverse Strict Connective In SuperHyperGraphs . It’s redefined 171
Neutrosophic Reverse Strict Connective In SuperHyperGraphs if the mentioned Table holds, 172
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 173
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 174
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 175
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 176
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 177
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 178
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 179
on Reverse Strict Connective In SuperHyperGraphs . It’s the main. It’ll be disciplinary 180
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 181
need to have all Reverse Strict Connective In SuperHyperGraphs until the Reverse Strict 182
Connective In SuperHyperGraphs, then it’s officially called “Reverse Strict Connective In 183
SuperHyperGraphs” but otherwise, it isn’t Reverse Strict Connective In SuperHyperGraphs . 184
There are some instances about the clarifications for the main definition titled “Reverse Strict 185
Connective In SuperHyperGraphs ”. These two examples get more scrutiny and discernment 186
since there are characterized in the disciplinary ways of the SuperHyperClass based on Reverse 187
Strict Connective In SuperHyperGraphs . For the sake of having Neutrosophic Reverse Strict 188
Connective In SuperHyperGraphs, there’s a need to “redefine” the notion of “Neutrosophic 189

Reverse Strict Connective In SuperHyperGraphs” and “Neutrosophic Reverse Strict Connective 190
In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned 191
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 192
position of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s 193
redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And Reverse Strict 194
Connective In SuperHyperGraphs are redefined “Neutrosophic Reverse Strict Connective In 195

SuperHyperGraphs” if the intended Table holds. It’s useful to define “Neutrosophic” version 196
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make 197
Neutrosophic Reverse Strict Connective In SuperHyperGraphs more understandable. Assume 198
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 199
intended Table holds. Thus SuperHyperPath, Reverse Strict Connective In SuperHyperGraphs, 200
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 201

“Neutrosophic SuperHyperPath”, “Neutrosophic Reverse Strict Connective In SuperHyper- 202
Graphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic 203
SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 204
SuperHyperGraph has “Neutrosophic Reverse Strict Connective In SuperHyperGraphs” where 205
it’s the strongest [the maximum Neutrosophic value from all Reverse Strict Connective In 206
SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a Reverse Strict 207
Connective In SuperHyperGraphs .] Reverse Strict Connective In SuperHyperGraphs . A graph 208
is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges 209
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 210
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given Su- 211
perHyperEdges with two exceptions; it’s Reverse Strict Connective In SuperHyperGraphs if it’s 212
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 213
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 214
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 215
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 216

forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 218
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 219
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 220
the specific designs and the specific architectures. The SuperHyperModel is officially called 221
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 222
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 223
and the common and intended properties between “specific” cells and “specific group” of 224
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 225
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 226
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, 227
the foundation will be based on the “Cancer’s Neutrosophic Recognition” and the results 228
and the definitions will be introduced in redeemed ways. The Neutrosophic recognition of 229
the cancer in the long-term function. The specific region has been assigned by the model 230
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 231
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 232
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 233
cancer on that region; this event leads us to choose another model [it’s said to be Neutro- 234
sophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 235
done. There are some specific models, which are well-known and they’ve got the names, and 236
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 237
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 238
SuperHyperPath(-/Reverse Strict Connective In SuperHyperGraphs, SuperHyperStar, SuperHy- 239
perBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 240
Reverse Strict Connective In SuperHyperGraphs or the strongest Reverse Strict Connective In 241
SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest Reverse Strict 242
Connective In SuperHyperGraphs, called Reverse Strict Connective In SuperHyperGraphs, and 243
the strongest Reverse Strict Connective In SuperHyperGraphs, called Neutrosophic Reverse 244
Strict Connective In SuperHyperGraphs, some general results are introduced. Beyond that 245
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 246
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 247
Reverse Strict Connective In SuperHyperGraphs. There isn’t any formation of any Reverse 248
Strict Connective In SuperHyperGraphs but literarily, it’s the deformation of any Reverse Strict 249
Connective In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A basic familiarity 250
with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are proposed. 251
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Reverse Strict Connective In 252
SuperHyperGraphs, Cancer’s Neutrosophic Recognition 253

255
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 256
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 257
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 258
Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 259
United State. This research book covers different types of notions and settings in neutrosophic 260
graph theory and neutrosophic SuperHyperGraph theory. 261

262
263
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 264
cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 265
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 266
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 267
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 268
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 269
270
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 271
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 272
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 273
Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 274
33131 United States. This research book presents different types of notions SuperHyperResolving 275
and Reverse Strict Connective In SuperHyperGraphs in the setting of duality in neutrosophic 276
graph theory and neutrosophic SuperHyperGraph theory. This research book has scrutiny on 277
the complement of the intended set and the intended set, simultaneously. It’s smart to consider 278
a set but acting on its complement that what’s done in this research book which is popular in 279
the terms of high readers in Scribd. 280
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 281
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 282
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 283
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 284
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 285

978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 286




CHAPTER 2 287
Background 288
There are some scientific researches covering the topic of this research. In what follows, there 289
are some discussion and literature reviews about them. 290
The seminal paper and groundbreaking article is titled “New Ideas In Recognition of Cancer 291
And Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot” in Ref. [HG11s] by Henry 292
Garrett (2023). In this research article, a novel approach is implemented on SuperHyperGraph 293
and neutrosophic SuperHyperGraph based on general forms with introducing used neutrosophic 294
classes of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 295
entitled “Current Trends in Mass Communication (CTMC)” with ISO abbreviation “Curr 296
Trends Mass Comm” in volume 2 and issue 1 with pages 32-55. 297
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co- 298
Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 299
Applications in Cancer’s Treatments” in Ref. [HG22s] by Henry Garrett (2023). In this 300
research article, a novel approach is implemented on SuperHyperGraph and neutrosophic Supe- 301
rHyperGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 302
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 303
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 304
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 305
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 306
toward independent results based on initial background and fundamental SuperHyperNumbers. 307
The seminal paper and groundbreaking article is titled “A Research on Cancer’s Recognition 308
and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets 309
as Hyper Covering Versus Super separations” in Ref. [HG33s] by Henry Garrett (2023). In 310
this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 311
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Recognition. 312
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 313
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 314
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 318
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 319
Neutrosophic Super Hyper Classes” in Ref. [HG44s] by Henry Garrett (2022). In this research 320
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 321
13
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 322

of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 323
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 324
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 325
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 326
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 327
and fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is titled 328
“neutrosophic co-degree and neutrosophic degree alongside chromatic numbers in the setting of 329
some classes related to neutrosophic hypergraphs” in Ref. [HG55s] by Henry Garrett (2023). 330
In this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 331
SuperHyperGraph based on general forms without using neutrosophic classes of neutrosophic 332
SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal of Current 333
Trends in Computer Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp 334
Sci Res” in volume 2 and issue 1 with pages 16-24. The research article studies deeply with choos- 335
ing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough 336
toward independent results based on initial background. The research article studies deeply 337
with choosing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the 338
breakthrough toward independent results based on initial background. In some articles are titled 339
“0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring 340
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry 341
Garrett (2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] 342
by Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation 343
under Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in 344
Ref. [HG6] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside 345
The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 346
SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [HG7] by Henry Garrett (2022), 347
“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic 348
SuperHyperGraphs” in Ref. [HG8] by Henry Garrett (2022), “The Shift Paradigm To Classify 349
Separately The Cells and Affected Cells Toward The Totality Under Cancer’s Recognition By 350
New Multiple Definitions On the Sets Polynomials Alongside Numbers In The (Neutrosophic) 351
SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” 352

in Ref. [HG9] by Henry Garrett (2022), “Breaking the Continuity and Uniformity of Cancer 353
In The Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s 354
Recognition Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett 355
(2022), “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 356
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. 357

[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Cir- 358
cumstances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. 359
[HG12] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 360
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), 361
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act 362
on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry 363

Garrett (2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 364
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 365
[HG15] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recogni- 366
tion by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by 367

Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 368

SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 369
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 370
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 371
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 372
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 373
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 374

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 375
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 376
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 377
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 378
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 379
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 380

rHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some 381
SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and Su- 382
perHyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry 383
Garrett (2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHy- 384
perGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. 385
[HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials 386

To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry 387
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s 388
Extreme Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial 389
on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme 390
Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Con- 391
nections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” 392

in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 393
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 394
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 395
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 396
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 397
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 398
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 399
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 400
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 401
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 402
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 403
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 404
in Ref. [HG31] by Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To 405
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 406
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 407
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 408
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 409
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 410
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 411
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 412
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 413

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyper- 414

Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 415
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 416
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study 417
Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 418
SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; 419
HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; 420
HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; HG24; HG25; HG26; 421
HG106; HG107; HG111; HG112; HG115; HG116; HG120; HG121; HG122; HG123; 424
HG288; HG289; HG290; HG291], there are some endeavors to formalize the basic Super- 441
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 442
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 443
HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 444
HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; HG106b; 447
HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; HG114b; 448


HG179b; HG180b; HG181b; HG182b; HG183b; HG184b; HG185b]. Two popular 457
scientific research books in Scribd in the terms of high readers, 4728 and 5721 respectively, on 458
neutrosophic science is on [HG32b; HG44b]. 459

Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 460
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 461
more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 462
by Dr. Henry Garrett. This research book covers different types of notions and settings in 463
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 464
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 465
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 466
has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 467
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 468
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 469
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 470
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 471
that what’s done in this research book which is popular in the terms of high readers in Scribd. 472
See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 473
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 474
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 475
HG290; HG291] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; 497


HG183b; HG184b; HG185b]. Two popular scientific research books in Scribd in the terms 512
of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 513

Bibliography 514
HG11s [1] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 515
Graph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32- 516
55. (https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of- 517
cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf) 518
HG22s [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 519
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 520
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 521
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 522
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 523
alongside-a.pdf) 524
HG33s [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 525
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 526
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 527
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 528
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 529
hamiltonian-sets-.pdf) 530
HG44s [4] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 531
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 532
Trends Comp Sci Res 2(1) (2023) 16-24. (doi: 10.33140/JCTCSR.02.01.04) 533
HG55s [5] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 534
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 535
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 536
10.33140/JMTCM.01.03.09) 537
HG4 [6] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 538
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 539
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 540
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 541
https://oa.mg/work/10.5281/zenodo.6319942 542
HG5 [7] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 543
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 544
19
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 545

https://oa.mg/work/10.13140/rg.2.2.35241.26724 546
HG6 [8] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 547
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 548

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 549
HG7 [9] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 550
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 551
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 552

10.20944/preprints202301.0282.v1). 553
HG8 [10] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 554
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 555

10.20944/preprints202301.0267.v1). 556
HG9 [11] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 557
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 558
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 559

on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 560
(doi: 10.20944/preprints202301.0265.v1). 561
HG10 [12] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 562
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 563
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 564
prints202301.0262.v1). 565
HG11 [13] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 566
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 567
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 568
HG12 [14] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 569
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 570
2023010224, (doi: 10.20944/preprints202301.0224.v1). 571
HG13 [15] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 572
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 573

prints202301.0105.v1). 574
HG14 [16] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 575
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 576

HG15 [17] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 578
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 579
Preprints 2023, 2023010044 580
HG16 [18] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 581
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 582
10.20944/preprints202301.0043.v1). 583

HG17 [19] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 584
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 585
HG19 [21] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 590
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 591
(doi: 10.20944/preprints202212.0549.v1). 592
HG20 [22] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 593
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 594

(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 595
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 596
HG21 [23] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 597
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 598
(doi: 10.20944/preprints202212.0500.v1). 599
HG22 [24] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 600
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 601
HG23 [25] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 603
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 604
HG291 [26] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 606
By Reverse Strict Connective As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 607
10.5281/zenodo.8080100). 608
HG290 [27] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Strict Connective 609
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 610

10.5281/zenodo.8080068). 611
By Unequal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, 613
(doi: 10.5281/zenodo.8078445). 614
HG288 [29] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal Connective 615
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 616
2023, (doi: 10.5281/zenodo.8078543). 617
By Strict Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 619
10.5281/zenodo.8076416). 620

HG286 [31] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict Connective 621
2023, (doi: 10.5281/zenodo.8076399). 623
By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, 625
(doi: 10.5281/zenodo.8072171). 626
HG284 [33] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension 627
2023, (doi: 10.5281/zenodo.8072267). 629
By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 631
10.5281/zenodo.8067384). 632
HG282 [35] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension 633
2023, (doi: 10.5281/zenodo.8067409). 635
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 637
10.5281/zenodo.8061927). 638
HG280 [37] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 639
10.5281/zenodo.8062016). 641
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 643
10.5281/zenodo.8057696). 644
HG278 [39] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 645
2023, (doi: 10.5281/zenodo.8057753). 647
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 649
10.5281/zenodo.8052893). 650
HG276 [41] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 651
2023, (doi: 10.5281/zenodo.8052925). 653
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 655
10.5281/zenodo.8051346). 656
HG274 [43] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 657
10.5281/zenodo.8051360). 659

HG273 [44] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 660
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 661
10.5281/zenodo.8025707). 662
HG272 [45] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 663
10.5281/zenodo.8027275). 665
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 667
odo.8017246). 668
HG270 [47] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 669
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 670
10.5281/zenodo.8020128). 671
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 673
odo.7978571). 674
HG268 [49] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 675
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 676
10.5281/zenodo.7978857). 677
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 679
10.5281/zenodo.7940830). 680
HG266 [51] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 681
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 682
10.5281/zenodo.7943578). 683
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 685
odo.7916595). 686
HG264 [53] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 687
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 688
odo.7923632). 689
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 691
(doi: 10.5281/zenodo.7904698). 692
HG262 [55] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 693
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 694
2023, (doi: 10.5281/zenodo.7904671). 695
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 697
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 698

HG260 [57] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 699
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 700
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 701
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 703
10.5281/zenodo.7871026). 704
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 706
2023, (doi: 10.5281/zenodo.7874647). 707
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 709
10.5281/zenodo.7857856). 710
HG256 [61] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 711
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 712
2023, (doi: 10.5281/zenodo.7857841). 713
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 715
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 718
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 721
10.5281/zenodo.7853867). 722
HG252 [65] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 723
10.5281/zenodo.7853922). 725
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 727
(doi: 10.5281/zenodo.7851519). 728
HG250 [67] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 729
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 730
(doi: 10.5281/zenodo.7851550). 731
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 733
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 736

By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 739
10.5281/zenodo.7834229). 740
HG246 [71] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 741
10.5281/zenodo.7834261). 743
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 745
10.5281/zenodo.7824560). 746
HG244 [73] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 747
(doi: 10.5281/zenodo.7824623). 749
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 751
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 754
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 757
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 759
2023, (doi: 10.5281/zenodo.7809365). 760
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 762
2023, (doi: 10.5281/zenodo.7809358). 763
HG238 [79] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 764
10.5281/zenodo.7809219). 766
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 768
10.5281/zenodo.7809328). 769
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 771
2023, (doi: 10.5281/zenodo.7806767). 772
HG235 [82] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 773
2023, (doi: 10.5281/zenodo.7806838). 775

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 777
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 778
HG233 [84] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 779
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 780
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 781
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 783
10.5281/zenodo.7799902). 784
HG231 [86] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 785
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 786
(doi: 10.5281/zenodo.7804218). 787
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 789
(doi: 10.5281/zenodo.7796334). 790
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 792
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 795
10.5281/zenodo.7791952). 796
HG225 [90] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 797
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 798
10.5281/zenodo.7791982). 799
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 801
10.5281/zenodo.7790026). 802
HG223 [92] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 803
10.5281/zenodo.7790052). 805
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 807
2023, (doi: 10.5281/zenodo.7787066). 808
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 810
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 811
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 813
10.5281/zenodo.7781476). 814

HG219 [96] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 815
10.5281/zenodo.7783082). 817
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 819
10.5281/zenodo.7777857). 820
HG217 [98] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 821
10.5281/zenodo.7779286). 823
HG215 [99] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 824
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 825
(doi: 10.5281/zenodo.7771831). 826
HG214 [100] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 827
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 828
2023, (doi: 10.5281/zenodo.7772468). 829
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 831
10.13140/RG.2.2.20913.25446). 832
HG212 [102] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 833
odo.7764916). 835
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 837
10.13140/RG.2.2.11770.98247). 838
HG210 [104] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 839
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 840
10.13140/RG.2.2.12400.12808). 841
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 843
2023, (doi: 10.13140/RG.2.2.22545.10089). 844
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 846
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 847
HG207 [107] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 848
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 849
10.13140/RG.2.2.11377.76644). 850
HG206 [108] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 851
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 852
10.13140/RG.2.2.23750.96329). 853

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 855
10.13140/RG.2.2.31366.24641). 856
HG204 [110] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 857
10.13140/RG.2.2.34721.68960). 859
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 861
2023, (doi: 10.13140/RG.2.2.30212.81289). 862
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 864
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 867
10.13140/RG.2.2.24288.35842). 868
HG200 [114] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 869
10.13140/RG.2.2.32467.25124). 871
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 873
10.13140/RG.2.2.31025.45925). 874
HG198 [116] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 875
10.13140/RG.2.2.17184.25602). 877
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 879
10.13140/RG.2.2.23423.28327). 880
HG196 [118] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 881
10.13140/RG.2.2.28456.44805). 883
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 885
10.13140/RG.2.2.23525.68320). 886
HG194 [120] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 887
10.13140/RG.2.2.20170.24000). 889
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 891
10.13140/RG.2.2.36475.59683). 892

HG192 [122] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 893
10.13140/RG.2.2.29764.71046). 895
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 897
2023, (doi: 10.13140/RG.2.2.18780.87683). 898
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 900
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 903
10.13140/RG.2.2.26134.01603). 904
HG188 [126] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 905
10.13140/RG.2.2.27392.30721). 907
HG187 [127] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 908
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 909
10.13140/RG.2.2.33028.40321). 910
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 912
10.13140/RG.2.2.21389.20966). 913
HG185 [129] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 914
10.13140/RG.2.2.16356.04489). 916
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 918
10.13140/RG.2.2.21756.21129). 919
HG183 [131] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 920
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 921
10.13140/RG.2.2.30983.68009). 922
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 924
10.13140/RG.2.2.28552.29445). 925
HG181 [133] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 926
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 927
(doi: 10.13140/RG.2.2.10936.21761). 928
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 930
10.13140/RG.2.2.35105.89447). 931

HG179 [135] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 932
(doi: 10.13140/RG.2.2.30072.72960). 934
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 936
10.13140/RG.2.2.31147.52003). 937
HG177 [137] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 938
10.13140/RG.2.2.32825.24163). 940
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 942
10.13140/RG.2.2.13059.58401). 943
HG175 [139] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 944
10.13140/RG.2.2.11172.14720). 946
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 948
2023, (doi: 10.13140/RG.2.2.22011.80165). 949
HG173 [141] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 950
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 951
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 952
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 954
2023, (doi: 10.13140/RG.2.2.10493.84962). 955
HG171 [143] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 956
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 958
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 960
2023, (doi: 10.13140/RG.2.2.19944.14086). 961
HG169 [145] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 962
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 964
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 966
(doi: 10.13140/RG.2.2.33103.76968). 967
HG167 [147] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 968
(doi: 10.13140/RG.2.2.23037.44003). 970

By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 972
(doi: 10.13140/RG.2.2.35646.56641). 973
HG165 [149] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 974
10.13140/RG.2.2.18030.48967). 976
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 978
(doi: 10.13140/RG.2.2.13973.81121). 979
HG163 [151] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 980
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 981
2023, (doi: 10.13140/RG.2.2.34106.47047). 982
HG162 [152] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 983
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 984
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 987
2023, (doi: 10.13140/RG.2.2.31956.88961). 988
HG160 [154] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 989
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 990
2023, (doi: 10.13140/RG.2.2.15179.67361). 991
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 993
10.13140/RG.2.2.21510.45125). 994
HG158 [156] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 995
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 996
2023, (doi: 10.13140/RG.2.2.13121.84321). 997
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 999
10.13140/RG.2.2.11758.69441). 1000
HG156 [158] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 1001
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1002
2023, (doi: 10.13140/RG.2.2.31891.35367). 1003
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1005
10.13140/RG.2.2.19360.87048). 1006
HG154 [160] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1007
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1008
10.13140/RG.2.2.32363.21286). 1009

HG153 [161] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1010
10.13140/RG.2.2.23266.81602). 1012
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1014
10.13140/RG.2.2.19911.37285). 1015
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1017
10.13140/RG.2.2.11050.90569). 1018
HG150 [164] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 1019
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 1020
2023, (doi: 10.13140/RG.2.2.17761.79206). 1021
HG149 [165] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 1022
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1023
HG148 [166] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1025
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1026
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1027
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1029
(doi: 10.13140/RG.2.2.30182.50241). 1030
HG146 [168] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1031
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1032
HG145 [169] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1034
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1035
HG144 [170] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1037
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1038
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1039
HG143 [171] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1040
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1041
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1042
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1045
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1048

HG140 [174] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1049
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1050
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1051
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1054
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1057
HG137 [177] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1058
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1059
HG136 [178] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1061
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1062
2023, (doi: 10.13140/RG.2.2.17252.24968). 1063
HG135 [179] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1064
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1065
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1066
HG134 [180] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1067
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1068
HG132 [181] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1070
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1071
2023010396 (doi: 10.20944/preprints202301.0396.v1). 1072
HG131 [182] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1073
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1074
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1075
HG130 [183] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1076
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1077
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1078
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1079
HG129 [184] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1080

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

HG128 [185] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1084
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1085
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1086

HG127 [186] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1087
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1088
2023,(doi: 10.13140/RG.2.2.36745.93289). 1089
HG126 [187] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1090
HG125 [188] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1093

10.20944/preprints202301.0282.v1). 1096
HG124 [189] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1097
10.20944/preprints202301.0267.v1).). 1099

(doi: 10.20944/preprints202301.0265.v1). 1104
HG122 [191] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1105
prints202301.0262.v1). 1108

2023010224, (doi: 10.20944/preprints202301.0224.v1). 1114
HG24 [194] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1115

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1116
10.13140/RG.2.2.35061.65767). 1117
HG25 [195] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1118
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1119
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1120
10.13140/RG.2.2.18494.15680). 1121
HG26 [196] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1122
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1123
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1124
10.13140/RG.2.2.32530.73922). 1125

HG27 [197] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1126
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1127
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1128
10.13140/RG.2.2.15897.70243). 1129
10.13140/RG.2.2.32530.73922). 1133
prints202301.0105.v1). 1136
HG28 [200] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1137
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1138
HG29 [201] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1140
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1141
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1142

10.13140/RG.2.2.23172.19849). 1143
HG30 [204] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1150
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1151
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1152
10.13140/RG.2.2.17385.36968). 1153
Preprints 2023, 2023010044 1156
10.20944/preprints202301.0043.v1). 1159
HG31 [207] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1160
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1161
2023, (doi: 10.13140/RG.2.2.28945.92007). 1162

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1167
10.13140/RG.2.2.35774.77123). 1168

HG35 [211] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1172
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1173
10.13140/RG.2.2.29430.88642). 1174
(doi: 10.20944/preprints202212.0549.v1). 1180
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1182

10.13140/RG.2.2.19380.94084). 1183
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1191
(doi: 10.20944/preprints202212.0500.v1). 1194
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1196
10.13140/RG.2.2.20993.12640). 1197
HG952 [219] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1198

HG95 [220] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1201
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1202
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1203

HG37 [223] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1210
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1211
10.13140/RG.2.2.29173.86244). 1212
HG38 [224] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1213
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1214
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1215
HG185b [225] Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry Garrett, 1216
2023 (doi: 10.5281/zenodo.8080167). 1217
HG184b [226] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. Henry 1218
Garrett, 2023 (doi: 10.5281/zenodo.8078574). 1219
HG183b [227] Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1220
2023 (doi: 10.5281/zenodo.8076449). 1221
HG182b [228] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1222
HG181b [229] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1224
2023 (doi: 10.5281/zenodo.8067469). 1225
HG180b [230] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1226
(doi: 10.5281/zenodo.8062076). 1227
HG179b [231] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1228
HG178b [232] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1230
2023 (doi: 10.5281/zenodo.8052976). 1231
HG177b [233] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1232
(doi: 10.5281/zenodo.8051368). 1233
HG176b [234] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1234
(doi: 10.5281/zenodo.8027488). 1235
HG175b [235] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1236
10.5281/zenodo.8020181). 1237
HG174b [236] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1238
10.5281/zenodo.7978921). 1239

HG173b [237] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1240
odo.7943878). 1241
HG172b [238] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1242
10.5281/zenodo.7943871). 1243
HG171b [239] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1244
10.5281/zenodo.7923786). 1245
HG170b [240] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1246
2023 (doi: 10.5281/zenodo.7905287). 1247
HG169b [241] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1248

HG168b [242] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1250
2023 (doi: 10.5281/zenodo.7874677). 1251
HG167b [243] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1252
(doi: 10.5281/zenodo.7857906). 1253
HG166b [244] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1254
2023 (doi: 10.5281/zenodo.7856329). 1255
HG165b [245] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1256
10.5281/zenodo.7854561). 1257
HG164b [246] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1258
2023 (doi: 10.5281/zenodo.7851893). 1259
HG163b [247] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1260

HG162b [248] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1262
(doi: 10.5281/zenodo.7835063). 1263
HG161b [249] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1264
(doi: 10.5281/zenodo.7826705). 1265
HG160b [250] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1266
2023 (doi: 10.5281/zenodo.7820680). 1267
HG159b [251] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1268
10.5281/zenodo.7812750). 1269
HG158b [252] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1270

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

HG156b [254] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1274
2023 (doi: 10.5281/zenodo.7807782). 1275

HG155b [255] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1276
2023 (doi: 10.5281/zenodo.7804449). 1277
HG154b [256] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1278

HG153b [257] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1280
(doi: 10.5281/zenodo.7792307). 1281
HG152b [258] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1282
(doi: 10.5281/zenodo.7790728). 1283
HG151b [259] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1284
2023 (doi: 10.5281/zenodo.7787712). 1285
HG150b [260] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1286
10.5281/zenodo.7783791). 1287
HG149b [261] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1288
10.5281/zenodo.7780123). 1289
HG148b [262] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1290
(doi: 10.5281/zenodo.7773119). 1291
HG147b [263] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1292
odo.7637762). 1293
HG146b [264] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1294
10.5281/zenodo.7766174). 1295
HG145b [265] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1296
10.5281/zenodo.7762232). 1297
HG144b [266] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1298
(doi: 10.5281/zenodo.7758601). 1299
HG143b [267] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1300
10.5281/zenodo.7754661). 1301
HG142b [268] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1302
10.5281/zenodo.7750995) . 1303
HG141b [269] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1304
(doi: 10.5281/zenodo.7749875). 1305
HG140b [270] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1306
10.5281/zenodo.7747236). 1307
HG139b [271] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1308
10.5281/zenodo.7742587). 1309
HG138b [272] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1310
(doi: 10.5281/zenodo.7738635). 1311

HG137b [273] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1312
10.5281/zenodo.7734719). 1313
HG136b [274] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1314
10.5281/zenodo.7730484). 1315
HG135b [275] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1316
(doi: 10.5281/zenodo.7730469). 1317
HG134b [276] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1318
10.5281/zenodo.7722865). 1319
HG133b [277] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1320
odo.7713563). 1321
odo.7709116). 1323
HG131b [279] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1324
10.5281/zenodo.7706415). 1325
HG130b [280] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1326
10.5281/zenodo.7706063). 1327
HG129b [281] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1328
10.5281/zenodo.7701906). 1329
HG128b [282] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1330
odo.7700205). 1331
HG127b [283] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1332
10.5281/zenodo.7694876). 1333
HG126b [284] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1334
10.5281/zenodo.7679410). 1335
HG125b [285] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1336
10.5281/zenodo.7675982). 1337
HG124b [286] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1338
10.5281/zenodo.7672388). 1339
HG123b [287] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1340
odo.7668648). 1341
HG122b [288] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1342
10.5281/zenodo.7662810). 1343
HG121b [289] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1344
10.5281/zenodo.7659162). 1345
HG120b [290] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1346
odo.7653233). 1347

HG119b [291] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1348
odo.7653204). 1349
HG118b [292] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1350
odo.7653142). 1351
HG117b [293] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1352
odo.7653117). 1353
HG116b [294] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1354
HG115b [295] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1355
odo.7651687). 1356
HG114b [296] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1357
odo.7651619). 1358
HG113b [297] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1359
odo.7651439). 1360
HG112b [298] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1361
odo.7650729). 1362
HG111b [299] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1363
odo.7647868). 1364
HG110b [300] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1365
odo.7647017). 1366
HG109b [301] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1367
odo.7644894). 1368
HG108b [302] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1369
HG107b [303] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1370
odo.7632923). 1371
HG106b [304] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1372
odo.7623459). 1373
HG105b [305] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1374
10.5281/zenodo.7606416). 1375
HG104b [306] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1376
10.5281/zenodo.7606416). 1377
HG103b [307] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1378
odo.7606404). 1379
HG102b [308] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1380
10.5281/zenodo.7580018). 1381

HG101b [309] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1382
odo.7580018). 1383
odo.7580018). 1385
odo.7579929). 1387
HG98b [312] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1388
10.5281/zenodo.7563170). 1389
HG97b [313] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1390
odo.7563164). 1391
HG96b [314] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1392
odo.7563160). 1393
odo.7563160). 1395
HG94b [316] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1396
10.5281/zenodo.7563160). 1397
HG93b [317] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1398
10.5281/zenodo.7557063). 1399
HG92b [318] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1400
10.5281/zenodo.7557009). 1401
HG91b [319] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1402
10.5281/zenodo.7539484). 1403
HG90b [320] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1404
10.5281/zenodo.7523390). 1405
HG89b [321] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1406
10.5281/zenodo.7523390). 1407
HG88b [322] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1408
10.5281/zenodo.7523390). 1409
HG87b [323] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1410
odo.7574952). 1411
HG86b [324] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1412
10.5281/zenodo.7574992). 1413
odo.7523357). 1415
HG84b [326] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1416
10.5281/zenodo.7523357). 1417

HG83b [327] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1418
10.5281/zenodo.7504782). 1419
HG82b [328] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1420
10.5281/zenodo.7504782). 1421
HG81b [329] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1422
10.5281/zenodo.7504782). 1423
HG80b [330] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1424
10.5281/zenodo.7499395). 1425
HG79b [331] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1426
odo.7499395). 1427
HG78b [332] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1428
10.5281/zenodo.7499395). 1429
HG77b [333] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1430
10.5281/zenodo.7497450). 1431
HG76b [334] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1432
10.5281/zenodo.7497450). 1433
HG75b [335] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1434
10.5281/zenodo.7494862). 1435
HG74b [336] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1436
odo.7494862). 1437
HG73b [337] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1438
10.5281/zenodo.7494862). 1439
HG72b [338] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1440
10.5281/zenodo.7493845). 1441
HG71b [339] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1442
odo.7493845). 1443
HG70b [340] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1444
10.5281/zenodo.7493845). 1445
HG69b [341] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1446
odo.7539484). 1447
HG68b [342] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1448
odo.7523390). 1449
HG67b [343] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1450
odo.7523357). 1451
HG66b [344] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1452
odo.7504782). 1453

HG65b [345] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1454
odo.7499395). 1455
HG64b [346] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1456
odo.7497450). 1457
HG63b [347] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1458
odo.7494862). 1459
HG62b [348] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1460
odo.7493845). 1461
HG61b [349] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1462
odo.7480110). 1463
HG60b [350] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1464
odo.7378758). 1465
HG32b [351] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1466
odo.6320305). 1467
HG44b [352] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1468
odo.6677173). 1469

CHAPTER 3 1470
Acknowledgements 1471
The author is going to express his gratitude and his appreciation about the brains and their 1472
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1473
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1474 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
1475
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 1476
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1477
ideas to be on the star lines of words and shining like stars, forever. 1478
45
CHAPTER 4 1479
Cancer In Extreme SuperHyperGraph 1480
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1481
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1482
as the consequences of the model, some parameters are used. The cells are under attack of this 1483
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1484
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1485
In the following, some Extreme steps are Extreme devised on this disease. 1486
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1487
function. 1488
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1489
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1490
effects of the cancer on that region; this event leads us to choose another model [it’s said 1493
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1494
what’s done. 1495
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1496
they’ve got the names, and some general Extreme models. The moves and the Extreme 1497
traces of the cancer on the complex tracks and between complicated groups of cells could be 1498
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1499
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1500
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1501
in those Extreme Extreme SuperHyperModels. 1502
Some cells have been faced with some attacks from the situation which is caused by the 1503
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1504
which in that, the cells could be labelled as some groups and some groups or individuals have 1505
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1506
the embedded situations, the individuals of cells and the groups of cells could be considered 1507
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1508
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1509
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1510
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1511
47
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1512
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1513
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1514
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1515
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1516
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1517
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1518

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1519
is going to figure out what’s going on this phenomenon. The special case of this disease is 1520
considered and as the consequences of the model, some parameters are used. The cells are 1521
under attack of this disease but the moves of the cancer in the special region are the matter of 1522
mind. The recognition of the cancer could help to find some treatments for this disease. The 1523
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1524
Recognition” and both bases are the background of this research. Sometimes the cancer has 1525
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1526
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1527
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1528
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1529
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1530
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1531
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1532
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1533
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1534
and neutrality about the moves and the effects of the cancer on that region; this event leads 1535
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1536
perception on what’s happened and what’s done. There are some specific models, which 1537
are well-known and they’ve got the names, and some general models. The moves and the 1538
traces of the cancer on the complex tracks and between complicated groups of cells could 1539
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1540
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1541
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1542

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1543
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1544
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1545
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1546
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1547
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1548
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1549
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1550
based on the fixed groups of cells or the fixed groups of group of cells? 1551
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1552
messy and dense SuperHyperModels where embedded notions are illustrated? 1553
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1554
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1555
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1556

research has taken more motivations to define SuperHyperClasses and to find some connections 1557
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1558
instances and examples to make clarifications about the framework of this research. The general 1559
results and some results about some connections are some avenues to make key point of this 1560
research, “Cancer’s Recognition”, more understandable and more clear. 1561
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1562
on the modeling of the regions where are under the attacks of the cancer to recognize 1563
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1564
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1565
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1566
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1567
instances and literature reviews have taken the whole way through. In this scientific research, 1568
the literature reviews have fulfilled the lines containing the notions and the results. The 1569
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1570
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1571
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1572
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1573
of the moves of the cancer in the longest and strongest styles with the formation of the design 1574
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1575
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1576
out the background for the SuperHyperNotions. 1577

CHAPTER 5 1578
Extreme Reverse Strict Connective 1579
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1580
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1581
2023, (doi: 10.13140/RG.2.2.34953.52320). 1582

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1583
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1584
(doi: 10.13140/RG.2.2.33275.80161). 1585
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1586
10.13140/RG.2.2.11050.90569). 1588
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1589
10.13140/RG.2.2.17761.79206). 1591
10.13140/RG.2.2.19911.37285). 1594
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1595
10.13140/RG.2.2.23266.81602). 1597
10.13140/RG.2.2.19360.87048). 1600
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1601
10.13140/RG.2.2.32363.21286). 1603
10.13140/RG.2.2.11758.69441). 1606
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1607
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1608
10.13140/RG.2.2.31891.35367). 1609
10.13140/RG.2.2.21510.45125). 1612
51
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1613
10.13140/RG.2.2.13121.84321). 1615

CHAPTER 6 1616
New Ideas On Super Con By Hyper 1617
Conceit Of Reverse Strict Connective In 1618
Recognition of Cancer With 1619
(Neutrosophic) SuperHyperGraph 1620
53
CHAPTER 7 1621
ABSTRACT 1622
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse 1623

Strict Connective). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Reverse Strict Connective 1624
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 1625
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperReverse Strict Connective 1626
if the following expression is called Neutrosophic e-SuperHyperReverse Strict Connective criteria holds 1627
∀Ea ∈ EN SHG , ∃Eb ∈ E 0 : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb

And ∀Ea ∈ EN SHG : (T (E), I(E), F (E)) <
maximum number of Neutrosophic strength of SuperHyperPath (NSHP)
from Neutrosophic SuperHyperVertex (NSHV) Vi
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s.;
Neutrosophic re-SuperHyperReverse Strict Connective if the following expression is called Neutrosophic 1628
e-SuperHyperReverse Strict Connective criteria holds 1629

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic 1630
v-SuperHyperReverse Strict Connective if the following expression is called Neutrosophic v- 1631

SuperHyperReverse Strict Connective criteria holds 1632
∀Va , ∃Vb ∈ V 0 : ∃Ed ∈ EN SHG , Va , Vc ∈ Ed

55
Neutrosophic rv-SuperHyperReverse Strict Connective if the following expression is called Neutrosophic 1633
v-SuperHyperReverse Strict Connective criteria holds 1634

And ∀Ea ∈ EN SHG : (T (E), I(E), F (E) <
and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1635
HyperReverse Strict Connective if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, Neut- 1636
rosophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, 1637
and Neutrosophic rv-SuperHyperReverse Strict Connective. ((Neutrosophic) SuperHyperReverse Strict 1638
Connective). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1639
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1640
SuperHyperReverse Strict Connective if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, 1641
Neutrosophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, 1642
and Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for an Extreme SuperHyper- 1643
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1644
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 1645
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1646
SuperHyperReverse Strict Connective; a Neutrosophic SuperHyperReverse Strict Connective if it’s either of 1647
Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, 1648
Neutrosophic v-SuperHyperReverse Strict Connective, and Neutrosophic rv-SuperHyperReverse Strict 1649
Connective and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1650
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 1651
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1652
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict 1653
Connective; an Extreme SuperHyperReverse Strict Connective SuperHyperPolynomial if it’s either of 1654
Connective and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1657
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1658
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 1659

S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHy- 1660
perVertices such that they form the Extreme SuperHyperReverse Strict Connective; and the Extreme 1661
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Strict Connective 1662
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, Neutro- 1663
sophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, and 1664
Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic SuperHyper- 1665
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1666
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1667
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 1668
dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1669
that they form the Neutrosophic SuperHyperReverse Strict Connective; and the Neutrosophic power is 1670
corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse Strict Connective if it’s 1671

either of Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict 1672

Connective, Neutrosophic v-SuperHyperReverse Strict Connective, and Neutrosophic rv-SuperHyperReverse 1673
Strict Connective and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the max- 1674
imum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 1675
the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHy- 1676
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse 1677
Strict Connective; a Neutrosophic V-SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 1678
SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, Neutrosophic 1679
v-SuperHyperReverse Strict Connective, and Neutrosophic rv-SuperHyperReverse Strict Connective and 1680
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1681
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 1682
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1683
SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict Connective; 1684
an Extreme V-SuperHyperReverse Strict Connective SuperHyperPolynomial if it’s either of Neut- 1685
rosophic e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, 1686
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of 1689
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 1690
HyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 1691
SuperHyperVertices such that they form the Extreme SuperHyperReverse Strict Connective; and the 1692
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Strict 1693
Connective SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, 1694
Neutrosophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connect- 1695
ive, and Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic 1696
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1697
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1698
SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict Connective; and 1701
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1702
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperReverse Strict Connective 1703
and Neutrosophic SuperHyperReverse Strict Connective. Two different types of SuperHyperDefinitions 1704
are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUni- 1705
form, and SuperHyperClass based on that are well-defined and well-reviewed. The literature 1706
Recognition” are the under research to figure out the challenges make sense about ongoing and 1712
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 1717

nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 1718
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1719
research. It’s also officially collected in the form of some questions and some problems. Assume 1720
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Strict Connective 1721
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1722
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1723
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1724
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 1725
S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Strict Connective is a max- 1726
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1727
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1728
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1729
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 1730
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 1731
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperReverse 1732
Strict Connective . Since there’s more ways to get type-results to make a SuperHyperReverse Strict 1733
Connective more understandable. For the sake of having Neutrosophic SuperHyperReverse Strict 1734
Connective, there’s a need to “redefine” the notion of a “SuperHyperReverse Strict Connective ”. The 1735
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1736
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1737
Assume a SuperHyperReverse Strict Connective . It’s redefined a Neutrosophic SuperHyperReverse Strict 1738
Connective if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, 1739
Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 1740
with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, 1741
“The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The 1742
Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum 1743
Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its 1744
Endpoints”. To get structural examples and instances, I’m going to introduce the next SuperHy- 1745
perClass of SuperHyperGraph based on a SuperHyperReverse Strict Connective . It’s the main. It’ll 1746
be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 1747
If there’s a need to have all SuperHyperReverse Strict Connective until the SuperHyperReverse Strict 1748
Connective, then it’s officially called a “SuperHyperReverse Strict Connective” but otherwise, it isn’t a 1749
SuperHyperReverse Strict Connective . There are some instances about the clarifications for the main 1750
definition titled a “SuperHyperReverse Strict Connective ”. These two examples get more scrutiny and 1751
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 1752
on a SuperHyperReverse Strict Connective . For the sake of having a Neutrosophic SuperHyperReverse 1753
Strict Connective, there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperReverse 1754
Strict Connective” and a “Neutrosophic SuperHyperReverse Strict Connective ”. The SuperHyperVertices 1755
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 1756
this procedure, there’s the usage of the position of labels to assign to the values. Assume 1757
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 1758
intended Table holds. And a SuperHyperReverse Strict Connective are redefined to a “Neutrosophic 1759
SuperHyperReverse Strict Connective” if the intended Table holds. It’s useful to define “Neutrosophic” 1760
version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to 1761
make a Neutrosophic SuperHyperReverse Strict Connective more understandable. Assume a Neut- 1762
rosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 1763

Table holds. Thus SuperHyperPath, SuperHyperReverse Strict Connective, SuperHyperStar, Su- 1764
perHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1765
SuperHyperPath”, “Neutrosophic SuperHyperReverse Strict Connective”, “Neutrosophic SuperHy- 1766
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1767
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1768
“Neutrosophic SuperHyperReverse Strict Connective” where it’s the strongest [the maximum Neutro- 1769
sophic value from all the SuperHyperReverse Strict Connective amid the maximum value amid all 1770
SuperHyperVertices from a SuperHyperReverse Strict Connective .] SuperHyperReverse Strict Connective . 1771
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1772
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1773
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1774
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperReverse Strict Connective if it’s 1775
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1781
and the common and intended properties between “specific” cells and “specific group” of cells 1787
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 1788
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 1789
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 1790
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1791
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 1792
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 1793
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 1794
identified since there are some determinacy, indeterminacy and neutrality about the moves 1795
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1796
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1797
and what’s done. There are some specific models, which are well-known and they’ve got the 1798
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1799
cancer on the complex tracks and between complicated groups of cells could be fantasized 1800
by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Strict Connective, SuperHyperStar, Su- 1801
perHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1802
the longest SuperHyperReverse Strict Connective or the strongest SuperHyperReverse Strict Connective 1803
in those Neutrosophic SuperHyperModels. For the longest SuperHyperReverse Strict Connective, 1804
called SuperHyperReverse Strict Connective, and the strongest SuperHyperReverse Strict Connective, called 1805
Neutrosophic SuperHyperReverse Strict Connective, some general results are introduced. Beyond 1806
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but 1807
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 1808
of a SuperHyperReverse Strict Connective. There isn’t any formation of any SuperHyperReverse Strict 1809

Connective but literarily, it’s the deformation of any SuperHyperReverse Strict Connective. It, literarily, 1810
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperReverse Strict 1811
Connective theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1812
Keywords: Extreme SuperHyperGraph, SuperHyperReverse Strict Connective, Cancer’s Extreme 1813
Recognition 1814

CHAPTER 8 1816
Applied Notions Under The Scrutiny Of 1817
The Motivation Of This Scientific 1818
Research 1819
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1820
try to bring the motivations in the narrative ways. Some cells have been faced with some 1821
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1822
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1823
as some groups and some groups or individuals have excessive labels which all are raised from 1824
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1825
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1826
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1827
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1828
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1829
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1830
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1831
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1832
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1833
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1834
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1835
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1836
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1837
disease but the model is going to figure out what’s going on this phenomenon. The special case 1838
of this disease is considered and as the consequences of the model, some parameters are used. 1839
The cells are under attack of this disease but the moves of the cancer in the special region are 1840
the matter of mind. The recognition of the cancer could help to find some treatments for this 1841
disease. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 1842
the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1843
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1844
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 1846
the architecture are formally called “ SuperHyperReverse Strict Connective” in the themes of jargons 1847
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1848
61
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1849
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1850
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1851
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1852
and neutrality about the moves and the effects of the cancer on that region; this event leads 1853
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1854
perception on what’s happened and what’s done. There are some specific models, which 1855
are well-known and they’ve got the names, and some general models. The moves and the 1856
traces of the cancer on the complex tracks and between complicated groups of cells could be 1857
fantasized by an Extreme SuperHyperPath (-/SuperHyperReverse Strict Connective, SuperHyperStar, 1858
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1859
the optimal SuperHyperReverse Strict Connective or the Extreme SuperHyperReverse Strict Connective 1860
in those Extreme SuperHyperModels. Some general results are introduced. Beyond that in 1861
SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1862
deforms and it doesn’t form. 1866
Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find the 1867
“ amount of SuperHyperReverse Strict Connective” of either individual of cells or the groups of cells 1868
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperReverse 1869
Strict Connective” based on the fixed groups of cells or the fixed groups of group of cells? 1870
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1871
messy and dense SuperHyperModels where embedded notions are illustrated? 1872
Thus it motivates us to define different types of “ SuperHyperReverse Strict Connective” and “Extreme 1874
SuperHyperReverse Strict Connective” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1875

Then the research has taken more motivations to define SuperHyperClasses and to find some 1876
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1877
some instances and examples to make clarifications about the framework of this research. The 1878
general results and some results about some connections are some avenues to make key point of 1879
this research, “Cancer’s Recognition”, more understandable and more clear. 1880
The framework of this research is as follows. In the beginning, I introduce basic definitions 1881
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1882
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1883
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1884
review literature are applied to make sense about what’s going to figure out about the upcoming 1885
sections. The main definitions and their clarifications alongside some results about new notions, 1886
SuperHyperReverse Strict Connective and Extreme SuperHyperReverse Strict Connective, are figured out 1887
in sections “ SuperHyperReverse Strict Connective” and “Extreme SuperHyperReverse Strict Connective”. 1888
In the sense of tackling on getting results and in Reverse Strict Connective to make sense about 1889
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1890
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1891
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1892
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1893

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1894
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1895
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations and 1896
as concluding and closing section of theoretical research are contained in the section “General 1897
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1898
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 1899
“ SuperHyperReverse Strict Connective”, “Extreme SuperHyperReverse Strict Connective”, “Results on 1900

SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1901
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1902
and going to figure out the word “best” as the description and adjective for this research as 1903
presented in section, “ SuperHyperReverse Strict Connective”. The keyword of this research debut in 1904
the section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1905
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 1906
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 1907
there are some scrutiny and discernment on what’s done and what’s happened in this research 1908
in the terms of “questions” and “problems” to make sense to figure out this research in featured 1909
style. The advantages and the limitations of this research alongside about what’s done in this 1910
research to make sense and to get sense about what’s figured out are included in the section, 1911
“Conclusion and Closing Remarks”. 1912

CHAPTER 9 1913
Extreme Preliminaries Of This Scientific 1914
Research On the Redeemed Ways 1915
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 1916
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 1917
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 1918

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1919
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1920
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1921
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1922
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1923
ideas and their clarifications are addressed to Ref.[HG38]. 1924

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

Let X be a Reverse Strict Connective 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 [. 1927
Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG11s],Definition 2.2,p.2).

Let X be a Reverse Strict Connective 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}.
65
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.[HG11s],Definition 2.5,p.2). 1928
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1929
where 1930
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1931
(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); 1932
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1933
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1934
1, 2, . . . , n0 ); 1935
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1936
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1937

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1944
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1945
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1946
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. 1947
Thus, the ii0 th element of the Reverse Strict Connective of Neutrosophic SuperHyperGraph 1948
(NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1949

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

(Ref.[HG11s],Definition 2.7,p.3). 1951
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1952
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1953
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1954
(i) If |Vi | = 1, then Vi is called vertex; 1955
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1956
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1957
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1958
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1959
SuperEdge; 1960
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1961
SuperHyperEdge. 1962
If we choose different types of binary operations, then we could get hugely diverse types of 1963
general forms of Neutrosophic SuperHyperGraph (NSHG). 1964
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1965

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1966
x, y, z, w ∈ [0, 1]: 1967
(i) 1 ⊗ x = x; 1968
(ii) x ⊗ y = y ⊗ x; 1969
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1970
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1971

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)). 1972

where 1974

1, 2, . . . , n0 ); 1979
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1980
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1981
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1982
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1983
0


SuperEdge; 2003
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 2006
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 2007
makes the patterns and regularities. 2008
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2009
of elements of SuperHyperEdges are the same. 2010

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2011
makes to have SuperHyperUniform more understandable. 2012
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2013
Classes as follows. 2014
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2015
two given SuperHyperEdges with two exceptions; 2016
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2017
SuperHyperEdges; 2018
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2019
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2020
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2021
in common; 2022
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2023
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2024
SuperHyperEdge in common; 2025
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2026
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2027
SuperVertex. 2028
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 2029
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2030
(i) Vi , Vi+1 ∈ Ei0 ; 2031
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2032
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2033
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2034
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2035
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2036
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2037
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2038
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 2040
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2041
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2042
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2043
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 2044
perPath . 2045
Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG11s],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 2046
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2047
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2048
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2049
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2050
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2051

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2064
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2065
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2066
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Strict 2067

Connective). 2068
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 2070
or E 0 is called 2071
(i) Neutrosophic e-SuperHyperReverse Strict Connective if the following expression is called 2072
Neutrosophic e-SuperHyperReverse Strict Connective criteria holds 2073

(ii) Neutrosophic re-SuperHyperReverse Strict Connective if the following expression is called 2074
Neutrosophic re-SuperHyperReverse Strict Connective criteria holds 2075

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2076
(iii) Neutrosophic v-SuperHyperReverse Strict Connective if the following expression is called 2077
Neutrosophic v-SuperHyperReverse Strict Connective criteria holds 2078


(iv) Neutrosophic rv-SuperHyperReverse Strict Connective if the following expression is called 2079

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2081
(v) Neutrosophic SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 2082

SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, Neut- 2083
rosophic v-SuperHyperReverse Strict Connective, and Neutrosophic rv-SuperHyperReverse Strict 2084
Connective. 2085
Definition 9.0.19. ((Neutrosophic) SuperHyperReverse Strict Connective). 2086

(i) an Extreme SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 2089

Connective and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the max- 2092
imum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2093
of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme Su- 2094
perHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 2095
SuperHyperReverse Strict Connective; 2096
(ii) a Neutrosophic SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 2097

Connective and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 2100
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2101
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2102
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2103
(iii) an Extreme SuperHyperReverse Strict Connective SuperHyperPolynomial if it’s either 2105

of Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse 2106
Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, and Neutrosophic rv- 2107
SuperHyperReverse Strict Connective and C(N SHG) for an Extreme SuperHyperGraph 2108
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2109
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2110
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 2111
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2112
Extreme SuperHyperReverse Strict Connective; and the Extreme power is corresponded to its 2113
Extreme coefficient; 2114

(iv) a Neutrosophic SuperHyperReverse Strict Connective SuperHyperPolynomial 2115

if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re- 2116
SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, and 2117
Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic Supe- 2118
rHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 2119
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 2120
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 2121

S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 2122
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse 2123
Strict Connective; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 2124
(v) an Extreme V-SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 2125

of the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 2130

SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 2131
(vi) a Neutrosophic V-SuperHyperReverse Strict Connective if it’s either of Neutrosophic 2133

e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, Neut- 2134
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2137
(vii) an Extreme V-SuperHyperReverse Strict Connective SuperHyperPolynomial if 2141
it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re- 2142

Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for an Extreme SuperHy- 2144
perGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 2145
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 2146
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2147
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2148
form the Extreme SuperHyperReverse Strict Connective; and the Extreme power is corresponded 2149
to its Extreme coefficient; 2150
(viii) a Neutrosophic SuperHyperReverse Strict Connective SuperHyperPolynomial 2151

Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic Su- 2154
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 2155
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 2156
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2157

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

SuperHyperReverse Strict Connective; and the Neutrosophic power is corresponded to its 2160
Neutrosophic coefficient. 2161
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Strict Connective). 2162

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2163
(i) an δ−SuperHyperReverse Strict Connective is a Neutrosophic kind of Neutrosophic 2164

SuperHyperReverse Strict Connective such that either of the following expressions hold for 2165
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2166
|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 2167
(29.1), holds if S is an δ−SuperHyperDefensive; 2168
(ii) a Neutrosophic δ−SuperHyperReverse Strict Connective is a Neutrosophic kind of 2169

Neutrosophic SuperHyperReverse Strict Connective such that either of the following Neutrosophic 2170
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2171
|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 2172

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2173
For the sake of having a Neutrosophic SuperHyperReverse Strict Connective, there’s a need to 2174
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2175
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 2176
there’s the usage of the position of labels to assign to the values. 2177
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2178
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2179
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2180
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2181

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

136TBL4

136TBL1
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 2182

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2183
Thus Neutrosophic SuperHyperPath , SuperHyperReverse Strict Connective, SuperHyperStar, 2184
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2185
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2186

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2187
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2188
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Strict 2189

Connective. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 2190
Strict Connective more Neutrosophicly understandable. 2191
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Strict Connective”. The 2193
2196
136DEF1 Definition 9.0.23. Assume a SuperHyperReverse Strict Connective. It’s redefined a Neutrosophic 2197
SuperHyperReverse Strict Connective if the Table (29.3) holds. 2198

CHAPTER 10 2199
Extreme SuperHyper But As The Reverse Strict Connective 2200
Extensions Excerpt From Dense And 2201
Super Forms 2202
Definition 10.0.1. (Extreme event). 2203
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2204
a probability Reverse Strict Connective. Any Extreme k-subset of A of V is called Extreme k-event 2205
and if k = 2, then Extreme subset of A of V is called Extreme event. The following expression 2206
is called Extreme probability of A. 2207
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2208

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2209
is a probability Reverse Strict Connective. s Extreme k-events Ai , i ∈ I is called Extreme s- 2210

independent if the following expression is called Extreme s-independent criteria 2211
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 2212
following expression is called Extreme independent criteria 2213
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2214

a probability Reverse Strict Connective. Any k-function Reverse Strict Connective like E is called Extreme 2216
k-Variable. If k = 2, then any 2-function Reverse Strict Connective like E is called Extreme 2217
Variable. 2218
The notion of independent on Extreme Variable is likewise. 2219
Definition 10.0.4. (Extreme Expectation). 2220
77
a probability Reverse Strict Connective. an Extreme k-Variable E has a number is called Extreme 2222
Expectation if the following expression is called Extreme Expectation criteria 2223
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2224

is a probability Reverse Strict Connective. an Extreme number is called Extreme Crossing if the 2226
following expression is called Extreme Crossing criteria 2227
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 2228
S = (V, E) is a probability Reverse Strict Connective. Let m and n propose special Reverse Strict Connective. 2229
Then with m ≥ 4n, 2230
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 Reverse Strict Connective 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: 2231
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2232
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2233
Consider S = (V, E) is a probability Reverse Strict Connective. Let P be a SuperHyperSet of n points 2234
in the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through 2235
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2236
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2237

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

in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2245
k < 5n4/3 . 2246
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2247
S = (V, E) is a probability Reverse Strict Connective. Draw a SuperHyperUnit SuperHyperCircle 2248
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2249
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2250
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2251

SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on the 2252
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2253
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 2254
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2255

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2256
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2257
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2258
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2259
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2260
Consider S = (V, E) is a probability Reverse Strict Connective. Let X be a nonnegative Extreme 2261
Variable and t a positive real number. Then 2262
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. 2263
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2264
Consider S = (V, E) is a probability Reverse Strict Connective. Let Xn be a nonnegative integer-valued 2265
variable in a probability Reverse Strict Connective (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 2266
P (Xn = 0) → 1 as n → ∞. 2267
Proof. 2268
Consider S = (V, E) is a probability Reverse Strict Connective. A special SuperHyperGraph in Gn,p 2270
almost surely has stability number at most d2p−1 log ne. 2271

S = (V, E) is a probability Reverse Strict Connective. A special SuperHyperGraph in Gn,p is up. 2273
Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where 2274
k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2275
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2276
SuperHyperEdge of the Extreme SuperHyperGraph G. 2277
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2278
Extreme Variable for this Extreme Event. By equation, we have 2279
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 2280
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2281
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: 2282
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2283
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 2284
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2285
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2286
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2287
Definition 10.0.12. (Extreme Variance). 2288

a probability Reverse Strict Connective. an Extreme k-Variable E has a number is called Extreme 2290
Variance if the following expression is called Extreme Variance criteria 2291
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Reverse Strict Connective. Let X be an Extreme Variable and let 2293
t be a positive real number. Then 2294
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Reverse Strict Connective. Let X be an Extreme Variable and let t be a 2296
positive real number. Then 2297
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2298
Consider S = (V, E) is a probability Reverse Strict Connective. Let Xn be an Extreme Variable in a 2300
probability Reverse Strict Connective (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2301
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Strict Connective. Set X := Xn and t := |Ex(Xn )| in 2303
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2304
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2305
Consider S = (V, E) is a probability Reverse Strict Connective. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2307
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2308
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2309
S = (V, E) is a probability Reverse Strict Connective. As in the proof of related Theorem, the result 2311
is straightforward. 2312
Consider S = (V, E) is a probability Reverse Strict Connective. Let G ∈ Gn,1/2 and let f and k ∗ be as 2314
defined in previous Theorem. Then either: 2315
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2316
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2317
S = (V, E) is a probability Reverse Strict Connective. The latter is straightforward. 2319
Definition 10.0.17. (Extreme Threshold). 2320
a probability Reverse Strict Connective. Let P be a monotone property of SuperHyperGraphs (one 2322
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2323
a function f (n) such that: 2324
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2325
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2326

Definition 10.0.18. (Extreme Balanced). 2327

is a probability Reverse Strict Connective. Let F be a fixed Extreme SuperHyperGraph. Then 2329
there is a threshold function for the property of containing a copy of F as an Extreme 2330
SubSuperHyperGraph is called Extreme Balanced. 2331
Consider S = (V, E) is a probability Reverse Strict Connective. Let F be a nonempty balanced Extreme 2333
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2334
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2335
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2338
the mentioned Extreme Figures in every Extreme items. 2339
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperReverse 2340
Strict Connective, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are 2341
some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2342
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2343
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2344
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2345
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2346
Extreme SuperHyperReverse Strict Connective. 2347
C(N SHG)Extreme Reverse Strict Connective =

{}.
C(N SHG)Extreme Reverse Strict Connective SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Reverse Strict Connective =
{}.
C(N SHG)Extreme V-Reverse Strict Connective SuperHyperPolynomial
= 0z 0 .
2348
Strict Connective, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 2350
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus 2351
in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 2352
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 2353
no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2354
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperReverse Strict Connective. 2355

{}.

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperReverse Strict Connective in the Extreme Example (42.0.3) 136NSHG1

= 0z 0 .
{}.
= 0z 0 .
2356
Strict Connective, is up. The Extreme Algorithm is Extremely straightforward. 2358

{}.
= 0z 0 .
{}.
= 0z 0 .
2359



{}.
= 0z 0 .
{}.
= 0z 0 .
2362

{E2 }.
= z 6−c .
{V5 }.

= z 7−c .
2365

{Ei }22
i=12 .
= z 3−a .
{Vi , V21 }10
i=1 .
= z 3−a .
2368

{E15 , E16 , E17 }.

= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
2371

{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.

= z 3−a .
2374

{E3i+1 , E23 }3i=0 .
= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
2377
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHy- 2378
perReverse Strict Connective, is up. The Extreme Algorithm is Extremely straightforward. 2379

{E1 , E2 , E3 }.



= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
2380

{E1 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
2383


{E1 }.
= z 5−a .
{V1 , V2 , V3 , V7 , V8 }.
= z 5−a .
2386

{E9 , E3 }.
= z 3−a .


{V1 , V6 }.
= z 5−a .
2389

{E2 }.
= z 3−a .
{V1 }.
= z 5−a .
2392


{E3i+1 }1i=0 .
= z 3−a .
{V3i+1 }1i=0 .
= z 3−a .
2395

{E3i+1 }1i=0 .
= z 2−a .


{V2 , V17 , V7 }.
= z 2−a .
2398

{E3i+1 }1i=0 .
= z 2−a .


{V2 , V17 , V7 , V27 }.

= z 2−a .
2401

{E3i+2 }1i=0 .
= z 2−a .
{V2 , V17 , V7 , V27 }.
= z 2−a .
2404


{E3i+1 }3i=0 .
= z 2−a .
{V2i+1 }5i=0 .
= z 2−a .
2407

{E6 }.
= z 4−a .


{V1 }.
= z 6−a .
2410

{E2 }.
= z |1−a| .
{V1 }.
= z |5−a| .
2413


{E2i+3 }1i=0 .
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .
2416
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2417
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Reverse Strict Connective if for 2418
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2419
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2420

all minus all Extreme SuperHypeNeighbors to any amount of them. 2421

SuperHyperReverse Strict Connective in the Extreme Example (42.0.3) 95NHG1
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2422

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2423
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2424
quasi-R-Reverse Strict Connective minus all Extreme SuperHypeNeighbor to some of them but not all 2425
of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2426
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Reverse Strict Connective, minus 2427
all Extreme SuperHypeNeighbor to some of them but not all of them. 2428
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-Reverse Strict Connective is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Strict Connective is at least 2429
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2430
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2431

SuperHyperReverse Strict Connective in the Extreme Example (42.0.3) 95NHG2
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2432
SuperHyperVertices are renamed to Extreme Reverse Strict Connective in some cases but the maximum 2433
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2434
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R-Reverse 2435
Strict Connective. 2436
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Reverse Strict Connective 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-Reverse Strict Connective with the least Extreme cardinality, the 2437
lower sharp Extreme bound for cardinality. 2438
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2439
Then in the worst case, literally, 2440
C(N SHG)ExtremeQuasi−ReverseStrictConnective
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ReverseStrictConnectiveSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ReverseStrictConnective = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ReverseStrictConnectiveSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Reverse Strict Connective. In other words, the least cardinality, the lower 2441
sharp bound for the cardinality, of an Extreme type-result-Reverse Strict Connective is the cardinality 2442
of 2443
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ReverseStrictConnectiveSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ReverseStrictConnective = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ReverseStrictConnectiveSuperHyperP 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-Reverse Strict Connective
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-Reverse Strict Connective. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Reverse Strict Connective 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-Reverse Strict Connective. 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-Reverse Strict Connective decorates the Extreme SuperHyper-
Vertices 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-Reverse Strict Connective. 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-Reverse Strict Connective has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Reverse Strict Connective has the Extreme cardinality at
least an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This
Extreme SuperHyperSet isn’t an Extreme R-Reverse Strict Connective since either the Extreme Supe-
rHyperGraph 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-Reverse Strict Connective” 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-Reverse Strict Connective 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-Reverse Strict Connective 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-Reverse Strict Connective. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Reverse Strict Connective. 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-Reverse Strict Connective is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Reverse Strict Connective but
with slightly differences in the maximum Extreme cardinality amid those Extreme type-
SuperHyperSets of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the
Extreme SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

z
and
is formalized with mathematical literatures on the Extreme R-Reverse Strict Connective. Let
E
Zi ∼ Zj , be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the Extreme
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 2444
Extreme R-Reverse Strict Connective =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2445
Extreme R-Reverse Strict Connective =


Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Reverse Strict Connective where E ∈ EESHG:(V,E) is

fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in
an Extreme Reverse Strict Connective, 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-Reverse Strict Connective is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Strict Connective is at least 2446
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2447
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2448
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2449
SuperHyperVertices are renamed to Extreme Reverse Strict Connective in some cases but the maximum 2450
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2451
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R-Reverse 2452

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2454
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2455
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2456
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2457
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2458
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2459
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2460
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2461
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2462
Thus it forms an Extreme quasi-R-Reverse Strict Connective where the Extreme completion of the 2463
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Reverse Strict 2464
Connective. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2465

coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2466
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2467
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2468
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2469
included in the minimum Extreme style of the embedded Extreme R-Reverse Strict Connective. The 2470
interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2471
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2472
common connections, more precise and more formal, the perfect unique connections inside 2473
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2474
Extreme R-Reverse Strict Connective. Thus Extreme exterior SuperHyperVertices could be used 2475
only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2476
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2477

Reverse Strict Connective, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2478
more connections inside more than outside. Thus the title “exterior” is more relevant than 2479
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2480
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2481
has been ignored in the exploring to lead on the optimal case implying the Extreme R-Reverse 2482
Strict Connective. The Extreme R-Reverse Strict Connective with the exclusion of the exclusion of all 2483

Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2484
Extreme R-Reverse Strict Connective with the inclusion of all Extreme SuperHyperVertices in one 2485
Extreme SuperHyperEdge, is an Extreme quasi-R-Reverse Strict Connective. To sum them up, 2486
in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2487
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2488
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Reverse Strict Connective 2489
minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 2490
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2491
Extreme SuperHyperVertices in an Extreme quasi-R-Reverse Strict Connective, minus all Extreme 2492
SuperHypeNeighbor to some of them but not all of them. 2493
The main definition of the Extreme R-Reverse Strict Connective has two titles. an Extreme quasi-R- 2494
Reverse Strict Connective and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2495
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2496
quasi-R-Reverse Strict Connective with that quasi-maximum Extreme SuperHyperCardinality in 2497
the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2498
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection 2499
of all the Extreme quasi-R-Reverse Strict Connectives for all Extreme numbers less than its Extreme 2500
corresponded maximum number. The essence of the Extreme Reverse Strict Connective ends up but 2501
this essence starts up in the terms of the Extreme quasi-R-Reverse Strict Connective, again and more 2502
in the operations of collecting all the Extreme quasi-R-Reverse Strict Connectives acted on the all 2503
possible used formations of the Extreme SuperHyperGraph to achieve one Extreme number. 2504
This Extreme number is 2505
considered as the equivalence class for all corresponded quasi-R-Reverse Strict Connectives. Let 2506
zExtreme Number , SExtreme SuperHyperSet and GExtreme Reverse Strict Connective be an Extreme number, 2507
an Extreme SuperHyperSet and an Extreme Reverse Strict Connective. Then 2508
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Reverse Strict Connective ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Reverse Strict Connective is re-formalized 2509
and redefined as follows. 2510
GExtreme Reverse Strict Connective ∈ ∪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 2511

definition for the Extreme Reverse Strict Connective . 2512
GExtreme Reverse Strict Connective =

{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 Reverse Strict 2513
poses the upcoming expressions.
Connective 2514

{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2515

= max zExtreme Number
[zExtreme
Number ]Extreme Class

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


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


2518

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

2519


2520


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2521
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2522
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2523
perEdge. It’s, literarily, another name for “Extreme Quasi-Reverse Strict Connective” but, precisely, 2524
it’s the generalization of “Extreme Quasi-Reverse Strict Connective” since “Extreme Quasi-Reverse 2525
Strict Connective” happens “Extreme Reverse Strict Connective” in an Extreme SuperHyperGraph as 2526
initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2527
“Extreme Reverse Strict Connective” in an Extreme SuperHyperGraph as initial framework and prelim- 2528
inarily background since there are some ambiguities about the Extreme SuperHyperCardinality 2529
arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Ex- 2530
treme Quasi-Reverse Strict Connective”, and “Extreme Reverse Strict Connective” are up. 2531
Thus, let 2532

zExtreme Number , NExtreme SuperHyperNeighborhood and 2533
GExtreme Reverse Strict Connective be an Extreme number, an Extreme SuperHyperNeighborhood 2534
and an Extreme Reverse Strict Connective and the new terms are up. 2535
GExtreme Reverse Strict Connective ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality


{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2536

∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2537

And with go back to initial structure, 2538
GExtreme Reverse Strict Connective ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

2539

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

2540


2541


Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior Extreme
SuperHyperVertices belong to any Extreme quasi-R-Reverse Strict Connective if for any of them, and
any of other corresponded Extreme SuperHyperVertex, some interior Extreme SuperHyperVer-
tices 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-Reverse Strict Connective.
The Extreme SuperHyperSet of Extreme SuperHyperVertices,

Is the simple Extreme type-SuperHyperSet of the Extreme R-Reverse Strict Connective. The Extreme
SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Reverse Strict Connective 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 Reverse Strict Connective is related to the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Reverse Strict Connective is up. The obvious simple Extreme

type-SuperHyperSet called the Extreme Reverse Strict Connective 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-Reverse Strict Connective is up. To sum them up,
the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Reverse Strict Connective.
Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Reverse Strict Connective 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 Reverse Strict Connective and it’s an Extreme
Reverse Strict Connective. 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
Reverse Strict Connective. There isn’t only less than two Extreme SuperHyperVertices inside the
intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Reverse Strict Connective,

is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Reverse Strict Connective,
not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2542
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2543
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2544
the 2545

“Extreme R-Reverse Strict Connective” 2546
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2547
Extreme R-Reverse Strict Connective, 2548
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-Reverse Strict Connective amid those obvious simple Extreme type-SuperHyperSets of the
Extreme Reverse Strict Connective, 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-Reverse Strict Connective. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Reverse Strict Connective is the cardinality of
2549
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2550
Extreme SuperHyperVertices belong to any Extreme quasi-R-Reverse Strict Connective if for any 2551
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2552
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2553
all minus all Extreme SuperHypeNeighbors to any amount of them. 2554
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2555
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2556
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2557
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given Ex- 2558
treme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme R-Reverse 2559
Strict Connective with the least cardinality, the lower sharp Extreme bound for Extreme cardinality. 2560
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme SuperHyperSet 2561
of the Extreme SuperHyperVertices VESHE \{z} is an Extreme SuperHyperSet S of the Extreme 2562
SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some Extreme 2563
SuperHyperVertices uniquely but it isn’t an Extreme R-Reverse Strict Connective. Since it doesn’t have 2564
2565
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2566
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2567

uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2568
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2569
but it isn’t an Extreme R-Reverse Strict Connective. Since it doesn’t do the Extreme procedure such 2570
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2571
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2572
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2573
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2574
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2575
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of 2576
Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Reverse Strict Connective, VESHE 2577
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Reverse Strict Connective, 2578
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2579
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2580
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2581
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2582
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2583
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2584
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Reverse Strict Connective only contains 2585
all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2586
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2587
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2588
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2589
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2590
The SuperHyperNotion, namely, Reverse Strict Connective, is up. There’s neither empty SuperHy- 2591
perEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2592
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Reverse 2593
Strict Connective. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2594
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−ReverseStrictConnectiveSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−ReverseStrictConnective = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−ReverseStrictConnectiveSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Reverse Strict Connective. The Extreme 2595
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2596
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.


= az s + bz t .
Is an Extreme Reverse Strict Connective C(ESHG) for an Extreme SuperHyperGraph ESHG : 2597
(V, E) is an Extreme type-SuperHyperSet with 2598
2599
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2600
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2601
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2602
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2603
Extreme SuperHyperSet. Thus the non-obvious Extreme Reverse Strict Connective is up. The 2604
obvious simple Extreme type-SuperHyperSet called the Extreme Reverse Strict Connective is an 2605
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2606
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2607
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 SuperHyper- 2608
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Reverse Strict 2609
Connective is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2610
perEdges[SuperHyperVertices], 2611
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 Reverse Strict Connective. 2612
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2613
b c
= {E2i−1 }i=1 2
.


= 2z b 2 c
.
= az s + bz t .
Is an Extreme Reverse Strict Connective C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2614
is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no 2615
an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2616
treme type-SuperHyperSet called the Extreme Reverse Strict Connective and it’s an Extreme 2617
Reverse Strict Connective. Since it’s 2618
2619
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2620
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2621
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2622
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2623
intended Extreme SuperHyperSet, 2624
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Reverse Strict Connective , 2625
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 ,

Reverse Strict Connective 2626
not: 2627
b c
= {E2i−1 }i=1 2
.


= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2628
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 2629
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2630
SuperHyperSet called the 2631
“Extreme Reverse Strict Connective ” 2632
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2633
Extreme Reverse Strict Connective, 2634
is only and only 2635
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2636

CHAPTER 11 2637
The Extreme Departures on The 2638
Theoretical Results Toward Theoretical 2639
Motivations 2640
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2641
SuperHyperClasses. 2642
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2643

|E |
{E3i+2 }i=0ESHP .
| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
{V EXT ERN AL } ESHP
=z 2i+2 i=0 .
Proof. Let 2644
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2645
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
119
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHy-

perReverse Strict Connective in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2646
new way to redefine as 2647
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 2648
ViEXT ERN AL in the literatures of SuperHyperReverse Strict Connective. The latter is straightforward. 2649
2650
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2651
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2652
(31.1), is the SuperHyperReverse Strict Connective. 2653
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2654

|E |
{E3i+2 }i=0ESHP .


| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
=z 2i+2 i=0 .
Proof. Let 2655
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2656
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 2657

2661
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2662
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2663
SuperHyperModel (31.2), is the Extreme SuperHyperReverse Strict Connective. 2664

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

SuperHyperReverse Strict Connective in the Extreme Example (42.0.7) 136NSHG19a
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2665

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 2666
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2667
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

SuperHyperReverse Strict Connective in the Extreme Example (42.0.9) 136NSHG20a
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2668
way to redefine as 2669

2672
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2673
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2674
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2675
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperReverse 2676
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2678

|P min |
{E3i+2 }i=0
ESHP
.


| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
| min |P min | |Vi |
=z 2i+2 i=0 .
Proof. Let 2679
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
2680
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 2681
a new way to redefine as 2682

Then there’s no at least one SuperHyperReverse Strict Connective. Thus the notion of quasi may be up 2685
but the SuperHyperNotions based on SuperHyperReverse Strict Connective could be applied. There 2686
are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 2687
as the representative in the 2688
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperReverse Strict Connective taken from a connected Extreme SuperHyperBi- 2689
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2690
SuperHyperPart SuperHyperEdges are attained in any solution 2691
P :

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

Extreme SuperHyperReverse Strict Connective in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2692
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2693
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2694
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2695
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2696
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperReverse Strict Connective. 2697
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2698
Then 2699

|P min |
{E3i+2 }i=0
ESHP
.
| min |EESHP | |Ei |
{P min }
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.

=z 2i+2 i=0 .
Proof. Let 2700
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2701
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperReverse Strict Connective taken from a connected Extreme SuperHyperMulti- 2702
partite ESHM : (V, E). There’s a new way to redefine as 2703

are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 2708
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2710

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2711
SuperHyperEdges are attained in any solution 2712
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2713

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

SuperHyperReverse Strict Connective in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2715
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2716
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2717
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2718
the Extreme SuperHyperReverse Strict Connective. 2719
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2720

Then, 2721

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 2722
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

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

Extreme SuperHyperReverse Strict Connective in the Extreme Example (42.0.15) 136NSHG23a
2723
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperReverse Strict Connective taken from a connected Extreme SuperHyperWheel 2724
ESHW : (V, E). There’s a new way to redefine as 2725

Then there’s at least one SuperHyperReverse Strict Connective. Thus the notion of quasi isn’t up 2728
and the SuperHyperNotions based on SuperHyperReverse Strict Connective could be applied. The 2729
unique embedded SuperHyperReverse Strict Connective proposes some longest SuperHyperReverse Strict 2730
Connective excerpt from some representatives. The latter is straightforward. 2731
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2732
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2733
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2734
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2735
Extreme SuperHyperReverse Strict Connective. 2736

CHAPTER 12 2737
The Surveys of Mathematical Sets On 2738
The Results But As The Initial Motivation 2739
For the SuperHyperReverse Strict Connective, Extreme SuperHyperReverse Strict Connective, and the 2740
Extreme SuperHyperReverse Strict Connective, some general results are introduced. 2741
Remark 12.0.1. Let remind that the Extreme SuperHyperReverse Strict Connective is “redefined” on 2742
the positions of the alphabets. 2743
Corollary 12.0.2. Assume Extreme SuperHyperReverse Strict Connective. Then 2744
Extreme SuperHyperReverseStrictConnective =
{theSuperHyperReverseStrictConnectiveof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseStrictConnective
|ExtremecardinalityamidthoseSuperHyperReverseStrictConnective. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2745
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2746
and the neutrality, for i = 1, 2, 3, respectively. 2747
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2748
alphabet. Then the notion of Extreme SuperHyperReverse Strict Connective and SuperHyperReverse Strict 2749
Connective coincide. 2750
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperReverse 2752
Strict Connective if and only if it’s a SuperHyperReverse Strict Connective. 2753
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 2755
Strict Connective if and only if it’s a longest SuperHyperReverse Strict Connective. 2756
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2757
identical letter of the alphabet. Then its Extreme SuperHyperReverse Strict Connective is its 2758
SuperHyperReverse Strict Connective and reversely. 2759
129
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Strict Connective, Su- 2760

perHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2761
identical letter of the alphabet. Then its Extreme SuperHyperReverse Strict Connective is its SuperHy- 2762
perReverse Strict Connective and reversely. 2763
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2764
isn’t well-defined if and only if its SuperHyperReverse Strict Connective isn’t well-defined.
Strict Connective 2765
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2766
Extreme SuperHyperReverse Strict Connective isn’t well-defined if and only if its SuperHyperReverse 2767
Strict Connective isn’t well-defined. 2768
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Strict Connective, 2769

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2770
Extreme SuperHyperReverse Strict Connective isn’t well-defined if and only if its SuperHyperReverse Strict 2771
Connective isn’t well-defined. 2772
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2773
is well-defined if and only if its SuperHyperReverse Strict Connective is well-defined.
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2775

Extreme SuperHyperReverse Strict Connective is well-defined if and only if its SuperHyperReverse Strict 2776
Connective is well-defined. 2777
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Strict Connective, 2778

Extreme SuperHyperReverse Strict Connective is well-defined if and only if its SuperHyperReverse Strict 2780
Connective is well-defined. 2781
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2782
(i) : the dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2783
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2784
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2785
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2786
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2787
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Strict Connective. 2788
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2789
(i) : the SuperHyperDefensive SuperHyperReverse Strict Connective; 2790
(ii) : the strong SuperHyperDefensive SuperHyperReverse Strict Connective; 2791
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Strict Connective; 2792
(iv) : the δ-SuperHyperDefensive SuperHyperReverse Strict Connective; 2793
(v) : the strong δ-SuperHyperDefensive SuperHyperReverse Strict Connective; 2794

(vi) : the connected δ-SuperHyperDefensive SuperHyperReverse Strict Connective. 2795
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2796

independent SuperHyperSet is 2797
(iii) : the connected SuperHyperDefensive SuperHyperReverse Strict Connective; 2800
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2804

which is a SuperHyperReverse Strict Connective/SuperHyperPath. Then V is a maximal 2805
(i) : SuperHyperDefensive SuperHyperReverse Strict Connective; 2806
(ii) : strong SuperHyperDefensive SuperHyperReverse Strict Connective; 2807
(iii) : connected SuperHyperDefensive SuperHyperReverse Strict Connective; 2808
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Connective; 2809
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Connective; 2810
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Connective; 2811
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2812
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2813

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2814
(i) : dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2815
(ii) : strong dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2816
(iii) : connected dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2817
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2818
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2819
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2820

which is a SuperHyperReverse Strict Connective/SuperHyperPath. Then the number of 2823
(i) : the SuperHyperReverse Strict Connective; 2824

(ii) : the SuperHyperReverse Strict Connective; 2825
(iii) : the connected SuperHyperReverse Strict Connective; 2826
(iv) : the O(ESHG)-SuperHyperReverse Strict Connective; 2827
(v) : the strong O(ESHG)-SuperHyperReverse Strict Connective; 2828
(vi) : the connected O(ESHG)-SuperHyperReverse Strict Connective. 2829
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2830
coincide. 2831

which is a SuperHyperWheel. Then the number of 2833
(i) : the dual SuperHyperReverse Strict Connective; 2834
(ii) : the dual SuperHyperReverse Strict Connective; 2835
(iii) : the dual connected SuperHyperReverse Strict Connective; 2836
(iv) : the dual O(ESHG)-SuperHyperReverse Strict Connective; 2837
(v) : the strong dual O(ESHG)-SuperHyperReverse Strict Connective; 2838
(vi) : the connected dual O(ESHG)-SuperHyperReverse Strict Connective. 2839
coincide. 2841
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2843

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2844
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2845
is a 2846
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2850
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2851
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperReverse Strict Connective. 2852

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2855
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2856
SuperHyperPart is a 2857

(iv) : δ-SuperHyperDefensive SuperHyperReverse Strict Connective; 2861
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Strict Connective; 2862
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Strict Connective. 2863

SuperHyperMultipartite. Then Then the number of 2866
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2873
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2874
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2876
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2877
(iv) : SuperHyperReverse Strict Connective; 2881
(v) : strong 1-SuperHyperDefensive SuperHyperReverse Strict Connective; 2882
(vi) : connected 1-SuperHyperDefensive SuperHyperReverse Strict Connective. 2883
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2884
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2885
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2886
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2887

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2888
t>
2

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperReverse Strict Connective; 2892
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperReverse Strict Connective. 2894
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2895
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2896
dual 2897
(iv) : 0-SuperHyperDefensive SuperHyperReverse Strict Connective; 2901
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2904
perComplete. Then there’s no independent SuperHyperSet. 2905
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2906
perReverse Strict Connective/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2907
and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2908
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Connective; 2912
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Connective; 2913
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Connective. 2914
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2915
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2916
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2917
t>
2
setting of a dual 2918



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2925
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2926
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2927
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2928
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2929
SuperHyperDefensive SuperHyperReverse Strict Connective, then ∀v ∈ V \ S, ∃x ∈ S such that 2930
(i) v ∈ Ns (x); 2931
(ii) vx ∈ E. 2932
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2933
SuperHyperDefensive SuperHyperReverse Strict Connective, then 2934
(i) S is SuperHyperReverse Strict Connective set; 2935
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2936
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2937
(i) Γ ≤ O; 2938
(ii) Γs ≤ On . 2939
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2940
connected. Then 2941
(i) Γ ≤ O − 1; 2942
(ii) Γs ≤ On − Σ3i=1 σi (x). 2943
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2944
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperReverse 2945

Strict Connective; 2946
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2947
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2948
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2949
SuperHyperReverse Strict Connective. 2950

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2951
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Strict Connective; 2952
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2953
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2954
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2955
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Strict Connective. Then 2957
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 2958

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2960
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2961
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2962
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse Strict Connective. Then 2964

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2968
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2969
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2971
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Strict Connective; 2972
(ii) Γ = 1; 2973
(iii) Γs = Σ3i=1 σi (c); 2974
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Strict Connective. 2975
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2976
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2977
SuperHyperDefensive SuperHyperReverse Strict Connective; 2978
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2979
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2980
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2981
SuperHyperDefensive SuperHyperReverse Strict Connective. 2982
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2983
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperReverse Strict 2984
Connective; 2985
(ii) Γ = b n2 c + 1; 2986
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2987
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperReverse 2988
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2990
bnc
2
Connective; 2992
(ii) Γ = b n2 c; 2993

bnc ; 2994
S={vi }i=1
bnc
is only a dual maximal SuperHyperDefensive SuperHy- 2995
perReverse Strict Connective. 2996
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2997

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2998
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperReverse 2999

Strict Connective for N SHF; 3000
(ii) Γ = m for N SHF : (V, E); 3001
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3002
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse Strict 3003
Connective for N SHF : (V, E). 3004
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 3005
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3006
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive SuperHy- 3007
perReverse Strict Connective for N SHF; 3008
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 3009

b n c+1 for N SHF : (V, E); 3010
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperReverse Strict Connective 3011
for N SHF : (V, E). 3012
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 3013

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3014
bnc
Connective for N SHF : (V, E); 3016
(ii) Γ = b n2 c for N SHF : (V, E); 3017

bnc for N SHF : (V, E); 3018
S={vi }i=1
bnc
2
are only dual maximal SuperHyperReverse Strict Connective for 3019
N SHF : (V, E). 3020
following statements hold; 3022
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3023

SuperHyperReverse Strict Connective, then S is an s-SuperHyperDefensive SuperHyperReverse Strict 3024
Connective; 3025
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 3026

SuperHyperReverse Strict Connective, then S is a dual s-SuperHyperDefensive SuperHyperReverse 3027
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3031

SuperHyperReverse Strict Connective, then S is an s-SuperHyperPowerful SuperHyperReverse Strict 3032
Connective; 3033
SuperHyperReverse Strict Connective, then S is a dual s-SuperHyperPowerful SuperHyperReverse 3035

Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 3037

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

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

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

(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3051
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 3053

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


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

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


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

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

SuperHyperGraph which is SuperHyperReverse Strict Connective. Then following statements hold; 3078
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperReverse 3079

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3081

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

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


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

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

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

CHAPTER 13 3097
Extreme Applications in Cancer’s 3098
Extreme Recognition 3099
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3100
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3101
as the consequences of the model, some parameters are used. The cells are under attack of this 3102
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3103
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3104
In the following, some Extreme steps are Extreme devised on this disease. 3105
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3106
function. 3107
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3108
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3109
effects of the cancer on that region; this event leads us to choose another model [it’s said 3112
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3113
what’s done. 3114
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3115
they’ve got the names, and some general Extreme models. The moves and the Extreme 3116
traces of the cancer on the complex tracks and between complicated groups of cells 3117
could be fantasized by an Extreme SuperHyperPath(-/SuperHyperReverse Strict Connective, 3118
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 3119
The aim is to find either the Extreme SuperHyperReverse Strict Connective or the Extreme 3120
SuperHyperReverse Strict Connective in those Extreme Extreme SuperHyperModels. 3121
141
CHAPTER 14 3122
Case 1: The Initial Extreme Steps 3123
Toward Extreme SuperHyperBipartite 3124
as Extreme SuperHyperModel 3125
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3126
is Extreme highlighted and Extreme featured. 3127
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3128
partite is obtained. 3129
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3130
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperReverse Strict Connective 136NSHGaa21aa
143
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHy- 3132

CHAPTER 15 3134
Case 2: The Increasing Extreme Steps 3135
Toward Extreme 3136
SuperHyperMultipartite as Extreme 3137
SuperHyperModel 3138
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3139
ite is Extreme highlighted and Extreme featured. 3140
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3141
partite is obtained. 3142
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3143
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

145
Belong to The Extreme SuperHyperMultipartite

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

ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHy- 3145

CHAPTER 16 3147
Wondering Open Problems But As The 3148
Directions To Forming The Motivations 3149
In what follows, some “problems” and some “questions” are proposed. 3150
The SuperHyperReverse Strict Connective and the Extreme SuperHyperReverse Strict Connective are defined 3151
on a real-world application, titled “Cancer’s Recognitions”. 3152
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3153
recognitions? 3154
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperReverse Strict Connective 3155
and the Extreme SuperHyperReverse Strict Connective? 3156
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3157
them? 3158
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperReverse Strict 3159
and the Extreme SuperHyperReverse Strict Connective?
Connective 3160
Problem 16.0.5. The SuperHyperReverse Strict Connective and the Extreme SuperHyperReverse Strict Con- 3161
nective do a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperReverse 3162
Strict Connective, are there else? 3163
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3164
Numbers types-results? 3165
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3166
the multiple types of SuperHyperNotions? 3167
147
CHAPTER 17 3168
Conclusion and Closing Remarks 3169
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3170
research are illustrated. Some benefits and some advantages of this research are highlighted. 3171
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3172
In this endeavor, two SuperHyperNotions are defined on the SuperHyperReverse Strict Connective. 3173
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph 3174
is redefined on the position of the alphabets. Based on the new definition for the Extreme 3175
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperReverse Strict Connective, finds 3176
the convenient background to implement some results based on that. Some SuperHyperClasses 3177
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the regions 3178
where are under the attacks of the cancer to recognize this disease as it’s mentioned on the title 3179
“Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, SuperHyperReverse 3180
Strict Connective, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general 3181
results are gathered in the section on the SuperHyperReverse Strict Connective and the Extreme 3182
SuperHyperReverse Strict Connective. The clarifications, instances and literature reviews have taken 3183
the whole way through. In this research, the literature reviews have fulfilled the lines containing 3184
the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph are the 3185
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 3186
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 3187
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 3188
based on the connectivities of the moves of the cancer in the longest and strongest styles with 3189
the formation of the design and the architecture are formally called “ SuperHyperReverse Strict 3190
Connective” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme 3191
of the embedded styles to figure out the background for the SuperHyperNotions. In the Table 3192
(37.1), benefits and avenues for this research are, figured out, pointed out and spoken out. 3193
149
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperReverse Strict Connective
3. Extreme SuperHyperReverse Strict Connective 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3194
Extreme SuperHyperDuality But As The 3195
Super Forms 3197
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3198

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

Va ∈ Ei , Ej ; 3202
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3203
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3204
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3205
Vi , Vj ∈ Ea ; 3206
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3207
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3208
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3209
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3210

SuperHyperDuality. 3211
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3212

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3217
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3218
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3219
Extreme SuperHyperDuality; 3221
151
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3222

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3223
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3224
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3225
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3226
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3227
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3228

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3229
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3230
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3235
coefficient; 3236
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3237

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

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3260
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3261
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3262
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3263
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3264

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3265

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3273
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3275
Extreme coefficient. 3276
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3277
mentioned Extreme Figures in every Extreme items. 3278
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3279
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3280
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3281
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3282
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3283
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3284
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3285
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- 3287
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3288
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3289
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3290
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3291
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3292
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3293


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

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

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

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

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

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


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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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


3 × 3z 2 .



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

(1 × 1 × 2)z.


(2 × 2 × 2)z.
C(N SHG)Extreme SuperHyperDuality = {E3i+1i=03 }.

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



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

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 3337
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. 3341
(31.1), is the SuperHyperDuality. 3344
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 3346
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



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

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 3368
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3369
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3370
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3371
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3372
representative in the 3373
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 : 3374

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3386

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3390
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3391
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. 3403
Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3404
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 3405
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 : 3406

(V, E). There’s a new way to redefine as 3407

∃!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 3411
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3412
Extreme SuperHyperDuality. 3418

CHAPTER 19 3419
Extreme SuperHyperJoin But As The 3420
Super Forms 3422
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3423

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3434
|Vj |Extreme CARDINALITY ; 3435
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3436
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3437
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3438

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3442
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3443
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3444
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3445
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3446
165
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3447

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3454
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3455
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3456
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3457
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3458
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3460
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3461

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3477
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3478
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3480
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3481
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3482

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3485

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

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

SuperHyperJoin. 3506
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 3508
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3509
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3510
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3511
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3512
V3 , is excluded in every given Extreme SuperHyperJoin. 3513

is up. The Extreme Algorithm is Extremely straightforward. 3515


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

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

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

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

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

4 × 5 × 5z 3 .

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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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

3 × 3z 2 .




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

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

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

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

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


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

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

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

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

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


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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3583
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 3585
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 3589
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3590
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3591
SuperHyperPart could have one SuperHyperVertex as the representative in the 3592
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3593

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

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


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3610
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. 3621

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

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

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

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

CHAPTER 20 3636
Extreme SuperHyperPerfect But As The 3637
Super Forms 3639
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3640

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3652
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3653

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3657
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3658
Extreme SuperHyperPerfect; 3662
179
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3663

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3670
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3671
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3676
coefficient; 3677
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3678

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3714
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3716
Extreme coefficient. 3717
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3720
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3721
SuperHyperPerfect. 3727
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 3729
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3730
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3734


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

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

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

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

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

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


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

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

3 × 4 × 4z 3 .

3 × 2z 2 .

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


3 × 3z 2 .



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

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


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

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



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

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

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

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3804
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 3806
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 3810
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3811
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3812
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite ESHB : 3815

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

Then 3825

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



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3830
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3831
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3832
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. 3844
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

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


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 3850
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 3851
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 3852
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 3853
straightforward. 3854
Extreme SuperHyperPerfect. 3859

CHAPTER 21 3860
Extreme SuperHyperTotal But As The 3861
Super Forms 3863
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3864
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3867
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3868

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3874
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3875

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3879
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3882
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3883
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3884

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3885
193

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3899
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3901
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3902
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3903
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3905
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3906

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3907
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3910
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3911
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3912

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3919
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3920
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3923
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3924
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3925
coefficient; 3926
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3927

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3930
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3931
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3932
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3934
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3937
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3938
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3939
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3940
SuperHyperTotal. 3944
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 3946
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3947
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3948
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3949
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3950
V3 , is excluded in every given Extreme SuperHyperTotal. 3951



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

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

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

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

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = z 3 .

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

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial 10z 10 .

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

3 × 4 × 4z 3 .
C(N SHG)Extreme SuperHyperTotal = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V5 }.
C(N SHG)Extreme SuperHyperTotal = {E1 , E2 }.

C(N SHG)Extreme R-SuperHyperTotal = {V1 , Vii68=4,5,6 }.
i=1





4 × 3z 3 .

C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 , V6 , V17 }.
4 × 3z 4 .

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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3999
(31.1), is the SuperHyperTotal. 4002
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 4004
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. 4011
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 4013
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4075
Extreme SuperHyperConnected But As 4076
The Extensions Excerpt From Dense And 4077
Super Forms 4078
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4079

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4093
SuperHyperConnected. 4094
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4095
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4098

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4100
207
Extreme SuperHyperConnected; 4104
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4105

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4112
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4113
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4114
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4115
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4116
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4117
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4118
corresponded to its Extreme coefficient; 4119
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4120


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

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

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

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

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

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

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

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

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 4171
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 4172
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 4176


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

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

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

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

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

C(N SHG)Extreme R-SuperHyperConnected = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z.

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

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Extreme R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .
Connected, is up. The Extreme Algorithm is Extremely straightforward. 4192

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 4220
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. 4224
(31.1), is the SuperHyperConnected. 4227
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 4229
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. 4236
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 4238



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4257

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4258
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4265
Then 4267
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 4268
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4269


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4292
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4293
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4294
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4295
some representatives. The latter is straightforward. 4296
Extreme SuperHyperConnected. 4301

CHAPTER 23 4302
Background 4303
221



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 4373
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 4374
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 4375
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 4376
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4377
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett 4378
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 4379
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 4380
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4381
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 4382

(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 4383

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 4384
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 4385
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 4386
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 4389

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 4390
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 4391
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 4392
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4393
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyper- 4394
Graph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” 4395

in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees 4396
on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 4397
Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyperDominating and SuperHy- 4398
perResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 4399
Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatch- 4400
ing By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic 4401

SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 4402
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 4403
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 4404
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 4405
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 4406
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 4407
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 4408
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 4409
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 4410
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 4411
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 4412
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 4413
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 4414
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 4415
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 4416
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 4417
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 4418

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neut- 4419
(2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 4422
(Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 4423
1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 4424

on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), 4425
“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Supe- 4426
rHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 4427
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 4428

(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 4429
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 4430
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 4431
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 4432
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 4433
(2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 4434
HG285; HG286; HG287; HG288; HG289], there are some endeavors to formalize the basic 4455
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 4456
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 4457



HG280; HG281; HG282; HG283; HG284; HG285; HG286; HG287; HG288; HG289] 4510
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4511



HG177b; HG178b; HG179b; HG180b; HG181b; HG182b; HG183b; HG184b]. Two 4525
popular scientific research books in Scribd in the terms of high readers, 4728 and 5721 respect- 4526
ively, on neutrosophic science is on [HG32b; HG44b]. 4527

Bibliography 4528
10.33140/JMTCM.01.03.09) 4551
227



10.20944/preprints202301.0282.v1). 4567

10.20944/preprints202301.0267.v1). 4570

(doi: 10.20944/preprints202301.0265.v1). 4575
prints202301.0262.v1). 4579
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4585

prints202301.0105.v1). 4588

Preprints 2023, 2023010044 4594
10.20944/preprints202301.0043.v1). 4597

(doi: 10.20944/preprints202212.0549.v1). 4606

(doi: 10.20944/preprints202212.0500.v1). 4613
(doi: 10.5281/zenodo.8078445). 4622

2023, (doi: 10.5281/zenodo.8078543). 4625
10.5281/zenodo.8076416). 4628
2023, (doi: 10.5281/zenodo.8076399). 4631
(doi: 10.5281/zenodo.8072171). 4634

2023, (doi: 10.5281/zenodo.8072267). 4637
10.5281/zenodo.8067384). 4640
2023, (doi: 10.5281/zenodo.8067409). 4643
10.5281/zenodo.8061927). 4646
10.5281/zenodo.8062016). 4649
10.5281/zenodo.8057696). 4652
2023, (doi: 10.5281/zenodo.8057753). 4655
10.5281/zenodo.8052893). 4658
2023, (doi: 10.5281/zenodo.8052925). 4661
10.5281/zenodo.8051346). 4664
10.5281/zenodo.8051360). 4667
10.5281/zenodo.8025707). 4670
10.5281/zenodo.8027275). 4673

odo.8017246). 4676
10.5281/zenodo.8020128). 4679
odo.7978571). 4682
10.5281/zenodo.7978857). 4685
10.5281/zenodo.7940830). 4688
10.5281/zenodo.7943578). 4691
odo.7916595). 4694
odo.7923632). 4697
(doi: 10.5281/zenodo.7904698). 4700
2023, (doi: 10.5281/zenodo.7904671). 4703
10.5281/zenodo.7871026). 4712

2023, (doi: 10.5281/zenodo.7874647). 4715
10.5281/zenodo.7857856). 4718
2023, (doi: 10.5281/zenodo.7857841). 4721
10.5281/zenodo.7853867). 4730
10.5281/zenodo.7853922). 4733
(doi: 10.5281/zenodo.7851519). 4736
(doi: 10.5281/zenodo.7851550). 4739
10.5281/zenodo.7834229). 4748
10.5281/zenodo.7834261). 4751

10.5281/zenodo.7824560). 4754
(doi: 10.5281/zenodo.7824623). 4757
2023, (doi: 10.5281/zenodo.7809365). 4768

2023, (doi: 10.5281/zenodo.7809358). 4771
10.5281/zenodo.7809219). 4774
10.5281/zenodo.7809328). 4777
2023, (doi: 10.5281/zenodo.7806767). 4780
2023, (doi: 10.5281/zenodo.7806838). 4783

10.5281/zenodo.7799902). 4792
(doi: 10.5281/zenodo.7804218). 4795
(doi: 10.5281/zenodo.7796334). 4798
10.5281/zenodo.7791952). 4804
10.5281/zenodo.7791982). 4807
10.5281/zenodo.7790026). 4810
10.5281/zenodo.7790052). 4813
2023, (doi: 10.5281/zenodo.7787066). 4816
10.5281/zenodo.7781476). 4822
10.5281/zenodo.7783082). 4825
10.5281/zenodo.7777857). 4828

10.5281/zenodo.7779286). 4831
(doi: 10.5281/zenodo.7771831). 4834
2023, (doi: 10.5281/zenodo.7772468). 4837
10.13140/RG.2.2.20913.25446). 4840
odo.7764916). 4843
10.13140/RG.2.2.11770.98247). 4846
10.13140/RG.2.2.12400.12808). 4849
2023, (doi: 10.13140/RG.2.2.22545.10089). 4852
10.13140/RG.2.2.11377.76644). 4858
10.13140/RG.2.2.23750.96329). 4861
10.13140/RG.2.2.31366.24641). 4864
10.13140/RG.2.2.34721.68960). 4867

2023, (doi: 10.13140/RG.2.2.30212.81289). 4870
10.13140/RG.2.2.24288.35842). 4876
10.13140/RG.2.2.32467.25124). 4879
10.13140/RG.2.2.31025.45925). 4882
10.13140/RG.2.2.17184.25602). 4885
10.13140/RG.2.2.23423.28327). 4888
10.13140/RG.2.2.28456.44805). 4891
10.13140/RG.2.2.23525.68320). 4894
10.13140/RG.2.2.20170.24000). 4897
10.13140/RG.2.2.36475.59683). 4900
10.13140/RG.2.2.29764.71046). 4903
2023, (doi: 10.13140/RG.2.2.18780.87683). 4906

10.13140/RG.2.2.26134.01603). 4912
10.13140/RG.2.2.27392.30721). 4915
10.13140/RG.2.2.33028.40321). 4918
10.13140/RG.2.2.21389.20966). 4921
10.13140/RG.2.2.16356.04489). 4924
10.13140/RG.2.2.21756.21129). 4927
10.13140/RG.2.2.30983.68009). 4930
10.13140/RG.2.2.28552.29445). 4933
(doi: 10.13140/RG.2.2.10936.21761). 4936
10.13140/RG.2.2.35105.89447). 4939
(doi: 10.13140/RG.2.2.30072.72960). 4942
10.13140/RG.2.2.31147.52003). 4945

10.13140/RG.2.2.32825.24163). 4948
10.13140/RG.2.2.13059.58401). 4951
10.13140/RG.2.2.11172.14720). 4954
2023, (doi: 10.13140/RG.2.2.22011.80165). 4957
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4960
2023, (doi: 10.13140/RG.2.2.10493.84962). 4963
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4966
2023, (doi: 10.13140/RG.2.2.19944.14086). 4969
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4972
(doi: 10.13140/RG.2.2.33103.76968). 4975
(doi: 10.13140/RG.2.2.23037.44003). 4978
(doi: 10.13140/RG.2.2.35646.56641). 4981
10.13140/RG.2.2.18030.48967). 4984

(doi: 10.13140/RG.2.2.13973.81121). 4987
2023, (doi: 10.13140/RG.2.2.34106.47047). 4990
2023, (doi: 10.13140/RG.2.2.31956.88961). 4996
2023, (doi: 10.13140/RG.2.2.15179.67361). 4999
10.13140/RG.2.2.21510.45125). 5002
2023, (doi: 10.13140/RG.2.2.13121.84321). 5005
10.13140/RG.2.2.11758.69441). 5008
2023, (doi: 10.13140/RG.2.2.31891.35367). 5011
10.13140/RG.2.2.19360.87048). 5014
10.13140/RG.2.2.32363.21286). 5017
10.13140/RG.2.2.23266.81602). 5020
10.13140/RG.2.2.19911.37285). 5023

10.13140/RG.2.2.11050.90569). 5026
2023, (doi: 10.13140/RG.2.2.17761.79206). 5029
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 5035
(doi: 10.13140/RG.2.2.30182.50241). 5038


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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 5080
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5083


2023,(doi: 10.13140/RG.2.2.36745.93289). 5097

10.20944/preprints202301.0282.v1). 5104
10.20944/preprints202301.0267.v1).). 5107
(doi: 10.20944/preprints202301.0265.v1). 5112
prints202301.0262.v1). 5116
2023010224, (doi: 10.20944/preprints202301.0224.v1). 5122

10.13140/RG.2.2.35061.65767). 5125
10.13140/RG.2.2.18494.15680). 5129
10.13140/RG.2.2.32530.73922). 5133
10.13140/RG.2.2.15897.70243). 5137
10.13140/RG.2.2.32530.73922). 5141

prints202301.0105.v1). 5144

10.13140/RG.2.2.23172.19849). 5151
10.13140/RG.2.2.17385.36968). 5161

Preprints 2023, 2023010044 5164
10.20944/preprints202301.0043.v1). 5167
2023, (doi: 10.13140/RG.2.2.28945.92007). 5170

10.13140/RG.2.2.35774.77123). 5176

10.13140/RG.2.2.29430.88642). 5182

(doi: 10.20944/preprints202212.0549.v1). 5188
10.13140/RG.2.2.19380.94084). 5191

(doi: 10.20944/preprints202212.0500.v1). 5202
10.13140/RG.2.2.20993.12640). 5205


10.13140/RG.2.2.29173.86244). 5220

2023 (doi: 10.5281/zenodo.8076449). 5227
2023 (doi: 10.5281/zenodo.8067469). 5231
(doi: 10.5281/zenodo.8062076). 5233
2023 (doi: 10.5281/zenodo.8052976). 5237
(doi: 10.5281/zenodo.8051368). 5239
(doi: 10.5281/zenodo.8027488). 5241
10.5281/zenodo.8020181). 5243
10.5281/zenodo.7978921). 5245
odo.7943878). 5247
10.5281/zenodo.7943871). 5249
10.5281/zenodo.7923786). 5251
2023 (doi: 10.5281/zenodo.7905287). 5253


2023 (doi: 10.5281/zenodo.7874677). 5257
(doi: 10.5281/zenodo.7857906). 5259
2023 (doi: 10.5281/zenodo.7856329). 5261
10.5281/zenodo.7854561). 5263
2023 (doi: 10.5281/zenodo.7851893). 5265

(doi: 10.5281/zenodo.7835063). 5269
(doi: 10.5281/zenodo.7826705). 5271
2023 (doi: 10.5281/zenodo.7820680). 5273
10.5281/zenodo.7812750). 5275

2023 (doi: 10.5281/zenodo.7807782). 5281
2023 (doi: 10.5281/zenodo.7804449). 5283

(doi: 10.5281/zenodo.7792307). 5287
(doi: 10.5281/zenodo.7790728). 5289

2023 (doi: 10.5281/zenodo.7787712). 5291
10.5281/zenodo.7783791). 5293
10.5281/zenodo.7780123). 5295
(doi: 10.5281/zenodo.7773119). 5297
odo.7637762). 5299
10.5281/zenodo.7766174). 5301
10.5281/zenodo.7762232). 5303
(doi: 10.5281/zenodo.7758601). 5305
10.5281/zenodo.7754661). 5307
10.5281/zenodo.7750995) . 5309
(doi: 10.5281/zenodo.7749875). 5311
10.5281/zenodo.7747236). 5313
10.5281/zenodo.7742587). 5315
(doi: 10.5281/zenodo.7738635). 5317
10.5281/zenodo.7734719). 5319
10.5281/zenodo.7730484). 5321
(doi: 10.5281/zenodo.7730469). 5323
10.5281/zenodo.7722865). 5325

odo.7713563). 5327
odo.7709116). 5329
10.5281/zenodo.7706415). 5331
10.5281/zenodo.7706063). 5333
10.5281/zenodo.7701906). 5335
odo.7700205). 5337
10.5281/zenodo.7694876). 5339
10.5281/zenodo.7679410). 5341
10.5281/zenodo.7675982). 5343
10.5281/zenodo.7672388). 5345
odo.7668648). 5347
10.5281/zenodo.7662810). 5349
10.5281/zenodo.7659162). 5351
odo.7653233). 5353
odo.7653204). 5355
odo.7653142). 5357
odo.7653117). 5359

odo.7651687). 5362
odo.7651619). 5364
odo.7651439). 5366
odo.7650729). 5368
odo.7647868). 5370
odo.7647017). 5372
odo.7644894). 5374
odo.7632923). 5377
odo.7623459). 5379
10.5281/zenodo.7606416). 5381
10.5281/zenodo.7606416). 5383
odo.7606404). 5385
10.5281/zenodo.7580018). 5387
odo.7580018). 5389
odo.7580018). 5391
odo.7579929). 5393
10.5281/zenodo.7563170). 5395

odo.7563164). 5397
odo.7563160). 5399
odo.7563160). 5401
10.5281/zenodo.7563160). 5403
10.5281/zenodo.7557063). 5405
10.5281/zenodo.7557009). 5407
10.5281/zenodo.7539484). 5409
10.5281/zenodo.7523390). 5411
10.5281/zenodo.7523390). 5413
10.5281/zenodo.7523390). 5415
odo.7574952). 5417
10.5281/zenodo.7574992). 5419
odo.7523357). 5421
10.5281/zenodo.7523357). 5423
10.5281/zenodo.7504782). 5425
10.5281/zenodo.7504782). 5427
10.5281/zenodo.7504782). 5429
10.5281/zenodo.7499395). 5431

odo.7499395). 5433
10.5281/zenodo.7499395). 5435
10.5281/zenodo.7497450). 5437
10.5281/zenodo.7497450). 5439
10.5281/zenodo.7494862). 5441
odo.7494862). 5443
10.5281/zenodo.7494862). 5445
10.5281/zenodo.7493845). 5447
odo.7493845). 5449
10.5281/zenodo.7493845). 5451
odo.7539484). 5453
odo.7523390). 5455
odo.7523357). 5457
odo.7504782). 5459
odo.7499395). 5461
odo.7497450). 5463
odo.7494862). 5465
odo.7493845). 5467

odo.7480110). 5469
odo.7378758). 5471
odo.6320305). 5473
odo.6677173). 5475

CHAPTER 24 5476
Cancer In Neutrosophic 5477
SuperHyperGraph 5478
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5479
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5480
disease is considered and as the consequences of the model, some parameters are used. The cells 5481
are under attack of this disease but the moves of the cancer in the special region are the matter 5482
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5483
treatments for this Neutrosophic disease. 5484
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5485
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5486
term Neutrosophic function. 5487
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5488
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5489
move from the cancer is identified by this research. Sometimes the move of the cancer 5490
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5491
about the moves and the effects of the cancer on that region; this event leads us to 5492
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5493
perception on what’s happened and what’s done. 5494
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5495
known and they’ve got the names, and some general Neutrosophic models. The moves 5496
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5497
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5498
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5499
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5500
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5501
Models. 5502
Some cells have been faced with some attacks from the situation which is caused by the 5503
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5504
which in that, the cells could be labelled as some groups and some groups or individuals have 5505
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5506
the embedded situations, the individuals of cells and the groups of cells could be considered 5507
253
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5508
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5509
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5510
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5511
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5512
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5513
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5514
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5515
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5516
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5517
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5518
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5519
out what’s going on this phenomenon. The special case of this disease is considered and as the 5520
consequences of the model, some parameters are used. The cells are under attack of this disease 5521
but the moves of the cancer in the special region are the matter of mind. The recognition of 5522
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5523
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5524
both bases are the background of this research. Sometimes the cancer has been happened on the 5525
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5526
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5527
in the forms of alliances’ styles with the formation of the design and the architecture are 5528
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5529
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5530
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5531
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5532
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5533
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5534
names, and some general models. The moves and the traces of the cancer on the complex tracks 5538
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5539
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5540
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5541
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5542
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5543
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5544
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5545
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5546
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5547
Question 24.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 5548
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5549
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5550
based on the fixed groups of cells or the fixed groups of group of cells? 5551
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5552

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5556
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5562
research on the modeling of the regions where are under the attacks of the cancer to 5563
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5564
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5565
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5566
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5567

instances and literature reviews have taken the whole way through. In this scientific research, 5568
the literature reviews have fulfilled the lines containing the notions and the results. The 5569
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5570
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5571
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5572
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5573
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5574
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5575
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5576
to figure out the background for the SuperHyperNotions. 5577

CHAPTER 25 5578
Neutrosophic Reverse Strict Connective 5579
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5580
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5581
2023, (doi: 10.13140/RG.2.2.34953.52320). 5582

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5583
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5584
(doi: 10.13140/RG.2.2.33275.80161). 5585
10.13140/RG.2.2.11050.90569). 5588
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5589
10.13140/RG.2.2.17761.79206). 5591
10.13140/RG.2.2.19911.37285). 5594
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5595
10.13140/RG.2.2.23266.81602). 5597
10.13140/RG.2.2.19360.87048). 5600
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5601
10.13140/RG.2.2.32363.21286). 5603
10.13140/RG.2.2.11758.69441). 5606
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5607
10.13140/RG.2.2.31891.35367). 5609
10.13140/RG.2.2.21510.45125). 5612
257
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5613
10.13140/RG.2.2.13121.84321). 5615

CHAPTER 26 5616
New Ideas In Recognition of Cancer And 5617
Neutrosophic SuperHyperGraph By 5618
Reverse Strict Connective As Hyper 5619
Conceit On Super Con 5620
259
CHAPTER 27 5621
ABSTRACT 5622
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse 5623

Strict Connective). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Reverse Strict Connective 5624
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5625
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperReverse Strict Connective 5626
if the following expression is called Neutrosophic e-SuperHyperReverse Strict Connective criteria holds 5627

Neutrosophic re-SuperHyperReverse Strict Connective if the following expression is called Neutrosophic 5628
e-SuperHyperReverse Strict Connective criteria holds 5629

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic 5630
v-SuperHyperReverse Strict Connective if the following expression is called Neutrosophic v- 5631

SuperHyperReverse Strict Connective criteria holds 5632

261
Neutrosophic rv-SuperHyperReverse Strict Connective if the following expression is called Neutrosophic 5633
v-SuperHyperReverse Strict Connective criteria holds 5634

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5635
HyperReverse Strict Connective if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, Neut- 5636
rosophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, 5637
and Neutrosophic rv-SuperHyperReverse Strict Connective. ((Neutrosophic) SuperHyperReverse Strict 5638
Connective). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5639
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5640
SuperHyperReverse Strict Connective if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, 5641
Neutrosophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, 5642
and Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for an Extreme SuperHyper- 5643
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5644
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 5645
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5646
SuperHyperReverse Strict Connective; a Neutrosophic SuperHyperReverse Strict Connective if it’s either of 5647
Connective and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 5650
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict 5653
Connective; an Extreme SuperHyperReverse Strict Connective SuperHyperPolynomial if it’s either of 5654
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 5658
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 5659

S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHy- 5660
perVertices such that they form the Extreme SuperHyperReverse Strict Connective; and the Extreme 5661
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Strict Connective 5662
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, Neutro- 5663
sophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, and 5664
Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic SuperHyper- 5665
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5666
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5667
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5668
dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 5669
that they form the Neutrosophic SuperHyperReverse Strict Connective; and the Neutrosophic power is 5670
corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse Strict Connective if it’s 5671

either of Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict 5672

Connective, Neutrosophic v-SuperHyperReverse Strict Connective, and Neutrosophic rv-SuperHyperReverse 5673
Strict Connective and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the max- 5674
imum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 5675
the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHy- 5676
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse 5677
Strict Connective; a Neutrosophic V-SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 5678
SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, Neutrosophic 5679
v-SuperHyperReverse Strict Connective, and Neutrosophic rv-SuperHyperReverse Strict Connective and 5680
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 5681
SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict Connective; 5684
an Extreme V-SuperHyperReverse Strict Connective SuperHyperPolynomial if it’s either of Neut- 5685
rosophic e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, 5686
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of 5689
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 5690
HyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 5691
SuperHyperVertices such that they form the Extreme SuperHyperReverse Strict Connective; and the 5692
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Strict 5693
Connective SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, 5694
Neutrosophic re-SuperHyperReverse Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connect- 5695
ive, and Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic 5696
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5697
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5698
SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict Connective; and 5701
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5702
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperReverse Strict Connective 5703
and Neutrosophic SuperHyperReverse Strict Connective. Two different types of SuperHyperDefinitions 5704
are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUni- 5705
form, and SuperHyperClass based on that are well-defined and well-reviewed. The literature 5706
Recognition” are the under research to figure out the challenges make sense about ongoing and 5712
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5717

nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 5718
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5719
research. It’s also officially collected in the form of some questions and some problems. Assume 5720
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Strict Connective 5721
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5722
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5723
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5724
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 5725
S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Strict Connective is a max- 5726
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5727
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5728
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5729
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 5730
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5731
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperReverse 5732
Strict Connective . Since there’s more ways to get type-results to make a SuperHyperReverse Strict 5733
Connective more understandable. For the sake of having Neutrosophic SuperHyperReverse Strict 5734
Connective, there’s a need to “redefine” the notion of a “SuperHyperReverse Strict Connective ”. The 5735
Assume a SuperHyperReverse Strict Connective . It’s redefined a Neutrosophic SuperHyperReverse Strict 5738
Connective if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, 5739
Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 5740
with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, 5741
“The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The 5742
Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum 5743
Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its 5744
Endpoints”. To get structural examples and instances, I’m going to introduce the next SuperHy- 5745
perClass of SuperHyperGraph based on a SuperHyperReverse Strict Connective . It’s the main. It’ll 5746
be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 5747
If there’s a need to have all SuperHyperReverse Strict Connective until the SuperHyperReverse Strict 5748
Connective, then it’s officially called a “SuperHyperReverse Strict Connective” but otherwise, it isn’t a 5749
SuperHyperReverse Strict Connective . There are some instances about the clarifications for the main 5750
definition titled a “SuperHyperReverse Strict Connective ”. These two examples get more scrutiny and 5751
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 5752
on a SuperHyperReverse Strict Connective . For the sake of having a Neutrosophic SuperHyperReverse 5753
Strict Connective, there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperReverse 5754
Strict Connective” and a “Neutrosophic SuperHyperReverse Strict Connective ”. The SuperHyperVertices 5755
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 5756
this procedure, there’s the usage of the position of labels to assign to the values. Assume 5757
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 5758
intended Table holds. And a SuperHyperReverse Strict Connective are redefined to a “Neutrosophic 5759
SuperHyperReverse Strict Connective” if the intended Table holds. It’s useful to define “Neutrosophic” 5760
version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to 5761
make a Neutrosophic SuperHyperReverse Strict Connective more understandable. Assume a Neut- 5762
rosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 5763

Table holds. Thus SuperHyperPath, SuperHyperReverse Strict Connective, SuperHyperStar, Su- 5764
perHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5765
SuperHyperPath”, “Neutrosophic SuperHyperReverse Strict Connective”, “Neutrosophic SuperHy- 5766
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 5767
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 5768
“Neutrosophic SuperHyperReverse Strict Connective” where it’s the strongest [the maximum Neutro- 5769
sophic value from all the SuperHyperReverse Strict Connective amid the maximum value amid all 5770
SuperHyperVertices from a SuperHyperReverse Strict Connective .] SuperHyperReverse Strict Connective . 5771
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5772
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5773
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5774
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperReverse Strict Connective if it’s 5775
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5781
and the common and intended properties between “specific” cells and “specific group” of cells 5787
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5788
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 5789
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 5790
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5791
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5792
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5793
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 5794
identified since there are some determinacy, indeterminacy and neutrality about the moves 5795
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5799
cancer on the complex tracks and between complicated groups of cells could be fantasized 5800
by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Strict Connective, SuperHyperStar, Su- 5801
perHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5802
the longest SuperHyperReverse Strict Connective or the strongest SuperHyperReverse Strict Connective 5803
in those Neutrosophic SuperHyperModels. For the longest SuperHyperReverse Strict Connective, 5804
called SuperHyperReverse Strict Connective, and the strongest SuperHyperReverse Strict Connective, called 5805
Neutrosophic SuperHyperReverse Strict Connective, some general results are introduced. Beyond 5806
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but 5807

deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperReverse Strict 5811
Connective theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5812
Keywords: Neutrosophic SuperHyperGraph, SuperHyperReverse Strict Connective, Cancer’s Neut- 5813
rosophic Recognition 5814


CHAPTER 28 5816
Applied Notions Under The Scrutiny Of 5817
The Motivation Of This Scientific 5818
Research 5819
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5820
try to bring the motivations in the narrative ways. Some cells have been faced with some 5821
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5822
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5823
as some groups and some groups or individuals have excessive labels which all are raised from 5824
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5825
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5826
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5827
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5828
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5829
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5830
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5831
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5832
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5833
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5834
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5835
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5836
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5837
is the disease but the model is going to figure out what’s going on this phenomenon. The 5838
special case of this disease is considered and as the consequences of the model, some parameters 5839
are used. The cells are under attack of this disease but the moves of the cancer in the 5840
special region are the matter of mind. The recognition of the cancer could help to find some 5841
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5842
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5843
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 5844
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 5845
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 5846
the formation of the design and the architecture are formally called “ SuperHyperReverse Strict 5847
Connective” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 5848
267
theme of the embedded styles to figure out the background for the SuperHyperNotions. The 5849
recognition of the cancer in the long-term function. The specific region has been assigned by 5850
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5851
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5852
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5853
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5854
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5855
are some specific models, which are well-known and they’ve got the names, and some general 5856
models. The moves and the traces of the cancer on the complex tracks and between complicated 5857
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperReverse Strict 5858
Connective, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 5859
The aim is to find either the optimal SuperHyperReverse Strict Connective or the Neutrosophic 5860
SuperHyperReverse Strict Connective in those Neutrosophic SuperHyperModels. Some general results 5861
are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 5862
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 5863
three SuperHyperEdges to form any style of a SuperHyperReverse Strict Connective. There isn’t 5864
any formation of any SuperHyperReverse Strict Connective but literarily, it’s the deformation of any 5865
SuperHyperReverse Strict Connective. It, literarily, deforms and it doesn’t form. 5866
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5867
“ amount of SuperHyperReverse Strict Connective” of either individual of cells or the groups of cells 5868
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperReverse 5869
Strict Connective” based on the fixed groups of cells or the fixed groups of group of cells? 5870
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5871
these messy and dense SuperHyperModels where embedded notions are illustrated? 5872
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5873
it motivates us to define different types of “ SuperHyperReverse Strict Connective” and “Neutrosophic 5874
SuperHyperReverse Strict Connective” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5875

The framework of this research is as follows. In the beginning, I introduce basic definitions to 5881
clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about SuperHy- 5882
perGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth-discussed. 5883
The elementary concepts are clarified and illustrated completely and sometimes review literature 5884
are applied to make sense about what’s going to figure out about the upcoming sections. The 5885
main definitions and their clarifications alongside some results about new notions, SuperHy- 5886
perReverse Strict Connective and Neutrosophic SuperHyperReverse Strict Connective, are figured out in 5887
sections “ SuperHyperReverse Strict Connective” and “Neutrosophic SuperHyperReverse Strict Connective”. 5888
In the sense of tackling on getting results and in Reverse Strict Connective to make sense about con- 5889
tinuing the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5890
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5891
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5892
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5893

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5894
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results 5895
on Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRela- 5896
tions and as concluding and closing section of theoretical research are contained in the section 5897
“General Results”. Some general SuperHyperRelations are fundamental and they are well-known 5898
as fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5899
“ SuperHyperReverse Strict Connective”, “Neutrosophic SuperHyperReverse Strict Connective”, “Results on 5900

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5901
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5902
this research and going to figure out the word “best” as the description and adjective for this 5903
research as presented in section, “ SuperHyperReverse Strict Connective”. The keyword of this research 5904
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5905
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5906
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5907
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5908
research in the terms of “questions” and “problems” to make sense to figure out this research in 5909
featured style. The advantages and the limitations of this research alongside about what’s done 5910
in this research to make sense and to get sense about what’s figured out are included in the 5911
section, “Conclusion and Closing Remarks”. 5912

CHAPTER 29 5913
Neutrosophic Preliminaries Of This 5914
Scientific Research On the Redeemed 5915
Ways 5916
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5917
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5918

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5919
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5920
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5921
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5922
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5923
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5924

ideas and their clarifications are addressed to Ref.[HG38]. 5925
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5926
the new ideas and their clarifications are elicited. 5927
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG11s],Definition 2.1,p.1).

Let X be a Reverse Strict Connective 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 [. 5928
Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG11s],Definition 2.2,p.2).

Let X be a Reverse Strict Connective 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}.
271

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.[HG11s],Definition 5929
2.5,p.2). 5930
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5931
S = (V, E), where 5932
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 5933
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 5936
0
1, 2, . . . , n ); 5937
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5938
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5939

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



SuperEdge; 5962
If we choose different types of binary operations, then we could get hugely diverse types of 5965
general forms of Neutrosophic SuperHyperGraph (NSHG). 5966
Definition 29.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 5967

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5968
x, y, z, w ∈ [0, 1]: 5969
(i) 1 ⊗ x = x; 5970
(ii) x ⊗ y = y ⊗ x; 5971
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5972
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5973

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)). 5974

where 5976

1, 2, . . . , n0 ); 5981
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5982
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5983
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5984
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5985
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5997
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5998
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5999
SuperEdge; 6005
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 6008
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 6009
makes the patterns and regularities. 6010
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 6011
of elements of SuperHyperEdges are the same. 6012

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 6013
makes to have SuperHyperUniform more understandable. 6014
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 6015
Classes as follows. 6016
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 6017
two given SuperHyperEdges with two exceptions; 6018
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 6019
SuperHyperEdges; 6020
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 6021
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 6022
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 6023
in common; 6024
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 6025
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 6026
SuperHyperEdge in common; 6027
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 6028
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 6029
SuperVertex. 6030
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 6031
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 6032
(i) Vi , Vi+1 ∈ Ei0 ; 6033
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 6034
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 6035
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 6036
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 6037
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 6038
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 6039
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 6040
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 6042
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6043
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6044
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6045
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6046
perPath . 6047
Definition 29.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG11s],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 6048
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6049
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6050
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6051
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6052
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6053

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6066
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6067
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6068
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Strict 6069

Connective). 6070
(i) Neutrosophic e-SuperHyperReverse Strict Connective if the following expression is called 6074
Neutrosophic e-SuperHyperReverse Strict Connective criteria holds 6075

(ii) Neutrosophic re-SuperHyperReverse Strict Connective if the following expression is called 6076
Neutrosophic re-SuperHyperReverse Strict Connective criteria holds 6077

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6078
(iii) Neutrosophic v-SuperHyperReverse Strict Connective if the following expression is called 6079


(iv) Neutrosophic rv-SuperHyperReverse Strict Connective if the following expression is called 6081

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6083
(v) Neutrosophic SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 6084

Connective. 6087
Definition 29.0.19. ((Neutrosophic) SuperHyperReverse Strict Connective). 6088

(i) an Extreme SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 6091

of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme Su- 6096
perHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 6097
(ii) a Neutrosophic SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 6099

(iii) an Extreme SuperHyperReverse Strict Connective SuperHyperPolynomial if it’s either 6107

of Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse 6108
Strict Connective, Neutrosophic v-SuperHyperReverse Strict Connective, and Neutrosophic rv- 6109
SuperHyperReverse Strict Connective and C(N SHG) for an Extreme SuperHyperGraph 6110
Extreme SuperHyperReverse Strict Connective; and the Extreme power is corresponded to its 6115
Extreme coefficient; 6116

(iv) a Neutrosophic SuperHyperReverse Strict Connective SuperHyperPolynomial 6117

Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic Supe- 6120
rHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 6121
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 6122

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse 6125
Strict Connective; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 6126
(v) an Extreme V-SuperHyperReverse Strict Connective if it’s either of Neutrosophic e- 6127

of the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 6132

(vi) a Neutrosophic V-SuperHyperReverse Strict Connective if it’s either of Neutrosophic 6135

e-SuperHyperReverse Strict Connective, Neutrosophic re-SuperHyperReverse Strict Connective, Neut- 6136
(vii) an Extreme V-SuperHyperReverse Strict Connective SuperHyperPolynomial if 6143
it’s either of Neutrosophic e-SuperHyperReverse Strict Connective, Neutrosophic re- 6144

Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for an Extreme SuperHy- 6146
perGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 6147
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 6148
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 6149
form the Extreme SuperHyperReverse Strict Connective; and the Extreme power is corresponded 6151
(viii) a Neutrosophic SuperHyperReverse Strict Connective SuperHyperPolynomial 6153

Neutrosophic rv-SuperHyperReverse Strict Connective and C(N SHG) for a Neutrosophic Su- 6156
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 6157


136TBL3

SuperHyperReverse Strict Connective; and the Neutrosophic power is corresponded to its 6162
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Strict Connective). 6164

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6165
(i) an δ−SuperHyperReverse Strict Connective is a Neutrosophic kind of Neutrosophic 6166

SuperHyperReverse Strict Connective such that either of the following expressions hold for 6167
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6168
|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 6169
(29.1), holds if S is an δ−SuperHyperDefensive; 6170
(ii) a Neutrosophic δ−SuperHyperReverse Strict Connective is a Neutrosophic kind of 6171

Neutrosophic SuperHyperReverse Strict Connective such that either of the following Neutrosophic 6172
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6173
|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 6174

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6175
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6177
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 6178
there’s the usage of the position of labels to assign to the values. 6179
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6180
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6181
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6182
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6183

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

136TBL4

136TBL1
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6184

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6185
Thus Neutrosophic SuperHyperPath , SuperHyperReverse Strict Connective, SuperHyperStar, 6186
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6187
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6188

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6189
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6190
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Strict 6191

Connective. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 6192
Strict Connective more Neutrosophicly understandable. 6193
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Strict Connective”. The 6195
6198
136DEF1 Definition 29.0.23. Assume a SuperHyperReverse Strict Connective. It’s redefined a Neutrosophic 6199
SuperHyperReverse Strict Connective if the Table (29.3) holds. 6200

CHAPTER 30 6201
Neutrosophic SuperHyper But As Reverse Strict Connective 6202
Super Forms 6204
Definition 30.0.1. (Neutrosophic event). 6205
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6206
a probability Reverse Strict Connective. Any Neutrosophic k-subset of A of V is called Neutrosophic 6207
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 6208
following expression is called Neutrosophic probability of A. 6209
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6210

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6211
is a probability Reverse Strict Connective. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 6212

s-independent if the following expression is called Neutrosophic s-independent criteria 6213
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. 6214
The following expression is called Neutrosophic independent criteria 6215
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 6216

is a probability Reverse Strict Connective. Any k-function Reverse Strict Connective like E is called 6218
Neutrosophic k-Variable. If k = 2, then any 2-function Reverse Strict Connective like E is 6219
called Neutrosophic Variable. 6220
The notion of independent on Neutrosophic Variable is likewise. 6221
Definition 30.0.4. (Neutrosophic Expectation). 6222
283
is a probability Reverse Strict Connective. A Neutrosophic k-Variable E has a number is called 6224
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6225
criteria 6226
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6227

is a probability Reverse Strict Connective. A Neutrosophic number is called Neutrosophic Crossing 6229
if the following expression is called Neutrosophic Crossing criteria 6230
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). 6231
Consider S = (V, E) is a probability Reverse Strict Connective. Let m and n propose special Reverse Strict 6232
Connective. Then with m ≥ 4n, 6233
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 Reverse Strict Connective 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: 6234
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
6235
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6236
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 6238
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6239
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 6240

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

in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 6248
k < 5n4/3 . 6249
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 6250
(V, E) is a probability Reverse Strict Connective. Draw a SuperHyperUnit SuperHyperCircle around 6251
each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 6252
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 6253
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6254
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6255
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6256
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 6257

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6258
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6259
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6260
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6261
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6262
4/3 4/3
k < 4n + n < 5n . 6263
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6264
Consider S = (V, E) is a probability Reverse Strict Connective. Let X be a nonnegative Neutrosophic 6265
Variable and t a positive real number. Then 6266
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. 6267
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6268
Consider S = (V, E) is a probability Reverse Strict Connective. Let Xn be a nonnegative integer-valued 6269
variable in a probability Reverse Strict Connective (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 6270
P (Xn = 0) → 1 as n → ∞. 6271
Proof. 6272
Consider S = (V, E) is a probability Reverse Strict Connective. A special SuperHyperGraph in Gn,p 6274
almost surely has stability number at most d2p−1 log ne. 6275

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6276
S = (V, E) is a probability Reverse Strict Connective. A special SuperHyperGraph in Gn,p is up. 6277
Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where 6278
k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6279
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6280
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6281
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6282
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6283
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 6284
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6285
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: 6286
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6287
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 6288
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6289
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6290
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6291
Definition 30.0.12. (Neutrosophic Variance). 6292
is a probability Reverse Strict Connective. A Neutrosophic k-Variable E has a number is called 6294
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6295
criteria 6296
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Reverse Strict Connective. Let X be a Neutrosophic Variable and 6298
let t be a positive real number. Then 6299
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Reverse Strict Connective. Let X be a Neutrosophic Variable and let t be 6301
a positive real number. Then 6302
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6303
Consider S = (V, E) is a probability Reverse Strict Connective. Let Xn be a Neutrosophic Variable in 6305
a probability Reverse Strict Connective (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 6306
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Strict Connective. Set X := Xn and t := |Ex(Xn )| in 6308
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6309
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6310
Consider S = (V, E) is a probability Reverse Strict Connective. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6312
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 6313
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6314
S = (V, E) is a probability Reverse Strict Connective. As in the proof of related Theorem, the result 6316
is straightforward. 6317
Consider S = (V, E) is a probability Reverse Strict Connective. Let G ∈ Gn,1/2 and let f and k ∗ be as 6319
defined in previous Theorem. Then either: 6320
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6321
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6322
Definition 30.0.17. (Neutrosophic Threshold). 6325
is a probability Reverse Strict Connective. Let P be a monotone property of SuperHyperGraphs (one 6327
which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for 6328
P is a function f (n) such that: 6329
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6330
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6331

Definition 30.0.18. (Neutrosophic Balanced). 6332

is a probability Reverse Strict Connective. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6334
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6335
SubSuperHyperGraph is called Neutrosophic Balanced. 6336
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6337

(V, E). Consider S = (V, E) is a probability Reverse Strict Connective. Let F be a nonempty 6338
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6339
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6340
SubSuperHyperGraph. 6341
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6344
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6345
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6346

SuperHyperReverse Strict Connective, is up. The Neutrosophic Algorithm is Neutrosophicly 6347
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6348
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6349

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6350
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6351
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6352
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6353
Neutrosophic SuperHyperReverse Strict Connective. 6354
C(N SHG)Neutrosophic Reverse Strict Connective =

{}.
C(N SHG)Neutrosophic Reverse Strict Connective SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Reverse Strict Connective =
{}.
C(N SHG)Neutrosophic V-Reverse Strict Connective SuperHyperPolynomial
= 0z 0 .
6355

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6358
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6359
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6360
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6361
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6362

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

Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperReverse Strict 6363

Connective. 6364

{}.
= 0z 0 .
{}.
= 0z 0 .
6365


{}.
= 0z 0 .
{}.



= 0z 0 .
6369


{}.
= 0z 0 .
{}.
= 0z 0 .
6373






{E2 }.
= z 6−c .
{V5 }.
= z 7−c .
6377


{Ei }22
i=12 .
= z 3−a .



{Vi , V21 }10
i=1 .
= z 3−a .
6381


{E15 , E16 , E17 }.
= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
6385




{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
6389


{E3i+1 , E23 }3i=0 .


= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
6393


{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
6397







{E1 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
6401


{E1 }.


= z 5−a .
{V1 , V2 , V3 , V7 , V8 }.
= z 5−a .
6405


{E9 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
6409




{E2 }.
= z 3−a .
{V1 }.
= z 5−a .
6413


{E3i+1 }1i=0 .


= z 3−a .
{V3i+1 }1i=0 .
= z 3−a .
6417


{E3i+1 }1i=0 .


= z 2−a .
{V2 , V17 , V7 }.
= z 2−a .
6421


{E3i+1 }1i=0 .
= z 2−a .
{V2 , V17 , V7 , V27 }.
= z 2−a .
6425







{E3i+2 }1i=0 .
= z 2−a .
{V2 , V17 , V7 , V27 }.
= z 2−a .
6429


{E3i+1 }3i=0 .



= z 2−a .
{V2i+1 }5i=0 .
= z 2−a .
6433


{E6 }.
= z 4−a .
{V1 }.


= z 6−a .
6437


{E2 }.
= z |1−a| .
{V1 }.
= z |5−a| .
6441


Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic Example (42.0.3) 95NHG1

{E2i+3 }1i=0 .
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .
6445
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6446
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Strict 6447


Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic Example (42.0.3) 95NHG2
if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some
Connective 6448
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6449
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6450
them. 6451
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6452
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6453
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6454
Neutrosophic quasi-R-Reverse Strict Connective minus all Neutrosophic SuperHypeNeighbor to some of 6455
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6456
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6457
quasi-R-Reverse Strict Connective, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6458
all of them. 6459
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-Reverse Strict Connective is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Strict Connective 6460
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6461
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6462
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6463
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6464

Neutrosophic Reverse Strict Connective in some cases but the maximum number of the Neutrosophic 6465
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6466
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Reverse Strict Connective. 6467
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).

Then the Neutrosophic number of type-result-R-Reverse Strict Connective 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-Reverse Strict Connective with the least Neutrosophic cardinality, 6468
the lower sharp Neutrosophic bound for cardinality. 6469
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6470

(V, E). Then in the worst case, literally, 6471
C(N SHG)N eutrosophicQuasi−ReverseStrictConnective

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ReverseStrictConnectiveSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ReverseStrictConnective = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ReverseStrictConnectiveSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Reverse Strict Connective. In other words, the least cardinality, the lower 6472
sharp bound for the cardinality, of a Neutrosophic type-result-Reverse Strict Connective is the cardinality 6473
of 6474

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ReverseStrictConnectiveSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ReverseStrictConnective = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ReverseStrictConnectiveSuperHyperP 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-Reverse Strict Connective 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-Reverse Strict Connective. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Reverse Strict Connective 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-Reverse Strict Connective. 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-Reverse Strict Connective decorates the Neut-
rosophic SuperHyperVertices don’t have received any Neutrosophic connections so as this
Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with the max-
imum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight.
The lower Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic
SuperHyperVertices have perfect Neutrosophic connections inside each of SuperHyperEdges and
the outside of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness
of the used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from
the fact that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the

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

the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Reverse Strict Connective. Since at least two Neutrosophic Supe-
rHyperVertices involve to make a title in the Neutrosophic background of the Neutrosophic
SuperHyperGraph. The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic
SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the Neutrosophic
version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious
Neutrosophic SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Neutrosophic adjective for the initial
Neutrosophic SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neut-
rosophic 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-Reverse Strict Connective has
the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Reverse
Strict Connective has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge. Assume
a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neut-
rosophic R-Reverse Strict Connective 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-Reverse Strict Connective” since the maximum Neutro-
sophic 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-Reverse Strict Connective 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-Reverse Strict Connective 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-Reverse Strict Connective.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-Reverse
Strict Connective. 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-Reverse Strict Connective is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Reverse Strict Connective but with
slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z
and
is formalized with mathematical literatures on the Neutrosophic R-Reverse Strict Connective. Let
E
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, 6475
Neutrosophic R-Reverse Strict Connective =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6476
Neutrosophic R-Reverse Strict Connective =

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Reverse Strict Connective where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Reverse Strict Connective, 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-Reverse Strict Connective is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Strict Connective 6477
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neut- 6478
rosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6479
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains the max- 6480
imum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic 6481

Reverse Strict Connective in some cases but the maximum number of the Neutrosophic SuperHy- 6482
perEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the 6483
Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Reverse Strict Connective. 6484
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6485
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6486
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6487
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6488
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6489
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6490
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6491
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6492
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s 6493
at least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyper- 6494
Vertices. Thus it forms a Neutrosophic quasi-R-Reverse Strict Connective where the Neutrosophic 6495
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6496
embedded R-Reverse Strict Connective. The SuperHyperNotions of embedded SuperHyperSet and 6497
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only 6498
don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected 6499
such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and 6500
they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic 6501
SuperHyperVertices are included in the minimum Neutrosophic style of the embedded Neut- 6502
rosophic R-Reverse Strict Connective. The interior types of the Neutrosophic SuperHyperVertices 6503
are deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by 6504
the interior Neutrosophic SuperHyperVertices. The common connections, more precise and 6505
more formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 6506
distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Reverse Strict Connect- 6507
ive. Thus Neutrosophic exterior SuperHyperVertices could be used only in one Neutrosophic 6508
SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior Neutrosophic 6509
SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic 6510
Reverse Strict Connective, there’s the usage of exterior Neutrosophic SuperHyperVertices since they’ve 6511
more connections inside more than outside. Thus the title “exterior” is more relevant than 6512
the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. Thus, the 6513
Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyperEle- 6514
ment has been ignored in the exploring to lead on the optimal case implying the Neutrosophic 6515
R-Reverse Strict Connective. The Neutrosophic R-Reverse Strict Connective with the exclusion of the exclu- 6516
sion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with 6517
other terms, the Neutrosophic R-Reverse Strict Connective with the inclusion of all Neutrosophic 6518
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Reverse 6519
Strict Connective. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6520
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the 6521
maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any 6522
given Neutrosophic quasi-R-Reverse Strict Connective minus all Neutrosophic SuperHypeNeighbor 6523
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6524
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6525
an Neutrosophic quasi-R-Reverse Strict Connective, minus all Neutrosophic SuperHypeNeighbor to 6526
some of them but not all of them. 6527

The main definition of the Neutrosophic R-Reverse Strict Connective has two titles. a Neutro- 6528
sophic quasi-R-Reverse Strict Connective and its corresponded quasi-maximum Neutrosophic R- 6529
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 6530
ber, there’s a Neutrosophic quasi-R-Reverse Strict Connective with that quasi-maximum Neutrosophic 6531
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 6532
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 6533
lead us to take the collection of all the Neutrosophic quasi-R-Reverse Strict Connectives for all Neut- 6534
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 6535
of the Neutrosophic Reverse Strict Connective ends up but this essence starts up in the terms of 6536
the Neutrosophic quasi-R-Reverse Strict Connective, again and more in the operations of collecting 6537
all the Neutrosophic quasi-R-Reverse Strict Connectives acted on the all possible used formations of 6538
the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic 6539
number is 6540
considered as the equivalence class for all corresponded quasi-R-Reverse Strict Connectives. Let 6541
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Reverse Strict Connective be a Neutro- 6542
sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Reverse Strict Connective. Then 6543
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Reverse Strict Connective ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Reverse Strict Connective is re-formalized 6544
and redefined as follows. 6545
GNeutrosophic Reverse Strict Connective ∈ ∪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 6546
definition for the Neutrosophic Reverse Strict Connective. 6547
GNeutrosophic Reverse Strict Connective =

{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 Reverse 6548
Strict Connective poses the upcoming expressions. 6549

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6550

= max zNeutrosophic Number

And then, 6551


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

6553

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


6554


6555


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6556
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6557
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6558
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Reverse 6559
Strict Connective” but, precisely, it’s the generalization of “Neutrosophic Quasi-Reverse Strict Connective” 6560
since “Neutrosophic Quasi-Reverse Strict Connective” happens “Neutrosophic Reverse Strict Connective” in 6561
a Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic 6562
SuperHyperNeighborhood” may not happens “Neutrosophic Reverse Strict Connective” in a Neutro- 6563
sophic SuperHyperGraph as initial framework and preliminarily background since there are 6564
some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly 6565
keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Reverse 6566
Strict Connective”, and “Neutrosophic Reverse Strict Connective” are up. 6567
Thus, let 6568
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6569

GNeutrosophic Reverse Strict Connective be a Neutrosophic number, a Neutrosophic SuperHyperNeigh- 6570
borhood and a Neutrosophic Reverse Strict Connective and the new terms are up. 6571
GNeutrosophic Reverse Strict Connective ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6572

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

6573

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6574

And with go back to initial structure, 6575
GNeutrosophic Reverse Strict Connective ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6576

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6577



6578


Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior
Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Strict Connective
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-Reverse Strict Connective.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Reverse Strict Connective. The
Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Reverse Strict Connective C(ESHG) for an Neutrosophic SuperHyper-

Graph 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 Reverse Strict Connective is related to the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Reverse Strict Connective is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse Strict Connective is a
Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Reverse Strict Connective is up. To sum
them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Reverse Strict

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Connective
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Reverse Strict Connective 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 Reverse
Strict Connective and it’s an Neutrosophic Reverse Strict Connective. 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 Reverse Strict Connective. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Reverse Strict Connective,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse
Strict Connective, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6579
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6580
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6581
type-SuperHyperSet called the 6582
“Neutrosophic R-Reverse Strict Connective” 6583

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6584
Neutrosophic R-Reverse Strict Connective, 6585
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHy-

perModeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel
and a Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic
stable embedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic R-Reverse Strict Connective amid those obvious simple Neutro-
sophic type-SuperHyperSets of the Neutrosophic Reverse Strict Connective, 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-Reverse Strict Connective. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Reverse Strict Connective is the cardinality of
6586
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6587
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Strict Con- 6588
nective if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6589
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6590
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6591
amount of them. 6592
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6593
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6594
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6595
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6596
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6597
Consider there’s a Neutrosophic R-Reverse Strict Connective with the least cardinality, the lower 6598
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6599
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6600
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6601
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6602
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Reverse Strict Connective. Since it doesn’t 6603
have 6604
6605

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6606

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6607
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6608
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6609
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Reverse 6610
Strict Connective. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6611
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6612

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6613
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6614
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6615
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6616
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6617
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6618
obvious Neutrosophic R-Reverse Strict Connective, VESHE is up. The obvious simple Neutrosophic 6619
type-SuperHyperSet of the Neutrosophic R-Reverse Strict Connective, VESHE , is a Neutrosophic Supe- 6620
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6621
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6622
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6623
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6624

a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a 6625
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, 6626
in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Reverse 6627
Strict Connective only contains all interior Neutrosophic SuperHyperVertices and all exterior 6628
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6629
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6630
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6631
to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6632
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6633
The SuperHyperNotion, namely, Reverse Strict Connective, is up. There’s neither empty SuperHy- 6634
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6635
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6636

the Neutrosophic Reverse Strict Connective. The Neutrosophic SuperHyperSet of Neutrosophic 6637
SuperHyperEdges[SuperHyperVertices], 6638

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


Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6640

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Reverse Strict Connective C(ESHG) for an Neutrosophic SuperHyperGraph 6641

ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6642
6643
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6645
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6646
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6647
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6648
non-obvious Neutrosophic Reverse Strict Connective is up. The obvious simple Neutrosophic type- 6649
SuperHyperSet called the Neutrosophic Reverse Strict Connective is a Neutrosophic SuperHyperSet 6650
includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6651
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6652

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 SuperHyper- 6653
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse 6654
Strict Connective is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6655
SuperHyperEdges[SuperHyperVertices], 6656

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 Reverse 6657

Strict Connective. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6658
perEdges[SuperHyperVertices], 6659

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Reverse Strict Connective C(ESHG) for an Neutrosophic SuperHyperGraph 6660
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6661

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6662
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse Strict Connective 6663
and it’s an Neutrosophic Reverse Strict Connective. Since it’s 6664
6665
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6667

HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6668
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6669
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6670

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Reverse Strict Connective , 6671

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 Reverse Strict 6672
, not:
Connective 6673

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

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- 6675
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6676
Neutrosophic type-SuperHyperSet called the 6677
“Neutrosophic Reverse Strict Connective ” 6678
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6679
Neutrosophic ,
is only and only 6681

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


= az s + bz t .
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6682

CHAPTER 31 6683
The Neutrosophic Departures on The 6684
Theoretical Results Toward Theoretical 6685
Motivations 6686
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6687
Neutrosophic SuperHyperClasses. 6688
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6689

|E |
{E3i+2 }i=0ESHP .
| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
=z 2i+2 i=0 .
Proof. Let 6690
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6691
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
327
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6692

6696
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6697
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6698
SuperHyperModel (31.1), is the SuperHyperReverse Strict Connective. 6699
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6700

|E |
{E3i+2 }i=0ESHP .


| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
=z 2i+2 i=0 .
Proof. Let 6701
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6702
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). 6703

6707
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6708
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6709
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperReverse Strict Connective. 6710

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

Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic Example (42.0.7) 136NSHG19a
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6711

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 6712
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6713
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic Example (42.0.9) 136NSHG20a
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6714

6718
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6719
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6720
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6721
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6722
the Neutrosophic SuperHyperReverse Strict Connective. 6723
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6724

Then 6725

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
=z 2i+2 i=0 .
Proof. Let 6726
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6727
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). 6728

are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6734
P :

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperReverse Strict Connective in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperReverse Strict Connective taken from a connected Neutrosophic SuperHyperBi- 6736
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6737
of-SuperHyperPart SuperHyperEdges are attained in any solution 6738
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6740
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6741
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6742
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6743

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6744
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6746

Then 6747

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
=z 2i+2 i=0 .
Proof. Let 6748
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6749
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperReverse Strict Connective taken from a connected Neutrosophic SuperHyper- 6750
Multipartite ESHM : (V, E). There’s a new way to redefine as 6751

are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6756
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6758
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6759
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6763
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6764
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6765
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6766
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperReverse Strict Connective. 6767
6768
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6769

Then, 6770

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 6771
P :
CEN T ER, E2∗
6772
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperReverse Strict Connective taken from a connected Neutrosophic SuperHyper- 6773
Wheel ESHW : (V, E). There’s a new way to redefine as 6774

Then there’s at least one SuperHyperReverse Strict Connective. Thus the notion of quasi isn’t up 6777
and the SuperHyperNotions based on SuperHyperReverse Strict Connective could be applied. The 6778
unique embedded SuperHyperReverse Strict Connective proposes some longest SuperHyperReverse Strict 6779
Connective excerpt from some representatives. The latter is straightforward. 6780
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6781
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6782
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6783
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6784
SuperHyperModel (31.6), is the Neutrosophic SuperHyperReverse Strict Connective. 6785

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperReverse Strict Connective in the Neutrosophic Example (42.0.15) 136NSHG23a

CHAPTER 32 6786
The Surveys of Mathematical Sets On 6787
The Results But As The Initial Motivation 6788
For the SuperHyperReverse Strict Connective, Neutrosophic SuperHyperReverse Strict Connective, and the 6789
Neutrosophic SuperHyperReverse Strict Connective, some general results are introduced. 6790
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperReverse Strict Connective is “redefined” 6791
on the positions of the alphabets. 6792
Corollary 32.0.2. Assume Neutrosophic SuperHyperReverse Strict Connective. Then 6793
N eutrosophic SuperHyperReverseStrictConnective =
{theSuperHyperReverseStrictConnectiveof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseStrictConnective
|N eutrosophiccardinalityamidthoseSuperHyperReverseStrictConnective. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6794
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6795
the neutrality, for i = 1, 2, 3, respectively. 6796
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6797
alphabet. Then the notion of Neutrosophic SuperHyperReverse Strict Connective and SuperHyperReverse 6798
Strict Connective coincide. 6799
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6800
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6801
SuperHyperReverse Strict Connective if and only if it’s a SuperHyperReverse Strict Connective. 6802
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6803
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 6804
Strict Connective if and only if it’s a longest SuperHyperReverse Strict Connective. 6805
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6806
identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Strict Connective is its 6807
339
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Strict Connective, 6809

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6810
identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Strict Connective is its 6811
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6813
perReverse Strict Connective isn’t well-defined if and only if its SuperHyperReverse Strict Connective isn’t 6814
well-defined. 6815
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6816

Neutrosophic SuperHyperReverse Strict Connective isn’t well-defined if and only if its SuperHyperReverse 6817

Neutrosophic SuperHyperReverse Strict Connective isn’t well-defined if and only if its SuperHyperReverse 6821
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic Supe- 6823
rHyperReverse Strict Connective is well-defined if and only if its SuperHyperReverse Strict Connective is 6824
well-defined. 6825
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6826
Neutrosophic SuperHyperReverse Strict Connective is well-defined if and only if its SuperHyperReverse 6827
Strict Connective is well-defined. 6828

Neutrosophic SuperHyperReverse Strict Connective is well-defined if and only if its SuperHyperReverse 6831
Strict Connective is well-defined. 6832
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6833
(i) : the dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6834
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6835
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6836
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6837
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6838
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Strict Connective. 6839
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6840
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Strict Connective; 6843

Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 6847

independent SuperHyperSet is 6848
(iii) : the connected SuperHyperDefensive SuperHyperReverse Strict Connective; 6851
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6855

Graph which is a SuperHyperReverse Strict Connective/SuperHyperPath. Then V is a maximal 6856
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Connective; 6860
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Connective; 6861
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Connective; 6862
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6864
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6865
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6869
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6870
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Connective; 6871
Graph which is a SuperHyperReverse Strict Connective/SuperHyperPath. Then the number of 6874

(i) : the SuperHyperReverse Strict Connective; 6875
(ii) : the SuperHyperReverse Strict Connective; 6876
(iii) : the connected SuperHyperReverse Strict Connective; 6877
(iv) : the O(ESHG)-SuperHyperReverse Strict Connective; 6878
(v) : the strong O(ESHG)-SuperHyperReverse Strict Connective; 6879
(vi) : the connected O(ESHG)-SuperHyperReverse Strict Connective. 6880
coincide. 6882

Graph which is a SuperHyperWheel. Then the number of 6884
(i) : the dual SuperHyperReverse Strict Connective; 6885
(ii) : the dual SuperHyperReverse Strict Connective; 6886
(iii) : the dual connected SuperHyperReverse Strict Connective; 6887
(iv) : the dual O(ESHG)-SuperHyperReverse Strict Connective; 6888
(v) : the strong dual O(ESHG)-SuperHyperReverse Strict Connective; 6889
(vi) : the connected dual O(ESHG)-SuperHyperReverse Strict Connective. 6890
coincide. 6892
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6893

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6905
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6906
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6907
SuperHyperPart is a 6908
(iv) : δ-SuperHyperDefensive SuperHyperReverse Strict Connective; 6912
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Strict Connective; 6913
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Strict Connective. 6914
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6916

plete SuperHyperMultipartite. Then Then the number of 6917
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6924
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6925
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6927
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6928
(iv) : SuperHyperReverse Strict Connective; 6932

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6935
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6936
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6937
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6938

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 6939
t>
2


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6946
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6947
of dual 6948
(iv) : 0-SuperHyperDefensive SuperHyperReverse Strict Connective; 6952

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6956

SuperHyperReverse Strict Connective/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6958
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6959
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Connective; 6963
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Connective; 6964
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Connective. 6965


SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number 6967
is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), 6968
t>
2
in the setting of a dual 6969


Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6976
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6977
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6978
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6979
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6980

a dual SuperHyperDefensive SuperHyperReverse Strict Connective, then ∀v ∈ V \ S, ∃x ∈ S such that 6981
(i) v ∈ Ns (x); 6982
(ii) vx ∈ E. 6983
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6984

a dual SuperHyperDefensive SuperHyperReverse Strict Connective, then 6985
(i) S is SuperHyperReverse Strict Connective set; 6986
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6987
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6988
(i) Γ ≤ O; 6989
(ii) Γs ≤ On . 6990
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6991
connected. Then 6992
(i) Γ ≤ O − 1; 6993
(ii) Γs ≤ On − Σ3i=1 σi (x). 6994
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6995

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6999
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 7000
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 7002
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Strict Connective; 7003
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 7004
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7005
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7006
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Strict Connective. Then 7008
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 7009

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 7011
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 7012
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 7013
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse Strict Connective. Then 7015

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7019
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7020
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 7022
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Strict Connective; 7023
(ii) Γ = 1; 7024
(iii) Γs = Σ3i=1 σi (c); 7025
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Strict Connective. 7026
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 7027

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 7028
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 7030
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 7031
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 7032
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 7034
b n c+1
2
Connective; 7036
(ii) Γ = b n2 c + 1; 7037

b n c+1 ; 7038
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperReverse 7039
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 7041
bnc
2
Connective; 7043
(ii) Γ = b n2 c; 7044

bnc ; 7045
S={vi }i=1
bnc
is only a dual maximal SuperHyperDefensive SuperHy- 7046
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 7048

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7049
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperReverse 7050

Strict Connective for N SHF; 7051
(ii) Γ = m for N SHF : (V, E); 7052
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7053
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse Strict 7054
Connective for N SHF : (V, E). 7055
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 7056
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7057

b n c+1
is a dual maximal SuperHyperDefensive SuperHy- 7058
perReverse Strict Connective for N SHF; 7059
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 7060
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 7061
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperReverse Strict Connective 7062
for N SHF : (V, E). 7063
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7064

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7065
bnc
Connective for N SHF : (V, E); 7067
(ii) Γ = b n2 c for N SHF : (V, E); 7068
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 7069
S={vi }i=1
bnc
2
are only dual maximal SuperHyperReverse Strict Connective for 7070
N SHF : (V, E). 7071
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7074

SuperHyperReverse Strict Connective, then S is an s-SuperHyperDefensive SuperHyperReverse Strict 7075
Connective; 7076

SuperHyperReverse Strict Connective, then S is a dual s-SuperHyperDefensive SuperHyperReverse 7078
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7082
SuperHyperReverse Strict Connective, then S is an s-SuperHyperPowerful SuperHyperReverse Strict 7083

Connective; 7084

SuperHyperReverse Strict Connective, then S is a dual s-SuperHyperPowerful SuperHyperReverse 7086
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7088

(i) if ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 7092
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 7094

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

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7098

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperReverse 7130
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 7132

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

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


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

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

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


CHAPTER 33 7148
Neutrosophic Applications in Cancer’s 7149
Neutrosophic Recognition 7150
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7151
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7152
disease is considered and as the consequences of the model, some parameters are used. The cells 7153
are under attack of this disease but the moves of the cancer in the special region are the matter 7154
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7155
treatments for this Neutrosophic disease. 7156
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7157
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7158
term Neutrosophic function. 7159
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7160
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7161
move from the cancer is identified by this research. Sometimes the move of the cancer 7162
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 7163
about the moves and the effects of the cancer on that region; this event leads us to 7164
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7165
perception on what’s happened and what’s done. 7166
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7167
known and they’ve got the names, and some general Neutrosophic models. The moves 7168
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7169
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperReverse 7170
Strict Connective, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 7171
perWheel). The aim is to find either the Neutrosophic SuperHyperReverse Strict Connective 7172
or the Neutrosophic SuperHyperReverse Strict Connective in those Neutrosophic Neutrosophic 7173
SuperHyperModels. 7174
351
CHAPTER 34 7175
Case 1: The Initial Neutrosophic Steps 7176
Toward Neutrosophic 7177
SuperHyperBipartite as Neutrosophic 7178
SuperHyperModel 7179
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7180
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7181
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

353
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7182
perBipartite is obtained. 7183
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7184
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7185
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7186
(34.1), is the Neutrosophic SuperHyperReverse Strict Connective. 7187

CHAPTER 35 7188
Case 2: The Increasing Neutrosophic 7189
Steps Toward Neutrosophic 7190
SuperHyperMultipartite as 7191
Neutrosophic SuperHyperModel 7192
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7193
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7194
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7195
perMultipartite is obtained. 7196
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7197
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

355
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 7198

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7199
Neutrosophic SuperHyperReverse Strict Connective. 7200

CHAPTER 36 7201
Wondering Open Problems But As The 7202
Directions To Forming The Motivations 7203
In what follows, some “problems” and some “questions” are proposed. 7204
The SuperHyperReverse Strict Connective and the Neutrosophic SuperHyperReverse Strict Connective are 7205
defined on a real-world application, titled “Cancer’s Recognitions”. 7206
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7207
recognitions? 7208
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperReverse Strict Connective 7209
and the Neutrosophic SuperHyperReverse Strict Connective? 7210
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7211
them? 7212
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperReverse Strict 7213
and the Neutrosophic SuperHyperReverse Strict Connective?
Connective 7214
Problem 36.0.5. The SuperHyperReverse Strict Connective and the Neutrosophic SuperHyperReverse 7215
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperReverse Strict Connective, are there else? 7217
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7218
Numbers types-results? 7219
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7220
the multiple types of SuperHyperNotions? 7221
357
CHAPTER 37 7222
Conclusion and Closing Remarks 7223
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7224
research are illustrated. Some benefits and some advantages of this research are highlighted. 7225
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 7226
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperReverse 7227
Strict Connective. For that sake in the second definition, the main definition of the Neutrosophic 7228
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 7229
for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHy- 7230
perReverse Strict Connective, finds the convenient background to implement some results based on 7231
that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 7232
research on the modeling of the regions where are under the attacks of the cancer to recognize 7233
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 7234
on the SuperHyperNotion, SuperHyperReverse Strict Connective, the new SuperHyperClasses and 7235
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 7236
SuperHyperReverse Strict Connective and the Neutrosophic SuperHyperReverse Strict Connective. The 7237
clarifications, instances and literature reviews have taken the whole way through. In this 7238
research, the literature reviews have fulfilled the lines containing the notions and the results. 7239
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 7240
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 7241
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 7242
of the moves of the cancer in the longest and strongest styles with the formation of the design 7244
and the architecture are formally called “ SuperHyperReverse Strict Connective” in the themes of 7245
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 7246
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 7247
for this research are, figured out, pointed out and spoken out. 7248
359
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperReverse Strict Connective
3. Neutrosophic SuperHyperReverse Strict Connective 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7249
Neutrosophic SuperHyperDuality But As 7250
Super Forms 7252
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7253

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7257

Va ∈ Ei , Ej ; 7258
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7259

Va ∈ Ei , Ej and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7260
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7261

Vi , Vj ∈ Ea ; 7262
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7263

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7264
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7265

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7266
sophic rv-SuperHyperDuality. 7267
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7268

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7271

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7273
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7274
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7275
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7276
361
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7278

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7280
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7281
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7282
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7283
form the Neutrosophic SuperHyperDuality; 7284
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7285
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7286

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7287
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7288
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7289
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7290
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7292
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7294

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7296
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7297
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7298
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7302
coefficient; 7303
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7304

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7306
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7307
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7308
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7309
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7311

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7312
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7313
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7314
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7315
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7316
that they form the Neutrosophic SuperHyperDuality; 7317
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7318

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7319
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7320

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7322
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7325
power is corresponded to its Extreme coefficient; 7326
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7327

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7329

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7335
coefficient. 7336
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7337
the mentioned Neutrosophic Figures in every Neutrosophic items. 7338

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7340
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7341
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7342
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7343
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7344
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7345
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7346
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.

E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7350
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7351
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7352
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7353
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7354

every given Neutrosophic SuperHyperDuality. 7355




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7415
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 7417


the Neutrosophic SuperHyperDuality. 7426
Then 7428
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 7429
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7435
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7438

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7439
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7448

(V, E). Then 7449

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 7450
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7451


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

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

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7467
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7468
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7469
Then, 7470
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 7471
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 7472


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7477
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7478
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7484

CHAPTER 39 7485
Neutrosophic SuperHyperJoin But As 7486
Super Forms 7488
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7489

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7493
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7495

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = 7496
|Ej |NEUTROSOPHIC CARDINALITY ; 7497
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7498

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7500

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7501
|Vj |NEUTROSOPHIC CARDINALITY ; 7502
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7503

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7504
rv-SuperHyperJoin. 7505
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7506

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

375

Extreme SuperHyperJoin; 7515
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7516

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7518
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7519
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7520
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7521
Neutrosophic SuperHyperJoin; 7522
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7523

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7524
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7525
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7530
coefficient; 7531
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7532

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7533
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7534
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7535
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7536

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7539
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7540
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7541

Extreme SuperHyperJoin; 7547
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7548

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7550
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7551
Neutrosophic SuperHyperJoin; 7554

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7555

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7557

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7562
its Extreme coefficient; 7563
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7564

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7566
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7567

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7572
coefficient. 7573
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7577

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7578

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. 7592




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7643

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7652
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 7654


the Neutrosophic SuperHyperJoin. 7663
Then 7665
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 7666
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 7672
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7674

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


(V, E). Then 7685

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7687


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 7692
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. 7703

Then, 7705

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

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


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7711
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7712
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7713
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7718

CHAPTER 40 7719
Neutrosophic SuperHyperPerfect But As 7720
Super Forms 7722
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7723

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7734
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7735

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7736
rv-SuperHyperPerfect. 7737
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7738

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7743
389
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7748

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7750
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7751
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7752
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7753
form the Neutrosophic SuperHyperPerfect; 7754
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7755

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7756
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7757
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7760
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7764

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7766
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7772
coefficient; 7773
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7774

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7782
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7783
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7784
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7785
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7786
that they form the Neutrosophic SuperHyperPerfect; 7787
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7788

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7790

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7793
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7797

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7799

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7805
coefficient. 7806

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7810

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. 7825





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7876
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 7878
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7896
Then 7898
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 7899
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 7903
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7904
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7905
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7908

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

(V, E). Then 7919

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



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 7924
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 7925
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 7926
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. 7938
Then, 7940
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7942


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7945
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7946
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7947
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7948
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7954

CHAPTER 41 7955
Neutrosophic SuperHyperTotal But As 7956
Super Forms 7958
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7959

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7963

Va ∈ Ei , Ej ; 7964
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7965

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7966
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7967

Vi , Vj ∈ Ea ; 7968
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7969

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7970
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7971

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7972
rv-SuperHyperTotal. 7973
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7974

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7979
Extreme SuperHyperTotal; 7983
403
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7984

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7986
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7987
Neutrosophic SuperHyperTotal; 7990
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7991
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7992

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7993
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7998
coefficient; 7999
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8000
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8001

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8002
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 8003
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8004
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 8007
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 8008
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8009

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8011
Extreme SuperHyperTotal; 8015
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8016

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8018
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 8019
Neutrosophic SuperHyperTotal; 8022
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 8023

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8024
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 8025

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 8030
its Extreme coefficient; 8031
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8032
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8033

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8034
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 8035
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8036
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8037
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8038
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8039
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8040

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8044

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. 8059




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8110
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 8112
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. 8119
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 8121


the Neutrosophic SuperHyperTotal. 8130
Then 8132
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 8133
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8139
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8141

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8152

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8154


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8159
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. 8170
Then, 8172
∗
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 8173
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8174


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8178
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8179
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8180
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8186

CHAPTER 42 8187
Neutrosophic SuperHyperConnected But 8188
As The Extensions Excerpt From Dense 8189
And Super Forms 8190
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8191

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8195
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8196
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8197

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8198
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8199
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8200

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 8201
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 8202

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 8203
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8204
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8205
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8206
rosophic rv-SuperHyperConnected. 8207
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8208

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8211
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8212
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8213
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 8214
417
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 8215
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 8216
form the Extreme SuperHyperConnected; 8217
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8218

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8219
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8220
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8221
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8222
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8223

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8224
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8225
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8226

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8227
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8228
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8229
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8234

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8235
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8236
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8237
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8238
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8239
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8240

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8241
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8242
Neutrosophic coefficient; 8243
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8244

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8246
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8247
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8248
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8249
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8250
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8251

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8253
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8254
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8255
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8256
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8257

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8258

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8261
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8262

and the Extreme power is corresponded to its Extreme coefficient; 8266
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8267

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8270
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8271
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8272
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8273

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8274
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8275
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8279
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8280
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8282
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8283

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8284
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8285
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8286
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. 8294


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 .
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 8338
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. 8345
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 8347
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. 8354
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 8356



the Neutrosophic SuperHyperConnected. 8365
Then 8367
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 8368
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 8373
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8374
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8377

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8388
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 8389
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8390


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8394
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8395
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8396
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. 8407
Then, 8409
∗
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 8410
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8411


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8414
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8415
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8416
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8417
some representatives. The latter is straightforward. 8418
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8423

CHAPTER 43 8424
Background 8425
431



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 8495
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 8496
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8497
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 8498
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 8501
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 8502
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8503
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 8504

(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 8505

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 8506
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 8507
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 8508
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 8511

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 8512
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 8513
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 8514
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8515
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyper- 8516
Graph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” 8517

in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees 8518
on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 8519
Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyperDominating and SuperHy- 8520
perResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 8521
Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatch- 8522
ing By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic 8523

SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 8524
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 8525
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 8526
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 8527
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 8528
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 8529
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 8530
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 8531
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 8532
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 8533
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 8534
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 8535
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 8536
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 8537
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 8538
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 8539
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 8540

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neut- 8541
(2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 8544
(Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 8545
1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 8546

on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), 8547
“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Supe- 8548
rHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 8549
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 8550

(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 8551
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 8552
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 8553
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 8554
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 8555
(2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 8556
HG285; HG286; HG287; HG288; HG289], there are some endeavors to formalize the basic 8577
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 8578
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 8579



HG280; HG281; HG282; HG283; HG284; HG285; HG286; HG287; HG288; HG289] 8632
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8633



HG177b; HG178b; HG179b; HG180b; HG181b; HG182b; HG183b; HG184b]. Two 8647
popular scientific research books in Scribd in the terms of high readers, 4728 and 5721 respect- 8648
ively, on neutrosophic science is on [HG32b; HG44b]. 8649

Bibliography 8650
10.33140/JMTCM.01.03.09) 8673
437



10.20944/preprints202301.0282.v1). 8689

10.20944/preprints202301.0267.v1). 8692

(doi: 10.20944/preprints202301.0265.v1). 8697
prints202301.0262.v1). 8701
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8707

prints202301.0105.v1). 8710

Preprints 2023, 2023010044 8716
10.20944/preprints202301.0043.v1). 8719

(doi: 10.20944/preprints202212.0549.v1). 8728

(doi: 10.20944/preprints202212.0500.v1). 8735
(doi: 10.5281/zenodo.8078445). 8744

2023, (doi: 10.5281/zenodo.8078543). 8747
10.5281/zenodo.8076416). 8750
2023, (doi: 10.5281/zenodo.8076399). 8753
(doi: 10.5281/zenodo.8072171). 8756

2023, (doi: 10.5281/zenodo.8072267). 8759
10.5281/zenodo.8067384). 8762
2023, (doi: 10.5281/zenodo.8067409). 8765
10.5281/zenodo.8061927). 8768
10.5281/zenodo.8062016). 8771
10.5281/zenodo.8057696). 8774
2023, (doi: 10.5281/zenodo.8057753). 8777
10.5281/zenodo.8052893). 8780
2023, (doi: 10.5281/zenodo.8052925). 8783
10.5281/zenodo.8051346). 8786
10.5281/zenodo.8051360). 8789
10.5281/zenodo.8025707). 8792
10.5281/zenodo.8027275). 8795

odo.8017246). 8798
10.5281/zenodo.8020128). 8801
odo.7978571). 8804
10.5281/zenodo.7978857). 8807
10.5281/zenodo.7940830). 8810
10.5281/zenodo.7943578). 8813
odo.7916595). 8816
odo.7923632). 8819
(doi: 10.5281/zenodo.7904698). 8822
2023, (doi: 10.5281/zenodo.7904671). 8825
10.5281/zenodo.7871026). 8834

2023, (doi: 10.5281/zenodo.7874647). 8837
10.5281/zenodo.7857856). 8840
2023, (doi: 10.5281/zenodo.7857841). 8843
10.5281/zenodo.7853867). 8852
10.5281/zenodo.7853922). 8855
(doi: 10.5281/zenodo.7851519). 8858
(doi: 10.5281/zenodo.7851550). 8861
10.5281/zenodo.7834229). 8870
10.5281/zenodo.7834261). 8873

10.5281/zenodo.7824560). 8876
(doi: 10.5281/zenodo.7824623). 8879
2023, (doi: 10.5281/zenodo.7809365). 8890

2023, (doi: 10.5281/zenodo.7809358). 8893
10.5281/zenodo.7809219). 8896
10.5281/zenodo.7809328). 8899
2023, (doi: 10.5281/zenodo.7806767). 8902
2023, (doi: 10.5281/zenodo.7806838). 8905

10.5281/zenodo.7799902). 8914
(doi: 10.5281/zenodo.7804218). 8917
(doi: 10.5281/zenodo.7796334). 8920
10.5281/zenodo.7791952). 8926
10.5281/zenodo.7791982). 8929
10.5281/zenodo.7790026). 8932
10.5281/zenodo.7790052). 8935
2023, (doi: 10.5281/zenodo.7787066). 8938
10.5281/zenodo.7781476). 8944
10.5281/zenodo.7783082). 8947
10.5281/zenodo.7777857). 8950

10.5281/zenodo.7779286). 8953
(doi: 10.5281/zenodo.7771831). 8956
2023, (doi: 10.5281/zenodo.7772468). 8959
10.13140/RG.2.2.20913.25446). 8962
odo.7764916). 8965
10.13140/RG.2.2.11770.98247). 8968
10.13140/RG.2.2.12400.12808). 8971
2023, (doi: 10.13140/RG.2.2.22545.10089). 8974
10.13140/RG.2.2.11377.76644). 8980
10.13140/RG.2.2.23750.96329). 8983
10.13140/RG.2.2.31366.24641). 8986
10.13140/RG.2.2.34721.68960). 8989

2023, (doi: 10.13140/RG.2.2.30212.81289). 8992
10.13140/RG.2.2.24288.35842). 8998
10.13140/RG.2.2.32467.25124). 9001
10.13140/RG.2.2.31025.45925). 9004
10.13140/RG.2.2.17184.25602). 9007
10.13140/RG.2.2.23423.28327). 9010
10.13140/RG.2.2.28456.44805). 9013
10.13140/RG.2.2.23525.68320). 9016
10.13140/RG.2.2.20170.24000). 9019
10.13140/RG.2.2.36475.59683). 9022
10.13140/RG.2.2.29764.71046). 9025
2023, (doi: 10.13140/RG.2.2.18780.87683). 9028

10.13140/RG.2.2.26134.01603). 9034
10.13140/RG.2.2.27392.30721). 9037
10.13140/RG.2.2.33028.40321). 9040
10.13140/RG.2.2.21389.20966). 9043
10.13140/RG.2.2.16356.04489). 9046
10.13140/RG.2.2.21756.21129). 9049
10.13140/RG.2.2.30983.68009). 9052
10.13140/RG.2.2.28552.29445). 9055
(doi: 10.13140/RG.2.2.10936.21761). 9058
10.13140/RG.2.2.35105.89447). 9061
(doi: 10.13140/RG.2.2.30072.72960). 9064
10.13140/RG.2.2.31147.52003). 9067

10.13140/RG.2.2.32825.24163). 9070
10.13140/RG.2.2.13059.58401). 9073
10.13140/RG.2.2.11172.14720). 9076
2023, (doi: 10.13140/RG.2.2.22011.80165). 9079
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9082
2023, (doi: 10.13140/RG.2.2.10493.84962). 9085
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9088
2023, (doi: 10.13140/RG.2.2.19944.14086). 9091
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9094
(doi: 10.13140/RG.2.2.33103.76968). 9097
(doi: 10.13140/RG.2.2.23037.44003). 9100
(doi: 10.13140/RG.2.2.35646.56641). 9103
10.13140/RG.2.2.18030.48967). 9106

(doi: 10.13140/RG.2.2.13973.81121). 9109
2023, (doi: 10.13140/RG.2.2.34106.47047). 9112
2023, (doi: 10.13140/RG.2.2.31956.88961). 9118
2023, (doi: 10.13140/RG.2.2.15179.67361). 9121
10.13140/RG.2.2.21510.45125). 9124
2023, (doi: 10.13140/RG.2.2.13121.84321). 9127
10.13140/RG.2.2.11758.69441). 9130
2023, (doi: 10.13140/RG.2.2.31891.35367). 9133
10.13140/RG.2.2.19360.87048). 9136
10.13140/RG.2.2.32363.21286). 9139
10.13140/RG.2.2.23266.81602). 9142
10.13140/RG.2.2.19911.37285). 9145

10.13140/RG.2.2.11050.90569). 9148
2023, (doi: 10.13140/RG.2.2.17761.79206). 9151
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9157
(doi: 10.13140/RG.2.2.30182.50241). 9160


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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 9202
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9205


2023,(doi: 10.13140/RG.2.2.36745.93289). 9219

10.20944/preprints202301.0282.v1). 9226
10.20944/preprints202301.0267.v1).). 9229
(doi: 10.20944/preprints202301.0265.v1). 9234
prints202301.0262.v1). 9238
2023010224, (doi: 10.20944/preprints202301.0224.v1). 9244

10.13140/RG.2.2.35061.65767). 9247
10.13140/RG.2.2.18494.15680). 9251
10.13140/RG.2.2.32530.73922). 9255
10.13140/RG.2.2.15897.70243). 9259
10.13140/RG.2.2.32530.73922). 9263

prints202301.0105.v1). 9266

10.13140/RG.2.2.23172.19849). 9273
10.13140/RG.2.2.17385.36968). 9283

Preprints 2023, 2023010044 9286
10.20944/preprints202301.0043.v1). 9289
2023, (doi: 10.13140/RG.2.2.28945.92007). 9292

10.13140/RG.2.2.35774.77123). 9298

10.13140/RG.2.2.29430.88642). 9304

(doi: 10.20944/preprints202212.0549.v1). 9310
10.13140/RG.2.2.19380.94084). 9313

(doi: 10.20944/preprints202212.0500.v1). 9324
10.13140/RG.2.2.20993.12640). 9327


10.13140/RG.2.2.29173.86244). 9342

2023 (doi: 10.5281/zenodo.8076449). 9349
2023 (doi: 10.5281/zenodo.8067469). 9353
(doi: 10.5281/zenodo.8062076). 9355
2023 (doi: 10.5281/zenodo.8052976). 9359
(doi: 10.5281/zenodo.8051368). 9361
(doi: 10.5281/zenodo.8027488). 9363
10.5281/zenodo.8020181). 9365
10.5281/zenodo.7978921). 9367
odo.7943878). 9369
10.5281/zenodo.7943871). 9371
10.5281/zenodo.7923786). 9373
2023 (doi: 10.5281/zenodo.7905287). 9375


2023 (doi: 10.5281/zenodo.7874677). 9379
(doi: 10.5281/zenodo.7857906). 9381
2023 (doi: 10.5281/zenodo.7856329). 9383
10.5281/zenodo.7854561). 9385
2023 (doi: 10.5281/zenodo.7851893). 9387

(doi: 10.5281/zenodo.7835063). 9391
(doi: 10.5281/zenodo.7826705). 9393
2023 (doi: 10.5281/zenodo.7820680). 9395
10.5281/zenodo.7812750). 9397

2023 (doi: 10.5281/zenodo.7807782). 9403
2023 (doi: 10.5281/zenodo.7804449). 9405

(doi: 10.5281/zenodo.7792307). 9409
(doi: 10.5281/zenodo.7790728). 9411

2023 (doi: 10.5281/zenodo.7787712). 9413
10.5281/zenodo.7783791). 9415
10.5281/zenodo.7780123). 9417
(doi: 10.5281/zenodo.7773119). 9419
odo.7637762). 9421
10.5281/zenodo.7766174). 9423
10.5281/zenodo.7762232). 9425
(doi: 10.5281/zenodo.7758601). 9427
10.5281/zenodo.7754661). 9429
10.5281/zenodo.7750995) . 9431
(doi: 10.5281/zenodo.7749875). 9433
10.5281/zenodo.7747236). 9435
10.5281/zenodo.7742587). 9437
(doi: 10.5281/zenodo.7738635). 9439
10.5281/zenodo.7734719). 9441
10.5281/zenodo.7730484). 9443
(doi: 10.5281/zenodo.7730469). 9445
10.5281/zenodo.7722865). 9447

odo.7713563). 9449
odo.7709116). 9451
10.5281/zenodo.7706415). 9453
10.5281/zenodo.7706063). 9455
10.5281/zenodo.7701906). 9457
odo.7700205). 9459
10.5281/zenodo.7694876). 9461
10.5281/zenodo.7679410). 9463
10.5281/zenodo.7675982). 9465
10.5281/zenodo.7672388). 9467
odo.7668648). 9469
10.5281/zenodo.7662810). 9471
10.5281/zenodo.7659162). 9473
odo.7653233). 9475
odo.7653204). 9477
odo.7653142). 9479
odo.7653117). 9481

odo.7651687). 9484
odo.7651619). 9486
odo.7651439). 9488
odo.7650729). 9490
odo.7647868). 9492
odo.7647017). 9494
odo.7644894). 9496
odo.7632923). 9499
odo.7623459). 9501
10.5281/zenodo.7606416). 9503
10.5281/zenodo.7606416). 9505
odo.7606404). 9507
10.5281/zenodo.7580018). 9509
odo.7580018). 9511
odo.7580018). 9513
odo.7579929). 9515
10.5281/zenodo.7563170). 9517

odo.7563164). 9519
odo.7563160). 9521
odo.7563160). 9523
10.5281/zenodo.7563160). 9525
10.5281/zenodo.7557063). 9527
10.5281/zenodo.7557009). 9529
10.5281/zenodo.7539484). 9531
10.5281/zenodo.7523390). 9533
10.5281/zenodo.7523390). 9535
10.5281/zenodo.7523390). 9537
odo.7574952). 9539
10.5281/zenodo.7574992). 9541
odo.7523357). 9543
10.5281/zenodo.7523357). 9545
10.5281/zenodo.7504782). 9547
10.5281/zenodo.7504782). 9549
10.5281/zenodo.7504782). 9551
10.5281/zenodo.7499395). 9553

odo.7499395). 9555
10.5281/zenodo.7499395). 9557
10.5281/zenodo.7497450). 9559
10.5281/zenodo.7497450). 9561
10.5281/zenodo.7494862). 9563
odo.7494862). 9565
10.5281/zenodo.7494862). 9567
10.5281/zenodo.7493845). 9569
odo.7493845). 9571
10.5281/zenodo.7493845). 9573
odo.7539484). 9575
odo.7523390). 9577
odo.7523357). 9579
odo.7504782). 9581
odo.7499395). 9583
odo.7497450). 9585
odo.7494862). 9587
odo.7493845). 9589

odo.7480110). 9591
odo.7378758). 9593
odo.6320305). 9595
odo.6677173). 9597

CHAPTER 44 9598
Books’ Contributions 9599
“Books’ Contributions”: | Featured Threads 9600

The following references are cited by chapters. 9601
9602
[Ref290] 9603
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Strict Connect- 9604
ive In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9605
10.5281/zenodo.8080068). 9606
9607
[Ref291] 9608
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9609
Reverse Strict Connective As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 10.5281/zen- 9610
odo.8080100). 9611
9612
The links to the contributions of this scientific research book are listed below. 9613
[HG290] 9614
10.5281/zenodo.8080068). 9617
9618
[TITLE] “New Ideas On Super Con By Hyper Conceit Of Reverse Strict Connective In 9619
Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9620

9621
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9622
https://www.researchgate.net/publication/371853178 9623
9624
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9625
https://www.scribd.com/document/655368390 9626
9627
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9628
https://zenodo.org/record/8080068 9629
9630
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9631
https://www.academia.edu/103860942 9632
463
Figure 44.1: [HG290] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse
Strict Connective In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.8080068).
9633
[ADDRESSED CITATION] 9634
10.5281/zenodo.8080068). 9637
[ASSIGNED NUMBER] #290 Article 9638
[DATE] June 2023 9639

[DOI] 10.5281/zenodo.8080068 9640
[LICENSE] CC BY-NC-ND 4.0 9641
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9642
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9643
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9644
9645
[HG291] 9646
odo.8080100). 9649
9650
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9651

Reverse Strict Connective As Hyper Conceit On Super Con” 9652
9653
https://www.researchgate.net/publication/371853181 9655
9656
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9657

2023, (doi: 10.5281/zenodo.8080068).
2023, (doi: 10.5281/zenodo.8080068).

Figure 44.4: [HG291] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Strict Connective As Hyper Conceit On Super Con”, Zenodo
2023, (doi: 10.5281/zenodo.8080100).
https://www.scribd.com/document/655370212 9658
9659
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9660
9662
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9663
https://www.academia.edu/103861417 9664
9665
odo.8080100). 9669
[ASSIGNED NUMBER] #291 Article 9670
[DATE] June 2023 9671
[DOI] 10.5281/zenodo.8080100 9672
[LICENSE] CC BY-NC-ND 4.0 9673

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9674
[AVAILABLE AT TWITTER’S IDS] 9675
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9676
googlebooks GooglePlay 9677
9678
[ASSIGNED NUMBER] | Book #185 9679

HG185b
Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry Garrett, 2023 9681
(doi: 10.5281/zenodo.8080167). 9682

2023, (doi: 10.5281/zenodo.8080100).
2023, (doi: 10.5281/zenodo.8080100).

[TITLE] Reverse Strict Connective In SuperHyperGraphs 9683

#Latest_Updates 9684
#The_Links 9685
9689
9691
#The_Links 9692
9693
[ASSIGNED NUMBER] | Book #185 9694

9695
[TITLE] Reverse Strict Connective In SuperHyperGraphs 9696
9697
9701
– 9702
9703
[PUBLISHER] 9704
(Paperback): https://www.amazon.com/dp/- 9705
(Hardcover): https://www.amazon.com/dp/- 9706

(Kindle Edition): https://www.amazon.com/dp/- 9707
9708
– 9709
9710
[ISBN] 9711
(Paperback): - 9712
(Hardcover): - 9713
(Kindle Edition): CC BY-NC-ND 4.0 9714
(EBook): CC BY-NC-ND 4.0 9715
9716
– 9717
9718
[PRINT LENGTH] 9719
(Paperback): - pages 9720
(Hardcover): - pages 9721
(Kindle Edition): - pages 9722
(E-Book): - pages 9723
9724
– 9725
9726
9728

#The_Links 9729
9730
https://www.researchgate.net/publication/- 9732
9733
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9734
https://drhenrygarrett.wordpress.com/2023/07/22/ 9735
Reverse-Strict-Connective-In-SuperHyperGraphs/ 9736
9737
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9738
https://www.scribd.com/document/- 9739
9740
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9741
https://www.academia.edu/- 9742
9743
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9744
9746
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9747
https://books.google.com/books/about?id=- 9748
9749
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9750
https://play.google.com/store/books/details?id=- 9751

[TITLE] Reverse Strict Connective In SuperHyperGraphs (Published Version) 9752

9753
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9754
9755
https://drhenrygarrett.wordpress.com/2023/07/22/ 9756
Reverse-Strict-Connective-In-SuperHyperGraphs/ 9757
9758
– 9759
9760
[POSTED BY] Dr. Henry Garrett 9761
9762
[DATE] June 025, 2023 9763

9764
[POSTED IN] 185 | Reverse Strict Connective In SuperHyperGraphs 9765
9766
[TAGS] 9767
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9768
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9769
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9770
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9771
neutrosophic SuperHyperGraphs, Neutrosophic Reverse Strict Connective In SuperHyper- 9772
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9773
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9774
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9775
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Supe- 9776

rHyperGraph Theory, SuperHyperGraphs, Reverse Strict Connective In SuperHyperGraphs, 9777
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9778
In this scientific research book, there are some scientific research chapters on “Extreme Reverse 9779
Strict Connective In SuperHyperGraphs” and “Neutrosophic Reverse Strict Connective In 9780
SuperHyperGraphs” about some scientific research on Reverse Strict Connective In SuperHyper- 9781
Graphs by two (Extreme/Neutrosophic) notions, namely, Extreme Reverse Strict Connective In 9782
SuperHyperGraphs and Neutrosophic Reverse Strict Connective In SuperHyperGraphs. With 9783
scientific research on the basic scientific research properties, the scientific research book starts 9784
to make Extreme Reverse Strict Connective In SuperHyperGraphs theory and Neutrosophic 9785
Reverse Strict Connective In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9786
understandable. 9787

HG185b1.png
Figure 44.7: [HG185b] Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.8080167).

HG185b2.png

HG185b3.png

CHAPTER 45 9788
“SuperHyperGraph-Based Books”: | 9789
Featured Tweets 9790
“SuperHyperGraph-Based Books”: | Featured Tweets 9791
475
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 9792
CV 9793
503
9794
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
9795
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)
9796
Publications: Articles
2023 283 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi:
10.5281/zenodo.8067384).
@ResearchGate: https://www.researchgate.net/publication/371756020
@Scribd: https://www.scribd.com/document/654568722
@ZENODO_ORG: https://zenodo.org/record/8067384
@academia: https://www.academia.edu/103685293
PAGE @facebook: https://www.facebook.com/DrHenryGarrett/posts/
pfbid02PVuRN6wHWsY52awEgDL88yFLdCN6dJtUEezqWcu8ryHhuRZSqWmSUrxpCSshV5KXl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:ugcPost:7077411062093946880/
2023 282 Manuscript
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.8067409).
pfbid0Fk4y4Y5kzep1nfAECg7k6MKiMjgcUNZZhvNiAxPgRPEXYX8wNGjcyQoizDseD8pDl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:share:7077410014478368769/
2023 281 Manuscript

By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi:
10.5281/zenodo.8061927).
pfbid02AY6rhhhenA7z75Qjv8GEDSoaRcMAfDcKmtxpzm3dyxt1KsVBMoKqxYJ9PegscNKwl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:share:7077059574163238912/
2023 280 Manuscript
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.8062016).
pfbid0dcDVKSnXYKg63EH6PbqG9u1dLReL1haZ8ouxYdLaPpmYFPJK7HrMeGsNHoheTMGjl
2023 279 Manuscript

9797

By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8057696).
pfbid0kHUWk75MYJXth1QP7ieYJjdmUh8KcQovZaC6SeeqncD3Smc6ZFWSwVrGDg8QJgH5l
@LinkedIn: https://www.linkedin.com/posts/drhenrygarrett_279-
henry-garrett-new-ideas-in-recognition-activity-7076691352930930688-
sjGq?utm_source=share&utm_medium=member_desktop
2023 278 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective
(doi: 10.5281/zenodo.8057753).
pfbid02JgSBu1Hp92uwoPnorUiVijLAnd2rP5LeronqPJAGVgK299cDGTQqJtr3nwqY2g1Rl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:activity:7076690695343755264/
2023 277 Manuscript

By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8052893).
pfbid02StvDe1ZQn2U3yVANyR2Qj597ZzBbj6haYsxscFoW92jFFG2zw1VLQ27qwvisBepjl
2023 276 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective
(doi: 10.5281/zenodo.8052925).
pfbid031F9WncGQKv9GpFZT9kbWtWawNgvs7awguQ6QyGAyHAoBqiZYzkgUjXRniePoqdw6l
9798
2023 275 Manuscript

By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8051346).
pfbid028zmPpymc1oLLo41hh4h7eLMDaqhUtZnQSKgAxtJcZfgdfcoxpNQ6EZzyTFU9Wer5l
2023 274 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating
10.5281/zenodo.8051360).
pfbid032eqV8CopkBw2jfKW5wKDwmEny91xXzFrmiNXAEoqu6DrdscS5zXndHyFcahXpABgl
2023 241 Manuscript

As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32-55.
(https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of-cancer-
and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf)
PDF: https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of-
cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf
Abstract:https://www.opastpublishers.com/peer-review/new-ideas-in-recognition-of-cancer-
and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot-5648.html
Citation: https://www.opastpublishers.com/citation/new-ideas-in-recognition-of-cancer-and-
neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot-5648.html
Volume:https://www.opastpublishers.com/journal/current-trends-in-mass-
communication/articles-in-press
pfbid024qjfw3bJE3zrFcxB114Ha3VNoqf5nh2itoKqufzyiYaVDQ1t6pH1KJ3SkivPUWQKl
2023 273 Manuscript

9799
By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi:
10.5281/zenodo.8025707).
pfbid0R5XYMJk3w6At94ARQVBRPeiWXiv9f9FKfLdUj4pUZw5WiTxjpQMF9hr1KTkKGEZ6l
2023 272 Manuscript
Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating
10.5281/zenodo.8027275).
pfbid02gs2zNHRgs5n6gGayqoknBWAkoFutW5uaNvG85hSjDXnM5J5nuU8F2FDNAZNkrBtQl
2023 271 Manuscript

By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zenodo.8017246).
pfbid0vR23GhKEjdnNoiNT5hCsnhcMwg55b6CpT4q6AZ6MJc4kYjxSXgkJM51jioYLJwmDl
2023 270 Manuscript
Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In Recognition of
Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8020128).
pfbid0bi1wyfJX4bdof4TG6R5GRPPKFxHGAiaWvuJZnXL6tKhdeC4PouPCo2BETDsT6m7sl
2023 269 Manuscript

9800
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zenodo.7978571).
PAGE @facebook : https://www.facebook.com/DrHenryGarrett/posts/
pfbid0EMgDPr8Qr64cgQYNYob7DFjAwa4yzDvtBd5Hwu8Bju6MT937XntZkeShiJL3wtYGl
@LinkedIn : https://www.linkedin.com/feed/update/urn:li:ugcPost:7068500820371091456/
2023 268 Manuscript
Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7978857).
PAGE @facebook : https://www.facebook.com/DrHenryGarrett/posts/
pfbid0768FmYrMLfn7EnrUBPaPsZFoWzQw4aXR62EZWkhdXfHMUje7JBDCoQarigrzGiaFl
2023 267 Manuscript

By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi:
10.5281/zenodo.7940830).
@facebook : https://www.facebook.com/permalink.php?story_fbid=pf
bid0DHRP72yTvULtizh241w9p2VhGMpXdXdH89rwUgnY7dqzJyqxgAjiSsaawZnY6Pzcl&id
=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid=pf
bid073cCSMu2PvsXjbnXE3PvkfsJW2oECsC9FhcraEnqky9jrNhHmCJ3khAfZy5VeMKal&id
=105165509175944
2023 266 Manuscript

9801
Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges
10.5281/zenodo.7943578).
bid02DM8fDU6YDVKLTCXVpPguYUVcfUkiZwFzjENTP5qiygR8uSGAFtMWjikiM5pMyTLxl&id
=100090667441909
bid05K2QshnbNBcMJPa3RZC19oPc4FV79qmkqHBmtL4Yz2wWdyK5uZwoEVYXCseWv1Sdl&id
=105165509175944
2023 265 Manuscript

By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zenodo.7916595).
bid02ZtwTiY3Ldtd42QNGMwdjVCJaoALf6gyDQ4HL96mMmj6gWgfAWWr51WSZkG6iAWtCl&id
=100090667441909
bid02MyRNN1RJMoD27xHe1pz6WCiEu39rbv7r8GfwdnByEePJF6nAiRgYGtk2fkG3CFQSl&id
=105165509175944
2023 264 Manuscript
Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap

10.5281/zenodo.7923632).
bid032NKnZqrpam2B6YXb3rEpW8AXE9KbAQ15iALaCK7haHfiED3YpdiUT7giYGywZHkHl&id
=100090667441909
bid021XcoJg9VxpzxeRgHG848UdaRbNE7PnusfwFTbRNeLrg19LZtDRun7gYDvjPi8Bbkl&id
=105165509175944
2023 263 Manuscript

9802
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7904698).
bid0q4qz8wvNRRUHPXHnouaJLhzaEiFR3sAPVVXAktBaqnBDrWQKgM8t7s5g6L5up1gCl&id
=100090667441909
bid0KMQDXt65fJngQfkfvQrnkuiSmKybzkUpbaz2vtbuDz5B7aeM4ZcUB1o2uawhswDCl&id
=105165509175944
2023 262 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7904671).
bid022MLnimgoywbh7Nm1t4YfNPsPfhx7T5pMDzA425NPf6SNwbvpJp7VZ9EueYAWUL16l&id
=100090667441909
bid02sGHvQEoCQ7ytHFh9JS5ravEkdDbdh1wRsheCw5g3SCoJAPBrgcRPKmPvkKGTTqA9l&id
=105165509175944
2023 261 Manuscript

By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
Zenodo 2023, (doi: 10.5281/zenodo.7904529).
bid02Auhe8fKPai12fQr4JzH9wbp1qLQCVtGUbq6J4FBmpjNs7sx69NGgAXmLEmX3mZDCl&id
=100090667441909
bid0muouzWdCK94uH1LTk4drVvuvPZ4bR9yq8vvwquEYZoSseHFw7VbaRKDZTERuE7QYl&id
=105165509175944
2023 260 Manuscript

9803
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
bid0Hfz856s7ZBz5zxPcWvbAgsLF2Hu6Ky6yUj6VgSkdhRm95xBUXDd2SqiywRYkJFztl&id
=100090667441909
bid0qMfT6A9fPc2Fw1C2UTYhRVXuvU1gXJtTqEDxCj169gNDyLKGuqDem1NzDVqFbb9al&id
=105165509175944
2023 259 Manuscript

By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7871026).
bid0y6Hv8C1KYCz7GGfSSjw8W7oeD5P1CPmbMPPUZSPAvP4vftLCXs5CKAfBKcg1XVnSl&id
=100090667441909
bid02wNaiihPpfkg9DufyDVqM4fzFSe88Yp2xKWyreYrfD5hQETbU7UJzoxni9YVCmqBel&id
=105165509175944
2023 258 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7874647).
bid0nNzjMDKU3XMaJ9Hr3oYruSs2259aa4BybrANdEivV7TmrDe64WgvM3mtGMk5BCdyl&id
=100090667441909
bid0G5v1QVPVWQDEUu6PqDJovggdpCprYk513VjqpfAoqQ4DsAuzgx2jf28Wea4qhnDRl&id
=105165509175944
2023 257 Manuscript

9804
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7857856).
bid02KNUykkJYt8Bc7BEXH865F5YETnRorocET2VHPC7hqELMrSru5pjX1V9Eh3MtECd8l&id
=100090667441909
bid0knpZ5z8BJZSsj7TnL2qDfJ2dLtwDFt1PnMnTPVhQFudLmHLkv771E94AXJprBL8Xl&id
=105165509175944
2023 256 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7857841).
bid08iMYYsQKk7fVdCjhScLTv2JTk6ERXXJ9SBtaKcsNXGqJ79H5UdJiGJAUg5kSSDCjl&id
=100090667441909
bid0T7zYr9h5V87m78eTsswzk7NUcPwHUaSUqErCN4FMcZN89ZkRFVnaPMn2cuzbFboHl&id
=105165509175944
2023 255 Manuscript

By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7855661).
bid031iRCrdyWTAQZxnppfp9iwnsHF4Vd15MyiiNkGjJrPhRXKL6nTGXWBRaYWVCA6A8gl&id
=100090667441909
bid0sC8jkawi5dU1zj1UuTYnNLwMAowhbmonN2F87pc1QAQxRwUY3KanJY2BZ6N2f7mbl&id
=105165509175944
@LinkedIn : https://www.linkedin.com/feed/update/urn:li:ugcPost:7055646779198820352
2023 254 Manuscript

9805
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
bid02Pk4uksX2stX7AUx6jgCaLYWE1rCRNVszGyKUtBmT5F4genjUtrD8nRgwd45R3PJyl&id
=100090667441909
bid02yKq9WgrcBpuMDxqzhr9qMmT5T1byGrCxHBGugZ7oqHvgUeM61tKrqbq7Ewd4bwZjl&id
=105165509175944
2023 253 Manuscript

By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7853867).
bid031iRCrdyWTAQZxnppfp9iwnsHF4Vd15MyiiNkGjJrPhRXKL6nTGXWBRaYWVCA6A8gl&id
=100090667441909
bid02ExpaJbYr3pVjorCGEuXW22QKCYBMDtWSobYdiucosq69upuF968AwgAQ7Zr1Lrh9l&id
=105165509175944
2023 252 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-

10.5281/zenodo.7853922).
bid0F26gh8jMB6kwyjj8n2Gm1kdxFsC4mNw6S5Y2DqgRCxq63riJdUTuGNHBSq2KSv7Ul&id
=100090667441909
bid0oNL1Gy5SZVrdfxiAHsi1MYCLoQozKXAkkzZNfDvvSLMyoxZ93P7vQCyeSXzGRQsYl&id
=105165509175944
2023 251 Manuscript

9806
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7851519).
bid0HgJWLq8vMPMA8ktU5ZXQ3oTgmv2fhyk26qrPs3GMAvsVGSF7UKwAGCciNTEHV33Yl&id
=100090667441909
bid0nu8k62sMimbCiFvbeQ7jbbPXAtoHmEs4jYTago6hSZLYRNYXH9upiKxgsHDn21o6l&id
=105165509175944
2023 250 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path-

(doi: 10.5281/zenodo.7851550).
bid07iFfA7KpVRvKbQruEVGzK3m2wQkxXvQwrAS2SPiVHjtCzAVRk2aJsGGmuQbVw2mxl&id
=100090667441909
bid025JFAw4ratfahU4VHcxfaf5G6dT9swBnBJDwp3Q5wNhhPSoercdtA535gPN48eGmLl&id
=105165509175944
2023 249 Manuscript

By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”,
bid0t5u3Ti8Umd1TniGVRg78L8RtbropVif7mWFkKT3twSArxhx4qEJ6xH3DVTMVsapLl&id
=100090667441909
bid02JdLpwHLy92LqMiRQnJ1YwFFPAbwEmLS6SXwJFotGmA249dqwhR5g8836Pm3C18jUl&id
=105165509175944
2023 248 Manuscript

9807
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
bid0Cv7Ko3mnffB7xPfZsTTVRKGLVLfGnqzquEemtcEpp3Zr2EAKf3e1p6eJGDmQmvfxl&id
=100090667441909
bid0n73h7GjN7Dmwit5hyVfR5TSPVjFLajmkFmRkH636gJTLVzELHvszZFSWQNmJPC8rl&id
=105165509175944
2023 247 Manuscript

By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7834229).
2023 246 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7834261).
2023 245 Manuscript

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
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).
9808
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript

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

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

9809
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
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

9810
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

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-

(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

9811
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
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
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-

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

9812
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
(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

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-

10.5281/zenodo.7783082).
2023 218 Manuscript

9813
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

10.5281/zenodo.7779286).
2023 216 Article
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/-
9814
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).
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

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

9815
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

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

9816
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

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

9817
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
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

9818
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

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

9819
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
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

9820
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
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

9821
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

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

9822
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
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

9823
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

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

9824
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
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

9825
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).
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

9826
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

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

9827
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
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

9828
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

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

9829
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: -
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

9830
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
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
9831
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).
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).
9832
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
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
9833
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
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”,
9834
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
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”,
9835
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).
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 2(1) (2023) 16-24. (doi: 10.33140/JCTCSR.02.01.04).
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
9836
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

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
9837
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).
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
9838
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”,

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).
9839
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).
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).
9840
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).
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).
9841
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
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

9842
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).

(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).
9843
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).
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).
9844
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).
9845
Publications: Books
2023 165 | Eulerian-Cycle-Cut In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG165b] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7854561).
@googlebooks:https://books.google.com/books/about?id=sC 6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=sC 6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Cycle-Cut-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100571830
@facebook : https://www.facebook.com/permalink.php?story_fbid
=pfbid029xYJouTtSjWQw4FwaCDMEgcSWh5WvnP3pfyiTkDS8TJpbDKKJTKHe5UiXRYUwxLGl&
id=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid=
pfbid0AN8aQ92UF62oKMQkXbjNk9uUGJbUPPr7KPeLbZno7NVb2dY37Bw6Js6VzuN7hd7Tl&
id=105165509175944
=pfbid02ac6oipwkoUNSh3BUPVYX8v1wVSpimkuBWfuRNobWzvrjRBa6Sf8z8Zj4SgwKVdxxl&
id=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid
=pfbid0TRuHKgYpDZa6x1fvUsnNM9d5G7geLfniMbQswpM9dw4cmDrSq3zTzwhz1grRGT3vl&
id=105165509175944
=pfbid02kYx18Z6SHgkwgrCMbBtWPFNWknwshRtbuVfEMaqmwjuZEDZvuScszfEW9VREQtGAl&
id=100090667441909
pfbid02jxz6Wm1dQeQSGQX3PqTyzUveZnDf74FpYLsQETAj9gtFRPQrtaoickwAHhnGW31Jl&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2SFNF5P
(Hardcover): https://www.amazon.com/dp/B0C2SD1ZP2
(Kindle Edition): https://www.amazon.com/dp/B0C38ZRRWP
ISBN
(Paperback): 9798392185535
(Hardcover): 9798392185559
(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 164 | Eulerian-Type-Path-Neighbor In SuperHyperGraphs Amazon

9846
[HG164b] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7851893).
@googlebooks:https://books.google.com/books/about?id=2si6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=2si6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-
Neighbor-In-SuperHyperGraphs/
=pfbid02oLuaPsj7DumHemiCyN4UGShNF55NsrLLxLb2CV71eswsmV2um5oNW4AMi3Hp5oWkl&
id=100090667441909
pfbid037CDfPAcaAZWwCgPXVzurLEJxrucoLB9i9x97TxuivuA2DVYbtuDxXAjZNhWFwsfal&
id=105165509175944
=pfbid02ac6oipwkoUNSh3BUPVYX8v1wVSpimkuBWfuRNobWzvrjRBa6Sf8z8Zj4SgwKVdxxl&
id=100090667441909
=pfbid0tW9HKAxeYoodoqdAY9H5HzvVJxxcd1rRij2BYBnSHcHMKiKMP8GaPjrkyF9AkZdTl&
id=105165509175944
=pfbid0Jx27AsDtqjGy5jJikBH7hLctakc6zhinzY2Ski83ugJjkdW66yLkaDe4aavuVWEfl&
id=100090667441909
pfbid0KnWV8rKq32uxKTyfLLvox9KyTKqLEnG2a6CAdNvy2RSohvwsWhcs8NnSBVevJwoFl&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2S47JSK
(Hardcover): https://www.amazon.com/dp/B0C2S6B4LC
(Kindle Edition): https://www.amazon.com/dp/B0C37PMVMG
ISBN
(Paperback): 9798392080557
(Hardcover): 9798392080595
2023 163 | Eulerian-Type-Path-Decomposition In SuperHyperGraphs Amazon

9847
[HG163b] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Wo-6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Wo-6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-
Decomposition-In-SuperHyperGraphs/
=pfbid02dfEom5qzwQVmyHqwDg6ZFaSwZjcyDUUhP8HKi5ndxdZC3V57drPnL2aAR6s5N8xil&
id=100090667441909
pfbid02Pec8K2rzwUFqwXJs7QQKqVAXFdH1bsAWiKEaHY98jvroHYaTdk4kFtzhH7jzTJnTl&
id=105165509175944
=pfbid0hWnwqAgpjzRf4VjxGw1XMLYKfvrcrti7gou2BDYbMLLdrEBNVQdD3cNKduYxheBil&
id=100090667441909
=pfbid02AWRqicZsrFBzWJGb9PEucJHz3NTSSmQV7JmpUrBndvog8gwsPptxgAjFQzEAKmFml&
id=105165509175944
=pfbid0G3HjsGstqBG3aAWWHrkHYp1jqWLPB7VcoFvocW8tfE9uCH8mKk7szNSARKQ5SuJil&
id=100090667441909
pfbid0drhxRazVrHCzSsRowCtfUghXXqPTCtPgmu2qK2kZ4Hv26QNUcecA1FzKRpmGhyC1l&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2S3GFBC
(Hardcover): https://www.amazon.com/dp/B0C2RWP157
(Kindle Edition): https://www.amazon.com/dp/B0C33HB2F2
ISBN
(Paperback): 9798391955542
(Hardcover): 9798391955573
2023 162 | Eulerian-Type-Path-Cut In SuperHyperGraphs Amazon

9848
[HG162b] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7835063).
@googlebooks:https://books.google.com/books/about?id=hNq5EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hNq5EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-Cut-In-
SuperHyperGraphs/
=pfbid02QpCtXYV6EyMwdgWzZhwz7ucrMBUnrkNi8qY8GQAuAA7QVphvGRwc7VhgdmaPxXSSl&
id=100090667441909
pfbid02hWgTEoUV2V4fCjGJ9LXzz5qeMMWxrAkjCQtcYUH9eYapVsoR2LUu1E5qwa81kHZYl&
id=105165509175944
=pfbid0vyXwm6jEJHKZ4x74feiDHpNppxtF4CSK9Hv5G3gxsa3mpebkbnHmx37kfXuYjTD2l&
id=100090667441909
=pfbid02S2UberG9S2SDjRusSiyuhiN6EzxZgxoU8wBd1UXewdVhaPgFTb5ePAD3R7AiXG4l&
id=105165509175944
@LinkedIn : https://www.linkedin.com/posts/drhenrygarrett_link-isbn-activity
-7053710939254071297-e5rI?utm_source=share&utm_medium=member_desktop
=pfbid02w8pHq6yunC9qBnZhj7gyBVgDwgRZUaxMahmp7nE3cyDj9MgnP49Tm38RJYYX3wgYl&
id=100090667441909
pfbid02pJegzpHXtB51DZtURQKHmGoC2UN6kLGF2wtd3GmePX2bx3oetLvRwd34DXZbpFAl&
id=105165509175944
@LinkedIn : https://www.linkedin.com/posts/drhenrygarrett_hg162b-henry-garrett
-eulerian-type-path-cut-activity-7053711526511136768-dJZu?
utm_source=share
utm_medium=member_desktop
(Paperback): https://www.amazon.com/dp/B0C2PV14BR
(Hardcover): https://www.amazon.com/dp/B0C1J3B8ZL
(Kindle Edition): https://www.amazon.com/dp/B0C1J3HQ3X
ISBN
(Paperback): 9798391601487
(Hardcover): 9798391601456
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon

9849
[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/
(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
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
@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-
(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

9850
[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.
@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-
(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

9851
[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

9852
[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-
(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

9853
[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

9854
[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

9855
[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

9856
[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

9857
[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

9858
[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

9859
[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

9860
[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

9861
[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

9862
[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

9863
[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

9864
[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

9865
[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

9866
[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

9867
[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

9868
[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

9869
[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

9870
[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

9871
[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

9872
[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

9873
[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

9874
[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

9875
[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
9876
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

9877
[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

9878
[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

9879
[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

9880
[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

9881
[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
9882
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

9883
“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

9884
[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
9885
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

9886
[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

9887
[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

9888
[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

9889
[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

9890
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

9891
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
9892
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
9893
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

9894
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

9895
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
-
9896
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

9897
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9898
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
9899
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
9900
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

9901
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
9902
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
...
9903
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/
9904
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
9905
9906
9907
Henry Garrett
01/23/2022
9908
9909
9910
9911
9912
9913
9914
9915
9916
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
9917
View publication stats

Reverse Strict Connective 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

Reverse Strict Connective in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

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

Reverse Strict Connective In SuperHyperGraphs

Book · June 2023

513 PUBLICATIONS 23,337 CITATIONS

On Fuzzy Logic View project

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 47

5 Extreme Reverse Strict Connective 51

6 New Ideas On Super Con By Hyper Conceit Of Reverse Strict Connect-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 65

10 Extreme SuperHyperReverse Strict Connective But As The Extensions Ex-

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 141

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 149

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 253

25 Neutrosophic Reverse Strict Connective 257

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 SuperHyperReverse Strict Connective But As The Extensions

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 351

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 359

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 463

45 “SuperHyperGraph-Based Books”: | Featured Tweets 475

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

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

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

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.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 476

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.17“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 490