Zero Forcing in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/371417848
Zero Forcing In SuperHyperGraphs
Book · June 2023

DOI: 10.5281/zenodo.8020181
CITATIONS
1 author:
Henry Garrett
482 PUBLICATIONS 18,203 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Neutrosophic Graphs View project
On Algebraic Structures and Algebraic Hyperstructures View project
All content following this page was uploaded by Henry Garrett on 09 June 2023.
The user has requested enhancement of the downloaded file.

Zero Forcing 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 11
Bibliography 17
3 Acknowledgements 41
4 Cancer In Extreme SuperHyperGraph 43
5 Extreme Zero Forcing 47
6 New Ideas On Super forceps By Hyper ford Of Zero Forcing In

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

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

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

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

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

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

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

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 217
Bibliography 223
24 Cancer In Neutrosophic SuperHyperGraph 247
25 Neutrosophic Zero Forcing 251
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Zero Forcing As Hyper ford On Super forceps 253
27 ABSTRACT 255
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 265

30 Neutrosophic SuperHyperZero Forcing But As The Extensions Excerpt

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

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

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

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

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

Motivations 349
37 Conclusion and Closing Remarks 351
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 409
43 Background 423
Bibliography 429
44 Books’ Contributions 453
45 “SuperHyperGraph-Based Books”: | Featured Tweets 465
46 CV 493

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

SuperHyperZero Forcing in the Extreme Example (42.0.3) . . . . . . . . . . . . . . . 79
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 a Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperZero

Forcing in the Example (42.0.5) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
11.2 a Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperZero Forcing in the Extreme Example (42.0.7) . . . . . . . . . . . . . . . . 118
11.3 a Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperZero Forcing in the Extreme Example (42.0.9) . . . . . . . . . . . . . . . . 119
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperZero Forcing in the Example (42.0.11) . . . . . . . . . . . . . . . 121
11.5 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme Super-
HyperZero Forcing in the Example (42.0.13) . . . . . . . . . . . . . . . . . . . . . . . 123
11.6 a Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperZero Forcing in the Extreme Example (42.0.15) . . . . . . . . . . 124
14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

perZero Forcing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme Super-

HyperZero Forcing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.3) . . . . . 283


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

SuperHyperZero Forcing in the Example (42.0.5) . . . . . . . . . . . . . . . . . . . . . 320
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 SuperHyperZero Forcing in the Example (42.0.11) . . . . . . 325
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperZero Forcing in the Example (42.0.13) . . . . . . . . . . . . . . . . . . . . 327
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.15) 329
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperZero Forcing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 345

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperZero Forcing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347
44.1 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). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 454
10.5281/zenodo.8020128). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
10.5281/zenodo.8020128). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi:
10.5281/zenodo.8017246). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456
10.5281/zenodo.8017246). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457
10.5281/zenodo.8017246). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457
44.7 [HG175b] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.8020181). . . . . . . . . . . . . . . . . . . . . . . . . . . 461
2023 (doi: 10.5281/zenodo.8020181). . . . . . . . . . . . . . . . . . . . . . . . . . . 462
2023 (doi: 10.5281/zenodo.8020181). . . . . . . . . . . . . . . . . . . . . . . . . . . 463
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 466

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



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

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

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 140

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 346

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

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

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

Forcing In SuperHyperGraphs . Since there’s more ways to get type-results to make a Zero 41
Forcing In SuperHyperGraphs more understandable. For the sake of having Neutrosophic 42
Zero Forcing In SuperHyperGraphs, there’s a need to “redefine” the notion of a “Zero Forcing 43
In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned 44
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 45
position of labels to assign to the values. Assume a Zero Forcing In SuperHyperGraphs . It’s 46
redefined a Neutrosophic Zero Forcing In SuperHyperGraphs if the mentioned Table holds, 47
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 48
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 49
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 50
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 51
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 52
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 53
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 54
based on a Zero Forcing In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have 55
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 56
have all Zero Forcing In SuperHyperGraphs until the Zero Forcing In SuperHyperGraphs, 57
then it’s officially called a “Zero Forcing In SuperHyperGraphs” but otherwise, it isn’t a 58
Zero Forcing In SuperHyperGraphs . There are some instances about the clarifications for 59
the main definition titled a “Zero Forcing In SuperHyperGraphs ”. These two examples get 60
more scrutiny and discernment since there are characterized in the disciplinary ways of the 61
SuperHyperClass based on a Zero Forcing In SuperHyperGraphs . For the sake of having 62
a Neutrosophic Zero Forcing In SuperHyperGraphs, there’s a need to “redefine” the notion 63
of a “Neutrosophic Zero Forcing In SuperHyperGraphs” and a “Neutrosophic Zero Forcing 64

In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned 65
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 66
position of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s 67
redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a Zero Forcing In 68
SuperHyperGraphs are redefined to a “Neutrosophic Zero Forcing In SuperHyperGraphs” if the 69

intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since 70
there’s more ways to get Neutrosophic type-results to make a Neutrosophic Zero Forcing In 71
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There are 72
some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Zero 73
Forcing In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, 74
and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Zero Forcing In 75

SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 76
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 77
Table holds. A SuperHyperGraph has a “Neutrosophic Zero Forcing In SuperHyperGraphs” 78
where it’s the strongest [the maximum Neutrosophic value from all the Zero Forcing In 79

SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a Zero Forcing 80
In SuperHyperGraphs .] Zero Forcing In SuperHyperGraphs . A graph is a SuperHyper- 81
Uniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are 82
the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 83
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 84
SuperHyperEdges with two exceptions; it’s Zero Forcing In SuperHyperGraphs if it’s only one 85
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 86
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 87
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 88
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 89
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 90
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 91
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 92
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 93
the specific designs and the specific architectures. The SuperHyperModel is officially called 94
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 95
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 96
and the common and intended properties between “specific” cells and “specific group” of 97
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 98

degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 99
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 100
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 101
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 102
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 103
of the move from the cancer is identified by this research. Sometimes the move of the cancer 104
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 105
about the moves and the effects of the cancer on that region; this event leads us to choose 106
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 107
on what’s happened and what’s done. There are some specific models, which are well-known 108
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 109
and the traces of the cancer on the complex tracks and between complicated groups of cells 110
could be fantasized by a Neutrosophic SuperHyperPath(-/Zero Forcing In SuperHyperGraphs, 111
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 112
is to find either the longest Zero Forcing In SuperHyperGraphs or the strongest Zero Forcing In 113
SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest Zero Forcing 114
In SuperHyperGraphs, called Zero Forcing In SuperHyperGraphs, and the strongest Zero 115
Forcing In SuperHyperGraphs, called Neutrosophic Zero Forcing In SuperHyperGraphs, some 116
general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths 117
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 118
SuperHyperEdges to form any style of a Zero Forcing In SuperHyperGraphs. There isn’t any 119
formation of any Zero Forcing In SuperHyperGraphs but literarily, it’s the deformation of 120
any Zero Forcing In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A basic 121
familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 122
proposed. 123
Keywords: SuperHyperGraph, (Neutrosophic) Zero Forcing In SuperHyperGraphs, Cancer’s 124

Recognition 125
AMS Subject Classification: 05C17, 05C22, 05E45 126
127
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 128
Notion, namely, Neutrosophic Zero Forcing In SuperHyperGraphs . Two different types of 129
SuperHyperDefinitions are debut for them but the scientific research goes further and the 130
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 131

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

|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 156
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 157
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 158
version of Zero Forcing In SuperHyperGraphs . Since there’s more ways to get type-results 159
to make Zero Forcing In SuperHyperGraphs more understandable. For the sake of having 160
Neutrosophic Zero Forcing In SuperHyperGraphs, there’s a need to “redefine” the notion of 161
“Zero Forcing In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are 162
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of 163
the position of labels to assign to the values. Assume a Zero Forcing In SuperHyperGraphs . 164
It’s redefined Neutrosophic Zero Forcing In SuperHyperGraphs if the mentioned Table holds, 165
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 170

of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 171
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 172
Zero Forcing In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the foundation 173
of previous definition in the kind of SuperHyperClass. If there’s a need to have all Zero Forcing 174
In SuperHyperGraphs until the Zero Forcing In SuperHyperGraphs, then it’s officially called 175
“Zero Forcing In SuperHyperGraphs” but otherwise, it isn’t Zero Forcing In SuperHyperGraphs 176
. There are some instances about the clarifications for the main definition titled “Zero Forcing 177
In SuperHyperGraphs ”. These two examples get more scrutiny and discernment since there 178
are characterized in the disciplinary ways of the SuperHyperClass based on Zero Forcing In 179
SuperHyperGraphs . For the sake of having Neutrosophic Zero Forcing In SuperHyperGraphs, 180
there’s a need to “redefine” the notion of “Neutrosophic Zero Forcing In SuperHyperGraphs” 181
and “Neutrosophic Zero Forcing In SuperHyperGraphs ”. The SuperHyperVertices and the 182
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 183
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 184
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table 185
holds. And Zero Forcing In SuperHyperGraphs are redefined “Neutrosophic Zero Forcing In 186
SuperHyperGraphs” if the intended Table holds. It’s useful to define “Neutrosophic” version 187
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make 188
Neutrosophic Zero Forcing In SuperHyperGraphs more understandable. Assume a Neutrosophic 189

SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 190
Thus SuperHyperPath, Zero Forcing In SuperHyperGraphs, SuperHyperStar, SuperHyperBi- 191
partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 192
“Neutrosophic Zero Forcing In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neut- 193
rosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 194
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “Neutrosophic Zero 195
Forcing In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from 196
all Zero Forcing In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices 197
from a Zero Forcing In SuperHyperGraphs .] Zero Forcing In SuperHyperGraphs . A graph is 198
SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges 199
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 200
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 201
SuperHyperEdges with two exceptions; it’s Zero Forcing In SuperHyperGraphs if it’s only one 202
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 203
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 204
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 205
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 206
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 207
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 208
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 209
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 210
the specific designs and the specific architectures. The SuperHyperModel is officially called 211
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 212

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 213
and the common and intended properties between “specific” cells and “specific group” of cells 214
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 215
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 216

case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 217
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 218
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 219
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 220
and the long cycle of the move from the cancer is identified by this research. Sometimes the 221
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 222
and neutrality about the moves and the effects of the cancer on that region; this event leads us 223
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 224
perception on what’s happened and what’s done. There are some specific models, which are 225
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 226
moves and the traces of the cancer on the complex tracks and between complicated groups of cells 227
could be fantasized by a Neutrosophic SuperHyperPath(-/Zero Forcing In SuperHyperGraphs, 228

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

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

[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 256
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 257
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 258
259
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 260
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 261

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




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

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

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

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

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

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

SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 358
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 359
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 360
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 361
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 362
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 363

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 364
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 365
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 366
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 367
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 368
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 369

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

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

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

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHy- 403

perGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concern- 404
ing SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in 405
Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to 406
Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutro- 407
sophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; 408
HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; 409
HG15; HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; HG24; HG25; 410
HG982; HG106; HG107; HG111; HG112; HG115; HG116; HG120; HG121; HG122; 413
HG266; HG267; HG268; HG269; HG270; HG271], there are some endeavors to formalize 428
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 429
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 430
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; 431
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 434
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 435

HG169b; HG170b; HG171b; HG172b; HG173b; HG174b; HG175b]. Two popular 443
scientific research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on 444
neutrosophic science is on [HG32b; HG44b]. 445
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 446
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 447
more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 448

by Dr. Henry Garrett. This research book covers different types of notions and settings in 449
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 450
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 451
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 452
has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 453
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 454
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 455
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 456
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 457
that what’s done in this research book which is popular in the terms of high readers in Scribd. 458
See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 459
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 460
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 461
HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; 462
HG269; HG270; HG271] alongside scientific research books at [HG60b; HG61b; HG62b; 481


HG174b; HG175b]. Two popular scientific research books in Scribd in the terms of high 495
readers, 4331 and 5327 respectively, on neutrosophic science is on [HG32b; HG44b]. 496

Bibliography 497
HG11s [1] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 498
As Hyper Tool On Super Toot”, Current Trends in Mass Communication 1(1) (2023) 499
37-60. 500
HG22s [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 501
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 502
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 503
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 504
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 505
alongside-a.pdf) 506
HG33s [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 507
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 508
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 509
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 510
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 511
hamiltonian-sets-.pdf) 512
HG44s [4] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 513
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 514
Trends Comp Sci Res 2(1) (2023) 16-24. (https://www.opastpublishers.com/open-access- 515
articles/neutrosophic-codegree-and-neutrosophic-degree-alongside-chromatic-numbers- 516
in-the-setting-of-some-classes-related-to-neut.pdf) 517
HG55s [5] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 518
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 519
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 520
10.33140/JMTCM.01.03.09) 521
HG4 [6] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 522
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 523
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 524
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 525
https://oa.mg/work/10.5281/zenodo.6319942 526
17
HG5 [7] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 527
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 528
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 529
https://oa.mg/work/10.13140/rg.2.2.35241.26724 530
HG6 [8] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 531
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 532
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 533
HG7 [9] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 534
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 535
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 536
10.20944/preprints202301.0282.v1). 537
HG8 [10] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 538
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 539
10.20944/preprints202301.0267.v1). 540
HG9 [11] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 541
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 542
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 543
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 544
(doi: 10.20944/preprints202301.0265.v1). 545
HG10 [12] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 546
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 547
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 548
prints202301.0262.v1). 549
HG11 [13] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 550
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 551
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 552
HG12 [14] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 553
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 554
2023010224, (doi: 10.20944/preprints202301.0224.v1). 555
HG13 [15] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 556
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 557

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

HG15 [17] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 562
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 563
Preprints 2023, 2023010044 564

HG16 [18] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 565
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 566
10.20944/preprints202301.0043.v1). 567
HG17 [19] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 568
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 569
HG19 [21] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 574
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 575

(doi: 10.20944/preprints202212.0549.v1). 576
HG20 [22] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 577
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 578
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 579
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 580
HG21 [23] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 581
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 582
(doi: 10.20944/preprints202212.0500.v1). 583
HG22 [24] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 584
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 585
HG23 [25] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 587
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 588
HG271 [26] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 590
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 591
odo.8017246). 592
HG270 [27] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 593
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 594
10.5281/zenodo.8020128). 595
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 597
odo.7978571). 598
HG268 [29] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 599
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 600
10.5281/zenodo.7978857). 601

HG267 [30] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 602
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 603
10.5281/zenodo.7940830). 604
HG266 [31] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 605
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 606
10.5281/zenodo.7943578). 607
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 609
odo.7916595). 610
HG264 [33] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 611
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 612
odo.7923632). 613
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 615
(doi: 10.5281/zenodo.7904698). 616
HG262 [35] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 617
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 618
2023, (doi: 10.5281/zenodo.7904671). 619
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 621
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 622
HG260 [37] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 623
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 624
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 625
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 627
10.5281/zenodo.7871026). 628
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 630
2023, (doi: 10.5281/zenodo.7874647). 631
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 633
10.5281/zenodo.7857856). 634
HG256 [41] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 635
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 636
2023, (doi: 10.5281/zenodo.7857841). 637
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 639

Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 642
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 645
10.5281/zenodo.7853867). 646
HG252 [45] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 647
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 648
10.5281/zenodo.7853922). 649
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 651
(doi: 10.5281/zenodo.7851519). 652
HG250 [47] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 653
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 654
(doi: 10.5281/zenodo.7851550). 655
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 657
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 660
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 663
10.5281/zenodo.7834229). 664
HG246 [51] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 665
10.5281/zenodo.7834261). 667
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 669
10.5281/zenodo.7824560). 670
HG244 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 671
(doi: 10.5281/zenodo.7824623). 673
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 675
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 678

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 681
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 683
2023, (doi: 10.5281/zenodo.7809365). 684
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 686
2023, (doi: 10.5281/zenodo.7809358). 687
HG238 [59] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 688

10.5281/zenodo.7809219). 690
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 692
10.5281/zenodo.7809328). 693
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 695
2023, (doi: 10.5281/zenodo.7806767). 696
HG235 [62] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 697

2023, (doi: 10.5281/zenodo.7806838). 699
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 701
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 702
HG233 [64] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 703
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 704
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 705
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 707
10.5281/zenodo.7799902). 708
HG231 [66] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 709
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 710
(doi: 10.5281/zenodo.7804218). 711
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 713
(doi: 10.5281/zenodo.7796334). 714
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 716

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 719
10.5281/zenodo.7791952). 720
HG225 [70] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 721
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 722
10.5281/zenodo.7791982). 723
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 725
10.5281/zenodo.7790026). 726
HG223 [72] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 727
10.5281/zenodo.7790052). 729
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 731
2023, (doi: 10.5281/zenodo.7787066). 732
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 734
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 735
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 737
10.5281/zenodo.7781476). 738
HG219 [76] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 739
10.5281/zenodo.7783082). 741
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 743
10.5281/zenodo.7777857). 744
HG217 [78] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 745
10.5281/zenodo.7779286). 747
HG215 [79] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 748
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 749
(doi: 10.5281/zenodo.7771831). 750
HG214 [80] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 751
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 752
2023, (doi: 10.5281/zenodo.7772468). 753
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 755
10.13140/RG.2.2.20913.25446). 756

HG212 [82] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 757
odo.7764916). 759
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 761
10.13140/RG.2.2.11770.98247). 762
HG210 [84] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 763
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 764
10.13140/RG.2.2.12400.12808). 765
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 767
2023, (doi: 10.13140/RG.2.2.22545.10089). 768
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 770
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 771
HG207 [87] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 772
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 773
10.13140/RG.2.2.11377.76644). 774
HG206 [88] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 775
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 776
10.13140/RG.2.2.23750.96329). 777
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 779
10.13140/RG.2.2.31366.24641). 780
HG204 [90] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 781
10.13140/RG.2.2.34721.68960). 783
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 785
2023, (doi: 10.13140/RG.2.2.30212.81289). 786
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 788
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 791
10.13140/RG.2.2.24288.35842). 792
HG200 [94] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 793
10.13140/RG.2.2.32467.25124). 795

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 797
10.13140/RG.2.2.31025.45925). 798
HG198 [96] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 799
10.13140/RG.2.2.17184.25602). 801
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 803
10.13140/RG.2.2.23423.28327). 804
HG196 [98] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 805
10.13140/RG.2.2.28456.44805). 807
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 809
10.13140/RG.2.2.23525.68320). 810
HG194 [100] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 811
10.13140/RG.2.2.20170.24000). 813
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 815
10.13140/RG.2.2.36475.59683). 816
HG192 [102] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 817
10.13140/RG.2.2.29764.71046). 819
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 821
2023, (doi: 10.13140/RG.2.2.18780.87683). 822
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 824
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 827
10.13140/RG.2.2.26134.01603). 828
HG188 [106] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 829
10.13140/RG.2.2.27392.30721). 831
HG187 [107] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 832
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 833
10.13140/RG.2.2.33028.40321). 834

Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 836
10.13140/RG.2.2.21389.20966). 837
HG185 [109] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 838
10.13140/RG.2.2.16356.04489). 840
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 842
10.13140/RG.2.2.21756.21129). 843
HG183 [111] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 844
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 845
10.13140/RG.2.2.30983.68009). 846
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 848
10.13140/RG.2.2.28552.29445). 849
HG181 [113] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 850
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 851
(doi: 10.13140/RG.2.2.10936.21761). 852
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 854
10.13140/RG.2.2.35105.89447). 855
HG179 [115] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 856
(doi: 10.13140/RG.2.2.30072.72960). 858
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 860
10.13140/RG.2.2.31147.52003). 861
HG177 [117] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 862
10.13140/RG.2.2.32825.24163). 864
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 866
10.13140/RG.2.2.13059.58401). 867
HG175 [119] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 868
10.13140/RG.2.2.11172.14720). 870
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 872
2023, (doi: 10.13140/RG.2.2.22011.80165). 873

HG173 [121] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 874
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 875
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 876
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 878
2023, (doi: 10.13140/RG.2.2.10493.84962). 879
HG171 [123] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 880
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 882
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 884
2023, (doi: 10.13140/RG.2.2.19944.14086). 885
HG169 [125] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 886
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 888
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 890
(doi: 10.13140/RG.2.2.33103.76968). 891
HG167 [127] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 892
(doi: 10.13140/RG.2.2.23037.44003). 894
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 896
(doi: 10.13140/RG.2.2.35646.56641). 897
HG165 [129] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 898
10.13140/RG.2.2.18030.48967). 900
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 902
(doi: 10.13140/RG.2.2.13973.81121). 903
HG163 [131] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 904
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 905
2023, (doi: 10.13140/RG.2.2.34106.47047). 906
HG162 [132] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 907
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 908
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 911
2023, (doi: 10.13140/RG.2.2.31956.88961). 912

HG160 [134] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 913
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 914
2023, (doi: 10.13140/RG.2.2.15179.67361). 915
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 917
10.13140/RG.2.2.21510.45125). 918
HG158 [136] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 919
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 920
2023, (doi: 10.13140/RG.2.2.13121.84321). 921
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 923
10.13140/RG.2.2.11758.69441). 924
HG156 [138] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 925
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 926
2023, (doi: 10.13140/RG.2.2.31891.35367). 927
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 929
10.13140/RG.2.2.19360.87048). 930
HG154 [140] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 931
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 932
10.13140/RG.2.2.32363.21286). 933
HG153 [141] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 934
10.13140/RG.2.2.23266.81602). 936
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 938
10.13140/RG.2.2.19911.37285). 939
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 941
10.13140/RG.2.2.11050.90569). 942
HG150 [144] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 943
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 944
2023, (doi: 10.13140/RG.2.2.17761.79206). 945
HG149 [145] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 946
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 947
HG148 [146] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 949
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 950
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 951

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 953
(doi: 10.13140/RG.2.2.30182.50241). 954
HG146 [148] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 955
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 956
HG145 [149] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 958
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 959
HG144 [150] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 961
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 962
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 963
HG143 [151] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 964
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 965
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 966
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 969
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 972
HG140 [154] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 973
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 974
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 975
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 978
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 981
HG137 [157] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 982
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 983
HG136 [158] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 985
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 986
2023, (doi: 10.13140/RG.2.2.17252.24968). 987
HG135 [159] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 988
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 989
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 990

HG134 [160] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 991
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 992
HG132 [161] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 994
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 995

2023010396 (doi: 10.20944/preprints202301.0396.v1). 996
HG131 [162] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 997
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 998

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 999
HG130 [163] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1000
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1001
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1002

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1003
HG129 [164] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1004

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

HG128 [165] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1008
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1009

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1010
HG127 [166] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1011
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1012
2023,(doi: 10.13140/RG.2.2.36745.93289). 1013
HG126 [167] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1014
HG125 [168] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1017
10.20944/preprints202301.0282.v1). 1020
HG124 [169] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1021
10.20944/preprints202301.0267.v1).). 1023
(doi: 10.20944/preprints202301.0265.v1). 1028

HG122 [171] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1029
prints202301.0262.v1). 1032

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1040
10.13140/RG.2.2.35061.65767). 1041
HG25 [175] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1042
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1043
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1044

10.13140/RG.2.2.18494.15680). 1045
HG26 [176] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1046
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1047
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1048
10.13140/RG.2.2.32530.73922). 1049
HG27 [177] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1050
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1051
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1052

10.13140/RG.2.2.15897.70243). 1053
10.13140/RG.2.2.32530.73922). 1057

prints202301.0105.v1). 1060
HG28 [180] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1061
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1062
HG29 [181] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1064
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1065
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1066
10.13140/RG.2.2.23172.19849). 1067

HG30 [184] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1074
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1075
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1076
10.13140/RG.2.2.17385.36968). 1077
Preprints 2023, 2023010044 1080
10.20944/preprints202301.0043.v1). 1083
HG31 [187] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1084
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1085
2023, (doi: 10.13140/RG.2.2.28945.92007). 1086
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1091
10.13140/RG.2.2.35774.77123). 1092

HG35 [191] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1096
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1097
10.13140/RG.2.2.29430.88642). 1098
(doi: 10.20944/preprints202212.0549.v1). 1104

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1106
10.13140/RG.2.2.19380.94084). 1107
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1115
(doi: 10.20944/preprints202212.0500.v1). 1118
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1120
10.13140/RG.2.2.20993.12640). 1121
HG952 [199] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1122

HG95 [200] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1125
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1126
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1127
HG37 [203] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1134
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1135

10.13140/RG.2.2.29173.86244). 1136
HG38 [204] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1137
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1138

Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1139
HG175b [205] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1140
10.5281/zenodo.8020181). 1141
HG174b [206] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1142
10.5281/zenodo.7978921). 1143

HG173b [207] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1144
odo.7943878). 1145
HG172b [208] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1146
10.5281/zenodo.7943871). 1147
HG171b [209] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1148
10.5281/zenodo.7923786). 1149
HG170b [210] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1150
2023 (doi: 10.5281/zenodo.7905287). 1151
HG169b [211] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1152

Garrett, 2023 (doi: 10.5281/zenodo.7904586). 1153
HG168b [212] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1154
2023 (doi: 10.5281/zenodo.7874677). 1155
HG167b [213] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1156
(doi: 10.5281/zenodo.7857906). 1157
HG166b [214] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1158
2023 (doi: 10.5281/zenodo.7856329). 1159
HG165b [215] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1160
10.5281/zenodo.7854561). 1161
HG164b [216] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1162
2023 (doi: 10.5281/zenodo.7851893). 1163
HG163b [217] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1164

HG162b [218] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1166
(doi: 10.5281/zenodo.7835063). 1167
HG161b [219] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1168
(doi: 10.5281/zenodo.7826705). 1169
HG160b [220] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1170
2023 (doi: 10.5281/zenodo.7820680). 1171
HG159b [221] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1172
10.5281/zenodo.7812750). 1173
HG158b [222] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1174

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

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

HG155b [225] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1180
2023 (doi: 10.5281/zenodo.7804449). 1181
HG154b [226] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1182

HG153b [227] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1184
(doi: 10.5281/zenodo.7792307). 1185
HG152b [228] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1186
(doi: 10.5281/zenodo.7790728). 1187
HG151b [229] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1188
2023 (doi: 10.5281/zenodo.7787712). 1189
HG150b [230] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1190
10.5281/zenodo.7783791). 1191
HG149b [231] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1192
10.5281/zenodo.7780123). 1193
HG148b [232] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1194
(doi: 10.5281/zenodo.7773119). 1195
HG147b [233] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1196
odo.7637762). 1197
HG146b [234] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1198
10.5281/zenodo.7766174). 1199
HG145b [235] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1200
10.5281/zenodo.7762232). 1201
HG144b [236] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1202
(doi: 10.5281/zenodo.7758601). 1203
HG143b [237] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1204
10.5281/zenodo.7754661). 1205
HG142b [238] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1206
10.5281/zenodo.7750995) . 1207
HG141b [239] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1208
(doi: 10.5281/zenodo.7749875). 1209
HG140b [240] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1210
10.5281/zenodo.7747236). 1211
HG139b [241] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1212
10.5281/zenodo.7742587). 1213
HG138b [242] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1214
(doi: 10.5281/zenodo.7738635). 1215

HG137b [243] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1216
10.5281/zenodo.7734719). 1217
HG136b [244] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1218
10.5281/zenodo.7730484). 1219
HG135b [245] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1220
(doi: 10.5281/zenodo.7730469). 1221
HG134b [246] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1222
10.5281/zenodo.7722865). 1223
HG133b [247] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1224
odo.7713563). 1225
odo.7709116). 1227
HG131b [249] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1228
10.5281/zenodo.7706415). 1229
HG130b [250] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1230
10.5281/zenodo.7706063). 1231
HG129b [251] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1232
10.5281/zenodo.7701906). 1233
HG128b [252] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1234
odo.7700205). 1235
HG127b [253] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1236
10.5281/zenodo.7694876). 1237
HG126b [254] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1238
10.5281/zenodo.7679410). 1239
HG125b [255] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1240
10.5281/zenodo.7675982). 1241
HG124b [256] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1242
10.5281/zenodo.7672388). 1243
HG123b [257] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1244
odo.7668648). 1245
HG122b [258] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1246
10.5281/zenodo.7662810). 1247
HG121b [259] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1248
10.5281/zenodo.7659162). 1249
HG120b [260] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1250
odo.7653233). 1251

HG119b [261] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1252
odo.7653204). 1253
HG118b [262] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1254
odo.7653142). 1255
HG117b [263] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1256
odo.7653117). 1257
HG116b [264] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1258
HG115b [265] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1259
odo.7651687). 1260
HG114b [266] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1261
odo.7651619). 1262
HG113b [267] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1263
odo.7651439). 1264
HG112b [268] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1265
odo.7650729). 1266
HG111b [269] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1267
odo.7647868). 1268
HG110b [270] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1269
odo.7647017). 1270
HG109b [271] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1271
odo.7644894). 1272
HG108b [272] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1273
HG107b [273] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1274
odo.7632923). 1275
HG106b [274] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1276
odo.7623459). 1277
HG105b [275] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1278
10.5281/zenodo.7606416). 1279
HG104b [276] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1280
10.5281/zenodo.7606416). 1281
HG103b [277] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1282
odo.7606404). 1283
HG102b [278] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1284
10.5281/zenodo.7580018). 1285

HG101b [279] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1286
odo.7580018). 1287
odo.7580018). 1289
odo.7579929). 1291
HG98b [282] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1292
10.5281/zenodo.7563170). 1293
HG97b [283] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1294
odo.7563164). 1295
HG96b [284] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1296
odo.7563160). 1297
odo.7563160). 1299
HG94b [286] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1300
10.5281/zenodo.7563160). 1301
HG93b [287] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1302
10.5281/zenodo.7557063). 1303
HG92b [288] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1304
10.5281/zenodo.7557009). 1305
HG91b [289] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1306
10.5281/zenodo.7539484). 1307
HG90b [290] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1308
10.5281/zenodo.7523390). 1309
HG89b [291] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1310
10.5281/zenodo.7523390). 1311
HG88b [292] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1312
10.5281/zenodo.7523390). 1313
HG87b [293] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1314
odo.7574952). 1315
HG86b [294] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1316
10.5281/zenodo.7574992). 1317
odo.7523357). 1319
HG84b [296] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1320
10.5281/zenodo.7523357). 1321

HG83b [297] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1322
10.5281/zenodo.7504782). 1323
HG82b [298] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1324
10.5281/zenodo.7504782). 1325
HG81b [299] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1326
10.5281/zenodo.7504782). 1327
HG80b [300] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1328
10.5281/zenodo.7499395). 1329
HG79b [301] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1330
odo.7499395). 1331
HG78b [302] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1332
10.5281/zenodo.7499395). 1333
HG77b [303] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1334
10.5281/zenodo.7497450). 1335
HG76b [304] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1336
10.5281/zenodo.7497450). 1337
HG75b [305] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1338
10.5281/zenodo.7494862). 1339
HG74b [306] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1340
odo.7494862). 1341
HG73b [307] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1342
10.5281/zenodo.7494862). 1343
HG72b [308] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1344
10.5281/zenodo.7493845). 1345
HG71b [309] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1346
odo.7493845). 1347
HG70b [310] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1348
10.5281/zenodo.7493845). 1349
HG69b [311] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1350
odo.7539484). 1351
HG68b [312] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1352
odo.7523390). 1353
HG67b [313] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1354
odo.7523357). 1355
HG66b [314] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1356
odo.7504782). 1357

HG65b [315] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1358
odo.7499395). 1359
HG64b [316] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1360
odo.7497450). 1361
HG63b [317] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1362
odo.7494862). 1363
HG62b [318] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1364
odo.7493845). 1365
HG61b [319] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1366
odo.7480110). 1367
HG60b [320] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1368
odo.7378758). 1369
HG32b [321] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1370
odo.6320305). 1371
HG44b [322] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1372
odo.6677173). 1373

CHAPTER 3 1374
Acknowledgements 1375
The author is going to express his gratitude and his appreciation about the brains and their 1376
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1377
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1378 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
1379
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 1380
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1381
ideas to be on the star lines of words and shining like stars, forever. 1382
41
CHAPTER 4 1383
Cancer In Extreme SuperHyperGraph 1384
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1385
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1386
as the consequences of the model, some parameters are used. The cells are under attack of this 1387
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1388
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1389
In the following, some Extreme steps are Extreme devised on this disease. 1390
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1391
function. 1392
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1393
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1394
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1395
since there are some determinacy, indeterminacy and neutrality about the moves and the 1396
effects of the cancer on that region; this event leads us to choose another model [it’s said 1397
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1398
what’s done. 1399
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1400
they’ve got the names, and some general Extreme models. The moves and the Extreme 1401
traces of the cancer on the complex tracks and between complicated groups of cells could be 1402
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1403
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1404
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1405
in those Extreme Extreme SuperHyperModels. 1406
Some cells have been faced with some attacks from the situation which is caused by the 1407
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1408
which in that, the cells could be labelled as some groups and some groups or individuals have 1409
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1410
the embedded situations, the individuals of cells and the groups of cells could be considered 1411
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1412
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1413
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1414
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1415
43
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1416
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1417
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1418
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1419
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1420
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1421
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1422

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1423
is going to figure out what’s going on this phenomenon. The special case of this disease is 1424
considered and as the consequences of the model, some parameters are used. The cells are 1425
under attack of this disease but the moves of the cancer in the special region are the matter of 1426
mind. The recognition of the cancer could help to find some treatments for this disease. The 1427
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1428
Recognition” and both bases are the background of this research. Sometimes the cancer has 1429
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1430
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1431
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1432
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1433
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1434
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1435
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1436
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1437
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1438
and neutrality about the moves and the effects of the cancer on that region; this event leads 1439
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1440
perception on what’s happened and what’s done. There are some specific models, which 1441
are well-known and they’ve got the names, and some general models. The moves and the 1442
traces of the cancer on the complex tracks and between complicated groups of cells could 1443
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1444
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1445
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1446

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1447
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1448
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1449
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1450
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1451
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1452
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1453
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1454
based on the fixed groups of cells or the fixed groups of group of cells? 1455
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1456
messy and dense SuperHyperModels where embedded notions are illustrated? 1457
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1458
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1459
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1460

research has taken more motivations to define SuperHyperClasses and to find some connections 1461
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1462
instances and examples to make clarifications about the framework of this research. The general 1463
results and some results about some connections are some avenues to make key point of this 1464
research, “Cancer’s Recognition”, more understandable and more clear. 1465
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1466
on the modeling of the regions where are under the attacks of the cancer to recognize 1467
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1468
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1469
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1470
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1471
instances and literature reviews have taken the whole way through. In this scientific research, 1472
the literature reviews have fulfilled the lines containing the notions and the results. The 1473
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1474
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1475
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1476
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1477
of the moves of the cancer in the longest and strongest styles with the formation of the design 1478
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1479
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1480
out the background for the SuperHyperNotions. 1481

CHAPTER 5 1482
Extreme Zero Forcing 1483
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1484
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1485
2023, (doi: 10.13140/RG.2.2.34953.52320). 1486

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1487
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1488
(doi: 10.13140/RG.2.2.33275.80161). 1489
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1490
10.13140/RG.2.2.11050.90569). 1492
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1493
10.13140/RG.2.2.17761.79206). 1495
10.13140/RG.2.2.19911.37285). 1498
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1499
10.13140/RG.2.2.23266.81602). 1501
10.13140/RG.2.2.19360.87048). 1504
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1505
10.13140/RG.2.2.32363.21286). 1507
10.13140/RG.2.2.11758.69441). 1510
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1511
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1512
10.13140/RG.2.2.31891.35367). 1513
10.13140/RG.2.2.21510.45125). 1516
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1517
10.13140/RG.2.2.13121.84321). 1519

CHAPTER 6 1520
New Ideas On Super forceps By Hyper 1521
ford Of Zero Forcing In Recognition of 1522
Cancer With (Neutrosophic) 1523
SuperHyperGraph 1524
49
CHAPTER 7 1525
ABSTRACT 1526
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperZero Forcing). 1527
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Zero Forcing pair S = (V, E). Consider 1528
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 1529
V 0 or E 0 is called Neutrosophic e-SuperHyperZero Forcing if the following expression is called 1530
Neutrosophic e-SuperHyperZero Forcing criteria holds 1531
They are ordered elements.

Every element inside omits its only unique neighbor outside
and it’s turn for next element inside to act on only-now-unique neighbor outside.
The order is important and every element outside is omitted
after the action of the last element inside.
Neutrosophic re-SuperHyperZero Forcing if the following expression is called Neutrosophic e- 1532
SuperHyperZero Forcing criteria holds 1533

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic v- 1534
SuperHyperZero Forcing if the following expression is called Neutrosophic v-SuperHyperZero Forcing 1535
criteria holds 1536

51
Neutrosophic rv-SuperHyperZero Forcing if the following expression is called Neutrosophic v- 1537


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Su- 1539
perHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero Forcing, Neutrosophic 1540

re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero Forcing, and Neutrosophic rv- 1541
SuperHyperZero Forcing. ((Neutrosophic) SuperHyperZero Forcing). Assume a Neutrosophic 1542
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 1543
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperZero Forcing if it’s either 1544
of Neutrosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic 1545

v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for an 1546
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Ex- 1547
treme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 1548
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVer- 1549
tices such that they form the Extreme SuperHyperZero Forcing; a Neutrosophic SuperHyperZero 1550
Forcing if it’s either of Neutrosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero 1551

Forcing, Neutrosophic v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and 1552
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1553
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 1554
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1555
SuperHyperVertices such that they form the Neutrosophic SuperHyperZero Forcing; an Extreme Su- 1556
perHyperZero Forcing SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperZero Forcing, 1557

Neutrosophic re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero Forcing, and Neutrosophic 1558
rv-SuperHyperZero Forcing and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 1559
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1560
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 1561
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 1562
Extreme SuperHyperVertices such that they form the Extreme SuperHyperZero Forcing; and 1563
the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperZero 1564
Forcing SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperZero Forcing, Neut- 1565
rosophic re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero Forcing, and Neutrosophic 1566
rv-SuperHyperZero Forcing and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 1567
is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as 1568
the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic Super- 1569
HyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 1570
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1571
the Neutrosophic SuperHyperZero Forcing; and the Neutrosophic power is corresponded to its 1572
Neutrosophic coefficient; an Extreme V-SuperHyperZero Forcing if it’s either of Neutrosophic 1573
e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero 1574
Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for an Extreme SuperHyper- 1575

Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1576
of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1577
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1578
the Extreme SuperHyperZero Forcing; a Neutrosophic V-SuperHyperZero Forcing if it’s either of 1579
Neutrosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic 1580
v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for a Neut- 1581
rosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 1582
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1583
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1584
such that they form the Neutrosophic SuperHyperZero Forcing; an Extreme V-SuperHyperZero 1585
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1590

is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined 1597
as the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 1598
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1599
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 1600

they form the Neutrosophic SuperHyperZero Forcing; and the Neutrosophic power is correspon- 1601
ded to its Neutrosophic coefficient. In this scientific research, new setting is introduced for 1602
new SuperHyperNotions, namely, a SuperHyperZero Forcing and Neutrosophic SuperHyperZero 1603
Forcing. Two different types of SuperHyperDefinitions are debut for them but the research 1604
goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based 1605
on that are well-defined and well-reviewed. The literature review is implemented in the 1606
whole of this research. For shining the elegancy and the significancy of this research, the 1607
comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental 1608
SuperHyperNumbers are featured. The definitions are followed by the examples and the 1609
instances thus the clarifications are driven with different tools. The applications are figured 1610
out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1611
Recognition” are the under research to figure out the challenges make sense about ongoing and 1612
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 1613
are different types of them. Some of them are individuals and some of them are well-modeled 1614
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 1615
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 1616
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 1617
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 1618
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 1619
this research. It’s also officially collected in the form of some questions and some problems. 1620
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperZero Forcing 1621

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1624
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1625
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperZero Forcing is a maximal 1626
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 1627
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 1628
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1629
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1630
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1631
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1632
SuperHyperZero Forcing . Since there’s more ways to get type-results to make a SuperHyperZero 1633
Forcing more understandable. For the sake of having Neutrosophic SuperHyperZero Forcing, there’s 1634
a need to “redefine” the notion of a “SuperHyperZero Forcing ”. The SuperHyperVertices and the 1635
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperZero 1637
Forcing . It’s redefined a Neutrosophic SuperHyperZero Forcing if the mentioned Table holds, 1638
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 1645
on a SuperHyperZero Forcing . It’s the main. It’ll be disciplinary to have the foundation of 1646
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperZero 1647
Forcing until the SuperHyperZero Forcing, then it’s officially called a “SuperHyperZero Forcing” but 1648
otherwise, it isn’t a SuperHyperZero Forcing . There are some instances about the clarifications 1649
for the main definition titled a “SuperHyperZero Forcing ”. These two examples get more scrutiny 1650
and discernment since there are characterized in the disciplinary ways of the SuperHyperClass 1651
based on a SuperHyperZero Forcing . For the sake of having a Neutrosophic SuperHyperZero 1652
Forcing, there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperZero Forcing” and a 1653
“Neutrosophic SuperHyperZero Forcing ”. The SuperHyperVertices and the SuperHyperEdges are 1654
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1655
of the position of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. 1656
It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHy- 1657
perZero Forcing are redefined to a “Neutrosophic SuperHyperZero Forcing” if the intended Table 1658
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 1659
ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperZero Forcing more 1660
understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 1661
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperZero Forcing, 1662
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, 1663

are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperZero Forcing”, “Neutrosophic Su- 1664
perHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 1665
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has 1666
a “Neutrosophic SuperHyperZero Forcing” where it’s the strongest [the maximum Neutrosophic 1667

value from all the SuperHyperZero Forcing amid the maximum value amid all SuperHyperVertices 1668
from a SuperHyperZero Forcing .] SuperHyperZero Forcing . A graph is a SuperHyperUniform 1669
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 1670
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 1671
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1672
with two exceptions; it’s SuperHyperZero Forcing if it’s only one SuperVertex as intersection amid 1673
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 1674
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 1675
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 1676
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 1677
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 1678
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 1679
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 1680
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 1681
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 1682
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 1683
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 1684
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 1685
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 1686
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 1687
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 1688
Recognition” and the results and the definitions will be introduced in redeemed ways. The 1689
recognition of the cancer in the long-term function. The specific region has been assigned 1690
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 1691
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 1694
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 1695
done. There are some specific models, which are well-known and they’ve got the names, and 1696
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 1697
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 1698
SuperHyperPath(-/SuperHyperZero Forcing, SuperHyperStar, SuperHyperBipartite, SuperHyper- 1699
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperZero Forcing 1700
or the strongest SuperHyperZero Forcing in those Neutrosophic SuperHyperModels. For the 1701
longest SuperHyperZero Forcing, called SuperHyperZero Forcing, and the strongest SuperHyperZero 1702
Forcing, called Neutrosophic SuperHyperZero Forcing, some general results are introduced. Beyond 1703
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but 1704
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 1705
a SuperHyperZero Forcing. There isn’t any formation of any SuperHyperZero Forcing but literarily, 1706
it’s the deformation of any SuperHyperZero Forcing. It, literarily, deforms and it doesn’t form. 1707
A basic familiarity with Neutrosophic SuperHyperZero Forcing theory, SuperHyperGraphs, and 1708
Neutrosophic SuperHyperGraphs theory are proposed. 1709

Keywords: Neutrosophic SuperHyperGraph, SuperHyperZero Forcing, Cancer’s Neutrosophic 1710
Recognition 1711

CHAPTER 8 1713
Applied Notions Under The Scrutiny Of 1714
The Motivation Of This Scientific 1715
Research 1716
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1717
try to bring the motivations in the narrative ways. Some cells have been faced with some 1718
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1719
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1720
as some groups and some groups or individuals have excessive labels which all are raised from 1721
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1722
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1723
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1724
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1725
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1726
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1727
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1728
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1729
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1730
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1731
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1732
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1733
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1734
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1735
The special case of this disease is considered and as the consequences of the model, some 1736
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1737
the special region are the matter of mind. The recognition of the cancer could help to find some 1738
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1739
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1740
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1741
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1742
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 1743
the formation of the design and the architecture are formally called “ SuperHyperZero Forcing” 1744
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1745
57
embedded styles to figure out the background for the SuperHyperNotions. The recognition 1746
of the cancer in the long-term function. The specific region has been assigned by the model 1747
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 1748
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 1749
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 1750
cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1751
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1752
are some specific models, which are well-known and they’ve got the names, and some general 1753
models. The moves and the traces of the cancer on the complex tracks and between complicated 1754
groups of cells could be fantasized by a Extreme SuperHyperPath (-/SuperHyperZero Forcing, 1755
is to find either the optimal SuperHyperZero Forcing or the Extreme SuperHyperZero Forcing in 1757
those Extreme SuperHyperModels. Some general results are introduced. Beyond that in 1758
SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1759
amount of SuperHyperZero Forcing” of either individual of cells or the groups of cells based on the 1764
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperZero Forcing” based on 1765
the fixed groups of cells or the fixed groups of group of cells? 1766
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1767
messy and dense SuperHyperModels where embedded notions are illustrated? 1768
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1769
it motivates us to define different types of “ SuperHyperZero Forcing” and “Extreme SuperHyperZero 1770
Forcing” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the research has 1771
taken more motivations to define SuperHyperClasses and to find some connections amid this 1772
SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances and 1773
examples to make clarifications about the framework of this research. The general results and 1774
some results about some connections are some avenues to make key point of this research, 1775
“Cancer’s Recognition”, more understandable and more clear. 1776
The framework of this research is as follows. In the beginning, I introduce basic definitions 1777
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1778
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1779
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1780
review literature are applied to make sense about what’s going to figure out about the 1781
upcoming sections. The main definitions and their clarifications alongside some results 1782
about new notions, SuperHyperZero Forcing and Extreme SuperHyperZero Forcing, are figured out 1783
in sections “ SuperHyperZero Forcing” and “Extreme SuperHyperZero Forcing”. In the sense of 1784
tackling on getting results and in Zero Forcing to make sense about continuing the research, the 1785
ideas of SuperHyperUniform and Extreme SuperHyperUniform are introduced and as their 1786
consequences, corresponded SuperHyperClasses are figured out to debut what’s done in this 1787
section, titled “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1788
As going back to origin of the notions, there are some smart steps toward the common 1789
notions to extend the new notions in new frameworks, SuperHyperGraph and Extreme 1790

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

SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 1792
concluding and closing section of theoretical research are contained in the section “General 1793
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1794
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 1795
“ SuperHyperZero Forcing”, “Extreme SuperHyperZero Forcing”, “Results on SuperHyperClasses” 1796
and “Results on Extreme SuperHyperClasses”. There are curious questions about what’s 1797
done about the SuperHyperNotions to make sense about excellency of this research and 1798
going to figure out the word “best” as the description and adjective for this research as 1799
presented in section, “ SuperHyperZero Forcing”. The keyword of this research debut in the section 1800
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1801
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1802
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1803

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

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1815
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1816
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1817
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1818
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1819
ideas and their clarifications are addressed to Ref.[HG38]. 1820

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

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

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

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 9.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG11s],Definition 2.5,p.2). 1824
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1825
where 1826
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1827
(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); 1828
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1829
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1830
1, 2, . . . , n0 ); 1831
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1832
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1833

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1840
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1841
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1842
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1843
E. Thus, the ii0 th element of the zero forcing of Neutrosophic SuperHyperGraph (NSHG) are 1844
of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1845

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

(Ref.[HG11s],Definition 2.7,p.3). 1847
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1848
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1849
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1850
(i) If |Vi | = 1, then Vi is called vertex; 1851
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1852
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1853
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1854
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1855
SuperEdge; 1856
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1857
SuperHyperEdge. 1858
If we choose different types of binary operations, then we could get hugely diverse types of 1859
general forms of Neutrosophic SuperHyperGraph (NSHG). 1860
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1861

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1862
x, y, z, w ∈ [0, 1]: 1863
(i) 1 ⊗ x = x; 1864
(ii) x ⊗ y = y ⊗ x; 1865
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1866
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1867

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

where 1870

1, 2, . . . , n0 ); 1875
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1876
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1877
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1878
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1879
0


SuperEdge; 1899
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1902
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1903
makes the patterns and regularities. 1904
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1905
of elements of SuperHyperEdges are the same. 1906

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1907
makes to have SuperHyperUniform more understandable. 1908
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1909
Classes as follows. 1910
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1911
two given SuperHyperEdges with two exceptions; 1912
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1913
SuperHyperEdges; 1914
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1915
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1916
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1917
in common; 1918
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1919
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1920
SuperHyperEdge in common; 1921
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1922
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1923
SuperVertex. 1924
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 1925
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1926
(i) Vi , Vi+1 ∈ Ei0 ; 1927
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1928
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1929
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1930
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1931
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1932
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1933
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1934
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1936
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1937
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1938
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1939
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1940
perPath . 1941
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 1942
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1943
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1944
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1945
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1946
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1947

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1960
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1961
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1962
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperZero Forcing). 1963

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1965
or E 0 is called 1966
(i) Neutrosophic e-SuperHyperZero Forcing if the following expression is called Neutro- 1967
sophic e-SuperHyperZero Forcing criteria holds 1968

(ii) Neutrosophic re-SuperHyperZero Forcing if the following expression is called Neutro- 1969
sophic re-SuperHyperZero Forcing criteria holds 1970

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 1971
(iii) Neutrosophic v-SuperHyperZero Forcing if the following expression is called Neutro- 1972
sophic v-SuperHyperZero Forcing criteria holds 1973


(iv) Neutrosophic rv-SuperHyperZero Forcing if the following expression is called Neutro- 1974

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 1976
(v) Neutrosophic SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 1977

Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero Forcing, and 1978
Neutrosophic rv-SuperHyperZero Forcing. 1979
Definition 9.0.19. ((Neutrosophic) SuperHyperZero Forcing). 1980

(i) an Extreme SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 1983

Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for an Extreme SuperHyperGraph 1985
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1986
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 1987
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1988
form the Extreme SuperHyperZero Forcing; 1989
(ii) a Neutrosophic SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 1990

Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for a Neutrosophic SuperHyper- 1992
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1993
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1994
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1995

that they form the Neutrosophic SuperHyperZero Forcing; 1996
(iii) an Extreme SuperHyperZero Forcing SuperHyperPolynomial if it’s either of Neut- 1997
rosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic 1998

v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for 1999
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 2000
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 2001
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 2002
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 2003
tices such that they form the Extreme SuperHyperZero Forcing; and the Extreme power is 2004
corresponded to its Extreme coefficient; 2005
(iv) a Neutrosophic SuperHyperZero Forcing SuperHyperPolynomial if it’s either of 2006

Neutrosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutro- 2007
sophic v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) 2008

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyper- 2009

Polynomial contains the Neutrosophic coefficients defined as the Neutrosophic number 2010
of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2011
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 2012
sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2013
Neutrosophic SuperHyperZero Forcing; and the Neutrosophic power is corresponded to its 2014
Neutrosophic coefficient; 2015
(v) an Extreme V-SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 2016

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 2020
(vi) a Neutrosophic V-SuperHyperZero Forcing if it’s either of Neutrosophic e- 2023

SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic v- 2024
SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for 2025
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardin- 2026
ality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 2027
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 2028
SuperHyperVertices such that they form the Neutrosophic SuperHyperZero Forcing; 2029
(vii) an Extreme V-SuperHyperZero Forcing SuperHyperPolynomial if it’s either of 2030

contains the Extreme coefficients defined as the Extreme number of the maximum 2034
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 2035
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 2036

SuperHyperVertices such that they form the Extreme SuperHyperZero Forcing; and the 2037
Extreme power is corresponded to its Extreme coefficient; 2038
(viii) a Neutrosophic SuperHyperZero Forcing SuperHyperPolynomial if it’s either of 2039

of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 2044
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 2045
Neutrosophic coefficient. 2048
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperZero Forcing). 2049
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2050

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
(i) an δ−SuperHyperZero Forcing is a Neutrosophic kind of Neutrosophic SuperHyperZero 2051

Forcing such that either of the following expressions hold for the Neutrosophic cardinalities 2052
of SuperHyperNeighbors of s ∈ S : 2053
|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 2054

(29.1), holds if S is an δ−SuperHyperDefensive; 2055
(ii) a Neutrosophic δ−SuperHyperZero Forcing is a Neutrosophic kind of Neutrosophic 2056
SuperHyperZero Forcing such that either of the following Neutrosophic expressions hold for 2057
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2058
|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 2059

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2060
For the sake of having a Neutrosophic SuperHyperZero Forcing, there’s a need to “redefine” the 2061
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 2062
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 2063
of the position of labels to assign to the values. 2064
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2065
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2066
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2067
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2068
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 2070
sophic SuperHyperPath , SuperHyperZero Forcing, SuperHyperStar, SuperHyperBipartite, Super- 2071
HyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutro- 2072
sophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic SuperHy- 2073
perBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic SuperHy- 2074
perWheel if the Table (29.2) holds. 2075

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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperZero Forcing. Since 2076
there’s more ways to get type-results to make a Neutrosophic SuperHyperZero Forcing more 2077
Neutrosophicly understandable. 2078
Neutrosophic notion of “Neutrosophic SuperHyperZero Forcing”. The SuperHyperVertices and the 2080
there’s the usage of the position of labels to assign to the values. 2082
136DEF1 Definition 9.0.23. Assume a SuperHyperZero Forcing. It’s redefined a Neutrosophic SuperHy- 2083
perZero Forcing if the Table (29.3) holds. 2084

CHAPTER 10 2085
Extreme SuperHyper But As The Zero Forcing 2086
Extensions Excerpt From Dense And 2087
Super Forms 2088
Definition 10.0.1. (Extreme event). 2089

Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2090
a probability Zero Forcing. Any Extreme k-subset of A of V is called Extreme k-event and if 2091
k = 2, then Extreme subset of A of V is called Extreme event. The following expression is 2092
called Extreme probability of A. 2093
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2094

Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2095
probability Zero Forcing. s Extreme k-events Ai , i ∈ I is called Extreme s-independent if the 2096
following expression is called Extreme s-independent criteria 2097
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 2098
following expression is called Extreme independent criteria 2099
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2100

a probability Zero Forcing. Any k-function Zero Forcing like E is called Extreme k-Variable. If 2102
k = 2, then any 2-function Zero Forcing like E is called Extreme Variable. 2103
The notion of independent on Extreme Variable is likewise. 2104
Definition 10.0.4. (Extreme Expectation). 2105
73
probability Zero Forcing. A Extreme k-Variable E has a number is called Extreme Expectation 2107
if the following expression is called Extreme Expectation criteria 2108
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2109

Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2110
is a probability Zero Forcing. A Extreme number is called Extreme Crossing if the following 2111
expression is called Extreme Crossing criteria 2112
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2113
S = (V, E) is a probability Zero Forcing. Let m and n propose special Zero Forcing. Then with m ≥ 4n, 2114
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Zero Forcing 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: 2115
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
2116
Theorem 10.0.7. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2117
S = (V, E) is a probability Zero Forcing. Let P be a SuperHyperSet of n points in the plane, and 2118
let l be the Extreme number of√ SuperHyperLines in the plane passing through at least k + 1 of 2119
these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2120
Proof. Form a Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2121

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

Theorem 10.0.8. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2127
S = (V, E) is a probability Zero Forcing. Let P be a SuperHyperSet of n points in the plane, and 2128
let k be the number of pairs of points of P at unit SuperHyperDistance. Then k < 5n4/3 . 2129
Proof. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2130
S = (V, E) is a probability Zero Forcing. Draw a SuperHyperUnit SuperHyperCircle around 2131
each SuperHyperPoint of P. Let ni be the Extreme number of these SuperHyperCircles 2132
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 2133
Now form a Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2134
SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on the 2135

SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2136
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 2137

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2138
as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2139
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2140
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2141
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2142
Proposition 10.0.9. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2143
Consider S = (V, E) is a probability Zero Forcing. Let X be a nonnegative Extreme Variable and t 2144
a positive real number. Then 2145
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. 2146
Corollary 10.0.10. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2147
Consider S = (V, E) is a probability Zero Forcing. Let Xn be a nonnegative integer-valued variable 2148
in a probability Zero Forcing (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as 2149
n → ∞. 2150
Proof. 2151
Theorem 10.0.11. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2152
Consider S = (V, E) is a probability Zero Forcing. A special SuperHyperGraph in Gn,p almost surely 2153
has stability number at most d2p−1 log ne. 2154

S = (V, E) is a probability Zero Forcing. A special SuperHyperGraph in Gn,p is up. Let G ∈ Gn,p 2156
and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. The 2157
probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability 2158
that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 2159
Extreme SuperHyperGraph G. 2160
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2161
Extreme Variable for this Extreme Event. By equation, we have 2162
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 2163
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2164
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: 2165
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2166
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 2167
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2168
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 2169
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2170
Definition 10.0.12. (Extreme Variance). 2171

probability Zero Forcing. A Extreme k-Variable E has a number is called Extreme Variance if 2173
the following expression is called Extreme Variance criteria 2174
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Zero Forcing. Let X be a Extreme Variable and let t be a 2176
positive real number. Then 2177
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Zero Forcing. Let X be a Extreme Variable and let t be a positive real 2179
number. Then 2180
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
2181
Consider S = (V, E) is a probability Zero Forcing. Let Xn be a Extreme Variable in a probability 2183
2
Zero Forcing (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E (Xn ), then 2184
E(Xn = 0) → 0 as n → ∞
Proof. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 2185
(V, E) is a probability Zero Forcing. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s Inequality, and 2186
observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 2187
when Xn = 0. 2188
Consider S = (V, E) is a probability Zero Forcing. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2190
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 2191
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2192
S = (V, E) is a probability Zero Forcing. As in the proof of related Theorem, the result is 2194
straightforward. 2195
Consider S = (V, E) is a probability Zero Forcing. Let G ∈ Gn,1/2 and let f and k ∗ be as defined in 2197
previous Theorem. Then either: 2198
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2199
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2200
S = (V, E) is a probability Zero Forcing. The latter is straightforward. 2202
Definition 10.0.17. (Extreme Threshold). 2203

a probability Zero Forcing. Let P be a monotone property of SuperHyperGraphs (one which is 2205
preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is a function 2206
f (n) such that: 2207
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2208
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2209

Definition 10.0.18. (Extreme Balanced). 2210

probability Zero Forcing. Let F be a fixed Extreme SuperHyperGraph. Then there is a threshold 2212
function for the property of containing a copy of F as a Extreme SubSuperHyperGraph is called 2213
Extreme Balanced. 2214
Consider S = (V, E) is a probability Zero Forcing. Let F be a nonempty balanced Extreme 2216
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2217
threshold function for the property of containing F as a Extreme SubSuperHyperGraph. 2218
136EXM1 Example 10.0.20. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 2221
mentioned Extreme Figures in every Extreme items. 2222
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperZero 2223
Forcing, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 2224
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is a 2225
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2226
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2227
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 2228
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2229
SuperHyperZero Forcing. 2230
C(N SHG)Extreme Zero Forcing =

{E4 }.
C(N SHG)Extreme Zero Forcing SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Zero Forcing =
{V4 }.
C(N SHG)Extreme V-Zero Forcing SuperHyperPolynomial
= z5.
2231
Forcing, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 2233
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the 2234
terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 2235
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2236
SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHyperVertex, 2237
V3 , is excluded in every given Extreme SuperHyperZero Forcing. 2238

{E4 }.

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperZero Forcing in the Extreme Example (42.0.3) 136NSHG1

= z3.
{V4 }.
= z5.
2239
Forcing, is up. The Extreme Algorithm is Extremely straightforward. 2241

{E4 }.
= z3.
{V3 }.
= z8.
2242



{E2 , E1 , E4 , E5 }.
= 2z 5 + 2z 3 .
{V1 , V3 , V4 }.
= z 4 + z 3 + 2z 2 + 4z.
2245

{}.
= 0z 0 .
{}.

= 0z 0 .
2248

{}.
= 0z 0 .
{}.
= 0z 0 .
2251

{}.
= 0z 0 .
{}.
= 0z 0 .
2254

{}.
= 0z 0 .
{}.

= 0z 0 .
2257

{}.
= 0z 0 .
{}.
= 0z 0 .
2260

{}.



= 0z 0 .
{}.
= 0z 0 .
2263

{}.
= 0z 0 .
{}.
= 0z 0 .
2266


{}.
= 0z 0 .
{}.
= 0z 0 .
2269

{}.
= 0z 0 .


{}.
= 0z 0 .
2272

{E2 , E1 }.
= 2z 2 .
{V2 , V1 , V3 }.
= 2z 5 + z 3 .
2275


{E1 , E2 , E3 , E4 , E5 }.
X
= z |Ei | .
Ei ∈EN SHG
{V5 , V1 , V2 , V3 , V4 , V6 }.
X
= z |Vi | .
Vi ∈VN SHG
2278

{E1 , E2 , E3 , E4 , E5 }.

X
= z |Ei | .
Ei ∈EN SHG
{V1 , V2 , V6 , V10 , V17 , V22 }.
X
= z |Vi | .
Vi ∈{V1 ,V2 ,V6 ,V10 ,V17 ,V22 }
2281

{E6 , E1 , E2 , E3 , E4 , E5 }.


X
= z |Ei | .
Ei ∈EN SHG
{V27 , V1 , V2 , V6 , V10 , V17 , V22 }.
X
= z |Vi | .
Vi ∈{V27 ,V1 ,V2 ,V6 ,V10 ,V17 ,V22 }
2284

{E1 , E2 , E3 , E4 , E5 , E6 }.
X
= z |Ei | .
Ei ∈EN SHG
{V27 , V1 , V2 , V6 , V10 , V17 , V22 }.

X
= z |Vi | .
Vi ∈{V27 ,V1 ,V2 ,V6 ,V10 ,V17 ,V22 }
2287

{}.
= 0z 0 .
{VE1 \ {V1 , V2 }, V2 , V3 , . . . , V11 }.
X
= z |Vi | .
Vi ∈{VE1 \{V1 ,V2 },V2 ,V3 ,...,V11 }
2290

, is up. The Extreme Algorithm is Extremely straightforward.

Forcing 2292

{}.
= 0z 0 .
{}.
= 0z 0 .
2293

{E2 }.
= z |E2 | .

{V1 }.
= z |V1 | .
2296

{E2 , E3 , E4 , E5 }.
X
= z |Ei | .
Ei ∈{EN SHG \{E1 }}

{V1 , V3 , V6 }.
X
= z |Vi | .
Vi ∈{V1 ,V3 ,V6 }
2299

SuperHyperZero Forcing in the Extreme Example (42.0.3) 95NHG1
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The 2300
all interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Zero Forcing if for any 2301
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2302
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2303
all minus all Extreme SuperHypeNeighbors to any amount of them. 2304
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2305

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

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme

SuperHyperZero Forcing in the Extreme Example (42.0.3) 95NHG2
cardinality of the Extreme R-Zero Forcing is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Zero Forcing is at least the 2312
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2313
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2314
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2315
SuperHyperVertices are renamed to Extreme Zero Forcing in some cases but the maximum number of 2316
the Extreme SuperHyperEdge with the maximum Extreme number of Extreme SuperHyperVertices, 2317
has the Extreme SuperHyperVertices are contained in a Extreme R-Zero Forcing. 2318
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Zero Forcing 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 a Extreme type-result-R-Zero Forcing with the least Extreme cardinality, the lower sharp 2319
Extreme bound for cardinality. 2320
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2321

Then in the worst case, literally, 2322
C(N SHG)ExtremeQuasi−ZeroF orcing

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ZeroF orcingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ZeroF orcing = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ZeroF orcingSuperHyperP olynomial = z 5 .
Is a Extreme type-result-Zero Forcing. In other words, the least cardinality, the lower sharp bound 2323
for the cardinality, of a Extreme type-result-Zero Forcing is the cardinality of 2324

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ZeroF orcingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ZeroF orcing = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ZeroF orcingSuperHyperP 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-Zero Forcing 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 a 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-Zero Forcing. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Zero Forcing 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-Zero Forcing. 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-Zero Forcing decorates the Extreme SuperHyperVertices
don’t have received any Extreme connections so as this Extreme style implies different versions
of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of Extreme
SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum Extreme
groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex in
the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore, the
Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about the
Extreme R-Zero Forcing. 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
a Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus there’s at least
a Extreme R-Zero Forcing has the Extreme cardinality of a Extreme SuperHyperEdge. Thus, a
Extreme R-Zero Forcing has the Extreme cardinality at least a Extreme SuperHyperEdge. Assume
a Extreme SuperHyperSet V \ V \ {z}. This Extreme SuperHyperSet isn’t a Extreme R-Zero
Forcing since either the Extreme SuperHyperGraph is an obvious Extreme SuperHyperModel

thus it never happens since there’s no Extreme usage of this Extreme framework and even
more there’s no Extreme connection inside or the Extreme SuperHyperGraph isn’t obvious
and as its consequences, there’s a Extreme contradiction with the term “Extreme R-Zero Forcing”
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-Zero Forcing 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 a
Extreme SuperHyperClass of a Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes a 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 a Extreme R-Zero Forcing 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 a 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 a Extreme R-Zero Forcing. Those Extreme SuperHyperVertices are
potentially included in a Extreme style-R-Zero Forcing. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of a 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-Zero Forcing is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Zero Forcing but with slightly
differences in the maximum Extreme cardinality amid those Extreme type-SuperHyperSets
of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

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

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.

2326
Extreme R-Zero Forcing =

Thus E ∈ EESHG:(V,E) is a Extreme quasi-R-Zero Forcing where E ∈ EESHG:(V,E) is fixed that

means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in a Extreme
Zero Forcing, 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 a Extreme SuperHyperEdge
E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme cardinality of the
Extreme R-Zero Forcing is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Zero Forcing is at least the 2327
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2328
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2329
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2330
SuperHyperVertices are renamed to Extreme Zero Forcing in some cases but the maximum 2331
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2332
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in a Extreme R-Zero 2333
Forcing. 2334
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2335
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2336
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2337
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2338
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2339
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2340
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2341
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2342
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVer- 2343
tices. Thus it forms a Extreme quasi-R-Zero Forcing where the Extreme completion of the Extreme 2344
incidence is up in that. Thus it’s, literarily, a Extreme embedded R-Zero Forcing. The SuperHyper- 2345
Notions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, 2346
these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. 2347
Thus the embedded setting is elected such that those SuperHyperSets have the maximum 2348
Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. The less than two 2349
distinct types of Extreme SuperHyperVertices are included in the minimum Extreme style of 2350
the embedded Extreme R-Zero Forcing. The interior types of the Extreme SuperHyperVertices are 2351
deciders. Since the Extreme number of SuperHyperNeighbors are only affected by the interior 2352
Extreme SuperHyperVertices. The common connections, more precise and more formal, the 2353
perfect unique connections inside the Extreme SuperHyperSet for any distinct types of Extreme 2354
SuperHyperVertices pose the Extreme R-Zero Forcing. Thus Extreme exterior SuperHyperVertices 2355
could be used only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with 2356
the interior Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded 2357
Extreme Zero Forcing, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2358
more connections inside more than outside. Thus the title “exterior” is more relevant than the 2359

title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme 2360
SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has been 2361
ignored in the exploring to lead on the optimal case implying the Extreme R-Zero Forcing. The 2362
Extreme R-Zero Forcing with the exclusion of the exclusion of all Extreme SuperHyperVertices 2363
in one Extreme SuperHyperEdge and with other terms, the Extreme R-Zero Forcing with the 2364
inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is a Extreme 2365
quasi-R-Zero Forcing. To sum them up, in a connected non-obvious Extreme SuperHyperGraph 2366
ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the 2367
maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of any given 2368
Extreme quasi-R-Zero Forcing minus all Extreme SuperHypeNeighbor to some of them but not all 2369
of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2370
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Zero Forcing, minus all 2371
Extreme SuperHypeNeighbor to some of them but not all of them. 2372

The main definition of the Extreme R-Zero Forcing has two titles. a Extreme quasi-R-Zero Forcing 2373
and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are two titles in the 2374
terms of quasi-R-styles. For any Extreme number, there’s a Extreme quasi-R-Zero Forcing with 2375
that quasi-maximum Extreme SuperHyperCardinality in the terms of the embedded Extreme 2376
SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then the Extreme 2377
quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi-R-Zero Forcings for 2378
all Extreme numbers less than its Extreme corresponded maximum number. The essence of the 2379
Extreme Zero Forcing ends up but this essence starts up in the terms of the Extreme quasi-R-Zero 2380
Forcing, again and more in the operations of collecting all the Extreme quasi-R-Zero Forcings acted 2381
on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2382
number. This Extreme number is 2383
considered as the equivalence class for all corresponded quasi-R-Zero Forcings. Let 2384
zExtreme Number , SExtreme SuperHyperSet and GExtreme Zero Forcing be a Extreme number, a Ex- 2385
treme SuperHyperSet and a Extreme Zero Forcing. Then 2386
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Zero Forcing ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Zero Forcing is re-formalized and redefined 2387
as follows. 2388
GExtreme Zero Forcing ∈ ∪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 2389

definition for the Extreme Zero Forcing . 2390
GExtreme Zero Forcing =

{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 Zero Forcing 2391
poses the upcoming expressions. 2392

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

= max zExtreme Number
[zExtreme
Number ]Extreme Class

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


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



2396

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

2397


2398


Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2399
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2400
that any amount of its Extreme SuperHyperVertices are incident to a Extreme SuperHyperEdge. 2401
It’s, literarily, another name for “Extreme Quasi-Zero Forcing” but, precisely, it’s the generalization 2402
of “Extreme Quasi-Zero Forcing” since “Extreme Quasi-Zero Forcing” happens “Extreme Zero Forcing” 2403
in a Extreme SuperHyperGraph as initial framework and background but “Extreme SuperHy- 2404
perNeighborhood” may not happens “Extreme Zero Forcing” in a Extreme SuperHyperGraph as 2405
initial framework and preliminarily background since there are some ambiguities about the 2406
Extreme SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Extreme 2407
SuperHyperNeighborhood”, “Extreme Quasi-Zero Forcing”, and “Extreme Zero Forcing” are up. 2408
Thus, let 2409
zExtreme Number , NExtreme SuperHyperNeighborhood and 2410
GExtreme Zero Forcing be a Extreme number, a Extreme SuperHyperNeighborhood and a Extreme 2411
Zero Forcing and the new terms are up. 2412
GExtreme Zero Forcing ∈ ∪zExtreme Number

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

2413

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

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

And with go back to initial structure, 2416
GExtreme Zero Forcing ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


2417

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


2418


2419


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

a Extreme type-SuperHyperSet with
the maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme Supe-

rHyperVertices such that there’s no a Extreme SuperHyperEdge amid some Extreme SuperHy-
perVertices instead of all given by
Extreme Zero Forcing is related to the Extreme SuperHyperSet of the Extreme SuperHyperVer-
tices,

There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Zero Forcing is up. The obvious simple Extreme type-SuperHyperSet
called the Extreme Zero Forcing is a 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-Zero Forcing is up. To sum them up, the Extreme
SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Zero Forcing. Since the
Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Zero Forcing C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is the
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no a Extreme
SuperHyperEdge for some Extreme SuperHyperVertices instead of all given by that Extreme
type-SuperHyperSet called the Extreme Zero Forcing and it’s an Extreme Zero Forcing. Since it’s
the maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme Supe-

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

is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Zero Forcing , not:
Is the Extreme SuperHyperSet, not:

does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2420
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2421
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2422
the 2423

“Extreme R-Zero Forcing” 2424
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2425
Extreme R-Zero Forcing, 2426
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyperMod-

eling. It’s also, not only a Extreme free-triangle embedded SuperHyperModel and a Extreme
on-triangle embedded SuperHyperModel but also it’s a Extreme stable embedded SuperHyper-
Model. But all only non-obvious simple Extreme type-SuperHyperSets of the Extreme R-Zero
Forcing amid those obvious simple Extreme type-SuperHyperSets of the Extreme Zero Forcing, 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 a Extreme R-Zero Forcing. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a Extreme R-Zero Forcing is the cardinality of
2427
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2428
Extreme SuperHyperVertices belong to any Extreme quasi-R-Zero Forcing if for any of them, and 2429
any of other corresponded Extreme SuperHyperVertex, some interior Extreme SuperHyperVer- 2430
tices are mutually Extreme SuperHyperNeighbors with no Extreme exception at all minus all 2431
Extreme SuperHypeNeighbors to any amount of them. 2432
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let a Extreme SuperHy- 2433
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2434
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2435
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2436
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s a Extreme 2437
R-Zero Forcing with the least cardinality, the lower sharp Extreme bound for Extreme cardinality. 2438
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme SuperHyperSet 2439
of the Extreme SuperHyperVertices VESHE \ {z} is a Extreme SuperHyperSet S of the Extreme 2440
SuperHyperVertices such that there’s a Extreme SuperHyperEdge to have some Extreme 2441
SuperHyperVertices uniquely but it isn’t a Extreme R-Zero Forcing. Since it doesn’t have 2442
2443
the maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme Supe- 2444
rHyperVertices such that there’s a Extreme SuperHyperEdge to have some SuperHyperVertices 2445
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2446

maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme SuperHyperVertices 2447

but it isn’t a Extreme R-Zero Forcing. Since it doesn’t do the Extreme procedure such that 2448
such that there’s a Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2449
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2450
in the connected Extreme SuperHyperGraph ESHG : (V, E), a Extreme SuperHyperVertex, 2451
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2452
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2453
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2454
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Zero Forcing, VESHE is up. 2455
The obvious simple Extreme type-SuperHyperSet of the Extreme R-Zero Forcing, VESHE , is a 2456
Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms 2457
any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme 2458
SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme Super- 2459
HyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of a Extreme 2460
SuperHyperSet S of Extreme SuperHyperVertices such that there’s a Extreme SuperHy- 2461
perEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme 2462
SuperHyperGraph ESHG : (V, E). Any Extreme R-Zero Forcing only contains all interior Extreme 2463
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2464
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2465
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2466
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2467
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2468
The SuperHyperNotion, namely, Zero Forcing, is up. There’s neither empty SuperHyperEdge 2469
nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2470
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Zero 2471

Forcing. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2472

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−ZeroF orcingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−ZeroF orcing = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−ZeroF orcingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Zero Forcing. The Extreme 2473
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2474

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


= az s + bz t .
Is an Extreme Zero Forcing C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is a 2475
Extreme type-SuperHyperSet with 2476
2477
rHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of a 2479
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2480
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2481
Extreme SuperHyperSet. Thus the non-obvious Extreme Zero Forcing is up. The obvious simple 2482
Extreme type-SuperHyperSet called the Extreme Zero Forcing is a Extreme SuperHyperSet 2483
includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet of the 2484
Extreme SuperHyperEdges[SuperHyperVertices], 2485

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 SuperHy- 2486
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Zero 2487
Forcing is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2488
perEdges[SuperHyperVertices], 2489

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 Zero Forcing. Since the 2490
Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2491

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

= 2z b 2 c
.
= az s + bz t .
Is an Extreme Zero Forcing C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is the 2492
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no a Extreme Supe- 2493
rHyperEdge for some Extreme SuperHyperVertices given by that Extreme type-SuperHyperSet 2494
called the Extreme Zero Forcing and it’s an Extreme Zero Forcing. Since it’s 2495
2496
rHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of a 2498
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2499
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2500
intended Extreme SuperHyperSet, 2501

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Zero Forcing , 2502

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 Zero Forcing , not: 2503

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


= az s + bz t .
Is the Extreme SuperHyperSet, not: 2504

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 2505
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2506
SuperHyperSet called the 2507
“Extreme Zero Forcing ” 2508
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2509
Extreme Zero Forcing , 2510
is only and only 2511

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

CHAPTER 11 2513
The Extreme Departures on The 2514
Theoretical Results Toward Theoretical 2515
Motivations 2516
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2517
SuperHyperClasses. 2518
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2519

{Ei ∈ EN SHG }.
X
= z |Ei | .
Ei ∈EN SHG
{VEIN
1
T ERN AL
, VEEXT ERN AL
i ∈EN SHG
}.
X
= z |Vi | .
Vi ∈{VEIN T ERN AL ,VEEXT
∈E
ERN AL }
1 i N SHG
Proof. Let 2520
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2521
P :
E1 , V1EXT ERN AL ,
115
Figure 11.1: a Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperZero

in the Example (42.0.5)
Forcing 136NSHG18a
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2522
new way to redefine as 2523
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 2524
ViEXT ERN AL in the literatures of SuperHyperZero Forcing. The latter is straightforward. 2525
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2526
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2527
(31.1), is the SuperHyperZero Forcing. 2528
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2529

{}.


= 0z 0 .
{VEIN
1
T ERN AL
, VEEXT ERN AL
i ∈EN SHG
}.
X
= z |Vi | .
∈E
ERN AL }
1 i N SHG
Proof. Let 2530
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2531
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 2532

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2536
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2537
SuperHyperModel (31.2), is the Extreme SuperHyperZero Forcing. 2538

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

SuperHyperZero Forcing in the Extreme Example (42.0.7) 136NSHG19a
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2539

{}.
= 0z 0 .
{}.
= 0z 0 .
Proof. Let 2540
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2541
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

SuperHyperZero Forcing in the Extreme Example (42.0.9) 136NSHG20a
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2542
way to redefine as 2543

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2546
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2547
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2548
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperZero Forcing. 2549
2550
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2551

{}.

= 0z 0 .
{}.
= 0z 0 .
Proof. Let 2552
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
2553
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 2554
a new way to redefine as 2555

ViEXT ERN AL in the literatures of SuperHyperZero Forcing. The latter is straightforward. Then 2557
there’s no at least one SuperHyperZero Forcing. Thus the notion of quasi may be up but the 2558
SuperHyperNotions based on SuperHyperZero Forcing could be applied. There are only two 2559
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 2560
representative in the 2561
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperZero Forcing taken from a connected Extreme SuperHyperBipartite ESHB : 2562
(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2563
SuperHyperEdges are attained in any solution 2564
P :

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

Extreme SuperHyperZero Forcing in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2565
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2566
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2567
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2568
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2569
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperZero Forcing. 2570
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2571
Then 2572

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

Proof. Let 2573
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2574
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperZero Forcing taken from a connected Extreme SuperHyperMultipartite 2575

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

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2577
to ViEXT ERN AL in the literatures of SuperHyperZero Forcing. The latter is straightforward. 2578
Then there’s no at least one SuperHyperZero Forcing. Thus the notion of quasi may be up 2579
but the SuperHyperNotions based on SuperHyperZero Forcing could be applied. There are only 2580
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 2581
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2583

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2586

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

SuperHyperZero Forcing in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2588
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2589
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2590
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2591
the Extreme SuperHyperZero Forcing. 2592
∗
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ). 2593
Then, 2594

{}.
= 0z 0 .
{}.
= 0z 0 .
Proof. Let 2595
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

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

Extreme SuperHyperZero Forcing in the Extreme Example (42.0.15) 136NSHG23a
2596
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperZero Forcing taken from a connected Extreme SuperHyperWheel ESHW : 2597
(V, E). There’s a new way to redefine as 2598

Then there’s at least one SuperHyperZero Forcing. Thus the notion of quasi isn’t up and 2601
the SuperHyperNotions based on SuperHyperZero Forcing could be applied. The unique 2602
embedded SuperHyperZero Forcing proposes some longest SuperHyperZero Forcing excerpt from 2603
some representatives. The latter is straightforward. 2604
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2605
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2606
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2607
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2608
Extreme SuperHyperZero Forcing. 2609

CHAPTER 12 2610
The Surveys of Mathematical Sets On 2611
The Results But As The Initial Motivation 2612
For the SuperHyperZero Forcing, Extreme SuperHyperZero Forcing, and the Extreme SuperHyperZero 2613
, some general results are introduced.
Forcing 2614
Remark 12.0.1. Let remind that the Extreme SuperHyperZero Forcing is “redefined” on the 2615
positions of the alphabets. 2616
Corollary 12.0.2. Assume Extreme SuperHyperZero Forcing. Then 2617
Extreme SuperHyperZeroF orcing =

{theSuperHyperZeroF orcingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperZeroF orcing
|ExtremecardinalityamidthoseSuperHyperZeroF orcing. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2618
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2619
and the neutrality, for i = 1, 2, 3, respectively. 2620
Corollary 12.0.3. Assume a Extreme SuperHyperGraph on the same identical letter of the 2621
alphabet. Then the notion of Extreme SuperHyperZero Forcing and SuperHyperZero Forcing coincide. 2622
alphabet. Then a consecutive sequence of the SuperHyperVertices is a Extreme SuperHyperZero 2624
Forcing if and only if it’s a SuperHyperZero Forcing. 2625
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperZero 2627
Forcing if and only if it’s a longest SuperHyperZero Forcing. 2628
Corollary 12.0.6. Assume SuperHyperClasses of a Extreme SuperHyperGraph on the same 2629
identical letter of the alphabet. Then its Extreme SuperHyperZero Forcing is its SuperHyperZero 2630
Forcing and reversely. 2631
125
Corollary 12.0.7. Assume a Extreme SuperHyperPath(-/SuperHyperZero Forcing, SuperHyperStar, 2632

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of 2633
the alphabet. Then its Extreme SuperHyperZero Forcing is its SuperHyperZero Forcing and reversely. 2634
Corollary 12.0.8. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperZero Forcing 2635
isn’t well-defined if and only if its SuperHyperZero Forcing isn’t well-defined. 2636
Corollary 12.0.9. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its Extreme 2637
SuperHyperZero Forcing isn’t well-defined if and only if its SuperHyperZero Forcing isn’t well-defined. 2638
Corollary 12.0.10. Assume a Extreme SuperHyperPath(-/SuperHyperZero Forcing, SuperHyper- 2639

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2640
SuperHyperZero Forcing isn’t well-defined if and only if its SuperHyperZero Forcing isn’t well-defined. 2641
Corollary 12.0.11. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperZero 2642
is well-defined if and only if its SuperHyperZero Forcing is well-defined.
Forcing 2643
Corollary 12.0.12. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its 2644

Extreme SuperHyperZero Forcing is well-defined if and only if its SuperHyperZero Forcing is well- 2645
defined. 2646
Corollary 12.0.13. Assume a Extreme SuperHyperPath(-/SuperHyperZero Forcing, SuperHyper- 2647

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2648
SuperHyperZero Forcing is well-defined if and only if its SuperHyperZero Forcing is well-defined. 2649
Proposition 12.0.14. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then V is 2650
(i) : the dual SuperHyperDefensive SuperHyperZero Forcing; 2651
(ii) : the strong dual SuperHyperDefensive SuperHyperZero Forcing; 2652
(iii) : the connected dual SuperHyperDefensive SuperHyperZero Forcing; 2653
(iv) : the δ-dual SuperHyperDefensive SuperHyperZero Forcing; 2654
(v) : the strong δ-dual SuperHyperDefensive SuperHyperZero Forcing; 2655
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperZero Forcing. 2656
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be a Extreme SuperHyperGraph. Then ∅ is 2657
(i) : the SuperHyperDefensive SuperHyperZero Forcing; 2658
(ii) : the strong SuperHyperDefensive SuperHyperZero Forcing; 2659
(iii) : the connected defensive SuperHyperDefensive SuperHyperZero Forcing; 2660
(iv) : the δ-SuperHyperDefensive SuperHyperZero Forcing; 2661
(v) : the strong δ-SuperHyperDefensive SuperHyperZero Forcing; 2662
(vi) : the connected δ-SuperHyperDefensive SuperHyperZero Forcing. 2663
Proposition 12.0.16. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then an independent 2664
SuperHyperSet is 2665

(iii) : the connected SuperHyperDefensive SuperHyperZero Forcing; 2668
Proposition 12.0.17. Let ESHG : (V, E) be a Extreme SuperHyperUniform SuperHyperGraph 2672

which is a SuperHyperZero Forcing/SuperHyperPath. Then V is a maximal 2673
(i) : SuperHyperDefensive SuperHyperZero Forcing; 2674
(ii) : strong SuperHyperDefensive SuperHyperZero Forcing; 2675
(iii) : connected SuperHyperDefensive SuperHyperZero Forcing; 2676
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperZero Forcing; 2677
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperZero Forcing; 2678
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperZero Forcing; 2679
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2680
Proposition 12.0.18. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is a 2681

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2682
(i) : dual SuperHyperDefensive SuperHyperZero Forcing; 2683
(ii) : strong dual SuperHyperDefensive SuperHyperZero Forcing; 2684
(iii) : connected dual SuperHyperDefensive SuperHyperZero Forcing; 2685
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperZero Forcing; 2686
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperZero Forcing; 2687
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperZero Forcing; 2688
which is a SuperHyperZero Forcing/SuperHyperPath. Then the number of 2691
(i) : the SuperHyperZero Forcing; 2692
(ii) : the SuperHyperZero Forcing; 2693
(iii) : the connected SuperHyperZero Forcing; 2694
(iv) : the O(ESHG)-SuperHyperZero Forcing; 2695

(v) : the strong O(ESHG)-SuperHyperZero Forcing; 2696
(vi) : the connected O(ESHG)-SuperHyperZero Forcing. 2697
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2698
coincide. 2699

which is a SuperHyperWheel. Then the number of 2701
(i) : the dual SuperHyperZero Forcing; 2702
(ii) : the dual SuperHyperZero Forcing; 2703
(iii) : the dual connected SuperHyperZero Forcing; 2704
(iv) : the dual O(ESHG)-SuperHyperZero Forcing; 2705
(v) : the strong dual O(ESHG)-SuperHyperZero Forcing; 2706
(vi) : the connected dual O(ESHG)-SuperHyperZero Forcing. 2707
coincide. 2709

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2711
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2712
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2713
is a 2714
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperZero Forcing; 2718
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperZero Forcing; 2719
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperZero Forcing. 2720

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2723
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2724
SuperHyperPart is a 2725

(iv) : δ-SuperHyperDefensive SuperHyperZero Forcing; 2729
(v) : strong δ-SuperHyperDefensive SuperHyperZero Forcing; 2730
(vi) : connected δ-SuperHyperDefensive SuperHyperZero Forcing. 2731

SuperHyperMultipartite. Then Then the number of 2734
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2741
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2742
Proposition 12.0.24. Let ESHG : (V, E) be a Extreme SuperHyperGraph. The number of 2744
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2745
(iv) : SuperHyperZero Forcing; 2749
(v) : strong 1-SuperHyperDefensive SuperHyperZero Forcing; 2750
(vi) : connected 1-SuperHyperDefensive SuperHyperZero Forcing. 2751
Proposition 12.0.25. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then the number is 2752
at most O(ESHG) and the Extreme number is at most On (ESHG). 2753
Proposition 12.0.26. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Su- 2754
perHyperComplete. The number is O(ESHG:(V,E))2 + 1 and the Extreme number is 2755
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2756
t>
2

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperZero Forcing; 2760
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperZero Forcing. 2762
Proposition 12.0.27. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is ∅. The 2763
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2764
dual 2765
(iv) : 0-SuperHyperDefensive SuperHyperZero Forcing; 2769
Proposition 12.0.28. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHy- 2772
perComplete. Then there’s no independent SuperHyperSet. 2773
Proposition 12.0.29. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHy- 2774
perZero Forcing/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) and the 2775
Extreme number is On (ESHG : (V, E)), in the setting of a dual 2776
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperZero Forcing; 2780
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperZero Forcing; 2781
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperZero Forcing. 2782
Proposition 12.0.30. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Super- 2783
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2784
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2785
t>
2
setting of a dual 2786



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2793
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2794
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2795
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2796
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2797
SuperHyperDefensive SuperHyperZero Forcing, then ∀v ∈ V \ S, ∃x ∈ S such that 2798
(i) v ∈ Ns (x); 2799
(ii) vx ∈ E. 2800
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2801
SuperHyperDefensive SuperHyperZero Forcing, then 2802
(i) S is SuperHyperZero Forcing set; 2803
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2804
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2805
(i) Γ ≤ O; 2806
(ii) Γs ≤ On . 2807
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2808
connected. Then 2809
(i) Γ ≤ O − 1; 2810
(ii) Γs ≤ On − Σ3i=1 σi (x). 2811
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2812
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperZero 2813

Forcing; 2814
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2815
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2816
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2817
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2819
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperZero Forcing; 2820

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2821
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2822
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2823
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperZero Forcing. Then 2825
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperZero 2826

Forcing; 2827
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2828
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2829
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2830
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperZero Forcing. Then 2832

Forcing; 2834
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2836
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2837
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2839
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperZero Forcing; 2840
(ii) Γ = 1; 2841
(iii) Γs = Σ3i=1 σi (c); 2842
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperZero Forcing. 2843
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2844
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2845
SuperHyperDefensive SuperHyperZero Forcing; 2846
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2847
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2848
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2849
SuperHyperDefensive SuperHyperZero Forcing. 2850
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2851

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperZero Forcing; 2852
(ii) Γ = b n2 c + 1; 2853
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 2854
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperZero 2855
Forcing. 2856
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2857
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperZero Forcing; 2858
(ii) Γ = b n2 c; 2859
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 2860
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHy- 2861
perZero Forcing. 2862
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2863
Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2864
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperZero 2865

Forcing for N SHF; 2866
(ii) Γ = m for N SHF : (V, E); 2867
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2868
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperZero Forcing 2869
for N SHF : (V, E). 2870
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2871

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2872
b n c+1
2
is a dual maximal SuperHyperDefensive SuperHyperZero 2873
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2875
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 2876
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperZero Forcing for 2877
N SHF : (V, E). 2878
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2879

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2880
bnc
2
is a dual SuperHyperDefensive SuperHyperZero Forcing for 2881
N SHF : (V, E); 2882

(ii) Γ = b n2 c for N SHF : (V, E); 2883
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 2884
S={vi }i=1
bnc
2
are only dual maximal SuperHyperZero Forcing for 2885
N SHF : (V, E). 2886
following statements hold; 2888
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2889

SuperHyperZero Forcing, then S is an s-SuperHyperDefensive SuperHyperZero Forcing; 2890
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2891

SuperHyperZero Forcing, then S is a dual s-SuperHyperDefensive SuperHyperZero Forcing. 2892
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2895

SuperHyperZero Forcing, then S is an s-SuperHyperPowerful SuperHyperZero Forcing; 2896

SuperHyperZero Forcing, then S is a dual s-SuperHyperPowerful SuperHyperZero Forcing. 2898
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2899

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

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

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

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

(iii) ∀a ∈ S, |Ns (a)∩V \S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive SuperHyperZero 2915
Forcing; 2916

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


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

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

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


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


SuperHyperGraph which is SuperHyperZero Forcing. Then following statements hold; 2940
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperZero 2941
Forcing; 2942
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2943

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

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

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

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

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


CHAPTER 13 2959
Extreme Applications in Cancer’s 2960
Extreme Recognition 2961
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2962
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2963
as the consequences of the model, some parameters are used. The cells are under attack of this 2964
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2965
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2966
In the following, some Extreme steps are Extreme devised on this disease. 2967
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2968
function. 2969
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2970
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2971
effects of the cancer on that region; this event leads us to choose another model [it’s said 2974
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2975
what’s done. 2976
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2977
they’ve got the names, and some general Extreme models. The moves and the Extreme 2978
traces of the cancer on the complex tracks and between complicated groups of cells could 2979
be fantasized by a Extreme SuperHyperPath(-/SuperHyperZero Forcing, SuperHyperStar, 2980
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 2981
either the Extreme SuperHyperZero Forcing or the Extreme SuperHyperZero Forcing in those 2982
Extreme Extreme SuperHyperModels. 2983
137
CHAPTER 14 2984
Case 1: The Initial Extreme Steps 2985
Toward Extreme SuperHyperBipartite 2986
as Extreme SuperHyperModel 2987
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2988
is Extreme highlighted and Extreme featured. 2989
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBipartite 2990
is obtained. 2991
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2992
Figure 14.1: a Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperZero Forcing 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperZero 2994
Forcing. 2995

CHAPTER 15 2996
Case 2: The Increasing Extreme Steps 2997
Toward Extreme 2998
SuperHyperMultipartite as Extreme 2999
SuperHyperModel 3000
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3001
ite is Extreme highlighted and Extreme featured. 3002
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3003
partite is obtained. 3004
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3005
Figure 15.1: a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

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

ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperZero 3007
Forcing. 3008

CHAPTER 16 3009
Wondering Open Problems But As The 3010
Directions To Forming The Motivations 3011
In what follows, some “problems” and some “questions” are proposed. 3012
The SuperHyperZero Forcing and the Extreme SuperHyperZero Forcing are defined on a real-world 3013
application, titled “Cancer’s Recognitions”. 3014
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3015
recognitions? 3016
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperZero Forcing and the 3017
Extreme SuperHyperZero Forcing? 3018
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3019
them? 3020
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperZero Forcing 3021
and the Extreme SuperHyperZero Forcing? 3022
Problem 16.0.5. The SuperHyperZero Forcing and the Extreme SuperHyperZero Forcing do a 3023
SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperZero Forcing, 3024
are there else? 3025
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3026
Numbers types-results? 3027
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3028
the multiple types of SuperHyperNotions? 3029
143
CHAPTER 17 3030
Conclusion and Closing Remarks 3031
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3032
research are illustrated. Some benefits and some advantages of this research are highlighted. 3033
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3034
In this endeavor, two SuperHyperNotions are defined on the SuperHyperZero Forcing. For that sake 3035
in the second definition, the main definition of the Extreme SuperHyperGraph is redefined on 3036
the position of the alphabets. Based on the new definition for the Extreme SuperHyperGraph, 3037
the new SuperHyperNotion, Extreme SuperHyperZero Forcing, finds the convenient background 3038
to implement some results based on that. Some SuperHyperClasses and some Extreme 3039
SuperHyperClasses are the cases of this research on the modeling of the regions where are 3040
under the attacks of the cancer to recognize this disease as it’s mentioned on the title “Cancer’s 3041
Recognitions”. To formalize the instances on the SuperHyperNotion, SuperHyperZero Forcing, 3042
the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general results are 3043
gathered in the section on the SuperHyperZero Forcing and the Extreme SuperHyperZero Forcing. 3044
The clarifications, instances and literature reviews have taken the whole way through. In this 3045
research, the literature reviews have fulfilled the lines containing the notions and the results. 3046
The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the 3047
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 3048
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 3049
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 3050
of the moves of the cancer in the longest and strongest styles with the formation of the design 3051
and the architecture are formally called “ SuperHyperZero Forcing” in the themes of jargons and 3052
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 3053
the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues for this 3054
research are, figured out, pointed out and spoken out. 3055
145
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperZero Forcing
3. Extreme SuperHyperZero Forcing 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3056
Extreme SuperHyperDuality But As The 3057
Super Forms 3059
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3060

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

Va ∈ Ei , Ej ; 3064
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3065
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3066
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3067
Vi , Vj ∈ Ea ; 3068
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3069
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3070
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3071
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3072

SuperHyperDuality. 3073
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3074

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3079
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3080
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3081
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3082
Extreme SuperHyperDuality; 3083
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3084

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3085
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3086
Extreme cardinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet 3087
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3089
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3090

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3091
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3092
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3093
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3094
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3095
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3097
coefficient; 3098
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3099

and Extreme rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 3101
SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3104
coefficient; 3107
(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3108

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

SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3117
is the maximum Extreme cardinality of the Extreme SuperHyperVertices of a Extreme 3118

Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3120
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3121

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3122
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3123
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3124
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3125
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3126

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3127

that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3128
to its Extreme coefficient; 3129
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3130

and Extreme rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 3132
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3135
coefficient. 3138
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3141
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3142
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.
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 3150
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in 3151
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 3152
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 3153
no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHy- 3154
perVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3155


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

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 3199
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. 3203
(31.1), is the SuperHyperDuality. 3206
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 3208
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3225
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 3227
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3231
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3232
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3233
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 : 3236

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3248


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


∃!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 3273
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3274
Extreme SuperHyperDuality. 3280

CHAPTER 19 3281
Extreme SuperHyperJoin But As The 3282
Super Forms 3284
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3285

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3296
|Vj |Extreme CARDINALITY ; 3297
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3298
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3299
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3300

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3304
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3305
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3306
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3307
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3308
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3309

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3316
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3317
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3318
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3319
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3320
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3321
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3322
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3323

rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is 3325
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3326
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3327
of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3328
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3331


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

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3339
cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of high Ex- 3340
treme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 3341
such that they form the Extreme SuperHyperJoin; 3342
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3343
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3344

is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3346
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3347
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3348

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

rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is 3353
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3354
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3355
of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3356
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3358
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3361
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3362

SuperHyperJoin. 3368
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 3370
empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the terms 3371
of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3372
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3373
V3 , is excluded in every given Extreme SuperHyperJoin. 3375

is up. The Extreme Algorithm is Extremely straightforward. 3377


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3498
Extreme SuperHyperPerfect But As The 3499
Super Forms 3501
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3502

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3514
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3515

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3519
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3520
Extreme SuperHyperPerfect; 3524
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3525

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3532
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3533
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3538
coefficient; 3539
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3540

and Extreme rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 3542
SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3545
coefficient; 3548
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3549

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

SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3558

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

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


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

and Extreme rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 3573
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3576
coefficient. 3579
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3582
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3583
SuperHyperPerfect. 3589
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.
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 3591
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in 3592
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 3593
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 3594
no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHy- 3595
perVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3596


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

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

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

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

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



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

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

Then 3687

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



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

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

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


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

CHAPTER 21 3722
Extreme SuperHyperTotal But As The 3723
Super Forms 3725
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3726
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3729
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3730

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3736
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3737

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3741
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3744
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3745
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3746

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3747
189

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3761
treme rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph N SHG : 3762
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3763
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3764
perEdges of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3765
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3767
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3768

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3769
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3772
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3773
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3774

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3775
Extreme cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet 3777
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3779
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3780

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3781
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3782
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3785
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3786
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3787
coefficient; 3788
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3789

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3790
treme rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph N SHG : 3791

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3792
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3793
Vertices of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3794
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3796
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3799
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3800
SuperHyperTotal. 3806
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 3808
empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the terms 3809
of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3810
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3811
V3 , is excluded in every given Extreme SuperHyperTotal. 3813



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3861
(31.1), is the SuperHyperTotal. 3864
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 3866
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. 3873
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 3875
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3937
Extreme SuperHyperConnected But As 3938
The Extensions Excerpt From Dense And 3939
Super Forms 3940
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3941

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3955
SuperHyperConnected. 3956
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3957
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3960

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3962
203
Extreme SuperHyperConnected; 3966
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3967

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3974
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3975
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3976
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3977
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 3980
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3982

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for a 3984

cardinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet S of high 3987
(v) an Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected,3991

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3993
Extreme SuperHyperConnected; 3997
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3998

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 4000
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 4004

of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4005
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4006

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

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 4011
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4013

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for a 4015
cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of high 4018

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

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.
• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 4032
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 4033
E3 are some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. 4034
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 4035
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 4036
there’s no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme 4037
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 4038


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

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. 4054

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 4082
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. 4086
(31.1), is the SuperHyperConnected. 4089
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 4091
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. 4098
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 4100



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4119

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


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 4135
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 4136
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4154
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4155
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4156
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4157
Extreme SuperHyperConnected. 4163

CHAPTER 23 4164
Background 4165
217



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 4235
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 4236
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 4237
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 4238
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4239
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett 4240
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 4241
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 4242
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4243
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 4244

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

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

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 4252
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 4253
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 4254
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4255
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyper- 4256
Graph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” 4257

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

SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 4264
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 4265
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 4266
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 4267
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 4268
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 4269
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 4270
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 4271
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 4272
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 4273
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 4274
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 4275
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 4276
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 4277
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 4278
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 4279
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 4280

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

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

(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 4291
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 4292
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 4293
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 4294
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 4295
(2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 4296

HG169b; HG170b; HG171b; HG172b; HG173b; HG174b]. Two popular scientific re- 4330
search books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutrosophic 4331
science is on [HG32b; HG44b]. 4332



HG269] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 4368



Bibliography 4384
37-60. 4387
10.33140/JMTCM.01.03.09) 4408
223
10.20944/preprints202301.0282.v1). 4424
10.20944/preprints202301.0267.v1). 4427
(doi: 10.20944/preprints202301.0265.v1). 4432
prints202301.0262.v1). 4436
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4442

prints202301.0105.v1). 4445

Preprints 2023, 2023010044 4451

10.20944/preprints202301.0043.v1). 4454

(doi: 10.20944/preprints202212.0549.v1). 4463
(doi: 10.20944/preprints202212.0500.v1). 4470
odo.7978571). 4479
10.5281/zenodo.7978857). 4482
10.5281/zenodo.7940830). 4485
10.5281/zenodo.7943578). 4488

odo.7916595). 4491
odo.7923632). 4494
(doi: 10.5281/zenodo.7904698). 4497
2023, (doi: 10.5281/zenodo.7904671). 4500
10.5281/zenodo.7871026). 4509
2023, (doi: 10.5281/zenodo.7874647). 4512
10.5281/zenodo.7857856). 4515
2023, (doi: 10.5281/zenodo.7857841). 4518
10.5281/zenodo.7853867). 4527

10.5281/zenodo.7853922). 4530
(doi: 10.5281/zenodo.7851519). 4533
(doi: 10.5281/zenodo.7851550). 4536
10.5281/zenodo.7834229). 4545
10.5281/zenodo.7834261). 4548
10.5281/zenodo.7824560). 4551
(doi: 10.5281/zenodo.7824623). 4554

2023, (doi: 10.5281/zenodo.7809365). 4565

2023, (doi: 10.5281/zenodo.7809358). 4568
10.5281/zenodo.7809219). 4571
10.5281/zenodo.7809328). 4574
2023, (doi: 10.5281/zenodo.7806767). 4577
2023, (doi: 10.5281/zenodo.7806838). 4580
10.5281/zenodo.7799902). 4589
(doi: 10.5281/zenodo.7804218). 4592
(doi: 10.5281/zenodo.7796334). 4595
10.5281/zenodo.7791952). 4601
10.5281/zenodo.7791982). 4604

10.5281/zenodo.7790026). 4607
10.5281/zenodo.7790052). 4610
2023, (doi: 10.5281/zenodo.7787066). 4613
10.5281/zenodo.7781476). 4619
10.5281/zenodo.7783082). 4622
10.5281/zenodo.7777857). 4625
10.5281/zenodo.7779286). 4628
(doi: 10.5281/zenodo.7771831). 4631
2023, (doi: 10.5281/zenodo.7772468). 4634
10.13140/RG.2.2.20913.25446). 4637
odo.7764916). 4640
10.13140/RG.2.2.11770.98247). 4643

10.13140/RG.2.2.12400.12808). 4646
2023, (doi: 10.13140/RG.2.2.22545.10089). 4649
10.13140/RG.2.2.11377.76644). 4655
10.13140/RG.2.2.23750.96329). 4658
10.13140/RG.2.2.31366.24641). 4661
10.13140/RG.2.2.34721.68960). 4664
2023, (doi: 10.13140/RG.2.2.30212.81289). 4667
10.13140/RG.2.2.24288.35842). 4673
10.13140/RG.2.2.32467.25124). 4676
10.13140/RG.2.2.31025.45925). 4679
10.13140/RG.2.2.17184.25602). 4682

10.13140/RG.2.2.23423.28327). 4685
10.13140/RG.2.2.28456.44805). 4688
10.13140/RG.2.2.23525.68320). 4691
10.13140/RG.2.2.20170.24000). 4694
10.13140/RG.2.2.36475.59683). 4697
10.13140/RG.2.2.29764.71046). 4700
2023, (doi: 10.13140/RG.2.2.18780.87683). 4703
10.13140/RG.2.2.26134.01603). 4709
10.13140/RG.2.2.27392.30721). 4712
10.13140/RG.2.2.33028.40321). 4715
10.13140/RG.2.2.21389.20966). 4718
10.13140/RG.2.2.16356.04489). 4721

10.13140/RG.2.2.21756.21129). 4724
10.13140/RG.2.2.30983.68009). 4727
10.13140/RG.2.2.28552.29445). 4730
(doi: 10.13140/RG.2.2.10936.21761). 4733
10.13140/RG.2.2.35105.89447). 4736
(doi: 10.13140/RG.2.2.30072.72960). 4739
10.13140/RG.2.2.31147.52003). 4742
10.13140/RG.2.2.32825.24163). 4745
10.13140/RG.2.2.13059.58401). 4748
10.13140/RG.2.2.11172.14720). 4751
2023, (doi: 10.13140/RG.2.2.22011.80165). 4754
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4757
2023, (doi: 10.13140/RG.2.2.10493.84962). 4760

ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4763
2023, (doi: 10.13140/RG.2.2.19944.14086). 4766
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4769
(doi: 10.13140/RG.2.2.33103.76968). 4772
(doi: 10.13140/RG.2.2.23037.44003). 4775
(doi: 10.13140/RG.2.2.35646.56641). 4778
10.13140/RG.2.2.18030.48967). 4781
(doi: 10.13140/RG.2.2.13973.81121). 4784
2023, (doi: 10.13140/RG.2.2.34106.47047). 4787
2023, (doi: 10.13140/RG.2.2.31956.88961). 4793
2023, (doi: 10.13140/RG.2.2.15179.67361). 4796
10.13140/RG.2.2.21510.45125). 4799

2023, (doi: 10.13140/RG.2.2.13121.84321). 4802
10.13140/RG.2.2.11758.69441). 4805
2023, (doi: 10.13140/RG.2.2.31891.35367). 4808
10.13140/RG.2.2.19360.87048). 4811
10.13140/RG.2.2.32363.21286). 4814
10.13140/RG.2.2.23266.81602). 4817
10.13140/RG.2.2.19911.37285). 4820
10.13140/RG.2.2.11050.90569). 4823
2023, (doi: 10.13140/RG.2.2.17761.79206). 4826
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4832
(doi: 10.13140/RG.2.2.30182.50241). 4835

2023, (doi: 10.13140/RG.2.2.17252.24968). 4868
2023010396 (doi: 10.20944/preprints202301.0396.v1). 4877

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4880

2023,(doi: 10.13140/RG.2.2.36745.93289). 4894
10.20944/preprints202301.0282.v1). 4901
10.20944/preprints202301.0267.v1).). 4904

(doi: 10.20944/preprints202301.0265.v1). 4909
prints202301.0262.v1). 4913

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

10.13140/RG.2.2.35061.65767). 4922

10.13140/RG.2.2.18494.15680). 4926

10.13140/RG.2.2.32530.73922). 4930

10.13140/RG.2.2.15897.70243). 4934
10.13140/RG.2.2.32530.73922). 4938
prints202301.0105.v1). 4941


10.13140/RG.2.2.23172.19849). 4948


10.13140/RG.2.2.17385.36968). 4958
Preprints 2023, 2023010044 4961
10.20944/preprints202301.0043.v1). 4964
2023, (doi: 10.13140/RG.2.2.28945.92007). 4967
10.13140/RG.2.2.35774.77123). 4973
10.13140/RG.2.2.29430.88642). 4979
(doi: 10.20944/preprints202212.0549.v1). 4985
10.13140/RG.2.2.19380.94084). 4988

(doi: 10.20944/preprints202212.0500.v1). 4999
10.13140/RG.2.2.20993.12640). 5002

10.13140/RG.2.2.29173.86244). 5017
10.5281/zenodo.7978921). 5022
odo.7943878). 5024
10.5281/zenodo.7943871). 5026
10.5281/zenodo.7923786). 5028
2023 (doi: 10.5281/zenodo.7905287). 5030


2023 (doi: 10.5281/zenodo.7874677). 5034
(doi: 10.5281/zenodo.7857906). 5036
2023 (doi: 10.5281/zenodo.7856329). 5038
10.5281/zenodo.7854561). 5040
2023 (doi: 10.5281/zenodo.7851893). 5042

(doi: 10.5281/zenodo.7835063). 5046
(doi: 10.5281/zenodo.7826705). 5048
2023 (doi: 10.5281/zenodo.7820680). 5050
10.5281/zenodo.7812750). 5052

2023 (doi: 10.5281/zenodo.7807782). 5058
2023 (doi: 10.5281/zenodo.7804449). 5060

(doi: 10.5281/zenodo.7792307). 5064
(doi: 10.5281/zenodo.7790728). 5066

2023 (doi: 10.5281/zenodo.7787712). 5068
10.5281/zenodo.7783791). 5070
10.5281/zenodo.7780123). 5072
(doi: 10.5281/zenodo.7773119). 5074
odo.7637762). 5076
10.5281/zenodo.7766174). 5078
10.5281/zenodo.7762232). 5080
(doi: 10.5281/zenodo.7758601). 5082
10.5281/zenodo.7754661). 5084
10.5281/zenodo.7750995) . 5086
(doi: 10.5281/zenodo.7749875). 5088
10.5281/zenodo.7747236). 5090
10.5281/zenodo.7742587). 5092
(doi: 10.5281/zenodo.7738635). 5094
10.5281/zenodo.7734719). 5096
10.5281/zenodo.7730484). 5098
(doi: 10.5281/zenodo.7730469). 5100
10.5281/zenodo.7722865). 5102

odo.7713563). 5104
odo.7709116). 5106
10.5281/zenodo.7706415). 5108
10.5281/zenodo.7706063). 5110
10.5281/zenodo.7701906). 5112
odo.7700205). 5114
10.5281/zenodo.7694876). 5116
10.5281/zenodo.7679410). 5118
10.5281/zenodo.7675982). 5120
10.5281/zenodo.7672388). 5122
odo.7668648). 5124
10.5281/zenodo.7662810). 5126
10.5281/zenodo.7659162). 5128
odo.7653233). 5130
odo.7653204). 5132
odo.7653142). 5134
odo.7653117). 5136

odo.7651687). 5139
odo.7651619). 5141
odo.7651439). 5143
odo.7650729). 5145
odo.7647868). 5147
odo.7647017). 5149
odo.7644894). 5151
odo.7632923). 5154
odo.7623459). 5156
10.5281/zenodo.7606416). 5158
10.5281/zenodo.7606416). 5160
odo.7606404). 5162
10.5281/zenodo.7580018). 5164
odo.7580018). 5166
odo.7580018). 5168
odo.7579929). 5170
10.5281/zenodo.7563170). 5172

odo.7563164). 5174
odo.7563160). 5176
odo.7563160). 5178
10.5281/zenodo.7563160). 5180
10.5281/zenodo.7557063). 5182
10.5281/zenodo.7557009). 5184
10.5281/zenodo.7539484). 5186
10.5281/zenodo.7523390). 5188
10.5281/zenodo.7523390). 5190
10.5281/zenodo.7523390). 5192
odo.7574952). 5194
10.5281/zenodo.7574992). 5196
odo.7523357). 5198
10.5281/zenodo.7523357). 5200
10.5281/zenodo.7504782). 5202
10.5281/zenodo.7504782). 5204
10.5281/zenodo.7504782). 5206
10.5281/zenodo.7499395). 5208

odo.7499395). 5210
10.5281/zenodo.7499395). 5212
10.5281/zenodo.7497450). 5214
10.5281/zenodo.7497450). 5216
10.5281/zenodo.7494862). 5218
odo.7494862). 5220
10.5281/zenodo.7494862). 5222
10.5281/zenodo.7493845). 5224
odo.7493845). 5226
10.5281/zenodo.7493845). 5228
odo.7539484). 5230
odo.7523390). 5232
odo.7523357). 5234
odo.7504782). 5236
odo.7499395). 5238
odo.7497450). 5240
odo.7494862). 5242
odo.7493845). 5244

odo.7480110). 5246
odo.7378758). 5248
odo.6320305). 5250
odo.6677173). 5252

CHAPTER 24 5253
Cancer In Neutrosophic 5254
SuperHyperGraph 5255
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5256
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5257
disease is considered and as the consequences of the model, some parameters are used. The cells 5258
are under attack of this disease but the moves of the cancer in the special region are the matter 5259
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5260
treatments for this Neutrosophic disease. 5261
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5262
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5263
term Neutrosophic function. 5264
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5265
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5266
move from the cancer is identified by this research. Sometimes the move of the cancer 5267
about the moves and the effects of the cancer on that region; this event leads us to 5269
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5270
perception on what’s happened and what’s done. 5271
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5272
known and they’ve got the names, and some general Neutrosophic models. The moves 5273
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5274
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5275
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5276
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5277
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5278
Models. 5279
Some cells have been faced with some attacks from the situation which is caused by the 5280
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5281
which in that, the cells could be labelled as some groups and some groups or individuals have 5282
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5283
the embedded situations, the individuals of cells and the groups of cells could be considered 5284
247
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5285
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5286
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5287
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5288
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5289
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5290
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5291
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5292
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5293
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5294
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5295
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5296
out what’s going on this phenomenon. The special case of this disease is considered and as the 5297
consequences of the model, some parameters are used. The cells are under attack of this disease 5298
but the moves of the cancer in the special region are the matter of mind. The recognition of 5299
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5300
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5301
both bases are the background of this research. Sometimes the cancer has been happened on the 5302
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5303
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5304
in the forms of alliances’ styles with the formation of the design and the architecture are 5305
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5306
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5307
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5308
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5309
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5310
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5311
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5312
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5313
and what’s done. There are some specific models, which are well-known and they’ve got the 5314
names, and some general models. The moves and the traces of the cancer on the complex tracks 5315
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5316
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5317
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5318
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5319
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5320
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5321
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5322
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5323
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5324
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5326
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5327
based on the fixed groups of cells or the fixed groups of group of cells? 5328
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5329

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5333
Then the research has taken more motivations to define SuperHyperClasses and to find some 5334
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5335
some instances and examples to make clarifications about the framework of this research. The 5336
general results and some results about some connections are some avenues to make key point of 5337
this research, “Cancer’s Recognition”, more understandable and more clear. 5338
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5339
research on the modeling of the regions where are under the attacks of the cancer to 5340
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5341
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5342
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5343
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5344

instances and literature reviews have taken the whole way through. In this scientific research, 5345
the literature reviews have fulfilled the lines containing the notions and the results. The 5346
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5347
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5348
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5349
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5350
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5351
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5352
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5353
to figure out the background for the SuperHyperNotions. 5354

CHAPTER 25 5355
Neutrosophic Zero Forcing 5356
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5357
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5358
2023, (doi: 10.13140/RG.2.2.34953.52320). 5359

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5360
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5361
(doi: 10.13140/RG.2.2.33275.80161). 5362
10.13140/RG.2.2.11050.90569). 5365
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5366
10.13140/RG.2.2.17761.79206). 5368
10.13140/RG.2.2.19911.37285). 5371
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5372
10.13140/RG.2.2.23266.81602). 5374
10.13140/RG.2.2.19360.87048). 5377
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5378
10.13140/RG.2.2.32363.21286). 5380
10.13140/RG.2.2.11758.69441). 5383
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5384
10.13140/RG.2.2.31891.35367). 5386
10.13140/RG.2.2.21510.45125). 5389
251
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5390
10.13140/RG.2.2.13121.84321). 5392

CHAPTER 26 5393
New Ideas In Recognition of Cancer And 5394
Neutrosophic SuperHyperGraph By Zero 5395
Forcing As Hyper ford On Super forceps 5396
253
CHAPTER 27 5397
ABSTRACT 5398
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperZero Forcing). 5399
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Zero Forcing pair S = (V, E). Consider 5400
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 5401
V 0 or E 0 is called Neutrosophic e-SuperHyperZero Forcing if the following expression is called 5402
Neutrosophic e-SuperHyperZero Forcing criteria holds 5403
The zero forcing forms;
Neutrosophic re-SuperHyperZero Forcing if the following expression is called Neutrosophic e- 5404

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

SuperHyperZero Forcing if the following expression is called Neutrosophic v-SuperHyperZero Forcing 5407
criteria holds 5408
Neutrosophic rv-SuperHyperZero Forcing if the following expression is called Neutrosophic v- 5409

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Su- 5411
perHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero Forcing, Neutrosophic 5412
re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero Forcing, and Neutrosophic rv- 5413
SuperHyperZero Forcing. ((Neutrosophic) SuperHyperZero Forcing). Assume a Neutrosophic 5414
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5415
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperZero Forcing if it’s either 5416
of Neutrosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic 5417
v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for an 5418
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Ex- 5419
treme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 5420
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVer- 5421
tices such that they form the Extreme SuperHyperZero Forcing; a Neutrosophic SuperHyperZero 5422
255
Forcing if it’s either of Neutrosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero 5423

Forcing, Neutrosophic v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and 5424
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 5425
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 5426
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 5427
SuperHyperVertices such that they form the Neutrosophic SuperHyperZero Forcing; an Extreme Su- 5428
perHyperZero Forcing SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperZero Forcing, 5429

Neutrosophic re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero Forcing, and Neutrosophic 5430
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 5433
is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as 5440
the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic Super- 5441
HyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 5442
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5443
the Neutrosophic SuperHyperZero Forcing; and the Neutrosophic power is corresponded to its 5444
Neutrosophic coefficient; an Extreme V-SuperHyperZero Forcing if it’s either of Neutrosophic 5445
e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic v-SuperHyperZero 5446
Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for an Extreme SuperHyper- 5447
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 5448
of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5449
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5450
the Extreme SuperHyperZero Forcing; a Neutrosophic V-SuperHyperZero Forcing if it’s either of 5451
v-SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for a Neut- 5453
rosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 5454
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5455
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5456
such that they form the Neutrosophic SuperHyperZero Forcing; an Extreme V-SuperHyperZero 5457

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 5462

is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined 5469

as the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 5470
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 5472
they form the Neutrosophic SuperHyperZero Forcing; and the Neutrosophic power is correspon- 5473
ded to its Neutrosophic coefficient. In this scientific research, new setting is introduced for 5474
new SuperHyperNotions, namely, a SuperHyperZero Forcing and Neutrosophic SuperHyperZero 5475

Forcing. Two different types of SuperHyperDefinitions are debut for them but the research 5476
goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based 5477
on that are well-defined and well-reviewed. The literature review is implemented in the 5478
whole of this research. For shining the elegancy and the significancy of this research, the 5479
comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental 5480
SuperHyperNumbers are featured. The definitions are followed by the examples and the 5481
instances thus the clarifications are driven with different tools. The applications are figured 5482
out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5483
Recognition” are the under research to figure out the challenges make sense about ongoing and 5484
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5485
are different types of them. Some of them are individuals and some of them are well-modeled 5486
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 5487
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 5488
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 5489
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 5490
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 5491
this research. It’s also officially collected in the form of some questions and some problems. 5492
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperZero Forcing 5493

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5496
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5497
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperZero Forcing is a maximal 5498
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 5499

either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 5500
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5501
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5502
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5503
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5504

SuperHyperZero Forcing . Since there’s more ways to get type-results to make a SuperHyperZero 5505
Forcing more understandable. For the sake of having Neutrosophic SuperHyperZero Forcing, there’s 5506
a need to “redefine” the notion of a “SuperHyperZero Forcing ”. The SuperHyperVertices and the 5507
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperZero 5509
Forcing . It’s redefined a Neutrosophic SuperHyperZero Forcing if the mentioned Table holds, 5510

and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 5517
on a SuperHyperZero Forcing . It’s the main. It’ll be disciplinary to have the foundation of 5518
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperZero 5519
Forcing until the SuperHyperZero Forcing, then it’s officially called a “SuperHyperZero Forcing” but 5520
otherwise, it isn’t a SuperHyperZero Forcing . There are some instances about the clarifications 5521
for the main definition titled a “SuperHyperZero Forcing ”. These two examples get more scrutiny 5522
and discernment since there are characterized in the disciplinary ways of the SuperHyperClass 5523
based on a SuperHyperZero Forcing . For the sake of having a Neutrosophic SuperHyperZero 5524
Forcing, there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperZero Forcing” and a 5525
“Neutrosophic SuperHyperZero Forcing ”. The SuperHyperVertices and the SuperHyperEdges are 5526
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 5527
of the position of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. 5528
It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHy- 5529
perZero Forcing are redefined to a “Neutrosophic SuperHyperZero Forcing” if the intended Table 5530
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 5531
ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperZero Forcing more 5532
understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 5533

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperZero Forcing, 5534
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, 5535
are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperZero Forcing”, “Neutrosophic Su- 5536
perHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 5537
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has 5538
a “Neutrosophic SuperHyperZero Forcing” where it’s the strongest [the maximum Neutrosophic 5539
value from all the SuperHyperZero Forcing amid the maximum value amid all SuperHyperVertices 5540
from a SuperHyperZero Forcing .] SuperHyperZero Forcing . A graph is a SuperHyperUniform 5541
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5542
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 5543
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5544
with two exceptions; it’s SuperHyperZero Forcing if it’s only one SuperVertex as intersection amid 5545
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 5546
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 5547
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 5548
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 5549
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 5550
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 5551
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 5552
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 5553
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 5554
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 5555
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 5556
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 5557
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 5558
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 5559
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 5560

Recognition” and the results and the definitions will be introduced in redeemed ways. The 5561
recognition of the cancer in the long-term function. The specific region has been assigned 5562
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 5563
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 5566
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 5567
done. There are some specific models, which are well-known and they’ve got the names, and 5568
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 5569
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 5570
SuperHyperPath(-/SuperHyperZero Forcing, SuperHyperStar, SuperHyperBipartite, SuperHyper- 5571
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperZero Forcing 5572
or the strongest SuperHyperZero Forcing in those Neutrosophic SuperHyperModels. For the 5573
longest SuperHyperZero Forcing, called SuperHyperZero Forcing, and the strongest SuperHyperZero 5574
Forcing, called Neutrosophic SuperHyperZero Forcing, some general results are introduced. Beyond 5575
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but 5576
A basic familiarity with Neutrosophic SuperHyperZero Forcing theory, SuperHyperGraphs, and 5580
Neutrosophic SuperHyperGraphs theory are proposed. 5581
Keywords: Neutrosophic SuperHyperGraph, SuperHyperZero Forcing, Cancer’s Neutrosophic 5582
Recognition 5583

CHAPTER 28 5585
Applied Notions Under The Scrutiny Of 5586
The Motivation Of This Scientific 5587
Research 5588
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5589
try to bring the motivations in the narrative ways. Some cells have been faced with some 5590
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5591
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5592
as some groups and some groups or individuals have excessive labels which all are raised from 5593
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5594
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5595
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5596
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5597
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5598
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5599
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5600
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5601
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5602
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5603
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5604
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5605
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5606
is the disease but the model is going to figure out what’s going on this phenomenon. The 5607
special case of this disease is considered and as the consequences of the model, some parameters 5608
are used. The cells are under attack of this disease but the moves of the cancer in the 5609
special region are the matter of mind. The recognition of the cancer could help to find some 5610
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5611
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5612
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 5615
261
embedded styles to figure out the background for the SuperHyperNotions. The recognition 5618
of the cancer in the long-term function. The specific region has been assigned by the model 5619
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 5620
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 5621
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5622
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5623
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5624
are some specific models, which are well-known and they’ve got the names, and some general 5625
models. The moves and the traces of the cancer on the complex tracks and between complicated 5626
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperZero Forcing, 5627
is to find either the optimal SuperHyperZero Forcing or the Neutrosophic SuperHyperZero Forcing in 5629
those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 5630
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 5631
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 5632
of a SuperHyperZero Forcing. There isn’t any formation of any SuperHyperZero Forcing but literarily, 5633
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5635
“ amount of SuperHyperZero Forcing” of either individual of cells or the groups of cells based on the 5636
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperZero Forcing” based on 5637
the fixed groups of cells or the fixed groups of group of cells? 5638
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5639
these messy and dense SuperHyperModels where embedded notions are illustrated? 5640
Thus it motivates us to define different types of “ SuperHyperZero Forcing” and “Neutrosophic 5642
SuperHyperZero Forcing” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then the 5643
research has taken more motivations to define SuperHyperClasses and to find some connections 5644
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 5645
instances and examples to make clarifications about the framework of this research. The general 5646
results and some results about some connections are some avenues to make key point of this 5647
research, “Cancer’s Recognition”, more understandable and more clear. 5648
The framework of this research is as follows. In the beginning, I introduce basic definitions 5649
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5650
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5651
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5652
review literature are applied to make sense about what’s going to figure out about the upcoming 5653
sections. The main definitions and their clarifications alongside some results about new 5654
notions, SuperHyperZero Forcing and Neutrosophic SuperHyperZero Forcing, are figured out in 5655
sections “ SuperHyperZero Forcing” and “Neutrosophic SuperHyperZero Forcing”. In the sense of 5656
tackling on getting results and in Zero Forcing to make sense about continuing the research, 5657
the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5658
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5659
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5660
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5661
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5662

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

Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5664
and as concluding and closing section of theoretical research are contained in the section “General 5665
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5666
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 5667
SuperHyperZero Forcing”, “Neutrosophic SuperHyperZero Forcing”, “Results on SuperHyperClasses” 5668
and “Results on Neutrosophic SuperHyperClasses”. There are curious questions about what’s 5669
done about the SuperHyperNotions to make sense about excellency of this research and 5670
going to figure out the word “best” as the description and adjective for this research as 5671
presented in section, “ SuperHyperZero Forcing”. The keyword of this research debut in the section 5672
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5673
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5674
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5675

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

CHAPTER 29 5681
Neutrosophic Preliminaries Of This 5682
Scientific Research On the Redeemed 5683
Ways 5684
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5685
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5686

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5687
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5688
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5689
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5690
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5691
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5692

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

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

Let X be a Zero Forcing 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}.
265

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 5697
2.5,p.2). 5698
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5699
S = (V, E), where 5700
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 5701
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 5704
0
1, 2, . . . , n ); 5705
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5706
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5707

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5736
x, y, z, w ∈ [0, 1]: 5737
(i) 1 ⊗ x = x; 5738
(ii) x ⊗ y = y ⊗ x; 5739
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5740
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5741

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

where 5744

1, 2, . . . , n0 ); 5749
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5750
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5751
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5752
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5753
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5765
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5766
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5767
SuperEdge; 5773
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5776
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5777
makes the patterns and regularities. 5778
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5779
of elements of SuperHyperEdges are the same. 5780

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5781
makes to have SuperHyperUniform more understandable. 5782
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5783
Classes as follows. 5784
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5785
two given SuperHyperEdges with two exceptions; 5786
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5787
SuperHyperEdges; 5788
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5789
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5790
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5791
in common; 5792
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5793
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5794
SuperHyperEdge in common; 5795
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5796
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5797
SuperVertex. 5798
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 5799
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5800
(i) Vi , Vi+1 ∈ Ei0 ; 5801
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5802
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5803
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5804
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5805
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5806
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5807
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5808
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5810
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5811
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5812
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5813
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5814
perPath . 5815
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 5816
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5817
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5818
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5819
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5820
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5821

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5834
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5835
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5836
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperZero Forcing). 5837

(i) Neutrosophic e-SuperHyperZero Forcing if the following expression is called Neutro- 5841
sophic e-SuperHyperZero Forcing criteria holds 5842
(ii) Neutrosophic re-SuperHyperZero Forcing if the following expression is called Neutro- 5843
sophic re-SuperHyperZero Forcing criteria holds 5844
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 5845
(iii) Neutrosophic v-SuperHyperZero Forcing if the following expression is called Neutro- 5846
(iv) Neutrosophic rv-SuperHyperZero Forcing if the following expression is called Neutro- 5848

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 5850
(v) Neutrosophic SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 5851

Neutrosophic rv-SuperHyperZero Forcing. 5853
Definition 29.0.19. ((Neutrosophic) SuperHyperZero Forcing). 5854

(i) an Extreme SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 5857


(ii) a Neutrosophic SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 5864

Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for a Neutrosophic SuperHyper- 5866
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5868
that they form the Neutrosophic SuperHyperZero Forcing; 5870
(iii) an Extreme SuperHyperZero Forcing SuperHyperPolynomial if it’s either of Neut- 5871
rosophic e-SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic 5872

tices such that they form the Extreme SuperHyperZero Forcing; and the Extreme power is 5878
(iv) a Neutrosophic SuperHyperZero Forcing SuperHyperPolynomial if it’s either of 5880

of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 5885
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 5886
(v) an Extreme V-SuperHyperZero Forcing if it’s either of Neutrosophic e-SuperHyperZero 5890

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5894
(vi) a Neutrosophic V-SuperHyperZero Forcing if it’s either of Neutrosophic e- 5897
SuperHyperZero Forcing, Neutrosophic re-SuperHyperZero Forcing, Neutrosophic v- 5898

SuperHyperZero Forcing, and Neutrosophic rv-SuperHyperZero Forcing and C(N SHG) for 5899
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardin- 5900
ality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5901
SuperHyperVertices such that they form the Neutrosophic SuperHyperZero Forcing; 5903
(vii) an Extreme V-SuperHyperZero Forcing SuperHyperPolynomial if it’s either of 5904



SuperHyperVertices such that they form the Extreme SuperHyperZero Forcing; and the 5911
(viii) a Neutrosophic SuperHyperZero Forcing SuperHyperPolynomial if it’s either of 5913

of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 5918
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 5919
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperZero Forcing). 5923

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5924
(i) an δ−SuperHyperZero Forcing is a Neutrosophic kind of Neutrosophic SuperHyperZero 5925
Forcing such that either of the following expressions hold for the Neutrosophic cardinalities 5926
of SuperHyperNeighbors of s ∈ S : 5927
|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 5928

(29.1), holds if S is an δ−SuperHyperDefensive; 5929
(ii) a Neutrosophic δ−SuperHyperZero Forcing is a Neutrosophic kind of Neutrosophic 5930

SuperHyperZero Forcing such that either of the following Neutrosophic expressions hold for 5931
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5932
|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 5933

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5934
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 5936
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 5937
of the position of labels to assign to the values. 5938
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5940


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

136TBL4
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5941
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5942
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5944
sophic SuperHyperPath , SuperHyperZero Forcing, SuperHyperStar, SuperHyperBipartite, Super- 5945
HyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutro- 5946
sophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic SuperHy- 5947
perBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic SuperHy- 5948

perWheel if the Table (29.2) holds. 5949
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperZero Forcing. Since 5950
there’s more ways to get type-results to make a Neutrosophic SuperHyperZero Forcing more 5951
Neutrosophicly understandable. 5952
Neutrosophic notion of “Neutrosophic SuperHyperZero Forcing”. The SuperHyperVertices and the 5954
there’s the usage of the position of labels to assign to the values. 5956
136DEF1 Definition 29.0.23. Assume a SuperHyperZero Forcing. It’s redefined a Neutrosophic Super- 5957
HyperZero Forcing if the Table (29.3) holds. 5958


136TBL1

CHAPTER 30 5959
Neutrosophic SuperHyper But As The Zero Forcing 5960
Super Forms 5962
Definition 30.0.1. (Neutrosophic event). 5963

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5964
is a probability Zero Forcing. Any Neutrosophic k-subset of A of V is called Neutrosophic 5965
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5966
following expression is called Neutrosophic probability of A. 5967
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5968

is a probability Zero Forcing. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic s- 5970
independent if the following expression is called Neutrosophic s-independent criteria 5971
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. 5972

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

is a probability Zero Forcing. Any k-function Zero Forcing like E is called Neutrosophic k-Variable. 5976
If k = 2, then any 2-function Zero Forcing like E is called Neutrosophic Variable. 5977
The notion of independent on Neutrosophic Variable is likewise. 5978
Definition 30.0.4. (Neutrosophic Expectation). 5979
277
is a probability Zero Forcing. A Neutrosophic k-Variable E has a number is called Neutrosophic 5981
Expectation if the following expression is called Neutrosophic Expectation criteria 5982
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5983

is a probability Zero Forcing. A Neutrosophic number is called Neutrosophic Crossing if the 5985
following expression is called Neutrosophic Crossing criteria 5986
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). 5987
Consider S = (V, E) is a probability Zero Forcing. Let m and n propose special Zero Forcing. Then 5988
with m ≥ 4n, 5989
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 Zero Forcing 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: 5990
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5991
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5992
Consider S = (V, E) is a probability Zero Forcing. Let P be a SuperHyperSet of n points in the 5993
plane, and let l be the Neutrosophic number √of SuperHyperLines in the plane passing through at 5994
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5995
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 5996

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

Consider S = (V, E) is a probability Zero Forcing. Let P be a SuperHyperSet of n points in the 6003
plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 6004
k < 5n4/3 . 6005
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6006
S = (V, E) is a probability Zero Forcing. Draw a SuperHyperUnit SuperHyperCircle around 6007

each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 6008
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 6009
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6010
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6011
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6012
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 6013

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6014
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6015
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6016
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6017
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6018
4/3 4/3
k < 4n + n < 5n . 6019
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6020
Consider S = (V, E) is a probability Zero Forcing. Let X be a nonnegative Neutrosophic Variable 6021
and t a positive real number. Then 6022
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. 6023
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6024
Consider S = (V, E) is a probability Zero Forcing. Let Xn be a nonnegative integer-valued variable 6025
in a probability Zero Forcing (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as 6026

n → ∞. 6027
Proof. 6028
Consider S = (V, E) is a probability Zero Forcing. A special SuperHyperGraph in Gn,p almost surely 6030
has stability number at most d2p−1 log ne. 6031

S = (V, E) is a probability Zero Forcing. A special SuperHyperGraph in Gn,p is up. Let G ∈ Gn,p 6033
and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. The 6034
probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability 6035
that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 6036
Neutrosophic SuperHyperGraph G. 6037
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6038
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6039
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 6040
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6041
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: 6042
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6043
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 6044
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6045
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6046
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6047
Definition 30.0.12. (Neutrosophic Variance). 6048

is a probability Zero Forcing. A Neutrosophic k-Variable E has a number is called Neutrosophic 6050
Variance if the following expression is called Neutrosophic Variance criteria 6051
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Zero Forcing. Let X be a Neutrosophic Variable and let t be a 6053
positive real number. Then 6054
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Zero Forcing. Let X be a Neutrosophic Variable and let t be a positive 6056
real number. Then 6057
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
6058
Consider S = (V, E) is a probability Zero Forcing. Let Xn be a Neutrosophic Variable in a probability 6060
2
Zero Forcing (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E (Xn ), then 6061
E(Xn = 0) → 0 as n → ∞
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 6062
(V, E) is a probability Zero Forcing. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s Inequality, and 6063
observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 6064
when Xn = 0. 6065
Consider S = (V, E) is a probability Zero Forcing. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6067
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 6068
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6069
S = (V, E) is a probability Zero Forcing. As in the proof of related Theorem, the result is 6071
Consider S = (V, E) is a probability Zero Forcing. Let G ∈ Gn,1/2 and let f and k ∗ be as defined in 6074
previous Theorem. Then either: 6075
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6076
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6077
Definition 30.0.17. (Neutrosophic Threshold). 6080

is a probability Zero Forcing. Let P be a monotone property of SuperHyperGraphs (one which is 6082
preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for P is a 6083
function f (n) such that: 6084
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6085
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6086

Definition 30.0.18. (Neutrosophic Balanced). 6087

is a probability Zero Forcing. Let F be a fixed Neutrosophic SuperHyperGraph. Then there 6089
is a threshold function for the property of containing a copy of F as a Neutrosophic 6090
SubSuperHyperGraph is called Neutrosophic Balanced. 6091
Consider S = (V, E) is a probability Zero Forcing. Let F be a nonempty balanced Neutrosophic 6093
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 6094

threshold function for the property of containing F as a Neutrosophic SubSuperHyperGraph. 6095
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6098
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6099
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 6100
HyperZero Forcing, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6101
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 6102
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 6103
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 6104
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6105
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6106

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperZero Forcing. 6107
C(N SHG)Neutrosophic Zero Forcing =

{E4 }.
C(N SHG)Neutrosophic Zero Forcing SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Zero Forcing =
{V4 }.
C(N SHG)Neutrosophic V-Zero Forcing SuperHyperPolynomial
= z5.
6108
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 6111

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6112
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6113
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6114
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6115
every given Neutrosophic SuperHyperZero Forcing. 6116

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

Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.3) 136NSHG1
{E4 }.
= z3.
{V4 }.
= z5.
6117

{E4 }.
= z3.
{V3 }.
= z8.
6120






{E2 , E1 , E4 , E5 }.
= 2z 5 + 2z 3 .
{V1 , V3 , V4 }.
= z 4 + z 3 + 2z 2 + 4z.
6123

{}.
= 0z 0 .
{}.


= 0z 0 .
6126

{}.
= 0z 0 .
{}.
= 0z 0 .
6129


{}.
= 0z 0 .
{}.
= 0z 0 .
6132

{}.
= 0z 0 .
{}.


= 0z 0 .
6135

{}.
= 0z 0 .
{}.
= 0z 0 .
6138

{}.






= 0z 0 .
{}.
= 0z 0 .
6141

{}.
= 0z 0 .
{}.
= 0z 0 .
6144



{}.
= 0z 0 .
{}.
= 0z 0 .
6147

{}.
= 0z 0 .



{}.
= 0z 0 .
6150

{E2 , E1 }.
= 2z 2 .
{V2 , V1 , V3 }.
= 2z 5 + z 3 .
6153



{E1 , E2 , E3 , E4 , E5 }.
X
= z |Ei | .
Ei ∈EN SHG
{V5 , V1 , V2 , V3 , V4 , V6 }.
X
= z |Vi | .
Vi ∈VN SHG
6156

{E1 , E2 , E3 , E4 , E5 }.


X
= z |Ei | .
Ei ∈EN SHG
{V1 , V2 , V6 , V10 , V17 , V22 }.
X
= z |Vi | .
Vi ∈{V1 ,V2 ,V6 ,V10 ,V17 ,V22 }
6159

{E6 , E1 , E2 , E3 , E4 , E5 }.





X
= z |Ei | .
Ei ∈EN SHG
{V27 , V1 , V2 , V6 , V10 , V17 , V22 }.
X
= z |Vi | .
Vi ∈{V27 ,V1 ,V2 ,V6 ,V10 ,V17 ,V22 }
6162

{E1 , E2 , E3 , E4 , E5 , E6 }.
X
= z |Ei | .
Ei ∈EN SHG
{V27 , V1 , V2 , V6 , V10 , V17 , V22 }.


X
= z |Vi | .
Vi ∈{V27 ,V1 ,V2 ,V6 ,V10 ,V17 ,V22 }
6165

{}.
= 0z 0 .
{VE1 \ {V1 , V2 }, V2 , V3 , . . . , V11 }.
X
= z |Vi | .
Vi ∈{VE1 \{V1 ,V2 },V2 ,V3 ,...,V11 }
6168



{}.
= 0z 0 .
{}.
= 0z 0 .
6171

{E2 }.
= z |E2 | .


{V1 }.
= z |V1 | .
6174

{E2 , E3 , E4 , E5 }.
X
= z |Ei | .
Ei ∈{EN SHG \{E1 }}

{V1 , V3 , V6 }.
X
= z |Vi | .
Vi ∈{V1 ,V3 ,V6 }
6177


Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.3) 95NHG1
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6178
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Zero Forcing if 6179
for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6180
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6181
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6182
them. 6183
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6184

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6185
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6186
Neutrosophic quasi-R-Zero Forcing minus all Neutrosophic SuperHypeNeighbor to some of them 6187
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6188
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6189

quasi-R-Zero Forcing, minus all Neutrosophic SuperHypeNeighbor to some of them but not all of 6190
them. 6191


Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.3) 95NHG2
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-Zero Forcing is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Zero Forcing is at least 6192
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6193

SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6194
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6195
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Zero 6196
Forcing in some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 6197
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6198
SuperHyperVertices are contained in a Neutrosophic R-Zero Forcing. 6199
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Zero Forcing 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-Zero Forcing with the least Neutrosophic cardinality, the 6200
lower sharp Neutrosophic bound for cardinality. 6201

Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6202

(V, E). Then in the worst case, literally, 6203
C(N SHG)N eutrosophicQuasi−ZeroF orcing

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ZeroF orcingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ZeroF orcing = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ZeroF orcingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Zero Forcing. In other words, the least cardinality, the lower sharp 6204
bound for the cardinality, of a Neutrosophic type-result-Zero Forcing is the cardinality of 6205

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ZeroF orcingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ZeroF orcing = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ZeroF orcingSuperHyperP 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-Zero Forcing 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-Zero Forcing. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Zero Forcing 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-Zero Forcing. 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-Zero Forcing decorates the Neutrosophic Super-
HyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic style
implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutrosophic
cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower Neutro-
sophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHyperVertices
have perfect Neutrosophic connections inside each of SuperHyperEdges and the outside of
this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used
Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from the fact
that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the targeted
Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore, the
Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect to
talk about the Neutrosophic R-Zero Forcing. Since at least two Neutrosophic SuperHyperVertices
involve to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of Neut-
rosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic version
of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be
loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework engages one
Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting. With these
Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one Neutrosophic Su-
perHyperEdge thus there’s at least a Neutrosophic R-Zero Forcing has the Neutrosophic cardinality
of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Zero Forcing has the Neutrosophic

cardinality at least a Neutrosophic SuperHyperEdge. Assume a Neutrosophic SuperHyperSet

V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic R-Zero Forcing 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-Zero
Forcing” since the maximum Neutrosophic cardinality never happens for this Neutrosophic style
of the Neutrosophic SuperHyperSet and beyond that there’s no Neutrosophic connection inside
as mentioned in first Neutrosophic case in the forms of drawback for this selected Neutrosophic
SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-
triangle Neutrosophic style on the every Neutrosophic elements of this Neutrosophic
SuperHyperSet. Precisely, the Neutrosophic R-Zero Forcing 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-Zero Forcing 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-Zero Forcing. Those
Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-Zero Forcing.
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-Zero Forcing is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Zero Forcing but with
slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

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

But with the slightly differences, 6206
Neutrosophic R-Zero Forcing =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6207
Neutrosophic R-Zero Forcing =

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Zero Forcing where E ∈ EESHG:(V,E) is fixed

that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices but in
a Neutrosophic Zero Forcing, 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-Zero Forcing is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Zero Forcing is at least 6208
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6209
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6210
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6211
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Zero 6212

Forcing in some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 6213
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6214
SuperHyperVertices are contained in a Neutrosophic R-Zero Forcing. 6215
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6216
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6217
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6218
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6219
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6220
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6221
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6222
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6223
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6224

SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms 6225
a Neutrosophic quasi-R-Zero Forcing where the Neutrosophic completion of the Neutrosophic 6226
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Zero Forcing. The 6227
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6228
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyper- 6229
Cardinality. Thus the embedded setting is elected such that those SuperHyperSets have the 6230
maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOptimal. 6231
The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6232
minimum Neutrosophic style of the embedded Neutrosophic R-Zero Forcing. The interior types 6233
of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6234
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6235
common connections, more precise and more formal, the perfect unique connections inside the 6236

Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the 6237
Neutrosophic R-Zero Forcing. Thus Neutrosophic exterior SuperHyperVertices could be used only 6238
in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior 6239
Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded 6240
Neutrosophic Zero Forcing, there’s the usage of exterior Neutrosophic SuperHyperVertices since 6241
they’ve more connections inside more than outside. Thus the title “exterior” is more relevant 6242
than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. 6243
Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one 6244
SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the 6245
Neutrosophic R-Zero Forcing. The Neutrosophic R-Zero Forcing with the exclusion of the exclusion 6246
of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other 6247
terms, the Neutrosophic R-Zero Forcing with the inclusion of all Neutrosophic SuperHyperVertices 6248
in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Zero Forcing. To sum them up, 6249
in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s only one 6250
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 6251
distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic quasi-R-Zero 6252
Forcing minus all Neutrosophic SuperHypeNeighbor to some of them but not all of them. In 6253
other words, there’s only an unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6254
two distinct Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Zero Forcing, minus all 6255
Neutrosophic SuperHypeNeighbor to some of them but not all of them. 6256
The main definition of the Neutrosophic R-Zero Forcing has two titles. a Neutrosophic quasi-R-Zero 6257
Forcing and its corresponded quasi-maximum Neutrosophic R-SuperHyperCardinality are two 6258
titles in the terms of quasi-R-styles. For any Neutrosophic number, there’s a Neutrosophic 6259
quasi-R-Zero Forcing with that quasi-maximum Neutrosophic SuperHyperCardinality in the terms 6260
of the embedded Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic Super- 6261

HyperGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the collection of 6262
all the Neutrosophic quasi-R-Zero Forcings for all Neutrosophic numbers less than its Neutrosophic 6263
corresponded maximum number. The essence of the Neutrosophic Zero Forcing ends up but this 6264
essence starts up in the terms of the Neutrosophic quasi-R-Zero Forcing, again and more in the 6265
operations of collecting all the Neutrosophic quasi-R-Zero Forcings acted on the all possible used 6266
formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. This 6267
Neutrosophic number is 6268
considered as the equivalence class for all corresponded quasi-R-Zero Forcings. Let 6269
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Zero Forcing be a Neutrosophic 6270
number, a Neutrosophic SuperHyperSet and a Neutrosophic Zero Forcing. Then 6271
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Zero Forcing ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Zero Forcing is re-formalized and 6272
redefined as follows. 6273
GNeutrosophic Zero Forcing ∈ ∪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 6274
definition for the Neutrosophic Zero Forcing. 6275
GNeutrosophic Zero Forcing =

{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 Zero 6276
poses the upcoming expressions.
Forcing 6277

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

= max zNeutrosophic Number

And then, 6279


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



6281

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

6282


6283


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

perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6286
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Zero Forcing” 6287
but, precisely, it’s the generalization of “Neutrosophic Quasi-Zero Forcing” since “Neutrosophic 6288
Quasi-Zero Forcing” happens “Neutrosophic Zero Forcing” in a Neutrosophic SuperHyperGraph as ini- 6289
tial framework and background but “Neutrosophic SuperHyperNeighborhood” may not happens 6290
“Neutrosophic Zero Forcing” in a Neutrosophic SuperHyperGraph as initial framework and prelimin- 6291
arily background since there are some ambiguities about the Neutrosophic SuperHyperCardinality 6292
arise from it. To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, 6293
“Neutrosophic Quasi-Zero Forcing”, and “Neutrosophic Zero Forcing” are up. 6294
Thus, let 6295
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6296
GNeutrosophic Zero Forcing be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood 6297

and a Neutrosophic Zero Forcing and the new terms are up. 6298
GNeutrosophic Zero Forcing ∈ ∪zNeutrosophic Number

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

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

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

And with go back to initial structure, 6302
GNeutrosophic Zero Forcing ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6303

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6304

[zNeutrosophic
Number ]Neutrosophic Class

6305


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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,

Is an Neutrosophic R-Zero Forcing C(ESHG) for an Neutrosophic SuperHyperGraph

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Zero Forcing 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 Zero Forcing is up. The obvious simple
Neutrosophic type-SuperHyperSet called the Neutrosophic Zero Forcing 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-Zero Forcing is up. To sum them up, the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Zero Forcing.

Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Zero Forcing 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 Zero Forcing and it’s an
Neutrosophic Zero Forcing. 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 Zero Forcing. There isn’t only less than two Neutrosophic
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,

Thus the non-obvious Neutrosophic R-Zero Forcing,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Zero Forcing ,
not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6306
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6307
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6308
type-SuperHyperSet called the 6309
“Neutrosophic R-Zero Forcing” 6310
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6311
Neutrosophic R-Zero Forcing, 6312
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic R-Zero Forcing amid those obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic Zero Forcing, 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-Zero Forcing. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a Neutrosophic R-Zero Forcing is the cardinality of
6313
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6314
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Zero Forcing if for 6315

any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6316
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6317
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6318
them. 6319
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6320
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6321
r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6322
Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6323
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6324
SuperHyperVertices. Consider there’s a Neutrosophic R-Zero Forcing with the least cardinality, the 6325
lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6326
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6327
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic 6328

SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutro- 6329
sophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Zero Forcing. Since it doesn’t have 6330
6331
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6332
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6333
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6334

rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6335
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Zero Forcing. 6336
Since it doesn’t do the Neutrosophic procedure such that such that there’s a Neutrosophic 6337
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there are at least 6338
one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected 6339
Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled 6340

its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the Neut- 6341
rosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s only 6342
one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6343
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6344
Neutrosophic R-Zero Forcing, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet 6345
of the Neutrosophic R-Zero Forcing, VESHE , is a Neutrosophic SuperHyperSet, VESHE , includes 6346
only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs are 6347
titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6348
ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6349
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6350
SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6351

SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6352
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Zero Forcing only contains 6353
all interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic SuperHyperVertices 6354
from the unique Neutrosophic SuperHyperEdge where there’s any of them has all possible Neut- 6355
rosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHyperNeighborhoods in 6356
with no exception minus all Neutrosophic SuperHypeNeighbors to some of them not all of them 6357
but everything is possible about Neutrosophic SuperHyperNeighborhoods and Neutrosophic 6358
SuperHyperNeighbors out. 6359
The SuperHyperNotion, namely, Zero Forcing, is up. There’s neither empty SuperHyperEdge 6360
nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6361

SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6362

the Neutrosophic Zero Forcing. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6363

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

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

6369
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6371
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6372
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6373
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6374
non-obvious Neutrosophic Zero Forcing is up. The obvious simple Neutrosophic type-SuperHyperSet 6375
called the Neutrosophic Zero Forcing is a Neutrosophic SuperHyperSet includes only two Neut- 6376
rosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6377
SuperHyperEdges[SuperHyperVertices], 6378

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


= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6379
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6380
Zero Forcing is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6381
SuperHyperEdges[SuperHyperVertices], 6382

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 6383

Zero Forcing. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6384

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Zero Forcing C(ESHG) for an Neutrosophic SuperHyperGraph ESHG : (V, E) 6386
is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6387

no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices given by that 6388
Neutrosophic type-SuperHyperSet called the Neutrosophic Zero Forcing and it’s an Neutrosophic 6389
Zero Forcing. Since it’s 6390
6391
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6393

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

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


= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Zero Forcing , 6397

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 ,
Zero Forcing 6398
not: 6399

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

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- 6401
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6402
Neutrosophic type-SuperHyperSet called the 6403

“Neutrosophic Zero Forcing ” 6404
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6405
Neutrosophic Zero Forcing , 6406
is only and only 6407

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

CHAPTER 31 6409
The Neutrosophic Departures on The 6410
Theoretical Results Toward Theoretical 6411
Motivations 6412
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6413
Neutrosophic SuperHyperClasses. 6414
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6415

{Ei ∈ EN SHG }.
X
= z |Ei | .
Ei ∈EN SHG
{VEIN
1
T ERN AL
, VEEXT ERN AL
i ∈EN SHG
}.
X
= z |Vi | .
∈E
ERN AL }
1 i N SHG
Proof. Let 6416
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6417
P :
E1 , V1EXT ERN AL ,
319
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6422
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6423
SuperHyperModel (31.1), is the SuperHyperZero Forcing. 6424
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6425

{}.


= 0z 0 .
{VEIN
1
T ERN AL
, VEEXT ERN AL
i ∈EN SHG
}.
X
= z |Vi | .
∈E
ERN AL }
1 i N SHG
Proof. Let 6426
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6427
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). 6428

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6432
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6433
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperZero Forcing. 6434

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

Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.7) 136NSHG19a
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6435

{}.
= 0z 0 .
{}.
= 0z 0 .
Proof. Let 6436
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6437
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.9) 136NSHG20a
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6438

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6442
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6443
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6444
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6445
the Neutrosophic SuperHyperZero Forcing. 6446
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6447

Then 6448

{}.
= 0z 0 .
{}.
= 0z 0 .
Proof. Let 6449
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6450
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). 6451

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperZero Forcing in the Example (42.0.11) 136NSHG21a
is a longest SuperHyperZero Forcing taken from a connected Neutrosophic SuperHyperBipartite 6459

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6460
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6463
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6464
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6465

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6466
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6467
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6469
Then 6470

{}.

= 0z 0 .
{}.
= 0z 0 .
Proof. Let 6471
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6472
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperZero Forcing taken from a connected Neutrosophic SuperHyperMultipartite 6473


Then there’s no at least one SuperHyperZero Forcing. Thus the notion of quasi may be up 6477
but the SuperHyperNotions based on SuperHyperZero Forcing could be applied. There are only 6478
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6481
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6482
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6486
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6487
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6488
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6489
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperZero Forcing. 6490
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6491
Then, 6492

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

Proof. Let 6493
P :
CEN T ER, E2∗
6494
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperZero Forcing taken from a connected Neutrosophic SuperHyperWheel 6495


Then there’s at least one SuperHyperZero Forcing. Thus the notion of quasi isn’t up and 6499
the SuperHyperNotions based on SuperHyperZero Forcing could be applied. The unique 6500
embedded SuperHyperZero Forcing proposes some longest SuperHyperZero Forcing excerpt from 6501
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6503
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6504
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6505
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6506
SuperHyperModel (31.6), is the Neutrosophic SuperHyperZero Forcing. 6507

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperZero Forcing in the Neutrosophic Example (42.0.15) 136NSHG23a

CHAPTER 32 6508
The Surveys of Mathematical Sets On 6509
The Results But As The Initial Motivation 6510
For the SuperHyperZero Forcing, Neutrosophic SuperHyperZero , and the Neutrosophic

Forcing 6511
SuperHyperZero Forcing, some general results are introduced. 6512
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperZero Forcing is “redefined” on the 6513
positions of the alphabets. 6514
Corollary 32.0.2. Assume Neutrosophic SuperHyperZero Forcing. Then 6515
N eutrosophic SuperHyperZeroF orcing =

{theSuperHyperZeroF orcingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperZeroF orcing
|N eutrosophiccardinalityamidthoseSuperHyperZeroF orcing. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6516
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6517
the neutrality, for i = 1, 2, 3, respectively. 6518
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6519
the alphabet. Then the notion of Neutrosophic SuperHyperZero Forcing and SuperHyperZero Forcing 6520
coincide. 6521
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6522
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6523
SuperHyperZero Forcing if and only if it’s a SuperHyperZero Forcing. 6524
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6525
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperZero 6526
Forcing if and only if it’s a longest SuperHyperZero Forcing. 6527
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6528
identical letter of the alphabet. Then its Neutrosophic SuperHyperZero Forcing is its SuperHyperZero 6529
Forcing and reversely. 6530
331
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperZero Forcing, SuperHy- 6531

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 6532
letter of the alphabet. Then its Neutrosophic SuperHyperZero Forcing is its SuperHyperZero Forcing 6533
and reversely. 6534
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6535
perZero Forcing isn’t well-defined if and only if its SuperHyperZero Forcing isn’t well-defined. 6536
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6537

Neutrosophic SuperHyperZero Forcing isn’t well-defined if and only if its SuperHyperZero Forcing isn’t 6538
well-defined. 6539

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neut- 6541
rosophic SuperHyperZero Forcing isn’t well-defined if and only if its SuperHyperZero Forcing isn’t 6542
well-defined. 6543
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6544
perZero Forcing is well-defined if and only if its SuperHyperZero Forcing is well-defined. 6545
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6546

its Neutrosophic SuperHyperZero Forcing is well-defined if and only if its SuperHyperZero Forcing is 6547
well-defined. 6548

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutro- 6550
sophic SuperHyperZero Forcing is well-defined if and only if its SuperHyperZero Forcing is well-defined. 6551
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6552
(i) : the dual SuperHyperDefensive SuperHyperZero Forcing; 6553
(ii) : the strong dual SuperHyperDefensive SuperHyperZero Forcing; 6554
(iii) : the connected dual SuperHyperDefensive SuperHyperZero Forcing; 6555
(iv) : the δ-dual SuperHyperDefensive SuperHyperZero Forcing; 6556
(v) : the strong δ-dual SuperHyperDefensive SuperHyperZero Forcing; 6557
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperZero Forcing. 6558
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6559
(iii) : the connected defensive SuperHyperDefensive SuperHyperZero Forcing; 6562

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

independent SuperHyperSet is 6567
(iii) : the connected SuperHyperDefensive SuperHyperZero Forcing; 6570
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6574

Graph which is a SuperHyperZero Forcing/SuperHyperPath. Then V is a maximal 6575
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperZero Forcing; 6579
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperZero Forcing; 6580
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperZero Forcing; 6581
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6583

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6584
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperZero Forcing; 6588
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperZero Forcing; 6589
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperZero Forcing; 6590

Graph which is a SuperHyperZero Forcing/SuperHyperPath. Then the number of 6593
(i) : the SuperHyperZero Forcing; 6594

(ii) : the SuperHyperZero Forcing; 6595
(iii) : the connected SuperHyperZero Forcing; 6596
(iv) : the O(ESHG)-SuperHyperZero Forcing; 6597
(v) : the strong O(ESHG)-SuperHyperZero Forcing; 6598
(vi) : the connected O(ESHG)-SuperHyperZero Forcing. 6599
coincide. 6601

Graph which is a SuperHyperWheel. Then the number of 6603
(i) : the dual SuperHyperZero Forcing; 6604
(ii) : the dual SuperHyperZero Forcing; 6605
(iii) : the dual connected SuperHyperZero Forcing; 6606
(iv) : the dual O(ESHG)-SuperHyperZero Forcing; 6607
(v) : the strong dual O(ESHG)-SuperHyperZero Forcing; 6608
(vi) : the connected dual O(ESHG)-SuperHyperZero Forcing. 6609
coincide. 6611
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6612
perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6613

Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6614
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6615
SuperHyperVertices is a 6616
O(ESHG)
O(ESHG)
O(ESHG)

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6624
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6625
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6626
SuperHyperPart is a 6627

(iv) : δ-SuperHyperDefensive SuperHyperZero Forcing; 6631
(v) : strong δ-SuperHyperDefensive SuperHyperZero Forcing; 6632
(vi) : connected δ-SuperHyperDefensive SuperHyperZero Forcing. 6633

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6635
plete SuperHyperMultipartite. Then Then the number of 6636
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6643
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6644
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6646
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6647
(iv) : SuperHyperZero Forcing; 6651
Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6654
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6655
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6656
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6657

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



Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6665
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6666
of dual 6667
(iv) : 0-SuperHyperDefensive SuperHyperZero Forcing; 6671

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6675

SuperHyperZero Forcing/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 6677
and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6678
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperZero Forcing; 6682
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperZero Forcing; 6683
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperZero Forcing. 6684

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number 6686
is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), 6687
t>
2
in the setting of a dual 6688



Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6695
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6696
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6697
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6698
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6699

a dual SuperHyperDefensive SuperHyperZero Forcing, then ∀v ∈ V \ S, ∃x ∈ S such that 6700
(i) v ∈ Ns (x); 6701
(ii) vx ∈ E. 6702
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6703

a dual SuperHyperDefensive SuperHyperZero Forcing, then 6704
(i) S is SuperHyperZero Forcing set; 6705
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6706
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6707
(i) Γ ≤ O; 6708
(ii) Γs ≤ On . 6709
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6710
connected. Then 6711
(i) Γ ≤ O − 1; 6712
(ii) Γs ≤ On − Σ3i=1 σi (x). 6713
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6714

Forcing; 6716
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6718
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6719

Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6721
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperZero Forcing; 6722
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6723
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6724
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6725
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperZero Forcing. Then 6727
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperZero 6728

Forcing; 6729
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6730
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6731
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6732
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperZero Forcing. Then 6734

Forcing; 6736
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6738
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6739
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6741
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperZero Forcing; 6742
(ii) Γ = 1; 6743
(iii) Γs = Σ3i=1 σi (c); 6744
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperZero Forcing. 6745
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6746
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6747
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6749
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6750
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6751
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6753
bn
2 c+1
(ii) Γ = b n2 c + 1; 6755
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 6756
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperZero 6757
Forcing. 6758
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6759
bn
2c
(ii) Γ = b n2 c; 6761

bnc ; 6762
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHy- 6763
perZero Forcing. 6764
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6765

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6766
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperZero 6767

(ii) Γ = m for N SHF : (V, E); 6769
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6770
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperZero Forcing 6771
for N SHF : (V, E). 6772
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6773

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6774
b n c+1
2
is a dual maximal SuperHyperDefensive SuperHyperZero 6775
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6777

b n c+1 for N SHF : (V, E); 6778
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperZero Forcing for 6779
N SHF : (V, E). 6780

Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6781

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6782
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperZero Forcing for 6783
N SHF : (V, E); 6784
(ii) Γ = b n2 c for N SHF : (V, E); 6785

bnc for N SHF : (V, E); 6786
S={vi }i=1
bnc
2
are only dual maximal SuperHyperZero Forcing for 6787
N SHF : (V, E). 6788
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6791
SuperHyperZero Forcing, then S is an s-SuperHyperDefensive SuperHyperZero Forcing; 6792

SuperHyperZero Forcing, then S is a dual s-SuperHyperDefensive SuperHyperZero Forcing. 6794
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6797

SuperHyperZero Forcing, then S is an s-SuperHyperPowerful SuperHyperZero Forcing; 6798

SuperHyperZero Forcing, then S is a dual s-SuperHyperPowerful SuperHyperZero Forcing. 6800
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6801

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

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

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6811

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

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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| b O−1

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

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

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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperZero 6843
Forcing; 6844
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6845

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

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


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

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


CHAPTER 33 6861
Neutrosophic Applications in Cancer’s 6862
Neutrosophic Recognition 6863
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6864
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6865
disease is considered and as the consequences of the model, some parameters are used. The cells 6866
are under attack of this disease but the moves of the cancer in the special region are the matter 6867
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6868
treatments for this Neutrosophic disease. 6869
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6870
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6871
term Neutrosophic function. 6872
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6873
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6874
move from the cancer is identified by this research. Sometimes the move of the cancer 6875
about the moves and the effects of the cancer on that region; this event leads us to 6877
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6878
perception on what’s happened and what’s done. 6879
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6880
known and they’ve got the names, and some general Neutrosophic models. The 6881
moves and the Neutrosophic traces of the cancer on the complex tracks and between 6882
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 6883
/SuperHyperZero Forcing, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 6884
SuperHyperWheel). The aim is to find either the Neutrosophic SuperHyperZero 6885

Forcing or the Neutrosophic SuperHyperZero Forcing in those Neutrosophic Neutrosophic 6886
SuperHyperModels. 6887
343
CHAPTER 34 6888
Case 1: The Initial Neutrosophic Steps 6889
Toward Neutrosophic 6890
SuperHyperBipartite as Neutrosophic 6891
SuperHyperModel 6892
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6893
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6894
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6895
perBipartite is obtained. 6896
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6897
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6898
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6899
(34.1), is the Neutrosophic SuperHyperZero Forcing. 6900

CHAPTER 35 6901
Case 2: The Increasing Neutrosophic 6902
Steps Toward Neutrosophic 6903
SuperHyperMultipartite as 6904
Neutrosophic SuperHyperModel 6905
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6906
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6907
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6908
perMultipartite is obtained. 6909
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6910
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

347
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6911

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6912
Neutrosophic SuperHyperZero Forcing. 6913

CHAPTER 36 6914
Wondering Open Problems But As The 6915
Directions To Forming The Motivations 6916
In what follows, some “problems” and some “questions” are proposed. 6917
The SuperHyperZero Forcing and the Neutrosophic SuperHyperZero Forcing are defined on a real-world 6918
application, titled “Cancer’s Recognitions”. 6919
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6920
recognitions? 6921
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperZero Forcing and the 6922
Neutrosophic SuperHyperZero Forcing? 6923
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6924
them? 6925
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperZero Forcing 6926
and the Neutrosophic SuperHyperZero Forcing? 6927
Problem 36.0.5. The SuperHyperZero Forcing and the Neutrosophic SuperHyperZero Forcing do a 6928
SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperZero Forcing, are 6929
there else? 6930
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6931
Numbers types-results? 6932
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6933
the multiple types of SuperHyperNotions? 6934
349
CHAPTER 37 6935
Conclusion and Closing Remarks 6936
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6937
research are illustrated. Some benefits and some advantages of this research are highlighted. 6938
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6939
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperZero Forcing. For 6940
that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph is 6941
redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6942
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperZero Forcing, finds the 6943
convenient background to implement some results based on that. Some SuperHyperClasses and 6944
some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 6945
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned on 6946
the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, Super- 6947
HyperZero Forcing, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some 6948
general results are gathered in the section on the SuperHyperZero Forcing and the Neutrosophic 6949
SuperHyperZero Forcing. The clarifications, instances and literature reviews have taken the whole 6950
way through. In this research, the literature reviews have fulfilled the lines containing the 6951
notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 6952
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 6953
based on the connectivities of the moves of the cancer in the longest and strongest styles with 6956
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 6959
benefits and avenues for this research are, figured out, pointed out and spoken out. 6960
351
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperZero Forcing
3. Neutrosophic SuperHyperZero Forcing 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6961
Neutrosophic SuperHyperDuality But As 6962
Super Forms 6964
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6965

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6969

Va ∈ Ei , Ej ; 6970
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6971

Va ∈ Ei , Ej and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6972
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6973

Vi , Vj ∈ Ea ; 6974
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6975

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6976
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6977

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6978
sophic rv-SuperHyperDuality. 6979
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6980

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6983

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6985
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 6986
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 6987
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 6988
353
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6990

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6992
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 6993
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 6994
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 6995
form the Neutrosophic SuperHyperDuality; 6996
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6997
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6998

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6999
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7000
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7001
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7002
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7004
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7006

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7008
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7009
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7010
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7011
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 7012
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7013
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7014
coefficient; 7015
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7016

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7018
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7019
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7020
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7021
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7023

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7024
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7025
that they form the Neutrosophic SuperHyperDuality; 7029
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7030

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7031
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7032

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

SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7037
power is corresponded to its Extreme coefficient; 7038
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7039

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7041

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7044
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7047
coefficient. 7048
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7049
the mentioned Neutrosophic Figures in every Neutrosophic items. 7050
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7051

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7052
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7053
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7054
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7055
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7056
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7057
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7058
C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 3z.


every given Neutrosophic SuperHyperDuality. 7067




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7127
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 7129


the Neutrosophic SuperHyperDuality. 7138
Then 7140
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 7141
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7147
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7150

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7160

(V, E). Then 7161

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 7162
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7163


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

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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7180
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7181
Then, 7182
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 7183
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 7184


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7189
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7190
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7196

CHAPTER 39 7197
Neutrosophic SuperHyperJoin But As 7198
Super Forms 7200
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7201

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7205
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7207

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = 7208
|Ej |NEUTROSOPHIC CARDINALITY ; 7209
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7210

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7212

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7213
|Vj |NEUTROSOPHIC CARDINALITY ; 7214
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7215

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7216
rv-SuperHyperJoin. 7217
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7218

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

367

Extreme SuperHyperJoin; 7227
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7228

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7230
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7231
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7232
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7233
Neutrosophic SuperHyperJoin; 7234
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7235

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7236
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7237
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7242
coefficient; 7243
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7244

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7245
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7246
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7247
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7248
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7249
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7250

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7251
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7252
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7253

Extreme SuperHyperJoin; 7259
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7260

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7262
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7263
Neutrosophic SuperHyperJoin; 7266

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7267

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7269

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7274
its Extreme coefficient; 7275
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7276

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7278
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7279

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7280
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7281
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7284
coefficient. 7285
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7289


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. 7304




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7355

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7364
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 7366


the Neutrosophic SuperHyperJoin. 7375
Then 7377
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 7378
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 7384
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7386

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


(V, E). Then 7397

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7399


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

Then, 7417

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

.
Proof. Let 7418
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7419


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7423
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7424
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7425
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7430

CHAPTER 40 7431
Neutrosophic SuperHyperPerfect But As 7432
Super Forms 7434
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7435

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7446
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7447

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7448
rv-SuperHyperPerfect. 7449
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7450

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7455
381
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7460

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7462
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7463
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7464
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7465
form the Neutrosophic SuperHyperPerfect; 7466
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7467

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7468
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7469
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7472
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7476

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7478
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7481
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7484
coefficient; 7485
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7486

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7494
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7495
that they form the Neutrosophic SuperHyperPerfect; 7499
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7500

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7502

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7505
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7509

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7511
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7514

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7517
coefficient. 7518

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7522

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. 7537





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7588
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 7590
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7608
Then 7610
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 7611
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 7615
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7616
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7617
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7620

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

(V, E). Then 7631

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7654


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7657
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7658
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7659
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7660
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7666

CHAPTER 41 7667
Neutrosophic SuperHyperTotal But As 7668
Super Forms 7670
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7671

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7675

Va ∈ Ei , Ej ; 7676
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7677

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7678
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7679

Vi , Vj ∈ Ea ; 7680
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7681

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7682
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7683

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7684
rv-SuperHyperTotal. 7685
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7686

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7691
Extreme SuperHyperTotal; 7695
395
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7696

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7698
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7699
Neutrosophic SuperHyperTotal; 7702
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7703
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7704

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7705
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7710
coefficient; 7711
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7712
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7713

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7714
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7715
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7716
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7717
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7718
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7719
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7720
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7721

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7723
Extreme SuperHyperTotal; 7727
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7728

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7730
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7731
Neutrosophic SuperHyperTotal; 7734
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7735

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7736
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7737

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7742
its Extreme coefficient; 7743
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7744
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7745

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7746
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7747
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7748
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7749
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7750
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7751
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7752

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7756

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. 7771




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7822
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 7824
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. 7831
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 7833


the Neutrosophic SuperHyperTotal. 7842
Then 7844
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 7845
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7851
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7853

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7864

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7866


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7871
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. 7882
Then, 7884
∗
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 7885
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7886


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7890
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7891
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7892
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7898

CHAPTER 42 7899
Neutrosophic SuperHyperConnected But 7900
As The Extensions Excerpt From Dense 7901
And Super Forms 7902
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7903

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7907
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7908
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7909

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7910
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7911
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7912

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7913
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7914

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7915
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7916
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7917
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7918
rosophic rv-SuperHyperConnected. 7919
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7920

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7923
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7924
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7925
409
form the Extreme SuperHyperConnected; 7929
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7930

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7931
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7932
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 7933
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 7934

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7936
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7937
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7938

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7939
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7946

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7947
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7948
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7949
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7950
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7951
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 7952

Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 7954
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7956

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7958
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7959
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7960
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 7961
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7962
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7963

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 7965
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 7966
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 7967
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7969

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7970

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7973
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 7974
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 7975

and the Extreme power is corresponded to its Extreme coefficient; 7978
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7979

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7982
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7983
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7984
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 7985

Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 7987
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7992
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7994
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7995

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7996
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7997
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7998
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. 8006


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 8050
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. 8057
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 8059
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. 8066
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 8068



the Neutrosophic SuperHyperConnected. 8077
Then 8079
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 8080
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 8085
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8086
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8089

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8100
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 8101
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8102


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8106
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8107
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. 8119
Then, 8121
∗
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 8122
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8123


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8126
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8127
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8128
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8129
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8135

CHAPTER 43 8136
Background 8137
423



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 8207
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 8208
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8209
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 8210
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 8213
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 8214
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8215
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 8216

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

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

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 8224
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 8225
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 8226
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8227
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyper- 8228
Graph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” 8229

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

SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 8236
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 8237
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 8238
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 8239
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 8240
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 8241
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 8242
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 8243
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 8244
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 8245
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 8246
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 8247
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 8248
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 8249
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 8250
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 8251
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 8252

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

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

(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 8263
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 8264
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 8265
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 8266
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 8267
(2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 8268

HG169b; HG170b; HG171b; HG172b; HG173b; HG174b]. Two popular scientific re- 8302
search books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutrosophic 8303
science is on [HG32b; HG44b]. 8304



HG269] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 8340



Bibliography 8356
37-60. 8359
10.33140/JMTCM.01.03.09) 8380
429
10.20944/preprints202301.0282.v1). 8396
10.20944/preprints202301.0267.v1). 8399
(doi: 10.20944/preprints202301.0265.v1). 8404
prints202301.0262.v1). 8408
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8414

prints202301.0105.v1). 8417

Preprints 2023, 2023010044 8423

10.20944/preprints202301.0043.v1). 8426

(doi: 10.20944/preprints202212.0549.v1). 8435
(doi: 10.20944/preprints202212.0500.v1). 8442
odo.7978571). 8451
10.5281/zenodo.7978857). 8454
10.5281/zenodo.7940830). 8457
10.5281/zenodo.7943578). 8460

odo.7916595). 8463
odo.7923632). 8466
(doi: 10.5281/zenodo.7904698). 8469
2023, (doi: 10.5281/zenodo.7904671). 8472
10.5281/zenodo.7871026). 8481
2023, (doi: 10.5281/zenodo.7874647). 8484
10.5281/zenodo.7857856). 8487
2023, (doi: 10.5281/zenodo.7857841). 8490
10.5281/zenodo.7853867). 8499

10.5281/zenodo.7853922). 8502
(doi: 10.5281/zenodo.7851519). 8505
(doi: 10.5281/zenodo.7851550). 8508
10.5281/zenodo.7834229). 8517
10.5281/zenodo.7834261). 8520
10.5281/zenodo.7824560). 8523
(doi: 10.5281/zenodo.7824623). 8526

2023, (doi: 10.5281/zenodo.7809365). 8537

2023, (doi: 10.5281/zenodo.7809358). 8540
10.5281/zenodo.7809219). 8543
10.5281/zenodo.7809328). 8546
2023, (doi: 10.5281/zenodo.7806767). 8549
2023, (doi: 10.5281/zenodo.7806838). 8552
10.5281/zenodo.7799902). 8561
(doi: 10.5281/zenodo.7804218). 8564
(doi: 10.5281/zenodo.7796334). 8567
10.5281/zenodo.7791952). 8573
10.5281/zenodo.7791982). 8576

10.5281/zenodo.7790026). 8579
10.5281/zenodo.7790052). 8582
2023, (doi: 10.5281/zenodo.7787066). 8585
10.5281/zenodo.7781476). 8591
10.5281/zenodo.7783082). 8594
10.5281/zenodo.7777857). 8597
10.5281/zenodo.7779286). 8600
(doi: 10.5281/zenodo.7771831). 8603
2023, (doi: 10.5281/zenodo.7772468). 8606
10.13140/RG.2.2.20913.25446). 8609
odo.7764916). 8612
10.13140/RG.2.2.11770.98247). 8615

10.13140/RG.2.2.12400.12808). 8618
2023, (doi: 10.13140/RG.2.2.22545.10089). 8621
10.13140/RG.2.2.11377.76644). 8627
10.13140/RG.2.2.23750.96329). 8630
10.13140/RG.2.2.31366.24641). 8633
10.13140/RG.2.2.34721.68960). 8636
2023, (doi: 10.13140/RG.2.2.30212.81289). 8639
10.13140/RG.2.2.24288.35842). 8645
10.13140/RG.2.2.32467.25124). 8648
10.13140/RG.2.2.31025.45925). 8651
10.13140/RG.2.2.17184.25602). 8654

10.13140/RG.2.2.23423.28327). 8657
10.13140/RG.2.2.28456.44805). 8660
10.13140/RG.2.2.23525.68320). 8663
10.13140/RG.2.2.20170.24000). 8666
10.13140/RG.2.2.36475.59683). 8669
10.13140/RG.2.2.29764.71046). 8672
2023, (doi: 10.13140/RG.2.2.18780.87683). 8675
10.13140/RG.2.2.26134.01603). 8681
10.13140/RG.2.2.27392.30721). 8684
10.13140/RG.2.2.33028.40321). 8687
10.13140/RG.2.2.21389.20966). 8690
10.13140/RG.2.2.16356.04489). 8693

10.13140/RG.2.2.21756.21129). 8696
10.13140/RG.2.2.30983.68009). 8699
10.13140/RG.2.2.28552.29445). 8702
(doi: 10.13140/RG.2.2.10936.21761). 8705
10.13140/RG.2.2.35105.89447). 8708
(doi: 10.13140/RG.2.2.30072.72960). 8711
10.13140/RG.2.2.31147.52003). 8714
10.13140/RG.2.2.32825.24163). 8717
10.13140/RG.2.2.13059.58401). 8720
10.13140/RG.2.2.11172.14720). 8723
2023, (doi: 10.13140/RG.2.2.22011.80165). 8726
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8729
2023, (doi: 10.13140/RG.2.2.10493.84962). 8732

ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8735
2023, (doi: 10.13140/RG.2.2.19944.14086). 8738
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8741
(doi: 10.13140/RG.2.2.33103.76968). 8744
(doi: 10.13140/RG.2.2.23037.44003). 8747
(doi: 10.13140/RG.2.2.35646.56641). 8750
10.13140/RG.2.2.18030.48967). 8753
(doi: 10.13140/RG.2.2.13973.81121). 8756
2023, (doi: 10.13140/RG.2.2.34106.47047). 8759
2023, (doi: 10.13140/RG.2.2.31956.88961). 8765
2023, (doi: 10.13140/RG.2.2.15179.67361). 8768
10.13140/RG.2.2.21510.45125). 8771

2023, (doi: 10.13140/RG.2.2.13121.84321). 8774
10.13140/RG.2.2.11758.69441). 8777
2023, (doi: 10.13140/RG.2.2.31891.35367). 8780
10.13140/RG.2.2.19360.87048). 8783
10.13140/RG.2.2.32363.21286). 8786
10.13140/RG.2.2.23266.81602). 8789
10.13140/RG.2.2.19911.37285). 8792
10.13140/RG.2.2.11050.90569). 8795
2023, (doi: 10.13140/RG.2.2.17761.79206). 8798
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8804
(doi: 10.13140/RG.2.2.30182.50241). 8807

2023, (doi: 10.13140/RG.2.2.17252.24968). 8840
2023010396 (doi: 10.20944/preprints202301.0396.v1). 8849

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8852

2023,(doi: 10.13140/RG.2.2.36745.93289). 8866
10.20944/preprints202301.0282.v1). 8873
10.20944/preprints202301.0267.v1).). 8876

(doi: 10.20944/preprints202301.0265.v1). 8881
prints202301.0262.v1). 8885

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

10.13140/RG.2.2.35061.65767). 8894

10.13140/RG.2.2.18494.15680). 8898

10.13140/RG.2.2.32530.73922). 8902

10.13140/RG.2.2.15897.70243). 8906
10.13140/RG.2.2.32530.73922). 8910
prints202301.0105.v1). 8913


10.13140/RG.2.2.23172.19849). 8920


10.13140/RG.2.2.17385.36968). 8930
Preprints 2023, 2023010044 8933
10.20944/preprints202301.0043.v1). 8936
2023, (doi: 10.13140/RG.2.2.28945.92007). 8939
10.13140/RG.2.2.35774.77123). 8945
10.13140/RG.2.2.29430.88642). 8951
(doi: 10.20944/preprints202212.0549.v1). 8957
10.13140/RG.2.2.19380.94084). 8960

(doi: 10.20944/preprints202212.0500.v1). 8971
10.13140/RG.2.2.20993.12640). 8974

10.13140/RG.2.2.29173.86244). 8989
10.5281/zenodo.7978921). 8994
odo.7943878). 8996
10.5281/zenodo.7943871). 8998
10.5281/zenodo.7923786). 9000
2023 (doi: 10.5281/zenodo.7905287). 9002


2023 (doi: 10.5281/zenodo.7874677). 9006
(doi: 10.5281/zenodo.7857906). 9008
2023 (doi: 10.5281/zenodo.7856329). 9010
10.5281/zenodo.7854561). 9012
2023 (doi: 10.5281/zenodo.7851893). 9014

(doi: 10.5281/zenodo.7835063). 9018
(doi: 10.5281/zenodo.7826705). 9020
2023 (doi: 10.5281/zenodo.7820680). 9022
10.5281/zenodo.7812750). 9024

2023 (doi: 10.5281/zenodo.7807782). 9030
2023 (doi: 10.5281/zenodo.7804449). 9032

(doi: 10.5281/zenodo.7792307). 9036
(doi: 10.5281/zenodo.7790728). 9038

2023 (doi: 10.5281/zenodo.7787712). 9040
10.5281/zenodo.7783791). 9042
10.5281/zenodo.7780123). 9044
(doi: 10.5281/zenodo.7773119). 9046
odo.7637762). 9048
10.5281/zenodo.7766174). 9050
10.5281/zenodo.7762232). 9052
(doi: 10.5281/zenodo.7758601). 9054
10.5281/zenodo.7754661). 9056
10.5281/zenodo.7750995) . 9058
(doi: 10.5281/zenodo.7749875). 9060
10.5281/zenodo.7747236). 9062
10.5281/zenodo.7742587). 9064
(doi: 10.5281/zenodo.7738635). 9066
10.5281/zenodo.7734719). 9068
10.5281/zenodo.7730484). 9070
(doi: 10.5281/zenodo.7730469). 9072
10.5281/zenodo.7722865). 9074

odo.7713563). 9076
odo.7709116). 9078
10.5281/zenodo.7706415). 9080
10.5281/zenodo.7706063). 9082
10.5281/zenodo.7701906). 9084
odo.7700205). 9086
10.5281/zenodo.7694876). 9088
10.5281/zenodo.7679410). 9090
10.5281/zenodo.7675982). 9092
10.5281/zenodo.7672388). 9094
odo.7668648). 9096
10.5281/zenodo.7662810). 9098
10.5281/zenodo.7659162). 9100
odo.7653233). 9102
odo.7653204). 9104
odo.7653142). 9106
odo.7653117). 9108

odo.7651687). 9111
odo.7651619). 9113
odo.7651439). 9115
odo.7650729). 9117
odo.7647868). 9119
odo.7647017). 9121
odo.7644894). 9123
odo.7632923). 9126
odo.7623459). 9128
10.5281/zenodo.7606416). 9130
10.5281/zenodo.7606416). 9132
odo.7606404). 9134
10.5281/zenodo.7580018). 9136
odo.7580018). 9138
odo.7580018). 9140
odo.7579929). 9142
10.5281/zenodo.7563170). 9144

odo.7563164). 9146
odo.7563160). 9148
odo.7563160). 9150
10.5281/zenodo.7563160). 9152
10.5281/zenodo.7557063). 9154
10.5281/zenodo.7557009). 9156
10.5281/zenodo.7539484). 9158
10.5281/zenodo.7523390). 9160
10.5281/zenodo.7523390). 9162
10.5281/zenodo.7523390). 9164
odo.7574952). 9166
10.5281/zenodo.7574992). 9168
odo.7523357). 9170
10.5281/zenodo.7523357). 9172
10.5281/zenodo.7504782). 9174
10.5281/zenodo.7504782). 9176
10.5281/zenodo.7504782). 9178
10.5281/zenodo.7499395). 9180

odo.7499395). 9182
10.5281/zenodo.7499395). 9184
10.5281/zenodo.7497450). 9186
10.5281/zenodo.7497450). 9188
10.5281/zenodo.7494862). 9190
odo.7494862). 9192
10.5281/zenodo.7494862). 9194
10.5281/zenodo.7493845). 9196
odo.7493845). 9198
10.5281/zenodo.7493845). 9200
odo.7539484). 9202
odo.7523390). 9204
odo.7523357). 9206
odo.7504782). 9208
odo.7499395). 9210
odo.7497450). 9212
odo.7494862). 9214
odo.7493845). 9216

odo.7480110). 9218
odo.7378758). 9220
odo.6320305). 9222
odo.6677173). 9224

CHAPTER 44 9225
Books’ Contributions 9226
“Books’ Contributions”: | Featured Threads 9227

The following references are cited by chapters. 9228
9229
[Ref270] 9230
Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In Recognition of 9231
Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8020128). 9232
9233
[Ref271] 9234
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9235
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zenodo.8017246). 9236
9237
The links to the contributions of this scientific research book are listed below. 9238
[HG270] 9239

9242
[TITLE] “New Ideas On Super forceps By Hyper ford Of Zero Forcing In Recognition 9243
of Cancer With (Neutrosophic) SuperHyperGraph” 9244
9245
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9246
https://www.researchgate.net/publication/371417211 9247
9248
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9249
https://www.scribd.com/document/651775233 9250
9251
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9252
https://zenodo.org/record/8020128 9253
9254
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9255
https://www.academia.edu/103094209 9256
9257
[ADDRESSED CITATION] 9258
453
Figure 44.1: 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).

[ASSIGNED NUMBER] #270 Article 9261
[DATE] Jun 2023 9262
[DOI] 10.5281/zenodo.8020128 9263
[LICENSE] CC BY-NC-ND 4.0 9264
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9265
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9266

ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9267
9268
[HG271] 9269
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9270
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zenodo.8017246). 9271
9272
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9273
Zero Forcing As Hyper ford On Super forceps” 9274
9275
https://www.researchgate.net/publication/371379868 9277
9278
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9279
https://www.scribd.com/document/651547091 9280
9281
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9282
9284

10.5281/zenodo.8020128).
10.5281/zenodo.8020128).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi:
10.5281/zenodo.8017246).
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9285

https://www.academia.edu/103046022 9286
9287

Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9289
Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zenodo.8017246). 9290
[ASSIGNED NUMBER] #271 Article 9291
[DATE] Jun 2023 9292
[DOI] 10.5281/zenodo.8017246 9293
[LICENSE] CC BY-NC-ND 4.0 9294

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9295
[AVAILABLE AT TWITTER’S IDS] 9296
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9297
googlebooks GooglePlay 9298
9299
[ASSIGNED NUMBER] | Book #175 9300

HG175b
Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9302
10.5281/zenodo.8020181). 9303
[TITLE] Zero Forcing In SuperHyperGraphs 9304
#Latest_Updates 9305
#The_Links 9306

10.5281/zenodo.8017246).
10.5281/zenodo.8017246).

9310
9312
#The_Links 9313
9314
[ASSIGNED NUMBER] | Book #175 9315
9316
[TITLE] Zero Forcing In SuperHyperGraphs 9317
9318
9322
– 9323
9324
[PUBLISHER] 9325
(Paperback): https://www.amazon.com/dp/- 9326
(Hardcover): https://www.amazon.com/dp/- 9327

(Kindle Edition): https://www.amazon.com/dp/- 9328
9329
– 9330
9331
[ISBN] 9332
(Paperback): - 9333
(Hardcover): - 9334
(Kindle Edition): CC BY-NC-ND 4.0 9335
(EBook): CC BY-NC-ND 4.0 9336
9337
– 9338
9339
[PRINT LENGTH] 9340
(Paperback): - pages 9341
(Hardcover): - pages 9342
(Kindle Edition): - pages 9343
(E-Book): - pages 9344
9345
– 9346
9347
9349
#The_Links 9350
9351
https://www.researchgate.net/publication/- 9353
9354
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9355

https://drhenrygarrett.wordpress.com/2023/07/22/ 9356
Zero-Forcing-In-SuperHyperGraphs/ 9357
9358
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9359
https://www.scribd.com/document/- 9360
9361
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9362

https://www.academia.edu/- 9363
9364
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9365
9367
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9368
https://books.google.com/books/about?id=- 9369
9370
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9371
https://play.google.com/store/books/details?id=- 9372

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9373

9374
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9375
9376
https://drhenrygarrett.wordpress.com/2023/07/22/ 9377
Zero-Forcing-In-SuperHyperGraphs/ 9378
9379
– 9380
9381
[POSTED BY] Dr. Henry Garrett 9382
9383
[DATE] June 009, 2023 9384

9385
[POSTED IN] 175 | Zero Forcing In SuperHyperGraphs 9386
9387
[TAGS] 9388
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9389
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9390
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9391
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9392
neutrosophic SuperHyperGraphs, Neutrosophic Zero Forcing In SuperHyperGraphs, Open 9393
Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 9394
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 9395
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 9396
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 9397

SuperHyperGraphs, Zero Forcing In SuperHyperGraphs, SuperHyperModeling, SuperHyperVer- 9398
tices, Theoretical Research, Vertex, Vertices. 9399
In this scientific research book, there are some scientific research chapters on “Extreme Zero 9400
Forcing In SuperHyperGraphs” and “Neutrosophic Zero Forcing In SuperHyperGraphs” about 9401
some scientific research on Zero Forcing In SuperHyperGraphs by two (Extreme/Neutrosophic) 9402
notions, namely, Extreme Zero Forcing In SuperHyperGraphs and Neutrosophic Zero Forcing 9403
In SuperHyperGraphs. With scientific research on the basic scientific research properties, the 9404
scientific research book starts to make Extreme Zero Forcing In SuperHyperGraphs theory and 9405
Neutrosophic Zero Forcing In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9406
understandable. 9407

HG175b1.png
Figure 44.7: [HG175b] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.8020181).

HG175b2.png
2023 (doi: 10.5281/zenodo.8020181).

HG175b3.png
2023 (doi: 10.5281/zenodo.8020181).

CHAPTER 45 9408
“SuperHyperGraph-Based Books”: | 9409
Featured Tweets 9410
“SuperHyperGraph-Based Books”: | Featured Tweets 9411
465
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 9412
CV 9413
493
9414
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
9415
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)
9416
Publications: Articles
2023 245 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
@ResearchGate: https://www.researchgate.net/publication/369977142
@Scribd: https://www.scribd.com/document/637993759
@ZENODO_ORG: https://zenodo.org/record/7824560
@academia: https://www.academia.edu/100136177
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

9417

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript

9418
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress

Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

9419
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
Zenodo 2023, (doi: 10.5281/zenodo.7793372).
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript

9420
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

9421
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

10.5281/zenodo.7779286).
2023 216 Article

9422
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
9423
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

9424
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

9425
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript

9426
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor
10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

9427
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript

9428
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In
10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript

9429
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

9430
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript

9431
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

9432
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript

9433
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
9434
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

9435

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript

9436
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

9437

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
9438
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript

9439
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
9440
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
9441
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition

Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
9442
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9443
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
9444
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

9445
2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
9446
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

9447
2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
9448
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
9449
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9450
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).
9451

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
9452
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
2021 0013 | Matroid And Its Outlines Manuscript
Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
2021 0012 | Matroid And Its Relations Manuscript
Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
2021 0011 | Metric Number in Dimension Manuscript
Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
9453
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7820680).
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9454
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9455
[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

9456
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

9457
[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

9458
[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

9459
[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

9460
[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

9461
[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

9462
[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

9463
[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

9464
[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

9465
[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

9466
[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

9467
[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

9468
[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

9469
[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

9470
[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

9471
[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

9472
[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

9473
[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

9474
[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

9475
[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

9476
[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

9477
[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

9478
[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

9479
[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
9480
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

9481
[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

9482
[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

9483
[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

9484
[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

9485
[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
9486
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

9487
“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

9488
[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
9489
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

9490
[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

9491
[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

9492
[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

9493
[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

9494
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

9495
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
9496
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
9497
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

9498
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

9499
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
-
9500
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

9501
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9502
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
9503
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
9504
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

9505
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
9506
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
...
9507
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/
9508
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
9509
9510
9511
Henry Garrett
01/23/2022
9512
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
9513
View publication stats

Zero Forcing 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

Zero Forcing in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

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

Zero Forcing In SuperHyperGraphs

Book · June 2023

482 PUBLICATIONS 18,203 CITATIONS

Neutrosophic Graphs View project

On Algebraic Structures and Algebraic Hyperstructures View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

5 Extreme Zero Forcing 47

6 New Ideas On Super forceps By Hyper ford Of Zero Forcing In

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61

10 Extreme SuperHyperZero Forcing But As The Extensions Excerpt From

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 137

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 145

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 247

25 Neutrosophic Zero Forcing 251

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 SuperHyperZero Forcing But As The Extensions Excerpt

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 343

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 351

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 453

45 “SuperHyperGraph-Based Books”: | Featured Tweets 465

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 a Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperZero

14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme Super-

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

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 466

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.19“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 481