Super Hyper Path

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

Contents
Contents i
List of Figures iv
List of Tables viii
1 ABSTRACT 1
2 BACKGROUND 11
Bibliography 15
3 Acknowledgements 25
4 Extreme SuperHyperDominating 27
5 New Ideas On Super Missing By Hyper Searching Of SuperHyperDom-

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

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

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

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

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

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

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

Motivations 95
17 Conclusion and Closing Remarks 97
18 ExtremeSuperHyperDuality But As The Extensions Excerpt From Dense

And Super Forms 99
19 ExtremeSuperHyperJoin But As The Extensions Excerpt From Dense

And Super Forms 107
20 ExtremeSuperHyperPerfect But As The Extensions Excerpt From Dense

And Super Forms 115
21 ExtremeSuperHyperTotal But As The Extensions Excerpt From Dense

And Super Forms 123
22 ExtremeSuperHyperConnected But As The Extensions Excerpt From

Bibliography 139
23 Neutrosophic SuperHyperDominating 143
24 New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperDominating As Hyper Closing On Super Messy 145
25 ABSTRACT 147
26 Background 153
27 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

Research 157
28 Neutrosophic Preliminaries Of This Scientific Research On the Redeemed

Ways 161

29 Neutrosophic SuperHyperDominating But As The Extensions Excerpt

From Dense And Super Forms 171
30 The Neutrosophic Departures on The Theoretical Results Toward Theor-

etical Motivations 191
31 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 201
32 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 213
33 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

perBipartite as Neutrosophic SuperHyperModel 215
34 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic Super-

HyperMultipartite as Neutrosophic SuperHyperModel 217
35 Wondering Open Problems But As The Directions To Forming The

Motivations 219
36 Conclusion and Closing Remarks 221
37 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

38 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

39 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

40 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

41 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 255
Bibliography 263
42 Books’ Contributions 267
43 “SuperHyperGraph-Based Books”: | Featured Tweets 273
44 CV 301

List of Figures
2.1 “#108th Book” || SuperHyperPath February 2023 License: CC BY-NC-ND 4.0 Print
length: 348 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs 21
10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

SuperHyperDominating in the Extreme Example (41.0.3) . . . . . . . . . . . . . . . 56
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
iv

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

inating in the Example (41.0.5) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHyper-

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

perDominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
29.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperDominating in the Neutrosophic Example (41.0.3) . . . . 172


29.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
30.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperDominating in the Example (41.0.5) . . . . . . . . . . . . . . . . . . . . 192
30.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperDominating in the Neutrosophic Example (30.0.4) . . . . . 194
30.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of Neutro-
sophic SuperHyperDominating in the Neutrosophic Example (30.0.6) . . . . . . . . . 195
30.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperDominating in the Example (30.0.8) . . . . . . 197
30.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperDominating in the Example (30.0.10) . . . . . . . . . . . . . . . . . . . . 198
30.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperDominating in the Neutrosophic Example (30.0.12) 199
33.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperDominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
34.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperDominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217

43.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 274

43.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 275
43.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . . 276
43.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . . 282

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

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (28.0.23) 54
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (28.0.22) 54

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . . 92

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . . 94
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 98

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . . 216

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . . 218
36.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 222
viii
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme SuperHy- 1
perPath” and “Neutrosophic SuperHyperPath” about some scientific research on SuperHyperPath 2
by two (Extreme/Neutrosophic) notions, namely, Extreme SuperHyperPath and Neutrosophic 3

SuperHyperPath. With scientific research on the basic scientific research properties, the scientific 4
research book starts to make Extreme SuperHyperPath theory and Neutrosophic SuperHyperPath 5
theory more (Extremely/Neutrosophicly) understandable. 6
7
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 8
Notions, namely, a SuperHyperPath and Neutrosophic SuperHyperPath . Two different types 9

of SuperHyperDefinitions are debut for them but the scientific research goes further and the 10
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 11
and well-reviewed. The literature review is implemented in the whole of this research. For shining 12
the elegancy and the significancy of this research, the comparison between this SuperHyperNo- 13
tion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The 14
definitions are followed by the examples and the instances thus the clarifications are driven with 15
different tools. The applications are figured out to make sense about the theoretical aspect of 16
this ongoing research. The “Cancer’s Recognition” are the under scientific research to figure 17
out the challenges make sense about ongoing and upcoming research. The special case is up. 18
The cells are viewed in the deemed ways. There are different types of them. Some of them are 19
individuals and some of them are well-modeled by the group of cells. These types are all officially 20
called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. 21
The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” are chosen and 22
elected to scientific research about “Cancer’s Recognition”. Thus these complex and dense 23
SuperHyperModels open up some avenues to scientific research on theoretical segments and 24
“Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 25
collected in the form of some questions and some problems. Assume a SuperHyperGraph. Then 26
δ−SuperHyperPath is a maximal of SuperHyperVertices with a maximum cardinality such that 27

either of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeigh- 28
bors of s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 29
The first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, 30
holds if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperPath is a maximal 31
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that either 32
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeigh- 33
1
bors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; and 34

|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 35
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 36
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperPath . 37
Since there’s more ways to get type-results to make a SuperHyperPath more understandable. 38
For the sake of having Neutrosophic SuperHyperPath, there’s a need to “redefine” the notion 39
of a “SuperHyperPath ”. The SuperHyperVertices and the SuperHyperEdges are assigned by 40

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

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperPath, 65
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 66
“Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHy- 67
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 68
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neut- 69

rosophic SuperHyperPath” where it’s the strongest [the maximum Neutrosophic value from all the 70
SuperHyperPath amid the maximum value amid all SuperHyperVertices from a SuperHyperPath 71
.] SuperHyperPath . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number 72
of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 73
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 74
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperPath if it’s 75
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 76
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 77
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 78
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 79

forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 81
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 82
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 83
the specific designs and the specific architectures. The SuperHyperModel is officially called 84
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 85
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 86

and the common and intended properties between “specific” cells and “specific group” of cells 87
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 88
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 89
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 90
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced in 91
redeemed ways. The recognition of the cancer in the long-term function. The specific region 92
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 93
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 94
identified since there are some determinacy, indeterminacy and neutrality about the moves and 95
the effects of the cancer on that region; this event leads us to choose another model [it’s said 96
to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and 97
what’s done. There are some specific models, which are well-known and they’ve got the names, 98
and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 99
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 100
SuperHyperPath(-/SuperHyperPath, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 101
tipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperPath or the 102
strongest SuperHyperPath in those Neutrosophic SuperHyperModels. For the longest Super- 103
HyperPath, called SuperHyperPath, and the strongest SuperHyperPath, called Neutrosophic 104
SuperHyperPath, some general results are introduced. Beyond that in SuperHyperStar, all 105
possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential 106
to have at least three SuperHyperEdges to form any style of a SuperHyperPath. There isn’t any 107
formation of any SuperHyperPath but literarily, it’s the deformation of any SuperHyperPath. It, 108
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 109
Neutrosophic SuperHyperGraph theory are proposed. 110

Keywords: SuperHyperGraph, (Neutrosophic) SuperHyperPath, Cancer’s Recognition 111
AMS Subject Classification: 05C17, 05C22, 05E45 112

113
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 114
Notion, namely, Neutrosophic SuperHyperPath . Two different types of SuperHyperDefinitions 115
are debut for them but the scientific research goes further and the SuperHyperNotion, Su- 116
perHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. 117
The literature review is implemented in the whole of this research. For shining the elegancy 118
and the significancy of this research, the comparison between this SuperHyperNotion with 119
other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The defini- 120
tions are followed by the examples and the instances thus the clarifications are driven with 121
different tools. The applications are figured out to make sense about the theoretical aspect 122
of this ongoing research. The “Cancer’s Neutrosophic Recognition” are the under scientific 123
research to figure out the challenges make sense about ongoing and upcoming research. The 124

special case is up. The cells are viewed in the deemed ways. There are different types of 125
them. Some of them are individuals and some of them are well-modeled by the group of 126
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 127
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 128
SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s Neutrosophic 129
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 130
scientific research on theoretical segments and “Cancer’s Neutrosophic Recognition”. Some 131
avenues are posed to pursue this research. It’s also officially collected in the form of some questions 132
and some problems. Assume a SuperHyperGraph. Then an “δ−SuperHyperPath” is a maximal 133
SuperHyperPath of SuperHyperVertices with maximum cardinality such that either of the 134
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 135
|S∩N (s)| > |S∩(V \N (s))|+δ, |S∩N (s)| < |S∩(V \N (s))|+δ. The first Expression, holds if S is an 136
“δ−SuperHyperOffensive”. And the second Expression, holds if S is an “δ−SuperHyperDefensive”; 137

a“Neutrosophic δ−SuperHyperPath” is a maximal Neutrosophic SuperHyperPath of SuperHyper- 138
Vertices with maximum Neutrosophic cardinality such that either of the following expressions hold 139
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 140
|S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first 141
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 142
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 143

version of SuperHyperPath . Since there’s more ways to get type-results to make SuperHyperPath 144
more understandable. For the sake of having Neutrosophic SuperHyperPath, there’s a need to “re- 145
define” the notion of “SuperHyperPath ”. The SuperHyperVertices and the SuperHyperEdges are 146
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 147
position of labels to assign to the values. Assume a SuperHyperPath . It’s redefined Neutrosophic 148
SuperHyperPath if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, 149
Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with 150
the key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values 151
of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 152
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 153
Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 154
To get structural examples and instances, I’m going to introduce the next SuperHyperClass 155
of SuperHyperGraph based on SuperHyperPath . It’s the main. It’ll be disciplinary to have 156
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have 157
all SuperHyperPath until the SuperHyperPath, then it’s officially called “SuperHyperPath” 158
but otherwise, it isn’t SuperHyperPath . There are some instances about the clarifications 159
for the main definition titled “SuperHyperPath ”. These two examples get more scrutiny and 160
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 161
on SuperHyperPath . For the sake of having Neutrosophic SuperHyperPath, there’s a need to 162
“redefine” the notion of “Neutrosophic SuperHyperPath” and “Neutrosophic SuperHyperPath ”. 163
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 164
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 165
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 166

the intended Table holds. And SuperHyperPath are redefined “Neutrosophic SuperHyperPath” 167
if the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 168
Since there’s more ways to get Neutrosophic type-results to make Neutrosophic SuperHyperPath 169
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 170

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperPath, 171

SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 172
“Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHy- 173
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 174
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “Neutro- 175
sophic SuperHyperPath” where it’s the strongest [the maximum Neutrosophic value from all 176
SuperHyperPath amid the maximum value amid all SuperHyperVertices from a SuperHyperPath 177
.] SuperHyperPath . A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of 178
elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 179
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperPath if it’s 181
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 182
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 183
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 187
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 197
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 198
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 199
and the long cycle of the move from the cancer is identified by this research. Sometimes the 200
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 201
and neutrality about the moves and the effects of the cancer on that region; this event leads 202
us to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 203
perception on what’s happened and what’s done. There are some specific models, which are 204
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 205
moves and the traces of the cancer on the complex tracks and between complicated groups of 206
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperPath, SuperHyper- 207
Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 208
either the longest SuperHyperPath or the strongest SuperHyperPath in those Neutrosophic 209
SuperHyperModels. For the longest SuperHyperPath, called SuperHyperPath, and the strongest 210
SuperHyperPath, called Neutrosophic SuperHyperPath, some general results are introduced. 211
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 212
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 213
style of a SuperHyperPath. There isn’t any formation of any SuperHyperPath but literarily, 214
it’s the deformation of any SuperHyperPath. It, literarily, deforms and it doesn’t form. A 215
basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 216

proposed. 217
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperPath, Cancer’s Neutro- 218
sophic Recognition 219

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

228
229
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educa- 230
tional Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 231
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 232
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 233
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 234
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 235
236
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 237
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 238
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 239

Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 240
33131 United States. This research book presents different types of notions SuperHyperResolving 241
and SuperHyperPath in the setting of duality in neutrosophic graph theory and neutrosophic 242
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 243
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 244
that what’s done in this research book which is popular in the terms of high readers in Scribd. 245
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - 246
Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1- 247
59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 248
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 249
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 250
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 251



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

Ref. [HG1] by Henry Garrett (2022). It’s first step toward the research on neutrosophic 257
SuperHyperGraphs. This research article is published on the journal “Neutrosophic Sets 258
and Systems” in issue 49 and the pages 531-561. In this research article, different types 259
of notions like dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n- 260
Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophic- number, 261
independent number, independent neutrosophic-number, clique number, clique neutrosophic- 262

number, matching number, matching neutrosophic-number, girth, neutrosophic girth, 1-zero- 263
forcing number, 1-zero- forcing neutrosophic-number, failed 1-zero-forcing number, failed 1-zero- 264
forcing neutrosophic-number, global- offensive alliance, t-offensive alliance, t-defensive alliance, 265
t-powerful alliance, and global-powerful alliance are defined in SuperHyperGraph and neutrosophic 266
SuperHyperGraph. Some Classes of SuperHyperGraph and Neutrosophic SuperHyperGraph are 267
cases of research. Some results are applied in family of SuperHyperGraph and neutrosophic 268
SuperHyperGraph. Thus this research article has concentrated on the vast notions and introducing 269
the majority of notions. 270
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 271
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 272
hypergraphs” in Ref. [HG2] by Henry Garrett (2022). In this research article, a novel approach 273
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 274

forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 275
prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science Research 276
(JCTCSR)” with abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 277
06-14. The research article studies deeply with choosing neutrosophic hypergraphs instead of 278
neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results based on 279
initial background. 280

The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 281
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 282
Neutrosophic Super Hyper Classes” in Ref. [HG3] by Henry Garrett (2022). In this research 283
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph 284
based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of 285
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal 286
11
of Mathematical Techniques and Computational Mathematics(JMTCM)” with abbreviation “J 287

Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. The research article 288
studies deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. 289
It’s the breakthrough toward independent results based on initial background and fundamental 290
SuperHyperNumbers. 291
In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 292
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. 293

[HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” 294
in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme 295
of Confrontation under Cancer’s Recognition as the Model in The Setting of (Neutrosophic) 296
SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), “Uncertainty On The Act 297
And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed 298
SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. 299

[HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 300
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] by Henry Garrett (2022), 301
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality 302
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside 303
Numbers In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph 304
and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry Garrett (2022), “Breaking the 305
Continuity and Uniformity of Cancer In The Worst Case of Full Connections With Extreme 306
Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs” 307
in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic Failed SuperHyperStable as the 308
Survivors on the Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 309
Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry Garrett (2022), “Extremism of 310
the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Recognition Titled 311
(Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry Garrett (2022), “(Neutrosophic) 312
1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 313
in Ref. [HG13] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs 314
To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 315
In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), “Neutrosophic 1-Failed 316
SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on 317

Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by Henry Garrett (2022), 318
“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- SuperHyperModelled 319
(Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett (2022), “Neutrosophic 320
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 321
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by Henry Garrett (2022), 322
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 323
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG17] by 324
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 325
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 326
[HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 327
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [HG19] by 328

Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 329
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 330
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 331
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on 332

SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 333

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and Co- 334
SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 335
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyperPath 336
and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game 337
Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), 338
“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition In 339

Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The 340
Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types 341
of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” 342
in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the 343
Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 344
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett 345

(2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In 346
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 347
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 348
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 349
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 350
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 351
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 352
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 353
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 354
in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), 355
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s 356
Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett 357

(2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 358
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG32] 359
by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 360
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 361
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 362
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” 363

in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in 364
Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry 365
Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 366
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 367
[HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperPath and 368
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 369
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 370
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 371
in Ref. [HG38] by Henry Garrett (2022), there are some endeavors to formalize the basic 372
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph. 373
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 374
in Ref. [HG39] by Henry Garrett (2022) which is indexed by Google Scholar and has more 375
than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Ohio: 376
E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United 377
State. This research book covers different types of notions and settings in neutrosophic graph 378

theory and neutrosophic SuperHyperGraph theory. 379

Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 380
as book in Ref. [HG40] by Henry Garrett (2022) which is indexed by Google Scholar and has 381
more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Florida: 382
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 383
United States. This research book presents different types of notions SuperHyperResolving 384
and SuperHyperPath in the setting of duality in neutrosophic graph theory and neutrosophic 385
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on the 389
framework of Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique 390
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; 391
HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 392
HG33; HG34; HG35; HG36; HG37; HG38]. Two popular scientific research books in Scribd 394
in the terms of high readers, 2638 and 3363 respectively, on neutrosophic science is on [HG39; 395
HG40]. 396

Bibliography 397
HG1 [1] Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyper- 398
Graph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 10.5281/zen- 399
odo.6456413). (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). (ht- 400
tps://digitalrepository.unm.edu/nss_journal/vol49/iss1/34). 401
HG2 [2] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 402
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 403
Trends Comp Sci Res 1(1) (2022) 06-14. 404
HG3 [3] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic 405
Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 406
Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. 407
HG4 [4] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 408
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 409
CERN European Organization for Nuclear scientific research - Zenodo, Nov. 2022. CERN 410
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 411

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

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

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 419
HG7 [7] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 420
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic Supe- 421
rHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 10.20944/pre- 422
prints202301.0282.v1). 423
HG8 [8] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 424
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 425
10.20944/preprints202301.0267.v1). 426
15
HG9 [9] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 427
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 428
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 429
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 430
(doi: 10.20944/preprints202301.0265.v1). 431
HG10 [10] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 432
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 433
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 434
prints202301.0262.v1). 435
HG11 [11] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 436
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyper- 437
Graphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 438
HG12 [12] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 439
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224, 440

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

prints202301.0105.v1). 444
HG14 [14] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 445
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 446
HG15 [15] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 448
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 449
Preprints 2023, 2023010044 450
HG16 [16] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 451
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 452
10.20944/preprints202301.0043.v1). 453
HG17 [17] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 454
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 455
HG19 [19] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 460
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 461
(doi: 10.20944/preprints202212.0549.v1). 462
HG20 [20] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 463
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 464
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 466

HG21 [21] Henry Garrett, “SuperHyperCycle on SuperHyperGraph and Neutrosophic SuperHyperGraph 467
With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 (doi: 468
10.20944/preprints202212.0500.v1). 469
HG22 [22] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 470
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 471
HG23 [23] Henry Garrett, “SuperHyperPath and SuperHyperResolving on Neutrosophic SuperHy- 473
perGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 474
HG24 [24] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 476

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 477
10.13140/RG.2.2.35061.65767). 478
HG25 [25] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 479
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 480
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 481
10.13140/RG.2.2.18494.15680). 482
HG26 [26] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 483
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 484
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 485

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

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 489
10.13140/RG.2.2.15897.70243). 490
HG28 [28] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 491
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 492
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 493
HG29 [29] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 494
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 495
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 496
10.13140/RG.2.2.23172.19849). 497
HG30 [30] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic 498
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of 499
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968). 500
HG31 [31] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyper- 501
Model Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, 502
(doi: 10.13140/RG.2.2.28945.92007). 503

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

HG35 [35] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 513
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 514
10.13140/RG.2.2.29430.88642). 515
HG37 [37] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperPath and 519
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 520
10.13140/RG.2.2.29173.86244). 521
HG38 [38] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 522
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph 523

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

| Book #109 531

| Title: SuperHyperPath 532
#Latest_Updates 533
#The_Links 534
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG Twitter 535
LinkedIn Amazon googlebooks GooglePlay 536
– 537
538
#Latest_Updates 539
540
#The_Links 541
542
| Book #109 543
544
|Title: SuperHyperPath 545
546
| Available at WordPress ResearchGate Scribd academia ZENODO_ORG Twitter LinkedIn 547
Amazon googlebooks GooglePlay 548
549
– 550
551
| Publisher | 552
(Paperback): https://www.amazon.com/dp/- 553
(Hardcover): https://www.amazon.com/dp/- 554

(Kindle Edition): https://www.amazon.com/dp/- 555
556
– 557
558
| ISBN | 559
(Paperback): - 560
(Hardcover): - 561
(Kindle Edition): CC BY-NC-ND 4.0 562
(EBook): CC BY-NC-ND 4.0 563
564
– 565
566
| Print length | 567
(Paperback): - pages 568
(Hardcover): - pages 569
(Kindle Edition): - pages 570
(E-Book): 348 pages 571
572
– 573
574
#Latest_Updates 575
576

#The_Links 577
578
| ResearchGate: https://www.researchgate.net/publication/- 579
580
| WordPress: https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/ 581
582
@Scribd: https://www.scribd.com/document/- 583

584
| academia: https://www.academia.edu/- 585
586
| ZENODO_ORG: https://zenodo.org/record/- 587
588
| googlebooks: https://books.google.com/books/about?id=- 589
590
| GooglePlay: https://play.google.com/store/books/details?id=- 591
592
593

Figure 2.1: “#108th Book” || SuperHyperPath February 2023 License: CC BY-NC-ND 4.0 Print
length: 348 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs
SuperHyperPath (Published Version) 594
595
The Link: 596
597
https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/ 598
599
– 600
601
Posted by Dr. Henry Garrett 602
603
February 18, 2023 604
605
Posted in 0109 | SuperHyperPath 606
607
Tags: 608
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 609
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 610
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 611
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 612
neutrosophic SuperHyperGraphs, Neutrosophic SuperHyperPath, Open Problems, Open Ques- 613

tions, Problems, Pure Math, Pure Mathematics, Questions, Real-World Applications, Recent 614
Research, Recognitions, Research, scientific research Article, scientific research Articles, scientific 615
research Book, scientific research Chapter, scientific research Chapters, Review, SuperHyper- 616
Classes, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, SuperHyperGraphs, 617
SuperHyperPath, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 618
Vertices. 619


In this scientific research book, there are some scientific research chapters on “Extreme 620
SuperHyperPath” and “Neutrosophic SuperHyperPath” about some researches on Extreme 621
SuperHyperPath and neutrosophic SuperHyperPath. 622

CHAPTER 3 623
Acknowledgements 624
The author is going to express his gratitude and his appreciation about the brains and their 625
hands which are showing the importance of words in the framework of every wisdom, knowledge, 626
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
627 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
628
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 629
of acknowledgements
for surviving from them and making the outstanding experiences about the tools and the ideas 630
to be on the star lines of words and shining like stars, forever. 631
25
CHAPTER 4 632
Extreme SuperHyperDominating 633
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 634
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 635
2023, (doi: 10.13140/RG.2.2.34953.52320). 636

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 637
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 638
(doi: 10.13140/RG.2.2.33275.80161). 639
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 640
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 641
10.13140/RG.2.2.11050.90569). 642
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyper- 643
Join In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 644
10.13140/RG.2.2.17761.79206). 645
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 647
10.13140/RG.2.2.19911.37285). 648
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 649
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 650
10.13140/RG.2.2.23266.81602). 651
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 653
10.13140/RG.2.2.19360.87048). 654
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 655
10.13140/RG.2.2.32363.21286). 657
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 659
10.13140/RG.2.2.11758.69441). 660
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 661
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 662
10.13140/RG.2.2.31891.35367). 663
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 665
10.13140/RG.2.2.21510.45125). 666
27
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 667
10.13140/RG.2.2.13121.84321). 669

CHAPTER 5 670
New Ideas On Super Missing By Hyper 671
Searching Of SuperHyperDominating In 672
Cancer’s Recognition With (Neutrosophic) 673
SuperHyperGraph 674
29
CHAPTER 6 675
ABSTRACT 676
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDominating). 677

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

or E 0 is called Neutrosophic e-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 680
that Va ∈ Ei , Ej ; Neutrosophic re-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 681
such that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 682
Neutrosophic v-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 683
and Neutrosophic rv-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 684
Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutro- 685

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

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

v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) for a 698
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 699
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 700
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 701
such that they form the Neutrosophic SuperHyperDominating; an Extreme SuperHyperDom- 702
inating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 703

sophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neutrosophic 704
rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 705
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Ex- 706
treme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an 707
Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges 708
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 709
31
and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHy- 710
perDominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDominating, 711
Neutrosophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neut- 712
rosophic rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph 713
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coef- 714
ficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 715
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 716

dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 717
that they form the Neutrosophic SuperHyperDominating; and the Neutrosophic power is cor- 718
responded to its Neutrosophic coefficient; an Extreme V-SuperHyperDominating if it’s either 719
of Neutrosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutro- 720
sophic v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 721
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of 722
an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVer- 723
tices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme Su- 724
perHyperVertices such that they form the Extreme SuperHyperDominating; a Neutrosophic 725
V-SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 726
rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 728
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 729
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 730
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 731
perDominating; an Extreme V-SuperHyperDominating SuperHyperPolynomial if it’s either of 732

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

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

of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 746
SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating; and the 747
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 748
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperDominating and 749
Neutrosophic SuperHyperDominating. Two different types of SuperHyperDefinitions are debut 750
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 751
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 752
implemented in the whole of this research. For shining the elegancy and the significancy of this 753
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 754
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 755

and the instances thus the clarifications are driven with different tools. The applications are 756
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 757
Recognition” are the under research to figure out the challenges make sense about ongoing and 758
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 759
different types of them. Some of them are individuals and some of them are well-modeled by 760
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 761
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 762
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 763
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 764
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 765
research. It’s also officially collected in the form of some questions and some problems. As- 766
sume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDominating is 767
a maximal of SuperHyperVertices with a maximum cardinality such that either of the fol- 768
lowing expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 769
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 770
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 771
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDominating is a maximal 772
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 773
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 774
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 775
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 776
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 777
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Super- 778
HyperDominating . Since there’s more ways to get type-results to make a SuperHyperDominating 779
more understandable. For the sake of having Neutrosophic SuperHyperDominating, there’s a 780
need to “redefine” the notion of a “SuperHyperDominating ”. The SuperHyperVertices and the 781
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 782
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperDominating 783
. It’s redefined a Neutrosophic SuperHyperDominating if the mentioned Table holds, concerning, 784
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 785
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The 786
Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 787
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 788
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 789
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 790
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperDominating 791

. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind 792
of SuperHyperClass. If there’s a need to have all SuperHyperDominating until the SuperHy- 793
perDominating, then it’s officially called a “SuperHyperDominating” but otherwise, it isn’t a 794
SuperHyperDominating . There are some instances about the clarifications for the main definition 795
titled a “SuperHyperDominating ”. These two examples get more scrutiny and discernment 796
since there are characterized in the disciplinary ways of the SuperHyperClass based on a Supe- 797
rHyperDominating . For the sake of having a Neutrosophic SuperHyperDominating, there’s a 798
need to “redefine” the notion of a “Neutrosophic SuperHyperDominating” and a “Neutrosophic 799
SuperHyperDominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by 800

of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 802
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperDominating are 803
redefined to a “Neutrosophic SuperHyperDominating” if the intended Table holds. It’s useful to 804
define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 805
type-results to make a Neutrosophic SuperHyperDominating more understandable. Assume a 806
Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 807
Table holds. Thus SuperHyperPath, SuperHyperDominating, SuperHyperStar, SuperHyperBi- 808

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 809
“Neutrosophic SuperHyperDominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic Super- 810
HyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 811
if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperDominating” 812
where it’s the strongest [the maximum Neutrosophic value from all the SuperHyperDominating 813
amid the maximum value amid all SuperHyperVertices from a SuperHyperDominating .] Super- 814
HyperDominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number 815
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperDominating if 818
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 819
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 820
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 834
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 835
SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, SuperHyperBipartite, SuperHyper- 844
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperDominating 845
or the strongest SuperHyperDominating in those Neutrosophic SuperHyperModels. For the 846
longest SuperHyperDominating, called SuperHyperDominating, and the strongest SuperHyper- 847

Dominating, called Neutrosophic SuperHyperDominating, some general results are introduced. 848
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 850
a SuperHyperDominating. There isn’t any formation of any SuperHyperDominating but literarily, 851
it’s the deformation of any SuperHyperDominating. It, literarily, deforms and it doesn’t form. 852
A basic familiarity with Neutrosophic SuperHyperDominating theory, SuperHyperGraphs, and 853
Neutrosophic SuperHyperGraphs theory are proposed. 854

Keywords: Neutrosophic SuperHyperGraph, SuperHyperDominating, Cancer’s Neutrosophic 855
Recognition 856

CHAPTER 7 858
Background 859

Ref. [HG1] by Henry Garrett (2022). It’s first step toward the research on neutrosophic Super- 863
HyperGraphs. This research article is published on the journal “Neutrosophic Sets and Systems” 864
in issue 49 and the pages 531-561. In this research article, different types of notions like domin- 865
ating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) 866
neutrosophic path, zero forcing number, zero forcing neutrosophic- number, independent number, 867
independent neutrosophic-number, clique number, clique neutrosophic-number, matching number, 868

matching neutrosophic-number, girth, neutrosophic girth, 1-zero-forcing number, 1-zero- forcing 869
neutrosophic-number, failed 1-zero-forcing number, failed 1-zero-forcing neutrosophic-number, 870
global- offensive alliance, t-offensive alliance, t-defensive alliance, t-powerful alliance, and global- 871
powerful alliance are defined in SuperHyperGraph and neutrosophic SuperHyperGraph. Some 872
Classes of SuperHyperGraph and Neutrosophic SuperHyperGraph are cases of research. Some 873
results are applied in family of SuperHyperGraph and neutrosophic SuperHyperGraph. Thus this 874
research article has concentrated on the vast notions and introducing the majority of notions. 875
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 880
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 881
Research (JCTCSR)” with abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 882
with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 883
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 884
based on initial background. 885
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory 887
and Neutrosophic Super Hyper Classes” in Ref. [HG3] by Henry Garrett (2022). In this 888
research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 889
SuperHyperGraph based on fundamental SuperHyperNumber and using neutrosophic SuperHy- 890
perClasses of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 891
entitled “Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 892
37
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 893
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 894
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 895
and fundamental SuperHyperNumbers. 896
In some articles are titled “0039 | Closing Numbers and SupeV-Closing Numbers as 897
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 898
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 899

Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme Super- 900
HyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 901
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 902
“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 903
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 904
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 905
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 906
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 907
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 908
Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 909
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 910
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 911
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 912
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 913
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 914
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 915
Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 916
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 917

Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 918
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 922
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 923

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 924
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 925
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 927
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 928
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 929
Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 930
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 931
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 932
Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 933
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 934
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 935
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutro- 936
sophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on 937

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 939
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 940
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 941
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 942
Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 943
Garrett (2022), “SuperHyperMatching By (V-)Definitions And Polynomials To Monitor Cancer’s 944
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 945

“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 946
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 947
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 948
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 949
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 950
Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 951
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 952
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 953
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 954
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 955
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 956
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 957
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of 958
Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 959
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 960
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 961
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 962

[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 965
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 966
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 967
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 968
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 969

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 970
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 971
eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 972
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 973


United States. This research book presents different types of notions SuperHyperResolving and 989
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 990
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 994
the framework of Extreme SuperHyperDominating theory, Neutrosophic SuperHyperDominating 995
HG40]. 1001

CHAPTER 8 1002
Applied Notions Under The Scrutiny Of 1003
The Motivation Of This Scientific Research 1004
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1005
try to bring the motivations in the narrative ways. Some cells have been faced with some 1006
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1007
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1008
as some groups and some groups or individuals have excessive labels which all are raised from 1009
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1010
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1011
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1012
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1013
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1014
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1015
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1016
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1017
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1018
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1019
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1020
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1021
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1022
disease but the model is going to figure out what’s going on this phenomenon. The special case of 1023
this disease is considered and as the consequences of the model, some parameters are used. The 1024
cells are under attack of this disease but the moves of the cancer in the special region are the matter 1025
of mind. The recognition of the cancer could help to find some treatments for this disease. The 1026
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1027
Recognition” and both bases are the background of this research. Sometimes the cancer has been 1028
happened on the region, full of cells, groups of cells and embedded styles. In this segment, the 1029
SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the moves of 1030
the cancer in the forms of alliances’ styles with the formation of the design and the architecture 1031
are formally called “ SuperHyperDominating” in the themes of jargons and buzzwords. The prefix 1032
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 1033
SuperHyperNotions. The recognition of the cancer in the long-term function. The specific region 1034
41
the effects of the cancer on that region; this event leads us to choose another model [it’s said to be 1038
Extreme SuperHyperGraph] to have convenient perception on what’s happened and what’s done. 1039
There are some specific models, which are well-known and they’ve got the names, and some general 1040
models. The moves and the traces of the cancer on the complex tracks and between complicated 1041
groups of cells could be fantasized by a Extreme SuperHyperPath (-/SuperHyperDominating, 1042

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 1043
is to find either the optimal SuperHyperDominating or the Extreme SuperHyperDominating 1044
in those Extreme SuperHyperModels. Some general results are introduced. Beyond that in 1045
SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1046
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1047
SuperHyperDominating. There isn’t any formation of any SuperHyperDominating but literarily, 1048
Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1050
amount of SuperHyperDominating” of either individual of cells or the groups of cells based on the 1051
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDominating” based 1052
on the fixed groups of cells or the fixed groups of group of cells? 1053
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1054
messy and dense SuperHyperModels where embedded notions are illustrated? 1055
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1056
Thus it motivates us to define different types of “ SuperHyperDominating” and “Extreme 1057
SuperHyperDominating” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1058
research has taken more motivations to define SuperHyperClasses and to find some connections 1059
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances 1060
and examples to make clarifications about the framework of this research. The general results 1061
and some results about some connections are some avenues to make key point of this research, 1062
“Cancer’s Recognition”, more understandable and more clear. 1063
The framework of this research is as follows. In the beginning, I introduce basic definitions to clarify 1064
about preliminaries. In the subsection “Preliminaries”, initial definitions about SuperHyperGraphs 1065
and Extreme SuperHyperGraph are deeply-introduced and in-depth-discussed. The elementary 1066
concepts are clarified and illustrated completely and sometimes review literature are applied to 1067
make sense about what’s going to figure out about the upcoming sections. The main definitions and 1068
their clarifications alongside some results about new notions, SuperHyperDominating and Extreme 1069
SuperHyperDominating, are figured out in sections “ SuperHyperDominating” and “Extreme 1070
SuperHyperDominating”. In the sense of tackling on getting results and in order to make sense 1071
about continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform 1072
are introduced and as their consequences, corresponded SuperHyperClasses are figured out to 1073
debut what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1074
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1075
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1076
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1077
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations and 1078
as concluding and closing section of theoretical research are contained in the section “General 1079
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1080

fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 1081
SuperHyperDominating”, “Extreme SuperHyperDominating”, “Results on SuperHyperClasses” 1082
and “Results on Extreme SuperHyperClasses”. There are curious questions about what’s done 1083
about the SuperHyperNotions to make sense about excellency of this research and going to 1084
figure out the word “best” as the description and adjective for this research as presented 1085
in section, “ SuperHyperDominating”. The keyword of this research debut in the section 1086
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial Steps 1087
Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps Toward 1088
SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there are some 1089
scrutiny and discernment on what’s done and what’s happened in this research in the terms 1090
of “questions” and “problems” to make sense to figure out this research in featured style. The 1091
advantages and the limitations of this research alongside about what’s done in this research to 1092
make sense and to get sense about what’s figured out are included in the section, “Conclusion 1093
and Closing Remarks”. 1094

CHAPTER 9 1095
Extreme Preliminaries Of This Scientific 1096
Research On the Redeemed Ways 1097
In this section, the basic material in this scientific research, is referred to [Single Valued 1098
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1099
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1100

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [t- 1101
norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyper- 1102
Graph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1103
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1104
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1105
their clarifications are addressed to Ref.[HG38]. 1106

In this subsection, the basic material which is used in this scientific research, is presented. Also, 1107
the new ideas and their clarifications are elicited. 1108
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 [. 1109
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}.
45
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). 1110
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 1111

S = (V, E), where 1112
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1113
(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); 1114
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1115
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1, 2, . . . , n0 ); 1116
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1117
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1118
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1119
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1120
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 . 1121
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1122
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1123
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1124

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1125
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1126
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1127
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1128
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1129
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1130

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

(Ref.[HG38],Definition 2.7,p.3). 1132
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). The 1133
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) 1134
Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up 1135
items. 1136
(i) If |Vi | = 1, then Vi is called vertex; 1137
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1138
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1139
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1140
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1141
SuperEdge; 1142
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1143
SuperHyperEdge. 1144
If we choose different types of binary operations, then we could get hugely diverse types of 1145
general forms of Neutrosophic SuperHyperGraph (NSHG). 1146
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1147

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1148
x, y, z, w ∈ [0, 1]: 1149
(i) 1 ⊗ x = x; 1150
(ii) x ⊗ y = y ⊗ x; 1151
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1152
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1153

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

S = (V, E), where 1156

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1161
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1162
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1163
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1164
0

items. 1179
SuperEdge; 1185
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1188
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1189
makes the patterns and regularities. 1190
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1191
of elements of SuperHyperEdges are the same. 1192

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1193
makes to have SuperHyperUniform more understandable. 1194
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1195
as follows. 1196
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1197
two given SuperHyperEdges with two exceptions; 1198
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1199
SuperHyperEdges; 1200
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1201
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1202
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1203
in common; 1204
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1205
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1206
SuperHyperEdge in common; 1207
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1208
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1209
SuperVertex. 1210
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 1211

(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1212
(i) Vi , Vi+1 ∈ Ei0 ; 1213
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1214
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1215
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1216
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1217
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1218
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1219
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1220
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1222
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1223
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1224
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1225
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHyper- 1226
Path . 1227
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 1228
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1229
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1230
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1231
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1232
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1233

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

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


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

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


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

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

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

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

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

1261
Neutrosophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and 1262
Neutrosophic rv-SuperHyperDominating. 1263
Definition 9.0.19. ((Neutrosophic) SuperHyperDominating). 1264

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

1267
Neutrosophic rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph 1269
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1270
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 1271
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1272
form the Extreme SuperHyperDominating; 1273
(ii) a Neutrosophic SuperHyperDominating if it’s either of Neutrosophic e- 1274

SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutrosophic v- 1275
SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 1276
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1277
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 1278
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1279
SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating; 1280

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

rosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutrosophic 1282
v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 1283
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1284
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1285
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 1286
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 1287

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

Neutrosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neut- 1291
rosophic v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and 1292
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1293
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1294
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 1295

of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 1296
sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1297
Neutrosophic SuperHyperDominating; and the Neutrosophic power is corresponded to its 1298
Neutrosophic coefficient; 1299
(v) an Extreme V-SuperHyperDominating if it’s either of Neutrosophic e- 1300

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

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

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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 1317
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 1318
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1319
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 1320
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 1321
and the Extreme power is corresponded to its Extreme coefficient; 1322
(viii) a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 1323


number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 1328

Neutrosophic coefficient. 1332
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDominating). 1333

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

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

(28.1), holds if S is an δ−SuperHyperDefensive; 1339
(ii) a Neutrosophic δ−SuperHyperDominating is a Neutrosophic kind of Neutrosophic 1340

SuperHyperDominating such that either of the following Neutrosophic expressions hold for 1341
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1342
|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 (28.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 1343

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

are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1347
of the position of labels to assign to the values. 1348
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 1349
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (28.1) holds. 1350
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1351
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1352
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (28.2) 1354
holds. Thus Neutrosophic SuperHyperPath , SuperHyperDominating, SuperHyperStar, 1355
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1356
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1357
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1358
Neutrosophic SuperHyperWheel if the Table (28.2) holds. 1359

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

136TBL4

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

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

there’s the usage of the position of labels to assign to the values. 1366
136DEF1 Definition 9.0.23. Assume a SuperHyperDominating. It’s redefined a Neutrosophic Super- 1367
HyperDominating if the Table (28.3) holds. 1368

CHAPTER 10 1369
Extreme SuperHyperDominating But As 1370
The Extensions Excerpt From Dense And 1371
Super Forms 1372
136EXM1 Example 10.0.1. Assume a Extreme SuperHyperGraph (NSHG) S is an ordered pair S = (V, E) 1373
in the mentioned Extreme Figures in every Extreme items. 1374
• On the Figure (29.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDom- 1375
inating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 1376
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is a 1377
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 1378
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 1379
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 1380
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 1381
SuperHyperDominating. 1382
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.
1383
inating, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 1385
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the 1386
terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 1387
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 1388
SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , 1389
55
Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperDominating in the Extreme Example (41.0.3) 136NSHG1
is excluded in every given Extreme SuperHyperDominating. 1390

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

C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial = 3z.
1394
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 .
1397

C(N SHG)Extreme SuperHyperDominating SuperHyperPolynomial = 4z.
C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial = z.
1400
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 .
1403
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 .
1406



C(N SHG)Extreme V-SuperHyperDominating SuperHyperPolynomial =

= 4 × 5 × 5z 3 .
1409

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


= 4 × 5 × 5z 3 .
1415

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



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

= 5 × 5z 5 .
1421
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 .
1424


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

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


4 × 3z 3 .
1433



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

4 × 3z 4 .
1436

2 × 4 × 3z 4 .
1439
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 .
1442

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

1448

= 5 × 1z 2 .
1451


SuperHyperDominating in the Extreme Example (41.0.3) 95NHG1

SuperHyperDominating in the Extreme Example (41.0.3) 95NHG2

CHAPTER 11 1452
The Extreme Departures on The 1453
Theoretical Results Toward Theoretical 1454
Motivations 1455
The previous Extreme approach apply on the upcoming Extreme results on Extreme 1456
SuperHyperClasses. 1457
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 1458
C(N SHG)Extreme SuperHyperDominating =

|EESHG:(V,E) |
Extreme Cardinality
c
= {E3i+1 }i=0 3
.
C(N SHG)Extreme SuperHyperDominating SuperHyperPolynomial
|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 1459
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 1460
75
Figure 11.1: a Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperDom-

inating in the Example (41.0.5) 136NSHG18a
new way to redefine as 1461
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 1462
ViEXT ERN AL in the literatures of SuperHyperDominating. The latter is straightforward. 1463
136EXM18a Example 11.0.2. In the Figure (30.1), the connected Extreme SuperHyperPath ESHP : (V, E), 1464
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 1465
(30.1), is the SuperHyperDominating. 1466

CHAPTER 12 1467
The Surveys of Mathematical Sets On The 1468
Results But As The Initial Motivation 1469
For the SuperHyperDominating, Extreme SuperHyperDominating, and the Extreme SuperHyper- 1470
Dominating, some general results are introduced. 1471
Remark 12.0.1. Let remind that the Extreme SuperHyperDominating is “redefined” on the 1472
positions of the alphabets. 1473
Corollary 12.0.2. Assume Extreme SuperHyperDominating. Then 1474
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 1475
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 1476
the neutrality, for i = 1, 2, 3, respectively. 1477
Corollary 12.0.3. Assume a Extreme SuperHyperGraph on the same identical letter of the alphabet. 1478
Then the notion of Extreme SuperHyperDominating and SuperHyperDominating coincide. 1479
Then a consecutive sequence of the SuperHyperVertices is a Extreme SuperHyperDominating if 1481
and only if it’s a SuperHyperDominating. 1482
Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperDominating if 1484
and only if it’s a longest SuperHyperDominating. 1485
Corollary 12.0.6. Assume SuperHyperClasses of a Extreme SuperHyperGraph on the same 1486

identical letter of the alphabet. Then its Extreme SuperHyperDominating is its SuperHyper- 1487
Dominating and reversely. 1488
Corollary 12.0.7. Assume a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, 1489
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter 1490
77
of the alphabet. Then its Extreme SuperHyperDominating is its SuperHyperDominating and 1491
reversely. 1492
Corollary 12.0.8. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperDominat- 1493
ing isn’t well-defined if and only if its SuperHyperDominating isn’t well-defined. 1494
Corollary 12.0.9. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its Extreme 1495
SuperHyperDominating isn’t well-defined if and only if its SuperHyperDominating isn’t well- 1496
defined. 1497
Corollary 12.0.10. Assume a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyper- 1498

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme Super- 1499
HyperDominating isn’t well-defined if and only if its SuperHyperDominating isn’t well-defined. 1500
Corollary 12.0.11. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperDomin- 1501
ating is well-defined if and only if its SuperHyperDominating is well-defined. 1502
Corollary 12.0.12. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its Extreme 1503
SuperHyperDominating is well-defined if and only if its SuperHyperDominating is well-defined. 1504
Corollary 12.0.13. Assume a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyper- 1505

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme Super- 1506
HyperDominating is well-defined if and only if its SuperHyperDominating is well-defined. 1507
Proposition 12.0.14. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then V is 1508
(i) : the dual SuperHyperDefensive SuperHyperDominating; 1509
(ii) : the strong dual SuperHyperDefensive SuperHyperDominating; 1510
(iii) : the connected dual SuperHyperDefensive SuperHyperDominating; 1511
(iv) : the δ-dual SuperHyperDefensive SuperHyperDominating; 1512
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDominating; 1513
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDominating. 1514
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be a Extreme SuperHyperGraph. Then ∅ is 1515
(i) : the SuperHyperDefensive SuperHyperDominating; 1516
(ii) : the strong SuperHyperDefensive SuperHyperDominating; 1517
(iii) : the connected defensive SuperHyperDefensive SuperHyperDominating; 1518
(iv) : the δ-SuperHyperDefensive SuperHyperDominating; 1519
(v) : the strong δ-SuperHyperDefensive SuperHyperDominating; 1520
(vi) : the connected δ-SuperHyperDefensive SuperHyperDominating. 1521
Proposition 12.0.16. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then an independent 1522
SuperHyperSet is 1523

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

which is a SuperHyperDominating/SuperHyperPath. Then V is a maximal 1531
(i) : SuperHyperDefensive SuperHyperDominating; 1532
(ii) : strong SuperHyperDefensive SuperHyperDominating; 1533
(iii) : connected SuperHyperDefensive SuperHyperDominating; 1534
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDominating; 1535
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDominating; 1536
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDominating; 1537
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1538
Proposition 12.0.18. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is a SuperHy- 1539
perUniform SuperHyperWheel. Then V is a maximal 1540
(i) : dual SuperHyperDefensive SuperHyperDominating; 1541
(ii) : strong dual SuperHyperDefensive SuperHyperDominating; 1542
(iii) : connected dual SuperHyperDefensive SuperHyperDominating; 1543
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 1544
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 1545
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 1546
which is a SuperHyperDominating/SuperHyperPath. Then the number of 1549
(i) : the SuperHyperDominating; 1550
(ii) : the SuperHyperDominating; 1551
(iii) : the connected SuperHyperDominating; 1552
(iv) : the O(ESHG)-SuperHyperDominating; 1553

(v) : the strong O(ESHG)-SuperHyperDominating; 1554
(vi) : the connected O(ESHG)-SuperHyperDominating. 1555
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 1556
coincide. 1557

which is a SuperHyperWheel. Then the number of 1559
(i) : the dual SuperHyperDominating; 1560
(ii) : the dual SuperHyperDominating; 1561
(iii) : the dual connected SuperHyperDominating; 1562
(iv) : the dual O(ESHG)-SuperHyperDominating; 1563
(v) : the strong dual O(ESHG)-SuperHyperDominating; 1564
(vi) : the connected dual O(ESHG)-SuperHyperDominating. 1565
coincide. 1567

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 1569
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 1570
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 1571
is a 1572
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperDominating; 1576
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperDominating; 1577
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperDominating. 1578

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number 1581
of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1582
is a 1583

(iv) : δ-SuperHyperDefensive SuperHyperDominating; 1587
(v) : strong δ-SuperHyperDefensive SuperHyperDominating; 1588
(vi) : connected δ-SuperHyperDefensive SuperHyperDominating. 1589

SuperHyperMultipartite. Then Then the number of 1592
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying 1599
r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the 1600
exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1601
Proposition 12.0.24. Let ESHG : (V, E) be a Extreme SuperHyperGraph. The number of 1602
connected component is |V − S| if there’s a SuperHyperSet which is a dual 1603
(iv) : SuperHyperDominating; 1607
(v) : strong 1-SuperHyperDefensive SuperHyperDominating; 1608
(vi) : connected 1-SuperHyperDefensive SuperHyperDominating. 1609
Proposition 12.0.25. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then the number is 1610
at most O(ESHG) and the Extreme number is at most On (ESHG). 1611
Proposition 12.0.26. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Su- 1612
perHyperComplete. The number is O(ESHG:(V,E))2 + 1 and the Extreme number is 1613
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1614
t>
2

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

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

2 + 1)-SuperHyperDefensive SuperHyperDominating. 1620
Proposition 12.0.27. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is ∅. The number 1621
is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of dual 1622
(iv) : 0-SuperHyperDefensive SuperHyperDominating; 1626
Proposition 12.0.28. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHyper- 1629
Complete. Then there’s no independent SuperHyperSet. 1630
Proposition 12.0.29. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHy- 1631
perDominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) and the 1632

Extreme number is On (ESHG : (V, E)), in the setting of a dual 1633
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 1637
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 1638
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating. 1639
Proposition 12.0.30. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Super- 1640
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 1641
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 1642
t>
2
setting of a dual 1643



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1650
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 1651
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of these 1652
specific SuperHyperClasses of the Extreme SuperHyperGraphs. 1653
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 1654
SuperHyperDefensive SuperHyperDominating, then ∀v ∈ V \ S, ∃x ∈ S such that 1655
(i) v ∈ Ns (x); 1656
(ii) vx ∈ E. 1657
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 1658
SuperHyperDefensive SuperHyperDominating, then 1659
(i) S is SuperHyperDominating set; 1660
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1661
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 1662
(i) Γ ≤ O; 1663
(ii) Γs ≤ On . 1664
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 1665
connected. Then 1666
(i) Γ ≤ O − 1; 1667
(ii) Γs ≤ On − Σ3i=1 σi (x). 1668
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1669
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperDom- 1670

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

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

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

inating; 1691
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1693
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 1694
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 1696
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDominating; 1697
(ii) Γ = 1; 1698
(iii) Γs = Σ3i=1 σi (c); 1699
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDominating. 1700
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1701
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 1702
SuperHyperDefensive SuperHyperDominating; 1703
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1704
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1705
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 1706
SuperHyperDefensive SuperHyperDominating. 1707
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1708

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


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

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

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


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

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

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

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

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

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

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

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


CHAPTER 13 1816
Extreme Applications in Cancer’s Extreme 1817
Recognition 1818
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1819
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1820
as the consequences of the model, some parameters are used. The cells are under attack of this 1821
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1822
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1823
In the following, some Extreme steps are Extreme devised on this disease. 1824
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1825
function. 1826
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s called 1827
Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer is 1828
identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1829
since there are some determinacy, indeterminacy and neutrality about the moves and the 1830
effects of the cancer on that region; this event leads us to choose another model [it’s said 1831
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1832
what’s done. 1833
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1834
they’ve got the names, and some general Extreme models. The moves and the Extreme 1835
traces of the cancer on the complex tracks and between complicated groups of cells could 1836
be fantasized by a Extreme SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, 1837
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1838
either the Extreme SuperHyperDominating or the Extreme SuperHyperDominating in those 1839
Extreme Extreme SuperHyperModels. 1840
89
CHAPTER 14 1841
Case 1: The Initial Extreme Steps 1842
Toward Extreme SuperHyperBipartite 1843
as Extreme SuperHyperModel 1844
Step 4. (Extreme Solution) In the Extreme Figure (33.1), the Extreme SuperHyperBipartite is 1845
Extreme highlighted and Extreme featured. 1846
By using the Extreme Figure (33.1) and the Table (33.1), the Extreme SuperHyperBipartite 1847
is obtained. 1848
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme result, 1849
Figure 14.1: a Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHyper-

Dominating 136NSHGaa21aa
91
Belong to The Extreme SuperHyperBipartite

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

(V, E), in the Extreme SuperHyperModel (33.1), is the Extreme SuperHyperDominating. 1851

CHAPTER 15 1852
Case 2: The Increasing Extreme Steps 1853
Toward Extreme 1854
SuperHyperMultipartite as Extreme 1855
SuperHyperModel 1856
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperMultipartite 1857
is Extreme highlighted and Extreme featured. 1858
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperMulti- 1859
partite is obtained. 1860
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 1861
Figure 15.1: a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperDominating 136NSHGaa22aa
93
Belong to The Extreme SuperHyperMultipartite

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

ESHM : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyper- 1863
Dominating. 1864

CHAPTER 16 1865
Wondering Open Problems But As The 1866
Directions To Forming The Motivations 1867
In what follows, some “problems” and some “questions” are proposed. 1868
The SuperHyperDominating and the Extreme SuperHyperDominating are defined on a real-world 1869
application, titled “Cancer’s Recognitions”. 1870
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 1871
recognitions? 1872
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperDominating and the 1873
Extreme SuperHyperDominating? 1874
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 1875
them? 1876
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDominating 1877
and the Extreme SuperHyperDominating? 1878
Problem 16.0.5. The SuperHyperDominating and the Extreme SuperHyperDominating do a 1879

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperDominating, are 1880
there else? 1881
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 1882
Numbers types-results? 1883
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning the 1884
multiple types of SuperHyperNotions? 1885
95
CHAPTER 17 1886
Conclusion and Closing Remarks 1887
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 1888
research are illustrated. Some benefits and some advantages of this research are highlighted. 1889
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 1890
In this endeavor, two SuperHyperNotions are defined on the SuperHyperDominating. For 1891
that sake in the second definition, the main definition of the Extreme SuperHyperGraph is 1892
redefined on the position of the alphabets. Based on the new definition for the Extreme 1893
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperDominating, finds the 1894
convenient background to implement some results based on that. Some SuperHyperClasses 1895
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 1896
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 1897
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 1898
SuperHyperDominating, the new SuperHyperClasses and SuperHyperClasses, are introduced. 1899
Some general results are gathered in the section on the SuperHyperDominating and the Extreme 1900
SuperHyperDominating. The clarifications, instances and literature reviews have taken the 1901
whole way through. In this research, the literature reviews have fulfilled the lines containing 1902
the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph are the 1903
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 1904
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1905
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1906
based on the connectivities of the moves of the cancer in the longest and strongest styles with 1907
the formation of the design and the architecture are formally called “ SuperHyperDominating” 1908
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1909
embedded styles to figure out the background for the SuperHyperNotions. In the Table (36.1), 1910
benefits and avenues for this research are, figured out, pointed out and spoken out. 1911
97
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

CHAPTER 18 1912
ExtremeSuperHyperDuality But As The 1913
Extensions Excerpt From Dense And 1914
Super Forms 1915
Definition 18.0.1. (Different ExtremeTypes of ExtremeSuperHyperDuality). 1916

Assume an ExtremeSuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Consider an 1917
ExtremeSuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 1918

is called 1919
(i) Extremee-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 1920

Va ∈ Ei , Ej ; 1921
(ii) Extremere-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 1922
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1923
(iii) Extremev-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 1924

Vi , Vj ∈ Ea ; 1925
(iv) Extremerv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 1926

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1927
(v) ExtremeSuperHyperDuality if it’s either of Extremee-SuperHyperDuality, Extremere- 1928
SuperHyperDuality, Extremev-SuperHyperDuality, and Extremerv-SuperHyperDuality. 1929
Definition 18.0.2. ((Neutrosophic) SuperHyperDuality). 1930

ExtremeSuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1932
(i) an Extreme SuperHyperDuality if it’s either of Extremee-SuperHyperDuality, 1933

Extremere-SuperHyperDuality, Extremev-SuperHyperDuality, and Extremerv-SuperHyperDuality
1934
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1935
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1936
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 1937
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 1938
99
(ii) a ExtremeSuperHyperDuality if it’s either of Extremee-SuperHyperDuality, Extremere- 1939

SuperHyperDuality, Extremev-SuperHyperDuality, and Extremerv-SuperHyperDuality 1940
and C(N SHG) for a ExtremeSuperHyperGraph N SHG : (V, E) is the maximum 1941
Extremecardinality of the ExtremeSuperHyperEdges of an ExtremeSuperHyperSet S of high 1942
Extremecardinality consecutive ExtremeSuperHyperEdges and ExtremeSuperHyperVertices 1943
such that they form the ExtremeSuperHyperDuality; 1944
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extremee- 1945

SuperHyperDuality, Extremere-SuperHyperDuality, Extremev-SuperHyperDuality, and 1946
Extremerv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 1947

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 1948
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 1949
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1950
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1951
SuperHyperDuality; and the Extreme power is corresponded to its Extreme coefficient; 1952
(iv) a ExtremeSuperHyperDuality SuperHyperPolynomial if it’s either of Extremee- 1953

Extremerv-SuperHyperDuality and C(N SHG) for an ExtremeSuperHyperGraph N SHG : 1955
(V, E) is the ExtremeSuperHyperPolynomial contains the Extremecoefficients defined as the 1956

Extremenumber of the maximum Extremecardinality of the ExtremeSuperHyperEdges of an 1957
ExtremeSuperHyperSet S of high Extremecardinality consecutive ExtremeSuperHyperEdges 1958
and ExtremeSuperHyperVertices such that they form the ExtremeSuperHyperDuality; and 1959
the Extremepower is corresponded to its Extremecoefficient; 1960
(v) an Extreme R-SuperHyperDuality if it’s either of Extremee-SuperHyperDuality, 1961

1962
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 1965
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 1966
(vi) a ExtremeR-SuperHyperDuality if it’s either of Extremee-SuperHyperDuality, 1967

1968
and C(N SHG) for an ExtremeSuperHyperGraph N SHG : (V, E) is the maximum Ex- 1969
tremecardinality of the ExtremeSuperHyperVertices of an ExtremeSuperHyperSet S of high 1970
such that they form the ExtremeSuperHyperDuality; 1972
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 1973

Extremee-SuperHyperDuality, Extremere-SuperHyperDuality, Extremev-SuperHyperDuality, 1974
and Extremerv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 1975
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1976
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 1977
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 1978
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1979
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 1980
coefficient; 1981

(viii) a ExtremeSuperHyperDuality SuperHyperPolynomial if it’s either of Extremee- 1982

Extremerv-SuperHyperDuality and C(N SHG) for an ExtremeSuperHyperGraph N SHG : 1984
Extremenumber of the maximum Extremecardinality of the ExtremeSuperHyperVertices 1986
of an ExtremeSuperHyperSet S of high Extremecardinality consecutive ExtremeSuperHy- 1987
perEdges and ExtremeSuperHyperVertices such that they form the ExtremeSuperHyper- 1988
Duality; and the Extremepower is corresponded to its Extremecoefficient. 1989
136EXM1 Example 18.0.3. Assume an ExtremeSuperHyperGraph (NSHG) S is an ordered pair S = (V, E) 1990
in the mentioned ExtremeFigures in every Extremeitems. 1991
• On the Figure (29.1), the ExtremeSuperHyperNotion, namely, ExtremeSuperHyperDuality, 1992

is up. The ExtremeAlgorithm is Neutrosophicly straightforward. E1 and E3 are some 1993
empty Extreme SuperHyperEdges but E2 is a loop ExtremeSuperHyperEdge and E4 1994
is an ExtremeSuperHyperEdge. Thus in the terms of ExtremeSuperHyperNeighbor, 1995
there’s only one ExtremeSuperHyperEdge, namely, E4 . The ExtremeSuperHyperVertex, 1996

V3 is Extremeisolated means that there’s no ExtremeSuperHyperEdge has it as an 1997
Extremeendpoint. Thus the ExtremeSuperHyperVertex, V3 , is excluded in every given 1998
ExtremeSuperHyperDuality. 1999
C(N SHG)ExtremeSuperHyperDuality = {E4 }.

C(N SHG)ExtremeSuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)ExtremeR-SuperHyperDuality = {V4 }.
C(N SHG)ExtremeR-SuperHyperDuality SuperHyperPolynomial = 3z.

is up. The ExtremeAlgorithm is Neutrosophicly straightforward. E1 , E2 and E3 are some 2001
empty ExtremeSuperHyperEdges but E4 is an ExtremeSuperHyperEdge. Thus in the terms 2002
of ExtremeSuperHyperNeighbor, there’s only one ExtremeSuperHyperEdge, namely, E4 . 2003
The ExtremeSuperHyperVertex, V3 is Extremeisolated means that there’s no ExtremeSupe- 2004
rHyperEdge has it as an Extremeendpoint. Thus the ExtremeSuperHyperVertex, V3 , is 2005
excluded in every given ExtremeSuperHyperDuality. 2006


is up. The ExtremeAlgorithm is Neutrosophicly straightforward. 2008



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

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


C(N SHG)ExtremeSuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)ExtremeR-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)ExtremeSuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)ExtremeSuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)ExtremeR-SuperHyperDuality = {V3i+17i=0 }.

C(N SHG)ExtremeSuperHyperDuality = {E15 , E16 , E17 }.

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


4 × 5 × 5z 3 .


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

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


4 × 5 × 5z 3 .


3 × 3z 2 .

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


3 × 3z 2 .







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


(1 × 1 × 2)z.


(2 × 2 × 2)z.


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

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






C(N SHG)ExtremeR-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
The previous Extremeapproach apply on the upcoming Extremeresults on ExtremeSuperHy- 2047

perClasses. 2048

Proposition 18.0.4. Assume a connected ExtremeSuperHyperPath ESHP : (V, E). Then 2049
C(N SHG)ExtremeSuperHyperDuality =
|EESHG:(V,E) |ExtremeCardinality
= {Ei }i=1 3
.
C(N SHG)ExtremeSuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)ExtremeR-SuperHyperDuality
= {ViEXT ERN AL }i=1 3

.
C(N SHG)ExtremeR-SuperHyperDuality SuperHyperPolynomial
Y |EESHG:(V,E) |ExtremeCardinality
= |V EXT ERN AL ESHG:(V,E) |ExtremeCardinality z 3 .
Proof. Let 2050
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |ExtremeCardinality , V EXT ERN AL |EESHG:(V,E) |ExtremeCardinality .
3 3
be a longest path taken from a connected ExtremeSuperHyperPath ESHP : (V, E). There’s a 2051

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 2054
136EXM18a Example 18.0.5. In the Figure (30.1), the connected ExtremeSuperHyperPath ESHP : (V, E), 2055
is highlighted and featured. The ExtremeSuperHyperSet, in the ExtremeSuperHyperModel 2056
(30.1), is the SuperHyperDuality. 2057

CHAPTER 19 2058
ExtremeSuperHyperJoin But As The 2059
Super Forms 2061
Definition 19.0.1. (Different ExtremeTypes of ExtremeSuperHyperJoin). 2062

is called 2065
(i) Extremee-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 2066

and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2067
(ii) Extremere-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ 2068

Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va ∈
6 Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 2069
|Ej |NEUTROSOPIC CARDINALITY ; 2070
(iii) Extremev-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2071

and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2072
(iv) Extremerv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2073

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 2074
|Vj |NEUTROSOPIC CARDINALITY ; 2075
(v) ExtremeSuperHyperJoin if it’s either of Extremee-SuperHyperJoin, Extremere- 2076

SuperHyperJoin, Extremev-SuperHyperJoin, and Extremerv-SuperHyperJoin. 2077
Definition 19.0.2. ((Neutrosophic) SuperHyperJoin). 2078

(i) an Extreme SuperHyperJoin if it’s either of Extremee-SuperHyperJoin, Extremere- 2081

SuperHyperJoin, Extremev-SuperHyperJoin, and Extremerv-SuperHyperJoin and 2082
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2083
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 2086
107
(ii) a ExtremeSuperHyperJoin if it’s either of Extremee-SuperHyperJoin, Extremere- 2087

C(N SHG) for a ExtremeSuperHyperGraph N SHG : (V, E) is the maximum Extremecar- 2089
dinality of the ExtremeSuperHyperEdges of an ExtremeSuperHyperSet S of high Ex- 2090
tremecardinality consecutive ExtremeSuperHyperEdges and ExtremeSuperHyperVertices 2091
such that they form the ExtremeSuperHyperJoin; 2092
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extremee- 2093

SuperHyperJoin, Extremere-SuperHyperJoin, Extremev-SuperHyperJoin, and Extremerv- 2094
SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 2095
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 2096
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 2097
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 2100
(iv) a ExtremeSuperHyperJoin SuperHyperPolynomial if it’s either of Extremee- 2101

SuperHyperJoin and C(N SHG) for an ExtremeSuperHyperGraph N SHG : (V, E) 2103

is the ExtremeSuperHyperPolynomial contains the Extremecoefficients defined as the 2104
and ExtremeSuperHyperVertices such that they form the ExtremeSuperHyperJoin; and 2107
(v) an Extreme R-SuperHyperJoin if it’s either of Extremee-SuperHyperJoin, Extremere- 2109


and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 2114
(vi) a ExtremeR-SuperHyperJoin if it’s either of Extremee-SuperHyperJoin, Extremere- 2115

C(N SHG) for an ExtremeSuperHyperGraph N SHG : (V, E) is the maximum Extremecar- 2117
dinality of the ExtremeSuperHyperVertices of an ExtremeSuperHyperSet S of high 2118
such that they form the ExtremeSuperHyperJoin; 2120
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extremee- 2121

the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 2124
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 2125
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 2128

(viii) a ExtremeSuperHyperJoin SuperHyperPolynomial if it’s either of Extremee- 2129

SuperHyperJoin and C(N SHG) for an ExtremeSuperHyperGraph N SHG : (V, E) is 2131
the ExtremeSuperHyperPolynomial contains the Extremecoefficients defined as the Ex- 2132
tremenumber of the maximum Extremecardinality of the ExtremeSuperHyperVertices of an 2133
and ExtremeSuperHyperVertices such that they form the ExtremeSuperHyperJoin; and 2135
the Extremepower is corresponded to its Extremecoefficient. 2136
• On the Figure (29.1), the ExtremeSuperHyperNotion, namely, ExtremeSuperHyperJoin, 2139


ExtremeSuperHyperJoin. 2146
C(N SHG)ExtremeSuperHyperJoin = {E4 }.

C(N SHG)ExtremeSuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)ExtremeR-SuperHyperJoin = {V4 }.
C(N SHG)ExtremeR-SuperHyperJoin SuperHyperPolynomial = 3z.

excluded in every given ExtremeSuperHyperJoin. 2153

• On the Figure (29.3), the ExtremeSuperHyperNotion, namely, ExtremeSuperHyperJoin, is 2154

up. The ExtremeAlgorithm is Neutrosophicly straightforward. 2155



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

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


C(N SHG)ExtremeSuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)ExtremeR-SuperHyperJoin SuperHyperPolynomial = z.

C(N SHG)ExtremeSuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)ExtremeSuperHyperJoin SuperHyperPolynomial 6z 8 .
C(N SHG)ExtremeR-SuperHyperJoin = {V3i+17i=0 }.

C(N SHG)ExtremeSuperHyperJoin = {E15 , E16 , E17 }.

C(N SHG)ExtremeSuperHyperJoin SuperHyperPolynomial = z 3 .
C(N SHG)ExtremeR-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)ExtremeR-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .


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

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


4 × 5 × 5z 3 .


3 × 3z 2 .

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


3 × 3z 2 .







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


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


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


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

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






C(N SHG)ExtremeR-SuperHyperJoin SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .
The previous Extreme approach apply on the upcoming Extreme results on ExtremeSuperHy- 2194
perClasses. 2195

C(N SHG)ExtremeSuperHyperJoin =
= {Ei }i=1 3
.
C(N SHG)ExtremeSuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)ExtremeR-SuperHyperJoin

.
C(N SHG)ExtremeR-SuperHyperJoin SuperHyperPolynomial
Proof. Let 2197
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. 2201
(30.1), is the SuperHyperJoin. 2204

CHAPTER 20 2205
ExtremeSuperHyperPerfect But As The 2206
Super Forms 2208
Definition 20.0.1. (Different ExtremeTypes of ExtremeSuperHyperPerfect). 2209


is called 2212
(i) Extremee-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 2213

Va ∈ Ei , Ej ; 2214
(ii) Extremere-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 2215
Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2216
(iii) Extremev-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 2217

Vi , Vj ∈ Ea ; 2218
(iv) Extremerv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 2219

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2220
(v) ExtremeSuperHyperPerfect if it’s either of Extremee-SuperHyperPerfect, Extremere- 2221
SuperHyperPerfect, Extremev-SuperHyperPerfect, and Extremerv-SuperHyperPerfect. 2222
Definition 20.0.2. ((Neutrosophic) SuperHyperPerfect). 2223

(i) an Extreme SuperHyperPerfect if it’s either of Extremee-SuperHyperPerfect, 2226

Extremere-SuperHyperPerfect, Extremev-SuperHyperPerfect, and Extremerv-SuperHyperPerfect
2227
Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 2231
115
(ii) a ExtremeSuperHyperPerfect if it’s either of Extremee-SuperHyperPerfect, Extremere- 2232

SuperHyperPerfect, Extremev-SuperHyperPerfect, and Extremerv-SuperHyperPerfect 2233
and C(N SHG) for a ExtremeSuperHyperGraph N SHG : (V, E) is the maximum 2234
Extremecardinality of the ExtremeSuperHyperEdges of an ExtremeSuperHyperSet S of high 2235
such that they form the ExtremeSuperHyperPerfect; 2237
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extremee- 2238

SuperHyperPerfect, Extremere-SuperHyperPerfect, Extremev-SuperHyperPerfect, and 2239
Extremerv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : 2240

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 2241
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 2242
SuperHyperPerfect; and the Extreme power is corresponded to its Extreme coefficient; 2245
(iv) a ExtremeSuperHyperPerfect SuperHyperPolynomial if it’s either of Extremee- 2246

Extremerv-SuperHyperPerfect and C(N SHG) for an ExtremeSuperHyperGraph N SHG : 2248

and ExtremeSuperHyperVertices such that they form the ExtremeSuperHyperPerfect; and 2252
(v) an Extreme R-SuperHyperPerfect if it’s either of Extremee-SuperHyperPerfect, 2254

2255
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 2259
(vi) a ExtremeR-SuperHyperPerfect if it’s either of Extremee-SuperHyperPerfect, 2260

2261
and C(N SHG) for an ExtremeSuperHyperGraph N SHG : (V, E) is the maximum Ex- 2262
tremecardinality of the ExtremeSuperHyperVertices of an ExtremeSuperHyperSet S of high 2263
such that they form the ExtremeSuperHyperPerfect; 2265
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of 2266

Extremee-SuperHyperPerfect, Extremere-SuperHyperPerfect, Extremev-SuperHyperPerfect, 2267
and Extremerv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 2268

the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 2273
coefficient; 2274

(viii) a ExtremeSuperHyperPerfect SuperHyperPolynomial if it’s either of Extremee- 2275

Extremerv-SuperHyperPerfect and C(N SHG) for an ExtremeSuperHyperGraph N SHG : 2277
Extremenumber of the maximum Extremecardinality of the ExtremeSuperHyperVertices 2279
of an ExtremeSuperHyperSet S of high Extremecardinality consecutive ExtremeSuperHy- 2280
perEdges and ExtremeSuperHyperVertices such that they form the ExtremeSuperHyper- 2281
Perfect; and the Extremepower is corresponded to its Extremecoefficient. 2282
• On the Figure (29.1), the ExtremeSuperHyperNotion, namely, ExtremeSuperHyperPerfect, 2285


ExtremeSuperHyperPerfect. 2292
C(N SHG)ExtremeSuperHyperPerfect = {E4 }.

C(N SHG)ExtremeSuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)ExtremeR-SuperHyperPerfect = {V4 }.
C(N SHG)ExtremeR-SuperHyperPerfect SuperHyperPolynomial = 3z.

excluded in every given ExtremeSuperHyperPerfect. 2299





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

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


C(N SHG)ExtremeSuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)ExtremeR-SuperHyperPerfect SuperHyperPolynomial = z.

C(N SHG)ExtremeSuperHyperPerfect = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)ExtremeSuperHyperPerfect SuperHyperPolynomial 6z 8 .
C(N SHG)ExtremeR-SuperHyperPerfect = {V3i+17i=0 }.

C(N SHG)ExtremeSuperHyperPerfect = {E15 , E16 , E17 }.

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


3 × 4 × 4z 3 .


C(N SHG)ExtremeQuasi-SuperHyperPerfect = {E3i+13i=0 , E23 }.

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


3 × 4 × 4z 3 .


3 × 2z 2 .

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


3 × 3z 2 .







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


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


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


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

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






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

perClasses. 2341

C(N SHG)ExtremeSuperHyperPerfect =
= {Ei }i=1 3
.
C(N SHG)ExtremeSuperHyperPerfect SuperHyperPolynomial
= 3z 3 .
C(N SHG)ExtremeR-SuperHyperPerfect

.
C(N SHG)ExtremeR-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 2343
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 2347
(30.1), is the SuperHyperPerfect. 2350

CHAPTER 21 2351
ExtremeSuperHyperTotal But As The 2352
Super Forms 2354
Definition 21.0.1. (Different ExtremeTypes of ExtremeSuperHyperTotal). 2355

is called 2358
(i) Extremee-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 2359
(ii) Extremere-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 2360

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2361
(iii) Extremev-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 2362
(iv) Extremerv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 2363

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2364
(v) ExtremeSuperHyperTotal if it’s either of Extremee-SuperHyperTotal, Extremere- 2365

SuperHyperTotal, Extremev-SuperHyperTotal, and Extremerv-SuperHyperTotal. 2366
Definition 21.0.2. ((Neutrosophic) SuperHyperTotal). 2367

(i) an Extreme SuperHyperTotal if it’s either of Extremee-SuperHyperTotal, Extremere- 2370

SuperHyperTotal, Extremev-SuperHyperTotal, and Extremerv-SuperHyperTotal and 2371
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2375
(ii) a ExtremeSuperHyperTotal if it’s either of Extremee-SuperHyperTotal, Extremere- 2376
123
C(N SHG) for a ExtremeSuperHyperGraph N SHG : (V, E) is the maximum Extremecar- 2378
dinality of the ExtremeSuperHyperEdges of an ExtremeSuperHyperSet S of high Ex- 2379
such that they form the ExtremeSuperHyperTotal; 2381
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extremee- 2382

SuperHyperTotal, Extremere-SuperHyperTotal, Extremev-SuperHyperTotal, and 2383
Extremerv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 2384

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 2385
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 2386
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 2387
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 2389
(iv) a ExtremeSuperHyperTotal SuperHyperPolynomial if it’s either of Extremee- 2390

Extremerv-SuperHyperTotal and C(N SHG) for an ExtremeSuperHyperGraph N SHG : 2392
and ExtremeSuperHyperVertices such that they form the ExtremeSuperHyperTotal; and 2396
(v) an Extreme R-SuperHyperTotal if it’s either of Extremee-SuperHyperTotal, Extremere- 2398


and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 2403
(vi) a ExtremeR-SuperHyperTotal if it’s either of Extremee-SuperHyperTotal, Extremere- 2404

C(N SHG) for an ExtremeSuperHyperGraph N SHG : (V, E) is the maximum Extremecar- 2406
dinality of the ExtremeSuperHyperVertices of an ExtremeSuperHyperSet S of high Ex- 2407

such that they form the ExtremeSuperHyperTotal; 2409
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2410

Extremee-SuperHyperTotal, Extremere-SuperHyperTotal, Extremev-SuperHyperTotal, 2411
and Extremerv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 2412
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 2417
coefficient; 2418
(viii) a ExtremeSuperHyperTotal SuperHyperPolynomial if it’s either of Extremee- 2419

Extremerv-SuperHyperTotal and C(N SHG) for an ExtremeSuperHyperGraph N SHG : 2421

(V, E) is the ExtremeSuperHyperPolynomial contains the Extremecoefficients defined 2422
as the Extremenumber of the maximum Extremecardinality of the ExtremeSuperHy- 2423
perVertices of an ExtremeSuperHyperSet S of high Extremecardinality consecutive 2424
ExtremeSuperHyperEdges and ExtremeSuperHyperVertices such that they form the 2425
ExtremeSuperHyperTotal; and the Extremepower is corresponded to its Extremecoefficient. 2426
• On the Figure (29.1), the ExtremeSuperHyperNotion, namely, ExtremeSuperHyperTotal, 2429


ExtremeSuperHyperTotal. 2436
C(N SHG)ExtremeQuasi-SuperHyperTotal = {E4 }.

C(N SHG)ExtremeQuasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)ExtremeR-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)ExtremeR-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.


excluded in every given ExtremeSuperHyperTotal. 2443





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

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


C(N SHG)ExtremeQuasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)ExtremeR-Quasi-SuperHyperTotal SuperHyperPolynomial = z.

C(N SHG)ExtremeSuperHyperTotal = {Ei+19i=0 }.

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

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

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

C(N SHG)ExtremeSuperHyperTotal SuperHyperPolynomial 10z 10 .

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


3 × 4 × 4z 3 .

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

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

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

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








4 × 3z 3 .


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


2 × 4 × 3z 4 .


C(N SHG)ExtremeSuperHyperTotal SuperHyperPolynomial = 11z 10 .
C(N SHG)ExtremeR-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)ExtremeR-Quasi-SuperHyperTotal SuperHyperPolynomial = 11z 10 .



C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
= |(|V | − 1)z 2 .

C(N SHG)ExtremeSuperHyperTotal = {E1 , E2 }.

C(N SHG)ExtremeSuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)ExtremeR-SuperHyperTotal = {V1 , V2 }.

C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .

perClasses. 2485
C(N SHG)ExtremeSuperHyperTotal =
|E | −2
= {Ei }i=1ESHG:(V,E) ExtremeCardinality .
C(N SHG)ExtremeSuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |ExtremeCardinality −2 .
C(N SHG)ExtremeR-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) ExtremeCardinality .
C(N SHG)ExtremeR-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |ExtremeCardinality z |EESHG:(V,E) |ExtremeCardinality −2

Proof. Let 2487
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|E |EESHG:(V,E) |ExtremeCardinality −1 ,V EXT ERN AL
|EESHG:(V,E) |ExtremeCardinality −1 .

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 2491
(30.1), is the SuperHyperTotal. 2494

CHAPTER 22 2495
ExtremeSuperHyperConnected But As 2496
Super Forms 2498
Definition 22.0.1. (Different ExtremeTypes of ExtremeSuperHyperConnected). 2499

is called 2502
(i) Extremee-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 2503
Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2504
(ii) Extremere-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 2505

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 2506
(iii) Extremev-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2508

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2509
(iv) Extremerv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2510

(v) ExtremeSuperHyperConnected if it’s either of Extremee-SuperHyperConnected, 2513

Extremere-SuperHyperConnected, Extremev-SuperHyperConnected, and Extremerv- 2514
SuperHyperConnected. 2515
Definition 22.0.2. ((Neutrosophic) SuperHyperConnected). 2516

(i) an Extreme SuperHyperConnected if it’s either of Extremee-SuperHyperConnected, 2519

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2521
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2522
131
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Ex- 2523
treme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 2524
SuperHyperConnected; 2525
(ii) a ExtremeSuperHyperConnected if it’s either of Extremee-SuperHyperConnected, 2526

SuperHyperConnected and C(N SHG) for a ExtremeSuperHyperGraph N SHG : (V, E) 2528
is the maximum Extremecardinality of the ExtremeSuperHyperEdges of an ExtremeSu- 2529

perHyperSet S of high Extremecardinality consecutive ExtremeSuperHyperEdges and 2530
ExtremeSuperHyperVertices such that they form the ExtremeSuperHyperConnected; 2531
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2532

of Extremee-SuperHyperConnected, Extremere-SuperHyperConnected, Extremev- 2533
SuperHyperConnected, and Extremerv-SuperHyperConnected and C(N SHG) for an 2534
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 2535

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 2536
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 2539
(iv) a ExtremeSuperHyperConnected SuperHyperPolynomial if it’s either 2541

ExtremeSuperHyperGraph N SHG : (V, E) is the ExtremeSuperHyperPolynomial contains 2544
the Extremecoefficients defined as the Extremenumber of the maximum Extremecardinality 2545
of the ExtremeSuperHyperEdges of an ExtremeSuperHyperSet S of high Extremecardinality 2546
consecutive ExtremeSuperHyperEdges and ExtremeSuperHyperVertices such that they 2547

form the ExtremeSuperHyperConnected; and the Extremepower is corresponded to its 2548
Extremecoefficient; 2549
(v) an Extreme R-SuperHyperConnected if it’s either of Extremee-SuperHyperConnected, 2550

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2552

cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 2554
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2555
Extreme SuperHyperConnected; 2556
(vi) a ExtremeR-SuperHyperConnected if it’s either of Extremee-SuperHyperConnected, 2557

SuperHyperConnected and C(N SHG) for an ExtremeSuperHyperGraph N SHG : (V, E) 2559

is the maximum Extremecardinality of the ExtremeSuperHyperVertices of an ExtremeSu- 2560
perHyperSet S of high Extremecardinality consecutive ExtremeSuperHyperEdges and 2561
ExtremeSuperHyperVertices such that they form the ExtremeSuperHyperConnected; 2562
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 2563


Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 2566

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 2567
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 2568
(viii) a ExtremeSuperHyperConnected SuperHyperPolynomial if it’s either 2572

ExtremeSuperHyperGraph N SHG : (V, E) is the ExtremeSuperHyperPolynomial contains 2575
the Extremecoefficients defined as the Extremenumber of the maximum Extremecardinality 2576
of the ExtremeSuperHyperVertices of an ExtremeSuperHyperSet S of high Extremecar- 2577

dinality consecutive ExtremeSuperHyperEdges and ExtremeSuperHyperVertices such that 2578
they form the ExtremeSuperHyperConnected; and the Extremepower is corresponded to 2579
its Extremecoefficient. 2580
• On the Figure (29.1), the ExtremeSuperHyperNotion, namely, ExtremeSuperHyperCon- 2583

nected, is up. The ExtremeAlgorithm is Neutrosophicly straightforward. E1 and E3 are 2584
some empty Extreme SuperHyperEdges but E2 is a loop ExtremeSuperHyperEdge and E4 2585
is an ExtremeSuperHyperEdge. Thus in the terms of ExtremeSuperHyperNeighbor, there’s 2586

only one ExtremeSuperHyperEdge, namely, E4 . The ExtremeSuperHyperVertex, V3 is Ex- 2587
tremeisolated means that there’s no ExtremeSuperHyperEdge has it as an Extremeendpoint. 2588
Thus the ExtremeSuperHyperVertex, V3 , is excluded in every given ExtremeSuperHyper- 2589
Connected. 2590
C(N SHG)ExtremeSuperHyperConnected = {E4 }.

C(N SHG)ExtremeSuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)ExtremeR-SuperHyperConnected = {V4 }.
C(N SHG)ExtremeR-SuperHyperConnected SuperHyperPolynomial = 3z.
• On the Figure (29.2), the ExtremeSuperHyperNotion, namely, ExtremeSuperHyperConnec- 2591

ted, is up. The ExtremeAlgorithm is Neutrosophicly straightforward. E1 , E2 and E3 are 2592
some empty ExtremeSuperHyperEdges but E4 is an ExtremeSuperHyperEdge. Thus in the 2593
terms of ExtremeSuperHyperNeighbor, there’s only one ExtremeSuperHyperEdge, namely, 2594
E4 . The ExtremeSuperHyperVertex, V3 is Extremeisolated means that there’s no Ex- 2595
tremeSuperHyperEdge has it as an Extremeendpoint. Thus the ExtremeSuperHyperVertex, 2596
V3 , is excluded in every given ExtremeSuperHyperConnected. 2597



ted, is up. The ExtremeAlgorithm is Neutrosophicly straightforward. 2599

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

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


C(N SHG)ExtremeSuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)ExtremeR-SuperHyperConnected SuperHyperPolynomial = z.

C(N SHG)ExtremeQuasi-SuperHyperConnected = {Ei+19i=0 }.

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

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

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

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

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


C(N SHG)ExtremeQuasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)ExtremeR-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)ExtremeR-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

nected, is up. The ExtremeAlgorithm is Neutrosophicly straightforward. 2613
C(N SHG)Extreme SuperHyperConnected = {E5 }.

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

C(N SHG)Extreme Quasi-SuperHyperConnected = {E1 , E6 , E7 , E8 }.

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

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , Vii68=4,5,6 }.
i=1
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = z 5 .

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

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



C(N SHG)Extreme R-SuperHyperConnected = {V1 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V2 , V3 , V4 }.


4 × 3z 3 .


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


2 × 4 × 3z 4 .



C(N SHG)ExtremeQuasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)ExtremeR-Quasi-SuperHyperConnected = {Vi+2i=011 }.


C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 10z.



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

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

perClasses. 2639

C(N SHG)ExtremeQuasi-SuperHyperConnected =
|EESHG:(V,E) |ExtremeCardinality −2
= {Ei }i=1 .
C(N SHG)ExtremeQuasi-SuperHyperConnected SuperHyperPolynomial
=z .
C(N SHG)ExtremeR-Quasi-SuperHyperConnected
= {ViEXT ERN AL }i=1 .
C(N SHG)ExtremeR-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |ExtremeCardinality z ESHG:(V,E) ExtremeCardinality
Proof. Let 2641
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |ExtremeCardinality −1 , V EXT ERN AL |EESHG:(V,E) |ExtremeCardinality −1 .

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 2645
(30.1), is the SuperHyperConnected. 2648

Bibliography 2649
HG1 [1] Henry Garrett, “Properties of SuperHyperGraph and Extreme SuperHyper- 2650
Graph”, Extreme Sets and Systems 49 (2022) 531-561 (doi: 10.5281/zen- 2651
odo.6456413). (http://fs.unm.edu/NSS/ExtremeSuperHyperGraph34.pdf). (ht- 2652
HG2 [2] Henry Garrett, “Extreme Co-degree and Extreme Degree alongside Chromatic Numbers in 2654
the Setting of Some Classes Related to Extreme Hypergraphs”, J Curr Trends Comp Sci Res 2655
1(1) (2022) 06-14. 2656
HG3 [3] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Extreme Super 2657
Hyper Graphs and Their Directions in Game Theory and Extreme Super Hyper Classes”, J 2658
Math Techniques Comput Math 1(3) (2022) 242-263. 2659
HG4 [4] Garrett, Henry. “0039 | Closing Numbers and SupeV-Closing Numbers as (Dual)Resolving 2660
and (Dual)Coloring alongside (Dual)Dominating in (Extreme)n-SuperHyperGraph.” 2661
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 2662

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

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

Positions Of Cells Toward Extreme Failed SuperHyperClique inside Extreme SuperHy- 2673
perGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 10.20944/pre- 2674
prints202301.0282.v1). 2675
HG8 [8] Henry Garrett, “Extreme Version Of Separates Groups Of Cells In Cancer’s Recogni- 2676
tion On Extreme SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 10.20944/pre- 2677
prints202301.0267.v1). 2678
139
Polynomials Alongside Numbers In The (Extreme) SuperHyperMatching Theory Based 2681
on SuperHyperGraph and Extreme SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 2682
10.20944/preprints202301.0265.v1). 2683
HG10 [10] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case 2684
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Ap- 2685
plied in (Extreme) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 2686
prints202301.0262.v1). 2687
HG11 [11] Henry Garrett, “Extreme Failed SuperHyperStable as the Survivors on the Cancer’s Extreme 2688
Recognition Based on Uncertainty to All Modes in Extreme SuperHyperGraphs”, Preprints 2689
2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 2690
Cancer’s Recognition Titled (Extreme) SuperHyperGraphs”, Preprints 2023, 2023010224, 2692

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

prints202301.0105.v1). 2696
HG14 [14] Henry Garrett, “Extreme Messy-Style SuperHyperGraphs To Form Extreme SuperHyper- 2697
Stable To Act on Cancer’s Extreme Recognitions In Special ViewPoints”, Preprints 2023, 2698
2023010088 (doi: 10.20944/preprints202301.0088.v1). 2699
HG15 [15] Henry Garrett, “Extreme 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 2700
Extreme SuperHyperGraphs on Cancer’s Extreme Recognition And Beyond”, Preprints 2023, 2701
2023010044 2702
HG16 [16] Henry Garrett, “(Extreme) SuperHyperStable on Cancer’s Recognition by Well- SuperHy- 2703
perModelled (Extreme) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 10.20944/pre- 2704
prints202301.0043.v1). 2705
HG17 [17] Henry Garrett, “Basic Notions on (Extreme) SuperHyperForcing And (Extreme) SuperHy- 2706
perModeling in Cancer’s Recognitions And (Extreme) SuperHyperGraphs”, Preprints 2023, 2707
2023010105 (doi: 10.20944/preprints202301.0105.v1). 2708
Stable To Act on Cancer’s Extreme Recognitions In Special ViewPoints”, Preprints 2023, 2710
2023010088 (doi: 10.20944/preprints202301.0088.v1). 2711
HG19 [19] Henry Garrett, “(Extreme) SuperHyperModeling of Cancer’s Recognitions Featuring 2712
(Extreme) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi: 2713
10.20944/preprints202212.0549.v1). 2714
HG20 [20] Henry Garrett, “(Extreme) SuperHyperAlliances With SuperHyperDefensive and Supe- 2715
rHyperOffensive Type-SuperHyperSet On (Extreme) SuperHyperGraph With (Extreme) 2716
SuperHyperModeling of Cancer’s Recognitions And Related (Extreme) SuperHyperClasses”, 2717

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

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

itor Cancer’s Recognition In Extreme SuperHyperGraphs”, ResearchGate 2023,(doi: 2729
10.13140/RG.2.2.35061.65767). 2730
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatch- 2732
ing Set and Polynomial on (Extreme) SuperHyperGraphs”, ResearchGate 2023, (doi: 2733
10.13140/RG.2.2.18494.15680). 2734
HG26 [26] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 2735
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named 2736
(Extreme) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922). 2737
of Cancer’s Attacks In The Terms of Extreme Failed SuperHyperClique on Can- 2739
cer’s Recognition called Extreme SuperHyperGraphs”, ResearchGate 2023, (doi: 2740

10.13140/RG.2.2.15897.70243). 2741
HG28 [28] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Extreme Recognition 2742
Forwarding Extreme SuperHyperClique on Extreme SuperHyperGraphs”, ResearchGate 2743
2023, (doi: 10.13140/RG.2.2.30092.80004). 2744
HG29 [29] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and 2745
Sub-Regions in the Terms of Cancer’s Recognition and (Extreme) SuperHyperGraphs With 2746
(Extreme) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849). 2747
HG30 [30] Henry Garrett,“Different Extreme Types of Extreme Regions titled Extreme Failed 2748
SuperHyperStable in Cancer’s Extreme Recognition modeled in the Form of Extreme 2749
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968). 2750
HG31 [31] Henry Garrett, “Using the Tool As (Extreme) Failed SuperHyperStable To SuperHyperModel 2751
Cancer’s Recognition Titled (Extreme) SuperHyperGraphs”, ResearchGate 2023, (doi: 2752

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

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

2022, (doi: 10.13140/RG.2.2.36141.77287). 2762
HG35 [35] Henry Garrett, “(Extreme) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 2763
(Extreme) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642). 2764
HG36 [36] Henry Garrett, “Basic Notions on (Extreme) SuperHyperForcing And (Extreme) SuperHy- 2765
perModeling in Cancer’s Recognitions And (Extreme) SuperHyperGraphs”, ResearchGate 2766
2022, (doi: 10.13140/RG.2.2.11369.16487). 2767
HG37 [37] Henry Garrett, “Basic Extreme Notions Concerning SuperHyperDominating and 2768
Extreme SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 2769
10.13140/RG.2.2.29173.86244). 2770
HG38 [38] Henry Garrett, “Initial Material of Extreme Preliminaries to Study Some Extreme Notions 2771
Based on Extreme SuperHyperEdge (NSHE) in Extreme SuperHyperGraph (NSHG)”, 2772
ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 2773
HG39 [39] Henry Garrett, (2022). “Beyond Extreme Graphs”, Ohio: E-publishing: Educational 2774
59973-725-6 (http://fs.unm.edu/BeyondExtremeGraphs.pdf). 2776
HG40 [40] Henry Garrett, (2022). “Extreme Duality”, Florida: GLOBAL KNOWLEDGE - Publishing 2777
House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0 2778
(http://fs.unm.edu/ExtremeDuality.pdf). 2779

CHAPTER 23 2780
Neutrosophic SuperHyperDominating 2781
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 2782
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 2783
2023, (doi: 10.13140/RG.2.2.34953.52320). 2784

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 2785
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 2786
(doi: 10.13140/RG.2.2.33275.80161). 2787
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 2789
10.13140/RG.2.2.11050.90569). 2790
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyper- 2791
Join In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 2792
10.13140/RG.2.2.17761.79206). 2793
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 2795
10.13140/RG.2.2.19911.37285). 2796
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 2797
10.13140/RG.2.2.23266.81602). 2799
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 2801
10.13140/RG.2.2.19360.87048). 2802
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 2803
10.13140/RG.2.2.32363.21286). 2805
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 2807
10.13140/RG.2.2.11758.69441). 2808
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 2809
10.13140/RG.2.2.31891.35367). 2811
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 2813
10.13140/RG.2.2.21510.45125). 2814
143
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 2815
10.13140/RG.2.2.13121.84321). 2817

CHAPTER 24 2818
New Ideas In Cancer’s Recognition And 2819
Neutrosophic SuperHyperGraph By 2820
SuperHyperDominating As Hyper Closing 2821
On Super Messy 2822
145
CHAPTER 25 2823
ABSTRACT 2824
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDominating). 2825


or E 0 is called Neutrosophic e-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 2828
that Va ∈ Ei , Ej ; Neutrosophic re-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2829
such that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2830
Neutrosophic v-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 2831
and Neutrosophic rv-SuperHyperDominating if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2832
Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutro- 2833

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

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

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

rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2853
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Ex- 2854
treme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an 2855
Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges 2856
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 2857
147
and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHy- 2858
perDominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperDominating, 2859
Neutrosophic re-SuperHyperDominating, Neutrosophic v-SuperHyperDominating, and Neut- 2860
rosophic rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph 2861
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coef- 2862
ficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 2863
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 2864

dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2865
that they form the Neutrosophic SuperHyperDominating; and the Neutrosophic power is cor- 2866
responded to its Neutrosophic coefficient; an Extreme V-SuperHyperDominating if it’s either 2867
of Neutrosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutro- 2868
sophic v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 2869
an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVer- 2871
tices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme Su- 2872
perHyperVertices such that they form the Extreme SuperHyperDominating; a Neutrosophic 2873
V-SuperHyperDominating if it’s either of Neutrosophic e-SuperHyperDominating, Neutro- 2874
rv-SuperHyperDominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 2876
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 2877
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2878
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 2879
perDominating; an Extreme V-SuperHyperDominating SuperHyperPolynomial if it’s either of 2880

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

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

of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 2894
SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating; and the 2895
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 2896
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperDominating and 2897
Neutrosophic SuperHyperDominating. Two different types of SuperHyperDefinitions are debut 2898
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 2899
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 2900
implemented in the whole of this research. For shining the elegancy and the significancy of this 2901
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 2902
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 2903

and the instances thus the clarifications are driven with different tools. The applications are 2904
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 2905
Recognition” are the under research to figure out the challenges make sense about ongoing and 2906
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 2907
different types of them. Some of them are individuals and some of them are well-modeled by 2908
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 2909
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 2910
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 2911
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 2912
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 2913
research. It’s also officially collected in the form of some questions and some problems. As- 2914
sume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDominating is 2915
a maximal of SuperHyperVertices with a maximum cardinality such that either of the fol- 2916
lowing expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 2917
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 2918
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 2919
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDominating is a maximal 2920
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 2921
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 2922
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 2923
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 2924
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 2925
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Super- 2926
HyperDominating . Since there’s more ways to get type-results to make a SuperHyperDominating 2927
more understandable. For the sake of having Neutrosophic SuperHyperDominating, there’s a 2928
need to “redefine” the notion of a “SuperHyperDominating ”. The SuperHyperVertices and the 2929
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperDominating 2931
. It’s redefined a Neutrosophic SuperHyperDominating if the mentioned Table holds, concerning, 2932
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 2933
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The 2934
Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 2935
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 2936
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 2937
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 2938
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperDominating 2939

. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind 2940
of SuperHyperClass. If there’s a need to have all SuperHyperDominating until the SuperHy- 2941
perDominating, then it’s officially called a “SuperHyperDominating” but otherwise, it isn’t a 2942
SuperHyperDominating . There are some instances about the clarifications for the main definition 2943
titled a “SuperHyperDominating ”. These two examples get more scrutiny and discernment 2944
since there are characterized in the disciplinary ways of the SuperHyperClass based on a Supe- 2945
rHyperDominating . For the sake of having a Neutrosophic SuperHyperDominating, there’s a 2946
need to “redefine” the notion of a “Neutrosophic SuperHyperDominating” and a “Neutrosophic 2947
SuperHyperDominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by 2948

of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 2950
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperDominating are 2951
redefined to a “Neutrosophic SuperHyperDominating” if the intended Table holds. It’s useful to 2952
define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 2953
type-results to make a Neutrosophic SuperHyperDominating more understandable. Assume a 2954
Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 2955
Table holds. Thus SuperHyperPath, SuperHyperDominating, SuperHyperStar, SuperHyperBi- 2956

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 2957
“Neutrosophic SuperHyperDominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic Super- 2958
HyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 2959
if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperDominating” 2960
where it’s the strongest [the maximum Neutrosophic value from all the SuperHyperDominating 2961
amid the maximum value amid all SuperHyperVertices from a SuperHyperDominating .] Super- 2962
HyperDominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number 2963
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperDominating if 2966
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 2967
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 2968
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 2982
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 2983
SuperHyperPath(-/SuperHyperDominating, SuperHyperStar, SuperHyperBipartite, SuperHyper- 2992
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperDominating 2993
or the strongest SuperHyperDominating in those Neutrosophic SuperHyperModels. For the 2994
longest SuperHyperDominating, called SuperHyperDominating, and the strongest SuperHyper- 2995

Dominating, called Neutrosophic SuperHyperDominating, some general results are introduced. 2996
A basic familiarity with Neutrosophic SuperHyperDominating theory, SuperHyperGraphs, and 3001
Neutrosophic SuperHyperGraphs theory are proposed. 3002

Keywords: Neutrosophic SuperHyperGraph, SuperHyperDominating, Cancer’s Neutrosophic 3003
Recognition 3004

CHAPTER 26 3006
Background 3007

Ref. [HG1] by Henry Garrett (2022). It’s first step toward the research on neutrosophic Super- 3011
HyperGraphs. This research article is published on the journal “Neutrosophic Sets and Systems” 3012
in issue 49 and the pages 531-561. In this research article, different types of notions like domin- 3013
ating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) 3014
neutrosophic path, zero forcing number, zero forcing neutrosophic- number, independent number, 3015
independent neutrosophic-number, clique number, clique neutrosophic-number, matching number, 3016

matching neutrosophic-number, girth, neutrosophic girth, 1-zero-forcing number, 1-zero- forcing 3017
neutrosophic-number, failed 1-zero-forcing number, failed 1-zero-forcing neutrosophic-number, 3018
global- offensive alliance, t-offensive alliance, t-defensive alliance, t-powerful alliance, and global- 3019
powerful alliance are defined in SuperHyperGraph and neutrosophic SuperHyperGraph. Some 3020
Classes of SuperHyperGraph and Neutrosophic SuperHyperGraph are cases of research. Some 3021
results are applied in family of SuperHyperGraph and neutrosophic SuperHyperGraph. Thus this 3022
research article has concentrated on the vast notions and introducing the majority of notions. 3023
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 3028
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 3029
Research (JCTCSR)” with abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 3030
with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 3031
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 3032
based on initial background. 3033
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory 3035
and Neutrosophic Super Hyper Classes” in Ref. [HG3] by Henry Garrett (2022). In this 3036
research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 3037
SuperHyperGraph based on fundamental SuperHyperNumber and using neutrosophic SuperHy- 3038
perClasses of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 3039
entitled “Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 3040
153
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 3041
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 3042
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 3043
and fundamental SuperHyperNumbers. 3044
In some articles are titled “0039 | Closing Numbers and SupeV-Closing Numbers as 3045
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 3046
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 3047

Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme Super- 3048
HyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 3049
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 3050
“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 3051
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 3052
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 3053
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 3054
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 3055
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 3056
Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 3057
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 3058
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 3059
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 3060
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 3062
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 3063
Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 3064
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 3065

Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 3066
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 3070
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 3071

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 3072
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 3073
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 3075
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 3076
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 3077
Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 3078
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 3079
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 3080
Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 3081
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 3082
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 3083
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutro- 3084
sophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on 3085

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 3087
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 3088
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 3089
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 3090
Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 3091
Garrett (2022), “SuperHyperMatching By (V-)Definitions And Polynomials To Monitor Cancer’s 3092
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 3093

“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 3094
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 3095
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 3096
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 3097
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 3098
Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 3099
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 3100
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 3101
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 3102
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 3103
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 3104
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 3105
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of 3106
Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 3107
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 3108
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 3109
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 3110

[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 3113
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 3114
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 3115
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 3116
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3117

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 3118
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 3119
eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 3120
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 3121


United States. This research book presents different types of notions SuperHyperResolving and 3137
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 3138
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 3142
the framework of Extreme SuperHyperDominating theory, Neutrosophic SuperHyperDominating 3143
HG40]. 3149

CHAPTER 27 3150
Applied Notions Under The Scrutiny Of 3151
The Motivation Of This Scientific Research 3152
In this scientific research, there are some ideas in the featured frameworks of motivations. I try to 3153
bring the motivations in the narrative ways. Some cells have been faced with some attacks from the 3154
situation which is caused by the cancer’s attacks. In this case, there are some embedded analysis 3155
on the ongoing situations which in that, the cells could be labelled as some groups and some groups 3156
or individuals have excessive labels which all are raised from the behaviors to overcome the cancer’s 3157
attacks. In the embedded situations, the individuals of cells and the groups of cells could be 3158
considered as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting 3159
more proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 3160
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 3161
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 3162
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 3163
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 3164
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 3165
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 3166
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 3167
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 3168
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 3169
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 3170
figure out what’s going on this phenomenon. The special case of this disease is considered and 3171
as the consequences of the model, some parameters are used. The cells are under attack of this 3172
disease but the moves of the cancer in the special region are the matter of mind. The recognition 3173
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 3174
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 3175
both bases are the background of this research. Sometimes the cancer has been happened on the 3176
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 3177
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 3178
forms of alliances’ styles with the formation of the design and the architecture are formally called “ 3179
SuperHyperDominating” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers 3180
to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 3181
The recognition of the cancer in the long-term function. The specific region has been assigned 3182
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 3183
157
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 3184
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 3185
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 3186
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 3187
are some specific models, which are well-known and they’ve got the names, and some general 3188
models. The moves and the traces of the cancer on the complex tracks and between complicated 3189
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperDominating, 3190

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is 3191
to find either the optimal SuperHyperDominating or the Neutrosophic SuperHyperDominating 3192
in those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 3193
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 3194
Question 27.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 3198
amount of SuperHyperDominating” of either individual of cells or the groups of cells based on the 3199
fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDominating” based 3200
on the fixed groups of cells or the fixed groups of group of cells? 3201
Question 27.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 3202
messy and dense SuperHyperModels where embedded notions are illustrated? 3203
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 3204
Thus it motivates us to define different types of “ SuperHyperDominating” and “Neutrosophic 3205
SuperHyperDominating” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 3206
the research has taken more motivations to define SuperHyperClasses and to find some connections 3207
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances 3208
and examples to make clarifications about the framework of this research. The general results 3209
and some results about some connections are some avenues to make key point of this research, 3210
“Cancer’s Recognition”, more understandable and more clear. 3211
The framework of this research is as follows. In the beginning, I introduce basic definitions 3212
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 3213
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 3214
discussed. The elementary concepts are clarified and illustrated completely and sometimes 3215
review literature are applied to make sense about what’s going to figure out about the 3216
upcoming sections. The main definitions and their clarifications alongside some results about 3217
new notions, SuperHyperDominating and Neutrosophic SuperHyperDominating, are figured 3218
out in sections “ SuperHyperDominating” and “Neutrosophic SuperHyperDominating”. In 3219
the sense of tackling on getting results and in order to make sense about continuing the 3220
research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced 3221
and as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 3222
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 3223
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 3224
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 3225
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 3226
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 3227
and as concluding and closing section of theoretical research are contained in the section 3228

“General Results”. Some general SuperHyperRelations are fundamental and they are well- 3229
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 3230
Results”, “ SuperHyperDominating”, “Neutrosophic SuperHyperDominating”, “Results on 3231
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 3232
questions about what’s done about the SuperHyperNotions to make sense about excellency of this 3233
research and going to figure out the word “best” as the description and adjective for this research 3234
as presented in section, “ SuperHyperDominating”. The keyword of this research debut in the 3235
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 3236
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 3237
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 3238
there are some scrutiny and discernment on what’s done and what’s happened in this research in 3239
the terms of “questions” and “problems” to make sense to figure out this research in featured 3240
style. The advantages and the limitations of this research alongside about what’s done in this 3241
research to make sense and to get sense about what’s figured out are included in the section, 3242
“Conclusion and Closing Remarks”. 3243

CHAPTER 28 3244
Neutrosophic Preliminaries Of This 3245
Scientific Research On the Redeemed 3246
Ways 3247
In this section, the basic material in this scientific research, is referred to [Single Valued 3248
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 3249

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 3250
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [t- 3251
norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyper- 3252
Graph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 3253
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 3254
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 3255
their clarifications are addressed to Ref.[HG38]. 3256
In this subsection, the basic material which is used in this scientific research, is presented. Also, 3257
the new ideas and their clarifications are elicited. 3258
Definition 28.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 [. 3259
Definition 28.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}.
161

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 28.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 3260

S = (V, E), where 3262
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 3267
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 3268
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 3269
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 3270
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 . 3271



items. 3286
SuperEdge; 3292
If we choose different types of binary operations, then we could get hugely diverse types of 3295
general forms of Neutrosophic SuperHyperGraph (NSHG). 3296
Definition 28.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 3297

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 3298
x, y, z, w ∈ [0, 1]: 3299
(i) 1 ⊗ x = x; 3300
(ii) x ⊗ y = y ⊗ x; 3301
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 3302
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 3303

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 28.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 3304

S = (V, E), where 3306

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 3311
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 3312
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 3313
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 3314
0

items. 3329
SuperEdge; 3335
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 3338
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 3339
makes the patterns and regularities. 3340
Definition 28.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 3341
of elements of SuperHyperEdges are the same. 3342

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 3343
makes to have SuperHyperUniform more understandable. 3344
Definition 28.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 3345
Classes as follows. 3346
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 3347
two given SuperHyperEdges with two exceptions; 3348
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 3349
SuperHyperEdges; 3350
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 3351
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 3352
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 3353
in common; 3354
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 3355
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 3356
SuperHyperEdge in common; 3357
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 3358
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 3359
SuperVertex. 3360
Definition 28.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 3361

(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 3362
(i) Vi , Vi+1 ∈ Ei0 ; 3363
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 3364
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 3365
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 3366
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 3367
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 3368
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 3369
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 3370
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 28.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. 3372
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 3373
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 3374
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 3375
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHyper- 3376
Path . 3377
Definition 28.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 3378
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 3379
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 3380
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 3381
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 3382
Definition 28.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 3383

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 3396
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 3397
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 3398
Definition 28.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperDominating). 3399


(i) Neutrosophic e-SuperHyperDominating if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 3403

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

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

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

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

3411
Neutrosophic rv-SuperHyperDominating. 3413
Definition 28.0.19. ((Neutrosophic) SuperHyperDominating). 3414

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

3417
Neutrosophic rv-SuperHyperDominating and C(N SHG) for an Extreme SuperHyperGraph 3419
form the Extreme SuperHyperDominating; 3423
(ii) a Neutrosophic SuperHyperDominating if it’s either of Neutrosophic e- 3424


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

rosophic e-SuperHyperDominating, Neutrosophic re-SuperHyperDominating, Neutrosophic 3432
v-SuperHyperDominating, and Neutrosophic rv-SuperHyperDominating and C(N SHG) 3433
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 3434

tices such that they form the Extreme SuperHyperDominating; and the Extreme power is 3438
(iv) a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 3440

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 3445

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

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

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

(vii) an Extreme V-SuperHyperDominating SuperHyperPolynomial if it’s either of 3464

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 3467
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 3468
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 3469
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 3470
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating; 3471
and the Extreme power is corresponded to its Extreme coefficient; 3472
(viii) a Neutrosophic SuperHyperDominating SuperHyperPolynomial if it’s either of 3473


number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 3478

Definition 28.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDominating). 3483

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

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

(28.1), holds if S is an δ−SuperHyperDefensive; 3489
(ii) a Neutrosophic δ−SuperHyperDominating is a Neutrosophic kind of Neutrosophic 3490

SuperHyperDominating such that either of the following Neutrosophic expressions hold for 3491
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 3492
|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 (28.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 3493

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

are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 3497
of the position of labels to assign to the values. 3498
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (28.1) holds. 3500
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 3501
to get Neutrosophic type-results to make a Neutrosophic more understandable. 3502
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (28.2) 3504
holds. Thus Neutrosophic SuperHyperPath , SuperHyperDominating, SuperHyperStar, 3505
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 3506
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 3507
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 3508
Neutrosophic SuperHyperWheel if the Table (28.2) holds. 3509


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

136TBL4

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

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

there’s the usage of the position of labels to assign to the values. 3516
136DEF1 Definition 28.0.23. Assume a SuperHyperDominating. It’s redefined a Neutrosophic Super- 3517
HyperDominating if the Table (28.3) holds. 3518

CHAPTER 29 3519
Neutrosophic SuperHyperDominating But 3520
As The Extensions Excerpt From Dense 3521
And Super Forms 3522
136EXM1 Example 29.0.1. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 3523
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 3524
• On the Figure (29.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 3525
HyperDominating, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 3526
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 3527
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 3528
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 3529
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 3530
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 3531
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperDominating. 3532

3533
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 3536
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 3537
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 3538
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as a 3539
Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every 3540
171
Figure 29.1: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperDominating in the Neutrosophic Example (41.0.3) 136NSHG1
given Neutrosophic SuperHyperDominating. 3541

3542
• On the Figure (29.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic SuperHy- 3543
perDominating, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 3544

3545







5 × 3z 2 .
3548

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

= {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 .
3554
C(N SHG)Neutrosophic SuperHyperDominating = {E15 , E16 , E17 }.

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







= 4 × 5 × 5z 3 .
3560

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



= 4 × 5 × 5z 3 .
3566

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






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

= 5 × 5z 5 .
3572

= 3 × 3z 2 .
3575



3578

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



4 × 3z 3 .
3584







4 × 3z 4 .
3587

2 × 4 × 3z 4 .
3590
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 .
3593

3596



3599

= 5 × 1z 2 .
3602




Neutrosophic SuperHyperDominating in the Neutrosophic Example (41.0.3) 95NHG1


Neutrosophic SuperHyperDominating in the Neutrosophic Example (41.0.3) 95NHG2

CHAPTER 30 3603
The Neutrosophic Departures on The 3604
Theoretical Results Toward Theoretical 3605
Motivations 3606
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 3607
SuperHyperClasses. 3608
Proposition 30.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 3609
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
= {V EXT ERN AL 3i+1 }i=0 3
.
|EESHG:(V,E) |
Y Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality 3z c 3 .
Proof. Let 3610
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 3611
191
Figure 30.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperDominating in the Example (41.0.5) 136NSHG18a
a new way to redefine as 3612

136EXM18a Example 30.0.2. In the Figure (30.1), the connected Neutrosophic SuperHyperPath ESHP : 3615
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 3616
SuperHyperModel (30.1), is the SuperHyperDominating. 3617
Proposition 30.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 3618
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 3619
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 3620

136EXM19a Example 30.0.4. In the Figure (30.2), the connected Neutrosophic SuperHyperCycle N SHC : 3624
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 3625
Neutrosophic SuperHyperModel (30.2), is the Neutrosophic SuperHyperDominating. 3626
Proposition 30.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 3627
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 3628
P : ViEXT ERN AL , Ei , CEN T ER, Ej .
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 3629


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

Neutrosophic SuperHyperDominating in the Neutrosophic Example (30.0.4) 136NSHG19a
136EXM20a Example 30.0.6. In the Figure (30.3), the connected Neutrosophic SuperHyperStar ESHS : 3633
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 3634
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 3635
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (30.3), is 3636
the Neutrosophic SuperHyperDominating. 3637
Proposition 30.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 3638
Then 3639

= {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

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

Neutrosophic SuperHyperDominating in the Neutrosophic Example (30.0.6) 136NSHG20a
= {VaEXT ERN AL ∈ VPEXT

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

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Proof. Let 3640
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 3641
There’s a new way to redefine as 3642

ViEXT ERN AL in the literatures of SuperHyperDominating. The latter is straightforward. Then 3644

there’s no at least one SuperHyperDominating. Thus the notion of quasi may be up but 3645
the SuperHyperNotions based on SuperHyperDominating could be applied. There are only 3646
two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3647
representative in the 3648
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperDominating taken from a connected Neutrosophic SuperHyperBipartite 3649
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 3650
SuperHyperPart SuperHyperEdges are attained in any solution 3651
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 3652
136EXM21a Example 30.0.8. In the Neutrosophic Figure (30.4), the connected Neutrosophic SuperHyperBi- 3653
partite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The obtained 3654
Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic result, 3655
of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperBipartite 3656
ESHB : (V, E), in the Neutrosophic SuperHyperModel (30.4), is the Neutrosophic SuperHyper- 3657
Dominating. 3658
Proposition 30.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 3659
Then 3660

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

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Proof. Let 3661
P :

Figure 30.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

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

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

ViEXT ERN AL in the literatures of SuperHyperDominating. The latter is straightforward. Then 3665
there’s no at least one SuperHyperDominating. Thus the notion of quasi may be up but 3666
the SuperHyperNotions based on SuperHyperDominating could be applied. There are only 3667
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3668
representative in the 3669
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : 3670
(V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 3671

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

SuperHyperDominating in the Example (30.0.10) 136NSHG22a
SuperHyperEdges are attained in any solution 3672
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 3673
The latter is straightforward. 3674
136EXM22a Example 30.0.10. In the Figure (30.5), the connected Neutrosophic SuperHyperMultipartite 3675
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 3676
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 3677
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 3678
the Neutrosophic SuperHyperModel (30.5), is the Neutrosophic SuperHyperDominating. 3679
Proposition 30.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 3680
Then, 3681
∗
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 3682
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

Figure 30.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

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

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

representatives. The latter is straightforward. 3690
136EXM23a Example 30.0.12. In the Neutrosophic Figure (30.6), the connected Neutrosophic SuperHyper- 3691
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 3692
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVertices of 3693
the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic SuperHy- 3694
perModel (30.6), is the Neutrosophic SuperHyperDominating. 3695

CHAPTER 31 3696
The Surveys of Mathematical Sets On The 3697
Results But As The Initial Motivation 3698
For the SuperHyperDominating, Neutrosophic SuperHyperDominating, and the Neutrosophic 3699

SuperHyperDominating, some general results are introduced. 3700
Remark 31.0.1. Let remind that the Neutrosophic SuperHyperDominating is “redefined” on the 3701
positions of the alphabets. 3702
Corollary 31.0.2. Assume Neutrosophic SuperHyperDominating. Then 3703
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 3704
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 3705
the neutrality, for i = 1, 2, 3, respectively. 3706
Corollary 31.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 3707
alphabet. Then the notion of Neutrosophic SuperHyperDominating and SuperHyperDominating 3708
coincide. 3709
Corollary 31.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 3710
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 3711
SuperHyperDominating if and only if it’s a SuperHyperDominating. 3712
Corollary 31.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter 3713
of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 3714
SuperHyperDominating if and only if it’s a longest SuperHyperDominating. 3715
Corollary 31.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 3716
same identical letter of the alphabet. Then its Neutrosophic SuperHyperDominating is its 3717
SuperHyperDominating and reversely. 3718
201
Corollary 31.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperDominating, SuperHy- 3719

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 3720
letter of the alphabet. Then its Neutrosophic SuperHyperDominating is its SuperHyperDominating 3721
and reversely. 3722
Corollary 31.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHyper- 3723
Dominating isn’t well-defined if and only if its SuperHyperDominating isn’t well-defined. 3724
Corollary 31.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 3725

Neutrosophic SuperHyperDominating isn’t well-defined if and only if its SuperHyperDominating 3726
isn’t well-defined. 3727

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 3729
SuperHyperDominating isn’t well-defined if and only if its SuperHyperDominating isn’t well- 3730
defined. 3731
Corollary 31.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 3732
perDominating is well-defined if and only if its SuperHyperDominating is well-defined. 3733
Corollary 31.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 3734

Neutrosophic SuperHyperDominating is well-defined if and only if its SuperHyperDominating is 3735
well-defined. 3736

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 3738
SuperHyperDominating is well-defined if and only if its SuperHyperDominating is well-defined. 3739
Proposition 31.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 3740
(i) : the dual SuperHyperDefensive SuperHyperDominating; 3741
(ii) : the strong dual SuperHyperDefensive SuperHyperDominating; 3742
(iii) : the connected dual SuperHyperDefensive SuperHyperDominating; 3743
(iv) : the δ-dual SuperHyperDefensive SuperHyperDominating; 3744
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDominating; 3745
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDominating. 3746
Proposition 31.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 3747
(iii) : the connected defensive SuperHyperDefensive SuperHyperDominating; 3750

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

independent SuperHyperSet is 3755
(iii) : the connected SuperHyperDefensive SuperHyperDominating; 3758
Proposition 31.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 3762

Graph which is a SuperHyperDominating/SuperHyperPath. Then V is a maximal 3763
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDominating; 3767
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDominating; 3768
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDominating; 3769
Proposition 31.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 3771

SuperHyperUniform SuperHyperWheel. Then V is a maximal 3772
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 3776
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 3777
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDominating; 3778

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

(ii) : the SuperHyperDominating; 3783
(iii) : the connected SuperHyperDominating; 3784
(iv) : the O(ESHG)-SuperHyperDominating; 3785
(v) : the strong O(ESHG)-SuperHyperDominating; 3786
(vi) : the connected O(ESHG)-SuperHyperDominating. 3787
coincide. 3789

Graph which is a SuperHyperWheel. Then the number of 3791
(i) : the dual SuperHyperDominating; 3792
(ii) : the dual SuperHyperDominating; 3793
(iii) : the dual connected SuperHyperDominating; 3794
(iv) : the dual O(ESHG)-SuperHyperDominating; 3795
(v) : the strong dual O(ESHG)-SuperHyperDominating; 3796
(vi) : the connected dual O(ESHG)-SuperHyperDominating. 3797
coincide. 3799
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 3801

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

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number 3813
of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 3814
is a 3815

(iv) : δ-SuperHyperDefensive SuperHyperDominating; 3819
(v) : strong δ-SuperHyperDefensive SuperHyperDominating; 3820
(vi) : connected δ-SuperHyperDefensive SuperHyperDominating. 3821

SuperHyperMultipartite. Then Then the number of 3824
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying 3831
r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the 3832
exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 3833
Proposition 31.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 3834
connected component is |V − S| if there’s a SuperHyperSet which is a dual 3835
(iv) : SuperHyperDominating; 3839
Proposition 31.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the number 3842
is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 3843
Proposition 31.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 3844
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 3845

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



Proposition 31.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 3853
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 3854
of dual 3855
(iv) : 0-SuperHyperDefensive SuperHyperDominating; 3859

SuperHyperComplete. Then there’s no independent SuperHyperSet. 3863

SuperHyperDominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 3865
and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 3866
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 3870
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating; 3871
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating. 3872

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



Proposition 31.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 3883
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 3884
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 3885
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 3886
Proposition 31.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 3887

dual SuperHyperDefensive SuperHyperDominating, then ∀v ∈ V \ S, ∃x ∈ S such that 3888
(i) v ∈ Ns (x); 3889
(ii) vx ∈ E. 3890
Proposition 31.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 3891

dual SuperHyperDefensive SuperHyperDominating, then 3892
(i) S is SuperHyperDominating set; 3893
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 3894
Proposition 31.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 3895
(i) Γ ≤ O; 3896
(ii) Γs ≤ On . 3897
Proposition 31.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 3898
connected. Then 3899
(i) Γ ≤ O − 1; 3900
(ii) Γs ≤ On − Σ3i=1 σi (x). 3901
Proposition 31.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 3902

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

Proposition 31.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 3909
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperDominating; 3910
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 3911
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3912
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3913
Proposition 31.0.38. Let ESHG : (V, E) be an even SuperHyperDominating. Then 3915
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperDomin- 3916

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

inating; 3924
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3926
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3927
Proposition 31.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 3929
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDominating; 3930
(ii) Γ = 1; 3931
(iii) Γs = Σ3i=1 σi (c); 3932
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDominating. 3933
Proposition 31.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 3934
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 3935
SuperHyperDefensive SuperHyperDominating; 3936
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 3937
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 3938
i=1

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

2
; 3944
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperDominat- 3945
ing. 3946
Proposition 31.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 3947
bn
2c
(ii) Γ = b n2 c; 3949

2
; 3950
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHyper- 3951
Dominating. 3952
Proposition 31.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 3953

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

ating for N SHF; 3956
(ii) Γ = m for N SHF : (V, E); 3957
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3958
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperDominating 3959
for N SHF : (V, E). 3960
Proposition 31.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperComplete 3961

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

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

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

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

bnc for N SHF : (V, E); 3974
S={vi }i=1
bnc
2
are only dual maximal SuperHyperDominating for 3975
N SHF : (V, E). 3976
following statements hold; 3978
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3979
SuperHyperDominating, then S is an s-SuperHyperDefensive SuperHyperDominating; 3980

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

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

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

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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


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

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


CHAPTER 32 4049
Neutrosophic Applications in Cancer’s 4050
Neutrosophic Recognition 4051
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 4052
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 4053
disease is considered and as the consequences of the model, some parameters are used. The 4054
cells are under attack of this disease but the moves of the cancer in the special region are the 4055
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 4056
treatments for this Neutrosophic disease. 4057
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 4058
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 4059
Neutrosophic function. 4060
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 4061
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 4062
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 4063
easily identified since there are some determinacy, indeterminacy and neutrality about the 4064
moves and the effects of the cancer on that region; this event leads us to choose another 4065
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 4066
what’s happened and what’s done. 4067
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 4068
known and they’ve got the names, and some general Neutrosophic models. The moves and 4069
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 4070
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperDominating, 4071
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 4072
aim is to find either the Neutrosophic SuperHyperDominating or the Neutrosophic 4073

SuperHyperDominating in those Neutrosophic Neutrosophic SuperHyperModels. 4074
213
CHAPTER 33 4075
Case 1: The Initial Neutrosophic Steps 4076
Toward Neutrosophic 4077
SuperHyperBipartite as Neutrosophic 4078
SuperHyperModel 4079
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (33.1), the Neutrosophic Super- 4080
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 4081
Figure 33.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

215
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (33.1) and the Table (33.1), the Neutrosophic SuperHy- 4082
perBipartite is obtained. 4083
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 4084
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 4085
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (33.1), is the 4086
Neutrosophic SuperHyperDominating. 4087

CHAPTER 34 4088
Case 2: The Increasing Neutrosophic 4089
Steps Toward Neutrosophic 4090
SuperHyperMultipartite as 4091
Neutrosophic SuperHyperModel 4092
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 4093
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 4094
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 4095
perMultipartite is obtained. 4096
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 4097
Figure 34.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

217
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 4099
Neutrosophic SuperHyperDominating. 4100

CHAPTER 35 4101
Wondering Open Problems But As The 4102
Directions To Forming The Motivations 4103
In what follows, some “problems” and some “questions” are proposed. 4104
The SuperHyperDominating and the Neutrosophic SuperHyperDominating are defined on a 4105
real-world application, titled “Cancer’s Recognitions”. 4106
Question 35.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 4107
recognitions? 4108
Question 35.0.2. Are there some SuperHyperNotions related to SuperHyperDominating and the 4109
Neutrosophic SuperHyperDominating? 4110
Question 35.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 4111
them? 4112
Question 35.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDominating 4113
and the Neutrosophic SuperHyperDominating? 4114
Problem 35.0.5. The SuperHyperDominating and the Neutrosophic SuperHyperDominating do a 4115

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperDominating, are 4116
there else? 4117
Problem 35.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 4118
Numbers types-results? 4119
Problem 35.0.7. What’s the independent research based on Cancer’s recognitions concerning the 4120
multiple types of SuperHyperNotions? 4121
219
CHAPTER 36 4122
Conclusion and Closing Remarks 4123
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 4124
research are illustrated. Some benefits and some advantages of this research are highlighted. 4125
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 4126
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperDominating. For 4127
that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 4128
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 4129
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperDominating, finds the 4130
convenient background to implement some results based on that. Some SuperHyperClasses and 4131
some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 4132
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned on 4133
the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, Super- 4134
HyperDominating, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some 4135
general results are gathered in the section on the SuperHyperDominating and the Neutrosophic 4136
SuperHyperDominating. The clarifications, instances and literature reviews have taken the 4137
whole way through. In this research, the literature reviews have fulfilled the lines containing the 4138
notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 4139
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 4140
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 4141
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 4142
based on the connectivities of the moves of the cancer in the longest and strongest styles with 4143
the formation of the design and the architecture are formally called “ SuperHyperDominating” 4144
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 4145
embedded styles to figure out the background for the SuperHyperNotions. In the Table (36.1), 4146
benefits and avenues for this research are, figured out, pointed out and spoken out. 4147
221
Table 36.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

CHAPTER 37 4148
Neutrosophic SuperHyperDuality But As 4149
Super Forms 4151
Definition 37.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 4152
(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 4156

Va ∈ Ei , Ej ; 4157
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 4158

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 4159
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 4160

Vi , Vj ∈ Ea ; 4161
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 4162

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 4163
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 4164

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutrosophic 4165
rv-SuperHyperDuality. 4166
Definition 37.0.2. ((Neutrosophic) SuperHyperDuality). 4167
(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 4170

rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4172
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 4174
Extreme SuperHyperDuality; 4176
223
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 4177

rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 4179
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 4180
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 4181
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 4182
form the Neutrosophic SuperHyperDuality; 4183
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 4184
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 4185

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Extreme 4186
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 4187
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality of 4188
the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 4189
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 4190
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 4191
Extreme coefficient; 4192
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 4193

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 4195
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 4196
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 4197
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 4198
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 4199
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDuality; 4200
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 4201
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 4202

rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4204
Extreme SuperHyperDuality; 4208
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 4209

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, 4210
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 4211
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 4212
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 4213
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 4214
that they form the Neutrosophic SuperHyperDuality; 4215
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 4216

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Extreme 4218

Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 4220
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 4221
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 4222
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 4223
to its Extreme coefficient; 4224
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 4225

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 4227
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Super- 4230
HyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 4231

and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 4232
Duality; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 4233
• On the Figure (29.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 4236

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 4237
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 4238
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 4239
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 4240

E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 4241
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperDuality. 4243
C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 3z.

given Neutrosophic SuperHyperDuality. 4251





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

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


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

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

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


4 × 5 × 5z 3 .

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

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


4 × 5 × 5z 3 .


3 × 3z 2 .


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



3 × 3z 2 .






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


(1 × 1 × 2)z.



(2 × 2 × 2)z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.

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





C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 4292
Neutrosophic SuperHyperClasses. 4293

C(N SHG)Neutrosophic SuperHyperDuality =

|EESHG:(V,E) |Neutrosophic Cardinality
= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality

.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 4295
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Neutrosophic Cardinality , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality .
3 3

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 4299
SuperHyperModel (30.1), is the SuperHyperDuality. 4302

CHAPTER 38 4303
Neutrosophic SuperHyperJoin But As The 4304
Super Forms 4306
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 4307
(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 4311

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 4312
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 4313

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

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

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 4321

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv- 4322
SuperHyperJoin. 4323
Definition 38.0.2. ((Neutrosophic) SuperHyperJoin). 4324

(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, Neut- 4327

rosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv- 4328
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme car- 4330
dinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 4331
231
SuperHyperJoin; 4333
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 4334
Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 4335

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 4336
form the Neutrosophic SuperHyperJoin; 4340
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 4341

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 4342
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 4343
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 4346
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 4348
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 4349

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 4350
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 4351
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 4352

Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 4353
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 4355
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; and the 4356
Neutrosophic power is corresponded to its Neutrosophic coefficient; 4357
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 4358

SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the 4360
maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 4361

of the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 4362
SuperHyperJoin; 4364
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 4365

SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 4367
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 4368

form the Neutrosophic SuperHyperJoin; 4371
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 4372
e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 4373

and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 4374
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 4377
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 4379
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 4380

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 4381
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 4382
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 4385
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 4386

sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; and the 4387
Neutrosophic power is corresponded to its Neutrosophic coefficient. 4388

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 4392
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperJoin. 4398
C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 3z.


given Neutrosophic SuperHyperJoin. 4406





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

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


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.

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

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

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


4 × 5 × 5z 3 .

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

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


4 × 5 × 5z 3 .


3 × 3z 2 .


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



3 × 3z 2 .






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


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



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

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

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





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

C(N SHG)Neutrosophic SuperHyperJoin =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin

.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial
Proof. Let 4450
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. 4454
SuperHyperModel (30.1), is the SuperHyperJoin. 4457

CHAPTER 39 4458
Neutrosophic SuperHyperPerfect But As 4459
Super Forms 4461
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 4462
(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 4466

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

(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 4470

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 4474

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 4475
rv-SuperHyperPerfect. 4476
Definition 39.0.2. ((Neutrosophic) SuperHyperPerfect). 4477
(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 4480

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4482
Extreme SuperHyperPerfect; 4486
239
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 4487

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 4489
form the Neutrosophic SuperHyperPerfect; 4493
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 4494
rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 4495

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Extreme 4496
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardin- 4499
ality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 4500
they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 4501
Extreme coefficient; 4502
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 4503

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 4505
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 4508
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 4509
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperPerfect; 4510
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 4511
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 4512

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4514
Extreme SuperHyperPerfect; 4518
(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect,4519

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 4521
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 4522
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 4523
Neutrosophic SuperHyperPerfect; 4525
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 4526

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Extreme 4528

that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to 4533
its Extreme coefficient; 4534
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 4535

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 4537
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Super- 4540
HyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 4541

and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 4542
Perfect; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 4543

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 4547

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperPerfect. 4553
C(N SHG)Neutrosophic SuperHyperPerfect = {E4 }.

C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = 3z.

given Neutrosophic SuperHyperPerfect. 4561





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

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


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperPerfect = {E3i+13i=0 , E3i+243i=0 }.

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

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


3 × 4 × 4z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperPerfect = {E3i+13i=0 , E23 }.

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


3 × 4 × 4z 3 .


3 × 2z 2 .


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



3 × 3z 2 .






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


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



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

C(N SHG)Neutrosophic SuperHyperPerfect = {E3i+1i=03 }.

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





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

C(N SHG)Neutrosophic SuperHyperPerfect =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect

.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 4605
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 4609
SuperHyperModel (30.1), is the SuperHyperPerfect. 4612

CHAPTER 40 4613
Neutrosophic SuperHyperTotal But As 4614
Super Forms 4616
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 4617
(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 4621

Va ∈ Ei , Ej ; 4622
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 4623

(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 4625

Vi , Vj ∈ Ea ; 4626
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 4627

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 4629

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 4630
rv-SuperHyperTotal. 4631
Definition 40.0.2. ((Neutrosophic) SuperHyperTotal). 4632
(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 4635

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4637
Extreme SuperHyperTotal; 4641
247
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 4642

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 4644
form the Neutrosophic SuperHyperTotal; 4648
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 4649
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 4650

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 4651
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 4654
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 4656
coefficient; 4657
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 4658
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 4659

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutrosophic 4660
SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; and the 4665
Neutrosophic power is corresponded to its Neutrosophic coefficient; 4666
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 4667

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4669
Extreme SuperHyperTotal; 4673
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 4674

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 4676

(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 4677
form the Neutrosophic SuperHyperTotal; 4680
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 4681

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 4682
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 4683

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 4688
its Extreme coefficient; 4689
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 4690
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 4691

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutrosophic 4692

SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; and the 4697
Neutrosophic power is corresponded to its Neutrosophic coefficient. 4698

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 4702

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperTotal. 4708
C(N SHG)Neutrosophic Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.

given Neutrosophic SuperHyperTotal. 4716




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

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


C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperTotal = {Ei+19i=0 }.

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




3 × 4 × 4z 3 .


C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.


3 × 4 × 4z 3 .

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



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









4 × 3z 3 .


4 × 3z 4 .


2 × 4 × 3z 4 .



C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = 11z 10 .


C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
= |(|V | − 1)z 2 .

C(N SHG)Neutrosophic SuperHyperTotal = {E1 , E2 }.

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {V1 , V2 }.


C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .

C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2
Proof. Let 4760
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|E |EESHG:(V,E) |Neutrosophic Cardinality −1 ,V EXT ERN AL
|EESHG:(V,E) |Neutrosophic Cardinality −1 .

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 4764
SuperHyperModel (30.1), is the SuperHyperTotal. 4767

CHAPTER 41 4768
Neutrosophic SuperHyperConnected But 4769
As The Extensions Excerpt From Dense 4770
And Super Forms 4771
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 4772

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 4776
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 4777
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 4778

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 4779
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 4780
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 4781

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 4782
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 4783

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

4786
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 4787
rosophic rv-SuperHyperConnected. 4788
Definition 41.0.2. ((Neutrosophic) SuperHyperConnected). 4789

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

rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 4794
255
form the Extreme SuperHyperConnected; 4798
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 4799

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 4800
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 4801
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardin- 4802
ality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 4803
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 4804

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 4805
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 4806
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 4807

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 4808
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 4809
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 4815

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutro- 4816
sophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 4817
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPoly- 4818
nomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 4819
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 4820
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 4821

perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 4822
SuperHyperConnected; and the Neutrosophic power is corresponded to its Neutrosophic 4823
coefficient; 4824
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,4825

rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 4827
high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 4829
form the Extreme SuperHyperConnected; 4831
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 4832

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 4833
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 4834
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 4835
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 4836
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 4837
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 4838

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 4839

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 4840
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 4841
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 4842
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 4844

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 4848

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutro- 4849
sophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 4850
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyper- 4851
Polynomial contains the Neutrosophic coefficients defined as the Neutrosophic number 4852
of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 4853
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 4854

Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 4856
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 4861
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 4863
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 4864

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 4865
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 4867
C(N SHG)Neutrosophic SuperHyperConnected = {E4 }.

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperConnected = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = 3z.

given Neutrosophic SuperHyperConnected. 4875

perConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 4877

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

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

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

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


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

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

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

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

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , Vii68=4,5,6 }.
i=1


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



4 × 3z 3 .

4 × 3z 4 .


2 × 4 × 3z 4 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+2i=011 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 10z.

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

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

C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

−2
= {Ei }i=1 .
C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic −2
=z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected
|EESHG:(V,E) |Neutrosophic −2
= {ViEXT ERN AL }i=1 Cardinality
.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 4919
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4923
SuperHyperModel (30.1), is the SuperHyperConnected. 4926

Bibliography 4927
HG1 [1] Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyper- 4928
Graph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 10.5281/zen- 4929
odo.6456413). (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). (ht- 4930
HG2 [2] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 4932
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 4933
Trends Comp Sci Res 1(1) (2022) 06-14. 4934
HG3 [3] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic 4935
Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 4936
Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. 4937
HG4 [4] Garrett, Henry. “0039 | Closing Numbers and SupeV-Closing Numbers as (Dual)Resolving 4938
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 4939
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 4940

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

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

Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic Supe- 4951
rHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 10.20944/pre- 4952
prints202301.0282.v1). 4953
HG8 [8] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 4954
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 4955
10.20944/preprints202301.0267.v1). 4956
263
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 4959
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 4960
(doi: 10.20944/preprints202301.0265.v1). 4961
HG10 [10] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 4962
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 4963
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 4964
prints202301.0262.v1). 4965
HG11 [11] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 4966
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyper- 4967
Graphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 4968
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224, 4970

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

prints202301.0105.v1). 4974
Preprints 2023, 2023010044 4980
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 4982
10.20944/preprints202301.0043.v1). 4983
HG19 [19] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4990
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 4991
(doi: 10.20944/preprints202212.0549.v1). 4992
HG20 [20] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 4993
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 4994
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4996

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 5007
10.13140/RG.2.2.35061.65767). 5008
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 5010
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 5011
10.13140/RG.2.2.18494.15680). 5012
HG26 [26] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 5013
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 5014
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 5015

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

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 5019
10.13140/RG.2.2.15897.70243). 5020
HG28 [28] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 5021
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 5022
HG29 [29] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 5024
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 5025
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 5026
10.13140/RG.2.2.23172.19849). 5027
HG30 [30] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic 5028
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of 5029
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968). 5030
HG31 [31] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyper- 5031
Model Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, 5032
(doi: 10.13140/RG.2.2.28945.92007). 5033

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

HG35 [35] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 5043
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 5044
10.13140/RG.2.2.29430.88642). 5045
HG37 [37] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 5049
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 5050
10.13140/RG.2.2.29173.86244). 5051
HG38 [38] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 5052
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph 5053

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

CHAPTER 42 5061
Books’ Contributions 5062
“Books’ Contributions”: | Featured Threads 5063

| Book #109 5064
| Title: SuperHyperPath 5065

#Latest_Updates 5066
#The_Links 5067
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG Twitter 5068
LinkedIn Amazon googlebooks GooglePlay 5069
– 5070
5071
5073
#The_Links 5074
5075
| Book #109 5076
5077
|Title: SuperHyperPath 5078
5079
| Available at WordPress ResearchGate Scribd academia ZENODO_ORG Twitter LinkedIn 5080
Amazon googlebooks GooglePlay 5081
5082
– 5083
5084
| Publisher | 5085
(Paperback): https://www.amazon.com/dp/- 5086
(Hardcover): https://www.amazon.com/dp/- 5087
(Kindle Edition): https://www.amazon.com/dp/- 5088
5089
– 5090
5091
| ISBN | 5092
(Paperback): - 5093
(Hardcover): - 5094
(Kindle Edition): CC BY-NC-ND 4.0 5095
267
(EBook): CC BY-NC-ND 4.0 5096

5097
– 5098
5099
| Print length | 5100
(Paperback): - pages 5101
(Hardcover): - pages 5102

(Kindle Edition): - pages 5103
(E-Book): 348 pages 5104
5105
– 5106
5107
5109
#The_Links 5110
5111
| ResearchGate: https://www.researchgate.net/publication/- 5112
5113
| WordPress: https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/ 5114
5115
@Scribd: https://www.scribd.com/document/- 5116
5117
| academia: https://www.academia.edu/- 5118
5119
| ZENODO_ORG: https://zenodo.org/record/- 5120
5121
| googlebooks: https://books.google.com/books/about?id=- 5122
5123
| GooglePlay: https://play.google.com/store/books/details?id=- 5124
5125
5126

Figure 42.1: “#108th Book” || SuperHyperPath February 2023 License: CC BY-NC-ND 4.0
Print length: 348 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs
SuperHyperPath (Published Version) 5127
5128
The Link: 5129
5130
https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/ 5131
5132
– 5133
5134
Posted by Dr. Henry Garrett 5135
5136
February 18, 2023 5137
5138
Posted in 0109 | SuperHyperPath 5139
5140
Tags: 5141
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 5142
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 5143
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 5144
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 5145
neutrosophic SuperHyperGraphs, Neutrosophic SuperHyperPath, Open Problems, Open Ques- 5146

tions, Problems, Pure Math, Pure Mathematics, Questions, Real-World Applications, Recent 5147
Research, Recognitions, Research, scientific research Article, scientific research Articles, scientific 5148
research Book, scientific research Chapter, scientific research Chapters, Review, SuperHyper- 5149
Classes, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, SuperHyperGraphs, 5150
SuperHyperPath, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 5151
Vertices. 5152


In this scientific research book, there are some scientific research chapters on “Extreme 5153
SuperHyperPath” and “Neutrosophic SuperHyperPath” about some researches on Extreme 5154
SuperHyperPath and neutrosophic SuperHyperPath. 5155

CHAPTER 43 5156
“SuperHyperGraph-Based Books”: | 5157
Featured Tweets 5158
“SuperHyperGraph-Based Books”: | Featured Tweets 5159
273
Figure 43.1: “SuperHyperGraph-Based Books”: | Featured Tweets

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

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
























CHAPTER 44 5160
CV 5161
301
5162
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)
5163
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).
5164
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
5165
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).
5166
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).
5167
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
5168
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
5169
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
5170
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).
5171
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

5172
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).
5173
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

5174
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).
5175
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).
5176
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).
5177
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).
5178
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
5179
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

5180
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

5181
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
5182
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
5183
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

5184
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
-
5185
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

5186
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

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

5188
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
5189
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
5190
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

5191
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
5192
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
...
5193
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/

5194
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 Path

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 Path

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 viii

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 45

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 89

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 97

18 ExtremeSuperHyperDuality But As The Extensions Excerpt From Dense

19 ExtremeSuperHyperJoin But As The Extensions Excerpt From Dense

20 ExtremeSuperHyperPerfect But As The Extensions Excerpt From Dense

21 ExtremeSuperHyperTotal But As The Extensions Excerpt From Dense

22 ExtremeSuperHyperConnected But As The Extensions Excerpt From

23 Neutrosophic SuperHyperDominating 143

24 New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

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

28 Neutrosophic Preliminaries Of This Scientific Research On the Redeemed

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic SuperHyperDominating But As The Extensions Excerpt

30 The Neutrosophic Departures on The Theoretical Results Toward Theor-

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

32 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 213

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

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

35 Wondering Open Problems But As The Directions To Forming The

36 Conclusion and Closing Remarks 221

37 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

38 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

39 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

40 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

41 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

42 Books’ Contributions 267

43 “SuperHyperGraph-Based Books”: | Featured Tweets 273

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.13The 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-

29.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

29.9 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

30.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

33.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

43.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 274

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

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

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

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

36.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 222