Dimension Dominating in SuperHyperGraphs

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

DOI: 10.5281/zenodo.8062076
CITATIONS
1 author:
Henry Garrett
498 PUBLICATIONS 20,722 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Metric Dimension in fuzzy(neutrosophic) Graphs View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 21 June 2023.
The user has requested enhancement of the downloaded file.

Dimension Dominating 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 43
4 Cancer In Extreme SuperHyperGraph 45
5 Extreme Dimension Dominating 49
6 New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating

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

Scientific Research 59
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 63
10 Extreme SuperHyperDimension Dominating But As The Extensions Excerpt

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 219
Bibliography 225
24 Cancer In Neutrosophic SuperHyperGraph 251
25 Neutrosophic Dimension Dominating 255
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Dimension Dominating As Hyper Dimple On Super Dimity 257
27 ABSTRACT 259
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 269

30 Neutrosophic SuperHyperDimension Dominating But As The Extensions

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

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

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

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

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

Motivations 353
37 Conclusion and Closing Remarks 355
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 413
43 Background 427
Bibliography 433
44 Books’ Contributions 459
45 “SuperHyperGraph-Based Books”: | Featured Tweets 471
46 CV 499

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

SuperHyperDimension Dominating in the Extreme Example (42.0.3) . . . . . . . . . . . 81
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

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

perDimension Dominating in the Example (42.0.5) . . . . . . . . . . . . . . . . . . . . . 118
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperDimension Dominating in the Example (42.0.11) . . . . . . . . . . . 123
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperDimension Dominating in the Example (42.0.13) . . . . . . . . . . . . . . . . 125
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperDimension Dominating in the Extreme Example (42.0.15) . . . . . . 126
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

perDimension Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperDimension Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.3) 287


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

SuperHyperDimension Dominating in the Example (42.0.5) . . . . . . . . . . . . . . . . . 324
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.7) . 326
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.9) . 327
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperDimension Dominating in the Example (42.0.11) . . 329
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperDimension Dominating in the Example (42.0.13) . . . . . . . . . . . . . . . . 331
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 333

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG280] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimen-
sion Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8062016). . . . . . . . . . . . . . . . . . . . . . 460
44.4 [HG281] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Dimension Dominating As Hyper Dimple On Super Dimity”,
44.7 [HG180b] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.8062076). . . . . . . . . . . . . . . . . . 467
44.8 [[HG180b] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr.
44.9 [HG180b] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr.
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 472

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



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

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 142

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 350

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

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

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

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 41
Dimension Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to 42
make a Dimension Dominating In SuperHyperGraphs more understandable. For the sake of 43
having Neutrosophic Dimension Dominating In SuperHyperGraphs, there’s a need to “redefine” 44
the notion of a “Dimension Dominating In SuperHyperGraphs ”. The SuperHyperVertices 45
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 46
this procedure, there’s the usage of the position of labels to assign to the values. Assume 47
a Dimension Dominating In SuperHyperGraphs . It’s redefined a Neutrosophic Dimension 48
Dominating In SuperHyperGraphs if the mentioned Table holds, concerning, “The Values of 49
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutro- 50
sophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 51
of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 52

Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 53
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 54
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 55
introduce the next SuperHyperClass of SuperHyperGraph based on a Dimension Dominating 56
In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the foundation of previous 57
definition in the kind of SuperHyperClass. If there’s a need to have all Dimension Dominating 58
In SuperHyperGraphs until the Dimension Dominating In SuperHyperGraphs, then it’s officially 59
called a “Dimension Dominating In SuperHyperGraphs” but otherwise, it isn’t a Dimension 60
Dominating In SuperHyperGraphs . There are some instances about the clarifications for the 61
main definition titled a “Dimension Dominating In SuperHyperGraphs ”. These two examples 62
get more scrutiny and discernment since there are characterized in the disciplinary ways of 63
the SuperHyperClass based on a Dimension Dominating In SuperHyperGraphs . For the sake 64

of having a Neutrosophic Dimension Dominating In SuperHyperGraphs, there’s a need to 65
“redefine” the notion of a “Neutrosophic Dimension Dominating In SuperHyperGraphs” and 66
a “Neutrosophic Dimension Dominating In SuperHyperGraphs ”. The SuperHyperVertices 67
this procedure, there’s the usage of the position of labels to assign to the values. Assume 69
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 70
intended Table holds. And a Dimension Dominating In SuperHyperGraphs are redefined to a 71
“Neutrosophic Dimension Dominating In SuperHyperGraphs” if the intended Table holds. It’s 72
useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get 73
Neutrosophic type-results to make a Neutrosophic Dimension Dominating In SuperHyperGraphs 74
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 75

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Dimension Dominating 76
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 77
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Dimension Dominating 78
In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipart- 79

ite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the 80

intended Table holds. A SuperHyperGraph has a “Neutrosophic Dimension Dominating In 81
SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all the 82
Dimension Dominating In SuperHyperGraphs amid the maximum value amid all SuperHy- 83
perVertices from a Dimension Dominating In SuperHyperGraphs .] Dimension Dominating 84
In SuperHyperGraphs . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and 85
the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHy- 86
perGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only 87
one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 88
Dimension Dominating In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 89
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 90
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 91
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 92
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 93
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 94
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 95
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 96
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 97
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 98

“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 99
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 100
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 101
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 102
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 103
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 104
Recognition” and the results and the definitions will be introduced in redeemed ways. The 105
recognition of the cancer in the long-term function. The specific region has been assigned 106
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 107
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 108
since there are some determinacy, indeterminacy and neutrality about the moves and the 109
effects of the cancer on that region; this event leads us to choose another model [it’s said 110
to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 111
and what’s done. There are some specific models, which are well-known and they’ve got the 112
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 113
cancer on the complex tracks and between complicated groups of cells could be fantasized 114
by a Neutrosophic SuperHyperPath(-/Dimension Dominating In SuperHyperGraphs, Supe- 115

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 116
is to find either the longest Dimension Dominating In SuperHyperGraphs or the strongest 117
Dimension Dominating In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 118
the longest Dimension Dominating In SuperHyperGraphs, called Dimension Dominating In 119
SuperHyperGraphs, and the strongest Dimension Dominating In SuperHyperGraphs, called 120
Neutrosophic Dimension Dominating In SuperHyperGraphs, some general results are introduced. 121
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 122
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 123
of a Dimension Dominating In SuperHyperGraphs. There isn’t any formation of any Dimension 124
Dominating In SuperHyperGraphs but literarily, it’s the deformation of any Dimension Domin- 125

ating In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A basic familiarity with 126
SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are proposed. 127
Keywords: SuperHyperGraph, (Neutrosophic) Dimension Dominating In SuperHyperGraphs, 128
Cancer’s Recognition 129

AMS Subject Classification: 05C17, 05C22, 05E45 130
131
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 132
Notion, namely, Neutrosophic Dimension Dominating In SuperHyperGraphs . Two different 133
types of SuperHyperDefinitions are debut for them but the scientific research goes further 134
and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are 135
well-defined and well-reviewed. The literature review is implemented in the whole of this 136
research. For shining the elegancy and the significancy of this research, the comparison between 137
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNum- 138
bers are featured. The definitions are followed by the examples and the instances thus the 139
clarifications are driven with different tools. The applications are figured out to make sense 140
about the theoretical aspect of this ongoing research. The “Cancer’s Neutrosophic Recognition” 141
are the under scientific research to figure out the challenges make sense about ongoing and 142
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 143
different types of them. Some of them are individuals and some of them are well-modeled by 144
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 145
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 146
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Can- 147
cer’s Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open 148
up some avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic 149
Recognition”. Some avenues are posed to pursue this research. It’s also officially collected 150
in the form of some questions and some problems. Assume a SuperHyperGraph. Then an 151
“δ−Dimension Dominating In SuperHyperGraphs” is a maximal Dimension Dominating In 152

SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that either of the 153
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 154
s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 155
Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if S is 156
an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Dimension Dominating In SuperHyperGraphs” 157
is a maximal Neutrosophic Dimension Dominating In SuperHyperGraphs of SuperHyperVertices 158

with maximum Neutrosophic cardinality such that either of the following expressions hold for 159
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 160
|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 161
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 162
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 163
version of Dimension Dominating In SuperHyperGraphs . Since there’s more ways to get 164
type-results to make Dimension Dominating In SuperHyperGraphs more understandable. 165
For the sake of having Neutrosophic Dimension Dominating In SuperHyperGraphs, there’s 166
a need to “redefine” the notion of “Dimension Dominating In SuperHyperGraphs ”. The 167
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 168
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 169
values. Assume a Dimension Dominating In SuperHyperGraphs . It’s redefined Neutrosophic 170

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

SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 190
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 191
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. 192
And Dimension Dominating In SuperHyperGraphs are redefined “Neutrosophic Dimension Dom- 193
inating In SuperHyperGraphs” if the intended Table holds. It’s useful to define “Neutrosophic” 194
version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make 195
Neutrosophic Dimension Dominating In SuperHyperGraphs more understandable. Assume 196
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 197
intended Table holds. Thus SuperHyperPath, Dimension Dominating In SuperHyperGraphs, 198
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 199
“Neutrosophic SuperHyperPath”, “Neutrosophic Dimension Dominating In SuperHyperGraphs”, 200
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Supe- 201

rHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 202
SuperHyperGraph has “Neutrosophic Dimension Dominating In SuperHyperGraphs” where 203
it’s the strongest [the maximum Neutrosophic value from all Dimension Dominating In Su- 204
perHyperGraphs amid the maximum value amid all SuperHyperVertices from a Dimension 205
Dominating In SuperHyperGraphs .] Dimension Dominating In SuperHyperGraphs . A graph is 206

SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges 207
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 208
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 209
SuperHyperEdges with two exceptions; it’s Dimension Dominating In SuperHyperGraphs if it’s 210
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 211
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 212
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 213
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 214
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 215
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 216

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

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

[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 262
cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 263
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 264
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 265
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 266
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 267

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




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

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

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

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

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

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

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

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

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

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

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

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

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


HG178b; HG179b; HG180b]. Two popular scientific research books in Scribd in the terms 454
of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 455
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 456
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 457

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

theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 471
HG279; HG280; HG281] alongside scientific research books at [HG60b; HG61b; HG62b; 492



HG174b; HG175b; HG176b; HG177b; HG178b; HG179b; HG180b]. Two popular 506
scientific research books in Scribd in the terms of high readers, 4728 and 5721 respectively, on 507
neutrosophic science is on [HG32b; HG44b]. 508

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

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

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

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

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

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

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

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

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

(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 590
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 591
HG21 [23] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 592
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 593
(doi: 10.20944/preprints202212.0500.v1). 594
HG22 [24] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 595
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 596
HG23 [25] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 598
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 599
HG281 [26] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 601
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 602
10.5281/zenodo.8061927). 603
HG280 [27] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 604
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 605

10.5281/zenodo.8062016). 606
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 608
10.5281/zenodo.8057696). 609
HG278 [29] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 610
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 611
2023, (doi: 10.5281/zenodo.8057753). 612
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 614
10.5281/zenodo.8052893). 615

HG276 [31] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 616
2023, (doi: 10.5281/zenodo.8052925). 618
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 620
10.5281/zenodo.8051346). 621
HG274 [33] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 622
10.5281/zenodo.8051360). 624
HG273 [34] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 625
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 626
10.5281/zenodo.8025707). 627
HG272 [35] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 628
10.5281/zenodo.8027275). 630
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 632
odo.8017246). 633
HG270 [37] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 634
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 635
10.5281/zenodo.8020128). 636
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 638
odo.7978571). 639
HG268 [39] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 640
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 641
10.5281/zenodo.7978857). 642
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 644
10.5281/zenodo.7940830). 645
HG266 [41] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 646
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 647
10.5281/zenodo.7943578). 648
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 650
odo.7916595). 651
HG264 [43] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 652
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 653
odo.7923632). 654

By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 656
(doi: 10.5281/zenodo.7904698). 657
HG262 [45] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 658
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 659
2023, (doi: 10.5281/zenodo.7904671). 660
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 662
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 663
HG260 [47] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 664
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 665
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 666
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 668
10.5281/zenodo.7871026). 669
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 671
2023, (doi: 10.5281/zenodo.7874647). 672
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 674
10.5281/zenodo.7857856). 675
HG256 [51] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 676
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 677
2023, (doi: 10.5281/zenodo.7857841). 678
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 680
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 683
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 686
10.5281/zenodo.7853867). 687
HG252 [55] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 688
10.5281/zenodo.7853922). 690
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 692
(doi: 10.5281/zenodo.7851519). 693

HG250 [57] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 694
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 695
(doi: 10.5281/zenodo.7851550). 696
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 698
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 701
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 704
10.5281/zenodo.7834229). 705
HG246 [61] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 706
10.5281/zenodo.7834261). 708
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 710
10.5281/zenodo.7824560). 711
HG244 [63] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 712
(doi: 10.5281/zenodo.7824623). 714
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 716
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 719
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 722
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 724
2023, (doi: 10.5281/zenodo.7809365). 725
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 727
2023, (doi: 10.5281/zenodo.7809358). 728
HG238 [69] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 729
10.5281/zenodo.7809219). 731

Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 733
10.5281/zenodo.7809328). 734
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 736
2023, (doi: 10.5281/zenodo.7806767). 737
HG235 [72] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 738
2023, (doi: 10.5281/zenodo.7806838). 740
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 742
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 743
HG233 [74] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 744
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 745
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 746
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 748
10.5281/zenodo.7799902). 749
HG231 [76] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 750
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 751
(doi: 10.5281/zenodo.7804218). 752
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 754
(doi: 10.5281/zenodo.7796334). 755
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 757
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 760
10.5281/zenodo.7791952). 761
HG225 [80] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 762
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 763
10.5281/zenodo.7791982). 764
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 766
10.5281/zenodo.7790026). 767
HG223 [82] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 768
10.5281/zenodo.7790052). 770

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 772
2023, (doi: 10.5281/zenodo.7787066). 773
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 775
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 776
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 778
10.5281/zenodo.7781476). 779
HG219 [86] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 780
10.5281/zenodo.7783082). 782
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 784
10.5281/zenodo.7777857). 785
HG217 [88] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 786
10.5281/zenodo.7779286). 788
HG215 [89] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 789
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 790
(doi: 10.5281/zenodo.7771831). 791
HG214 [90] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 792
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 793
2023, (doi: 10.5281/zenodo.7772468). 794
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 796
10.13140/RG.2.2.20913.25446). 797
HG212 [92] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 798
odo.7764916). 800
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 802
10.13140/RG.2.2.11770.98247). 803
HG210 [94] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 804
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 805
10.13140/RG.2.2.12400.12808). 806
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 808
2023, (doi: 10.13140/RG.2.2.22545.10089). 809

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 811
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 812
HG207 [97] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 813
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 814
10.13140/RG.2.2.11377.76644). 815
HG206 [98] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 816
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 817
10.13140/RG.2.2.23750.96329). 818
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 820
10.13140/RG.2.2.31366.24641). 821
HG204 [100] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 822
10.13140/RG.2.2.34721.68960). 824
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 826
2023, (doi: 10.13140/RG.2.2.30212.81289). 827
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 829
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 832
10.13140/RG.2.2.24288.35842). 833
HG200 [104] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 834
10.13140/RG.2.2.32467.25124). 836
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 838
10.13140/RG.2.2.31025.45925). 839
HG198 [106] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 840
10.13140/RG.2.2.17184.25602). 842
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 844
10.13140/RG.2.2.23423.28327). 845
HG196 [108] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 846
10.13140/RG.2.2.28456.44805). 848

Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 850
10.13140/RG.2.2.23525.68320). 851
HG194 [110] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 852
10.13140/RG.2.2.20170.24000). 854
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 856
10.13140/RG.2.2.36475.59683). 857
HG192 [112] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 858
10.13140/RG.2.2.29764.71046). 860
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 862
2023, (doi: 10.13140/RG.2.2.18780.87683). 863
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 865
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 868
10.13140/RG.2.2.26134.01603). 869
HG188 [116] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 870
10.13140/RG.2.2.27392.30721). 872
HG187 [117] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 873
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 874
10.13140/RG.2.2.33028.40321). 875
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 877
10.13140/RG.2.2.21389.20966). 878
HG185 [119] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 879
10.13140/RG.2.2.16356.04489). 881
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 883
10.13140/RG.2.2.21756.21129). 884
HG183 [121] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 885
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 886
10.13140/RG.2.2.30983.68009). 887

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 889
10.13140/RG.2.2.28552.29445). 890
HG181 [123] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 891
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 892
(doi: 10.13140/RG.2.2.10936.21761). 893
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 895
10.13140/RG.2.2.35105.89447). 896
HG179 [125] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 897
(doi: 10.13140/RG.2.2.30072.72960). 899
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 901
10.13140/RG.2.2.31147.52003). 902
HG177 [127] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 903
10.13140/RG.2.2.32825.24163). 905
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 907
10.13140/RG.2.2.13059.58401). 908
HG175 [129] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 909
10.13140/RG.2.2.11172.14720). 911
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 913
2023, (doi: 10.13140/RG.2.2.22011.80165). 914
HG173 [131] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 915
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 916
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 917
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 919
2023, (doi: 10.13140/RG.2.2.10493.84962). 920
HG171 [133] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 921
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 923
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 925
2023, (doi: 10.13140/RG.2.2.19944.14086). 926

HG169 [135] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 927
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 929
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 931
(doi: 10.13140/RG.2.2.33103.76968). 932
HG167 [137] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 933
(doi: 10.13140/RG.2.2.23037.44003). 935
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 937
(doi: 10.13140/RG.2.2.35646.56641). 938
HG165 [139] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 939
10.13140/RG.2.2.18030.48967). 941
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 943
(doi: 10.13140/RG.2.2.13973.81121). 944
HG163 [141] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 945
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 946
2023, (doi: 10.13140/RG.2.2.34106.47047). 947
HG162 [142] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 948
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 949
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 952
2023, (doi: 10.13140/RG.2.2.31956.88961). 953
HG160 [144] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 954
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 955
2023, (doi: 10.13140/RG.2.2.15179.67361). 956
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 958
10.13140/RG.2.2.21510.45125). 959
HG158 [146] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 960
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 961
2023, (doi: 10.13140/RG.2.2.13121.84321). 962
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 964
10.13140/RG.2.2.11758.69441). 965

HG156 [148] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 966
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 967
2023, (doi: 10.13140/RG.2.2.31891.35367). 968
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 970
10.13140/RG.2.2.19360.87048). 971
HG154 [150] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 972
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 973
10.13140/RG.2.2.32363.21286). 974
HG153 [151] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 975
10.13140/RG.2.2.23266.81602). 977
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 979
10.13140/RG.2.2.19911.37285). 980
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 982
10.13140/RG.2.2.11050.90569). 983
HG150 [154] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 984
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 985
2023, (doi: 10.13140/RG.2.2.17761.79206). 986
HG149 [155] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 987
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 988
HG148 [156] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 990
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 991
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 992
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 994
(doi: 10.13140/RG.2.2.30182.50241). 995
HG146 [158] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 996
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 997
HG145 [159] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 999
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1000
HG144 [160] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1002
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1003
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1004

HG143 [161] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1005
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1006
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1007
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1010
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1013
HG140 [164] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1014
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1015
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1016
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1019
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1022
HG137 [167] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1023
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1024

HG136 [168] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1026
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1027
2023, (doi: 10.13140/RG.2.2.17252.24968). 1028
HG135 [169] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1029
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1030
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1031
HG134 [170] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1032
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1033
HG132 [171] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1035
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1036

2023010396 (doi: 10.20944/preprints202301.0396.v1). 1037
HG131 [172] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1038
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1039
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1040
HG130 [173] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1041
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1042
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1043
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1044

HG129 [174] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1045

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 1046
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 1047
HG128 [175] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1049
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1050
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1051
HG127 [176] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1052
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1053
2023,(doi: 10.13140/RG.2.2.36745.93289). 1054
HG126 [177] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1055

HG125 [178] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1058

10.20944/preprints202301.0282.v1). 1061
HG124 [179] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1062

10.20944/preprints202301.0267.v1).). 1064

(doi: 10.20944/preprints202301.0265.v1). 1069
HG122 [181] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1070
prints202301.0262.v1). 1073


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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1081
10.13140/RG.2.2.35061.65767). 1082

HG25 [185] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1083
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1084
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1085
10.13140/RG.2.2.18494.15680). 1086
HG26 [186] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1087
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1088
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1089
10.13140/RG.2.2.32530.73922). 1090
HG27 [187] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1091
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1092
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1093
10.13140/RG.2.2.15897.70243). 1094

10.13140/RG.2.2.32530.73922). 1098
prints202301.0105.v1). 1101
HG28 [190] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1102
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1103
HG29 [191] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1105
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1106
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1107
10.13140/RG.2.2.23172.19849). 1108

HG30 [194] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1115
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1116
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1117
10.13140/RG.2.2.17385.36968). 1118
Preprints 2023, 2023010044 1121

10.20944/preprints202301.0043.v1). 1124
HG31 [197] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1125
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1126

2023, (doi: 10.13140/RG.2.2.28945.92007). 1127
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1132
10.13140/RG.2.2.35774.77123). 1133
HG35 [201] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1137
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1138

10.13140/RG.2.2.29430.88642). 1139
(doi: 10.20944/preprints202212.0549.v1). 1145
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1147
10.13140/RG.2.2.19380.94084). 1148


SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1156
(doi: 10.20944/preprints202212.0500.v1). 1159

Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1161
10.13140/RG.2.2.20993.12640). 1162
HG952 [209] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1163

HG95 [210] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1166
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1167
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1168
HG37 [213] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1175
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1176
10.13140/RG.2.2.29173.86244). 1177
HG38 [214] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1178
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1179
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1180
HG180b [215] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1181
(doi: 10.5281/zenodo.8062076). 1182
HG179b [216] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1183
Garrett, 2023 (doi: 10.5281/zenodo.8057817). 1184
HG178b [217] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1185
2023 (doi: 10.5281/zenodo.8052976). 1186
HG177b [218] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1187
(doi: 10.5281/zenodo.8051368). 1188
HG176b [219] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1189
(doi: 10.5281/zenodo.8027488). 1190
HG175b [220] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1191
10.5281/zenodo.8020181). 1192
HG174b [221] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1193
10.5281/zenodo.7978921). 1194
HG173b [222] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1195
odo.7943878). 1196

HG172b [223] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1197
10.5281/zenodo.7943871). 1198
HG171b [224] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1199
10.5281/zenodo.7923786). 1200
HG170b [225] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1201
2023 (doi: 10.5281/zenodo.7905287). 1202
HG169b [226] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1203

HG168b [227] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1205
2023 (doi: 10.5281/zenodo.7874677). 1206
HG167b [228] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1207
(doi: 10.5281/zenodo.7857906). 1208
HG166b [229] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1209
2023 (doi: 10.5281/zenodo.7856329). 1210
HG165b [230] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1211
10.5281/zenodo.7854561). 1212
HG164b [231] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1213
2023 (doi: 10.5281/zenodo.7851893). 1214
HG163b [232] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1215

HG162b [233] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1217
(doi: 10.5281/zenodo.7835063). 1218
HG161b [234] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1219
(doi: 10.5281/zenodo.7826705). 1220
HG160b [235] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1221
2023 (doi: 10.5281/zenodo.7820680). 1222
HG159b [236] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1223
10.5281/zenodo.7812750). 1224
HG158b [237] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1225
HG157b [238] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1227

HG156b [239] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1229
2023 (doi: 10.5281/zenodo.7807782). 1230
HG155b [240] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1231
2023 (doi: 10.5281/zenodo.7804449). 1232

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

HG153b [242] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1235
(doi: 10.5281/zenodo.7792307). 1236
HG152b [243] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1237
(doi: 10.5281/zenodo.7790728). 1238
HG151b [244] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1239
2023 (doi: 10.5281/zenodo.7787712). 1240
HG150b [245] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7783791). 1242
HG149b [246] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7780123). 1244
HG148b [247] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1245
(doi: 10.5281/zenodo.7773119). 1246
HG147b [248] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1247
odo.7637762). 1248
HG146b [249] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1249
10.5281/zenodo.7766174). 1250
HG145b [250] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1251
10.5281/zenodo.7762232). 1252
HG144b [251] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1253
(doi: 10.5281/zenodo.7758601). 1254
HG143b [252] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7754661). 1256
HG142b [253] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1257
10.5281/zenodo.7750995) . 1258
HG141b [254] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1259
(doi: 10.5281/zenodo.7749875). 1260
HG140b [255] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1261
10.5281/zenodo.7747236). 1262
HG139b [256] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1263
10.5281/zenodo.7742587). 1264
HG138b [257] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1265
(doi: 10.5281/zenodo.7738635). 1266
HG137b [258] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1267
10.5281/zenodo.7734719). 1268

HG136b [259] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1269
10.5281/zenodo.7730484). 1270
HG135b [260] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1271
(doi: 10.5281/zenodo.7730469). 1272
HG134b [261] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1273
10.5281/zenodo.7722865). 1274
HG133b [262] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.7713563). 1276
odo.7709116). 1278
HG131b [264] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1279
10.5281/zenodo.7706415). 1280
HG130b [265] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1281
10.5281/zenodo.7706063). 1282
HG129b [266] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1283
10.5281/zenodo.7701906). 1284
HG128b [267] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1285
odo.7700205). 1286
HG127b [268] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1287
10.5281/zenodo.7694876). 1288
HG126b [269] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1289
10.5281/zenodo.7679410). 1290
HG125b [270] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1291
10.5281/zenodo.7675982). 1292
HG124b [271] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1293
10.5281/zenodo.7672388). 1294
HG123b [272] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1295
odo.7668648). 1296
HG122b [273] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1297
10.5281/zenodo.7662810). 1298
HG121b [274] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1299
10.5281/zenodo.7659162). 1300
HG120b [275] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1301
odo.7653233). 1302
HG119b [276] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1303
odo.7653204). 1304

HG118b [277] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1305
odo.7653142). 1306
HG117b [278] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1307
odo.7653117). 1308
HG116b [279] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1309
HG115b [280] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1310
odo.7651687). 1311
HG114b [281] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1312
odo.7651619). 1313
HG113b [282] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1314
odo.7651439). 1315
HG112b [283] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1316
odo.7650729). 1317
HG111b [284] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1318
odo.7647868). 1319
HG110b [285] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1320
odo.7647017). 1321
HG109b [286] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1322
odo.7644894). 1323
HG108b [287] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1324
HG107b [288] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1325
odo.7632923). 1326
HG106b [289] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1327
odo.7623459). 1328
HG105b [290] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1329
10.5281/zenodo.7606416). 1330
HG104b [291] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1331
10.5281/zenodo.7606416). 1332
HG103b [292] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1333
odo.7606404). 1334
HG102b [293] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1335
10.5281/zenodo.7580018). 1336
HG101b [294] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1337
odo.7580018). 1338

odo.7580018). 1340
odo.7579929). 1342
HG98b [297] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1343
10.5281/zenodo.7563170). 1344
HG97b [298] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1345
odo.7563164). 1346
HG96b [299] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1347
odo.7563160). 1348
odo.7563160). 1350
HG94b [301] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1351
10.5281/zenodo.7563160). 1352
HG93b [302] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1353
10.5281/zenodo.7557063). 1354
HG92b [303] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1355
10.5281/zenodo.7557009). 1356
HG91b [304] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1357
10.5281/zenodo.7539484). 1358
HG90b [305] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1359
10.5281/zenodo.7523390). 1360
HG89b [306] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1361
10.5281/zenodo.7523390). 1362
HG88b [307] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1363
10.5281/zenodo.7523390). 1364
HG87b [308] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1365
odo.7574952). 1366
HG86b [309] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1367
10.5281/zenodo.7574992). 1368
odo.7523357). 1370
HG84b [311] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1371
10.5281/zenodo.7523357). 1372
HG83b [312] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1373
10.5281/zenodo.7504782). 1374

HG82b [313] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1375
10.5281/zenodo.7504782). 1376
HG81b [314] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1377
10.5281/zenodo.7504782). 1378
HG80b [315] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1379
10.5281/zenodo.7499395). 1380
HG79b [316] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1381
odo.7499395). 1382
HG78b [317] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1383
10.5281/zenodo.7499395). 1384
HG77b [318] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1385
10.5281/zenodo.7497450). 1386
HG76b [319] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1387
10.5281/zenodo.7497450). 1388
HG75b [320] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1389
10.5281/zenodo.7494862). 1390
HG74b [321] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1391
odo.7494862). 1392
HG73b [322] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1393
10.5281/zenodo.7494862). 1394
HG72b [323] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1395
10.5281/zenodo.7493845). 1396
HG71b [324] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1397
odo.7493845). 1398
HG70b [325] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1399
10.5281/zenodo.7493845). 1400
HG69b [326] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1401
odo.7539484). 1402
HG68b [327] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1403
odo.7523390). 1404
HG67b [328] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1405
odo.7523357). 1406
HG66b [329] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1407
odo.7504782). 1408
HG65b [330] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1409
odo.7499395). 1410

HG64b [331] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1411
odo.7497450). 1412
HG63b [332] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1413
odo.7494862). 1414
HG62b [333] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1415
odo.7493845). 1416
HG61b [334] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1417
odo.7480110). 1418
HG60b [335] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1419
odo.7378758). 1420
HG32b [336] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1421
odo.6320305). 1422
HG44b [337] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1423
odo.6677173). 1424

CHAPTER 3 1425
Acknowledgements 1426
The author is going to express his gratitude and his appreciation about the brains and their 1427
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1428
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1429 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
1430
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 1431
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1432
ideas to be on the star lines of words and shining like stars, forever. 1433
43
CHAPTER 4 1434
Cancer In Extreme SuperHyperGraph 1435
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1436
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1437
as the consequences of the model, some parameters are used. The cells are under attack of this 1438
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1439
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1440
In the following, some Extreme steps are Extreme devised on this disease. 1441
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1442
function. 1443
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1444
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1445
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1449
what’s done. 1450
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1451
they’ve got the names, and some general Extreme models. The moves and the Extreme 1452
traces of the cancer on the complex tracks and between complicated groups of cells could be 1453
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1454
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1455
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1456
in those Extreme Extreme SuperHyperModels. 1457
Some cells have been faced with some attacks from the situation which is caused by the 1458
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1459
which in that, the cells could be labelled as some groups and some groups or individuals have 1460
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1461
the embedded situations, the individuals of cells and the groups of cells could be considered 1462
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1463
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1464
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1465
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1466
45
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1467
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1468
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1469
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1470
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1471
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1472
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1473

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1474
is going to figure out what’s going on this phenomenon. The special case of this disease is 1475
considered and as the consequences of the model, some parameters are used. The cells are 1476
under attack of this disease but the moves of the cancer in the special region are the matter of 1477
mind. The recognition of the cancer could help to find some treatments for this disease. The 1478
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1479
Recognition” and both bases are the background of this research. Sometimes the cancer has 1480
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1481
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1482
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1483
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1484
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1485
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1486
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1487
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1488
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1489
and neutrality about the moves and the effects of the cancer on that region; this event leads 1490
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1491
perception on what’s happened and what’s done. There are some specific models, which 1492
are well-known and they’ve got the names, and some general models. The moves and the 1493
traces of the cancer on the complex tracks and between complicated groups of cells could 1494
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1495
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1496
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1497

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1498
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1499
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1500
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1501
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1502
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1503
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1504
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1505
based on the fixed groups of cells or the fixed groups of group of cells? 1506
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1507
messy and dense SuperHyperModels where embedded notions are illustrated? 1508
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1509
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1510
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1511

research has taken more motivations to define SuperHyperClasses and to find some connections 1512
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1513
instances and examples to make clarifications about the framework of this research. The general 1514
results and some results about some connections are some avenues to make key point of this 1515
research, “Cancer’s Recognition”, more understandable and more clear. 1516
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1517
on the modeling of the regions where are under the attacks of the cancer to recognize 1518
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1519
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1520
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1521
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1522
instances and literature reviews have taken the whole way through. In this scientific research, 1523
the literature reviews have fulfilled the lines containing the notions and the results. The 1524
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1525
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1526
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1527
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1528
of the moves of the cancer in the longest and strongest styles with the formation of the design 1529
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1530
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1531
out the background for the SuperHyperNotions. 1532

CHAPTER 5 1533
Extreme Dimension Dominating 1534
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1535
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1536
2023, (doi: 10.13140/RG.2.2.34953.52320). 1537

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1538
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1539
(doi: 10.13140/RG.2.2.33275.80161). 1540
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1541
10.13140/RG.2.2.11050.90569). 1543
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1544
10.13140/RG.2.2.17761.79206). 1546
10.13140/RG.2.2.19911.37285). 1549
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1550
10.13140/RG.2.2.23266.81602). 1552
10.13140/RG.2.2.19360.87048). 1555
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1556
10.13140/RG.2.2.32363.21286). 1558
10.13140/RG.2.2.11758.69441). 1561
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1562
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1563
10.13140/RG.2.2.31891.35367). 1564
10.13140/RG.2.2.21510.45125). 1567
49
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1568
10.13140/RG.2.2.13121.84321). 1570

CHAPTER 6 1571
New Ideas On Super Dimity By Hyper 1572
Dimple Of Dimension Dominating In 1573
Recognition of Cancer With 1574
(Neutrosophic) SuperHyperGraph 1575
51
CHAPTER 7 1576
ABSTRACT 1577
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDimension 1578

Dominating ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Dimension Dominating 1579
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 1580
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperDimension Dominating if 1581
the following expression is called Neutrosophic e-SuperHyperDimension Dominating criteria holds 1582
∀Ea ∈ EN SHG , ∃Eb ∈ E 0 : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb

And ∀Ea , Eb ∈ EN SHG , ∃Ec ∈ E 0 : d(Ea , Ec ) 6= d(Eb , Ec );
Neutrosophic re-SuperHyperDimension Dominating if the following expression is called Neutrosophic 1583
e-SuperHyperDimension Dominating criteria holds 1584

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic 1585

v-SuperHyperDimension Dominating if the following expression is called Neutrosophic v- 1586
SuperHyperDimension Dominating criteria holds 1587
∀Va , ∃Vb ∈ V 0 : ∃Ed ∈ EN SHG , Va , Vc ∈ Ed

And ∀Va , Vb ∈ VN SHG , ∃Vc ∈ V 0 : d(Va , Vc ) 6= d(Vb , Vc );
Neutrosophic rv-SuperHyperDimension Dominating if the following expression is called Neutrosophic 1588

v-SuperHyperDimension Dominating criteria holds 1589

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Supe- 1590
rHyperDimension Dominating if it’s either of Neutrosophic e-SuperHyperDimension Dominating, Neut- 1591
rosophic re-SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension Dominating, and 1592
Neutrosophic rv-SuperHyperDimension Dominating. ((Neutrosophic) SuperHyperDimension Dominat- 1593
ing). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1594
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1595
53
SuperHyperDimension Dominating if it’s either of Neutrosophic e-SuperHyperDimension Dominating, Neut- 1596

Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 1598
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1599
Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 1600
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 1601
treme SuperHyperDimension Dominating; a Neutrosophic SuperHyperDimension Dominating if it’s either 1602

of Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dominating, 1603
Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension Domin- 1604
ating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1605
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 1606
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1607
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDimension 1608
Dominating; an Extreme SuperHyperDimension Dominating SuperHyperPolynomial if it’s either of 1609
Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dominating, 1610
ating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Supe- 1612
rHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1613
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHy- 1614

perSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 1615
SuperHyperVertices such that they form the Extreme SuperHyperDimension Dominating; and the 1616
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperDimension 1617
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDimension Dominating, 1618
Neutrosophic re-SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension Dominating, 1619
and Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 1620
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1621
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1622
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1623
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1624
such that they form the Neutrosophic SuperHyperDimension Dominating; and the Neutrosophic power 1625
is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperDimension Dominating if it’s 1626

either of Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dom- 1627
inating, Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension 1628
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1629
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1630
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and 1631

Extreme SuperHyperVertices such that they form the Extreme SuperHyperDimension Dominating; a 1632
Neutrosophic V-SuperHyperDimension Dominating if it’s either of Neutrosophic e-SuperHyperDimension 1633
Dominating, Neutrosophic re-SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension 1634
Dominating, and Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic 1635
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutro- 1636
sophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1637

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 1638
they form the Neutrosophic SuperHyperDimension Dominating; an Extreme V-SuperHyperDimension 1639

and Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for an Extreme SuperHyper- 1642
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1643
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Su- 1644
perHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 1645
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 1646
treme SuperHyperDimension Dominating; and the Extreme power is corresponded to its Extreme 1647
coefficient; a Neutrosophic SuperHyperDimension Dominating SuperHyperPolynomial if it’s either 1648

Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension Dominat- 1650
ing and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1651
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1652
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 1653
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1654

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1655
SuperHyperDimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 1656
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 1657
namely, a SuperHyperDimension Dominating and Neutrosophic SuperHyperDimension Dominating. Two 1658
different types of SuperHyperDefinitions are debut for them but the research goes further 1659
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers 1663
are featured. The definitions are followed by the examples and the instances thus the cla- 1664
rifications are driven with different tools. The applications are figured out to make sense 1665
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 1666
under research to figure out the challenges make sense about ongoing and upcoming research. 1667
The special case is up. The cells are viewed in the deemed ways. There are different types 1668
of them. Some of them are individuals and some of them are well-modeled by the group of 1669
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 1670
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 1671
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1672
these complex and dense SuperHyperModels open up some avenues to research on theoret- 1673
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 1674
It’s also officially collected in the form of some questions and some problems. Assume a 1675
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDimension Dominating is 1676
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1677
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1680
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDimension Dominating is a max- 1681
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1682
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1683
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1684
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 1685
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 1686
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperDimension 1687

Dominating . Since there’s more ways to get type-results to make a SuperHyperDimension Dominating 1688
more understandable. For the sake of having Neutrosophic SuperHyperDimension Dominating, there’s 1689
a need to “redefine” the notion of a “SuperHyperDimension Dominating ”. The SuperHyperVertices 1690
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 1692
SuperHyperDimension Dominating . It’s redefined a Neutrosophic SuperHyperDimension Dominating if the 1693
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 1694
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 1695
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 1696
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 1697
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 1698
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1699
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 1700
based on a SuperHyperDimension Dominating . It’s the main. It’ll be disciplinary to have the 1701
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 1702
SuperHyperDimension Dominating until the SuperHyperDimension Dominating, then it’s officially called a 1703
“SuperHyperDimension Dominating” but otherwise, it isn’t a SuperHyperDimension Dominating . There 1704
are some instances about the clarifications for the main definition titled a “SuperHyperDimension 1705
Dominating ”. These two examples get more scrutiny and discernment since there are characterized 1706
in the disciplinary ways of the SuperHyperClass based on a SuperHyperDimension Dominating . For 1707
the sake of having a Neutrosophic SuperHyperDimension Dominating, there’s a need to “redefine” 1708
the notion of a “Neutrosophic SuperHyperDimension Dominating” and a “Neutrosophic SuperHy- 1709
perDimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1710
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1711
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 1712
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperDimension 1713
Dominating are redefined to a “Neutrosophic SuperHyperDimension Dominating” if the intended Table 1714
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 1715
ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperDimension Dominating 1716
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperDimension 1718

Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyper- 1719
Wheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperDimension Dominating”, 1720
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Super- 1721
HyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 1722
SuperHyperGraph has a “Neutrosophic SuperHyperDimension Dominating” where it’s the strongest 1723
[the maximum Neutrosophic value from all the SuperHyperDimension Dominating amid the maximum 1724
value amid all SuperHyperVertices from a SuperHyperDimension Dominating .] SuperHyperDimension 1725
Dominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of 1726
elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 1727
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 1728
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperDimension 1729
Dominating if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s 1730
SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s Supe- 1731
rHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1732
and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s 1733

SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHy- 1734
perEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in 1735
common; it’s a SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1736
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. 1737
The SuperHyperModel proposes the specific designs and the specific architectures. The Super- 1738
HyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In 1739
this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled 1740
as “SuperHyperVertices” and the common and intended properties between “specific” cells and 1741
“specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful 1742
to have some degrees of determinacy, indeterminacy, and neutrality to have more precise Super- 1743
HyperModel which in this case the SuperHyperModel is called “Neutrosophic”. In the future 1744
research, the foundation will be based on the “Cancer’s Recognition” and the results and the 1745
definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term 1746
and neutrality about the moves and the effects of the cancer on that region; this event leads us 1750
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 1751
perception on what’s happened and what’s done. There are some specific models, which are 1752
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 1753
moves and the traces of the cancer on the complex tracks and between complicated groups of 1754
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperDimension Dominating, 1755
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 1756
is to find either the longest SuperHyperDimension Dominating or the strongest SuperHyperDimension 1757
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperDimension Dominat- 1758
ing, called SuperHyperDimension Dominating, and the strongest SuperHyperDimension Dominating, called 1759
Neutrosophic SuperHyperDimension Dominating, some general results are introduced. Beyond that 1760
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1761
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1762
SuperHyperDimension Dominating. There isn’t any formation of any SuperHyperDimension Dominating 1763
but literarily, it’s the deformation of any SuperHyperDimension Dominating. It, literarily, deforms 1764
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperDimension Dominating 1765
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1766
Keywords: Neutrosophic SuperHyperGraph, SuperHyperDimension Dominating, Cancer’s Neutro- 1767
sophic Recognition 1768


CHAPTER 8 1770
Applied Notions Under The Scrutiny Of 1771
The Motivation Of This Scientific 1772
Research 1773
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1774
try to bring the motivations in the narrative ways. Some cells have been faced with some 1775
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1776
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1777
as some groups and some groups or individuals have excessive labels which all are raised from 1778
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1779
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1780
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1781
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1782
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1783
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1784
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1785
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1786
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1787
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1788
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1789
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1790
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1791
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1792
The special case of this disease is considered and as the consequences of the model, some 1793
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1794
the special region are the matter of mind. The recognition of the cancer could help to find some 1795
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1796
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1797
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1798
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1799
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 1800
formation of the design and the architecture are formally called “ SuperHyperDimension Dominating” 1801
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1802
59
embedded styles to figure out the background for the SuperHyperNotions. The recognition of 1803
the cancer in the long-term function. The specific region has been assigned by the model [it’s 1804
called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this 1805
research. Sometimes the move of the cancer hasn’t be easily identified since there are some 1806
determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that 1807
region; this event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] 1808
to have convenient perception on what’s happened and what’s done. There are some specific 1809
models, which are well-known and they’ve got the names, and some general models. The 1810
moves and the traces of the cancer on the complex tracks and between complicated groups 1811
of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperDimension Dominating, 1812
is to find either the optimal SuperHyperDimension Dominating or the Extreme SuperHyperDimension 1814
Dominating in those Extreme SuperHyperModels. Some general results are introduced. Beyond 1815
that in SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges 1816
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 1817
style of a SuperHyperDimension Dominating. There isn’t any formation of any SuperHyperDimension 1818
Dominating but literarily, it’s the deformation of any SuperHyperDimension Dominating. It, literarily, 1819
deforms and it doesn’t form. 1820
amount of SuperHyperDimension Dominating” of either individual of cells or the groups of cells based 1822
on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDimension 1823
Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 1824
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1825
messy and dense SuperHyperModels where embedded notions are illustrated? 1826
Thus it motivates us to define different types of “ SuperHyperDimension Dominating” and “Extreme 1828
SuperHyperDimension Dominating” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then 1829

the research has taken more motivations to define SuperHyperClasses and to find some 1830
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us 1831
to get some instances and examples to make clarifications about the framework of this research. 1832
The general results and some results about some connections are some avenues to make key 1833
point of this research, “Cancer’s Recognition”, more understandable and more clear. 1834
The framework of this research is as follows. In the beginning, I introduce basic definitions 1835
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1836
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1837
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1838
review literature are applied to make sense about what’s going to figure out about the upcoming 1839
sections. The main definitions and their clarifications alongside some results about new 1840
notions, SuperHyperDimension Dominating and Extreme SuperHyperDimension Dominating, are figured 1841
out in sections “ SuperHyperDimension Dominating” and “Extreme SuperHyperDimension Dominating”. 1842
In the sense of tackling on getting results and in Dimension Dominating to make sense about 1843
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1844
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1845
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1846
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1847

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1848
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1849
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1850
and as concluding and closing section of theoretical research are contained in the section 1851
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1852
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1853
Results”, “ SuperHyperDimension Dominating”, “Extreme SuperHyperDimension Dominating”, “Results on 1854

SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1855
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1856
and going to figure out the word “best” as the description and adjective for this research as 1857
presented in section, “ SuperHyperDimension Dominating”. The keyword of this research debut in the 1858
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1859
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 1860
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 1861
there are some scrutiny and discernment on what’s done and what’s happened in this research 1862
in the terms of “questions” and “problems” to make sense to figure out this research in featured 1863
style. The advantages and the limitations of this research alongside about what’s done in this 1864
research to make sense and to get sense about what’s figured out are included in the section, 1865
“Conclusion and Closing Remarks”. 1866

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1873
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1874
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1875
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1876
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1877
ideas and their clarifications are addressed to Ref.[HG38]. 1878

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

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

Let X be a Dimension Dominating 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}.
63
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). 1882
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1883
where 1884
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1885
(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); 1886
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1887
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1888
1, 2, . . . , n0 ); 1889
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1890
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1891

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1898
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1899
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1900
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1901
E. Thus, the ii0 th element of the Dimension Dominating of Neutrosophic SuperHyperGraph 1902
(NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1903

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

(Ref.[HG11s],Definition 2.7,p.3). 1905
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1906
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1907
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1908
(i) If |Vi | = 1, then Vi is called vertex; 1909
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1910
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1911
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1912
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1913
SuperEdge; 1914
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1915
SuperHyperEdge. 1916
If we choose different types of binary operations, then we could get hugely diverse types of 1917
general forms of Neutrosophic SuperHyperGraph (NSHG). 1918
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1919

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1920
x, y, z, w ∈ [0, 1]: 1921
(i) 1 ⊗ x = x; 1922
(ii) x ⊗ y = y ⊗ x; 1923
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1924
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1925

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

where 1928

1, 2, . . . , n0 ); 1933
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1934
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1935
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1936
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1937
0


SuperEdge; 1957
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1960
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1961
makes the patterns and regularities. 1962
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1963
of elements of SuperHyperEdges are the same. 1964

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1965
makes to have SuperHyperUniform more understandable. 1966
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1967
Classes as follows. 1968
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1969
two given SuperHyperEdges with two exceptions; 1970
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1971
SuperHyperEdges; 1972
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1973
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1974
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1975
in common; 1976
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1977
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1978
SuperHyperEdge in common; 1979
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1980
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1981
SuperVertex. 1982
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 1983
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1984
(i) Vi , Vi+1 ∈ Ei0 ; 1985
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1986
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1987
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1988
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1989
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1990
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1991
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1992
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1994
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1995
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1996
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1997
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1998
perPath . 1999
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 2000
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2001
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2002
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2003
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2004
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2005

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 2010
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 2011
(x) Neutrosophic i-Connective if I(E) ≥ maximum number of Neutrosophic i-strength 2012


(xi) Neutrosophic f-Connective if F (E) ≥ maximum number of Neutrosophic f-strength 2015

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2018
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2019
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2020
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperDimension Dominat- 2021

ing). 2022
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutro- 2023
sophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 2024
is called 2025
(i) Neutrosophic e-SuperHyperDimension Dominating if the following expression is called 2026

Neutrosophic e-SuperHyperDimension Dominating criteria holds 2027

(ii) Neutrosophic re-SuperHyperDimension Dominating if the following expression is called 2028

Neutrosophic re-SuperHyperDimension Dominating criteria holds 2029

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2030
(iii) Neutrosophic v-SuperHyperDimension Dominating if the following expression is called 2031

Neutrosophic v-SuperHyperDimension Dominating criteria holds 2032

(iv) Neutrosophic rv-SuperHyperDimension Dominating if the following expression is called 2033

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2035
(v) Neutrosophic SuperHyperDimension Dominating if it’s either of Neutrosophic e- 2036
SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dominating, Neutrosophic 2037

v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension Dominating. 2038
Definition 9.0.19. ((Neutrosophic) SuperHyperDimension Dominating). 2039


(i) an Extreme SuperHyperDimension Dominating if it’s either of Neutrosophic e- 2042

v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension Dominating and 2044
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2045
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 2046
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 2047
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDimension 2048
Dominating; 2049
(ii) a Neutrosophic SuperHyperDimension Dominating if it’s either of Neutrosophic e- 2050

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 2053
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 2054
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neut- 2055
rosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDimension 2056
Dominating; 2057
(iii) an Extreme SuperHyperDimension Dominating SuperHyperPolynomial if it’s either of 2058

Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dominat- 2059
ing, Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension 2060

Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2061
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 2062
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 2063
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges 2064
Dominating; and the Extreme power is corresponded to its Extreme coefficient; 2066
(iv) a Neutrosophic SuperHyperDimension Dominating SuperHyperPolynomial 2067

if it’s either of Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re- 2068
SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension Dominating, and Neut- 2069

rosophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 2070
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 2071
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 2072
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 2076
(v) an Extreme V-SuperHyperDimension Dominating if it’s either of Neutrosophic e- 2077

SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 2082
Dominating; 2084

(vi) a Neutrosophic V-SuperHyperDimension Dominating if it’s either of Neutrosophic e- 2085

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neut- 2088
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHy- 2089
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 2090
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 2091
perDimension Dominating; 2092
(vii) an Extreme V-SuperHyperDimension Dominating SuperHyperPolynomial if it’s either 2093

of Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension 2094
Dominating, Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv- 2095
SuperHyperDimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 2096

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 2097
cients defined as the Extreme number of the maximum Extreme cardinality of the 2098
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2099
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2100
form the Extreme SuperHyperDimension Dominating; and the Extreme power is corresponded 2101
to its Extreme coefficient; 2102
(viii) a Neutrosophic SuperHyperDimension Dominating SuperHyperPolynomial 2103

SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension Dominating, and Neutro- 2105
sophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic SuperHyper- 2106
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutro- 2107
sophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 2108
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 2109
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neut- 2110
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 2112
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDimension Dominating). 2113

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2114
(i) an δ−SuperHyperDimension Dominating is a Neutrosophic kind of Neutrosophic SuperHy- 2115

perDimension Dominating such that either of the following expressions hold for the Neutrosophic 2116
cardinalities of SuperHyperNeighbors of s ∈ S : 2117
|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 2118

(29.1), holds if S is an δ−SuperHyperDefensive; 2119
(ii) a Neutrosophic δ−SuperHyperDimension Dominating is a Neutrosophic kind of Neut- 2120

rosophic SuperHyperDimension Dominating such that either of the following Neutrosophic 2121
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2122
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4

Table 9.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23)
The Values of The Vertices The Number of Position in Alphabet

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22)

136TBL4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2123

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2124
For the sake of having a Neutrosophic SuperHyperDimension Dominating, there’s a need to 2125
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2126
there’s the usage of the position of labels to assign to the values. 2128
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2129
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2130
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2131
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2132
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 2134
sophic SuperHyperPath , SuperHyperDimension Dominating, SuperHyperStar, SuperHyperBipart- 2135
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 2136
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 2137
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 2138
perHyperWheel if the Table (29.2) holds. 2139
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperDimension Dominating. 2140

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperDimension Dominating 2141
more Neutrosophicly understandable. 2142
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperDimension Dominating”. The 2144
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 2145


136TBL1
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 2146
2147
136DEF1 Definition 9.0.23. Assume a SuperHyperDimension Dominating. It’s redefined a Neutrosophic 2148
SuperHyperDimension Dominating if the Table (29.3) holds. 2149

CHAPTER 10 2150
Extreme SuperHyper But As The Dimension Dominating 2151
Extensions Excerpt From Dense And 2152
Super Forms 2153
Definition 10.0.1. (Extreme event). 2154

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2155
probability Dimension Dominating. Any Extreme k-subset of A of V is called Extreme k-event and 2156
if k = 2, then Extreme subset of A of V is called Extreme event. The following expression is 2157
called Extreme probability of A. 2158
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2159

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2160
probability Dimension Dominating. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2161
if the following expression is called Extreme s-independent criteria 2162
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 2163
following expression is called Extreme independent criteria 2164
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2165

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2166
is a probability Dimension Dominating. Any k-function Dimension Dominating like E is called Extreme 2167
k-Variable. If k = 2, then any 2-function Dimension Dominating like E is called Extreme Variable. 2168
The notion of independent on Extreme Variable is likewise. 2169
Definition 10.0.4. (Extreme Expectation). 2170
75
is a probability Dimension Dominating. an Extreme k-Variable E has a number is called Extreme 2172
Expectation if the following expression is called Extreme Expectation criteria 2173
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2174

is a probability Dimension Dominating. an Extreme number is called Extreme Crossing if the 2176
following expression is called Extreme Crossing criteria 2177
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2178
S = (V, E) is a probability Dimension Dominating. Let m and n propose special Dimension Dominating. 2179
Then with m ≥ 4n, 2180
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Dimension Dominating 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: 2181
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2182
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2183
Consider S = (V, E) is a probability Dimension Dominating. Let P be a SuperHyperSet of n points in 2184
the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through at 2185
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2186
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2187

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

the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2195
k < 5n4/3 . 2196
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2197
S = (V, E) is a probability Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle 2198
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2199
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2200
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2201

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2206
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2207
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2208
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2209
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2210
Consider S = (V, E) is a probability Dimension Dominating. Let X be a nonnegative Extreme Variable 2211
and t a positive real number. Then 2212
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. 2213
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2214
Consider S = (V, E) is a probability Dimension Dominating. Let Xn be a nonnegative integer-valued 2215
variable in a probability Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 2216

P (Xn = 0) → 1 as n → ∞. 2217
Proof. 2218
Consider S = (V, E) is a probability Dimension Dominating. A special SuperHyperGraph in Gn,p 2220
almost surely has stability number at most d2p−1 log ne. 2221

S = (V, E) is a probability Dimension Dominating. A special SuperHyperGraph in Gn,p is up. Let 2223
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 2224
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 2225
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 2226
of the Extreme SuperHyperGraph G. 2227
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2228
Extreme Variable for this Extreme Event. By equation, we have 2229
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 2230
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2231
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: 2232
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2233
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 2234
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2235
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2236
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2237
Definition 10.0.12. (Extreme Variance). 2238

is a probability Dimension Dominating. an Extreme k-Variable E has a number is called Extreme 2240
Variance if the following expression is called Extreme Variance criteria 2241
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Dimension Dominating. Let X be an Extreme Variable and let t 2243
be a positive real number. Then 2244
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Dimension Dominating. Let X be an Extreme Variable and let t be a 2246
positive real number. Then 2247
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2248
Consider S = (V, E) is a probability Dimension Dominating. Let Xn be an Extreme Variable in a 2250

probability Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2251
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 2253
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2254
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2255
Consider S = (V, E) is a probability Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2257
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2258
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2259
S = (V, E) is a probability Dimension Dominating. As in the proof of related Theorem, the result is 2261
straightforward. 2262
Consider S = (V, E) is a probability Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be as 2264
defined in previous Theorem. Then either: 2265
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2266
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2267
S = (V, E) is a probability Dimension Dominating. The latter is straightforward. 2269
Definition 10.0.17. (Extreme Threshold). 2270
is a probability Dimension Dominating. Let P be a monotone property of SuperHyperGraphs (one 2272
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2273
a function f (n) such that: 2274
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2275
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2276

Definition 10.0.18. (Extreme Balanced). 2277

is a probability Dimension Dominating. Let F be a fixed Extreme SuperHyperGraph. Then 2279
there is a threshold function for the property of containing a copy of F as an Extreme 2280
SubSuperHyperGraph is called Extreme Balanced. 2281
Consider S = (V, E) is a probability Dimension Dominating. Let F be a nonempty balanced Extreme 2283
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2284
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2285
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2288
the mentioned Extreme Figures in every Extreme items. 2289
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHy- 2290
perDimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and 2291
E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge 2292
and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeigh- 2293
bor, there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyper- 2294
Vertex, V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it 2295
as an Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every 2296

given Extreme SuperHyperDimension Dominating. 2297
C(N SHG)Extreme Dimension Dominating =

{}.
C(N SHG)Extreme Dimension Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Dimension Dominating =
{}.
C(N SHG)Extreme V-Dimension Dominating SuperHyperPolynomial
= 0z 0 .
2298
perDimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 2300
and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 2301
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 2302
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 2303
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2304
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDimension Dominating. 2305

{}.

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

= 0z 0 .
{}.
= 0z 0 .
2306
perDimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. 2308

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



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

{EN SHG − {Ei }}.
= z 6−c .
{VN SHG − {Vi }}.

= z 7−c .
2315

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

{EN SHG − {Ei }}.

= z 6−c .
{VN SHG − {Vi }}.
= z 7−c .
2321

{E1 , E2 }.
= z 3−a .
{VN SHG − {V1 , V11 }}.

= z 3−a .
2324

{E3i+1 , E23 }3i=0 .
= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
2327

{EN SHG − {E1 , E5 }}.



= z 3−a .
{VN SHG − {V1 , V11 }}.
= z 3−a .
2330

{EN SHG − {E1 , E6 }}.
= z 3−a .
{VN SHG − {V1 , V5 }}.
= z 3−a .
2333


{EN SHG − {E1 , E2 }}.
= z 2−a .
{VN SHG − {V1 , V5 }}.
= z 5−a .
2336

{EN SHG − {E6 , E9 }}.
= z 2−a .


{VN SHG − {V1 , V5 }}.
= z 3−a .
2339

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2351

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


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

{EN SHG − {E1 }}.
= z 3−a .


{VN SHG − {V1 , {U2 , V2 , W2 }}.
= z 3−a .
2360

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


{E2i+3 }1i=0 .
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .
2366
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2367
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Dimension Dominating if for 2368
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2369
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2370

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

SuperHyperDimension Dominating in the Extreme Example (42.0.3) 95NHG1
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2372

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2373
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2374
quasi-R-Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of 2375
them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2376
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Dimension Dominating, minus 2377
all Extreme SuperHypeNeighbor to some of them but not all of them. 2378
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Dimension Dominating is at least 2379
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2380
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2381

SuperHyperDimension Dominating in the Extreme Example (42.0.3) 95NHG2
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2382
SuperHyperVertices are renamed to Extreme Dimension Dominating in some cases but the maximum 2383
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2384
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R-Dimension 2385
Dominating. 2386
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Dimension Dominating has, the least Extreme cardinality, the lower
sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Dimension Dominating with the least Extreme cardinality, the lower 2387
sharp Extreme bound for cardinality. 2388
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2389
Then in the worst case, literally, 2390
C(N SHG)ExtremeQuasi−DimensionDominating
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−DimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−DimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−DimensionDominatingSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Dimension Dominating. In other words, the least cardinality, the lower sharp 2391
bound for the cardinality, of an Extreme type-result-Dimension Dominating is the cardinality of 2392
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−DimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−DimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−DimensionDominatingSuperHyperP 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-Dimension Dominating since
neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where amount
refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than one to
form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the
Extreme SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-Dimension Dominating. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Dimension Dominating 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-Dimension Dominating. 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-Dimension Dominating decorates the Extreme SuperHyper-
Vertices don’t have received any Extreme connections so as this Extreme style implies different
versions of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of
Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum
Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex
in the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore,
the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about
the Extreme R-Dimension Dominating. Since at least two Extreme SuperHyperVertices involve to
make a title in the Extreme background of the Extreme SuperHyperGraph. The Extreme
SuperHyperGraph is obvious if it has no Extreme SuperHyperEdge but at least two Extreme
SuperHyperVertices make the Extreme version of Extreme SuperHyperEdge. Thus in the
Extreme setting of non-obvious Extreme SuperHyperGraph, there are at least one Extreme
SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as Extreme adjective
for the initial Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop
Extreme version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said
to be loopless. The Extreme adjective “loop” on the basic Extreme framework engages one
Extreme SuperHyperVertex but it never happens in this Extreme setting. With these Extreme
bases, on an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus
there’s at least an Extreme R-Dimension Dominating has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Dimension Dominating has the Extreme cardinality at least
an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This Extreme
SuperHyperSet isn’t an Extreme R-Dimension Dominating since either the Extreme SuperHyperGraph
is an obvious Extreme SuperHyperModel thus it never happens since there’s no Extreme usage
of this Extreme framework and even more there’s no Extreme connection inside or the Extreme
SuperHyperGraph isn’t obvious and as its consequences, there’s an Extreme contradiction with
the term “Extreme R-Dimension Dominating” 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-Dimension Dominating is the Extreme SuperHyperSet of the Extreme SuperHyperVertices such
that some Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle Extreme
style. The Extreme cardinality of the v SuperHypeSet
Is the maximum in comparison to the Extreme SuperHyperSet
But the lower Extreme bound is up. Thus the minimum Extreme cardinality of the maximum
Extreme cardinality ends up the Extreme discussion. The first Extreme term refers to the
Extreme setting of the Extreme SuperHyperGraph but this key point is enough since there’s an
Extreme SuperHyperClass of an Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes an Extreme SuperHyperSet has only some amount Extreme
SuperHyperVertices from one Extreme SuperHyperEdge such that there’s no Extreme amount
of Extreme SuperHyperEdges more than one involving these some amount of these Extreme
SuperHyperVertices. The Extreme cardinality of this Extreme SuperHyperSet is the maximum
and the Extreme case is occurred in the minimum Extreme situation. To sum them up, the
Extreme SuperHyperSet
Has the maximum Extreme cardinality such that
Contains some Extreme SuperHyperVertices such that there’s distinct-covers-order-amount

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices
Is an Extreme R-Dimension Dominating for the Extreme SuperHyperGraph as used Extreme

background in the Extreme terms of worst Extreme case and the common theme of the
lower Extreme bound occurred in the specific Extreme SuperHyperClasses of the Extreme
SuperHyperGraphs which are Extreme free-quasi-triangle.

Assume an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of the

Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least no Extreme
SuperHyperEdge with others in common. Thus those Extreme SuperHyperVertices have the
eligibles to be contained in an Extreme R-Dimension Dominating. Those Extreme SuperHyperVertices
are potentially included in an Extreme style-R-Dimension Dominating. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Extreme
SuperHyperVertices of the Extreme SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Extreme SuperHyperVertices and there’s only and only one
Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme SuperHyperVertices Zi and
Zj . The other definition for the Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the terms of
Extreme R-Dimension Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Dimension Dominating 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-Dimension Dominating. 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, 2393
Extreme R-Dimension Dominating =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2394
Extreme R-Dimension Dominating =


Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Dimension Dominating where E ∈ EESHG:(V,E) is

fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in
an Extreme Dimension Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s not unique.
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If an Extreme
SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Dimension Dominating is at least 2395
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2396
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2397
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2398
SuperHyperVertices are renamed to Extreme Dimension Dominating in some cases but the maximum 2399
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2400
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2401
Dimension Dominating. 2402

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2403
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2404
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2405
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2406
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2407
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2408
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2409
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2410
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2411
Thus it forms an Extreme quasi-R-Dimension Dominating where the Extreme completion of the 2412
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Dimension Dominating. 2413
The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In 2414

the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2415
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2416
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2417
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2418
Extreme style of the embedded Extreme R-Dimension Dominating. The interior types of the Extreme 2419
SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors are only 2420
affected by the interior Extreme SuperHyperVertices. The common connections, more precise 2421
and more formal, the perfect unique connections inside the Extreme SuperHyperSet for any 2422
distinct types of Extreme SuperHyperVertices pose the Extreme R-Dimension Dominating. Thus 2423
Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge and 2424
in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that Extreme 2425
SuperHyperEdge. In the embedded Extreme Dimension Dominating, there’s the usage of exterior 2426
Extreme SuperHyperVertices since they’ve more connections inside more than outside. Thus the 2427
title “exterior” is more relevant than the title “interior”. One Extreme SuperHyperVertex has no 2428
connection, inside. Thus, the Extreme SuperHyperSet of the Extreme SuperHyperVertices with 2429
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 2430
the Extreme R-Dimension Dominating. The Extreme R-Dimension Dominating with the exclusion of the 2431
exclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other 2432

terms, the Extreme R-Dimension Dominating with the inclusion of all Extreme SuperHyperVertices 2433
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Dimension Dominating. To sum them 2434
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2435
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2436
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Dimension 2437
Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of them. In 2438
other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only 2439
two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Dimension Dominating, minus all 2440
Extreme SuperHypeNeighbor to some of them but not all of them. 2441
The main definition of the Extreme R-Dimension Dominating has two titles. an Extreme quasi-R- 2442
Dimension Dominating and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are 2443
two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R- 2444
Dimension Dominating with that quasi-maximum Extreme SuperHyperCardinality in the terms of the 2445
embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then 2446
the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi- 2447
R-Dimension Dominatings for all Extreme numbers less than its Extreme corresponded maximum 2448
number. The essence of the Extreme Dimension Dominating ends up but this essence starts up in the 2449
terms of the Extreme quasi-R-Dimension Dominating, again and more in the operations of collecting 2450
all the Extreme quasi-R-Dimension Dominatings acted on the all possible used formations of the 2451
Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2452
considered as the equivalence class for all corresponded quasi-R-Dimension Dominatings. Let 2453
zExtreme Number , SExtreme SuperHyperSet and GExtreme Dimension Dominating be an Extreme number, 2454
an Extreme SuperHyperSet and an Extreme Dimension Dominating. Then 2455
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Dimension Dominating ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Dimension Dominating is re-formalized and 2456
redefined as follows. 2457
GExtreme Dimension Dominating ∈ ∪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 2458
definition for the Extreme Dimension Dominating. 2459
GExtreme Dimension Dominating =

{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 Dimension 2460
poses the upcoming expressions.
Dominating 2461

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

= max zExtreme Number
[zExtreme
Number ]Extreme Class

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


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


2465

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


= zExtreme Number |

2466


2467


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2468
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2469
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2470
perEdge. It’s, literarily, another name for “Extreme Quasi-Dimension Dominating” but, precisely, it’s 2471
the generalization of “Extreme Quasi-Dimension Dominating” since “Extreme Quasi-Dimension Dominating” 2472
happens “Extreme Dimension Dominating” in an Extreme SuperHyperGraph as initial framework 2473
and background but “Extreme SuperHyperNeighborhood” may not happens “Extreme Dimension 2474
Dominating” in an Extreme SuperHyperGraph as initial framework and preliminarily background 2475
since there are some ambiguities about the Extreme SuperHyperCardinality arise from it. To 2476
get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Dimension 2477
Dominating”, and “Extreme Dimension Dominating” are up. 2478
Thus, let 2479
zExtreme Number , NExtreme SuperHyperNeighborhood and 2480
GExtreme Dimension Dominating be an Extreme number, an Extreme SuperHyperNeighborhood and 2481
an Extreme Dimension Dominating and the new terms are up. 2482
GExtreme Dimension Dominating ∈ ∪zExtreme Number

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

2483

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

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

And with go back to initial structure, 2486
GExtreme Dimension Dominating ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


2487

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


2488


2489


Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior Extreme
SuperHyperVertices belong to any Extreme quasi-R-Dimension Dominating 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-Dimension Dominating.
The Extreme SuperHyperSet of Extreme SuperHyperVertices,

Is the simple Extreme type-SuperHyperSet of the Extreme R-Dimension Dominating. The Extreme
SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG :

(V, E) is an Extreme type-SuperHyperSet with
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by
Extreme Dimension Dominating is related to the Extreme SuperHyperSet of the Extreme Super-
HyperVertices,

There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Dimension Dominating is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Dimension Dominating is an Extreme SuperHyperSet
includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Dimension Dominating is up. To sum them up, the
Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Dimension Dominating.

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

perHyperVertices such that there’s no an Extreme SuperHyperEdge for some amount Extreme
SuperHyperVertices instead of all given by that Extreme type-SuperHyperSet called the
Extreme Dimension Dominating. There isn’t only less than two Extreme SuperHyperVertices inside
the intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Dimension Dominating,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Dimension Dominating,
not:
Is the Extreme SuperHyperSet, not:

does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2490
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2491
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2492
the 2493
“Extreme R-Dimension Dominating” 2494
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2495
Extreme R-Dimension Dominating, 2496
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Dimension Dominating. In other words, the least cardinality, the lower sharp bound
for the cardinality, of an Extreme R-Dimension Dominating is the cardinality of
2497
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2498
Extreme SuperHyperVertices belong to any Extreme quasi-R-Dimension Dominating if for any of 2499
them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2500
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2501
all minus all Extreme SuperHypeNeighbors to any amount of them. 2502
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2503
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2504
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2505
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2506
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2507
R-Dimension Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2508
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2509
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2510

S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2511
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Dimension Dominating. Since 2512
it doesn’t have 2513
2514
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2515
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2516
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2517
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2518
but it isn’t an Extreme R-Dimension Dominating. Since it doesn’t do the Extreme procedure such 2519
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2520
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2521
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2522
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2523
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2524
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2525
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Dimension Dominating, VESHE 2526
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Dimension Dominating, 2527
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2528
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2529
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2530
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2531
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2532
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2533
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Dimension Dominating only contains 2534
all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2535
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2536
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2537
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2538
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2539
The SuperHyperNotion, namely, Dimension Dominating, is up. There’s neither empty SuperHy- 2540
perEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2541
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Dimen- 2542
sion Dominating. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2543
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−DimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−DimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−DimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme . The Extreme

Dimension Dominating 2544

SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2545
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : 2546
(V, E) is an Extreme type-SuperHyperSet with 2547

2548
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2549
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2550
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2551
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2552
Extreme SuperHyperSet. Thus the non-obvious Extreme Dimension Dominating is up. The obvious 2553
simple Extreme type-SuperHyperSet called the Extreme Dimension Dominating is an Extreme Super- 2554
HyperSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet 2555
of the Extreme SuperHyperEdges[SuperHyperVertices], 2556
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2557
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Dimension 2558
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2559
perEdges[SuperHyperVertices], 2560
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 Dimension Dominating. Since 2561
the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2562
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2563
is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an 2564
Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme type- 2565
SuperHyperSet called the Extreme Dimension Dominating and it’s an Extreme Dimension Dominating. 2566
Since it’s 2567

2568
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2569
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2570
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2571
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2572
intended Extreme SuperHyperSet, 2573
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Dimension Dominating , 2574
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.


= az s + bz t .
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme , not:
Dimension Dominating 2575
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2576
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 2577
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2578
SuperHyperSet called the 2579
“Extreme Dimension Dominating ” 2580
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2581
Extreme Dimension Dominating , 2582
is only and only 2583
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2584

CHAPTER 11 2585
The Extreme Departures on The 2586
Theoretical Results Toward Theoretical 2587
Motivations 2588
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2589
SuperHyperClasses. 2590
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2591

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

perDimension Dominating in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2594
new way to redefine as 2595
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 2596
ViEXT ERN AL in the literatures of SuperHyperDimension Dominating. The latter is straightforward. 2597
2598
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2599
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2600
(31.1), is the SuperHyperDimension Dominating. 2601
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2602

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


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

2609
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2610
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2611
SuperHyperModel (31.2), is the Extreme SuperHyperDimension Dominating. 2612

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

SuperHyperDimension Dominating in the Extreme Example (42.0.7) 136NSHG19a
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2613

{EN SHG − {E1 , E2 }}.
= z 3−a .
{VN SHG − {ViIN T ERN AL , CEN T ER}}.
= z 3−a .
Proof. Let 2614
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2615
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

SuperHyperDimension Dominating in the Extreme Example (42.0.9) 136NSHG20a
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2616
way to redefine as 2617

2620
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2621
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2622
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2623
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDimension 2624
Dominating. 2625
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2626

{EN SHG − {EPi , EPj }i6=j }.


= z b−a .
{VN SHG − {VPi , VPj }i6=j }.
= z b−a .
Proof. Let 2627
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
2628
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 2629
a new way to redefine as 2630

Then there’s no at least one SuperHyperDimension Dominating. Thus the notion of quasi may be up 2633
but the SuperHyperNotions based on SuperHyperDimension Dominating could be applied. There are 2634
only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 2635
the representative in the 2636
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperDimension Dominating taken from a connected Extreme SuperHyperBipartite 2637
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2638
SuperHyperPart SuperHyperEdges are attained in any solution 2639
P :

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

Extreme SuperHyperDimension Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2640
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2641
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2642
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2643
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2644
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperDimension Dominating. 2645
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2646
Then 2647

= z b−a .
= z b−a .

Proof. Let 2648
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2649
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperDimension Dominating taken from a connected Extreme SuperHyperMulti- 2650

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

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

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

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

SuperHyperDimension Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2663
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2664
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2665
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2666
the Extreme SuperHyperDimension Dominating. 2667
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2668

Then, 2669

|E |
{E3i+2 }i=0ESHP ∪ E ∗ .
| min |E | |Ei |
{E3i+2 } ESHP ∪E ∗
=z i=0 .
|E |
EXT ERN AL
{V2i+2 }i=0ESHP ∪ V ∗ .
| min |E | |Vi |
{V EXT ERN AL } ESHP ∪V ∗
=z 2i+2 i=0 .
Proof. Let 2670
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

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

Extreme SuperHyperDimension Dominating in the Extreme Example (42.0.15) 136NSHG23a
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperDimension Dominating taken from a connected Extreme SuperHyperWheel 2671

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

Then there’s at least one SuperHyperDimension Dominating. Thus the notion of quasi isn’t up and 2675
the SuperHyperNotions based on SuperHyperDimension Dominating could be applied. The unique 2676
embedded SuperHyperDimension Dominating proposes some longest SuperHyperDimension Dominating 2677
excerpt from some representatives. The latter is straightforward. 2678
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2679
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2680
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2681
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2682
Extreme SuperHyperDimension Dominating. 2683

CHAPTER 12 2684
The Surveys of Mathematical Sets On 2685
The Results But As The Initial Motivation 2686
For the SuperHyperDimension Dominating, Extreme SuperHyperDimension Dominating, and the Extreme 2687
SuperHyperDimension Dominating, some general results are introduced. 2688
Remark 12.0.1. Let remind that the Extreme SuperHyperDimension Dominating is “redefined” on 2689
the positions of the alphabets. 2690
Corollary 12.0.2. Assume Extreme SuperHyperDimension Dominating. Then 2691
Extreme SuperHyperDimensionDominating =
{theSuperHyperDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperDimensionDominating
|ExtremecardinalityamidthoseSuperHyperDimensionDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2692
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2693
and the neutrality, for i = 1, 2, 3, respectively. 2694
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2695
alphabet. Then the notion of Extreme SuperHyperDimension Dominating and SuperHyperDimension 2696
Dominating coincide. 2697
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2698
the alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme 2699
SuperHyperDimension Dominating if and only if it’s a SuperHyperDimension Dominating. 2700
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of the al- 2701
phabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperDimension 2702
Dominating if and only if it’s a longest SuperHyperDimension Dominating. 2703
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2704
identical letter of the alphabet. Then its Extreme SuperHyperDimension Dominating is its SuperHy- 2705
perDimension Dominating and reversely. 2706
127
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperDimension Dominating, Supe- 2707

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2708
identical letter of the alphabet. Then its Extreme SuperHyperDimension Dominating is its SuperHy- 2709
perDimension Dominating and reversely. 2710
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperDimension 2711
isn’t well-defined if and only if its SuperHyperDimension Dominating isn’t well-defined.
Dominating 2712
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2713
Extreme SuperHyperDimension Dominating isn’t well-defined if and only if its SuperHyperDimension 2714
Dominating isn’t well-defined. 2715
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperDimension Dominating, Super- 2716

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2717
SuperHyperDimension Dominating isn’t well-defined if and only if its SuperHyperDimension Dominating isn’t 2718
well-defined. 2719
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHy- 2720
perDimension Dominating is well-defined if and only if its SuperHyperDimension Dominating is well-defined. 2721
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2722

Extreme SuperHyperDimension Dominating is well-defined if and only if its SuperHyperDimension Dominating 2723
is well-defined. 2724
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperDimension Dominating, Super- 2725

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2726
SuperHyperDimension Dominating is well-defined if and only if its SuperHyperDimension Dominating is 2727
well-defined. 2728
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2729
(i) : the dual SuperHyperDefensive SuperHyperDimension Dominating; 2730
(ii) : the strong dual SuperHyperDefensive SuperHyperDimension Dominating; 2731
(iii) : the connected dual SuperHyperDefensive SuperHyperDimension Dominating; 2732
(iv) : the δ-dual SuperHyperDefensive SuperHyperDimension Dominating; 2733
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDimension Dominating; 2734
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDimension Dominating. 2735
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2736
(i) : the SuperHyperDefensive SuperHyperDimension Dominating; 2737
(ii) : the strong SuperHyperDefensive SuperHyperDimension Dominating; 2738
(iii) : the connected defensive SuperHyperDefensive SuperHyperDimension Dominating; 2739
(iv) : the δ-SuperHyperDefensive SuperHyperDimension Dominating; 2740
(v) : the strong δ-SuperHyperDefensive SuperHyperDimension Dominating; 2741

(vi) : the connected δ-SuperHyperDefensive SuperHyperDimension Dominating. 2742
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2743

independent SuperHyperSet is 2744
(iii) : the connected SuperHyperDefensive SuperHyperDimension Dominating; 2747
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2751

which is a SuperHyperDimension Dominating/SuperHyperPath. Then V is a maximal 2752
(i) : SuperHyperDefensive SuperHyperDimension Dominating; 2753
(ii) : strong SuperHyperDefensive SuperHyperDimension Dominating; 2754
(iii) : connected SuperHyperDefensive SuperHyperDimension Dominating; 2755
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDimension Dominating; 2756
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDimension Dominating; 2757
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDimension Dominating; 2758
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2759
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2760

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2761
(i) : dual SuperHyperDefensive SuperHyperDimension Dominating; 2762
(ii) : strong dual SuperHyperDefensive SuperHyperDimension Dominating; 2763
(iii) : connected dual SuperHyperDefensive SuperHyperDimension Dominating; 2764
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDimension Dominating; 2765
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDimension Dominating; 2766
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDimension Dominating; 2767

which is a SuperHyperDimension Dominating/SuperHyperPath. Then the number of 2770
(i) : the SuperHyperDimension Dominating; 2771

(ii) : the SuperHyperDimension Dominating; 2772
(iii) : the connected SuperHyperDimension Dominating; 2773
(iv) : the O(ESHG)-SuperHyperDimension Dominating; 2774
(v) : the strong O(ESHG)-SuperHyperDimension Dominating; 2775
(vi) : the connected O(ESHG)-SuperHyperDimension Dominating. 2776
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2777
coincide. 2778

which is a SuperHyperWheel. Then the number of 2780
(i) : the dual SuperHyperDimension Dominating; 2781
(ii) : the dual SuperHyperDimension Dominating; 2782
(iii) : the dual connected SuperHyperDimension Dominating; 2783
(iv) : the dual O(ESHG)-SuperHyperDimension Dominating; 2784
(v) : the strong dual O(ESHG)-SuperHyperDimension Dominating; 2785
(vi) : the connected dual O(ESHG)-SuperHyperDimension Dominating. 2786
coincide. 2788
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2790

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2791
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2792
is a 2793
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperDimension Dominating; 2797
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperDimension Dominating; 2798
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperDimension Dominating. 2799

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2802
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2803
SuperHyperPart is a 2804

(iv) : δ-SuperHyperDefensive SuperHyperDimension Dominating; 2808
(v) : strong δ-SuperHyperDefensive SuperHyperDimension Dominating; 2809
(vi) : connected δ-SuperHyperDefensive SuperHyperDimension Dominating. 2810

SuperHyperMultipartite. Then Then the number of 2813
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2820
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2821
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2823
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2824
(iv) : SuperHyperDimension Dominating; 2828
(v) : strong 1-SuperHyperDefensive SuperHyperDimension Dominating; 2829
(vi) : connected 1-SuperHyperDefensive SuperHyperDimension Dominating. 2830
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2831
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2832
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2833
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2834

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

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperDimension Dominating; 2839
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperDimension Dominating. 2841
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2842
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2843
dual 2844
(iv) : 0-SuperHyperDefensive SuperHyperDimension Dominating; 2848
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2851
perComplete. Then there’s no independent SuperHyperSet. 2852
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2853
perDimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2854
and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2855
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDimension Dominating; 2859
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDimension Dominating; 2860
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDimension Dominating. 2861
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2862
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2863
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2864
t>
2
setting of a dual 2865



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2872
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2873
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2874
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2875
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2876
SuperHyperDefensive SuperHyperDimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2877
(i) v ∈ Ns (x); 2878
(ii) vx ∈ E. 2879
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2880
SuperHyperDefensive SuperHyperDimension Dominating, then 2881
(i) S is SuperHyperDimension Dominating set; 2882
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2883
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2884
(i) Γ ≤ O; 2885
(ii) Γs ≤ On . 2886
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2887
connected. Then 2888
(i) Γ ≤ O − 1; 2889
(ii) Γs ≤ On − Σ3i=1 σi (x). 2890
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2891
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHy- 2892

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2894
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2895
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2896
SuperHyperDimension Dominating. 2897

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2898
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperDimension Dominating; 2899
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2900
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2901
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2902
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperDimension Dominating. Then 2904
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperDimension 2905

Dominating; 2906
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2907
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2908
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2909
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperDimension Dominating. Then 2911

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2915
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2916
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2918
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDimension Dominating; 2919
(ii) Γ = 1; 2920
(iii) Γs = Σ3i=1 σi (c); 2921
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDimension Dominating. 2922
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2923
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2924
SuperHyperDefensive SuperHyperDimension Dominating; 2925
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2926
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2927
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2928
SuperHyperDefensive SuperHyperDimension Dominating. 2929
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2930
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperDimension 2931
Dominating; 2932
(ii) Γ = b n2 c + 1; 2933
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2934
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperDimension 2935
Dominating. 2936
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2937
bnc
2
Dominating; 2939
(ii) Γ = b n2 c; 2940

bnc ; 2941
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHy- 2942
perDimension Dominating. 2943
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2944

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

Dominating for N SHF; 2947
(ii) Γ = m for N SHF : (V, E); 2948
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2949
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperDimension 2950
Dominating for N SHF : (V, E). 2951
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2952
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2953
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive SuperHy- 2954
perDimension Dominating for N SHF; 2955
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2956

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

b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperDimension Dominating 2958
for N SHF : (V, E). 2959
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2960

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2961
bnc
Dominating for N SHF : (V, E); 2963
(ii) Γ = b n2 c for N SHF : (V, E); 2964

bnc for N SHF : (V, E); 2965
S={vi }i=1
bnc
2
are only dual maximal SuperHyperDimension Dominating for 2966
N SHF : (V, E). 2967
following statements hold; 2969
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2970

SuperHyperDimension Dominating, then S is an s-SuperHyperDefensive SuperHyperDimension 2971
Dominating; 2972
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2973

SuperHyperDimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperDimension 2974
Dominating. 2975
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2978

SuperHyperDimension Dominating, then S is an s-SuperHyperPowerful SuperHyperDimension 2979
Dominating; 2980
SuperHyperDimension Dominating, then S is a dual s-SuperHyperPowerful SuperHyperDimension 2982

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

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

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

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

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

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


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

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


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

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

SuperHyperGraph which is SuperHyperDimension Dominating. Then following statements hold; 3025
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHy- 3026

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

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

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


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

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

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

CHAPTER 13 3044
Extreme Applications in Cancer’s 3045
Extreme Recognition 3046
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3047
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3048
as the consequences of the model, some parameters are used. The cells are under attack of this 3049
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3050
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3051
In the following, some Extreme steps are Extreme devised on this disease. 3052
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3053
function. 3054
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3055
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3056
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3060
what’s done. 3061
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known 3062
and they’ve got the names, and some general Extreme models. The moves and the 3063
Extreme traces of the cancer on the complex tracks and between complicated groups of 3064
cells could be fantasized by an Extreme SuperHyperPath(-/SuperHyperDimension Dominating, 3065
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 3066
The aim is to find either the Extreme SuperHyperDimension Dominating or the Extreme 3067
SuperHyperDimension Dominating in those Extreme Extreme SuperHyperModels. 3068
139
CHAPTER 14 3069
Case 1: The Initial Extreme Steps 3070
Toward Extreme SuperHyperBipartite 3071
as Extreme SuperHyperModel 3072
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3073
is Extreme highlighted and Extreme featured. 3074
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3075
partite is obtained. 3076
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3077
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperDimension Dominating 136NSHGaa21aa
141
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3081
Case 2: The Increasing Extreme Steps 3082
Toward Extreme 3083
SuperHyperMultipartite as Extreme 3084
SuperHyperModel 3085
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3086
ite is Extreme highlighted and Extreme featured. 3087
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3088
partite is obtained. 3089
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3090
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

143
Belong to The Extreme SuperHyperMultipartite

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

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

CHAPTER 16 3094
Wondering Open Problems But As The 3095
Directions To Forming The Motivations 3096
In what follows, some “problems” and some “questions” are proposed. 3097
The SuperHyperDimension Dominating and the Extreme SuperHyperDimension Dominating are defined 3098
on a real-world application, titled “Cancer’s Recognitions”. 3099
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3100
recognitions? 3101
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperDimension Dominating 3102
and the Extreme SuperHyperDimension Dominating? 3103
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3104
them? 3105
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDimension 3106
and the Extreme SuperHyperDimension Dominating?
Dominating 3107
Problem 16.0.5. The SuperHyperDimension Dominating and the Extreme SuperHyperDimension Dominating 3108
do a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperDimension 3109
Dominating, are there else? 3110
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3111
Numbers types-results? 3112
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3113
the multiple types of SuperHyperNotions? 3114
145
CHAPTER 17 3115
Conclusion and Closing Remarks 3116
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3117
research are illustrated. Some benefits and some advantages of this research are highlighted. 3118
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3119
In this endeavor, two SuperHyperNotions are defined on the SuperHyperDimension Dominating. 3120
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph 3121
is redefined on the position of the alphabets. Based on the new definition for the Extreme 3122
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperDimension Dominating, finds 3123
the convenient background to implement some results based on that. Some SuperHyperClasses 3124
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 3125
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 3126
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 3127
SuperHyperDimension Dominating, the new SuperHyperClasses and SuperHyperClasses, are 3128
introduced. Some general results are gathered in the section on the SuperHyperDimension 3129
Dominating and the Extreme SuperHyperDimension Dominating. The clarifications, instances and 3130
literature reviews have taken the whole way through. In this research, the literature reviews 3131
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 3132
Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 3133
both bases are the background of this research. Sometimes the cancer has been happened on the 3134
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 3135
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 3136
longest and strongest styles with the formation of the design and the architecture are formally 3137
called “ SuperHyperDimension Dominating” in the themes of jargons and buzzwords. The prefix 3138
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 3139
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 3140
pointed out and spoken out. 3141
147
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperDimension Dominating
3. Extreme SuperHyperDimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3142
Extreme SuperHyperDuality But As The 3143
Super Forms 3145
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3146

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

Va ∈ Ei , Ej ; 3150
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3151
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3152
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3153
Vi , Vj ∈ Ea ; 3154
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3155
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3156
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3157
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3158

SuperHyperDuality. 3159
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3160

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3165
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3166
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3167
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3168
Extreme SuperHyperDuality; 3169
149
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3170

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3171
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3172
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3173
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3174
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3175
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3176

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3177
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3178
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3179
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3180
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3181
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3183
coefficient; 3184
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3185

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

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3208
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3209
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3210
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3211
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3212

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3213

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3221
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3223
Extreme coefficient. 3224
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3225
mentioned Extreme Figures in every Extreme items. 3226
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3227
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3228
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3229
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3230
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3231
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3232
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3233
C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.
• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3235
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3236
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3237
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3241


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

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 3285
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. 3289
(31.1), is the SuperHyperDuality. 3292
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 3294
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



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

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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3334

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

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

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

∃!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 3359
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3360
Extreme SuperHyperDuality. 3366

CHAPTER 19 3367
Extreme SuperHyperJoin But As The 3368
Super Forms 3370
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3371

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3382
|Vj |Extreme CARDINALITY ; 3383
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3384
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3385
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3386

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3390
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3393
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3394
163
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3395

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3402
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3403
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3404
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3405
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3406
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3407
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3408
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3409

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


and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3422
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3423

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3425
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3426
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3428
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3429
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3430

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3433

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

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

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

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3456
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3457
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3458
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3459
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3460
V3 , is excluded in every given Extreme SuperHyperJoin. 3461

is up. The Extreme Algorithm is Extremely straightforward. 3463


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3584
Extreme SuperHyperPerfect But As The 3585
Super Forms 3587
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3588

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3600
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3601

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3605
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3606
Extreme SuperHyperPerfect; 3610
177
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3611

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3618
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3619
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3624
coefficient; 3625
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3626

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3662
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3664
Extreme coefficient. 3665
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3668
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3669
SuperHyperPerfect. 3675
C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.
Perfect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3677
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3678
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3682


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

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

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

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

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



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

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

Then 3773

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



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

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

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


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

CHAPTER 21 3808
Extreme SuperHyperTotal But As The 3809
Super Forms 3811
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3812
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3815
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3816

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3822
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3823

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3827
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3830
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3831
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3832

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3833
191

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3847
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3849
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3850
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3851
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3853
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3854

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3855
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3859
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3860

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3867
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3868
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3871
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3872
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3873
coefficient; 3874
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3875

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3878
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3879
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3880
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3882
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3885
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3886
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3887
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3888
SuperHyperTotal. 3892
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3894
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3895
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3896
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3897
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3898
V3 , is excluded in every given Extreme SuperHyperTotal. 3899



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3947
(31.1), is the SuperHyperTotal. 3950
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 3952
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. 3959
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 3961
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4023
Extreme SuperHyperConnected But As 4024
The Extensions Excerpt From Dense And 4025
Super Forms 4026
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4027

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4041
SuperHyperConnected. 4042
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4043
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4046

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4048
205
Extreme SuperHyperConnected; 4052
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4053

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4060
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4061
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4062
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4063
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4064
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4065
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4066
corresponded to its Extreme coefficient; 4067
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4068


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

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

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

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

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

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

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

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

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 4119
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 4120
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 4124


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

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

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 4168
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. 4172
(31.1), is the SuperHyperConnected. 4175
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 4177
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. 4184
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 4186



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4205

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4240
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4241
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4242
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4243
some representatives. The latter is straightforward. 4244
Extreme SuperHyperConnected. 4249

CHAPTER 23 4250
Background 4251
219



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 4321
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 4322
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 4323
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 4324
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4325
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett 4326
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 4327
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 4328
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4329
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 4330

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

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

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 4338
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 4339
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 4340
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4341
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyper- 4342
Graph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” 4343

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

SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 4350
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 4351
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 4352
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 4353
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 4354
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 4355
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 4356
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 4357
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 4358
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 4359
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 4360
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 4361
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 4362
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 4363
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 4364
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 4365
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 4366

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

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

(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 4377
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 4378
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 4379
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 4380
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 4381
(2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 4382
HG274; HG275; HG276; HG277; HG278; HG279], there are some endeavors to formalize 4402
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 4403
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4404


HG279] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 4456



HG176b; HG177b; HG178b; HG179b]. Two popular scientific research books in Scribd in 4470
the terms of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; 4471
HG44b]. 4472

Bibliography 4473
10.33140/JMTCM.01.03.09) 4496
225



10.20944/preprints202301.0282.v1). 4512

10.20944/preprints202301.0267.v1). 4515

(doi: 10.20944/preprints202301.0265.v1). 4520
prints202301.0262.v1). 4524
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4530

prints202301.0105.v1). 4533

Preprints 2023, 2023010044 4539
10.20944/preprints202301.0043.v1). 4542

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

(doi: 10.20944/preprints202212.0500.v1). 4558
10.5281/zenodo.8057696). 4567

2023, (doi: 10.5281/zenodo.8057753). 4570
10.5281/zenodo.8052893). 4573
2023, (doi: 10.5281/zenodo.8052925). 4576
10.5281/zenodo.8051346). 4579

10.5281/zenodo.8051360). 4582
10.5281/zenodo.8025707). 4585
10.5281/zenodo.8027275). 4588
odo.8017246). 4591
10.5281/zenodo.8020128). 4594
odo.7978571). 4597
10.5281/zenodo.7978857). 4600
10.5281/zenodo.7940830). 4603
10.5281/zenodo.7943578). 4606
odo.7916595). 4609
odo.7923632). 4612
(doi: 10.5281/zenodo.7904698). 4615
2023, (doi: 10.5281/zenodo.7904671). 4618

10.5281/zenodo.7871026). 4627
2023, (doi: 10.5281/zenodo.7874647). 4630
10.5281/zenodo.7857856). 4633
2023, (doi: 10.5281/zenodo.7857841). 4636
10.5281/zenodo.7853867). 4645
10.5281/zenodo.7853922). 4648
(doi: 10.5281/zenodo.7851519). 4651
(doi: 10.5281/zenodo.7851550). 4654

10.5281/zenodo.7834229). 4663
10.5281/zenodo.7834261). 4666
10.5281/zenodo.7824560). 4669
(doi: 10.5281/zenodo.7824623). 4672
2023, (doi: 10.5281/zenodo.7809365). 4683
2023, (doi: 10.5281/zenodo.7809358). 4686
10.5281/zenodo.7809219). 4689
10.5281/zenodo.7809328). 4692
2023, (doi: 10.5281/zenodo.7806767). 4695

2023, (doi: 10.5281/zenodo.7806838). 4698
10.5281/zenodo.7799902). 4707
(doi: 10.5281/zenodo.7804218). 4710
(doi: 10.5281/zenodo.7796334). 4713
10.5281/zenodo.7791952). 4719
10.5281/zenodo.7791982). 4722
10.5281/zenodo.7790026). 4725
10.5281/zenodo.7790052). 4728
2023, (doi: 10.5281/zenodo.7787066). 4731

10.5281/zenodo.7781476). 4737
10.5281/zenodo.7783082). 4740
10.5281/zenodo.7777857). 4743
10.5281/zenodo.7779286). 4746
(doi: 10.5281/zenodo.7771831). 4749
2023, (doi: 10.5281/zenodo.7772468). 4752
10.13140/RG.2.2.20913.25446). 4755
odo.7764916). 4758
10.13140/RG.2.2.11770.98247). 4761
10.13140/RG.2.2.12400.12808). 4764
2023, (doi: 10.13140/RG.2.2.22545.10089). 4767
10.13140/RG.2.2.11377.76644). 4773

10.13140/RG.2.2.23750.96329). 4776
10.13140/RG.2.2.31366.24641). 4779
10.13140/RG.2.2.34721.68960). 4782
2023, (doi: 10.13140/RG.2.2.30212.81289). 4785
10.13140/RG.2.2.24288.35842). 4791
10.13140/RG.2.2.32467.25124). 4794
10.13140/RG.2.2.31025.45925). 4797
10.13140/RG.2.2.17184.25602). 4800
10.13140/RG.2.2.23423.28327). 4803
10.13140/RG.2.2.28456.44805). 4806
10.13140/RG.2.2.23525.68320). 4809
10.13140/RG.2.2.20170.24000). 4812

10.13140/RG.2.2.36475.59683). 4815
10.13140/RG.2.2.29764.71046). 4818
2023, (doi: 10.13140/RG.2.2.18780.87683). 4821
10.13140/RG.2.2.26134.01603). 4827
10.13140/RG.2.2.27392.30721). 4830
10.13140/RG.2.2.33028.40321). 4833
10.13140/RG.2.2.21389.20966). 4836
10.13140/RG.2.2.16356.04489). 4839
10.13140/RG.2.2.21756.21129). 4842
10.13140/RG.2.2.30983.68009). 4845
10.13140/RG.2.2.28552.29445). 4848
(doi: 10.13140/RG.2.2.10936.21761). 4851

10.13140/RG.2.2.35105.89447). 4854
(doi: 10.13140/RG.2.2.30072.72960). 4857
10.13140/RG.2.2.31147.52003). 4860
10.13140/RG.2.2.32825.24163). 4863
10.13140/RG.2.2.13059.58401). 4866
10.13140/RG.2.2.11172.14720). 4869
2023, (doi: 10.13140/RG.2.2.22011.80165). 4872
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4875
2023, (doi: 10.13140/RG.2.2.10493.84962). 4878
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4881
2023, (doi: 10.13140/RG.2.2.19944.14086). 4884
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4887
(doi: 10.13140/RG.2.2.33103.76968). 4890

(doi: 10.13140/RG.2.2.23037.44003). 4893
(doi: 10.13140/RG.2.2.35646.56641). 4896
10.13140/RG.2.2.18030.48967). 4899
(doi: 10.13140/RG.2.2.13973.81121). 4902
2023, (doi: 10.13140/RG.2.2.34106.47047). 4905
2023, (doi: 10.13140/RG.2.2.31956.88961). 4911
2023, (doi: 10.13140/RG.2.2.15179.67361). 4914
10.13140/RG.2.2.21510.45125). 4917
2023, (doi: 10.13140/RG.2.2.13121.84321). 4920
10.13140/RG.2.2.11758.69441). 4923
2023, (doi: 10.13140/RG.2.2.31891.35367). 4926
10.13140/RG.2.2.19360.87048). 4929

10.13140/RG.2.2.32363.21286). 4932
10.13140/RG.2.2.23266.81602). 4935
10.13140/RG.2.2.19911.37285). 4938
10.13140/RG.2.2.11050.90569). 4941
2023, (doi: 10.13140/RG.2.2.17761.79206). 4944
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4950
(doi: 10.13140/RG.2.2.30182.50241). 4953


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

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



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


10.20944/preprints202301.0282.v1). 5019
10.20944/preprints202301.0267.v1).). 5022

(doi: 10.20944/preprints202301.0265.v1). 5027
prints202301.0262.v1). 5031

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

10.13140/RG.2.2.35061.65767). 5040
10.13140/RG.2.2.18494.15680). 5044

10.13140/RG.2.2.32530.73922). 5048
10.13140/RG.2.2.15897.70243). 5052
10.13140/RG.2.2.32530.73922). 5056
prints202301.0105.v1). 5059
10.13140/RG.2.2.23172.19849). 5066


10.13140/RG.2.2.17385.36968). 5076

Preprints 2023, 2023010044 5079
10.20944/preprints202301.0043.v1). 5082

2023, (doi: 10.13140/RG.2.2.28945.92007). 5085

10.13140/RG.2.2.35774.77123). 5091
10.13140/RG.2.2.29430.88642). 5097

(doi: 10.20944/preprints202212.0549.v1). 5103
10.13140/RG.2.2.19380.94084). 5106

(doi: 10.20944/preprints202212.0500.v1). 5117
10.13140/RG.2.2.20993.12640). 5120



10.13140/RG.2.2.29173.86244). 5135
2023 (doi: 10.5281/zenodo.8052976). 5142
(doi: 10.5281/zenodo.8051368). 5144
(doi: 10.5281/zenodo.8027488). 5146
10.5281/zenodo.8020181). 5148
10.5281/zenodo.7978921). 5150
odo.7943878). 5152
10.5281/zenodo.7943871). 5154
10.5281/zenodo.7923786). 5156

2023 (doi: 10.5281/zenodo.7905287). 5158

2023 (doi: 10.5281/zenodo.7874677). 5162
(doi: 10.5281/zenodo.7857906). 5164
2023 (doi: 10.5281/zenodo.7856329). 5166
10.5281/zenodo.7854561). 5168
2023 (doi: 10.5281/zenodo.7851893). 5170

(doi: 10.5281/zenodo.7835063). 5174
(doi: 10.5281/zenodo.7826705). 5176
2023 (doi: 10.5281/zenodo.7820680). 5178
10.5281/zenodo.7812750). 5180


2023 (doi: 10.5281/zenodo.7807782). 5186
2023 (doi: 10.5281/zenodo.7804449). 5188

(doi: 10.5281/zenodo.7792307). 5192

(doi: 10.5281/zenodo.7790728). 5194
2023 (doi: 10.5281/zenodo.7787712). 5196
10.5281/zenodo.7783791). 5198
10.5281/zenodo.7780123). 5200
(doi: 10.5281/zenodo.7773119). 5202
odo.7637762). 5204
10.5281/zenodo.7766174). 5206
10.5281/zenodo.7762232). 5208
(doi: 10.5281/zenodo.7758601). 5210
10.5281/zenodo.7754661). 5212
10.5281/zenodo.7750995) . 5214
(doi: 10.5281/zenodo.7749875). 5216
10.5281/zenodo.7747236). 5218
10.5281/zenodo.7742587). 5220
(doi: 10.5281/zenodo.7738635). 5222
10.5281/zenodo.7734719). 5224
10.5281/zenodo.7730484). 5226
(doi: 10.5281/zenodo.7730469). 5228

10.5281/zenodo.7722865). 5230
odo.7713563). 5232
odo.7709116). 5234
10.5281/zenodo.7706415). 5236
10.5281/zenodo.7706063). 5238
10.5281/zenodo.7701906). 5240
odo.7700205). 5242
10.5281/zenodo.7694876). 5244
10.5281/zenodo.7679410). 5246
10.5281/zenodo.7675982). 5248
10.5281/zenodo.7672388). 5250
odo.7668648). 5252
10.5281/zenodo.7662810). 5254
10.5281/zenodo.7659162). 5256
odo.7653233). 5258
odo.7653204). 5260
odo.7653142). 5262
odo.7653117). 5264

odo.7651687). 5267
odo.7651619). 5269
odo.7651439). 5271
odo.7650729). 5273
odo.7647868). 5275
odo.7647017). 5277
odo.7644894). 5279
odo.7632923). 5282
odo.7623459). 5284
10.5281/zenodo.7606416). 5286
10.5281/zenodo.7606416). 5288
odo.7606404). 5290
10.5281/zenodo.7580018). 5292
odo.7580018). 5294
odo.7580018). 5296
odo.7579929). 5298

10.5281/zenodo.7563170). 5300
odo.7563164). 5302
odo.7563160). 5304
odo.7563160). 5306
10.5281/zenodo.7563160). 5308
10.5281/zenodo.7557063). 5310
10.5281/zenodo.7557009). 5312
10.5281/zenodo.7539484). 5314
10.5281/zenodo.7523390). 5316
10.5281/zenodo.7523390). 5318
10.5281/zenodo.7523390). 5320
odo.7574952). 5322
10.5281/zenodo.7574992). 5324
odo.7523357). 5326
10.5281/zenodo.7523357). 5328
10.5281/zenodo.7504782). 5330
10.5281/zenodo.7504782). 5332
10.5281/zenodo.7504782). 5334

10.5281/zenodo.7499395). 5336
odo.7499395). 5338
10.5281/zenodo.7499395). 5340
10.5281/zenodo.7497450). 5342
10.5281/zenodo.7497450). 5344
10.5281/zenodo.7494862). 5346
odo.7494862). 5348
10.5281/zenodo.7494862). 5350
10.5281/zenodo.7493845). 5352
odo.7493845). 5354
10.5281/zenodo.7493845). 5356
odo.7539484). 5358
odo.7523390). 5360
odo.7523357). 5362
odo.7504782). 5364
odo.7499395). 5366
odo.7497450). 5368
odo.7494862). 5370

odo.7493845). 5372
odo.7480110). 5374
odo.7378758). 5376
odo.6320305). 5378
odo.6677173). 5380

CHAPTER 24 5381
Cancer In Neutrosophic 5382
SuperHyperGraph 5383
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5384
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5385
disease is considered and as the consequences of the model, some parameters are used. The cells 5386
are under attack of this disease but the moves of the cancer in the special region are the matter 5387
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5388
treatments for this Neutrosophic disease. 5389
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5390
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5391
term Neutrosophic function. 5392
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5393
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5394
move from the cancer is identified by this research. Sometimes the move of the cancer 5395
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5396
about the moves and the effects of the cancer on that region; this event leads us to 5397
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5398
perception on what’s happened and what’s done. 5399
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5400
known and they’ve got the names, and some general Neutrosophic models. The moves 5401
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5402
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5403
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5404
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5405
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5406
Models. 5407
Some cells have been faced with some attacks from the situation which is caused by the 5408
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5409
which in that, the cells could be labelled as some groups and some groups or individuals have 5410
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5411
the embedded situations, the individuals of cells and the groups of cells could be considered 5412
251
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5413
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5414
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5415
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5416
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5417
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5418
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5419
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5420
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5421
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5422
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5423
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5424
out what’s going on this phenomenon. The special case of this disease is considered and as the 5425
consequences of the model, some parameters are used. The cells are under attack of this disease 5426
but the moves of the cancer in the special region are the matter of mind. The recognition of 5427
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5428
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5429
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5432
in the forms of alliances’ styles with the formation of the design and the architecture are 5433
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5434
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5435
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5436
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5437
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5438
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5439
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5440
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5441
and what’s done. There are some specific models, which are well-known and they’ve got the 5442
names, and some general models. The moves and the traces of the cancer on the complex tracks 5443
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5444
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5445
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5446
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5447
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5448
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5449
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5450
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5451
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5452
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5454
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5455
based on the fixed groups of cells or the fixed groups of group of cells? 5456
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5457

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5461
Then the research has taken more motivations to define SuperHyperClasses and to find some 5462
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5463
some instances and examples to make clarifications about the framework of this research. The 5464
general results and some results about some connections are some avenues to make key point of 5465
this research, “Cancer’s Recognition”, more understandable and more clear. 5466
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5467
research on the modeling of the regions where are under the attacks of the cancer to 5468
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5469
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5470
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5471
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5472

instances and literature reviews have taken the whole way through. In this scientific research, 5473
the literature reviews have fulfilled the lines containing the notions and the results. The 5474
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5475
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5476
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5477
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5478
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5479
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5480
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5481
to figure out the background for the SuperHyperNotions. 5482

CHAPTER 25 5483
Neutrosophic Dimension Dominating 5484
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5485
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5486
2023, (doi: 10.13140/RG.2.2.34953.52320). 5487

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5488
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5489
(doi: 10.13140/RG.2.2.33275.80161). 5490
10.13140/RG.2.2.11050.90569). 5493
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5494
10.13140/RG.2.2.17761.79206). 5496
10.13140/RG.2.2.19911.37285). 5499
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5500
10.13140/RG.2.2.23266.81602). 5502
10.13140/RG.2.2.19360.87048). 5505
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5506
10.13140/RG.2.2.32363.21286). 5508
10.13140/RG.2.2.11758.69441). 5511
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5512
10.13140/RG.2.2.31891.35367). 5514
10.13140/RG.2.2.21510.45125). 5517
255
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5518
10.13140/RG.2.2.13121.84321). 5520

CHAPTER 26 5521
New Ideas In Recognition of Cancer And 5522
Neutrosophic SuperHyperGraph By 5523
Dimension Dominating As Hyper Dimple 5524
On Super Dimity 5525
257
CHAPTER 27 5526
ABSTRACT 5527
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDimension 5528

Dominating ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Dimension Dominating 5529
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5530
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperDimension Dominating if 5531
the following expression is called Neutrosophic e-SuperHyperDimension Dominating criteria holds 5532

Neutrosophic re-SuperHyperDimension Dominating if the following expression is called Neutrosophic 5533
e-SuperHyperDimension Dominating criteria holds 5534

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic 5535

v-SuperHyperDimension Dominating if the following expression is called Neutrosophic v- 5536
SuperHyperDimension Dominating criteria holds 5537

Neutrosophic rv-SuperHyperDimension Dominating if the following expression is called Neutrosophic 5538

v-SuperHyperDimension Dominating criteria holds 5539

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Supe- 5540
rHyperDimension Dominating if it’s either of Neutrosophic e-SuperHyperDimension Dominating, Neut- 5541
Neutrosophic rv-SuperHyperDimension Dominating. ((Neutrosophic) SuperHyperDimension Dominat- 5543
ing). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5544
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5545
259
SuperHyperDimension Dominating if it’s either of Neutrosophic e-SuperHyperDimension Dominating, Neut- 5546

Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 5548
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 5549
Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 5550
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 5551
treme SuperHyperDimension Dominating; a Neutrosophic SuperHyperDimension Dominating if it’s either 5552

ating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 5555
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDimension 5558
Dominating; an Extreme SuperHyperDimension Dominating SuperHyperPolynomial if it’s either of 5559
Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dominating, 5560
ating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Supe- 5562
rHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 5563
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHy- 5564

perSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 5565
SuperHyperVertices such that they form the Extreme SuperHyperDimension Dominating; and the 5566
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperDimension 5567
and Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 5570
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5571
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 5572
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5573
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5574
such that they form the Neutrosophic SuperHyperDimension Dominating; and the Neutrosophic power 5575
is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperDimension Dominating if it’s 5576

either of Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dom- 5577
inating, Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension 5578
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5579
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 5580
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and 5581

Extreme SuperHyperVertices such that they form the Extreme SuperHyperDimension Dominating; a 5582
Neutrosophic V-SuperHyperDimension Dominating if it’s either of Neutrosophic e-SuperHyperDimension 5583
Dominating, Neutrosophic re-SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension 5584
Dominating, and Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic 5585
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutro- 5586
sophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5587

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 5588
they form the Neutrosophic SuperHyperDimension Dominating; an Extreme V-SuperHyperDimension 5589

and Neutrosophic rv-SuperHyperDimension Dominating and C(N SHG) for an Extreme SuperHyper- 5592
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 5593
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Su- 5594
perHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 5595
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 5596
treme SuperHyperDimension Dominating; and the Extreme power is corresponded to its Extreme 5597
coefficient; a Neutrosophic SuperHyperDimension Dominating SuperHyperPolynomial if it’s either 5598

Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension Dominat- 5600
ing and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5601
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 5603
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 5604

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5605
SuperHyperDimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 5606
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 5607
namely, a SuperHyperDimension Dominating and Neutrosophic SuperHyperDimension Dominating. Two 5608
different types of SuperHyperDefinitions are debut for them but the research goes further 5609
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers 5613
are featured. The definitions are followed by the examples and the instances thus the cla- 5614
rifications are driven with different tools. The applications are figured out to make sense 5615
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 5616
under research to figure out the challenges make sense about ongoing and upcoming research. 5617
The special case is up. The cells are viewed in the deemed ways. There are different types 5618
of them. Some of them are individuals and some of them are well-modeled by the group of 5619
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 5620
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 5621
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 5622
these complex and dense SuperHyperModels open up some avenues to research on theoret- 5623
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 5624
It’s also officially collected in the form of some questions and some problems. Assume a 5625
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDimension Dominating is 5626
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5627
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5630
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDimension Dominating is a max- 5631
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5632
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5633
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5634
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 5635
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5636
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperDimension 5637

Dominating . Since there’s more ways to get type-results to make a SuperHyperDimension Dominating 5638
more understandable. For the sake of having Neutrosophic SuperHyperDimension Dominating, there’s 5639
a need to “redefine” the notion of a “SuperHyperDimension Dominating ”. The SuperHyperVertices 5640
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 5642
SuperHyperDimension Dominating . It’s redefined a Neutrosophic SuperHyperDimension Dominating if the 5643
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 5644
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 5645
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 5646
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 5647
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 5648
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 5649
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 5650
based on a SuperHyperDimension Dominating . It’s the main. It’ll be disciplinary to have the 5651
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 5652
SuperHyperDimension Dominating until the SuperHyperDimension Dominating, then it’s officially called a 5653
“SuperHyperDimension Dominating” but otherwise, it isn’t a SuperHyperDimension Dominating . There 5654
are some instances about the clarifications for the main definition titled a “SuperHyperDimension 5655
Dominating ”. These two examples get more scrutiny and discernment since there are characterized 5656
in the disciplinary ways of the SuperHyperClass based on a SuperHyperDimension Dominating . For 5657
the sake of having a Neutrosophic SuperHyperDimension Dominating, there’s a need to “redefine” 5658
the notion of a “Neutrosophic SuperHyperDimension Dominating” and a “Neutrosophic SuperHy- 5659
perDimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5660
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5661
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 5662
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperDimension 5663
Dominating are redefined to a “Neutrosophic SuperHyperDimension Dominating” if the intended Table 5664
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 5665
ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperDimension Dominating 5666
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperDimension 5668

Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyper- 5669
Wheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperDimension Dominating”, 5670
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Super- 5671
HyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 5672
SuperHyperGraph has a “Neutrosophic SuperHyperDimension Dominating” where it’s the strongest 5673
[the maximum Neutrosophic value from all the SuperHyperDimension Dominating amid the maximum 5674
value amid all SuperHyperVertices from a SuperHyperDimension Dominating .] SuperHyperDimension 5675
Dominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of 5676
elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 5677
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 5678
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperDimension 5679
Dominating if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s 5680
SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s Supe- 5681
rHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5682
and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s 5683

SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHy- 5684
perEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in 5685
common; it’s a SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5686
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. 5687
The SuperHyperModel proposes the specific designs and the specific architectures. The Super- 5688
HyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In 5689
this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled 5690
as “SuperHyperVertices” and the common and intended properties between “specific” cells and 5691
“specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful 5692
to have some degrees of determinacy, indeterminacy, and neutrality to have more precise Super- 5693
HyperModel which in this case the SuperHyperModel is called “Neutrosophic”. In the future 5694
research, the foundation will be based on the “Cancer’s Recognition” and the results and the 5695
definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term 5696
perception on what’s happened and what’s done. There are some specific models, which are 5702
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 5703
moves and the traces of the cancer on the complex tracks and between complicated groups of 5704
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperDimension Dominating, 5705
is to find either the longest SuperHyperDimension Dominating or the strongest SuperHyperDimension 5707
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperDimension Dominat- 5708
ing, called SuperHyperDimension Dominating, and the strongest SuperHyperDimension Dominating, called 5709
Neutrosophic SuperHyperDimension Dominating, some general results are introduced. Beyond that 5710
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5711
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5712
SuperHyperDimension Dominating. There isn’t any formation of any SuperHyperDimension Dominating 5713
but literarily, it’s the deformation of any SuperHyperDimension Dominating. It, literarily, deforms 5714
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperDimension Dominating 5715
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5716
Keywords: Neutrosophic SuperHyperGraph, SuperHyperDimension Dominating, Cancer’s Neutro- 5717
sophic Recognition 5718


CHAPTER 28 5720
Applied Notions Under The Scrutiny Of 5721
The Motivation Of This Scientific 5722
Research 5723
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5724
try to bring the motivations in the narrative ways. Some cells have been faced with some 5725
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5726
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5727
as some groups and some groups or individuals have excessive labels which all are raised from 5728
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5729
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5730
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5731
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5732
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5733
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5734
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5735
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5736
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5737
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5738
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5739
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5740
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5741
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5742
case of this disease is considered and as the consequences of the model, some parameters are used. 5743
The cells are under attack of this disease but the moves of the cancer in the special region are the 5744
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5745
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5746
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5747
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 5748
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 5749
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5750
the architecture are formally called “ SuperHyperDimension Dominating” in the themes of jargons 5751
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5752
265
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5753
perception on what’s happened and what’s done. There are some specific models, which 5759
are well-known and they’ve got the names, and some general models. The moves and the 5760
traces of the cancer on the complex tracks and between complicated groups of cells could be 5761
fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperDimension Dominating, SuperHyperStar, 5762
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5763
the optimal SuperHyperDimension Dominating or the Neutrosophic SuperHyperDimension Dominating in 5764
those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 5765
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 5766
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 5767
style of a SuperHyperDimension Dominating. There isn’t any formation of any SuperHyperDimension 5768
Dominating but literarily, it’s the deformation of any SuperHyperDimension Dominating. It, literarily, 5769
deforms and it doesn’t form. 5770
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find 5771
the “ amount of SuperHyperDimension Dominating” of either individual of cells or the groups of cells 5772
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDimension 5773
Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5774
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5775
these messy and dense SuperHyperModels where embedded notions are illustrated? 5776
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5777
it motivates us to define different types of “ SuperHyperDimension Dominating” and “Neutrosophic 5778
SuperHyperDimension Dominating” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5779

Then the research has taken more motivations to define SuperHyperClasses and to find some 5780
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5781
some instances and examples to make clarifications about the framework of this research. The 5782
general results and some results about some connections are some avenues to make key point of 5783
this research, “Cancer’s Recognition”, more understandable and more clear. 5784
The framework of this research is as follows. In the beginning, I introduce basic definitions 5785
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5786
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5787
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5788
review literature are applied to make sense about what’s going to figure out about the upcoming 5789
sections. The main definitions and their clarifications alongside some results about new notions, 5790
SuperHyperDimension Dominating and Neutrosophic SuperHyperDimension Dominating, are figured out in 5791
sections “ SuperHyperDimension Dominating” and “Neutrosophic SuperHyperDimension Dominating”. In 5792
the sense of tackling on getting results and in Dimension Dominating to make sense about continuing 5793
the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5794
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5795
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5796
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5797

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5798
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5799
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5800
and as concluding and closing section of theoretical research are contained in the section “General 5801
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5802
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5803
“ SuperHyperDimension Dominating”, “Neutrosophic SuperHyperDimension Dominating”, “Results on 5804

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5805
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5806
this research and going to figure out the word “best” as the description and adjective for this 5807
research as presented in section, “ SuperHyperDimension Dominating”. The keyword of this research 5808
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5809
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5810
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5811
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5812
research in the terms of “questions” and “problems” to make sense to figure out this research in 5813
featured style. The advantages and the limitations of this research alongside about what’s done 5814
in this research to make sense and to get sense about what’s figured out are included in the 5815
section, “Conclusion and Closing Remarks”. 5816

CHAPTER 29 5817
Neutrosophic Preliminaries Of This 5818
Scientific Research On the Redeemed 5819
Ways 5820
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5821
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5822

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5823
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5824
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5825
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5826
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5827
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5828

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

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

Let X be a Dimension Dominating 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}.
269

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 5833
2.5,p.2). 5834
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5835
S = (V, E), where 5836
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 5837
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 5840
0
1, 2, . . . , n ); 5841
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5842
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5843

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5872
x, y, z, w ∈ [0, 1]: 5873
(i) 1 ⊗ x = x; 5874
(ii) x ⊗ y = y ⊗ x; 5875
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5876
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5877

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

where 5880

1, 2, . . . , n0 ); 5885
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5886
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5887
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5888
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5889
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5901
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5902
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5903
SuperEdge; 5909
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5912
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5913
makes the patterns and regularities. 5914
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5915
of elements of SuperHyperEdges are the same. 5916

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5917
makes to have SuperHyperUniform more understandable. 5918
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5919
Classes as follows. 5920
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5921
two given SuperHyperEdges with two exceptions; 5922
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5923
SuperHyperEdges; 5924
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5925
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5926
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5927
in common; 5928
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5929
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5930
SuperHyperEdge in common; 5931
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5932
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5933
SuperVertex. 5934
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 5935
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5936
(i) Vi , Vi+1 ∈ Ei0 ; 5937
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5938
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5939
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5940
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5941
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5942
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5943
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5944
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5946
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5947
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5948
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5949
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5950
perPath . 5951
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 5952
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5953
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5954
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5955
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5956
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5957

(ix) Neutrosophic t-Connective if T (E) ≥ maximum number of Neutrosophic t-strength 5961

(x) Neutrosophic i-Connective if I(E) ≥ maximum number of Neutrosophic i-strength 5964


(xi) Neutrosophic f-Connective if F (E) ≥ maximum number of Neutrosophic f-strength 5967

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5970
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5971
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5972
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperDimension Dominat- 5973

ing). 5974
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutro- 5975
sophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 5976
is called 5977
(i) Neutrosophic e-SuperHyperDimension Dominating if the following expression is called 5978

Neutrosophic e-SuperHyperDimension Dominating criteria holds 5979

(ii) Neutrosophic re-SuperHyperDimension Dominating if the following expression is called 5980

Neutrosophic re-SuperHyperDimension Dominating criteria holds 5981

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 5982
(iii) Neutrosophic v-SuperHyperDimension Dominating if the following expression is called 5983


(iv) Neutrosophic rv-SuperHyperDimension Dominating if the following expression is called 5985

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 5987
(v) Neutrosophic SuperHyperDimension Dominating if it’s either of Neutrosophic e- 5988

v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension Dominating. 5990
Definition 29.0.19. ((Neutrosophic) SuperHyperDimension Dominating). 5991


(i) an Extreme SuperHyperDimension Dominating if it’s either of Neutrosophic e- 5994

SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 5999
Dominating; 6001
(ii) a Neutrosophic SuperHyperDimension Dominating if it’s either of Neutrosophic e- 6002

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 6005
Dominating; 6009
(iii) an Extreme SuperHyperDimension Dominating SuperHyperPolynomial if it’s either of 6010

Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension Dominat- 6011
ing, Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv-SuperHyperDimension 6012

Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 6013
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 6014
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 6015
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges 6016
Dominating; and the Extreme power is corresponded to its Extreme coefficient; 6018
(iv) a Neutrosophic SuperHyperDimension Dominating SuperHyperPolynomial 6019

SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension Dominating, and Neut- 6021

rosophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 6022
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 6023
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 6024
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 6028
(v) an Extreme V-SuperHyperDimension Dominating if it’s either of Neutrosophic e- 6029

Dominating; 6036

(vi) a Neutrosophic V-SuperHyperDimension Dominating if it’s either of Neutrosophic e- 6037

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neut- 6040
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHy- 6041
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 6042
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 6043
(vii) an Extreme V-SuperHyperDimension Dominating SuperHyperPolynomial if it’s either 6045

of Neutrosophic e-SuperHyperDimension Dominating, Neutrosophic re-SuperHyperDimension 6046
Dominating, Neutrosophic v-SuperHyperDimension Dominating, and Neutrosophic rv- 6047
SuperHyperDimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 6048

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 6049
cients defined as the Extreme number of the maximum Extreme cardinality of the 6050
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 6051
form the Extreme SuperHyperDimension Dominating; and the Extreme power is corresponded 6053
(viii) a Neutrosophic SuperHyperDimension Dominating SuperHyperPolynomial 6055

SuperHyperDimension Dominating, Neutrosophic v-SuperHyperDimension Dominating, and Neutro- 6057
sophic rv-SuperHyperDimension Dominating and C(N SHG) for a Neutrosophic SuperHyper- 6058
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutro- 6059
sophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 6060
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 6061
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neut- 6062
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 6064
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDimension Dominating). 6065

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6066
(i) an δ−SuperHyperDimension Dominating is a Neutrosophic kind of Neutrosophic SuperHy- 6067

perDimension Dominating such that either of the following expressions hold for the Neutrosophic 6068
cardinalities of SuperHyperNeighbors of s ∈ S : 6069
|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 6070

(29.1), holds if S is an δ−SuperHyperDefensive; 6071
(ii) a Neutrosophic δ−SuperHyperDimension Dominating is a Neutrosophic kind of Neut- 6072

rosophic SuperHyperDimension Dominating such that either of the following Neutrosophic 6073
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6074
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4


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

136TBL4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 6075

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6076
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6078
there’s the usage of the position of labels to assign to the values. 6080
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6082
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6083
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6084
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 6086
sophic SuperHyperPath , SuperHyperDimension Dominating, SuperHyperStar, SuperHyperBipart- 6087
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 6088
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 6089
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 6090
perHyperWheel if the Table (29.2) holds. 6091
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperDimension Dominating. 6092

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperDimension Dominating 6093
more Neutrosophicly understandable. 6094
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperDimension Dominating”. The 6096
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 6097


136TBL1
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 6098
6099
136DEF1 Definition 29.0.23. Assume a SuperHyperDimension Dominating. It’s redefined a Neutrosophic 6100
SuperHyperDimension Dominating if the Table (29.3) holds. 6101

CHAPTER 30 6102
Neutrosophic SuperHyper But As Dimension Dominating 6103
Super Forms 6105
Definition 30.0.1. (Neutrosophic event). 6106
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6107
is a probability Dimension Dominating. Any Neutrosophic k-subset of A of V is called Neutrosophic 6108
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 6109
following expression is called Neutrosophic probability of A. 6110
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6111

is a probability Dimension Dominating. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 6113

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6118
a probability Dimension Dominating. Any k-function Dimension Dominating like E is called Neutrosophic 6119
k-Variable. If k = 2, then any 2-function Dimension Dominating like E is called Neutrosophic 6120
Variable. 6121
The notion of independent on Neutrosophic Variable is likewise. 6122
Definition 30.0.4. (Neutrosophic Expectation). 6123
281
is a probability Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6125

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6126
criteria 6127
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6128
is a probability Dimension Dominating. A Neutrosophic number is called Neutrosophic Crossing 6130
if the following expression is called Neutrosophic Crossing criteria 6131
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). 6132
Consider S = (V, E) is a probability Dimension Dominating. Let m and n propose special Dimension 6133
Dominating. Then with m ≥ 4n, 6134
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 Dimension Dominating 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: 6135
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
6136
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6137
the plane, and let l be the Neutrosophic number√of SuperHyperLines in the plane passing through 6139
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6140
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 6141

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

the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 6149
k < 5n4/3 . 6150
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6151
S = (V, E) is a probability Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle around 6152

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6159
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6160
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6161
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6162
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6163
4/3 4/3
k < 4n + n < 5n . 6164
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6165
Consider S = (V, E) is a probability Dimension Dominating. Let X be a nonnegative Neutrosophic 6166
Variable and t a positive real number. Then 6167
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. 6168
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6169
Consider S = (V, E) is a probability Dimension Dominating. Let Xn be a nonnegative integer-valued 6170
variable in a probability Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 6171

P (Xn = 0) → 1 as n → ∞. 6172
Proof. 6173
Consider S = (V, E) is a probability Dimension Dominating. A special SuperHyperGraph in Gn,p 6175
almost surely has stability number at most d2p−1 log ne. 6176

S = (V, E) is a probability Dimension Dominating. A special SuperHyperGraph in Gn,p is up. Let 6178
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 6179
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 6180
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 6181
of the Neutrosophic SuperHyperGraph G. 6182
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6183
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6184
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 6185
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6186
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: 6187
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6188
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 6189
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6190
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6191
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6192
Definition 30.0.12. (Neutrosophic Variance). 6193
is a probability Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6195
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6196
criteria 6197
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Dimension Dominating. Let X be a Neutrosophic Variable and 6199
let t be a positive real number. Then 6200
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Dimension Dominating. Let X be a Neutrosophic Variable and let t be a 6202
positive real number. Then 6203
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6204
Consider S = (V, E) is a probability Dimension Dominating. Let Xn be a Neutrosophic Variable in a 6206

probability Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 6207
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 6209
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6210
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6211
Consider S = (V, E) is a probability Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6213
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 6214
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6215
S = (V, E) is a probability Dimension Dominating. As in the proof of related Theorem, the result is 6217
Consider S = (V, E) is a probability Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be as 6220
defined in previous Theorem. Then either: 6221
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6222
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6223
Definition 30.0.17. (Neutrosophic Threshold). 6226
is a probability Dimension Dominating. Let P be a monotone property of SuperHyperGraphs (one 6228
which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for 6229
P is a function f (n) such that: 6230
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6231
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6232

Definition 30.0.18. (Neutrosophic Balanced). 6233

is a probability Dimension Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6235
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6236
SubSuperHyperGraph is called Neutrosophic Balanced. 6237
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6238

(V, E). Consider S = (V, E) is a probability Dimension Dominating. Let F be a nonempty 6239
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6240
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6241
SubSuperHyperGraph. 6242
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6245
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6246
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6247

SuperHyperDimension Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6248
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6249
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6250

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6251
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6252
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6253
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6254
Neutrosophic SuperHyperDimension Dominating. 6255
C(N SHG)Neutrosophic Dimension Dominating =

{}.
C(N SHG)Neutrosophic Dimension Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Dimension Dominating =
{}.
C(N SHG)Neutrosophic V-Dimension Dominating SuperHyperPolynomial
= 0z 0 .
6256

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

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

Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperDimension 6264

Dominating. 6265

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


{}.
= 0z 0 .
{}.



= 0z 0 .
6270


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






{EN SHG − {Ei }}.
= z 6−c .
{VN SHG − {Vi }}.
= z 7−c .
6278


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



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


{EN SHG − {Ei }}.
= z 6−c .
{VN SHG − {Vi }}.
= z 7−c .
6286




{E1 , E2 }.
= z 3−a .
{VN SHG − {V1 , V11 }}.
= z 3−a .
6290


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


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


{EN SHG − {E1 , E5 }}.
= z 3−a .
{VN SHG − {V1 , V11 }}.
= z 3−a .
6298







{EN SHG − {E1 , E6 }}.
= z 3−a .
{VN SHG − {V1 , V5 }}.
= z 3−a .
6302


{EN SHG − {E1 , E2 }}.


= z 2−a .
{VN SHG − {V1 , V5 }}.
= z 5−a .
6306


{EN SHG − {E6 , E9 }}.
= z 2−a .
{VN SHG − {V1 , V5 }}.
= z 3−a .
6310




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


{E3i+1 }1i=0 .


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


{E3i+1 }1i=0 .


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


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







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


{E3i+1 }3i=0 .



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


{EN SHG − {E1 }}.
= z 3−a .
{VN SHG − {V1 , {U2 , V2 , W2 }}.


= z 3−a .
6338


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


Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.3) 95NHG1

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


Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.3) 95NHG2
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6349
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6350
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6351
of them. 6352
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6353
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6354
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6355
Neutrosophic quasi-R-Dimension Dominating minus all Neutrosophic SuperHypeNeighbor to some of 6356
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6357
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6358
quasi-R-Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6359
all of them. 6360
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-Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Dimension Dominating is at 6361
least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6362
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6363
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6364
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Dimension 6365

Dominating in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 6366
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6367
SuperHyperVertices are contained in a Neutrosophic R-Dimension Dominating. 6368
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Dimension Dominating 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-Dimension Dominating with the least Neutrosophic cardinality, 6369
the lower sharp Neutrosophic bound for cardinality. 6370
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6371

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−DimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−DimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−DimensionDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Dimension Dominating. In other words, the least cardinality, the lower 6373
sharp bound for the cardinality, of a Neutrosophic type-result-Dimension Dominating is the cardinality 6374
of 6375

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−DimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−DimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−DimensionDominatingSuperHyperP 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-Dimension Dominating 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-Dimension Dominating. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Dimension Dominating 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-Dimension Dominating. 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-Dimension Dominating decorates the Neutrosophic
SuperHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic
style implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutro-
sophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower
Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHy-
perVertices 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-Dimension Dominating. Since at least two Neutrosophic Super-
HyperVertices involve to make a title in the Neutrosophic background of the Neutrosophic

SuperHyperGraph. The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic

SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the Neutrosophic
version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious
Neutrosophic SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Neutrosophic adjective for the initial
Neutrosophic SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neut-
rosophic version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph
is said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting.
With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one
Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Dimension Dominating has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Dimension
Dominating has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge. Assume a
Neutrosophic SuperHyperSet V \V \{z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic
R-Dimension Dominating since either the Neutrosophic SuperHyperGraph is an obvious Neutrosophic
SuperHyperModel thus it never happens since there’s no Neutrosophic usage of this Neutro-
sophic 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-Dimension Dominating” 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-Dimension Dominating 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-Dimension Dominating 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-Dimension Dominating.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Dimension Dominating. 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-Dimension Dominating is
{aE , bE , cE , . . . , zE } .

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

z
and
is formalized with mathematical literatures on the Neutrosophic R-Dimension Dominating. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6376
Neutrosophic R-Dimension Dominating =

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

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Dimension Dominating where E ∈ EESHG:(V,E) is

fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Dimension Dominating, 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-Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Dimension Domin- 6378
ating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6379
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Super- 6380
HyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6381
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6382
to Neutrosophic Dimension Dominating in some cases but the maximum number of the Neutrosophic 6383
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6384
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Dimension Dominating. 6385
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6386
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6387

the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6388
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6389
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6390
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6391
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6392
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6393
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6394

SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6395
Neutrosophic quasi-R-Dimension Dominating where the Neutrosophic completion of the Neutrosophic 6396
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Dimension Dominating. The 6397
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6398
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHy- 6399
perCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6400
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6401
timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6402
minimum Neutrosophic style of the embedded Neutrosophic R-Dimension Dominating. The interior 6403
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6404
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6405
common connections, more precise and more formal, the perfect unique connections inside the 6406
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose 6407
the Neutrosophic R-Dimension Dominating. Thus Neutrosophic exterior SuperHyperVertices could be 6408
used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6409
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6410
embedded Neutrosophic Dimension Dominating, there’s the usage of exterior Neutrosophic SuperHy- 6411
perVertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6412
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6413
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one 6414
SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the 6415
Neutrosophic R-Dimension Dominating. The Neutrosophic R-Dimension Dominating with the exclusion of 6416
the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and 6417
with other terms, the Neutrosophic R-Dimension Dominating with the inclusion of all Neutrosophic 6418
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Dimension 6419
Dominating. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6420
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6421
the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of 6422
any given Neutrosophic quasi-R-Dimension Dominating minus all Neutrosophic SuperHypeNeighbor 6423
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6424
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6425
an Neutrosophic quasi-R-Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor to some 6426
of them but not all of them. 6427
The main definition of the Neutrosophic R-Dimension Dominating has two titles. a Neut- 6428
rosophic quasi-R-Dimension Dominating and its corresponded quasi-maximum Neutrosophic R- 6429

SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 6430
ber, there’s a Neutrosophic quasi-R-Dimension Dominating with that quasi-maximum Neutrosophic 6431
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 6432
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 6433

lead us to take the collection of all the Neutrosophic quasi-R-Dimension Dominatings for all Neut- 6434
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 6435
of the Neutrosophic Dimension Dominating ends up but this essence starts up in the terms of the 6436
Neutrosophic quasi-R-Dimension Dominating, again and more in the operations of collecting all the 6437
Neutrosophic quasi-R-Dimension Dominatings acted on the all possible used formations of the Neut- 6438
rosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic number is 6439
considered as the equivalence class for all corresponded quasi-R-Dimension Dominatings. Let 6440
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Dimension Dominating be a Neutro- 6441
sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Dimension Dominating. Then 6442
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Dimension Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Dimension Dominating is re-formalized 6443
and redefined as follows. 6444
GNeutrosophic Dimension Dominating ∈ ∪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 6445
definition for the Neutrosophic Dimension Dominating. 6446
GNeutrosophic Dimension Dominating =

{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 Dimension 6447
poses the upcoming expressions.
Dominating 6448

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


To translate the statement to this mathematical literature, the formulae will be revised. 6449

= max zNeutrosophic Number

And then, 6450


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


6452

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

6453



6454


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6455
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Supe- 6456
rHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident 6457
to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi- 6458
Dimension Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Dimension Dominating” 6459
since “Neutrosophic Quasi-Dimension Dominating” happens “Neutrosophic Dimension Dominating” in a 6460
Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic Supe- 6461
rHyperNeighborhood” may not happens “Neutrosophic Dimension Dominating” in a Neutrosophic 6462
SuperHyperGraph as initial framework and preliminarily background since there are some am- 6463
biguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, 6464
the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Dimension Dominating”, 6465
and “Neutrosophic Dimension Dominating” are up. 6466
Thus, let 6467
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6468
GNeutrosophic Dimension Dominating be a Neutrosophic number, a Neutrosophic SuperHyperNeigh- 6469
borhood and a Neutrosophic Dimension Dominating and the new terms are up. 6470
GNeutrosophic Dimension Dominating ∈ ∪zNeutrosophic Number

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

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


∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |

6473

And with go back to initial structure, 6474
GNeutrosophic Dimension Dominating ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6475

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6476


6477



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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Dimension Dominating 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 Dimension Dominating 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 Dimension Dominating is up. The obvious simple
Neutrosophic type-SuperHyperSet called the Neutrosophic Dimension Dominating 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-Dimension Dominating is up. To sum them
up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Dimension

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

Dominating, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6478
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6479
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6480
type-SuperHyperSet called the 6481
“Neutrosophic R-Dimension Dominating” 6482
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6483
Neutrosophic R-Dimension Dominating, 6484
is only and only

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHy-

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

if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6488
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6489
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6490
them. 6491
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6492
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6493

all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6494
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6495
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6496
Consider there’s a Neutrosophic R-Dimension Dominating with the least cardinality, the lower 6497
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6498
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6499
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6500
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6501
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Dimension Dominating. Since it doesn’t 6502
have 6503
6504
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6505

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6506
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6507
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6508
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Dimension 6509
Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6510
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6511

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6512
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6513
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6514
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6515
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6516
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious Neutro- 6517
sophic R-Dimension Dominating, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet 6518
of the Neutrosophic R-Dimension Dominating, VESHE , is a Neutrosophic SuperHyperSet, VESHE , 6519
includes only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs 6520
are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6521
ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6522
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6523
SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6524

SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6525
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Dimension Dominating only 6526
contains all interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic SuperHy- 6527
perVertices from the unique Neutrosophic SuperHyperEdge where there’s any of them has all 6528
possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHyperNeigh- 6529
borhoods in with no exception minus all Neutrosophic SuperHypeNeighbors to some of them 6530
not all of them but everything is possible about Neutrosophic SuperHyperNeighborhoods and 6531
Neutrosophic SuperHyperNeighbors out. 6532
The SuperHyperNotion, namely, Dimension Dominating, is up. There’s neither empty SuperHy- 6533
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6534
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6535
Neutrosophic Dimension Dominating. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6536


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

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


= az s + bz t .
Is an Neutrosophic Dimension Dominating C(ESHG) for an Neutrosophic SuperHyperGraph 6540

ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6541
6542
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6544
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6545

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6546
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6547
Neutrosophic Dimension Dominating is up. The obvious simple Neutrosophic type-SuperHyperSet 6548
called the Neutrosophic Dimension Dominating is a Neutrosophic SuperHyperSet includes only two 6549
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6550
SuperHyperEdges[SuperHyperVertices], 6551

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- 6552
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6553
Dimension Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6554
SuperHyperEdges[SuperHyperVertices], 6555

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 Dimen- 6556

sion Dominating. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6557

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Dimension Dominating C(ESHG) for an Neutrosophic SuperHyperGraph 6559

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6560
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6561
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Dimension Dominating and 6562
it’s an Neutrosophic Dimension Dominating. Since it’s 6563

6564
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6566
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6567
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6568
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6569

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

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 Dimension 6571

Dominating , not: 6572

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

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- 6574
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6575
Neutrosophic type-SuperHyperSet called the 6576
“Neutrosophic Dimension Dominating ” 6577
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6578
Neutrosophic Dimension Dominating , 6579
is only and only 6580

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

CHAPTER 31 6582
The Neutrosophic Departures on The 6583
Theoretical Results Toward Theoretical 6584
Motivations 6585
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6586
Neutrosophic SuperHyperClasses. 6587
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6588

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

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

6595
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6596
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6597
SuperHyperModel (31.1), is the SuperHyperDimension Dominating. 6598
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6599

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


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

6606
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6607
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6608
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDimension Dominating. 6609

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

Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.7) 136NSHG19a
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6610

{EN SHG − {E1 , E2 }}.
= z 3−a .
{VN SHG − {ViIN T ERN AL , CEN T ER}}.
= z 3−a .
Proof. Let 6611
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6612
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

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

6617
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6618
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6619
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6620
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6621
the Neutrosophic SuperHyperDimension Dominating. 6622
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6623

Then 6624

= z b−a .
= z b−a .
Proof. Let 6625
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6626
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). 6627

only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6633
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperDimension Dominating in the Example (42.0.11) 136NSHG21a
is a longest SuperHyperDimension Dominating taken from a connected Neutrosophic SuperHyperBi- 6635

partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6636
of-SuperHyperPart SuperHyperEdges are attained in any solution 6637
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6639
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6640
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6641

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6642
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6643
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6645
Then 6646


= z b−a .
= z b−a .
Proof. Let 6647
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6648
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperDimension Dominating taken from a connected Neutrosophic SuperHyper- 6649

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

only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6655
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6657
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6658
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 6662
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6663
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6664
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6665
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDimension Dominating. 6666
∗
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ). 6667
Then, 6668

|E |
{E3i+2 }i=0ESHP ∪ E ∗ .
| min |E | |Ei |
{E3i+2 } ESHP ∪E ∗
=z i=0 .
|E |
EXT ERN AL
{V2i+2 }i=0ESHP ∪ V ∗ .
| min |E | |Vi |
{V EXT ERN AL } ESHP ∪V ∗
=z 2i+2 i=0 .

Proof. Let 6669
P :
CEN T ER, E2∗
6670
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperDimension Dominating taken from a connected Neutrosophic SuperHyper- 6671

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

Then there’s at least one SuperHyperDimension Dominating. Thus the notion of quasi isn’t up and 6675
the SuperHyperNotions based on SuperHyperDimension Dominating could be applied. The unique 6676
embedded SuperHyperDimension Dominating proposes some longest SuperHyperDimension Dominating 6677
excerpt from some representatives. The latter is straightforward. 6678
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6679
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6680
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6681
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6682
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDimension Dominating. 6683

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperDimension Dominating in the Neutrosophic Example (42.0.15) 136NSHG23a

CHAPTER 32 6684
The Surveys of Mathematical Sets On 6685
The Results But As The Initial Motivation 6686
For the SuperHyperDimension Dominating, Neutrosophic SuperHyperDimension Dominating, and the 6687
Neutrosophic SuperHyperDimension Dominating, some general results are introduced. 6688
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperDimension Dominating is “redefined” 6689
on the positions of the alphabets. 6690
Corollary 32.0.2. Assume Neutrosophic SuperHyperDimension Dominating. Then 6691
N eutrosophic SuperHyperDimensionDominating =
{theSuperHyperDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperDimensionDominating
|N eutrosophiccardinalityamidthoseSuperHyperDimensionDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6692
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6693
the neutrality, for i = 1, 2, 3, respectively. 6694
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6695
alphabet. Then the notion of Neutrosophic SuperHyperDimension Dominating and SuperHyperDimension 6696
Dominating coincide. 6697
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6698
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6699
SuperHyperDimension Dominating if and only if it’s a SuperHyperDimension Dominating. 6700
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6701
of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 6702
SuperHyperDimension Dominating if and only if it’s a longest SuperHyperDimension Dominating. 6703
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6704
identical letter of the alphabet. Then its Neutrosophic SuperHyperDimension Dominating is its 6705
SuperHyperDimension Dominating and reversely. 6706
335
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperDimension Dominating, 6707

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6708
identical letter of the alphabet. Then its Neutrosophic SuperHyperDimension Dominating is its 6709
SuperHyperDimension Dominating and reversely. 6710
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic Super- 6711
HyperDimension Dominating isn’t well-defined if and only if its SuperHyperDimension Dominating isn’t 6712
well-defined. 6713
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6714

Neutrosophic SuperHyperDimension Dominating isn’t well-defined if and only if its SuperHyperDimension 6715
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6718

Neutrosophic SuperHyperDimension Dominating isn’t well-defined if and only if its SuperHyperDimension 6719
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6721
perDimension Dominating is well-defined if and only if its SuperHyperDimension Dominating is well-defined. 6722
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6723

Neutrosophic SuperHyperDimension Dominating is well-defined if and only if its SuperHyperDimension 6724
Dominating is well-defined. 6725

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6727
Neutrosophic SuperHyperDimension Dominating is well-defined if and only if its SuperHyperDimension 6728

Dominating is well-defined. 6729
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6730
(i) : the dual SuperHyperDefensive SuperHyperDimension Dominating; 6731
(ii) : the strong dual SuperHyperDefensive SuperHyperDimension Dominating; 6732
(iii) : the connected dual SuperHyperDefensive SuperHyperDimension Dominating; 6733
(iv) : the δ-dual SuperHyperDefensive SuperHyperDimension Dominating; 6734
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDimension Dominating; 6735
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDimension Dominating. 6736
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6737
(iii) : the connected defensive SuperHyperDefensive SuperHyperDimension Dominating; 6740

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

independent SuperHyperSet is 6745
(iii) : the connected SuperHyperDefensive SuperHyperDimension Dominating; 6748
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6752

Graph which is a SuperHyperDimension Dominating/SuperHyperPath. Then V is a maximal 6753
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDimension Dominating; 6757
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDimension Dominating; 6758
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDimension Dominating; 6759
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6761
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6762
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDimension Dominating; 6766
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDimension Dominating; 6767
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDimension Dominating; 6768
Graph which is a SuperHyperDimension Dominating/SuperHyperPath. Then the number of 6771

(i) : the SuperHyperDimension Dominating; 6772
(ii) : the SuperHyperDimension Dominating; 6773
(iii) : the connected SuperHyperDimension Dominating; 6774
(iv) : the O(ESHG)-SuperHyperDimension Dominating; 6775
(v) : the strong O(ESHG)-SuperHyperDimension Dominating; 6776
(vi) : the connected O(ESHG)-SuperHyperDimension Dominating. 6777
coincide. 6779

Graph which is a SuperHyperWheel. Then the number of 6781
(i) : the dual SuperHyperDimension Dominating; 6782
(ii) : the dual SuperHyperDimension Dominating; 6783
(iii) : the dual connected SuperHyperDimension Dominating; 6784
(iv) : the dual O(ESHG)-SuperHyperDimension Dominating; 6785
(v) : the strong dual O(ESHG)-SuperHyperDimension Dominating; 6786
(vi) : the connected dual O(ESHG)-SuperHyperDimension Dominating. 6787
coincide. 6789
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6790

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6802
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6803
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6804
SuperHyperPart is a 6805
(iv) : δ-SuperHyperDefensive SuperHyperDimension Dominating; 6809
(v) : strong δ-SuperHyperDefensive SuperHyperDimension Dominating; 6810
(vi) : connected δ-SuperHyperDefensive SuperHyperDimension Dominating. 6811
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6813

plete SuperHyperMultipartite. Then Then the number of 6814
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6821
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6822
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6824
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6825
(iv) : SuperHyperDimension Dominating; 6829

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6832
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6833
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6834
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6835

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6843
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6844
of dual 6845
(iv) : 0-SuperHyperDefensive SuperHyperDimension Dominating; 6849

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6853

SuperHyperDimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6855
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6856
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDimension Dominating; 6860
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDimension Dominating; 6861
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDimension Dominating. 6862


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


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

a dual SuperHyperDefensive SuperHyperDimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 6878
(i) v ∈ Ns (x); 6879
(ii) vx ∈ E. 6880
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6881

a dual SuperHyperDefensive SuperHyperDimension Dominating, then 6882
(i) S is SuperHyperDimension Dominating set; 6883
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6884
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6885
(i) Γ ≤ O; 6886
(ii) Γs ≤ On . 6887
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6888
connected. Then 6889
(i) Γ ≤ O − 1; 6890
(ii) Γs ≤ On − Σ3i=1 σi (x). 6891
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6892

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6896
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6897
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6899
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperDimension Dominating; 6900
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6901
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6902
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6903
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperDimension Dominating. Then 6905
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperDimension 6906

Dominating; 6907
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6908
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6909
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6910
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperDimension Dominating. Then 6912

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6916
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6917
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6919
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDimension Dominating; 6920
(ii) Γ = 1; 6921
(iii) Γs = Σ3i=1 σi (c); 6922
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDimension Dominating. 6923
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6924

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6925
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6927
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6928
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6929
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6931
b n c+1
2
Dominating; 6933
(ii) Γ = b n2 c + 1; 6934

b n c+1 ; 6935
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperDimension 6936
Dominating. 6937
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6938
bnc
2
Dominating; 6940
(ii) Γ = b n2 c; 6941

bnc ; 6942
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHy- 6943
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6945

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

Dominating for N SHF; 6948
(ii) Γ = m for N SHF : (V, E); 6949
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6950
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperDimension 6951
Dominating for N SHF : (V, E). 6952
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6953
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6954

b n c+1
is a dual maximal SuperHyperDefensive SuperHy- 6955
perDimension Dominating for N SHF; 6956
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6957

b n c+1 for N SHF : (V, E); 6958
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperDimension Dominating 6959
for N SHF : (V, E). 6960
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6961

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6962
bnc
Dominating for N SHF : (V, E); 6964
(ii) Γ = b n2 c for N SHF : (V, E); 6965

bnc for N SHF : (V, E); 6966
S={vi }i=1
bnc
2
are only dual maximal SuperHyperDimension Dominating for 6967
N SHF : (V, E). 6968
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6971

SuperHyperDimension Dominating, then S is an s-SuperHyperDefensive SuperHyperDimension 6972
Dominating; 6973

SuperHyperDimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperDimension 6975
Dominating. 6976
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6979
SuperHyperDimension Dominating, then S is an s-SuperHyperPowerful SuperHyperDimension 6980

Dominating; 6981

SuperHyperDimension Dominating, then S is a dual s-SuperHyperPowerful SuperHyperDimension 6983
Dominating. 6984
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6985

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHy- 7027
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 7029

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

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


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

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

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


CHAPTER 33 7045
Neutrosophic Applications in Cancer’s 7046
Neutrosophic Recognition 7047
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7048
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7049
disease is considered and as the consequences of the model, some parameters are used. The cells 7050
are under attack of this disease but the moves of the cancer in the special region are the matter 7051
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7052
treatments for this Neutrosophic disease. 7053
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7054
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7055
term Neutrosophic function. 7056
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7057
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7058
move from the cancer is identified by this research. Sometimes the move of the cancer 7059
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 7060
about the moves and the effects of the cancer on that region; this event leads us to 7061
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7062
perception on what’s happened and what’s done. 7063
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7064
known and they’ve got the names, and some general Neutrosophic models. The 7065
moves and the Neutrosophic traces of the cancer on the complex tracks and between 7066
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 7067
/SuperHyperDimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMulti- 7068
partite, SuperHyperWheel). The aim is to find either the Neutrosophic SuperHyperDimension 7069
Dominating or the Neutrosophic SuperHyperDimension Dominating in those Neutrosophic Neutro- 7070
sophic SuperHyperModels. 7071
347
CHAPTER 34 7072
Case 1: The Initial Neutrosophic Steps 7073
Toward Neutrosophic 7074
SuperHyperBipartite as Neutrosophic 7075
SuperHyperModel 7076
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7077
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7078
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

349
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7079
perBipartite is obtained. 7080
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7081
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7082
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7083
(34.1), is the Neutrosophic SuperHyperDimension Dominating. 7084

CHAPTER 35 7085
Case 2: The Increasing Neutrosophic 7086
Steps Toward Neutrosophic 7087
SuperHyperMultipartite as 7088
Neutrosophic SuperHyperModel 7089
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7090
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7091
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7092
perMultipartite is obtained. 7093
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7094
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

351
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 7095

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7096
Neutrosophic SuperHyperDimension Dominating. 7097

CHAPTER 36 7098
Wondering Open Problems But As The 7099
Directions To Forming The Motivations 7100
In what follows, some “problems” and some “questions” are proposed. 7101
The SuperHyperDimension Dominating and the Neutrosophic SuperHyperDimension Dominating are defined 7102
on a real-world application, titled “Cancer’s Recognitions”. 7103
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7104
recognitions? 7105
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperDimension Dominating 7106
and the Neutrosophic SuperHyperDimension Dominating? 7107
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7108
them? 7109
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDimension 7110
and the Neutrosophic SuperHyperDimension Dominating?
Dominating 7111
Problem 36.0.5. The SuperHyperDimension Dominating and the Neutrosophic SuperHyperDimension 7112
Dominatingdo a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHy- 7113
perDimension Dominating, are there else? 7114
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7115
Numbers types-results? 7116
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7117
the multiple types of SuperHyperNotions? 7118
353
CHAPTER 37 7119
Conclusion and Closing Remarks 7120
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7121
research are illustrated. Some benefits and some advantages of this research are highlighted. 7122
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 7123
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperDimension 7124
Dominating. For that sake in the second definition, the main definition of the Neutrosophic Super- 7125
HyperGraph is redefined on the position of the alphabets. Based on the new definition for the 7126
Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperDimension 7127
Dominating, finds the convenient background to implement some results based on that. Some 7128
SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this research on 7129
the modeling of the regions where are under the attacks of the cancer to recognize this disease as 7130
it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHy- 7131
perNotion, SuperHyperDimension Dominating, the new SuperHyperClasses and SuperHyperClasses, 7132
are introduced. Some general results are gathered in the section on the SuperHyperDimension 7133
Dominating and the Neutrosophic SuperHyperDimension Dominating. The clarifications, instances and 7134
literature reviews have taken the whole way through. In this research, the literature reviews 7135
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 7136
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 7137
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 7140
longest and strongest styles with the formation of the design and the architecture are formally 7141
called “ SuperHyperDimension Dominating” in the themes of jargons and buzzwords. The prefix 7142
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 7143
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 7144
pointed out and spoken out. 7145
355
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperDimension Dominating
3. Neutrosophic SuperHyperDimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7146
Neutrosophic SuperHyperDuality But As 7147
Super Forms 7149
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7150

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7152
or E 0 is called 7153
(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7154

Va ∈ Ei , Ej ; 7155
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7156

Va ∈ Ei , Ej and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7157
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7158

Vi , Vj ∈ Ea ; 7159
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7160

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7161
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7162

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7163
sophic rv-SuperHyperDuality. 7164
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7165

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7168

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7170
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7171
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7172
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7173
357
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7175

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7177
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7178
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7179
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7180
form the Neutrosophic SuperHyperDuality; 7181
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7182
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7183

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7184
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7185
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7186
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7187
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7189
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7191

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7193
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7194
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7195
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7196
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 7197
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7198
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7199
coefficient; 7200
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7201

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7203
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7204
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7205
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7206
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7208

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7209
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7210
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7211
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7212
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7213
that they form the Neutrosophic SuperHyperDuality; 7214
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7215

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7216
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7217

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7219
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7222
power is corresponded to its Extreme coefficient; 7223
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7224

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7226

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7229
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7232
coefficient. 7233
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7234
the mentioned Neutrosophic Figures in every Neutrosophic items. 7235

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7237
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7238
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7239
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7240
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7241
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7242
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7243
C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 3z.

E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7247
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7248
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7249
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7250
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7251

every given Neutrosophic SuperHyperDuality. 7252




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7312
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 7314


the Neutrosophic SuperHyperDuality. 7323
Then 7325
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 7326
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7332
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7335

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7336
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7345

(V, E). Then 7346

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 7347
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7348


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

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

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7364
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7365
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7366
Then, 7367
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 7368
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 7369


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7374
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7375
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7381

CHAPTER 39 7382
Neutrosophic SuperHyperJoin But As 7383
Super Forms 7385
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7386

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7390
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7392

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = 7393
|Ej |NEUTROSOPHIC CARDINALITY ; 7394
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7395

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7397

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7398
|Vj |NEUTROSOPHIC CARDINALITY ; 7399
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7400

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7401
rv-SuperHyperJoin. 7402
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7403

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

371

Extreme SuperHyperJoin; 7412
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7413

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7415
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7416
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7417
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7418
Neutrosophic SuperHyperJoin; 7419
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7420

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7421
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7422
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7427
coefficient; 7428
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7429

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7430
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7431
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7432
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7433
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7435

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7436
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7437
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7438

Extreme SuperHyperJoin; 7444
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7445

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7447
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7448
Neutrosophic SuperHyperJoin; 7451

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7452

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7454

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7459
its Extreme coefficient; 7460
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7461

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7463
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7464

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7465
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7466
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7469
coefficient. 7470
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7474

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7475

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7540

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7549
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 7551


the Neutrosophic SuperHyperJoin. 7560
Then 7562
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 7563
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 7569
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7571

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


(V, E). Then 7582

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7584


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

Then, 7602

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

.
Proof. Let 7603
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7604


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7608
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7609
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7610
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7615

CHAPTER 40 7616
Neutrosophic SuperHyperPerfect But As 7617
Super Forms 7619
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7620

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7631
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7632

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7633
rv-SuperHyperPerfect. 7634
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7635

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7640
385
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7645

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7647
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7648
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7649
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7650
form the Neutrosophic SuperHyperPerfect; 7651
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7652

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7653
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7654
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7657
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7661

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7663
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7666
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7669
coefficient; 7670
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7671

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7679
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7680
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7681
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7682
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7683
that they form the Neutrosophic SuperHyperPerfect; 7684
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7685

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7687

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7690
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7694

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7696
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7699

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7702
coefficient. 7703

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7707

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7773
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 7775
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7793
Then 7795
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 7796
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 7800
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7801
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7802
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7805

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

(V, E). Then 7816

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7839


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7842
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7843
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7844
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7845
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7851

CHAPTER 41 7852
Neutrosophic SuperHyperTotal But As 7853
Super Forms 7855
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7856

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7860

Va ∈ Ei , Ej ; 7861
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7862

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7863
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7864

Vi , Vj ∈ Ea ; 7865
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7866

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7867
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7868

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7869
rv-SuperHyperTotal. 7870
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7871

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7876
Extreme SuperHyperTotal; 7880
399
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7881

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7883
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7884
Neutrosophic SuperHyperTotal; 7887
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7888
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7889

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7890
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7895
coefficient; 7896
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7897
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7898

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7899
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7900
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7901
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7904
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7905
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7906

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7908
Extreme SuperHyperTotal; 7912
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7913

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7915
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7916
Neutrosophic SuperHyperTotal; 7919
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7920

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7921
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7922

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7927
its Extreme coefficient; 7928
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7929
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7930

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7931
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7932
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7933
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7934
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7935
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7936
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7937

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7941

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8007
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 8009
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. 8016
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 8018


the Neutrosophic SuperHyperTotal. 8027
Then 8029
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 8030
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8036
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8038

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8049

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8051


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8056
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. 8067
Then, 8069
∗
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 8070
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8071


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8075
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8076
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8077
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8083

CHAPTER 42 8084
Neutrosophic SuperHyperConnected But 8085
As The Extensions Excerpt From Dense 8086
And Super Forms 8087
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8088

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8092
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8093
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8094

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8095
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8096
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8097

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 8098
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 8099

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 8100
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8101
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8102
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8103
rosophic rv-SuperHyperConnected. 8104
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8105

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8108
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8109
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8110
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 8111
413
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 8112
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 8113
form the Extreme SuperHyperConnected; 8114
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8115

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8116
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8117
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8118
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8119
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8120

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8121
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8122
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8123

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8124
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8125
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8126
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8131

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8132
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8133
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8134
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8136
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8137

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8138
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8139
Neutrosophic coefficient; 8140
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8141

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8143
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8144
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8145
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8146
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8147
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8148

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8150
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8151
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8152
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8153
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8154

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8155

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8158
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8159

and the Extreme power is corresponded to its Extreme coefficient; 8163
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8164

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8167
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8169
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8170

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8171
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8172
Neutrosophic coefficient. 8173
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8176
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8177
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8179
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8180

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8181
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8182
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8183
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. 8191


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 8235
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. 8242
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 8244
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. 8251
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 8253



the Neutrosophic SuperHyperConnected. 8262
Then 8264
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 8265
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 8270
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8271
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8274

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8285
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 8286
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8287


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8291
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8292
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8293
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. 8304
Then, 8306
∗
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 8307
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8308


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8311
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8312
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8313
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8314
some representatives. The latter is straightforward. 8315
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8320

CHAPTER 43 8321
Background 8322
427



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 8392
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 8393
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8394
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 8395
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 8398
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 8399
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8400
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 8401

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

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

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 8409
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 8410
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 8411
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8412
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyper- 8413
Graph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” 8414

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

SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 8421
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 8422
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 8423
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 8424
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 8425
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 8426
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 8427
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 8428
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 8429
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 8430
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 8431
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 8432
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 8433
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 8434
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 8435
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 8436
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 8437

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

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

(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 8448
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 8449
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 8450
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 8451
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 8452
(2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 8453
HG274; HG275; HG276; HG277; HG278; HG279], there are some endeavors to formalize 8473
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 8474
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8475


HG279] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 8527



HG176b; HG177b; HG178b; HG179b]. Two popular scientific research books in Scribd in 8541
the terms of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; 8542
HG44b]. 8543

Bibliography 8544
10.33140/JMTCM.01.03.09) 8567
433



10.20944/preprints202301.0282.v1). 8583

10.20944/preprints202301.0267.v1). 8586

(doi: 10.20944/preprints202301.0265.v1). 8591
prints202301.0262.v1). 8595
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8601

prints202301.0105.v1). 8604

Preprints 2023, 2023010044 8610
10.20944/preprints202301.0043.v1). 8613

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

(doi: 10.20944/preprints202212.0500.v1). 8629
10.5281/zenodo.8057696). 8638

2023, (doi: 10.5281/zenodo.8057753). 8641
10.5281/zenodo.8052893). 8644
2023, (doi: 10.5281/zenodo.8052925). 8647
10.5281/zenodo.8051346). 8650

10.5281/zenodo.8051360). 8653
10.5281/zenodo.8025707). 8656
10.5281/zenodo.8027275). 8659
odo.8017246). 8662
10.5281/zenodo.8020128). 8665
odo.7978571). 8668
10.5281/zenodo.7978857). 8671
10.5281/zenodo.7940830). 8674
10.5281/zenodo.7943578). 8677
odo.7916595). 8680
odo.7923632). 8683
(doi: 10.5281/zenodo.7904698). 8686
2023, (doi: 10.5281/zenodo.7904671). 8689

10.5281/zenodo.7871026). 8698
2023, (doi: 10.5281/zenodo.7874647). 8701
10.5281/zenodo.7857856). 8704
2023, (doi: 10.5281/zenodo.7857841). 8707
10.5281/zenodo.7853867). 8716
10.5281/zenodo.7853922). 8719
(doi: 10.5281/zenodo.7851519). 8722
(doi: 10.5281/zenodo.7851550). 8725

10.5281/zenodo.7834229). 8734
10.5281/zenodo.7834261). 8737
10.5281/zenodo.7824560). 8740
(doi: 10.5281/zenodo.7824623). 8743
2023, (doi: 10.5281/zenodo.7809365). 8754
2023, (doi: 10.5281/zenodo.7809358). 8757
10.5281/zenodo.7809219). 8760
10.5281/zenodo.7809328). 8763
2023, (doi: 10.5281/zenodo.7806767). 8766

2023, (doi: 10.5281/zenodo.7806838). 8769
10.5281/zenodo.7799902). 8778
(doi: 10.5281/zenodo.7804218). 8781
(doi: 10.5281/zenodo.7796334). 8784
10.5281/zenodo.7791952). 8790
10.5281/zenodo.7791982). 8793
10.5281/zenodo.7790026). 8796
10.5281/zenodo.7790052). 8799
2023, (doi: 10.5281/zenodo.7787066). 8802

10.5281/zenodo.7781476). 8808
10.5281/zenodo.7783082). 8811
10.5281/zenodo.7777857). 8814
10.5281/zenodo.7779286). 8817
(doi: 10.5281/zenodo.7771831). 8820
2023, (doi: 10.5281/zenodo.7772468). 8823
10.13140/RG.2.2.20913.25446). 8826
odo.7764916). 8829
10.13140/RG.2.2.11770.98247). 8832
10.13140/RG.2.2.12400.12808). 8835
2023, (doi: 10.13140/RG.2.2.22545.10089). 8838
10.13140/RG.2.2.11377.76644). 8844

10.13140/RG.2.2.23750.96329). 8847
10.13140/RG.2.2.31366.24641). 8850
10.13140/RG.2.2.34721.68960). 8853
2023, (doi: 10.13140/RG.2.2.30212.81289). 8856
10.13140/RG.2.2.24288.35842). 8862
10.13140/RG.2.2.32467.25124). 8865
10.13140/RG.2.2.31025.45925). 8868
10.13140/RG.2.2.17184.25602). 8871
10.13140/RG.2.2.23423.28327). 8874
10.13140/RG.2.2.28456.44805). 8877
10.13140/RG.2.2.23525.68320). 8880
10.13140/RG.2.2.20170.24000). 8883

10.13140/RG.2.2.36475.59683). 8886
10.13140/RG.2.2.29764.71046). 8889
2023, (doi: 10.13140/RG.2.2.18780.87683). 8892
10.13140/RG.2.2.26134.01603). 8898
10.13140/RG.2.2.27392.30721). 8901
10.13140/RG.2.2.33028.40321). 8904
10.13140/RG.2.2.21389.20966). 8907
10.13140/RG.2.2.16356.04489). 8910
10.13140/RG.2.2.21756.21129). 8913
10.13140/RG.2.2.30983.68009). 8916
10.13140/RG.2.2.28552.29445). 8919
(doi: 10.13140/RG.2.2.10936.21761). 8922

10.13140/RG.2.2.35105.89447). 8925
(doi: 10.13140/RG.2.2.30072.72960). 8928
10.13140/RG.2.2.31147.52003). 8931
10.13140/RG.2.2.32825.24163). 8934
10.13140/RG.2.2.13059.58401). 8937
10.13140/RG.2.2.11172.14720). 8940
2023, (doi: 10.13140/RG.2.2.22011.80165). 8943
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8946
2023, (doi: 10.13140/RG.2.2.10493.84962). 8949
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8952
2023, (doi: 10.13140/RG.2.2.19944.14086). 8955
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8958
(doi: 10.13140/RG.2.2.33103.76968). 8961

(doi: 10.13140/RG.2.2.23037.44003). 8964
(doi: 10.13140/RG.2.2.35646.56641). 8967
10.13140/RG.2.2.18030.48967). 8970
(doi: 10.13140/RG.2.2.13973.81121). 8973
2023, (doi: 10.13140/RG.2.2.34106.47047). 8976
2023, (doi: 10.13140/RG.2.2.31956.88961). 8982
2023, (doi: 10.13140/RG.2.2.15179.67361). 8985
10.13140/RG.2.2.21510.45125). 8988
2023, (doi: 10.13140/RG.2.2.13121.84321). 8991
10.13140/RG.2.2.11758.69441). 8994
2023, (doi: 10.13140/RG.2.2.31891.35367). 8997
10.13140/RG.2.2.19360.87048). 9000

10.13140/RG.2.2.32363.21286). 9003
10.13140/RG.2.2.23266.81602). 9006
10.13140/RG.2.2.19911.37285). 9009
10.13140/RG.2.2.11050.90569). 9012
2023, (doi: 10.13140/RG.2.2.17761.79206). 9015
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9021
(doi: 10.13140/RG.2.2.30182.50241). 9024


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

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



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


10.20944/preprints202301.0282.v1). 9090
10.20944/preprints202301.0267.v1).). 9093

(doi: 10.20944/preprints202301.0265.v1). 9098
prints202301.0262.v1). 9102

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

10.13140/RG.2.2.35061.65767). 9111
10.13140/RG.2.2.18494.15680). 9115

10.13140/RG.2.2.32530.73922). 9119
10.13140/RG.2.2.15897.70243). 9123
10.13140/RG.2.2.32530.73922). 9127
prints202301.0105.v1). 9130
10.13140/RG.2.2.23172.19849). 9137


10.13140/RG.2.2.17385.36968). 9147

Preprints 2023, 2023010044 9150
10.20944/preprints202301.0043.v1). 9153

2023, (doi: 10.13140/RG.2.2.28945.92007). 9156

10.13140/RG.2.2.35774.77123). 9162
10.13140/RG.2.2.29430.88642). 9168

(doi: 10.20944/preprints202212.0549.v1). 9174
10.13140/RG.2.2.19380.94084). 9177

(doi: 10.20944/preprints202212.0500.v1). 9188
10.13140/RG.2.2.20993.12640). 9191



10.13140/RG.2.2.29173.86244). 9206
2023 (doi: 10.5281/zenodo.8052976). 9213
(doi: 10.5281/zenodo.8051368). 9215
(doi: 10.5281/zenodo.8027488). 9217
10.5281/zenodo.8020181). 9219
10.5281/zenodo.7978921). 9221
odo.7943878). 9223
10.5281/zenodo.7943871). 9225
10.5281/zenodo.7923786). 9227

2023 (doi: 10.5281/zenodo.7905287). 9229

2023 (doi: 10.5281/zenodo.7874677). 9233
(doi: 10.5281/zenodo.7857906). 9235
2023 (doi: 10.5281/zenodo.7856329). 9237
10.5281/zenodo.7854561). 9239
2023 (doi: 10.5281/zenodo.7851893). 9241

(doi: 10.5281/zenodo.7835063). 9245
(doi: 10.5281/zenodo.7826705). 9247
2023 (doi: 10.5281/zenodo.7820680). 9249
10.5281/zenodo.7812750). 9251


2023 (doi: 10.5281/zenodo.7807782). 9257
2023 (doi: 10.5281/zenodo.7804449). 9259

(doi: 10.5281/zenodo.7792307). 9263

(doi: 10.5281/zenodo.7790728). 9265
2023 (doi: 10.5281/zenodo.7787712). 9267
10.5281/zenodo.7783791). 9269
10.5281/zenodo.7780123). 9271
(doi: 10.5281/zenodo.7773119). 9273
odo.7637762). 9275
10.5281/zenodo.7766174). 9277
10.5281/zenodo.7762232). 9279
(doi: 10.5281/zenodo.7758601). 9281
10.5281/zenodo.7754661). 9283
10.5281/zenodo.7750995) . 9285
(doi: 10.5281/zenodo.7749875). 9287
10.5281/zenodo.7747236). 9289
10.5281/zenodo.7742587). 9291
(doi: 10.5281/zenodo.7738635). 9293
10.5281/zenodo.7734719). 9295
10.5281/zenodo.7730484). 9297
(doi: 10.5281/zenodo.7730469). 9299

10.5281/zenodo.7722865). 9301
odo.7713563). 9303
odo.7709116). 9305
10.5281/zenodo.7706415). 9307
10.5281/zenodo.7706063). 9309
10.5281/zenodo.7701906). 9311
odo.7700205). 9313
10.5281/zenodo.7694876). 9315
10.5281/zenodo.7679410). 9317
10.5281/zenodo.7675982). 9319
10.5281/zenodo.7672388). 9321
odo.7668648). 9323
10.5281/zenodo.7662810). 9325
10.5281/zenodo.7659162). 9327
odo.7653233). 9329
odo.7653204). 9331
odo.7653142). 9333
odo.7653117). 9335

odo.7651687). 9338
odo.7651619). 9340
odo.7651439). 9342
odo.7650729). 9344
odo.7647868). 9346
odo.7647017). 9348
odo.7644894). 9350
odo.7632923). 9353
odo.7623459). 9355
10.5281/zenodo.7606416). 9357
10.5281/zenodo.7606416). 9359
odo.7606404). 9361
10.5281/zenodo.7580018). 9363
odo.7580018). 9365
odo.7580018). 9367
odo.7579929). 9369

10.5281/zenodo.7563170). 9371
odo.7563164). 9373
odo.7563160). 9375
odo.7563160). 9377
10.5281/zenodo.7563160). 9379
10.5281/zenodo.7557063). 9381
10.5281/zenodo.7557009). 9383
10.5281/zenodo.7539484). 9385
10.5281/zenodo.7523390). 9387
10.5281/zenodo.7523390). 9389
10.5281/zenodo.7523390). 9391
odo.7574952). 9393
10.5281/zenodo.7574992). 9395
odo.7523357). 9397
10.5281/zenodo.7523357). 9399
10.5281/zenodo.7504782). 9401
10.5281/zenodo.7504782). 9403
10.5281/zenodo.7504782). 9405

10.5281/zenodo.7499395). 9407
odo.7499395). 9409
10.5281/zenodo.7499395). 9411
10.5281/zenodo.7497450). 9413
10.5281/zenodo.7497450). 9415
10.5281/zenodo.7494862). 9417
odo.7494862). 9419
10.5281/zenodo.7494862). 9421
10.5281/zenodo.7493845). 9423
odo.7493845). 9425
10.5281/zenodo.7493845). 9427
odo.7539484). 9429
odo.7523390). 9431
odo.7523357). 9433
odo.7504782). 9435
odo.7499395). 9437
odo.7497450). 9439
odo.7494862). 9441

odo.7493845). 9443
odo.7480110). 9445
odo.7378758). 9447
odo.6320305). 9449
odo.6677173). 9451

CHAPTER 44 9452
Books’ Contributions 9453
“Books’ Contributions”: | Featured Threads 9454

The following references are cited by chapters. 9455
9456
[Ref280] 9457
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominat- 9458
ing In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9459
10.5281/zenodo.8062016). 9460
9461
[Ref281] 9462
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9463
Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 10.5281/zen- 9464
odo.8061927). 9465
9466
The links to the contributions of this scientific research book are listed below. 9467
[HG280] 9468
10.5281/zenodo.8062016). 9471
9472
[TITLE] “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating In 9473
Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9474

9475
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9476
https://www.researchgate.net/publication/371725124 9477
9478
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9479
https://www.scribd.com/document/654338722 9480
9481
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9482
https://zenodo.org/record/8062016 9483
9484
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9485
https://www.academia.edu/103636211 9486
459
Figure 44.1: [HG280] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of
Dimension Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8062016).
9487
[ADDRESSED CITATION] 9488
10.5281/zenodo.8062016). 9491
[ASSIGNED NUMBER] #280 Article 9492
[DATE] June 2023 9493

[DOI] 10.5281/zenodo.8062016 9494
[LICENSE] CC BY-NC-ND 4.0 9495
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9496
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9497
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9498
9499
[HG281] 9500
odo.8061927). 9503
9504
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9505

Dimension Dominating As Hyper Dimple On Super Dimity” 9506
9507
https://www.researchgate.net/publication/371725087 9509
9510
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9511


Figure 44.4: [HG281] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo
2023, (doi: 10.5281/zenodo.8061927).
https://www.scribd.com/document/654333269 9512
9513
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9514
9516
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9517
https://www.academia.edu/103635572 9518
9519
odo.8061927). 9523
[ASSIGNED NUMBER] #281 Article 9524
[DATE] June 2023 9525
[DOI] 10.5281/zenodo.8061927 9526
[LICENSE] CC BY-NC-ND 4.0 9527

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9528
[AVAILABLE AT TWITTER’S IDS] 9529
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9530
googlebooks GooglePlay 9531
9532
[ASSIGNED NUMBER] | Book #180 9533

HG180b
Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9535
10.5281/zenodo.8062076). 9536

2023, (doi: 10.5281/zenodo.8061927).
2023, (doi: 10.5281/zenodo.8061927).

[TITLE] Dimension Dominating In SuperHyperGraphs 9537

#Latest_Updates 9538
#The_Links 9539
9543
9545
#The_Links 9546
9547
[ASSIGNED NUMBER] | Book #180 9548

9549
[TITLE] Dimension Dominating In SuperHyperGraphs 9550
9551
9555
– 9556
9557
[PUBLISHER] 9558
(Paperback): https://www.amazon.com/dp/- 9559
(Hardcover): https://www.amazon.com/dp/- 9560

(Kindle Edition): https://www.amazon.com/dp/- 9561
9562
– 9563
9564
[ISBN] 9565
(Paperback): - 9566
(Hardcover): - 9567
(Kindle Edition): CC BY-NC-ND 4.0 9568
(EBook): CC BY-NC-ND 4.0 9569
9570
– 9571
9572
[PRINT LENGTH] 9573
(Paperback): - pages 9574
(Hardcover): - pages 9575
(Kindle Edition): - pages 9576
(E-Book): - pages 9577
9578
– 9579
9580
9582

#The_Links 9583
9584
https://www.researchgate.net/publication/- 9586
9587
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9588
https://drhenrygarrett.wordpress.com/2023/07/22/ 9589
Dimension-Dominating-In-SuperHyperGraphs/ 9590
9591
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9592
https://www.scribd.com/document/- 9593
9594
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9595
https://www.academia.edu/- 9596
9597
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9598
9600
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9601
https://books.google.com/books/about?id=- 9602
9603
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9604
https://play.google.com/store/books/details?id=- 9605

[TITLE] Dimension Dominating In SuperHyperGraphs (Published Version) 9606

9607
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9608
9609
https://drhenrygarrett.wordpress.com/2023/07/22/ 9610
Dimension-Dominating-In-SuperHyperGraphs/ 9611
9612
– 9613
9614
[POSTED BY] Dr. Henry Garrett 9615
9616
[DATE] June 020, 2023 9617

9618
[POSTED IN] 180 | Dimension Dominating In SuperHyperGraphs 9619
9620
[TAGS] 9621
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9622
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9623
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9624
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9625
neutrosophic SuperHyperGraphs, Neutrosophic Dimension Dominating In SuperHyperGraphs, 9626
Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real- 9627
World Applications, Recent Research, Recognitions, Research, scientific research Article, 9628
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9629
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Su- 9630

perHyperGraph Theory, SuperHyperGraphs, Dimension Dominating In SuperHyperGraphs, 9631
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9632
In this scientific research book, there are some scientific research chapters on “Extreme 9633
Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Dimension Dominating In 9634
SuperHyperGraphs” about some scientific research on Dimension Dominating In SuperHyper- 9635
Graphs by two (Extreme/Neutrosophic) notions, namely, Extreme Dimension Dominating In 9636

SuperHyperGraphs and Neutrosophic Dimension Dominating In SuperHyperGraphs. With 9637
scientific research on the basic scientific research properties, the scientific research book 9638
starts to make Extreme Dimension Dominating In SuperHyperGraphs theory and Neutro- 9639
sophic Dimension Dominating In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9640
understandable. 9641

HG180b1.png
Figure 44.7: [HG180b] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr.

Henry Garrett, 2023 (doi: 10.5281/zenodo.8062076).

HG180b2.png
Figure 44.8: [[HG180b] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr.


HG180b3.png
Figure 44.9: [HG180b] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr.


CHAPTER 45 9642
“SuperHyperGraph-Based Books”: | 9643
Featured Tweets 9644
“SuperHyperGraph-Based Books”: | Featured Tweets 9645
471
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 9646
CV 9647
499
9648
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
9649
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)
9650
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

9651

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

9652
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

9653
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”,
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

9654
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

9655
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9656
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).
9657
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

9658
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

9659
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

9660
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

9661
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

9662
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

9663
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

9664
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

9665
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

9666
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

9667
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).
9668
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

9669

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

9670
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

9671

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: -
9672
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

9673
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).
9674
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
9675
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
9676
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
9677
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).
9678
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

9679
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).
9680
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”,

9681
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).
9682
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).
9683
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
9684
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).
9685

(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).
9686
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).
9687
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

9688
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
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

9689
[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

9690
[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

9691
[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

9692
[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

9693
[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

9694
[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

9695
[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

9696
[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

9697
[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

9698
[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

9699
[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

9700
[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

9701
[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

9702
[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

9703
[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

9704
[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

9705
[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

9706
[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

9707
[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

9708
[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

9709
[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

9710
[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

9711
[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

9712
[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

9713
[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
9714
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

9715
[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

9716
[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

9717
[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

9718
[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

9719
[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
9720
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

9721
“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

9722
[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
9723
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

9724
[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

9725
[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

9726
[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

9727
[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

9728
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

9729
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
9730
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
9731
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

9732
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

9733
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
-
9734
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

9735
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9736
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
9737
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
9738
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

9739
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
9740
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
...
9741
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/
9742
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
9743
9744
9745
Henry Garrett
01/23/2022
9746
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
9747
View publication stats

Dimension Dominating 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

Dimension Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

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

Dimension Dominating In SuperHyperGraphs

Book · June 2023

498 PUBLICATIONS 20,722 CITATIONS

Metric Dimension in fuzzy(neutrosophic) Graphs View project

Number Graphs And Numbers View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 45

5 Extreme Dimension Dominating 49

6 New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 63

10 Extreme SuperHyperDimension Dominating But As The Extensions Excerpt

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 139

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 147

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 251

25 Neutrosophic Dimension Dominating 255

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 SuperHyperDimension Dominating But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 347

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 355

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 459

45 “SuperHyperGraph-Based Books”: | Featured Tweets 471

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

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

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 472

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.17“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 486