Super Hyper Dominating

Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Contents
Contents i
List of Figures ii
List of Tables iii
1 ABSTRACT 1
2 BACKGROUND 15
Bibliography 19
3 Acknowledgements 29
4 Extreme SuperHyperDominating 31
5 New Ideas On Super Missing By Hyper Searching Of SuperHyperDom-

inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph 35
6 ABSTRACT 37
7 Background 43
8 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

Research 47
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 51
10 Extreme SuperHyperDominating But As The Extensions Excerpt From

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

Motivations 81
i
12 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 91
13 Extreme Applications in Cancer’s Extreme Recognition 103
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipartite

as Extreme SuperHyperModel 105
15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyperMul-

tipartite as Extreme SuperHyperModel 107
16 Wondering Open Problems But As The Directions To Forming The

Motivations 109
17 Conclusion and Closing Remarks 111
Bibliography 113
18 Neutrosophic SuperHyperDominating 117
19 New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperDominating As Hyper Closing On Super Messy 121
20 ABSTRACT 123
21 Background 129
22 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

Research 133
23 Neutrosophic Preliminaries Of This Scientific Research On the Redeemed

Ways 137
24 Neutrosophic SuperHyperDominating But As The Extensions Excerpt

From Dense And Super Forms 147
25 The Neutrosophic Departures on The Theoretical Results Toward Theor-

etical Motivations 167
26 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 177
27 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 189
28 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

perBipartite as Neutrosophic SuperHyperModel 191
29 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic Super-

HyperMultipartite as Neutrosophic SuperHyperModel 193

30 Wondering Open Problems But As The Directions To Forming The

Motivations 195
31 Conclusion and Closing Remarks 197
Bibliography 199
32 Books’ Contributions 203
33 “SuperHyperGraph-Based Books”: | Featured Tweets 213
34 CV 241

List of Figures
1.1 Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHy-
perDominating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.13121.84321). . . . . . . . . . . . . . . . 7
1.4 Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper-
Graph By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 9
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 9
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 10
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1 “#107th Book” || SuperHyperConnected February 2023 License: CC BY-NC-

ND 4.0 Print length: 290 pages Project: Neutrosophic SuperHyperGraphs and
SuperHyperGraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
iv
10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

SuperHyperDominating in the Extreme Example (24.0.1) . . . . . . . . . . . . . . . 62
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme


11.1 a Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperDom-

inating in the Example (25.0.2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
11.2 a Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 a Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of Extreme
SuperHyperDominating in the Example (25.0.8) . . . . . . . . . . . . . . . . . . . . 86
11.5 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme SuperHy-
perDominating in the Example (25.0.10) . . . . . . . . . . . . . . . . . . . . . . . . . 88
11.6 a Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of Extreme
14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHyper-

Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme SuperHy-

perDominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 118
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 118
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 119
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 119
24.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperDominating in the Neutrosophic Example (24.0.1) . . . . 148


24.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
25.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

25.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperDominating in the Neutrosophic Example (25.0.4) . . . . . 170
25.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of Neutro-
sophic SuperHyperDominating in the Neutrosophic Example (25.0.6) . . . . . . . . . 171

25.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperDominating in the Example (25.0.8) . . . . . . 173
25.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
25.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperDominating in the Neutrosophic Example (25.0.12) 175
28.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperDominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
29.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperDominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 206
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 206
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 207
2023, (doi: 10.13140/RG.2.2.21510.45125). . . . . . . . . . . . . . . . . . . . . . . . . 207
32.10“#107th Book” || SuperHyperConnected February 2023 License: CC BY-NC-
33.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 214

33.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 215
33.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . . 216


33.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . . 222

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

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (23.0.23) 60
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (23.0.22) 60

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . . 106

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . . 108
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 112

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . . 192

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . . 194
31.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 198
x
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme Supe- 1
rHyperConnected” and “Neutrosophic SuperHyperConnected” about some scientific research 2
on SuperHyperConnected by two (Extreme/Neutrosophic) notions, namely, Extreme SuperHy- 3

perConnected and Neutrosophic SuperHyperConnected. With scientific research on the basic 4
scientific research properties, the scientific research book starts to make Extreme SuperHyperCon- 5
nected theory and Neutrosophic SuperHyperConnected theory more (Extremely/Neutrosophicly) 6
understandable. 7
8
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 9
Notions, namely, a SuperHyperConnected and Neutrosophic SuperHyperConnected . Two 10
different types of SuperHyperDefinitions are debut for them but the scientific research goes 11
further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that 12
are well-defined and well-reviewed. The literature review is implemented in the whole of this 13
research. For shining the elegancy and the significancy of this research, the comparison between 14
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 15

featured. The definitions are followed by the examples and the instances thus the clarifications are 16
driven with different tools. The applications are figured out to make sense about the theoretical 17
aspect of this ongoing research. The “Cancer’s Recognition” are the under scientific research to 18
figure out the challenges make sense about ongoing and upcoming research. The special case 19
is up. The cells are viewed in the deemed ways. There are different types of them. Some of 20
them are individuals and some of them are well-modeled by the group of cells. These types 21
are all officially called “SuperHyperVertex” but the relations amid them all officially called 22
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” 23
are chosen and elected to scientific research about “Cancer’s Recognition”. Thus these complex 24
and dense SuperHyperModels open up some avenues to scientific research on theoretical segments 25
and “Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 26
collected in the form of some questions and some problems. Assume a SuperHyperGraph. Then 27
δ−SuperHyperConnected is a maximal of SuperHyperVertices with a maximum cardinality such 28
that either of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyper- 29
Neighbors of s ∈ S : there are |S ∩N (s)| > |S ∩(V \N (s))|+δ; and |S ∩N (s)| < |S ∩(V \N (s))|+δ. 30
The first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, 31
holds if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperConnected is a max- 32
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 33
1
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 34
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; and 35
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 36
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 37
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperConnected . 38
Since there’s more ways to get type-results to make a SuperHyperConnected more understandable. 39
For the sake of having Neutrosophic SuperHyperConnected, there’s a need to “redefine” the 40
notion of a “SuperHyperConnected ”. The SuperHyperVertices and the SuperHyperEdges are 41
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of 42
the position of labels to assign to the values. Assume a SuperHyperConnected . It’s redefined a 43
Neutrosophic SuperHyperConnected if the mentioned Table holds, concerning, “The Values of 44
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 45
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position 46
in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Vertices”, “The 47
Values of The Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The 48
maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values 49
of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next 50
SuperHyperClass of SuperHyperGraph based on a SuperHyperConnected . It’s the main. It’ll 51
be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 52

If there’s a need to have all SuperHyperConnected until the SuperHyperConnected, then it’s 53
officially called a “SuperHyperConnected” but otherwise, it isn’t a SuperHyperConnected . There 54
are some instances about the clarifications for the main definition titled a “SuperHyperConnected 55
”. These two examples get more scrutiny and discernment since there are characterized in the 56
disciplinary ways of the SuperHyperClass based on a SuperHyperConnected . For the sake 57
of having a Neutrosophic SuperHyperConnected, there’s a need to “redefine” the notion of 58

a “Neutrosophic SuperHyperConnected” and a “Neutrosophic SuperHyperConnected ”. The 59
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 60
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 61
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 62
if the intended Table holds. And a SuperHyperConnected are redefined to a “Neutrosophic 63
SuperHyperConnected” if the intended Table holds. It’s useful to define “Neutrosophic” version 64
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 65
Neutrosophic SuperHyperConnected more understandable. Assume a Neutrosophic Super- 66
HyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 67
Thus SuperHyperPath, SuperHyperConnected, SuperHyperStar, SuperHyperBipartite, SuperHy- 68
perMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 69

SuperHyperConnected”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 70
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 71
Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperConnected” where it’s the 72
strongest [the maximum Neutrosophic value from all the SuperHyperConnected amid the max- 73
imum value amid all SuperHyperVertices from a SuperHyperConnected .] SuperHyperConnected 74
. A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 75

SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 76
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 77
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperConnected if it’s only 78
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 79

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

Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperConnected or 105
the strongest SuperHyperConnected in those Neutrosophic SuperHyperModels. For the longest 106
SuperHyperConnected, called SuperHyperConnected, and the strongest SuperHyperConnected, 107
called Neutrosophic SuperHyperConnected, some general results are introduced. Beyond that 108
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 109
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 110
SuperHyperConnected. There isn’t any formation of any SuperHyperConnected but literarily, 111
it’s the deformation of any SuperHyperConnected. It, literarily, deforms and it doesn’t form. A 112
basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 113
proposed. 114
Keywords: SuperHyperGraph, (Neutrosophic) SuperHyperConnected, Cancer’s Recognition 115
AMS Subject Classification: 05C17, 05C22, 05E45 116

117
In the some chapters, in some researches, new setting is introduced for new SuperHyperNotion, 118
namely, Neutrosophic SuperHyperConnected . Two different types of SuperHyperDefinitions are 119
debut for them but the scientific research goes further and the SuperHyperNotion, SuperHyper- 120
Uniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature 121
review is implemented in the whole of this research. For shining the elegancy and the significancy 122
of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions 123
and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 124

and the instances thus the clarifications are driven with different tools. The applications are 125
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 126
Neutrosophic Recognition” are the under scientific research to figure out the challenges make sense 127
about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed 128
ways. There are different types of them. Some of them are individuals and some of them are 129
well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the 130
relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 131
and “Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Can- 132
cer’s Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open up some 133
avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic Recognition”. 134
Some avenues are posed to pursue this research. It’s also officially collected in the form of some 135
questions and some problems. Assume a SuperHyperGraph. Then an “δ−SuperHyperConnected” 136
is a maximal SuperHyperConnected of SuperHyperVertices with maximum cardinality such 137

that either of the following expressions hold for the (Neutrosophic) cardinalities of SuperHy- 138
perNeighbors of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 139
The first Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expres- 140
sion, holds if S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−SuperHyperConnected” 141
is a maximal Neutrosophic SuperHyperConnected of SuperHyperVertices with maximum 142
Neutrosophic cardinality such that either of the following expressions hold for the Neut- 143
rosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 144
|S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 145
The first Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second 146
Expression, holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neut- 147
rosophic” version of SuperHyperConnected . Since there’s more ways to get type-results to 148
make SuperHyperConnected more understandable. For the sake of having Neutrosophic Supe- 149
rHyperConnected, there’s a need to “redefine” the notion of “SuperHyperConnected ”. The 150
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 151
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 152
Assume a SuperHyperConnected . It’s redefined Neutrosophic SuperHyperConnected if the 153
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 154
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 155
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 156
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 157
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 158
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 159
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 160
based on SuperHyperConnected . It’s the main. It’ll be disciplinary to have the foundation of 161
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperCon- 162
nected until the SuperHyperConnected, then it’s officially called “SuperHyperConnected” but 163
otherwise, it isn’t SuperHyperConnected . There are some instances about the clarifications for 164
the main definition titled “SuperHyperConnected ”. These two examples get more scrutiny and 165
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 166
on SuperHyperConnected . For the sake of having Neutrosophic SuperHyperConnected, there’s 167
a need to “redefine” the notion of “Neutrosophic SuperHyperConnected” and “Neutrosophic 168
SuperHyperConnected ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 169
labels from the letters of the alphabets. In this procedure, there’s the usage of the position of 170

labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutro- 171
sophic SuperHyperGraph” if the intended Table holds. And SuperHyperConnected are redefined 172
“Neutrosophic SuperHyperConnected” if the intended Table holds. It’s useful to define “Neutro- 173
sophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results 174
to make Neutrosophic SuperHyperConnected more understandable. Assume a Neutrosophic 175
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 176
Thus SuperHyperPath, SuperHyperConnected, SuperHyperStar, SuperHyperBipartite, SuperHy- 177

perMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 178
SuperHyperConnected”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 179
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 180
Table holds. A SuperHyperGraph has “Neutrosophic SuperHyperConnected” where it’s the 181
strongest [the maximum Neutrosophic value from all SuperHyperConnected amid the maximum 182
value amid all SuperHyperVertices from a SuperHyperConnected .] SuperHyperConnected 183

. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of 184
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 185
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 186
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperConnected if it’s only 187
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 188
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 189
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 193
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 203
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 204
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] and 205
the long cycle of the move from the cancer is identified by this research. Sometimes the move of the 206
cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 207
about the moves and the effects of the cancer on that region; this event leads us to choose 208
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 209
on what’s happened and what’s done. There are some specific models, which are well-known 210
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and 211
the traces of the cancer on the complex tracks and between complicated groups of cells could 212
be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperConnected, SuperHyperStar, 213
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 214
the longest SuperHyperConnected or the strongest SuperHyperConnected in those Neutrosophic 215
SuperHyperModels. For the longest SuperHyperConnected, called SuperHyperConnected, 216

and the strongest SuperHyperConnected, called Neutrosophic SuperHyperConnected, some 217

general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths 218
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 219
SuperHyperEdges to form any style of a SuperHyperConnected. There isn’t any formation of 220
any SuperHyperConnected but literarily, it’s the deformation of any SuperHyperConnected. It, 221
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 222
Neutrosophic SuperHyperGraph theory are proposed. 223

Keywords: Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperConnected, Cancer’s 224
Neutrosophic Recognition 225

227
The following references are cited by chapters. 228
229
[Ref158] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHy- 230
perDominating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 231

2023, (doi: 10.13140/RG.2.2.13121.84321). 232
233
[Ref159] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 234
perGraph By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, 235
(doi: 10.13140/RG.2.2.21510.45125). 236
237
The links to the contributions of this scientific research book are listed below. 238
[Ref158] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 239
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 240
(doi: 10.13140/RG.2.2.13121.84321). 241
Article #156 242
243
New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating In Cancer’s 244
Recognition With (Neutrosophic) SuperHyperGraph 245
246
ResearchGate: https://www.researchgate.net/publication/368599585 247
248
Scribd: https://www.scribd.com/document/626385255 249

250
academia: https://www.academia.edu/97069463 251
252
ZENODO_ORG: https://zenodo.org/record/7650563 253
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 254
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 255

10.13140/RG.2.2.13121.84321). 256
#156th Article 257
February 2023 258
DOI: 10.13140/RG.2.2.13121.84321 259
License: CC BY-NC-ND 4.0 260
Print length: 61 pages 261

Figure 1.1: Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyper-
Dominating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.13121.84321).
Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs 262

Available at WordPress ResearchGate Scribd academia ZENODO_ORG Amazon googlebooks 263
GooglePlay [Ref159] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 264
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 265
2023, (doi: 10.13140/RG.2.2.21510.45125). 266
Article #159 267
268
New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By SuperHyper- 269
Dominating As Hyper Closing On Super Messy 270
271
273
Scribd: https://www.researchgate.net/publication/626381737 274

275
277
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 279
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 280

10.13140/RG.2.2.21510.45125). 281
#159th Article” 282
February 2023 283
DOI: 10.13140/RG.2.2.21510.45125 284

2023, (doi: 10.13140/RG.2.2.13121.84321).
2023, (doi: 10.13140/RG.2.2.13121.84321).

Figure 1.4: Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper-
Graph By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
10.13140/RG.2.2.21510.45125).

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

10.13140/RG.2.2.21510.45125).
10.13140/RG.2.2.21510.45125).

[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educa- 297
tional Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 298
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 299
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 300
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 301
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 302

303
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 304
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and 305
has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Florida: 306
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 307
United States. This research book presents different types of notions SuperHyperResolving and 308
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 309
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 310
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 311
that what’s done in this research book which is popular in the terms of high readers in Scribd. 312
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - 313
Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1- 314
59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 315
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 316
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 317
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 318



CHAPTER 2 319
BACKGROUND 320
There are some scientific researches covering the topic of this research. In what follows, there are 321
some discussion and literature reviews about them date back on January 22, 2023. 322
First article is titled “properties of SuperHyperGraph and neutrosophic SuperHyperGraph” in 323

Ref. [HG1] by Henry Garrett (2022). It’s first step toward the research on neutrosophic Super- 324
HyperGraphs. This research article is published on the journal “Neutrosophic Sets and Systems” 325
in issue 49 and the pages 531-561. In this research article, different types of notions like dom- 326
inating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) 327
neutrosophic path, zero forcing number, zero forcing neutrosophic- number, independent number, 328
independent neutrosophic-number, clique number, clique neutrosophic-number, matching number, 329

matching neutrosophic-number, girth, neutrosophic girth, 1-zero-forcing number, 1-zero- forcing 330
neutrosophic-number, failed 1-zero-forcing number, failed 1-zero-forcing neutrosophic-number, 331
global- offensive alliance, t-offensive alliance, t-defensive alliance, t-powerful alliance, and global- 332
powerful alliance are defined in SuperHyperGraph and neutrosophic SuperHyperGraph. Some 333
Classes of SuperHyperGraph and Neutrosophic SuperHyperGraph are cases of research. Some 334
results are applied in family of SuperHyperGraph and neutrosophic SuperHyperGraph. Thus this 335
research article has concentrated on the vast notions and introducing the majority of notions. 336
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 337
degree alongside chromatic numbers in the setting of some classes related to neutrosophic hy- 338
pergraphs” in Ref. [HG2] by Henry Garrett (2022). In this research article, a novel approach 339
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 340
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 341
prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science Research 342
(JCTCSR)” with abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 343
06-14. The research article studies deeply with choosing neutrosophic hypergraphs instead of 344
neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results based on 345
initial background. 346
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 347
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 348
Neutrosophic Super Hyper Classes” in Ref. [HG3] by Henry Garrett (2022). In this research art- 349
icle, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph 350
based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of neutro- 351
sophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal 352
of Mathematical Techniques and Computational Mathematics(JMTCM)” with abbreviation “J 353
15
Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. The research article 354
studies deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. 355
It’s the breakthrough toward independent results based on initial background and fundamental 356
SuperHyperNumbers. 357
In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 358
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. 359
[HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” 360
in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme 361
of Confrontation under Cancer’s Recognition as the Model in The Setting of (Neutrosophic) 362
SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), “Uncertainty On The Act And 363
Effect Of Cancer Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHy- 364
perClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [HG7] 365
by Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 366
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] by Henry Garrett (2022), 367
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality 368
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside 369
Numbers In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 370
Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry Garrett (2022), “Breaking the Con- 371
tinuity and Uniformity of Cancer In The Worst Case of Full Connections With Extreme Failed 372
SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs” in 373
Ref. [HG10] by Henry Garrett (2022), “Neutrosophic Failed SuperHyperStable as the Survivors 374
on the Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 375
SuperHyperGraphs” in Ref. [HG11] by Henry Garrett (2022), “Extremism of the Attacked 376
Body Under the Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 377
SuperHyperGraphs” in Ref. [HG12] by Henry Garrett (2022), “(Neutrosophic) 1-Failed Super- 378
HyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] 379
by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 380
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 381
[HG14] by Henry Garrett (2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHy- 382
perFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition 383
And Beyond” in Ref. [HG15] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on 384
Cancer’s Recognition by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. 385
[HG16] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neut- 386
rosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 387
in Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 388
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 389

SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 390
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 391
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 392
SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 393
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 394
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 395

(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 396
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 397
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Su- 398
perHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some 399

SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and Super- 400

HyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett 401
(2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs 402
And Their Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] 403
by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 404
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett 405
(2023), “The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme 406
Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial on 407
(Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed 408
SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Connections 409
of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. 410
[HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In 411
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s 412
Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), 413
“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutro- 414
sophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 415
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 416
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 417
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 418
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 419
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 420
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To Super- 421
HyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] 422
by Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 423

[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 425
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 426
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 427
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 428
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 429
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 430
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 431
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry 432
Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 433
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 434
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 435
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. 436
[HG38] by Henry Garrett (2022), there are some endeavors to formalize the basic SuperHyper- 437
Notions about neutrosophic SuperHyperGraph and SuperHyperGraph. 438
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 439
in Ref. [HG39] by Henry Garrett (2022) which is indexed by Google Scholar and has more 440
than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Ohio: 441
E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United 442
State. This research book covers different types of notions and settings in neutrosophic graph 443
theory and neutrosophic SuperHyperGraph theory. 444
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 445

as book in Ref. [HG40] by Henry Garrett (2022) which is indexed by Google Scholar and has 446
more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Florida: 447
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on the 454
framework of Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique 455
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; 456
HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 457
HG33; HG34; HG35; HG36; HG37; HG38]. Two popular scientific research books in Scribd 459
in the terms of high readers, 2638 and 3363 respectively, on neutrosophic science is on [HG39; 460
HG40]. 461

Bibliography 462
HG1 [1] Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyper- 463
Graph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 10.5281/zen- 464
odo.6456413). (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). (ht- 465
tps://digitalrepository.unm.edu/nss_journal/vol49/iss1/34). 466
HG2 [2] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 467
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 468
Trends Comp Sci Res 1(1) (2022) 06-14. 469
HG3 [3] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic 470
Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 471
Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. 472
HG4 [4] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 473
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 474
CERN European Organization for Nuclear scientific research - Zenodo, Nov. 2022. CERN 475
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 476

https://oa.mg/work/10.5281/zenodo.6319942 477
HG5 [5] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 478
European Organization for Nuclear scientific research - Zenodo, Feb. 2022. CERN 479
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 480

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

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 484
HG7 [7] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 485
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic Supe- 486
rHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 10.20944/pre- 487
prints202301.0282.v1). 488
HG8 [8] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 489
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 490
10.20944/preprints202301.0267.v1). 491
19
HG9 [9] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 492
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 493
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 494
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 495
(doi: 10.20944/preprints202301.0265.v1). 496
HG10 [10] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 497
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 498
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 499
prints202301.0262.v1). 500
HG11 [11] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 501
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyper- 502
Graphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 503
HG12 [12] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 504
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224, 505

(doi: 10.20944/preprints202301.0224.v1). 506
HG13 [13] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 507
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 508

prints202301.0105.v1). 509
HG14 [14] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 510
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 511
HG15 [15] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 513
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 514
Preprints 2023, 2023010044 515
HG16 [16] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 516
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 517
10.20944/preprints202301.0043.v1). 518
HG17 [17] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 519
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 520
HG19 [19] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 525
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 526
(doi: 10.20944/preprints202212.0549.v1). 527
HG20 [20] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 528
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 529
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 530
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 531

HG21 [21] Henry Garrett, “SuperHyperCycle on SuperHyperGraph and Neutrosophic SuperHyperGraph 532
With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 (doi: 533
10.20944/preprints202212.0500.v1). 534
HG22 [22] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 535
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 536
HG23 [23] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 538
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 539
HG24 [24] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 541

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 542
10.13140/RG.2.2.35061.65767). 543
HG25 [25] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 544
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 545
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 546
10.13140/RG.2.2.18494.15680). 547
HG26 [26] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 548
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 549
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 550

10.13140/RG.2.2.32530.73922). 551
HG27 [27] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 552
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 553

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 554
10.13140/RG.2.2.15897.70243). 555
HG28 [28] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 556
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 557
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 558
HG29 [29] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 559
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 560
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 561
10.13140/RG.2.2.23172.19849). 562
HG30 [30] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic 563
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of 564
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968). 565
HG31 [31] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyper- 566
Model Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, 567
(doi: 10.13140/RG.2.2.28945.92007). 568

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

HG35 [35] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 578
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 579
10.13140/RG.2.2.29430.88642). 580
HG37 [37] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 584
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 585
10.13140/RG.2.2.29173.86244). 586
HG38 [38] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 587
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph 588

(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 589
HG39 [39] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 590
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 979-1- 591
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 592
HG40 [40] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - 593
Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 594

| Book #107 596

| Title: SuperHyperConnected 597
#Latest_Updates 598
#The_Links 599
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG Twitter 600
LinkedIn Amazon googlebooks GooglePlay 601
– 602
603
#Latest_Updates 604
605
#The_Links 606
607
| Book #107 608
609
|Title: SuperHyperConnected 610
611
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG 612
Twitter LinkedIn Amazon googlebooks GooglePlay 613
614
– 615
616
| Publisher | 617
(Paperback): https://www.amazon.com/dp/- 618
(Hardcover): https://www.amazon.com/dp/- 619

(Kindle Edition): https://www.amazon.com/dp/- 620
621
– 622
623
| ISBN | 624
(Paperback): - 625
(Hardcover): - 626
(Kindle Edition): CC BY-NC-ND 4.0 627
(EBook): CC BY-NC-ND 4.0 628
629
– 630
631
| Print length | 632
(Paperback): - pages 633
(Hardcover): - pages 634
(Kindle Edition): - pages 635
(E-Book): 290 pages 636
637
– 638
639
#Latest_Updates 640
641

#The_Links 642
643
| ResearchGate: https://www.researchgate.net/publication/- 644
645
| WordPress: https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperConnected/ 646
647
@Scribd: https://www.scribd.com/document/- 648

649
| academia: https://www.academia.edu/- 650
651
| ZENODO_ORG: https://zenodo.org/record/- 652
653
| googlebooks: https://books.google.com/books/about?id=- 654
655
| GooglePlay: https://play.google.com/store/books/details?id=- 656
657
658

Figure 2.1: “#107th Book” || SuperHyperConnected February 2023 License: CC BY-NC-ND 4.0
Print length: 290 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs
SuperHyperConnected (Published Version) 659
660
The Link: 661
662
https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperConnected/ 663
664
– 665
666
Posted by Dr. Henry Garrett 667
668
February 18, 2023 669
670
Posted in 0107 | SuperHyperConnected 671
672
Tags: 673
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 674
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 675
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 676
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 677
neutrosophic SuperHyperGraphs, Neutrosophic SuperHyperConnected, Open Problems, Open 678

Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World Applications, Recent 679
Research, Recognitions, Research, scientific research Article, scientific research Articles, scientific 680
research Book, scientific research Chapter, scientific research Chapters, Review, SuperHyper- 681
Classes, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, SuperHyperGraphs, 682
SuperHyperConnected, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 683
Vertices. 684


In this scientific research book, there are some scientific research chapters on “Extreme SuperHy- 685
perConnected” and “Neutrosophic SuperHyperConnected” about some researches on Extreme 686
SuperHyperConnected and neutrosophic SuperHyperConnected. 687

CHAPTER 3 688
Acknowledgements 689
The author is going to express his gratitude and his appreciation about the brains and their 690
hands which are showing the importance of words in the framework of every wisdom, knowledge, 691
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
692 words of mind and th
to have the material and the contents which are only the way to flourish the minds, to grow the minds of words, are too
693
eligible to be in the stage
notions, to advance the ways and to make the stable ways to be amid events and storms of minds 694
of acknowledgements
for surviving from them and making the outstanding experiences about the tools and the ideas 695
to be on the star lines of words and shining like stars, forever. 696
29
CHAPTER 4 697
Extreme SuperHyperDominating 698
The following sections are cited as follows, which is my 156th manuscript and I use prefix 158 as 699
number before any new labelling for new items. 700
701
2023, (doi: 10.13140/RG.2.2.13121.84321). 704
705
706
708
2023, (doi: 10.13140/RG.2.2.13121.84321). 711
Article #156 712
713
716
718

720
722

10.13140/RG.2.2.13121.84321). 726
#156th Article 727
February 2023 728
DOI: 10.13140/RG.2.2.13121.84321 729
31
2023, (doi: 10.13140/RG.2.2.13121.84321).

GooglePlay 734

2023, (doi: 10.13140/RG.2.2.13121.84321).
2023, (doi: 10.13140/RG.2.2.13121.84321).

CHAPTER 5 735
New Ideas On Super Missing By Hyper 736
Searching Of SuperHyperDominating In 737
Cancer’s Recognition With (Neutrosophic) 738
SuperHyperGraph 739
35
CHAPTER 6 740
ABSTRACT 741
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDominating). 742

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Consider a 743
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 744

or E 0 is called Neutrosophic e-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 745
that Va ∈ Ei , Ej ; Neutrosophic re-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 746
such that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 747
Neutrosophic v-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 748
and Neutrosophic rv-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 749
Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutro- 750

sophic SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 751
sophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neutrosophic rv- 752
SuperHyperDominating. ((Neutrosophic) SuperHyperDominating). Assume a Neutrosophic Supe- 753
rHyperGraph (NSHG) S is an ordered pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 754
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperDominating if it’s either of 755
Neutrosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutrosophic 756

v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) for an 757
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 758
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive 759
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 760
form the Extreme SuperHyperDominating; a Neutrosophic SuperHyperDominating if it’s either of 761

v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) for a 763
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 764
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 765
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 766
such that they form the Neutrosophic SuperHyperDominating; an Extreme SuperHyperDom- 767
inating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 768

sophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neutrosophic 769
rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 770
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Ex- 771
treme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an 772
Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges 773
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 774
37
and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHy- 775
perDominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDominating, 776
Neutrosophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neut- 777
rosophic rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph 778
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coef- 779
ficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 780
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 781

dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 782
that they form the Neutrosophic SuperHyperDominating; and the Neutrosophic power is cor- 783
responded to its Neutrosophic coefficient; an Extreme V-SuperHyperDominating if it’s either 784
of Neutrosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutro- 785
sophic v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 786
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of 787
an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVer- 788
tices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme Su- 789
perHyperVertices such that they form the Extreme SuperHyperDominating; a Neutrosophic 790
V-SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 791
rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 793
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 794
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 795
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 796
perDominating; an Extreme V-SuperHyperDominating SuperHyperPolynomial if it’s either of 797

Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 800
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 801
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardin- 802
ality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 803
form the Extreme SuperHyperDominating; and the Extreme power is corresponded to its Ex- 804
treme coefficient; a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 805

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 808
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 809
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 810

of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 811
SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating; and the 812
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 813
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperDominating and 814
Neutrosophic SuperHyperDominating. Two different types of SuperHyperDefinitions are debut 815
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 816
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 817
implemented in the whole of this research. For shining the elegancy and the significancy of this 818
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 819
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 820

Recognition” are the under research to figure out the challenges make sense about ongoing and 823
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 824
different types of them. Some of them are individuals and some of them are well-modeled by 825
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 826
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 827
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 828
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 829
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 830
research. It’s also officially collected in the form of some questions and some problems. As- 831
sume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDominating is 832
a maximal of SuperHyperVertices with a maximum cardinality such that either of the fol- 833
lowing expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 834
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 835
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 836
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDominating is a maximal 837
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 838
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 840
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 841
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 842
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Super- 843
HyperDominating . Since there’s more ways to get type-results to make a SuperHyperDominating 844
more understandable. For the sake of having Neutrosophic SuperHyperDominating, there’s a 845
need to “redefine” the notion of a “SuperHyperDominating ”. The SuperHyperVertices and the 846
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 847
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperDominating 848
. It’s redefined a Neutrosophic SuperHyperDominating if the mentioned Table holds, concerning, 849
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 850
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The 851
Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 852
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 853
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 854
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 855
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperDominating 856

. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind 857
of SuperHyperClass. If there’s a need to have all SuperHyperDominating until the SuperHy- 858
perDominating, then it’s officially called a “SuperHyperDominating” but otherwise, it isn’t a 859
SuperHyperDominating . There are some instances about the clarifications for the main definition 860
titled a “SuperHyperDominating ”. These two examples get more scrutiny and discernment 861
since there are characterized in the disciplinary ways of the SuperHyperClass based on a Supe- 862
rHyperDominating . For the sake of having a Neutrosophic SuperHyperDominating, there’s a 863
need to “redefine” the notion of a “Neutrosophic SuperHyperDominating” and a “Neutrosophic 864
SuperHyperDominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by 865
the labels from the letters of the alphabets. In this procedure, there’s the usage of the position 866

of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 867
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperDominating are 868
redefined to a “Neutrosophic SuperHyperDominating” if the intended Table holds. It’s useful to 869
define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 870
type-results to make a Neutrosophic SuperHyperDominating more understandable. Assume a 871
Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 872
Table holds. Thus SuperHyperPath, SuperHyperDominating, SuperHyperStar, SuperHyperBi- 873

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 874
“Neutrosophic SuperHyperDominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic Super- 875
HyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 876
if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperDominating” 877
where it’s the strongest [the maximum Neutrosophic value from all the SuperHyperDominating 878
amid the maximum value amid all SuperHyperVertices from a SuperHyperDominating .] Super- 879
HyperDominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number 880
of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 881
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 882
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperDominating if 883
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 884
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 885
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 899
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 900
SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, SuperHyperBipartite, SuperHyper- 909
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperDominating 910
or the strongest SuperHyperDominating in those Neutrosophic SuperHyperModels. For the 911
longest SuperHyperDominating, called SuperHyperDominating, and the strongest SuperHyper- 912

Dominating, called Neutrosophic SuperHyperDominating, some general results are introduced. 913
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 914
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 915
a SuperHyperDominating. There isn’t any formation of any SuperHyperDominating but literarily, 916
it’s the deformation of any SuperHyperDominating. It, literarily, deforms and it doesn’t form. 917
A basic familiarity with Neutrosophic SuperHyperDominating theory, SuperHyperGraphs, and 918
Neutrosophic SuperHyperGraphs theory are proposed. 919

Keywords: Neutrosophic SuperHyperGraph, SuperHyperDominating, Cancer’s Neutrosophic 920
Recognition 921

CHAPTER 7 923
Background 924

in issue 49 and the pages 531-561. In this research article, different types of notions like domin- 930
ating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) 931

degree alongside chromatic numbers in the setting of some classes related to neutrosophic 942
hypergraphs” in Ref. [HG2] by Henry Garrett (2022). In this research article, a novel approach 943
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 945
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 946
Research (JCTCSR)” with abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 947
with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 948
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 949
based on initial background. 950
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory 952
and Neutrosophic Super Hyper Classes” in Ref. [HG3] by Henry Garrett (2022). In this 953
research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 954
SuperHyperGraph based on fundamental SuperHyperNumber and using neutrosophic SuperHy- 955
perClasses of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 956
entitled “Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 957
43
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 958
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 959
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 960
and fundamental SuperHyperNumbers. 961
In some articles are titled “0039 | Closing Numbers and SupeV-Closing Numbers as 962
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 963
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 964

Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme Super- 965
HyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 966
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 967
“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 968
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 969
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 970
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 971
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 972
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 973
Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 974
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 975
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 976
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 977
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 978
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 979
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 980
Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 981
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 982

Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 983
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 985
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 986
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 987
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 988

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 989
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 990
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 991
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 992
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 993
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 994
Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 995
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 996
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 997
Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 998
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 999
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 1000
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutro- 1001
sophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on 1002
SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 1003

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 1004
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 1005
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 1006
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 1007
Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 1008
Garrett (2022), “SuperHyperMatching By (V-)Definitions And Polynomials To Monitor Cancer’s 1009
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 1010

“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 1011
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 1012
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 1013
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 1014
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 1015
Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 1016
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 1017
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 1018
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 1019
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 1020
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of 1023
Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 1024
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1026
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 1027
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 1028


“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 1036
eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 1037
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1038
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 1039

(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 1040
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 1041
in Ref. [HG38] by Henry Garrett (2022), there are some endeavors to formalize the basic 1042
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph. 1043

See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 1059
the framework of Extreme SuperHyperDominating theory, Neutrosophic SuperHyperDominating 1060
HG40]. 1066

CHAPTER 8 1067
Applied Notions Under The Scrutiny Of 1068
The Motivation Of This Scientific Research 1069
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1070
try to bring the motivations in the narrative ways. Some cells have been faced with some 1071
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1072
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1073
as some groups and some groups or individuals have excessive labels which all are raised from 1074
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1075
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1076
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1077
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1078
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1079
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1080
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1081
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1082
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1083
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1084
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1085
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1086
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1087
disease but the model is going to figure out what’s going on this phenomenon. The special case of 1088
this disease is considered and as the consequences of the model, some parameters are used. The 1089
cells are under attack of this disease but the moves of the cancer in the special region are the matter 1090
of mind. The recognition of the cancer could help to find some treatments for this disease. The 1091
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1092
Recognition” and both bases are the background of this research. Sometimes the cancer has been 1093
happened on the region, full of cells, groups of cells and embedded styles. In this segment, the 1094
SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the moves of 1095
the cancer in the forms of alliances’ styles with the formation of the design and the architecture 1096
are formally called “ SuperHyperDominating” in the themes of jargons and buzzwords. The prefix 1097
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 1098
SuperHyperNotions. The recognition of the cancer in the long-term function. The specific region 1099
47
the effects of the cancer on that region; this event leads us to choose another model [it’s said to be 1103
Extreme SuperHyperGraph] to have convenient perception on what’s happened and what’s done. 1104
There are some specific models, which are well-known and they’ve got the names, and some general 1105
models. The moves and the traces of the cancer on the complex tracks and between complicated 1106
groups of cells could be fantasized by a Extreme SuperHyperPath (-/SuperHyperDominating, 1107

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 1108
is to find either the optimal SuperHyperDominating or the Extreme SuperHyperDominating 1109
in those Extreme SuperHyperModels. Some general results are introduced. Beyond that in 1110
SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1111
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1112
SuperHyperDominating. There isn’t any formation of any SuperHyperDominating but literarily, 1113
Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1115
amount of SuperHyperDominating” of either individual of cells or the groups of cells based on the 1116
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDominating” based 1117
on the fixed groups of cells or the fixed groups of group of cells? 1118
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1119
messy and dense SuperHyperModels where embedded notions are illustrated? 1120
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1121
Thus it motivates us to define different types of “ SuperHyperDominating” and “Extreme 1122
SuperHyperDominating” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1123
research has taken more motivations to define SuperHyperClasses and to find some connections 1124
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances 1125
and examples to make clarifications about the framework of this research. The general results 1126
and some results about some connections are some avenues to make key point of this research, 1127
“Cancer’s Recognition”, more understandable and more clear. 1128
The framework of this research is as follows. In the beginning, I introduce basic definitions to clarify 1129
about preliminaries. In the subsection “Preliminaries”, initial definitions about SuperHyperGraphs 1130
and Extreme SuperHyperGraph are deeply-introduced and in-depth-discussed. The elementary 1131
concepts are clarified and illustrated completely and sometimes review literature are applied to 1132
make sense about what’s going to figure out about the upcoming sections. The main definitions and 1133
their clarifications alongside some results about new notions, SuperHyperDominating and Extreme 1134
SuperHyperDominating, are figured out in sections “ SuperHyperDominating” and “Extreme 1135
SuperHyperDominating”. In the sense of tackling on getting results and in order to make sense 1136
about continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform 1137
are introduced and as their consequences, corresponded SuperHyperClasses are figured out to 1138
debut what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1139
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1140
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1141
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1142
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations and 1143
as concluding and closing section of theoretical research are contained in the section “General 1144
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1145

fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 1146
SuperHyperDominating”, “Extreme SuperHyperDominating”, “Results on SuperHyperClasses” 1147
and “Results on Extreme SuperHyperClasses”. There are curious questions about what’s done 1148
about the SuperHyperNotions to make sense about excellency of this research and going to 1149
figure out the word “best” as the description and adjective for this research as presented 1150
in section, “ SuperHyperDominating”. The keyword of this research debut in the section 1151
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial Steps 1152
Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps Toward 1153
SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there are some 1154
scrutiny and discernment on what’s done and what’s happened in this research in the terms 1155
of “questions” and “problems” to make sense to figure out this research in featured style. The 1156
advantages and the limitations of this research alongside about what’s done in this research to 1157
make sense and to get sense about what’s figured out are included in the section, “Conclusion 1158
and Closing Remarks”. 1159

CHAPTER 9 1160
Extreme Preliminaries Of This Scientific 1161
Research On the Redeemed Ways 1162
In this section, the basic material in this scientific research, is referred to [Single Valued 1163
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1164
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1165

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [t- 1166
norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyper- 1167
Graph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1168
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1169
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1170
their clarifications are addressed to Ref.[HG38]. 1171

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

Let X be a space of points (objects) with generic elements in X denoted by x; then the
Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}

+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 1174
Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

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

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {<
x : TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,

and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 9.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 1175
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 1176

S = (V, E), where 1177
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1178
(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); 1179
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1180
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1, 2, . . . , n0 ); 1181
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1182
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1183
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1184
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1185
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 . 1186
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1187
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1188
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1189

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1190
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1191
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1192
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1193
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1194
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1195

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

(Ref.[HG38],Definition 2.7,p.3). 1197
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). The 1198
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) 1199
Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up 1200
items. 1201
(i) If |Vi | = 1, then Vi is called vertex; 1202
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1203
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1204
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1205
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1206
SuperEdge; 1207
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1208
SuperHyperEdge. 1209
If we choose different types of binary operations, then we could get hugely diverse types of 1210
general forms of Neutrosophic SuperHyperGraph (NSHG). 1211
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1212

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1213
x, y, z, w ∈ [0, 1]: 1214
(i) 1 ⊗ x = x; 1215
(ii) x ⊗ y = y ⊗ x; 1216
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1217
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1218

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {<
x : TA (x), IA (x), FA (x) >, x ∈ X} (with respect to t-norm Tnorm ):
TA (X) = Tnorm [TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = Tnorm [IA (vi ), IA (vj )]vi ,vj ∈X ,

and FA (X) = Tnorm [FA (vi ), FA (vj )]vi ,vj ∈X .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 9.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 1219

S = (V, E), where 1221

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1226
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1227
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1228
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1229
0

items. 1244
SuperEdge; 1250
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1253
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1254
makes the patterns and regularities. 1255
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1256
of elements of SuperHyperEdges are the same. 1257

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1258
makes to have SuperHyperUniform more understandable. 1259
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1260
as follows. 1261
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1262
two given SuperHyperEdges with two exceptions; 1263
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1264
SuperHyperEdges; 1265
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1266
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1267
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1268
in common; 1269
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1270
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1271
SuperHyperEdge in common; 1272
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1273
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1274
SuperVertex. 1275
Definition 9.0.14. Let an ordered 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 1276

(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1277
(i) Vi , Vi+1 ∈ Ei0 ; 1278
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1279
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1280
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1281
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1282
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1283
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1284
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1285
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 9.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 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. 1287
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1288
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1289
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1290
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHyper- 1291
Path . 1292
Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

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

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1301
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic t-strength of 1302

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1311
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 1312
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1313
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperDominating). 1314


or E 0 is called 1317
(i) Neutrosophic e-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 1318

that Va ∈ Ei , Ej ; 1319
(ii) Neutrosophic re-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 1320

that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1321
(iii) Neutrosophic v-SuperHyperDominating if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 1322

that Vi , Vj 6∈ Ea ; 1323
(iv) Neutrosophic rv-SuperHyperDominating if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 1324

that Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1325
(v) Neutrosophic SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating,

1326
Neutrosophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and 1327
Neutrosophic rv-SuperHyperDominating. 1328
Definition 9.0.19. ((Neutrosophic) SuperHyperDominating). 1329

(i) an Extreme SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating,

1332
Neutrosophic rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph 1334
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1335
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 1336
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1337
form the Extreme SuperHyperDominating; 1338
(ii) a Neutrosophic SuperHyperDominating if it’s either of Neutrosophic e- 1339

SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutrosophic v- 1340
SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 1341
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1342
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 1343
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1344
SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating; 1345

(iii) an Extreme SuperHyperDominating SuperHyperPolynomial if it’s either of Neut- 1346

rosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutrosophic 1347
v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 1348
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1349
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1350
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 1351
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 1352

tices such that they form the Extreme SuperHyperDominating; and the Extreme power is 1353
corresponded to its Extreme coefficient; 1354
(iv) a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 1355

Neutrosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neut- 1356
rosophic v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and 1357
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1358
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1359
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 1360

of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 1361
sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1362
Neutrosophic SuperHyperDominating; and the Neutrosophic power is corresponded to its 1363
Neutrosophic coefficient; 1364
(v) an Extreme V-SuperHyperDominating if it’s either of Neutrosophic e- 1365

an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 1369

Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 1370
SuperHyperVertices such that they form the Extreme SuperHyperDominating; 1371
(vi) a Neutrosophic V-SuperHyperDominating if it’s either of Neutrosophic e- 1372

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 1376
(vii) an Extreme V-SuperHyperDominating SuperHyperPolynomial if it’s either of 1379

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 1382
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 1383
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1384
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 1385
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 1386
and the Extreme power is corresponded to its Extreme coefficient; 1387
(viii) a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 1388


number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 1393

Neutrosophic coefficient. 1397
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDominating). 1398

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Then 1399
(i) an δ−SuperHyperDominating is a Neutrosophic kind of Neutrosophic SuperHyperDom- 1400

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

(23.1), holds if S is an δ−SuperHyperDefensive; 1404
(ii) a Neutrosophic δ−SuperHyperDominating is a Neutrosophic kind of Neutrosophic 1405

SuperHyperDominating such that either of the following Neutrosophic expressions hold for 1406
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1407
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 1408

the Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1409
For the sake of having a Neutrosophic SuperHyperDominating, there’s a need to “redefine” the 1410
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 1411

are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1412
of the position of labels to assign to the values. 1413
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 1414
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (23.1) holds. 1415
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1416
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1417
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (23.2) 1419
holds. Thus Neutrosophic SuperHyperPath , SuperHyperDominating, SuperHyperStar, 1420
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1421
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1422
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1423
Neutrosophic SuperHyperWheel if the Table (23.2) holds. 1424

Table 9.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (23.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 (23.0.22)

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperDominating. Since 1425

there’s more ways to get type-results to make a Neutrosophic SuperHyperDominating more 1426
Neutrosophicly understandable. 1427
Neutrosophic notion of “Neutrosophic SuperHyperDominating”. The SuperHyperVertices and the 1429

there’s the usage of the position of labels to assign to the values. 1431
136DEF1 Definition 9.0.23. Assume a SuperHyperDominating. It’s redefined a Neutrosophic Super- 1432
HyperDominating if the Table (23.3) holds. 1433

CHAPTER 10 1434
Extreme SuperHyperDominating But As 1435
The Extensions Excerpt From Dense And 1436
Super Forms 1437
136EXM1 Example 10.0.1. Assume a Extreme SuperHyperGraph (NSHG) S is an ordered pair S = (V, E) 1438
in the mentioned Extreme Figures in every Extreme items. 1439
• On the Figure (24.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDom- 1440
inating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 1441
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is a 1442
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 1443
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 1444
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 1445
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 1446
SuperHyperDominating. 1447
C(N SHG)Extreme SuperHyperDominating = {E4 }.

C(N SHG)Extreme SuperHyperDominating SuperHyperPolynomial = z.
C(N SHG)Extreme V-SuperHyperDominating = {V4 }.
C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial = 3z.
1448
inating, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 1450
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the 1451
terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 1452
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 1453
SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , 1454
61
Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperDominating in the Extreme Example (24.0.1) 136NSHG1
is excluded in every given Extreme SuperHyperDominating. 1455

C(N SHG)Extreme V-Quasi-SuperHyperDominating SuperHyperPolynomial = 3z.
1456
inating, is up. The Extreme Algorithm is Extremely straightforward. 1458

C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial = 3z.
1459
C(N SHG)Neutrosophic SuperHyperDominating = {E2 , E4 }.

C(N SHG)Neutrosophic SuperHyperDominating SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic V-SuperHyperDominating = {V1 , V4 }.


C(N SHG)Neutrosophic V-SuperHyperDominating SuperHyperPolynomial =

5 × 3z 2 .
1462

C(N SHG)Extreme SuperHyperDominating SuperHyperPolynomial = 4z.
C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial = z.
1465
C(N SHG)Neutrosophic SuperHyperDominating

= {E3i+13i=0 , E3i+233i=0 }.
C(N SHG)Neutrosophic SuperHyperDominating SuperHyperPolynomial
= 3 × 3z 8 .
C(N SHG)Neutrosophic V-SuperHyperDominating
= {V3i+13i=0 , V3i+113i=0 }.
C(N SHG)Neutrosophic V-SuperHyperDominating SuperHyperPolynomial

= 3 × 3z 8 .
1468
C(N SHG)Extreme SuperHyperDominating = {E15 , E16 , E17 }.

C(N SHG)Extreme SuperHyperDominating SuperHyperPolynomial
= 3 × 3z 3 .
C(N SHG)Extreme V-SuperHyperDominating = {V3 , V6 , V8 }.
C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial
= 4 × 5 × 5z 3 .
1471



C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial =

= 4 × 5 × 5z 3 .
1474

= {E3i+13i=0 , E23 }.
= 3z 5 .
= {V3i+13i=0 , V11 }.
= 3 × 11z 5 .
1477


= 4 × 5 × 5z 3 .
1480

C(N SHG)Neutrosophic SuperHyperDominating SuperHyperPolynomial z 2 .
= 3 × 3z 3 .
1483



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

= 5 × 5z 5 .
1486
C(N SHG)Extreme SuperHyperDominatingConnected = {E3 , E9 }.

C(N SHG)Extreme SuperHyperDominating SuperHyperPolynomial = z 2 .
C(N SHG)Extreme V-SuperHyperDominating = {V1 , V6 }.
= 3 × 3z 2 .
1489


1492
C(N SHG)Extreme SuperHyperDominating = {E2 , E5 }.

C(N SHG)Extreme SuperHyperDominating SuperHyperPolynomial = 4z 2 .
C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial = z 2 .
1495


4 × 3z 3 .
1498



C(N SHG)Extreme V-SuperHyperDominating = {V1 , V2 , V7 , V17 }.

4 × 3z 4 .
1501

2 × 4 × 3z 4 .
1504
C(N SHG)Neutrosophic SuperHyperDominating = {E3i+1i=03 }.


C(N SHG)Neutrosophic V-SuperHyperDominating = {V3i+1i=03 }.

C(N SHG)Neutrosophic V-SuperHyperDominating SuperHyperPolynomial = 34 .
1507

1510
C(N SHG)Neutrosophic SuperHyperDominating = {E2 }.

C(N SHG)Neutrosophic SuperHyperDominating SuperHyperPolynomial = z.
C(N SHG)Neutrosophic V-SuperHyperDominating = {V1 }.
C(N SHG)Neutrosophic V-SuperHyperDominating SuperHyperPolynomial = 10z.

1513

= 5 × 1z 2 .
1516


SuperHyperDominating in the Extreme Example (24.0.1) 95NHG1

SuperHyperDominating in the Extreme Example (24.0.1) 95NHG2

CHAPTER 11 1517
The Extreme Departures on The 1518
Theoretical Results Toward Theoretical 1519
Motivations 1520
The previous Extreme approach apply on the upcoming Extreme results on Extreme 1521
SuperHyperClasses. 1522
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 1523
C(N SHG)Extreme SuperHyperDominating =

|EESHG:(V,E) |
Extreme Cardinality
c
= {E3i+1 }i=0 3
.
|EESHG:(V,E) |
Extreme Cardinality
= 3z c 3 .
C(N SHG)Extreme V-SuperHyperDominating
|EESHG:(V,E) |
Extreme Cardinality
c
= {V EXT ERN AL 3i+1 }i=0 3
.
|EESHG:(V,E) |
Y Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality 3z c 3 .
Proof. Let 1524
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |EESHG:(V,E) |
Extreme Cardinality
, V EXT ERN AL |EESHG:(V,E) |
Extreme Cardinality
c 3 −1 c 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 1525
81
Figure 11.1: a Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperDom-

inating in the Example (25.0.2) 136NSHG18a
new way to redefine as 1526
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 1527
ViEXT ERN AL in the literatures of SuperHyperDominating. The latter is straightforward. 1528
136EXM18a Example 11.0.2. In the Figure (25.1), the connected Extreme SuperHyperPath ESHP : (V, E), 1529
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 1530
(25.1), is the SuperHyperDominating. 1531
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 1532
C(N SHG)Extreme SuperHyperDominating =

|EESHG:(V,E) |
Extreme Cardinality
c
= {E3i+1 }i=0 3
.
|EESHG:(V,E) |
Extreme Cardinality
= 3z c 3 .

|EESHG:(V,E) |
Extreme Cardinality
c
.
|EESHG:(V,E) |
Y Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality 3z c 3 .
Proof. Let 1533
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |EESHG:(V,E) |
Extreme Cardinality
Extreme Cardinality
c 3 −1 c 3
be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 1534

136EXM19a Example 11.0.4. In the Figure (25.2), the connected Extreme SuperHyperCycle N SHC : 1538
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 1539
SuperHyperModel (25.2), is the Extreme SuperHyperDominating. 1540
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 1541
C(N SHG)Extreme SuperHyperDominating = {Ei ∈ EESHG:(V,E) }.

= |i | Ei ∈ |EESHG:(V,E) |Extreme Cardinality |z.
C(N SHG)Extreme V-SuperHyperDominating = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 1542
P : ViEXT ERN AL , Ei , CEN T ER, Ej .
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 1543
way to redefine as 1544


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

SuperHyperDominating in the Extreme Example (25.0.4) 136NSHG19a
136EXM20a Example 11.0.6. In the Figure (25.3), the connected Extreme SuperHyperStar ESHS : (V, E), 1547
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 1548
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 1549
ESHS : (V, E), in the Extreme SuperHyperModel (25.3), is the Extreme SuperHyperDominating. 1550
1551
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 1552
C(N SHG)Extreme SuperHyperDominating

= {Ea ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
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
= {VaEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

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


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 1553
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 1554
a new way to redefine as 1555

ViEXT ERN AL in the literatures of SuperHyperDominating. The latter is straightforward. Then 1557
there’s no at least one SuperHyperDominating. Thus the notion of quasi may be up but 1558

the SuperHyperNotions based on SuperHyperDominating could be applied. There are only 1559
two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 1560
representative in the 1561
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperDominating taken from a connected Extreme SuperHyperBipart- 1562

ite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 1563
SuperHyperPart SuperHyperEdges are attained in any solution 1564
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
The latter is straightforward. 1565
136EXM21a Example 11.0.8. In the Extreme Figure (25.4), the connected Extreme SuperHyperBipartite 1566
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 1567
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 1568
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 1569
Extreme SuperHyperModel (25.4), is the Extreme SuperHyperDominating. 1570
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). Then 1571
C(N SHG)Extreme SuperHyperDominating

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

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 1572
P :
V1EXT ERN AL , E1 ,

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

Extreme SuperHyperDominating in the Example (25.0.8) 136NSHG21a
V2EXT ERN AL , E2
is a longest SuperHyperDominating taken from a connected Extreme SuperHyperMultipartite 1573

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

z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 1579
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). Thus 1581
only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart SuperHyperEdges 1582

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

SuperHyperDominating in the Example (25.0.10) 136NSHG22a
are attained in any solution 1583
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). The 1584
latter is straightforward. 1585
136EXM22a Example 11.0.10. In the Figure (25.5), the connected Extreme SuperHyperMultipartite ESHM : 1586
(V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by the 1587
Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 1588
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (25.5), is 1589
the Extreme SuperHyperDominating. 1590
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 1591
C(N SHG)Extreme SuperHyperDominating = {Ei ∈ EESHG:(V,E) }.

= |i | Ei ∈ |E ∗ ESHG:(V,E) |Extreme Cardinality |z.
C(N SHG)Extreme V-SuperHyperDominating = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 1592
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

Figure 11.6: a Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of Extreme
is a longest SuperHyperDominating taken from a connected Extreme SuperHyperWheel 1593

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

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 1595
to ViEXT ERN AL in the literatures of SuperHyperDominating. The latter is straightforward. 1596
Then there’s at least one SuperHyperDominating. Thus the notion of quasi isn’t up and the 1597
SuperHyperNotions based on SuperHyperDominating could be applied. The unique embedded 1598
SuperHyperDominating proposes some longest SuperHyperDominating excerpt from some 1599

representatives. The latter is straightforward. 1600
136EXM23a Example 11.0.12. In the Extreme Figure (25.6), the connected Extreme SuperHyperWheel 1601
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, by 1602
the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected Extreme 1603
SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (25.6), is the Extreme 1604

CHAPTER 12 1606
The Surveys of Mathematical Sets On The 1607
Results But As The Initial Motivation 1608
For the SuperHyperDominating, Extreme SuperHyperDominating, and the Extreme SuperHyper- 1609
Dominating, some general results are introduced. 1610
Remark 12.0.1. Let remind that the Extreme SuperHyperDominating is “redefined” on the 1611
positions of the alphabets. 1612
Corollary 12.0.2. Assume Extreme SuperHyperDominating. Then 1613
Extreme SuperHyperDominating =
{theSuperHyperDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperDominating
|ExtremecardinalityamidthoseSuperHyperDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 1614
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 1615
the neutrality, for i = 1, 2, 3, respectively. 1616
Corollary 12.0.3. Assume a Extreme SuperHyperGraph on the same identical letter of the alphabet. 1617
Then the notion of Extreme SuperHyperDominating and SuperHyperDominating coincide. 1618
Then a consecutive sequence of the SuperHyperVertices is a Extreme SuperHyperDominating if 1620
and only if it’s a SuperHyperDominating. 1621
Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperDominating if 1623
and only if it’s a longest SuperHyperDominating. 1624
Corollary 12.0.6. Assume SuperHyperClasses of a Extreme SuperHyperGraph on the same 1625

identical letter of the alphabet. Then its Extreme SuperHyperDominating is its SuperHyper- 1626
Dominating and reversely. 1627
Corollary 12.0.7. Assume a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, 1628
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter 1629
91
of the alphabet. Then its Extreme SuperHyperDominating is its SuperHyperDominating and 1630
reversely. 1631
Corollary 12.0.8. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperDominat- 1632
ing isn’t well-defined if and only if its SuperHyperDominating isn’t well-defined. 1633
Corollary 12.0.9. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its Extreme 1634
SuperHyperDominating isn’t well-defined if and only if its SuperHyperDominating isn’t well- 1635
defined. 1636
Corollary 12.0.10. Assume a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyper- 1637

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme Super- 1638
HyperDominating isn’t well-defined if and only if its SuperHyperDominating isn’t well-defined. 1639
Corollary 12.0.11. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperDomin- 1640
ating is well-defined if and only if its SuperHyperDominating is well-defined. 1641
Corollary 12.0.12. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its Extreme 1642
SuperHyperDominating is well-defined if and only if its SuperHyperDominating is well-defined. 1643
Corollary 12.0.13. Assume a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyper- 1644

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme Super- 1645
HyperDominating is well-defined if and only if its SuperHyperDominating is well-defined. 1646
Proposition 12.0.14. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then V is 1647
(i) : the dual SuperHyperDefensive SuperHyperDominating; 1648
(ii) : the strong dual SuperHyperDefensive SuperHyperDominating; 1649
(iii) : the connected dual SuperHyperDefensive SuperHyperDominating; 1650
(iv) : the δ-dual SuperHyperDefensive SuperHyperDominating; 1651
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDominating; 1652
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDominating. 1653
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be a Extreme SuperHyperGraph. Then ∅ is 1654
(i) : the SuperHyperDefensive SuperHyperDominating; 1655
(ii) : the strong SuperHyperDefensive SuperHyperDominating; 1656
(iii) : the connected defensive SuperHyperDefensive SuperHyperDominating; 1657
(iv) : the δ-SuperHyperDefensive SuperHyperDominating; 1658
(v) : the strong δ-SuperHyperDefensive SuperHyperDominating; 1659
(vi) : the connected δ-SuperHyperDefensive SuperHyperDominating. 1660
Proposition 12.0.16. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then an independent 1661
SuperHyperSet is 1662

(iii) : the connected SuperHyperDefensive SuperHyperDominating; 1665
Proposition 12.0.17. Let ESHG : (V, E) be a Extreme SuperHyperUniform SuperHyperGraph 1669

which is a SuperHyperDominating/SuperHyperPath. Then V is a maximal 1670
(i) : SuperHyperDefensive SuperHyperDominating; 1671
(ii) : strong SuperHyperDefensive SuperHyperDominating; 1672
(iii) : connected SuperHyperDefensive SuperHyperDominating; 1673
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDominating; 1674
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDominating; 1675
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDominating; 1676
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1677
Proposition 12.0.18. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is a SuperHy- 1678
perUniform SuperHyperWheel. Then V is a maximal 1679
(i) : dual SuperHyperDefensive SuperHyperDominating; 1680
(ii) : strong dual SuperHyperDefensive SuperHyperDominating; 1681
(iii) : connected dual SuperHyperDefensive SuperHyperDominating; 1682
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 1683
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 1684
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 1685
which is a SuperHyperDominating/SuperHyperPath. Then the number of 1688
(i) : the SuperHyperDominating; 1689
(ii) : the SuperHyperDominating; 1690
(iii) : the connected SuperHyperDominating; 1691
(iv) : the O(ESHG)-SuperHyperDominating; 1692

(v) : the strong O(ESHG)-SuperHyperDominating; 1693
(vi) : the connected O(ESHG)-SuperHyperDominating. 1694
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 1695
coincide. 1696

which is a SuperHyperWheel. Then the number of 1698
(i) : the dual SuperHyperDominating; 1699
(ii) : the dual SuperHyperDominating; 1700
(iii) : the dual connected SuperHyperDominating; 1701
(iv) : the dual O(ESHG)-SuperHyperDominating; 1702
(v) : the strong dual O(ESHG)-SuperHyperDominating; 1703
(vi) : the connected dual O(ESHG)-SuperHyperDominating. 1704
coincide. 1706

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 1708
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 1709
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 1710
is a 1711
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperDominating; 1715
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperDominating; 1716
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperDominating. 1717

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number 1720
of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1721
is a 1722

(iv) : δ-SuperHyperDefensive SuperHyperDominating; 1726
(v) : strong δ-SuperHyperDefensive SuperHyperDominating; 1727
(vi) : connected δ-SuperHyperDefensive SuperHyperDominating. 1728

SuperHyperMultipartite. Then Then the number of 1731
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying 1738
r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the 1739
exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1740
Proposition 12.0.24. Let ESHG : (V, E) be a Extreme SuperHyperGraph. The number of 1741
connected component is |V − S| if there’s a SuperHyperSet which is a dual 1742
(iv) : SuperHyperDominating; 1746
(v) : strong 1-SuperHyperDefensive SuperHyperDominating; 1747
(vi) : connected 1-SuperHyperDefensive SuperHyperDominating. 1748
Proposition 12.0.25. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then the number is 1749
at most O(ESHG) and the Extreme number is at most On (ESHG). 1750
Proposition 12.0.26. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Su- 1751
perHyperComplete. The number is O(ESHG:(V,E))2 + 1 and the Extreme number is 1752
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1753
t>
2

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperDominating; 1757
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperDominating. 1759
Proposition 12.0.27. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is ∅. The number 1760
is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of dual 1761
(iv) : 0-SuperHyperDefensive SuperHyperDominating; 1765
Proposition 12.0.28. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHyper- 1768
Complete. Then there’s no independent SuperHyperSet. 1769
Proposition 12.0.29. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHy- 1770
perDominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) and the 1771

Extreme number is On (ESHG : (V, E)), in the setting of a dual 1772
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 1776
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 1777
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating. 1778
Proposition 12.0.30. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Super- 1779
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 1780
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 1781
t>
2
setting of a dual 1782



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1789
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 1790
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of these 1791
specific SuperHyperClasses of the Extreme SuperHyperGraphs. 1792
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 1793
SuperHyperDefensive SuperHyperDominating, then ∀v ∈ V \ S, ∃x ∈ S such that 1794
(i) v ∈ Ns (x); 1795
(ii) vx ∈ E. 1796
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 1797
SuperHyperDefensive SuperHyperDominating, then 1798
(i) S is SuperHyperDominating set; 1799
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1800
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 1801
(i) Γ ≤ O; 1802
(ii) Γs ≤ On . 1803
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 1804
connected. Then 1805
(i) Γ ≤ O − 1; 1806
(ii) Γs ≤ On − Σ3i=1 σi (x). 1807
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1808
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperDom- 1809

inating; 1810
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1811
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1812
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 1813
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1815
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperDominating; 1816

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 1817
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1818
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 1819
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperDominating. Then 1821
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperDomin- 1822

ating; 1823
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 1824
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1825
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 1826
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperDominating. Then 1828

inating; 1830
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1832
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 1833
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 1835
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDominating; 1836
(ii) Γ = 1; 1837
(iii) Γs = Σ3i=1 σi (c); 1838
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDominating. 1839
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1840
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 1841
SuperHyperDefensive SuperHyperDominating; 1842
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1843
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1844
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 1845
SuperHyperDefensive SuperHyperDominating. 1846
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1847

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

2
; 1850
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperDominat- 1851
ing. 1852
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1853
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperDominating; 1854
(ii) Γ = b n2 c; 1855
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 1856
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHyper- 1857
Dominating. 1858
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyperStars 1859
with common Extreme SuperHyperVertex SuperHyperSet. Then 1860
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperDomin- 1861

ating for N SHF; 1862
(ii) Γ = m for N SHF : (V, E); 1863
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1864
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperDominating 1865
for N SHF : (V, E). 1866
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperComplete 1867

SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 1868
b n c+1
2
is a dual maximal SuperHyperDefensive SuperHyperDom- 1869
inating for N SHF; 1870
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1871

2
for N SHF : (V, E); 1872
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperDominating for 1873
N SHF : (V, E). 1874
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperComplete 1875

SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 1876
bnc
2
is a dual SuperHyperDefensive SuperHyperDominating for 1877
N SHF : (V, E); 1878

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

2
for N SHF : (V, E); 1880
S={vi }i=1
bnc
2
are only dual maximal SuperHyperDominating for 1881
N SHF : (V, E). 1882
Proposition 12.0.47. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then following 1883
statements hold; 1884
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 1885

SuperHyperDominating, then S is an s-SuperHyperDefensive SuperHyperDominating; 1886
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 1887

SuperHyperDominating, then S is a dual s-SuperHyperDefensive SuperHyperDominating. 1888
Proposition 12.0.48. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then following 1889
statements hold; 1890
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 1891

SuperHyperDominating, then S is an s-SuperHyperPowerful SuperHyperDominating; 1892

SuperHyperDominating, then S is a dual s-SuperHyperPowerful SuperHyperDominating. 1894
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 1895

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

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

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

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

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

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


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

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

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


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

2 c+1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 1929
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is (O − 1)-SuperHyperDefensive 1931
(iv) if ∀a ∈ V \S, |Ns (a)∩V \S| = 0, then ESHG : (V, E) is a dual (O−1)-SuperHyperDefensive 1933

SuperHyperGraph which is SuperHyperDominating. Then following statements hold; 1936
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperDom- 1937
inating; 1938
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1939

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

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

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

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

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


CHAPTER 13 1955
Extreme Applications in Cancer’s Extreme 1956
Recognition 1957
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1958
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1959
as the consequences of the model, some parameters are used. The cells are under attack of this 1960
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1961
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1962
In the following, some Extreme steps are Extreme devised on this disease. 1963
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1964
function. 1965
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s called 1966
Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer is 1967
identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1968
since there are some determinacy, indeterminacy and neutrality about the moves and the 1969
effects of the cancer on that region; this event leads us to choose another model [it’s said 1970
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1971
what’s done. 1972
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1973
they’ve got the names, and some general Extreme models. The moves and the Extreme 1974
traces of the cancer on the complex tracks and between complicated groups of cells could 1975
be fantasized by a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, 1976
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1977
either the Extreme SuperHyperDominating or the Extreme SuperHyperDominating in those 1978
Extreme Extreme SuperHyperModels. 1979
103
CHAPTER 14 1980
Case 1: The Initial Extreme Steps 1981
Toward Extreme SuperHyperBipartite 1982
as Extreme SuperHyperModel 1983
Step 4. (Extreme Solution) In the Extreme Figure (28.1), the Extreme SuperHyperBipartite is 1984
Extreme highlighted and Extreme featured. 1985
By using the Extreme Figure (28.1) and the Table (28.1), the Extreme SuperHyperBipartite 1986
is obtained. 1987
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme result, 1988
Figure 14.1: a Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHyper-

Dominating 136NSHGaa21aa
105
Belong to The Extreme SuperHyperBipartite

136TBLaa21aa
of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : 1989

(V, E), in the Extreme SuperHyperModel (28.1), is the Extreme SuperHyperDominating. 1990

CHAPTER 15 1991
Case 2: The Increasing Extreme Steps 1992
Toward Extreme 1993
SuperHyperMultipartite as Extreme 1994
SuperHyperModel 1995
Step 4. (Extreme Solution) In the Extreme Figure (29.1), the Extreme SuperHyperMultipartite 1996
is Extreme highlighted and Extreme featured. 1997
By using the Extreme Figure (29.1) and the Table (29.1), the Extreme SuperHyperMulti- 1998
partite is obtained. 1999
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 2000
Figure 15.1: a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperDominating 136NSHGaa22aa
107
Belong to The Extreme SuperHyperMultipartite

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

ESHM : (V, E), in the Extreme SuperHyperModel (29.1), is the Extreme SuperHyper- 2002
Dominating. 2003

CHAPTER 16 2004
Wondering Open Problems But As The 2005
Directions To Forming The Motivations 2006
In what follows, some “problems” and some “questions” are proposed. 2007
The SuperHyperDominating and the Extreme SuperHyperDominating are defined on a real-world 2008
application, titled “Cancer’s Recognitions”. 2009
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2010
recognitions? 2011
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperDominating and the 2012
Extreme SuperHyperDominating? 2013
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2014
them? 2015
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDominating 2016
and the Extreme SuperHyperDominating? 2017
Problem 16.0.5. The SuperHyperDominating and the Extreme SuperHyperDominating do a 2018

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperDominating, are 2019
there else? 2020
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2021
Numbers types-results? 2022
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning the 2023
multiple types of SuperHyperNotions? 2024
109
CHAPTER 17 2025
Conclusion and Closing Remarks 2026
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2027
research are illustrated. Some benefits and some advantages of this research are highlighted. 2028
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2029
In this endeavor, two SuperHyperNotions are defined on the SuperHyperDominating. For 2030
that sake in the second definition, the main definition of the Extreme SuperHyperGraph is 2031
redefined on the position of the alphabets. Based on the new definition for the Extreme 2032
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperDominating, finds the 2033
convenient background to implement some results based on that. Some SuperHyperClasses 2034
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 2035
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 2036
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 2037
SuperHyperDominating, the new SuperHyperClasses and SuperHyperClasses, are introduced. 2038
Some general results are gathered in the section on the SuperHyperDominating and the Extreme 2039
SuperHyperDominating. The clarifications, instances and literature reviews have taken the 2040
whole way through. In this research, the literature reviews have fulfilled the lines containing 2041
the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph are the 2042
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 2043
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 2044
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 2045
based on the connectivities of the moves of the cancer in the longest and strongest styles with 2046
the formation of the design and the architecture are formally called “ SuperHyperDominating” 2047
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 2048
embedded styles to figure out the background for the SuperHyperNotions. In the Table (31.1), 2049
benefits and avenues for this research are, figured out, pointed out and spoken out. 2050
111
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperDominating
3. Extreme SuperHyperDominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

Bibliography 2051
HG1 [1] Henry Garrett, “Properties of SuperHyperGraph and Extreme SuperHyper- 2052
Graph”, Extreme Sets and Systems 49 (2022) 531-561 (doi: 10.5281/zen- 2053
odo.6456413). (http://fs.unm.edu/NSS/ExtremeSuperHyperGraph34.pdf). (ht- 2054
HG2 [2] Henry Garrett, “Extreme Co-degree and Extreme Degree alongside Chromatic Numbers in 2056
the Setting of Some Classes Related to Extreme Hypergraphs”, J Curr Trends Comp Sci Res 2057
1(1) (2022) 06-14. 2058
HG3 [3] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Extreme Super 2059
Hyper Graphs and Their Directions in Game Theory and Extreme Super Hyper Classes”, J 2060
Math Techniques Comput Math 1(3) (2022) 242-263. 2061
HG4 [4] Garrett, Henry. “0039 | Closing Numbers and SupeV-Closing Numbers as (Dual)Resolving 2062
and (Dual)Coloring alongside (Dual)Dominating in (Extreme)n-SuperHyperGraph.” 2063
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 2064

HG5 [5] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Extreme Graphs.” CERN 2067
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 2068
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 2069

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 2070
Cancer’s Recognition as the Model in The Setting of (Extreme) SuperHyperGraphs”, 2072

Positions Of Cells Toward Extreme Failed SuperHyperClique inside Extreme SuperHy- 2075
perGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 10.20944/pre- 2076
prints202301.0282.v1). 2077
HG8 [8] Henry Garrett, “Extreme Version Of Separates Groups Of Cells In Cancer’s Recogni- 2078
tion On Extreme SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 10.20944/pre- 2079
prints202301.0267.v1). 2080
113
Polynomials Alongside Numbers In The (Extreme) SuperHyperMatching Theory Based 2083
on SuperHyperGraph and Extreme SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 2084
10.20944/preprints202301.0265.v1). 2085
HG10 [10] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case 2086
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Ap- 2087
plied in (Extreme) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 2088
prints202301.0262.v1). 2089
HG11 [11] Henry Garrett, “Extreme Failed SuperHyperStable as the Survivors on the Cancer’s Extreme 2090
Recognition Based on Uncertainty to All Modes in Extreme SuperHyperGraphs”, Preprints 2091
2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 2092
Cancer’s Recognition Titled (Extreme) SuperHyperGraphs”, Preprints 2023, 2023010224, 2094

(doi: 10.20944/preprints202301.0224.v1). 2095
HG13 [13] Henry Garrett, “(Extreme) 1-Failed SuperHyperForcing in Cancer’s Recognitions 2096
And (Extreme) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 2097

prints202301.0105.v1). 2098
HG14 [14] Henry Garrett, “Extreme Messy-Style SuperHyperGraphs To Form Extreme SuperHyper- 2099
Stable To Act on Cancer’s Extreme Recognitions In Special ViewPoints”, Preprints 2023, 2100
2023010088 (doi: 10.20944/preprints202301.0088.v1). 2101
HG15 [15] Henry Garrett, “Extreme 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 2102
Extreme SuperHyperGraphs on Cancer’s Extreme Recognition And Beyond”, Preprints 2023, 2103
2023010044 2104
HG16 [16] Henry Garrett, “(Extreme) SuperHyperStable on Cancer’s Recognition by Well- SuperHy- 2105
perModelled (Extreme) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 10.20944/pre- 2106
prints202301.0043.v1). 2107
HG17 [17] Henry Garrett, “Basic Notions on (Extreme) SuperHyperForcing And (Extreme) SuperHy- 2108
perModeling in Cancer’s Recognitions And (Extreme) SuperHyperGraphs”, Preprints 2023, 2109
2023010105 (doi: 10.20944/preprints202301.0105.v1). 2110
Stable To Act on Cancer’s Extreme Recognitions In Special ViewPoints”, Preprints 2023, 2112
2023010088 (doi: 10.20944/preprints202301.0088.v1). 2113
HG19 [19] Henry Garrett, “(Extreme) SuperHyperModeling of Cancer’s Recognitions Featuring 2114
(Extreme) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi: 2115
10.20944/preprints202212.0549.v1). 2116
HG20 [20] Henry Garrett, “(Extreme) SuperHyperAlliances With SuperHyperDefensive and Supe- 2117
rHyperOffensive Type-SuperHyperSet On (Extreme) SuperHyperGraph With (Extreme) 2118
SuperHyperModeling of Cancer’s Recognitions And Related (Extreme) SuperHyperClasses”, 2119

HG21 [21] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Extreme SuperHyperGraph 2121
10.20944/preprints202212.0500.v1). 2123
HG22 [22] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Extreme Supe- 2124
rHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 2125

HG23 [23] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Extreme SuperHyper- 2127
Graphs And Their Directions in Game Theory and Extreme SuperHyperClasses”, Preprints 2128
2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 2129
HG24 [24] Henry Garrett,“SuperHyperMatching By (V-)Definitions And Polynomials To Mon- 2130

itor Cancer’s Recognition In Extreme SuperHyperGraphs”, ResearchGate 2023,(doi: 2131
10.13140/RG.2.2.35061.65767). 2132
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatch- 2134
ing Set and Polynomial on (Extreme) SuperHyperGraphs”, ResearchGate 2023, (doi: 2135
10.13140/RG.2.2.18494.15680). 2136
HG26 [26] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 2137
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named 2138
(Extreme) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922). 2139
of Cancer’s Attacks In The Terms of Extreme Failed SuperHyperClique on Can- 2141
cer’s Recognition called Extreme SuperHyperGraphs”, ResearchGate 2023, (doi: 2142

10.13140/RG.2.2.15897.70243). 2143
HG28 [28] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Extreme Recognition 2144
Forwarding Extreme SuperHyperClique on Extreme SuperHyperGraphs”, ResearchGate 2145
2023, (doi: 10.13140/RG.2.2.30092.80004). 2146
HG29 [29] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and 2147
Sub-Regions in the Terms of Cancer’s Recognition and (Extreme) SuperHyperGraphs With 2148
(Extreme) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849). 2149
HG30 [30] Henry Garrett,“Different Extreme Types of Extreme Regions titled Extreme Failed 2150
SuperHyperStable in Cancer’s Extreme Recognition modeled in the Form of Extreme 2151
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968). 2152
HG31 [31] Henry Garrett, “Using the Tool As (Extreme) Failed SuperHyperStable To SuperHyperModel 2153
Cancer’s Recognition Titled (Extreme) SuperHyperGraphs”, ResearchGate 2023, (doi: 2154

10.13140/RG.2.2.28945.92007). 2155
Stable To Act on Cancer’s Extreme Recognitions In Special ViewPoints”, ResearchGate 2157
2023, (doi: 10.13140/RG.2.2.11447.80803). 2158

HG33 [33] Henry Garrett, “(Extreme) SuperHyperStable on Cancer’s Recognition by Well- 2159
SuperHyperModelled (Extreme) SuperHyperGraphs”, ResearchGate 2023, (doi: 2160
10.13140/RG.2.2.35774.77123). 2161
HG34 [34] Henry Garrett, “Extreme 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 2162
Extreme SuperHyperGraphs on Cancer’s Extreme Recognition And Beyond”, ResearchGate 2163

2022, (doi: 10.13140/RG.2.2.36141.77287). 2164
HG35 [35] Henry Garrett, “(Extreme) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 2165
(Extreme) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642). 2166
HG36 [36] Henry Garrett, “Basic Notions on (Extreme) SuperHyperForcing And (Extreme) SuperHy- 2167
perModeling in Cancer’s Recognitions And (Extreme) SuperHyperGraphs”, ResearchGate 2168
2022, (doi: 10.13140/RG.2.2.11369.16487). 2169
HG37 [37] Henry Garrett, “Basic Extreme Notions Concerning SuperHyperDominating and 2170
Extreme SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 2171
10.13140/RG.2.2.29173.86244). 2172
HG38 [38] Henry Garrett, “Initial Material of Extreme Preliminaries to Study Some Extreme Notions 2173
Based on Extreme SuperHyperEdge (NSHE) in Extreme SuperHyperGraph (NSHG)”, 2174
ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 2175
HG39 [39] Henry Garrett, (2022). “Beyond Extreme Graphs”, Ohio: E-publishing: Educational 2176
59973-725-6 (http://fs.unm.edu/BeyondExtremeGraphs.pdf). 2178
HG40 [40] Henry Garrett, (2022). “Extreme Duality”, Florida: GLOBAL KNOWLEDGE - Publishing 2179
House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0 2180
(http://fs.unm.edu/ExtremeDuality.pdf). 2181

CHAPTER 18 2182
Neutrosophic SuperHyperDominating 2183
The following sections are cited as follows, which is my 157th manuscript and I use prefix 159 as 2184
number before any new labelling for new items. 2185
2186
(doi: 10.13140/RG.2.2.21510.45125). 2189
2190
The links to the contributions of this research book are listed below. 2191
[Ref159] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 2192
Graph By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 2193
10.13140/RG.2.2.21510.45125). 2194
Article #159 2195
2196

2199
2201
2203

2205
10.13140/RG.2.2.21510.45125). 2209

February 2023 2211
DOI: 10.13140/RG.2.2.21510.45125 2212
117
10.13140/RG.2.2.21510.45125).
10.13140/RG.2.2.21510.45125).
GooglePlay 2217

10.13140/RG.2.2.21510.45125).
10.13140/RG.2.2.21510.45125).

CHAPTER 19 2218
New Ideas In Cancer’s Recognition And 2219
Neutrosophic SuperHyperGraph By 2220
SuperHyperDominating As Hyper Closing 2221
On Super Messy 2222
121
CHAPTER 20 2223
ABSTRACT 2224
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDominating). 2225


or E 0 is called Neutrosophic e-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 2228
that Va ∈ Ei , Ej ; Neutrosophic re-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2229
such that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2230
Neutrosophic v-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 2231
and Neutrosophic rv-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2232
Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutro- 2233

sophic SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 2234
sophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neutrosophic rv- 2235
SuperHyperDominating. ((Neutrosophic) SuperHyperDominating). Assume a Neutrosophic Supe- 2236
rHyperGraph (NSHG) S is an ordered pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 2237
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperDominating if it’s either of 2238

Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 2241
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive 2242
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2243
form the Extreme SuperHyperDominating; a Neutrosophic SuperHyperDominating if it’s either of 2244

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 2247
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 2248
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 2249
such that they form the Neutrosophic SuperHyperDominating; an Extreme SuperHyperDom- 2250
inating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 2251

rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2253
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Ex- 2254
treme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an 2255
Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges 2256
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 2257
123
and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHy- 2258
perDominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDominating, 2259
Neutrosophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neut- 2260
rosophic rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph 2261
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coef- 2262
ficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 2263
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 2264

dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2265
that they form the Neutrosophic SuperHyperDominating; and the Neutrosophic power is cor- 2266
responded to its Neutrosophic coefficient; an Extreme V-SuperHyperDominating if it’s either 2267
of Neutrosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutro- 2268
sophic v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 2269
an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVer- 2271
tices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme Su- 2272
perHyperVertices such that they form the Extreme SuperHyperDominating; a Neutrosophic 2273
V-SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 2274
rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 2276
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 2277
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2278
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 2279
perDominating; an Extreme V-SuperHyperDominating SuperHyperPolynomial if it’s either of 2280

Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 2283
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2284
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardin- 2285
ality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2286
form the Extreme SuperHyperDominating; and the Extreme power is corresponded to its Ex- 2287
treme coefficient; a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 2288

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 2291
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 2292
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 2293

of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 2294
SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating; and the 2295
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 2296
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperDominating and 2297
Neutrosophic SuperHyperDominating. Two different types of SuperHyperDefinitions are debut 2298
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 2299
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 2300
implemented in the whole of this research. For shining the elegancy and the significancy of this 2301
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 2302
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 2303

Recognition” are the under research to figure out the challenges make sense about ongoing and 2306
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 2307
different types of them. Some of them are individuals and some of them are well-modeled by 2308
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 2309
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 2310
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 2311
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 2312
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 2313
research. It’s also officially collected in the form of some questions and some problems. As- 2314
sume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDominating is 2315
a maximal of SuperHyperVertices with a maximum cardinality such that either of the fol- 2316
lowing expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 2317
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 2318
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 2319
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDominating is a maximal 2320
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 2321
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 2323
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 2324
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 2325
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Super- 2326
HyperDominating . Since there’s more ways to get type-results to make a SuperHyperDominating 2327
more understandable. For the sake of having Neutrosophic SuperHyperDominating, there’s a 2328
need to “redefine” the notion of a “SuperHyperDominating ”. The SuperHyperVertices and the 2329
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperDominating 2331
. It’s redefined a Neutrosophic SuperHyperDominating if the mentioned Table holds, concerning, 2332
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 2333
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The 2334
Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 2335
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 2336
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 2337
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 2338
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperDominating 2339

. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind 2340
of SuperHyperClass. If there’s a need to have all SuperHyperDominating until the SuperHy- 2341
perDominating, then it’s officially called a “SuperHyperDominating” but otherwise, it isn’t a 2342
SuperHyperDominating . There are some instances about the clarifications for the main definition 2343
titled a “SuperHyperDominating ”. These two examples get more scrutiny and discernment 2344
since there are characterized in the disciplinary ways of the SuperHyperClass based on a Supe- 2345
rHyperDominating . For the sake of having a Neutrosophic SuperHyperDominating, there’s a 2346
need to “redefine” the notion of a “Neutrosophic SuperHyperDominating” and a “Neutrosophic 2347
SuperHyperDominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by 2348
the labels from the letters of the alphabets. In this procedure, there’s the usage of the position 2349

of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 2350
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperDominating are 2351
redefined to a “Neutrosophic SuperHyperDominating” if the intended Table holds. It’s useful to 2352
define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 2353
type-results to make a Neutrosophic SuperHyperDominating more understandable. Assume a 2354
Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 2355
Table holds. Thus SuperHyperPath, SuperHyperDominating, SuperHyperStar, SuperHyperBi- 2356

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 2357
“Neutrosophic SuperHyperDominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic Super- 2358
HyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 2359
if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperDominating” 2360
where it’s the strongest [the maximum Neutrosophic value from all the SuperHyperDominating 2361
amid the maximum value amid all SuperHyperVertices from a SuperHyperDominating .] Super- 2362
HyperDominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number 2363
of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 2364
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 2365
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperDominating if 2366
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 2367
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 2368
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 2382
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 2383
SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, SuperHyperBipartite, SuperHyper- 2392
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperDominating 2393
or the strongest SuperHyperDominating in those Neutrosophic SuperHyperModels. For the 2394
longest SuperHyperDominating, called SuperHyperDominating, and the strongest SuperHyper- 2395

Dominating, called Neutrosophic SuperHyperDominating, some general results are introduced. 2396
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 2397
A basic familiarity with Neutrosophic SuperHyperDominating theory, SuperHyperGraphs, and 2401
Neutrosophic SuperHyperGraphs theory are proposed. 2402

Keywords: Neutrosophic SuperHyperGraph, SuperHyperDominating, Cancer’s Neutrosophic 2403
Recognition 2404

CHAPTER 21 2406
Background 2407

in issue 49 and the pages 531-561. In this research article, different types of notions like domin- 2413
ating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) 2414

degree alongside chromatic numbers in the setting of some classes related to neutrosophic 2425
hypergraphs” in Ref. [HG2] by Henry Garrett (2022). In this research article, a novel approach 2426
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 2428
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 2429
Research (JCTCSR)” with abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 2430
with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 2431
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 2432
based on initial background. 2433
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory 2435
and Neutrosophic Super Hyper Classes” in Ref. [HG3] by Henry Garrett (2022). In this 2436
research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 2437
SuperHyperGraph based on fundamental SuperHyperNumber and using neutrosophic SuperHy- 2438
perClasses of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 2439
entitled “Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 2440
129
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 2441
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 2442
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 2443
and fundamental SuperHyperNumbers. 2444
In some articles are titled “0039 | Closing Numbers and SupeV-Closing Numbers as 2445
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 2446
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 2447

Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme Super- 2448
HyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 2449
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 2450
“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 2451
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 2452
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 2453
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 2454
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 2455
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 2456
Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 2457
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 2458
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 2459
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 2460
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 2462
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 2463
Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 2464
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 2465

Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 2466
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 2468
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 2469
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 2470
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 2471

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 2472
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 2473
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 2474
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 2475
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 2476
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 2477
Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 2478
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 2479
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 2480
Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 2481
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 2482
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 2483
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutro- 2484
sophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on 2485
SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 2486

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 2487
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 2488
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 2489
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 2490
Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 2491
Garrett (2022), “SuperHyperMatching By (V-)Definitions And Polynomials To Monitor Cancer’s 2492
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 2493

“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 2494
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 2495
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 2496
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 2497
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 2498
Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 2499
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 2500
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 2501
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 2502
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 2503
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of 2506
Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 2507
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 2509
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 2510
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 2511


“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 2519
eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 2520
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 2521
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 2522

(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 2523
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 2524
in Ref. [HG38] by Henry Garrett (2022), there are some endeavors to formalize the basic 2525
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph. 2526

See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 2542
the framework of Extreme SuperHyperDominating theory, Neutrosophic SuperHyperDominating 2543
HG40]. 2549

CHAPTER 22 2550
Applied Notions Under The Scrutiny Of 2551
The Motivation Of This Scientific Research 2552
In this scientific research, there are some ideas in the featured frameworks of motivations. I try to 2553
bring the motivations in the narrative ways. Some cells have been faced with some attacks from the 2554
situation which is caused by the cancer’s attacks. In this case, there are some embedded analysis 2555
on the ongoing situations which in that, the cells could be labelled as some groups and some groups 2556
or individuals have excessive labels which all are raised from the behaviors to overcome the cancer’s 2557
attacks. In the embedded situations, the individuals of cells and the groups of cells could be 2558
considered as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting 2559
more proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 2560
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 2561
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 2562
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 2563
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 2564
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 2565
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 2566
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 2567
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 2568
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 2569
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 2570
figure out what’s going on this phenomenon. The special case of this disease is considered and 2571
as the consequences of the model, some parameters are used. The cells are under attack of this 2572
disease but the moves of the cancer in the special region are the matter of mind. The recognition 2573
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 2574
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 2575
both bases are the background of this research. Sometimes the cancer has been happened on the 2576
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 2577
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 2578
forms of alliances’ styles with the formation of the design and the architecture are formally called “ 2579
SuperHyperDominating” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers 2580
to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 2581
The recognition of the cancer in the long-term function. The specific region has been assigned 2582
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 2583
133
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 2584
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 2585
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 2586
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 2587
are some specific models, which are well-known and they’ve got the names, and some general 2588
models. The moves and the traces of the cancer on the complex tracks and between complicated 2589
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperDominating, 2590

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is 2591
to find either the optimal SuperHyperDominating or the Neutrosophic SuperHyperDominating 2592
in those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 2593
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 2594
Question 22.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 2598
amount of SuperHyperDominating” of either individual of cells or the groups of cells based on the 2599
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDominating” based 2600
on the fixed groups of cells or the fixed groups of group of cells? 2601
Question 22.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 2602
messy and dense SuperHyperModels where embedded notions are illustrated? 2603
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 2604
Thus it motivates us to define different types of “ SuperHyperDominating” and “Neutrosophic 2605
SuperHyperDominating” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 2606
the research has taken more motivations to define SuperHyperClasses and to find some connections 2607
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances 2608
and examples to make clarifications about the framework of this research. The general results 2609
and some results about some connections are some avenues to make key point of this research, 2610
“Cancer’s Recognition”, more understandable and more clear. 2611
The framework of this research is as follows. In the beginning, I introduce basic definitions 2612
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 2613
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 2614
discussed. The elementary concepts are clarified and illustrated completely and sometimes 2615
review literature are applied to make sense about what’s going to figure out about the 2616
upcoming sections. The main definitions and their clarifications alongside some results about 2617
new notions, SuperHyperDominating and Neutrosophic SuperHyperDominating, are figured 2618
out in sections “ SuperHyperDominating” and “Neutrosophic SuperHyperDominating”. In 2619
the sense of tackling on getting results and in order to make sense about continuing the 2620
research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced 2621
and as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 2622
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 2623
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 2624
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 2625
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 2626
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 2627
and as concluding and closing section of theoretical research are contained in the section 2628

“General Results”. Some general SuperHyperRelations are fundamental and they are well- 2629
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 2630
Results”, “ SuperHyperDominating”, “Neutrosophic SuperHyperDominating”, “Results on 2631
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 2632
questions about what’s done about the SuperHyperNotions to make sense about excellency of this 2633
research and going to figure out the word “best” as the description and adjective for this research 2634
as presented in section, “ SuperHyperDominating”. The keyword of this research debut in the 2635
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 2636
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 2637
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 2638
there are some scrutiny and discernment on what’s done and what’s happened in this research in 2639
the terms of “questions” and “problems” to make sense to figure out this research in featured 2640
style. The advantages and the limitations of this research alongside about what’s done in this 2641
research to make sense and to get sense about what’s figured out are included in the section, 2642
“Conclusion and Closing Remarks”. 2643

CHAPTER 23 2644
Neutrosophic Preliminaries Of This 2645
Scientific Research On the Redeemed 2646
Ways 2647
In this section, the basic material in this scientific research, is referred to [Single Valued 2648
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 2649

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 2650
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [t- 2651
norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyper- 2652
Graph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 2653
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 2654
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 2655
their clarifications are addressed to Ref.[HG38]. 2656
In this subsection, the basic material which is used in this scientific research, is presented. Also, 2657
the new ideas and their clarifications are elicited. 2658
Definition 23.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a space of points (objects) with generic elements in X denoted by x; then the
Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}
+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 2659
Definition 23.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

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

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 .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 23.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 2660

S = (V, E), where 2662
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2667
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2668
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2669
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 2670
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 . 2671



items. 2686
SuperEdge; 2692
If we choose different types of binary operations, then we could get hugely diverse types of 2695
general forms of Neutrosophic SuperHyperGraph (NSHG). 2696
Definition 23.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 2697

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 2698
x, y, z, w ∈ [0, 1]: 2699
(i) 1 ⊗ x = x; 2700
(ii) x ⊗ y = y ⊗ x; 2701
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 2702
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 2703

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X} (with respect to t-norm Tnorm ):
TA (X) = Tnorm [TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = Tnorm [IA (vi ), IA (vj )]vi ,vj ∈X ,

and FA (X) = Tnorm [FA (vi ), FA (vj )]vi ,vj ∈X .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 23.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 2704

S = (V, E), where 2706

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2711
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2712
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2713
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 2714
0

items. 2729
SuperEdge; 2735
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 2738
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 2739
makes the patterns and regularities. 2740
Definition 23.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2741
of elements of SuperHyperEdges are the same. 2742

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2743
makes to have SuperHyperUniform more understandable. 2744
Definition 23.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2745
Classes as follows. 2746
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2747
two given SuperHyperEdges with two exceptions; 2748
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2749
SuperHyperEdges; 2750
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2751
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2752
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2753
in common; 2754
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2755
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2756
SuperHyperEdge in common; 2757
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2758
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2759
SuperVertex. 2760
Definition 23.0.14. Let an ordered 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 2761

(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2762
(i) Vi , Vi+1 ∈ Ei0 ; 2763
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2764
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2765
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2766
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2767
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2768
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2769
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2770
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 23.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). a
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 2772
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2773
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2774
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2775
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHyper- 2776
Path . 2777
Definition 23.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). A
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 2778
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2779
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2780
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2781
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2782
Definition 23.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2783

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2796
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 2797
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2798
Definition 23.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperDominating). 2799


or E 0 is called 2802
(i) Neutrosophic e-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 2803

that Va ∈ Ei , Ej ; 2804
(ii) Neutrosophic re-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 2805

that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2806
(iii) Neutrosophic v-SuperHyperDominating if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 2807

that Vi , Vj 6∈ Ea ; 2808
(iv) Neutrosophic rv-SuperHyperDominating if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 2809

that Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2810
(v) Neutrosophic SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating,

2811
Neutrosophic rv-SuperHyperDominating. 2813
Definition 23.0.19. ((Neutrosophic) SuperHyperDominating). 2814

(i) an Extreme SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating,

2817
Neutrosophic rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph 2819
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 2820
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 2821
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2822
form the Extreme SuperHyperDominating; 2823
(ii) a Neutrosophic SuperHyperDominating if it’s either of Neutrosophic e- 2824

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 2828

(iii) an Extreme SuperHyperDominating SuperHyperPolynomial if it’s either of Neut- 2831

rosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutrosophic 2832
v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 2833
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 2834
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 2835
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 2836
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 2837

tices such that they form the Extreme SuperHyperDominating; and the Extreme power is 2838
corresponded to its Extreme coefficient; 2839
(iv) a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 2840

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 2845

Neutrosophic coefficient; 2849
(v) an Extreme V-SuperHyperDominating if it’s either of Neutrosophic e- 2850

an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 2854

Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 2855
SuperHyperVertices such that they form the Extreme SuperHyperDominating; 2856
(vi) a Neutrosophic V-SuperHyperDominating if it’s either of Neutrosophic e- 2857

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 2861
(vii) an Extreme V-SuperHyperDominating SuperHyperPolynomial if it’s either of 2864

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 2867
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 2868
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 2869
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 2870
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 2871
and the Extreme power is corresponded to its Extreme coefficient; 2872
(viii) a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 2873


number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 2878

Neutrosophic coefficient. 2882
Definition 23.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDominating). 2883

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Then 2884
(i) an δ−SuperHyperDominating is a Neutrosophic kind of Neutrosophic SuperHyperDom- 2885

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

(23.1), holds if S is an δ−SuperHyperDefensive; 2889
(ii) a Neutrosophic δ−SuperHyperDominating is a Neutrosophic kind of Neutrosophic 2890

SuperHyperDominating such that either of the following Neutrosophic expressions hold for 2891
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2892
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2893

the Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2894
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 2896

are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 2897
of the position of labels to assign to the values. 2898
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (23.1) holds. 2900
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2901
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2902
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (23.2) 2904
holds. Thus Neutrosophic SuperHyperPath , SuperHyperDominating, SuperHyperStar, 2905
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2906
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2907
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2908
Neutrosophic SuperHyperWheel if the Table (23.2) holds. 2909


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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperDominating. Since 2910

there’s more ways to get type-results to make a Neutrosophic SuperHyperDominating more 2911
Neutrosophicly understandable. 2912
Neutrosophic notion of “Neutrosophic SuperHyperDominating”. The SuperHyperVertices and the 2914

there’s the usage of the position of labels to assign to the values. 2916
136DEF1 Definition 23.0.23. Assume a SuperHyperDominating. It’s redefined a Neutrosophic Super- 2917
HyperDominating if the Table (23.3) holds. 2918

CHAPTER 24 2919
Neutrosophic SuperHyperDominating But 2920
As The Extensions Excerpt From Dense 2921
And Super Forms 2922
136EXM1 Example 24.0.1. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 2923
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 2924
• On the Figure (24.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 2925
HyperDominating, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 2926
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 2927
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 2928
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 2929
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2930
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 2931
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperDominating. 2932

2933
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 2936
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 2937
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 2938
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as a 2939
Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every 2940
147
Figure 24.1: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperDominating in the Neutrosophic Example (24.0.1) 136NSHG1
given Neutrosophic SuperHyperDominating. 2941

2942
• On the Figure (24.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic SuperHy- 2943
perDominating, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 2944

2945







5 × 3z 2 .
2948

C(N SHG)Neutrosophic SuperHyperDominating SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic V-SuperHyperDominating SuperHyperPolynomial = z.
2951

= {E3i+13i=0 , E3i+233i=0 }.
= 3 × 3z 8 .
= {V3i+13i=0 , V3i+113i=0 }.
C(N SHG)Neutrosophic V-Quasi-SuperHyperDominating SuperHyperPolynomial


= 3 × 3z 8 .
2954
C(N SHG)Neutrosophic SuperHyperDominating = {E15 , E16 , E17 }.

= 3 × 3z 3 .
C(N SHG)Neutrosophic V-SuperHyperDominating = {V3 , V6 , V8 }.
= 4 × 5 × 5z 3 .
2957







= 4 × 5 × 5z 3 .
2960

= {E3i+13i=0 , E23 }.
= 3z 5 .
= {V3i+13i=0 , V11 }.
C(N SHG)Neutrosophic V-Quasi-SuperHyperDominating SuperHyperPolynomial
= 3 × 11z 5 .
2963



= 4 × 5 × 5z 3 .
2966

C(N SHG)Neutrosophic SuperHyperDominating SuperHyperPolynomial z 2 .
= 3 × 3z 3 .
2969






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

= 5 × 5z 5 .
2972

= 3 × 3z 2 .
2975



2978

C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial = z 2 .
2981



4 × 3z 3 .
2984







4 × 3z 4 .
2987

2 × 4 × 3z 4 .
2990
C(N SHG)Neutrosophic SuperHyperDominating = {E3i+1i=03 }.



C(N SHG)Neutrosophic V-SuperHyperDominating = {V3i+1i=03 }.

C(N SHG)Neutrosophic V-SuperHyperDominating SuperHyperPolynomial = 3z 4 .
2993

2996



2999

= 5 × 1z 2 .
3002




Neutrosophic SuperHyperDominating in the Neutrosophic Example (24.0.1) 95NHG1


Neutrosophic SuperHyperDominating in the Neutrosophic Example (24.0.1) 95NHG2

CHAPTER 25 3003
The Neutrosophic Departures on The 3004
Theoretical Results Toward Theoretical 3005
Motivations 3006
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 3007
SuperHyperClasses. 3008
Proposition 25.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 3009
C(N SHG)Neutrosophic SuperHyperDominating =

|EESHG:(V,E) |
Neutrosophic Cardinality
c
= {E3i+1 }i=0 3
.
|EESHG:(V,E) |
= 3z c 3 .
|EESHG:(V,E) |
c
.
|EESHG:(V,E) |
Y Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality 3z c 3 .
Proof. Let 3010
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |EESHG:(V,E) |
c 3 −1 c 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). There’s 3011
167
Figure 25.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic


136EXM18a Example 25.0.2. In the Figure (25.1), the connected Neutrosophic SuperHyperPath ESHP : 3015
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 3016
SuperHyperModel (25.1), is the SuperHyperDominating. 3017
Proposition 25.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 3018
C(N SHG)Neutrosophic SuperHyperDominating =

|EESHG:(V,E) |
c
= {E3i+1 }i=0 3
.
|EESHG:(V,E) | 3
= 3z c .

|EESHG:(V,E) | 3
c
= {V EXT ERN AL 3i+1 }i=0 .

|EESHG:(V,E) |
Y Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality 3z c 3 .
Proof. Let 3019
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |EESHG:(V,E) |
c 3 −1 c 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). There’s 3020

136EXM19a Example 25.0.4. In the Figure (25.2), the connected Neutrosophic SuperHyperCycle N SHC : 3024
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 3025
Neutrosophic SuperHyperModel (25.2), is the Neutrosophic SuperHyperDominating. 3026
Proposition 25.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 3027
C(N SHG)Neutrosophic SuperHyperDominating = {Ei ∈ EESHG:(V,E) }.

= |i | Ei ∈ |EESHG:(V,E) |Neutrosophic Cardinality z.
C(N SHG)Neutrosophic V-SuperHyperDominating = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 3028
P : ViEXT ERN AL , Ei , CEN T ER, Ej .
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 3029


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

Neutrosophic SuperHyperDominating in the Neutrosophic Example (25.0.4) 136NSHG19a
136EXM20a Example 25.0.6. In the Figure (25.3), the connected Neutrosophic SuperHyperStar ESHS : 3033
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 3034
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 3035
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (25.3), is 3036
the Neutrosophic SuperHyperDominating. 3037
Proposition 25.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 3038
Then 3039

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i

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

Neutrosophic SuperHyperDominating in the Neutrosophic Example (25.0.6) 136NSHG20a

i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Proof. Let 3040
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 3041
There’s a new way to redefine as 3042


two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3047
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperDominating taken from a connected Neutrosophic SuperHyperBipartite 3049
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 3050
SuperHyperPart SuperHyperEdges are attained in any solution 3051
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 25.0.8. In the Neutrosophic Figure (25.4), the connected Neutrosophic SuperHyperBi- 3053
partite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The obtained 3054
Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic result, 3055
of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperBipartite 3056
ESHB : (V, E), in the Neutrosophic SuperHyperModel (25.4), is the Neutrosophic SuperHyper- 3057
Dominating. 3058
Proposition 25.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 3059
Then 3060

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

X X
EXT ERN AL |
Proof. Let 3061
P :

Figure 25.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperDominating in the Example (25.0.8) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperDominating taken from a connected Neutrosophic SuperHyperMultipartite 3062

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

z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3068
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : 3070
(V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 3071

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

SuperHyperEdges are attained in any solution 3072
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 3073
136EXM22a Example 25.0.10. In the Figure (25.5), the connected Neutrosophic SuperHyperMultipartite 3075
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 3076
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 3077
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 3078
the Neutrosophic SuperHyperModel (25.5), is the Neutrosophic SuperHyperDominating. 3079
Proposition 25.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 3080
Then, 3081
∗
C(N SHG)Neutrosophic SuperHyperDominating = {Ei ∈ EESHG:(V,E) }.
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic V-SuperHyperDominating = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 3082
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

Figure 25.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperDominating in the Neutrosophic Example (25.0.12) 136NSHG23a
is a longest SuperHyperDominating taken from a connected Neutrosophic SuperHyperWheel 3083

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

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 3085
to ViEXT ERN AL in the literatures of SuperHyperDominating. The latter is straightforward. 3086
Then there’s at least one SuperHyperDominating. Thus the notion of quasi isn’t up and the 3087
SuperHyperNotions based on SuperHyperDominating could be applied. The unique embedded 3088
SuperHyperDominating proposes some longest SuperHyperDominating excerpt from some 3089

representatives. The latter is straightforward. 3090
136EXM23a Example 25.0.12. In the Neutrosophic Figure (25.6), the connected Neutrosophic SuperHyper- 3091
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 3092
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVertices of 3093
the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic SuperHy- 3094
perModel (25.6), is the Neutrosophic SuperHyperDominating. 3095

CHAPTER 26 3096
The Surveys of Mathematical Sets On The 3097
Results But As The Initial Motivation 3098
For the SuperHyperDominating, Neutrosophic SuperHyperDominating, and the Neutrosophic 3099

SuperHyperDominating, some general results are introduced. 3100
Remark 26.0.1. Let remind that the Neutrosophic SuperHyperDominating is “redefined” on the 3101
positions of the alphabets. 3102
Corollary 26.0.2. Assume Neutrosophic SuperHyperDominating. Then 3103
N eutrosophic SuperHyperDominating =
{theSuperHyperDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperDominating
|N eutrosophiccardinalityamidthoseSuperHyperDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 3104
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 3105
the neutrality, for i = 1, 2, 3, respectively. 3106
Corollary 26.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 3107
alphabet. Then the notion of Neutrosophic SuperHyperDominating and SuperHyperDominating 3108
coincide. 3109
Corollary 26.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 3110
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 3111
SuperHyperDominating if and only if it’s a SuperHyperDominating. 3112
Corollary 26.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter 3113
of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 3114
SuperHyperDominating if and only if it’s a longest SuperHyperDominating. 3115
Corollary 26.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 3116
same identical letter of the alphabet. Then its Neutrosophic SuperHyperDominating is its 3117
SuperHyperDominating and reversely. 3118
177
Corollary 26.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperDominating, SuperHy- 3119

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 3120
letter of the alphabet. Then its Neutrosophic SuperHyperDominating is its SuperHyperDominating 3121
and reversely. 3122
Corollary 26.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHyper- 3123
Dominating isn’t well-defined if and only if its SuperHyperDominating isn’t well-defined. 3124
Corollary 26.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 3125

Neutrosophic SuperHyperDominating isn’t well-defined if and only if its SuperHyperDominating 3126
isn’t well-defined. 3127

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 3129
SuperHyperDominating isn’t well-defined if and only if its SuperHyperDominating isn’t well- 3130
defined. 3131
Corollary 26.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 3132
perDominating is well-defined if and only if its SuperHyperDominating is well-defined. 3133
Corollary 26.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 3134

Neutrosophic SuperHyperDominating is well-defined if and only if its SuperHyperDominating is 3135
well-defined. 3136

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 3138
SuperHyperDominating is well-defined if and only if its SuperHyperDominating is well-defined. 3139
Proposition 26.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 3140
(i) : the dual SuperHyperDefensive SuperHyperDominating; 3141
(ii) : the strong dual SuperHyperDefensive SuperHyperDominating; 3142
(iii) : the connected dual SuperHyperDefensive SuperHyperDominating; 3143
(iv) : the δ-dual SuperHyperDefensive SuperHyperDominating; 3144
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDominating; 3145
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDominating. 3146
Proposition 26.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 3147
(iii) : the connected defensive SuperHyperDefensive SuperHyperDominating; 3150

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

independent SuperHyperSet is 3155
(iii) : the connected SuperHyperDefensive SuperHyperDominating; 3158
Proposition 26.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 3162

Graph which is a SuperHyperDominating/SuperHyperPath. Then V is a maximal 3163
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDominating; 3167
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDominating; 3168
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDominating; 3169
Proposition 26.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 3171

SuperHyperUniform SuperHyperWheel. Then V is a maximal 3172
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 3176
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 3177
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 3178

Graph which is a SuperHyperDominating/SuperHyperPath. Then the number of 3181
(i) : the SuperHyperDominating; 3182

(ii) : the SuperHyperDominating; 3183
(iii) : the connected SuperHyperDominating; 3184
(iv) : the O(ESHG)-SuperHyperDominating; 3185
(v) : the strong O(ESHG)-SuperHyperDominating; 3186
(vi) : the connected O(ESHG)-SuperHyperDominating. 3187
coincide. 3189

Graph which is a SuperHyperWheel. Then the number of 3191
(i) : the dual SuperHyperDominating; 3192
(ii) : the dual SuperHyperDominating; 3193
(iii) : the dual connected SuperHyperDominating; 3194
(iv) : the dual O(ESHG)-SuperHyperDominating; 3195
(v) : the strong dual O(ESHG)-SuperHyperDominating; 3196
(vi) : the connected dual O(ESHG)-SuperHyperDominating. 3197
coincide. 3199
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 3201

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 3202
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 3203
is a 3204
O(ESHG)
O(ESHG)
O(ESHG)

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number 3213
of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 3214
is a 3215

(iv) : δ-SuperHyperDefensive SuperHyperDominating; 3219
(v) : strong δ-SuperHyperDefensive SuperHyperDominating; 3220
(vi) : connected δ-SuperHyperDefensive SuperHyperDominating. 3221

SuperHyperMultipartite. Then Then the number of 3224
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying 3231
r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the 3232
exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 3233
Proposition 26.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 3234
connected component is |V − S| if there’s a SuperHyperSet which is a dual 3235
(iv) : SuperHyperDominating; 3239
Proposition 26.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the number 3242
is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 3243
Proposition 26.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 3244
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 3245

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



Proposition 26.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 3253
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 3254
of dual 3255
(iv) : 0-SuperHyperDefensive SuperHyperDominating; 3259

SuperHyperComplete. Then there’s no independent SuperHyperSet. 3263

SuperHyperDominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 3265
and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 3266
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 3270
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 3271
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating. 3272

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



Proposition 26.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 3283
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 3284
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 3285
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 3286
Proposition 26.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 3287

dual SuperHyperDefensive SuperHyperDominating, then ∀v ∈ V \ S, ∃x ∈ S such that 3288
(i) v ∈ Ns (x); 3289
(ii) vx ∈ E. 3290
Proposition 26.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 3291

dual SuperHyperDefensive SuperHyperDominating, then 3292
(i) S is SuperHyperDominating set; 3293
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 3294
Proposition 26.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 3295
(i) Γ ≤ O; 3296
(ii) Γs ≤ On . 3297
Proposition 26.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 3298
connected. Then 3299
(i) Γ ≤ O − 1; 3300
(ii) Γs ≤ On − Σ3i=1 σi (x). 3301
Proposition 26.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 3302

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

Proposition 26.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 3309
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperDominating; 3310
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 3311
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3312
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3313
Proposition 26.0.38. Let ESHG : (V, E) be an even SuperHyperDominating. Then 3315
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperDomin- 3316

ating; 3317
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 3318
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 3319
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 3320
Proposition 26.0.39. Let ESHG : (V, E) be an odd SuperHyperDominating. Then 3322

inating; 3324
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3326
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3327
Proposition 26.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 3329
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDominating; 3330
(ii) Γ = 1; 3331
(iii) Γs = Σ3i=1 σi (c); 3332
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDominating. 3333
Proposition 26.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 3334
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 3335
SuperHyperDefensive SuperHyperDominating; 3336
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 3337
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 3338
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 3339
SuperHyperDefensive SuperHyperDominating. 3340
Proposition 26.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 3341
bn
2 c+1
(ii) Γ = b n2 c + 1; 3343

2
; 3344
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperDominat- 3345
ing. 3346
Proposition 26.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 3347
bn
2c
(ii) Γ = b n2 c; 3349

2
; 3350
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHyper- 3351
Dominating. 3352
Proposition 26.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 3353

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 3354
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperDomin- 3355

ating for N SHF; 3356
(ii) Γ = m for N SHF : (V, E); 3357
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3358
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperDominating 3359
for N SHF : (V, E). 3360
Proposition 26.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperComplete 3361

SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 3362
b n c+1
2
is a dual maximal SuperHyperDefensive SuperHyperDom- 3363
inating for N SHF; 3364
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 3365

2
for N SHF : (V, E); 3366
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperDominating for 3367
N SHF : (V, E). 3368

Proposition 26.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperComplete 3369

SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 3370
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperDominating for 3371
N SHF : (V, E); 3372
(ii) Γ = b n2 c for N SHF : (V, E); 3373
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 3374
S={vi }i=1
bnc
2
are only dual maximal SuperHyperDominating for 3375
N SHF : (V, E). 3376
following statements hold; 3378
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3379
SuperHyperDominating, then S is an s-SuperHyperDefensive SuperHyperDominating; 3380

SuperHyperDominating, then S is a dual s-SuperHyperDefensive SuperHyperDominating. 3382
following statements hold; 3384
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3385

SuperHyperDominating, then S is an s-SuperHyperPowerful SuperHyperDominating; 3386

SuperHyperDominating, then S is a dual s-SuperHyperPowerful SuperHyperDominating. 3388
Proposition 26.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 3389

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

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

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

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

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

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


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

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

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

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

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

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

(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperDom- 3431
inating; 3432
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3433

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

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


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

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


CHAPTER 27 3449
Neutrosophic Applications in Cancer’s 3450
Neutrosophic Recognition 3451
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 3452
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 3453
disease is considered and as the consequences of the model, some parameters are used. The 3454
cells are under attack of this disease but the moves of the cancer in the special region are the 3455
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 3456
treatments for this Neutrosophic disease. 3457
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 3458
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 3459
Neutrosophic function. 3460
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 3461
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 3462
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 3463
easily identified since there are some determinacy, indeterminacy and neutrality about the 3464
moves and the effects of the cancer on that region; this event leads us to choose another 3465
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 3466
what’s happened and what’s done. 3467
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 3468
known and they’ve got the names, and some general Neutrosophic models. The moves and 3469
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 3470
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperDominating, 3471
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3472
aim is to find either the Neutrosophic SuperHyperDominating or the Neutrosophic 3473

SuperHyperDominating in those Neutrosophic Neutrosophic SuperHyperModels. 3474
189
CHAPTER 28 3475
Case 1: The Initial Neutrosophic Steps 3476
Toward Neutrosophic 3477
SuperHyperBipartite as Neutrosophic 3478
SuperHyperModel 3479
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (28.1), the Neutrosophic Super- 3480
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 3481
Figure 28.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

191
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (28.1) and the Table (28.1), the Neutrosophic SuperHy- 3482
perBipartite is obtained. 3483
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 3484
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 3485
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (28.1), is the 3486
Neutrosophic SuperHyperDominating. 3487

CHAPTER 29 3488
Case 2: The Increasing Neutrosophic 3489
Steps Toward Neutrosophic 3490
SuperHyperMultipartite as 3491
Neutrosophic SuperHyperModel 3492
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (29.1), the Neutrosophic Super- 3493
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 3494
By using the Neutrosophic Figure (29.1) and the Table (29.1), the Neutrosophic SuperHy- 3495
perMultipartite is obtained. 3496
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 3497
Figure 29.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

193
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 3498

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (29.1), is the 3499
Neutrosophic SuperHyperDominating. 3500

CHAPTER 30 3501
Wondering Open Problems But As The 3502
Directions To Forming The Motivations 3503
In what follows, some “problems” and some “questions” are proposed. 3504
The SuperHyperDominating and the Neutrosophic SuperHyperDominating are defined on a 3505
real-world application, titled “Cancer’s Recognitions”. 3506
Question 30.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3507
recognitions? 3508
Question 30.0.2. Are there some SuperHyperNotions related to SuperHyperDominating and the 3509
Neutrosophic SuperHyperDominating? 3510
Question 30.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3511
them? 3512
Question 30.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDominating 3513
and the Neutrosophic SuperHyperDominating? 3514
Problem 30.0.5. The SuperHyperDominating and the Neutrosophic SuperHyperDominating do a 3515

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperDominating, are 3516
there else? 3517
Problem 30.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3518
Numbers types-results? 3519
Problem 30.0.7. What’s the independent research based on Cancer’s recognitions concerning the 3520
multiple types of SuperHyperNotions? 3521
195
CHAPTER 31 3522
Conclusion and Closing Remarks 3523
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3524
research are illustrated. Some benefits and some advantages of this research are highlighted. 3525
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 3526
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperDominating. For 3527
that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 3528
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 3529
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperDominating, finds the 3530
convenient background to implement some results based on that. Some SuperHyperClasses and 3531
some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 3532
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned on 3533
the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, Super- 3534
HyperDominating, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some 3535
general results are gathered in the section on the SuperHyperDominating and the Neutrosophic 3536
SuperHyperDominating. The clarifications, instances and literature reviews have taken the 3537
whole way through. In this research, the literature reviews have fulfilled the lines containing the 3538
notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 3539
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 3540
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 3541
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 3542
based on the connectivities of the moves of the cancer in the longest and strongest styles with 3543
the formation of the design and the architecture are formally called “ SuperHyperDominating” 3544
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 3545
embedded styles to figure out the background for the SuperHyperNotions. In the Table (31.1), 3546
benefits and avenues for this research are, figured out, pointed out and spoken out. 3547
197
Table 31.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperDominating
3. Neutrosophic SuperHyperDominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

Bibliography 3548
HG1 [1] Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyper- 3549
Graph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 10.5281/zen- 3550
odo.6456413). (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). (ht- 3551
HG2 [2] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 3553
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 3554
Trends Comp Sci Res 1(1) (2022) 06-14. 3555
HG3 [3] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic 3556
Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 3557
Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. 3558
HG4 [4] Garrett, Henry. “0039 | Closing Numbers and SupeV-Closing Numbers as (Dual)Resolving 3559
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 3560
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 3561

HG5 [5] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 3564
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 3565
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 3566

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 3567
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 3569

Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic Supe- 3572
rHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 10.20944/pre- 3573
prints202301.0282.v1). 3574
HG8 [8] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3575
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 3576
10.20944/preprints202301.0267.v1). 3577
199
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 3580
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 3581
(doi: 10.20944/preprints202301.0265.v1). 3582
HG10 [10] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 3583
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 3584
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 3585
prints202301.0262.v1). 3586
HG11 [11] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 3587
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyper- 3588
Graphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 3589
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224, 3591

(doi: 10.20944/preprints202301.0224.v1). 3592
HG13 [13] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 3593
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 3594

prints202301.0105.v1). 3595
Preprints 2023, 2023010044 3601
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 3603
10.20944/preprints202301.0043.v1). 3604
HG19 [19] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 3611
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 3612
(doi: 10.20944/preprints202212.0549.v1). 3613
HG20 [20] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 3614
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 3615
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 3616
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 3617

HG21 [21] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 3618
10.20944/preprints202212.0500.v1). 3620
HG22 [22] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 3621
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 3622
HG23 [23] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 3624
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 3625
HG24 [24] Henry Garrett,“SuperHyperMatching By (V-)Definitions And Polynomials To Monitor 3627

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 3628
10.13140/RG.2.2.35061.65767). 3629
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 3631
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 3632
10.13140/RG.2.2.18494.15680). 3633
HG26 [26] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 3634
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 3635
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 3636

10.13140/RG.2.2.32530.73922). 3637
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 3639

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 3640
10.13140/RG.2.2.15897.70243). 3641
HG28 [28] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 3642
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 3643
HG29 [29] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 3645
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 3646
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 3647
10.13140/RG.2.2.23172.19849). 3648
HG30 [30] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic 3649
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of 3650
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968). 3651
HG31 [31] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyper- 3652
Model Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, 3653
(doi: 10.13140/RG.2.2.28945.92007). 3654

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

HG35 [35] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 3664
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3665
10.13140/RG.2.2.29430.88642). 3666
HG37 [37] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 3670
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 3671
10.13140/RG.2.2.29173.86244). 3672
HG38 [38] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 3673
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph 3674

(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 3675
HG39 [39] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 3676
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 3678
HG40 [40] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - 3679
Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 3680

CHAPTER 32 3682
Books’ Contributions 3683
“Books’ Contributions”: | Featured Threads 3684

The following references are cited by chapters. 3685
3686
2023, (doi: 10.13140/RG.2.2.13121.84321). 3689
3690

(doi: 10.13140/RG.2.2.21510.45125). 3693
3694
[Ref158] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 3696
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 3697
(doi: 10.13140/RG.2.2.13121.84321). 3698

Article #156 3699
3700
3703

3705
3707
3709

10.13140/RG.2.2.13121.84321). 3713
#156th Article 3714
February 2023 3715
DOI: 10.13140/RG.2.2.13121.84321 3716
203
2023, (doi: 10.13140/RG.2.2.13121.84321).

GooglePlay [Ref159] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3721
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 3722
2023, (doi: 10.13140/RG.2.2.21510.45125). 3723

Article #159 3724
3725
3728

3730
3732
3734

10.13140/RG.2.2.21510.45125). 3738
February 2023 3740
DOI: 10.13140/RG.2.2.21510.45125 3741

2023, (doi: 10.13140/RG.2.2.13121.84321).
2023, (doi: 10.13140/RG.2.2.13121.84321).

10.13140/RG.2.2.21510.45125).
10.13140/RG.2.2.21510.45125).


GooglePlay | Book #107 3746
| Title: SuperHyperConnected 3747
#Latest_Updates 3748
#The_Links 3749
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG Twitter 3750
LinkedIn Amazon googlebooks GooglePlay 3751

10.13140/RG.2.2.21510.45125).
10.13140/RG.2.2.21510.45125).

– 3752
3753
3755
#The_Links 3756
3757
| Book #107 3758

3759
|Title: SuperHyperConnected 3760
3761
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG 3762
Twitter LinkedIn Amazon googlebooks GooglePlay 3763
3764
– 3765
3766
| Publisher | 3767
(Paperback): https://www.amazon.com/dp/- 3768
(Hardcover): https://www.amazon.com/dp/- 3769

(Kindle Edition): https://www.amazon.com/dp/- 3770
3771
– 3772
3773
| ISBN | 3774
(Paperback): - 3775
(Hardcover): - 3776
(Kindle Edition): CC BY-NC-ND 4.0 3777
(EBook): CC BY-NC-ND 4.0 3778
3779
– 3780
3781
| Print length | 3782
(Paperback): - pages 3783
(Hardcover): - pages 3784
(Kindle Edition): - pages 3785
(E-Book): 290 pages 3786
3787
– 3788
3789
3791
#The_Links 3792
3793
| ResearchGate: https://www.researchgate.net/publication/- 3794
3795
| WordPress: https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperConnected/ 3796
3797

@Scribd: https://www.scribd.com/document/- 3798

3799
| academia: https://www.academia.edu/- 3800
3801
| ZENODO_ORG: https://zenodo.org/record/- 3802
3803
| googlebooks: https://books.google.com/books/about?id=- 3804

3805
| GooglePlay: https://play.google.com/store/books/details?id=- 3806
3807
3808

Figure 32.8: “#107th Book” || SuperHyperConnected February 2023 License: CC BY-NC-ND

4.0 Print length: 290 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs
SuperHyperConnected (Published Version) 3809
3810
The Link: 3811
3812
https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperConnected/ 3813
3814
– 3815
3816
Posted by Dr. Henry Garrett 3817
3818
February 18, 2023 3819
3820
Posted in 0107 | SuperHyperConnected 3821
3822
Tags: 3823
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 3824
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 3825
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 3826
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 3827
neutrosophic SuperHyperGraphs, Neutrosophic SuperHyperConnected, Open Problems, Open 3828

Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World Applications, Recent 3829
Research, Recognitions, Research, scientific research Article, scientific research Articles, scientific 3830
research Book, scientific research Chapter, scientific research Chapters, Review, SuperHyper- 3831
Classes, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, SuperHyperGraphs, 3832
SuperHyperConnected, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 3833
Vertices. 3834




In this scientific research book, there are some scientific research chapters on “Extreme SuperHy- 3835
perConnected” and “Neutrosophic SuperHyperConnected” about some researches on Extreme 3836
SuperHyperConnected and neutrosophic SuperHyperConnected. 3837

CHAPTER 33 3838
“SuperHyperGraph-Based Books”: | 3839
Featured Tweets 3840
“SuperHyperGraph-Based Books”: | Featured Tweets 3841
213
Figure 33.1: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 33.2: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 33.3: “SuperHyperGraph-Based Books”: | Featured Tweets #69
























CHAPTER 34 3842
CV 3843
241
3844
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
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 Memebrship
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)
3845
Publications: Articles
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).
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).
3846
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
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004).
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
3847
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
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 0105 | Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs Article
and Their Directions in Game Theory and Neutrosophic Super Hyper Classes
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.
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).
3848
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
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).
3849
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).
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
3850
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

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
3851
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).
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).
April 12, 2022 0069 | Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Article
Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic

SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi:
10.5281/zenodo.6456413). (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf).
(https://digitalrepository.unm.edu/nss_journal/vol49/iss1/34).
Available at NSS, NSS Gallery, UNM Digital Repository, Twitter, ResearchGate, Scribd,
Academia, Zenodo, LinkedIn
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
3852
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”,

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).
3853
2022 0057 | Fuzzy Dominating Number Based On Fuzzy Bridge And Applicaions Article
M. Hamidi, and M. Nikfar, “Fuzzy Dominating Number Based On Fuzzy

Bridge And Applicaions”, Fuzzy Systems and its Applications 4(2) (2022) 205-229
(https://doi.org/10.22034/jfsa.2022.306606.1092).
Oct 2018 0056 | The Effects of Mathematics on Computer Sciences Conference Article
M. Nikfar, “The Effects of Mathematics on Computer Sciences”, Second Conference

on the Education and Applications of Mathematics, Kermanshah, Iran, 2018
(https://en.civilica.com/doc/824659).
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).
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

3854
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).
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).
3855
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
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

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

(doi: 10.13140/RG.2.2.19464.96007).
3857
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).
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
3858
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).
2018 0010 | A Study on Domination in two Fuzzy Models Manuscript
M. Nikfar, “A Study on Domination in two Fuzzy Models”, Preprints 2018, 2018040119 (doi:
10.20944/preprints201804.0119.v2).
2019 0009 | Nikfar Domination Versus Others: Restriction, Extension Theorems and Monstrous Examples Manuscript
M. Nikfar, “Nikfar Domination Versus Others: Restriction, Extension Theorems and

Monstrous Examples”, Preprints 2019, 2019010024 (doi: 10.20944/preprints201901.0024.v3).
2019 0008 | Nikfar Dominations: Definitions, Theorems, and Connections Manuscript
M. Nikfar, “Nikfar Dominations: Definitions, Theorems, and Connections”, ResearchGate

2019 (doi: 10.13140/RG.2.2.28955.31526/1).
3859
2019 0007 | Nikfar Domination in Fuzzy Graphs Manuscript
M. Nikfar, “Nikfar Domination in Fuzzy Graphs”, Preprints 2019, 2019010024 (doi:

10.20944/preprints201901.0024.v2).

10.20944/preprints201901.0024.v2).
2018 0005 | The Results on Vertex Domination in Fuzzy Graphs Manuscript
M. Nikfar, “The Results on Vertex Domination in Fuzzy Graphs”, Preprints 2018, 2018040085
(doi: 10.20944/preprints201804.0085.v2).

10.20944/preprints201901.0024.v1).
2019 0003 | Nikfar Domination in Neutrosophic Graphs Manuscript
M. Nikfar, “Nikfar Domination in Neutrosophic Graphs”, Preprints 2019, 2019010025 (doi:

10.20944/preprints201901.0025.v1).
2018 0002 | Vertex Domination in t-Norm Fuzzy Graphs Manuscript
M. Nikfar, “Vertex Domination in t-Norm Fuzzy Graphs”, Preprints 2018, 2018040119 (doi:
10.20944/preprints201804.0119.v1).
2018 0001 | The Results on Vertex Domination in Fuzzy Graphs Manuscript
M. Nikfar, “The Results on Vertex Domination in Fuzzy Graphs”, Preprints 2018, 2018040085
(doi: 10.20944/preprints201804.0085.v1).
3860
Publications: Books
2023 0069 | SuperHyperMatching Amazon
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
2023 0068 | Failed SuperHyperClique Amazon
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language

ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
2023 0067 | SuperHyperClique Amazon
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
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
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
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
ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language
3861
2022 0062 | SuperHyperAlliances Amazon
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
2022 0061 | SuperHyperGraphs Amazon
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
2022 0060 | Neut. SuperHyperEdges Amazon
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
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

3862
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

3863
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
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
3864
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
3865
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
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

3866
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
ASIN : B09M554XCL Publisher : Independently published (November 20, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
3867
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
-
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

3868
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

3869
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-
лях 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

3870
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
3871
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
3872
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_Author Henry Garrett
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

3873
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
3874
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
...
3875
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=SUjFCmcAAAAJviewo p = listw orkssortby = pubdate
− LinkedIn : https : //www.linkedin.com/in/drhenrygarrett/

3876
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

Super Hyper Dominating

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

Super Hyper Dominating

Uploaded by

Copyright:

Available Formats

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA

Henry Garrett · Independent Researcher · Department of Mathematics ·

List of Tables iii

5 New Ideas On Super Missing By Hyper Searching Of SuperHyperDom-

8 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 51

10 Extreme SuperHyperDominating But As The Extensions Excerpt From

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 103

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipartite

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyperMul-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 111

18 Neutrosophic SuperHyperDominating 117

19 New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

22 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

23 Neutrosophic Preliminaries Of This Scientific Research On the Redeemed

24 Neutrosophic SuperHyperDominating But As The Extensions Excerpt

25 The Neutrosophic Departures on The Theoretical Results Toward Theor-

26 The Surveys of Mathematical Sets On The Results But As The Initial

27 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 189

28 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

29 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic Super-

Henry Garrett · Independent Researcher · Department of Mathematics ·

30 Wondering Open Problems But As The Directions To Forming The

31 Conclusion and Closing Remarks 197

32 Books’ Contributions 203

33 “SuperHyperGraph-Based Books”: | Featured Tweets 213

Henry Garrett · Independent Researcher · Department of Mathematics ·

2.1 “#107th Book” || SuperHyperConnected February 2023 License: CC BY-NC-

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.19The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 a Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperDom-

14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHyper-

15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme SuperHy-

24.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

24.4 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

25.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

25.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

28.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

29.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

33.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 214

Henry Garrett · Independent Researcher · Department of Mathematics ·

33.4 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . . 217

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

14.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

15.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 112

23.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

28.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

29.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

31.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 198

on SuperHyperConnected by two (Extreme/Neutrosophic) notions, namely, Extreme SuperHy- 3

this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 15

imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 33

be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 52

of having a Neutrosophic SuperHyperConnected, there’s a need to “redefine” the notion of 58