United Dominating in SuperHyperGraphs

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

DOI: 10.5281/zenodo.8027488
CITATIONS
1 author:
Henry Garrett
486 PUBLICATIONS 18,701 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Number Graphs And Numbers View project
Neutrosophic Graphs View project
All content following this page was uploaded by Henry Garrett on 12 June 2023.
The user has requested enhancement of the downloaded file.

United Dominating In
SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures vi
List of Tables xi
1 ABSTRACT 1
2 Background 11
Bibliography 17
3 Acknowledgements 41
4 Cancer In Extreme SuperHyperGraph 43
5 Extreme United Dominating 47
6 New Ideas On Super Units By Hyper Ultra Of United Dominating In

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

Scientific Research 57
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61
10 Extreme SuperHyperUnited Dominating But As The Extensions Excerpt

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

Motivations 115
iii
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
12 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 125
13 Extreme Applications in Cancer’s Extreme Recognition 137
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 217
Bibliography 223
24 ABSTRACT 247
25 Cancer In Neutrosophic SuperHyperGraph 249
26 Neutrosophic United Dominating 253
27 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By United Dominating As Hyper Ultra On Super Units 255
28 ABSTRACT 257
29 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 263

30 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 267
31 Neutrosophic SuperHyperUnited Dominating But As The Extensions Ex-

cerpt From Dense And Super Forms 279
32 The Neutrosophic Departures on The Theoretical Results Toward

Theoretical Motivations 321
33 The Surveys of Mathematical Sets On The Results But As The Initial

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

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

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

Motivations 349
38 Conclusion and Closing Remarks 351
39 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

40 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

41 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

42 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

43 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 409
44 Background 423
Bibliography 429
45 Books’ Contributions 453
46 “SuperHyperGraph-Based Books”: | Featured Tweets 465
47 CV 493

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

SuperHyperUnited Dominating in the Extreme Example (43.0.3) . . . . . . . . . . . . 79
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperUnited

Dominating in the Example (43.0.5) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperUnited Dominating in the Extreme Example (43.0.7) . . . . . . . . . . . . . 118
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperUnited Dominating in the Extreme Example (43.0.9) . . . . . . . . . . . . . 119
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperUnited Dominating in the Example (43.0.11) . . . . . . . . . . . . 121
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperUnited Dominating in the Example (43.0.13) . . . . . . . . . . . . . . . . . 123
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperUnited Dominating in the Extreme Example (43.0.15) . . . . . . . 124
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

perUnited Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperUnited Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
31.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example (43.0.3) . . 285


31.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
32.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperUnited Dominating in the Example (43.0.5) . . . . . . . . . . . . . . . . . . 322
32.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
32.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
32.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperUnited Dominating in the Example (43.0.11) . . . 327
32.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperUnited Dominating in the Example (43.0.13) . . . . . . . . . . . . . . . . . 329
32.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example
(43.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330

35.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

36.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.8027275). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 454
(doi: 10.5281/zenodo.8027275). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
(doi: 10.5281/zenodo.8027275). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
45.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023,
(doi: 10.5281/zenodo.8025707). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456
(doi: 10.5281/zenodo.8025707). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457
(doi: 10.5281/zenodo.8025707). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457
45.7 [HG176b] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.8027488). . . . . . . . . . . . . . . . . . . . . . 461
46.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 466

46.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 467
46.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 468
46.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 474



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

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (30.0.23) 70
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (30.0.22) 70

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

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

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

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

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

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

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

SuperHyperGraphs . Since there’s more ways to get type-results to make a United Dominating 41
In SuperHyperGraphs more understandable. For the sake of having Neutrosophic United Dom- 42
inating In SuperHyperGraphs, there’s a need to “redefine” the notion of a “United Dominating 43
In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by 44
the labels from the letters of the alphabets. In this procedure, there’s the usage of the position 45
of labels to assign to the values. Assume a United Dominating In SuperHyperGraphs . It’s 46

redefined a Neutrosophic United Dominating In SuperHyperGraphs if the mentioned Table holds, 47
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 48
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 49
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 50
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 51
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 52
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 53
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 54
a United Dominating In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the 55
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 56
United Dominating In SuperHyperGraphs until the United Dominating In SuperHyperGraphs, 57
then it’s officially called a “United Dominating In SuperHyperGraphs” but otherwise, it isn’t a 58
United Dominating In SuperHyperGraphs . There are some instances about the clarifications for 59
the main definition titled a “United Dominating In SuperHyperGraphs ”. These two examples 60
get more scrutiny and discernment since there are characterized in the disciplinary ways of 61
the SuperHyperClass based on a United Dominating In SuperHyperGraphs . For the sake of 62
having a Neutrosophic United Dominating In SuperHyperGraphs, there’s a need to “redefine” 63
the notion of a “Neutrosophic United Dominating In SuperHyperGraphs” and a “Neutrosophic 64

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

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

“Neutrosophic SuperHyperPath”, “Neutrosophic United Dominating In SuperHyperGraphs”, 76
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Supe- 77
rHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 78
SuperHyperGraph has a “Neutrosophic United Dominating In SuperHyperGraphs” where 79

it’s the strongest [the maximum Neutrosophic value from all the United Dominating In 80
SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a United 81
Dominating In SuperHyperGraphs .] United Dominating In SuperHyperGraphs . A graph is a 82
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 83
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 84
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 85
SuperHyperEdges with two exceptions; it’s United Dominating In SuperHyperGraphs if it’s 86

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

Dominating In SuperHyperGraphs, called United Dominating In SuperHyperGraphs, and the 116
strongest United Dominating In SuperHyperGraphs, called Neutrosophic United Dominating 117
In SuperHyperGraphs, some general results are introduced. Beyond that in SuperHyperStar, 118
all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s 119
essential to have at least three SuperHyperEdges to form any style of a United Dominating In 120
SuperHyperGraphs. There isn’t any formation of any United Dominating In SuperHyperGraphs 121
but literarily, it’s the deformation of any United Dominating In SuperHyperGraphs. It, 122
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 123
Neutrosophic SuperHyperGraph theory are proposed. 124
Keywords: SuperHyperGraph, (Neutrosophic) United Dominating In SuperHyperGraphs, 125

Cancer’s Recognition 126

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

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

HyperGraphs if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, 168
Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 169
with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, 170
“The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Values of 171

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

SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 197
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 198
Table holds. A SuperHyperGraph has “Neutrosophic United Dominating In SuperHyperGraphs” 199
where it’s the strongest [the maximum Neutrosophic value from all United Dominating In 200
SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a United 201
Dominating In SuperHyperGraphs .] United Dominating In SuperHyperGraphs . A graph is 202

SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges 203
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 204
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 205
SuperHyperEdges with two exceptions; it’s United Dominating In SuperHyperGraphs if it’s 206
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 207
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 208
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 210
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 212
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 213
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 214
the specific designs and the specific architectures. The SuperHyperModel is officially called 215
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 216
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 217

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

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

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




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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; 466
HG267; HG268; HG269; HG270; HG271; HG272; HG273] alongside scientific re- 485
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 486


HG171b; HG172b; HG173b; HG174b; HG175b; HG176b]. Two popular scientific re- 499
search books in Scribd in the terms of high readers, 4331 and 5327 respectively, on neutrosophic 500
science is on [HG32b; HG44b]. 501

Bibliography 502
HG11s [1] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 503
Graph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32- 504
55. (https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of- 505
cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf) 506
HG22s [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 507
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 508
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 509
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 510
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 511
alongside-a.pdf) 512
HG33s [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 513
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 514
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 515
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 516

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

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

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

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

(doi: 10.20944/preprints202212.0549.v1). 582
HG20 [22] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 583
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 584
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 585
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 586
HG21 [23] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 587
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 588
(doi: 10.20944/preprints202212.0500.v1). 589
HG22 [24] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 590
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 591
HG23 [25] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 593
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 594
HG273 [26] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 596
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 597
10.5281/zenodo.8025707). 598
HG272 [27] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 599
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 600
10.5281/zenodo.8027275). 601
HG271 [28] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 602
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 603
odo.8017246). 604
HG270 [29] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 605
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 606
10.5281/zenodo.8020128). 607

By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 609
odo.7978571). 610
HG268 [31] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 611
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 612
10.5281/zenodo.7978857). 613
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 615
10.5281/zenodo.7940830). 616
HG266 [33] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 617
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 618
10.5281/zenodo.7943578). 619
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 621
odo.7916595). 622
HG264 [35] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 623
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 624
odo.7923632). 625
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 627
(doi: 10.5281/zenodo.7904698). 628
HG262 [37] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 629
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 630
2023, (doi: 10.5281/zenodo.7904671). 631
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 633
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 634
HG260 [39] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 635
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 636
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 637
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 639
10.5281/zenodo.7871026). 640
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 642
2023, (doi: 10.5281/zenodo.7874647). 643
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 645
10.5281/zenodo.7857856). 646

HG256 [43] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 647
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 648
2023, (doi: 10.5281/zenodo.7857841). 649
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 651
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 654
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 657
10.5281/zenodo.7853867). 658
HG252 [47] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 659
10.5281/zenodo.7853922). 661
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 663
(doi: 10.5281/zenodo.7851519). 664
HG250 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 665
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 666
(doi: 10.5281/zenodo.7851550). 667
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 669
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 672
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 675
10.5281/zenodo.7834229). 676
HG246 [53] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 677
10.5281/zenodo.7834261). 679
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 681
10.5281/zenodo.7824560). 682
HG244 [55] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 683
(doi: 10.5281/zenodo.7824623). 685

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 687
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 690
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 693
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 695
2023, (doi: 10.5281/zenodo.7809365). 696
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 698
2023, (doi: 10.5281/zenodo.7809358). 699
HG238 [61] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 700
10.5281/zenodo.7809219). 702
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 704
10.5281/zenodo.7809328). 705
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 707
2023, (doi: 10.5281/zenodo.7806767). 708
HG235 [64] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 709
2023, (doi: 10.5281/zenodo.7806838). 711
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 713
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 714
HG233 [66] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 715
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 716
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 717
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 719
10.5281/zenodo.7799902). 720
HG231 [68] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 721
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 722
(doi: 10.5281/zenodo.7804218). 723

By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 725
(doi: 10.5281/zenodo.7796334). 726
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 728
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 731
10.5281/zenodo.7791952). 732
HG225 [72] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 733
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 734
10.5281/zenodo.7791982). 735
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 737
10.5281/zenodo.7790026). 738
HG223 [74] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 739
10.5281/zenodo.7790052). 741
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 743
2023, (doi: 10.5281/zenodo.7787066). 744
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 746
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 747
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 749
10.5281/zenodo.7781476). 750
HG219 [78] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 751
10.5281/zenodo.7783082). 753
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 755
10.5281/zenodo.7777857). 756
HG217 [80] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 757
10.5281/zenodo.7779286). 759
HG215 [81] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 760
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 761
(doi: 10.5281/zenodo.7771831). 762

HG214 [82] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 763
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 764
2023, (doi: 10.5281/zenodo.7772468). 765
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 767
10.13140/RG.2.2.20913.25446). 768
HG212 [84] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 769
odo.7764916). 771
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 773
10.13140/RG.2.2.11770.98247). 774
HG210 [86] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 775
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 776
10.13140/RG.2.2.12400.12808). 777
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 779
2023, (doi: 10.13140/RG.2.2.22545.10089). 780
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 782
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 783
HG207 [89] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 784
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 785
10.13140/RG.2.2.11377.76644). 786
HG206 [90] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 787
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 788
10.13140/RG.2.2.23750.96329). 789
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 791
10.13140/RG.2.2.31366.24641). 792
HG204 [92] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 793
10.13140/RG.2.2.34721.68960). 795
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 797
2023, (doi: 10.13140/RG.2.2.30212.81289). 798
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 800

Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 803
10.13140/RG.2.2.24288.35842). 804
HG200 [96] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 805
10.13140/RG.2.2.32467.25124). 807
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 809
10.13140/RG.2.2.31025.45925). 810
HG198 [98] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 811
10.13140/RG.2.2.17184.25602). 813
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 815
10.13140/RG.2.2.23423.28327). 816
HG196 [100] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 817
10.13140/RG.2.2.28456.44805). 819
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 821
10.13140/RG.2.2.23525.68320). 822
HG194 [102] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 823
10.13140/RG.2.2.20170.24000). 825
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 827
10.13140/RG.2.2.36475.59683). 828
HG192 [104] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 829
10.13140/RG.2.2.29764.71046). 831
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 833
2023, (doi: 10.13140/RG.2.2.18780.87683). 834
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 836
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 839
10.13140/RG.2.2.26134.01603). 840

HG188 [108] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 841
10.13140/RG.2.2.27392.30721). 843
HG187 [109] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 844
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 845
10.13140/RG.2.2.33028.40321). 846
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 848
10.13140/RG.2.2.21389.20966). 849
HG185 [111] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 850
10.13140/RG.2.2.16356.04489). 852
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 854
10.13140/RG.2.2.21756.21129). 855
HG183 [113] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 856
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 857
10.13140/RG.2.2.30983.68009). 858
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 860
10.13140/RG.2.2.28552.29445). 861
HG181 [115] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 862
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 863
(doi: 10.13140/RG.2.2.10936.21761). 864
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 866
10.13140/RG.2.2.35105.89447). 867
HG179 [117] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 868
(doi: 10.13140/RG.2.2.30072.72960). 870
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 872
10.13140/RG.2.2.31147.52003). 873
HG177 [119] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 874
10.13140/RG.2.2.32825.24163). 876
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 878
10.13140/RG.2.2.13059.58401). 879

HG175 [121] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 880
10.13140/RG.2.2.11172.14720). 882
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 884
2023, (doi: 10.13140/RG.2.2.22011.80165). 885
HG173 [123] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 886
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 887
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 888
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 890
2023, (doi: 10.13140/RG.2.2.10493.84962). 891
HG171 [125] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 892
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 894
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 896
2023, (doi: 10.13140/RG.2.2.19944.14086). 897
HG169 [127] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 898
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 900
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 902
(doi: 10.13140/RG.2.2.33103.76968). 903
HG167 [129] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 904
(doi: 10.13140/RG.2.2.23037.44003). 906
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 908
(doi: 10.13140/RG.2.2.35646.56641). 909
HG165 [131] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 910
10.13140/RG.2.2.18030.48967). 912
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 914
(doi: 10.13140/RG.2.2.13973.81121). 915
HG163 [133] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 916
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 917
2023, (doi: 10.13140/RG.2.2.34106.47047). 918

HG162 [134] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 919
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 920
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 923
2023, (doi: 10.13140/RG.2.2.31956.88961). 924
HG160 [136] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 925
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 926
2023, (doi: 10.13140/RG.2.2.15179.67361). 927
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 929
10.13140/RG.2.2.21510.45125). 930
HG158 [138] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 931
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 932
2023, (doi: 10.13140/RG.2.2.13121.84321). 933
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 935
10.13140/RG.2.2.11758.69441). 936
HG156 [140] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 937
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 938
2023, (doi: 10.13140/RG.2.2.31891.35367). 939
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 941
10.13140/RG.2.2.19360.87048). 942
HG154 [142] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 943
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 944
10.13140/RG.2.2.32363.21286). 945
HG153 [143] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 946
10.13140/RG.2.2.23266.81602). 948
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 950
10.13140/RG.2.2.19911.37285). 951
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 953
10.13140/RG.2.2.11050.90569). 954
HG150 [146] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 955
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 956
2023, (doi: 10.13140/RG.2.2.17761.79206). 957

HG149 [147] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 958
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 959
HG148 [148] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 961
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 962
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 963
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 965
(doi: 10.13140/RG.2.2.30182.50241). 966
HG146 [150] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 967
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 968
HG145 [151] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 970
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 971
HG144 [152] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 973
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 974
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 975
HG143 [153] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 976
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 977
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 978
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 981
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 984
HG140 [156] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 985
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 986
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 987
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 990
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 993
HG137 [159] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 994
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 995

HG136 [160] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 997
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 998
2023, (doi: 10.13140/RG.2.2.17252.24968). 999
HG135 [161] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1000
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1001
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1002
HG134 [162] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1003
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1004

HG132 [163] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1006
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1007

2023010396 (doi: 10.20944/preprints202301.0396.v1). 1008
HG131 [164] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1009
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1010
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1011
HG130 [165] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1012
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1013
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1014

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

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

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

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1022
HG127 [168] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1023
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1024
2023,(doi: 10.13140/RG.2.2.36745.93289). 1025
HG126 [169] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1026
HG125 [170] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1029
10.20944/preprints202301.0282.v1). 1032
HG124 [171] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1033
10.20944/preprints202301.0267.v1).). 1035

(doi: 10.20944/preprints202301.0265.v1). 1040
HG122 [173] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1041
prints202301.0262.v1). 1044
2023010224, (doi: 10.20944/preprints202301.0224.v1). 1050
HG24 [176] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1051
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1052

10.13140/RG.2.2.35061.65767). 1053
HG25 [177] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1054
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1055

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1056
10.13140/RG.2.2.18494.15680). 1057
HG26 [178] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1058
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1059

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1060
10.13140/RG.2.2.32530.73922). 1061
HG27 [179] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1062
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1063

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1064
10.13140/RG.2.2.15897.70243). 1065

10.13140/RG.2.2.32530.73922). 1069

prints202301.0105.v1). 1072
HG28 [182] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1073
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1074

HG29 [183] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1076
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1077
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1078
10.13140/RG.2.2.23172.19849). 1079
HG30 [186] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1086
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1087
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1088
10.13140/RG.2.2.17385.36968). 1089
Preprints 2023, 2023010044 1092
10.20944/preprints202301.0043.v1). 1095
HG31 [189] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1096
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1097

2023, (doi: 10.13140/RG.2.2.28945.92007). 1098
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1103
10.13140/RG.2.2.35774.77123). 1104
HG35 [193] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1108
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1109

10.13140/RG.2.2.29430.88642). 1110

(doi: 10.20944/preprints202212.0549.v1). 1116
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1118

10.13140/RG.2.2.19380.94084). 1119
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1127
(doi: 10.20944/preprints202212.0500.v1). 1130
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1132
10.13140/RG.2.2.20993.12640). 1133
HG952 [201] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1134

HG95 [202] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1137
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1138
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1139
HG37 [205] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1146
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1147

10.13140/RG.2.2.29173.86244). 1148
HG38 [206] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1149
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1150
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1151

HG176b [207] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1152
(doi: 10.5281/zenodo.8027488). 1153
HG175b [208] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1154
10.5281/zenodo.8020181). 1155
HG174b [209] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1156
10.5281/zenodo.7978921). 1157
HG173b [210] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1158
odo.7943878). 1159
HG172b [211] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1160
10.5281/zenodo.7943871). 1161
HG171b [212] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1162
10.5281/zenodo.7923786). 1163
HG170b [213] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1164
2023 (doi: 10.5281/zenodo.7905287). 1165
HG169b [214] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1166

Garrett, 2023 (doi: 10.5281/zenodo.7904586). 1167
HG168b [215] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1168
2023 (doi: 10.5281/zenodo.7874677). 1169
HG167b [216] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1170
(doi: 10.5281/zenodo.7857906). 1171
HG166b [217] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1172
2023 (doi: 10.5281/zenodo.7856329). 1173
HG165b [218] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1174
10.5281/zenodo.7854561). 1175
HG164b [219] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1176
2023 (doi: 10.5281/zenodo.7851893). 1177
HG163b [220] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1178

HG162b [221] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1180
(doi: 10.5281/zenodo.7835063). 1181
HG161b [222] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1182
(doi: 10.5281/zenodo.7826705). 1183
HG160b [223] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1184
2023 (doi: 10.5281/zenodo.7820680). 1185
HG159b [224] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1186
10.5281/zenodo.7812750). 1187

HG158b [225] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1188

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

HG156b [227] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1192
2023 (doi: 10.5281/zenodo.7807782). 1193
HG155b [228] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1194
2023 (doi: 10.5281/zenodo.7804449). 1195
HG154b [229] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1196

HG153b [230] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1198
(doi: 10.5281/zenodo.7792307). 1199
HG152b [231] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1200
(doi: 10.5281/zenodo.7790728). 1201
HG151b [232] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1202
2023 (doi: 10.5281/zenodo.7787712). 1203
HG150b [233] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1204
10.5281/zenodo.7783791). 1205
HG149b [234] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1206
10.5281/zenodo.7780123). 1207
HG148b [235] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1208
(doi: 10.5281/zenodo.7773119). 1209
HG147b [236] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1210
odo.7637762). 1211
HG146b [237] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1212
10.5281/zenodo.7766174). 1213
HG145b [238] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1214
10.5281/zenodo.7762232). 1215
HG144b [239] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1216
(doi: 10.5281/zenodo.7758601). 1217
HG143b [240] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1218
10.5281/zenodo.7754661). 1219
HG142b [241] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1220
10.5281/zenodo.7750995) . 1221
HG141b [242] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1222
(doi: 10.5281/zenodo.7749875). 1223

HG140b [243] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1224
10.5281/zenodo.7747236). 1225
HG139b [244] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1226
10.5281/zenodo.7742587). 1227
HG138b [245] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1228
(doi: 10.5281/zenodo.7738635). 1229
HG137b [246] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1230
10.5281/zenodo.7734719). 1231
HG136b [247] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1232
10.5281/zenodo.7730484). 1233
HG135b [248] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1234
(doi: 10.5281/zenodo.7730469). 1235
HG134b [249] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1236
10.5281/zenodo.7722865). 1237
HG133b [250] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1238
odo.7713563). 1239
odo.7709116). 1241
HG131b [252] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1242
10.5281/zenodo.7706415). 1243
HG130b [253] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1244
10.5281/zenodo.7706063). 1245
HG129b [254] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1246
10.5281/zenodo.7701906). 1247
HG128b [255] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1248
odo.7700205). 1249
HG127b [256] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1250
10.5281/zenodo.7694876). 1251
HG126b [257] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1252
10.5281/zenodo.7679410). 1253
HG125b [258] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1254
10.5281/zenodo.7675982). 1255
HG124b [259] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1256
10.5281/zenodo.7672388). 1257
HG123b [260] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1258
odo.7668648). 1259

HG122b [261] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1260
10.5281/zenodo.7662810). 1261
HG121b [262] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1262
10.5281/zenodo.7659162). 1263
HG120b [263] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1264
odo.7653233). 1265
HG119b [264] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1266
odo.7653204). 1267
HG118b [265] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1268
odo.7653142). 1269
HG117b [266] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1270
odo.7653117). 1271
HG116b [267] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1272
HG115b [268] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1273
odo.7651687). 1274
HG114b [269] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.7651619). 1276
HG113b [270] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1277
odo.7651439). 1278
HG112b [271] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1279
odo.7650729). 1280
HG111b [272] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1281
odo.7647868). 1282
HG110b [273] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1283
odo.7647017). 1284
HG109b [274] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1285
odo.7644894). 1286
HG108b [275] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1287
HG107b [276] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1288
odo.7632923). 1289
HG106b [277] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1290
odo.7623459). 1291
HG105b [278] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1292
10.5281/zenodo.7606416). 1293

HG104b [279] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1294
10.5281/zenodo.7606416). 1295
HG103b [280] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1296
odo.7606404). 1297
HG102b [281] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1298
10.5281/zenodo.7580018). 1299
HG101b [282] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1300
odo.7580018). 1301
odo.7580018). 1303
odo.7579929). 1305
HG98b [285] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1306
10.5281/zenodo.7563170). 1307
HG97b [286] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1308
odo.7563164). 1309
HG96b [287] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1310
odo.7563160). 1311
odo.7563160). 1313
HG94b [289] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1314
10.5281/zenodo.7563160). 1315
HG93b [290] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1316
10.5281/zenodo.7557063). 1317
HG92b [291] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1318
10.5281/zenodo.7557009). 1319
HG91b [292] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1320
10.5281/zenodo.7539484). 1321
HG90b [293] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1322
10.5281/zenodo.7523390). 1323
HG89b [294] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1324
10.5281/zenodo.7523390). 1325
HG88b [295] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1326
10.5281/zenodo.7523390). 1327
HG87b [296] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1328
odo.7574952). 1329

HG86b [297] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1330
10.5281/zenodo.7574992). 1331
odo.7523357). 1333
HG84b [299] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1334
10.5281/zenodo.7523357). 1335
HG83b [300] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1336
10.5281/zenodo.7504782). 1337
HG82b [301] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1338
10.5281/zenodo.7504782). 1339
HG81b [302] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1340
10.5281/zenodo.7504782). 1341
HG80b [303] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1342
10.5281/zenodo.7499395). 1343
HG79b [304] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1344
odo.7499395). 1345
HG78b [305] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1346
10.5281/zenodo.7499395). 1347
HG77b [306] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1348
10.5281/zenodo.7497450). 1349
HG76b [307] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1350
10.5281/zenodo.7497450). 1351
HG75b [308] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1352
10.5281/zenodo.7494862). 1353
HG74b [309] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1354
odo.7494862). 1355
HG73b [310] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1356
10.5281/zenodo.7494862). 1357
HG72b [311] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1358
10.5281/zenodo.7493845). 1359
HG71b [312] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1360
odo.7493845). 1361
HG70b [313] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1362
10.5281/zenodo.7493845). 1363
HG69b [314] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1364
odo.7539484). 1365

HG68b [315] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1366
odo.7523390). 1367
HG67b [316] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1368
odo.7523357). 1369
HG66b [317] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1370
odo.7504782). 1371
HG65b [318] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1372
odo.7499395). 1373
HG64b [319] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1374
odo.7497450). 1375
HG63b [320] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1376
odo.7494862). 1377
HG62b [321] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1378
odo.7493845). 1379
HG61b [322] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1380
odo.7480110). 1381
HG60b [323] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1382
odo.7378758). 1383
HG32b [324] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1384
odo.6320305). 1385
HG44b [325] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1386
odo.6677173). 1387

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

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

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1461
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1462
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1463
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1464
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1465
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1466
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1467
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1468
based on the fixed groups of cells or the fixed groups of group of cells? 1469
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1470
messy and dense SuperHyperModels where embedded notions are illustrated? 1471
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1472
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1473
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1474

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

CHAPTER 5 1496
Extreme United Dominating 1497
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1498
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1499
2023, (doi: 10.13140/RG.2.2.34953.52320). 1500

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1501
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1502
(doi: 10.13140/RG.2.2.33275.80161). 1503
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1504
10.13140/RG.2.2.11050.90569). 1506
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1507
10.13140/RG.2.2.17761.79206). 1509
10.13140/RG.2.2.19911.37285). 1512
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1513
10.13140/RG.2.2.23266.81602). 1515
10.13140/RG.2.2.19360.87048). 1518
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1519
10.13140/RG.2.2.32363.21286). 1521
10.13140/RG.2.2.11758.69441). 1524
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1525
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1526
10.13140/RG.2.2.31891.35367). 1527
10.13140/RG.2.2.21510.45125). 1530
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1531
10.13140/RG.2.2.13121.84321). 1533

CHAPTER 6 1534
New Ideas On Super Units By Hyper Ultra 1535
Of United Dominating In Recognition of 1536
Cancer With (Neutrosophic) 1537
SuperHyperGraph 1538
49
CHAPTER 7 1539
ABSTRACT 1540
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperUnited 1541

Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a United Dominating pair 1542
S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 1543
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperUnited Dominating 1544
if the following expression is called Neutrosophic e-SuperHyperUnited Dominating criteria holds 1545
∀Ea , ∃Eb0 ∈ ∪zi=1 Ei0 , : ∃Ec ∈ Eb0 , ∃Vd ∈ VN SHG , Vd ∈ Ea ∩ Ec

but∀Ea0 ∈ ∪zi=1 Ei0 , ∀Vb ∈ VN SHG : ∃Ec ∈ EN SHG , ∀Ed ∈ Ea0 , Vb 6∈ Ec ∩ Ed ;
Neutrosophic re-SuperHyperUnited Dominating if the following expression is called Neutrosophic 1546
e-SuperHyperUnited Dominating criteria holds 1547

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

SuperHyperUnited Dominating if the following expression is called Neutrosophic v-SuperHyperUnited 1549
Dominating criteria holds 1550
∀Va , ∃Vb0 ∈ ∪zi=1 Vi0 , : ∃Vc ∈ Vb0 , ∃Ed ∈ EN SHG , Va , Vc ∈ Ed

but∀Va0 ∈ ∪zi=1 Vi0 , ∀Eb ∈ EN SHG : ∃Vc ∈ VN SHG , ∀Vd ∈ Va0 , Vc , Vd 6∈ Eb ;
Neutrosophic rv-SuperHyperUnited Dominating if the following expression is called Neutrosophic 1551

v-SuperHyperUnited Dominating criteria holds 1552

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1553
HyperUnited Dominating if it’s either of Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic 1554
re-SuperHyperUnited Dominating, Neutrosophic v-SuperHyperUnited Dominating, and Neutrosophic 1555
rv-SuperHyperUnited Dominating. ((Neutrosophic) SuperHyperUnited Dominating). Assume a Neutro- 1556
sophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 1557
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperUnited Dominating 1558
51
if it’s either of Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited 1559

Dominating, Neutrosophic v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited 1560
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1561
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1562
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 1563
Extreme SuperHyperVertices such that they form the Extreme SuperHyperUnited Dominating; a 1564
Neutrosophic SuperHyperUnited Dominating if it’s either of Neutrosophic e-SuperHyperUnited Dominat- 1565

ing, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic v-SuperHyperUnited Dominating, and 1566
Neutrosophic rv-SuperHyperUnited Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph 1567
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 1568
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1569
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1570
SuperHyperUnited Dominating; an Extreme SuperHyperUnited Dominating SuperHyperPolynomial if it’s 1571

either of Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, 1572
Neutrosophic v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited Dominating and 1573
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolyno- 1574
mial contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1575
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1576
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1577
they form the Extreme SuperHyperUnited Dominating; and the Extreme power is corresponded to 1578
its Extreme coefficient; a Neutrosophic SuperHyperUnited Dominating SuperHyperPolynomial if it’s 1579
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHy- 1582
perPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 1583
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1584
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 1585
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperUnited 1586
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an 1587
Extreme V-SuperHyperUnited Dominating if it’s either of Neutrosophic e-SuperHyperUnited Domin- 1588
ating, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic v-SuperHyperUnited Dominating, 1589

and Neutrosophic rv-SuperHyperUnited Dominating and C(N SHG) for an Extreme SuperHyper- 1590
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1591
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Ex- 1592
treme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1593
they form the Extreme SuperHyperUnited Dominating; a Neutrosophic V-SuperHyperUnited Dominating 1594
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 1597
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1598
Dominating; an Extreme V-SuperHyperUnited Dominating SuperHyperPolynomial if it’s either of Neut- 1601
rosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic 1602
v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited Dominating and C(N SHG) 1603
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1604

contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1605
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1606

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1614
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this 1617
scientific research, new setting is introduced for new SuperHyperNotions, namely, a Supe- 1618
rHyperUnited Dominating and Neutrosophic SuperHyperUnited Dominating. Two different types of 1619
SuperHyperDefinitions are debut for them but the research goes further and the SuperHy- 1620
perNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and 1621
well-reviewed. The literature review is implemented in the whole of this research. For shining 1622
the elegancy and the significancy of this research, the comparison between this SuperHyperNo- 1623
tion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The 1624
definitions are followed by the examples and the instances thus the clarifications are driven with 1625
different tools. The applications are figured out to make sense about the theoretical aspect of this 1626
ongoing research. The “Cancer’s Recognition” are the under research to figure out the challenges 1627
make sense about ongoing and upcoming research. The special case is up. The cells are viewed 1628
in the deemed ways. There are different types of them. Some of them are individuals and some 1629
of them are well-modeled by the group of cells. These types are all officially called “SuperHy- 1630
perVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks 1631
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research 1632
avenues to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed 1634
to pursue this research. It’s also officially collected in the form of some questions and some prob- 1635
lems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperUnited 1636
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 1637
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1640
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperUnited Dominating is a max- 1641
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1642
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1643
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1644
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 1645
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 1646

δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperUnited 1647
Dominating . Since there’s more ways to get type-results to make a SuperHyperUnited Dominating 1648
more understandable. For the sake of having Neutrosophic SuperHyperUnited Dominating, there’s 1649
a need to “redefine” the notion of a “SuperHyperUnited Dominating ”. The SuperHyperVertices 1650

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 1651
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 1652
SuperHyperUnited Dominating . It’s redefined a Neutrosophic SuperHyperUnited Dominating if the 1653
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 1654
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 1655
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 1656
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The max- 1657
imum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its 1658
Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To 1659
get structural examples and instances, I’m going to introduce the next SuperHyperClass of 1660
SuperHyperGraph based on a SuperHyperUnited Dominating . It’s the main. It’ll be disciplinary to 1661
have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need 1662
to have all SuperHyperUnited Dominating until the SuperHyperUnited Dominating, then it’s officially 1663
called a “SuperHyperUnited Dominating” but otherwise, it isn’t a SuperHyperUnited Dominating . There 1664
are some instances about the clarifications for the main definition titled a “SuperHyperUnited 1665
Dominating ”. These two examples get more scrutiny and discernment since there are characterized 1666
in the disciplinary ways of the SuperHyperClass based on a SuperHyperUnited Dominating . For 1667
the sake of having a Neutrosophic SuperHyperUnited Dominating, there’s a need to “redefine” the 1668
notion of a “Neutrosophic SuperHyperUnited Dominating” and a “Neutrosophic SuperHyperUnited 1669

Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from 1670
the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 1671
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 1672
SuperHyperGraph” if the intended Table holds. And a SuperHyperUnited Dominating are redefined 1673
to a “Neutrosophic SuperHyperUnited Dominating” if the intended Table holds. It’s useful to define 1674
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 1675
type-results to make a Neutrosophic SuperHyperUnited Dominating more understandable. Assume 1676
intended Table holds. Thus SuperHyperPath, SuperHyperUnited Dominating, SuperHyperStar, 1678
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1679
SuperHyperPath”, “Neutrosophic SuperHyperUnited Dominating”, “Neutrosophic SuperHyperStar”, 1680
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutro- 1681

sophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 1682
SuperHyperUnited Dominating” where it’s the strongest [the maximum Neutrosophic value from all 1683
the SuperHyperUnited Dominating amid the maximum value amid all SuperHyperVertices from 1684
a SuperHyperUnited Dominating .] SuperHyperUnited Dominating . A graph is a SuperHyperUniform 1685
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 1686
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 1687
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1688
with two exceptions; it’s SuperHyperUnited Dominating if it’s only one SuperVertex as intersection 1689
amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 1690
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 1691
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 1692
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 1693
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 1694
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 1695
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 1696

with any common SuperVertex. The SuperHyperModel proposes the specific designs and 1697
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 1698
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 1699
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 1700
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 1701
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 1702
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 1703
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 1704
Recognition” and the results and the definitions will be introduced in redeemed ways. The 1705
recognition of the cancer in the long-term function. The specific region has been assigned 1706
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 1707
to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1711
cancer on the complex tracks and between complicated groups of cells could be fantasized 1714
by a Neutrosophic SuperHyperPath(-/SuperHyperUnited Dominating, SuperHyperStar, SuperHy- 1715

perBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1716
longest SuperHyperUnited Dominating or the strongest SuperHyperUnited Dominating in those Neutro- 1717
sophic SuperHyperModels. For the longest SuperHyperUnited Dominating, called SuperHyperUnited 1718
Dominating, and the strongest SuperHyperUnited Dominating, called Neutrosophic SuperHyperUnited 1719
Dominating, some general results are introduced. Beyond that in SuperHyperStar, all possible 1720
SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to 1721
have at least three SuperHyperEdges to form any style of a SuperHyperUnited Dominating. There 1722
isn’t any formation of any SuperHyperUnited Dominating but literarily, it’s the deformation of any 1723
SuperHyperUnited Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity 1724
with Neutrosophic SuperHyperUnited Dominating theory, SuperHyperGraphs, and Neutrosophic 1725
SuperHyperGraphs theory are proposed. 1726
Keywords: Neutrosophic SuperHyperGraph, SuperHyperUnited Dominating, Cancer’s Neutro- 1727
sophic Recognition 1728

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

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

Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1809
and as concluding and closing section of theoretical research are contained in the section 1810
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1811
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1812
Results”, “ SuperHyperUnited Dominating”, “Extreme SuperHyperUnited Dominating”, “Results on 1813
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1814
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1815
and going to figure out the word “best” as the description and adjective for this research as 1816
presented in section, “ SuperHyperUnited Dominating”. The keyword of this research debut in the 1817
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1818
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 1819
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 1820

there are some scrutiny and discernment on what’s done and what’s happened in this research 1821
in the terms of “questions” and “problems” to make sense to figure out this research in featured 1822
style. The advantages and the limitations of this research alongside about what’s done in this 1823
research to make sense and to get sense about what’s figured out are included in the section, 1824
“Conclusion and Closing Remarks”. 1825

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1832
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1833
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1834
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1835
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1836
ideas and their clarifications are addressed to Ref.[HG38]. 1837

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

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

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

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

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1857
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1858
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1859
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1860
E. Thus, the ii0 th element of the United Dominating of Neutrosophic SuperHyperGraph 1861
(NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1862

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

(Ref.[HG11s],Definition 2.7,p.3). 1864
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1865
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1866
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1867
(i) If |Vi | = 1, then Vi is called vertex; 1868
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1869
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1870
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1871
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1872
SuperEdge; 1873
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1874
SuperHyperEdge. 1875
If we choose different types of binary operations, then we could get hugely diverse types of 1876
general forms of Neutrosophic SuperHyperGraph (NSHG). 1877
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1878

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1879
x, y, z, w ∈ [0, 1]: 1880
(i) 1 ⊗ x = x; 1881
(ii) x ⊗ y = y ⊗ x; 1882
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1883
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1884

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

where 1887

1, 2, . . . , n0 ); 1892
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1893
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1894
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1895
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1896
0


SuperEdge; 1916
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1919
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1920
makes the patterns and regularities. 1921
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1922
of elements of SuperHyperEdges are the same. 1923

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1924
makes to have SuperHyperUniform more understandable. 1925
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1926
Classes as follows. 1927
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1928
two given SuperHyperEdges with two exceptions; 1929
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1930
SuperHyperEdges; 1931
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1932
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1933
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1934
in common; 1935
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1936
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1937
SuperHyperEdge in common; 1938
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1939
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1940
SuperVertex. 1941
Definition 9.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 1942
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1943
(i) Vi , Vi+1 ∈ Ei0 ; 1944
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1945
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1946
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1947
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1948
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1949
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1950
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1951
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 9.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) V1 to Neutrosophic
SuperHyperVertex (NSHV) Vs is sequence of Neutrosophic SuperHyperVertices (NSHV) and
Neutrosophic SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 1953
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1954
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1955
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1956
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1957
perPath . 1958
Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG11s],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 1959
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1960
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1961
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1962
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1963
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1964

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1977
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1978

to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1979
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperUnited Dominating). 1980

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1982
or E 0 is called 1983
(i) Neutrosophic e-SuperHyperUnited Dominating if the following expression is called 1984

Neutrosophic e-SuperHyperUnited Dominating criteria holds 1985

but∀Ea0 ∈ ∪zi=1 Ei0 , ∀Vb ∈ VN SHG : ∃Ec ∈ EN SHG , ∀Ed ∈ Ea0 , Vb 6∈ Ec , Ed ;
(ii) Neutrosophic re-SuperHyperUnited Dominating if the following expression is called 1986

Neutrosophic re-SuperHyperUnited Dominating criteria holds 1987

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 1988
(iii) Neutrosophic v-SuperHyperUnited Dominating if the following expression is called 1989
Neutrosophic v-SuperHyperUnited Dominating criteria holds 1990

(iv) Neutrosophic rv-SuperHyperUnited Dominating if the following expression is called 1991


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 1993
(v) Neutrosophic SuperHyperUnited Dominating if it’s either of Neutrosophic e- 1994

SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic 1995
v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited Dominating. 1996
Definition 9.0.19. ((Neutrosophic) SuperHyperUnited Dominating). 1997


(i) an Extreme SuperHyperUnited Dominating if it’s either of Neutrosophic e- 2000

SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic v- 2001
SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited Dominating and C(N SHG) 2002
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2003
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHy- 2004
perEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 2005
SuperHyperVertices such that they form the Extreme SuperHyperUnited Dominating; 2006
(ii) a Neutrosophic SuperHyperUnited Dominating if it’s either of Neutrosophic e- 2007

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 2010
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 2011
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 2012
SuperHyperVertices such that they form the Neutrosophic SuperHyperUnited Dominating; 2013
(iii) an Extreme SuperHyperUnited Dominating SuperHyperPolynomial if it’s either of 2014

Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, 2015
Neutrosophic v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited Domin- 2016
ating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2017
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 2018
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 2019
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 2020
Extreme SuperHyperVertices such that they form the Extreme SuperHyperUnited Dominating; 2021
and the Extreme power is corresponded to its Extreme coefficient; 2022
(iv) a Neutrosophic SuperHyperUnited Dominating SuperHyperPolynomial if it’s either 2023

of Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominat- 2024
ing, Neutrosophic v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited 2025

Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 2026
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as 2027
the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 2028
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2029
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2030
that they form the Neutrosophic SuperHyperUnited Dominating; and the Neutrosophic power 2031
is corresponded to its Neutrosophic coefficient; 2032
(v) an Extreme V-SuperHyperUnited Dominating if it’s either of Neutrosophic e- 2033

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 2037
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 2038
(vi) a Neutrosophic V-SuperHyperUnited Dominating if it’s either of Neutrosophic e- 2040


for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2043

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet 2044
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 2045
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperUnited 2046
Dominating; 2047
(vii) an Extreme V-SuperHyperUnited Dominating SuperHyperPolynomial if it’s either 2048

of Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, 2049
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 2053
(viii) a Neutrosophic SuperHyperUnited Dominating SuperHyperPolynomial if it’s either 2057


SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2063
is corresponded to its Neutrosophic coefficient. 2066
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperUnited Dominating). 2067

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

perUnited Dominating such that either of the following expressions hold for the Neutrosophic 2070
cardinalities of SuperHyperNeighbors of s ∈ S : 2071
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (30.1), holds if S is an δ−SuperHyperOffensive. And the Expression 2072
(30.1), holds if S is an δ−SuperHyperDefensive; 2073
(ii) a Neutrosophic δ−SuperHyperUnited Dominating is a Neutrosophic kind of Neutrosophic 2074
SuperHyperUnited Dominating such that either of the following Neutrosophic expressions hold 2075
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2076
|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 (30.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2077
the Expression (30.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2078

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

136TBL4
For the sake of having a Neutrosophic SuperHyperUnited Dominating, there’s a need to 2079
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and 2080
the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 2081
procedure, there’s the usage of the position of labels to assign to the values. 2082
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2083
It’s redefined Neutrosophic SuperHyperGraph if the Table (30.1) holds. 2084
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2085
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2086
There are some Neutrosophic SuperHyperClasses if the Table (30.2) holds. Thus Neut- 2088
rosophic SuperHyperPath , SuperHyperUnited Dominating, SuperHyperStar, SuperHyperBipart- 2089
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 2090
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 2091
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 2092

perHyperWheel if the Table (30.2) holds. 2093
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperUnited Dominating. 2094

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperUnited Dominating 2095
more Neutrosophicly understandable. 2096
For the sake of having a Neutrosophic SuperHyperUnited Dominating, there’s a need to “redefine” 2097
the Neutrosophic notion of “Neutrosophic SuperHyperUnited Dominating”. The SuperHyperVertices 2098
136DEF1 Definition 9.0.23. Assume a SuperHyperUnited Dominating. It’s redefined a Neutrosophic 2101
SuperHyperUnited Dominating if the Table (30.3) holds. 2102


136TBL1

CHAPTER 10 2103
Extreme SuperHyper But As The United Dominating 2104
Extensions Excerpt From Dense And 2105
Super Forms 2106
Definition 10.0.1. (Extreme event). 2107

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2108
a probability United Dominating. Any Extreme k-subset of A of V is called Extreme k-event and 2109
if k = 2, then Extreme subset of A of V is called Extreme event. The following expression is 2110
called Extreme probability of A. 2111
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2112

a probability United Dominating. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2114
if the following expression is called Extreme s-independent criteria 2115
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Extreme k-events of A and B is called Extreme independent. The 2116
following expression is called Extreme independent criteria 2117
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2118

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2119
probability United Dominating. Any k-function United Dominating like E is called Extreme k-Variable. 2120
If k = 2, then any 2-function United Dominating like E is called Extreme Variable. 2121
The notion of independent on Extreme Variable is likewise. 2122
Definition 10.0.4. (Extreme Expectation). 2123
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2124
73
is a probability United Dominating. an Extreme k-Variable E has a number is called Extreme 2125
Expectation if the following expression is called Extreme Expectation criteria 2126
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2127

a probability United Dominating. an Extreme number is called Extreme Crossing if the following 2129
expression is called Extreme Crossing criteria 2130
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2131
S = (V, E) is a probability United Dominating. Let m and n propose special United Dominating. Then 2132
with m ≥ 4n, 2133
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability United Dominating p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 2134
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2135
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2136
Consider S = (V, E) is a probability United Dominating. Let P be a SuperHyperSet of n points in the 2137
plane, and let l be the Extreme number√of SuperHyperLines in the plane passing through at least 2138
k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2139
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2140

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

Consider S = (V, E) is a probability United Dominating. Let P be a SuperHyperSet of n points in 2147
the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2148
k < 5n4/3 . 2149
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2150
S = (V, E) is a probability United Dominating. Draw a SuperHyperUnit SuperHyperCircle around 2151
each SuperHyperPoint of P. Let ni be the Extreme number of these SuperHyperCircles 2152
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 2153
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2154

SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on the 2155
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2156
n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3
Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 2157
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2158

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2159
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2160
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2161
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2162
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2163
Consider S = (V, E) is a probability United Dominating. Let X be a nonnegative Extreme Variable 2164
and t a positive real number. Then 2165
E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality. 2166
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2167
Consider S = (V, E) is a probability United Dominating. Let Xn be a nonnegative integer-valued 2168
variable in a probability United Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 2169

P (Xn = 0) → 1 as n → ∞. 2170
Proof. 2171
Consider S = (V, E) is a probability United Dominating. A special SuperHyperGraph in Gn,p almost 2173
surely has stability number at most d2p−1 log ne. 2174

S = (V, E) is a probability United Dominating. A special SuperHyperGraph in Gn,p is up. Let 2176
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 2177
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 2178
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 2179
of the Extreme SuperHyperGraph G. 2180
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2181
Extreme Variable for this Extreme Event. By equation, we have 2182
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .
Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 2183
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2184
X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 2185
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2186
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!
Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 2187
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2188
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2189
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2190
Definition 10.0.12. (Extreme Variance). 2191

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

S = (V, E) is a probability United Dominating. Let X be an Extreme Variable and let t be a positive 2199
real number. Then 2200
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
2201
Consider S = (V, E) is a probability United Dominating. Let Xn be an Extreme Variable in a 2203
probability United Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2204
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability United Dominating. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s 2206
Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2207
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2208
Consider S = (V, E) is a probability United Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2210
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2211
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2212
S = (V, E) is a probability United Dominating. As in the proof of related Theorem, the result is 2214
straightforward. 2215
Consider S = (V, E) is a probability United Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be as 2217
defined in previous Theorem. Then either: 2218
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2219
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2220
S = (V, E) is a probability United Dominating. The latter is straightforward. 2222
Definition 10.0.17. (Extreme Threshold). 2223

is a probability United Dominating. Let P be a monotone property of SuperHyperGraphs (one 2225

which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2226
a function f (n) such that: 2227
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2228
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2229

Definition 10.0.18. (Extreme Balanced). 2230

is a probability United Dominating. Let F be a fixed Extreme SuperHyperGraph. Then 2232
there is a threshold function for the property of containing a copy of F as an Extreme 2233
SubSuperHyperGraph is called Extreme Balanced. 2234
Consider S = (V, E) is a probability United Dominating. Let F be a nonempty balanced Extreme 2236
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2237
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2238
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2241
the mentioned Extreme Figures in every Extreme items. 2242
• On the Figure (31.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperUnited 2243
Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are 2244
some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2245
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2246
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2247
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2248
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2249
Extreme SuperHyperUnited Dominating. 2250
C(N SHG)Extreme United Dominating =

{}.
C(N SHG)Extreme United Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-United Dominating =
{}.
C(N SHG)Extreme V-United Dominating SuperHyperPolynomial
= 0z 0 .
2251
Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 2253
some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in 2254
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 2255
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 2256
no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2257
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperUnited Dominating. 2258

{}.

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

= 0z 0 .
{}.
= 0z 0 .
2259
Dominating, is up. The Extreme Algorithm is Extremely straightforward. 2261

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



{{E5 , E4 }, {E2 }}.
= z 2 + z.
{{V1 , V2 }, {V4 }}.
= z 2 + z.
2265

{}.
= 0z 0 .
{{V1 , V6 }, {V9 , V15 }}.

= 2z 2 .
2268

{{Ei }17 22
i=12 , {Ei }i=18 }.
= z6 + z5.
{{Vi }6i=1 , {Vi , V21 }10
i=7 }.
= z6 + z5.
2271

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

{}.
= 0z 0 .
{}.

= 0z 0 .
2277

{{E3i+1 }1i=0 {E3i+1 , E23 }3i=2 }.
= z3 + z2.
{{V3i+1 }1i=0 {V3i+1 , V11 }3i=2 }.
= z6 + z5.
2280

{}.



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

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


{}.
= 0z 0 .
{V1 , V2 , V3 }, {V7 , V8 }}.
= z3 + z2.
2289

{}.
= 0z 0 .


{}.
= 0z 0 .
2292

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


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

{}.
= 0z 0 .


{}.
= 0z 0 .
2301

{}.
= 0z 0 .


{}.
= 0z 0 .
2304

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


{{E3i+1 }1i=0 {E3i+1 }3i=2 }.
= 2z 2 .
{{V2i+1 }1i=0 {V2i+1 }5i=2 }.
= z4 + z2.
2310

{}.
= 0z 0 .


{}.
= 0z 0 .
2313

{E2 }.
= z |E2 | .
{V1 }.
= z |V1 | .
2316


{{E3i+1 }1i=0 {E3i+1 }3i=2 }.
= 2z 2 .
{{V2i+1 }1i=0 {V2i+1 }5i=2 }.
= z4 + z2.
2319
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2320
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-United Dominating if for any 2321
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2322
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2323

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

SuperHyperUnited Dominating in the Extreme Example (43.0.3) 95NHG1
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2325

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2326
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2327
quasi-R-United Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of 2328
them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2329
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-United Dominating, minus all 2330
Extreme SuperHypeNeighbor to some of them but not all of them. 2331
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

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

SuperHyperUnited Dominating in the Extreme Example (43.0.3) 95NHG2
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2335
SuperHyperVertices are renamed to Extreme United Dominating in some cases but the maximum 2336
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2337
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R-United 2338
Dominating. 2339
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-United Dominating has, the least Extreme cardinality, the lower
sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-United Dominating with the least Extreme cardinality, the lower 2340
sharp Extreme bound for cardinality. 2341
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2342
Then in the worst case, literally, 2343
C(N SHG)ExtremeQuasi−U nitedDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−U nitedDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−U nitedDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−U nitedDominatingSuperHyperP olynomial = z 5 .

Is an Extreme type-result-United Dominating. In other words, the least cardinality, the lower sharp 2344
bound for the cardinality, of an Extreme type-result-United Dominating is the cardinality of 2345

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−U nitedDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−U nitedDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−U nitedDominatingSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-United Dominating since
neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where amount
refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than one to
form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the
Extreme SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-United Dominating. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-United Dominating is the cardinality of
Then we’ve lost some connected loopless Extreme SuperHyperClasses of the connected loopless
Extreme SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the
SuperHyperStable is only up in this quasi-R-United Dominating. It’s the contradiction to that fact

on the generality. There are some counterexamples to deny this statement. One of them comes
from the setting of the graph titled path and cycle as the counterexamples-classes or reversely
direction star as the examples-classes, are well-known classes in that setting and they could be
considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Extreme SuperHyperSet has the necessary condition for the intended
definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main
definition but by the necessity of the pre-condition on the usage of the main definition.
The Extreme structure of the Extreme R-United Dominating decorates the Extreme SuperHyperVer-
tices don’t have received any Extreme connections so as this Extreme style implies different
versions of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of
Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum
Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex
in the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore,
the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about
the Extreme R-United Dominating. Since at least two Extreme SuperHyperVertices involve to
make a title in the Extreme background of the Extreme SuperHyperGraph. The Extreme
SuperHyperGraph is obvious if it has no Extreme SuperHyperEdge but at least two Extreme
SuperHyperVertices make the Extreme version of Extreme SuperHyperEdge. Thus in the
Extreme setting of non-obvious Extreme SuperHyperGraph, there are at least one Extreme
SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as Extreme adjective
for the initial Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop
Extreme version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said
to be loopless. The Extreme adjective “loop” on the basic Extreme framework engages one
Extreme SuperHyperVertex but it never happens in this Extreme setting. With these Extreme
bases, on an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus
there’s at least an Extreme R-United Dominating has the Extreme cardinality of an Extreme Su-
perHyperEdge. Thus, an Extreme R-United Dominating has the Extreme cardinality at least an
Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This Extreme
SuperHyperSet isn’t an Extreme R-United Dominating since either the Extreme SuperHyperGraph
is an obvious Extreme SuperHyperModel thus it never happens since there’s no Extreme usage
of this Extreme framework and even more there’s no Extreme connection inside or the Extreme
SuperHyperGraph isn’t obvious and as its consequences, there’s an Extreme contradiction with
the term “Extreme R-United Dominating” since the maximum Extreme cardinality never happens
for this Extreme style of the Extreme SuperHyperSet and beyond that there’s no Extreme
connection inside as mentioned in first Extreme case in the forms of drawback for this selected

Extreme SuperHyperSet. Let
Comes up. This Extreme case implies having the Extreme style of on-quasi-triangle Extreme
style on the every Extreme elements of this Extreme SuperHyperSet. Precisely, the Extreme
R-United Dominating is the Extreme SuperHyperSet of the Extreme SuperHyperVertices such that
some Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle Extreme style.
The Extreme cardinality of the v SuperHypeSet
Is the maximum in comparison to the Extreme SuperHyperSet
But the lower Extreme bound is up. Thus the minimum Extreme cardinality of the maximum
Extreme cardinality ends up the Extreme discussion. The first Extreme term refers to the
Extreme setting of the Extreme SuperHyperGraph but this key point is enough since there’s an
Extreme SuperHyperClass of an Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes an Extreme SuperHyperSet has only some amount Extreme
SuperHyperVertices from one Extreme SuperHyperEdge such that there’s no Extreme amount
of Extreme SuperHyperEdges more than one involving these some amount of these Extreme
SuperHyperVertices. The Extreme cardinality of this Extreme SuperHyperSet is the maximum
and the Extreme case is occurred in the minimum Extreme situation. To sum them up, the
Extreme SuperHyperSet
Has the maximum Extreme cardinality such that
Contains some Extreme SuperHyperVertices such that there’s distinct-covers-order-amount

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices
Is an Extreme R-United Dominating for the Extreme SuperHyperGraph as used Extreme background
in the Extreme terms of worst Extreme case and the common theme of the lower Extreme
bound occurred in the specific Extreme SuperHyperClasses of the Extreme SuperHyperGraphs
which are Extreme free-quasi-triangle.

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

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

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

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


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

that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in an
Extreme United Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s not unique. To
sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If an Extreme
SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-United Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-United Dominating is at least the 2348
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2349
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2350
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2351
SuperHyperVertices are renamed to Extreme United Dominating in some cases but the maximum 2352
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2353
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R-United 2354
Dominating. 2355
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2356
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2357
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2358
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of 2359
Extreme SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken 2360
from that Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme 2361
SuperHyperSet of the Extreme SuperHyperVertices is either has the maximum Extreme 2362
SuperHyperCardinality or it doesn’t have maximum Extreme SuperHyperCardinality. In 2363
a non-obvious SuperHyperModel, there’s at least one Extreme SuperHyperEdge containing 2364
at least all Extreme SuperHyperVertices. Thus it forms an Extreme quasi-R-United Dominating 2365
where the Extreme completion of the Extreme incidence is up in that. Thus it’s, literarily, an 2366
Extreme embedded R-United Dominating. The SuperHyperNotions of embedded SuperHyperSet and 2367
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 2368
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such 2369
that those SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re 2370
Extreme SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices 2371
are included in the minimum Extreme style of the embedded Extreme R-United Dominating. The 2372
interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2373
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2374
common connections, more precise and more formal, the perfect unique connections inside 2375
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2376
Extreme R-United Dominating. Thus Extreme exterior SuperHyperVertices could be used only in 2377
one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior Extreme 2378
SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme United Dominating, 2379
there’s the usage of exterior Extreme SuperHyperVertices since they’ve more connections inside 2380
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One 2381
Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme SuperHyperSet of the 2382
Extreme SuperHyperVertices with one SuperHyperElement has been ignored in the exploring 2383
to lead on the optimal case implying the Extreme R-United Dominating. The Extreme R-United 2384
Dominating with the exclusion of the exclusion of all Extreme SuperHyperVertices in one Extreme 2385

SuperHyperEdge and with other terms, the Extreme R-United Dominating with the inclusion of 2386
all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme quasi-R- 2387
United Dominating. To sum them up, in a connected non-obvious Extreme SuperHyperGraph 2388
ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the 2389
maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of any given 2390
Extreme quasi-R-United Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2391
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2392
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-United Dominating, minus 2393
all Extreme SuperHypeNeighbor to some of them but not all of them. 2394
The main definition of the Extreme R-United Dominating has two titles. an Extreme quasi-R-United 2395
Dominating and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are two 2396
titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R- 2397
United Dominating with that quasi-maximum Extreme SuperHyperCardinality in the terms of the 2398
embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, 2399
then the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme 2400
quasi-R-United Dominatings for all Extreme numbers less than its Extreme corresponded maximum 2401
number. The essence of the Extreme United Dominating ends up but this essence starts up in the 2402
terms of the Extreme quasi-R-United Dominating, again and more in the operations of collecting all 2403
the Extreme quasi-R-United Dominatings acted on the all possible used formations of the Extreme 2404
SuperHyperGraph to achieve one Extreme number. This Extreme number is 2405
considered as the equivalence class for all corresponded quasi-R-United Dominatings. Let 2406
zExtreme Number , SExtreme SuperHyperSet and GExtreme United Dominating be an Extreme number, an 2407
Extreme SuperHyperSet and an Extreme United Dominating. Then 2408
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme United Dominating ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme United Dominating is re-formalized and 2409
redefined as follows. 2410
GExtreme United Dominating ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number
{SExtreme SuperHyperSet |
= zExtreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 2411
definition for the Extreme United Dominating. 2412
GExtreme United Dominating =

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

∪zExtreme Number {SExtreme SuperHyperSet |

= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme United 2413
Dominating poses the upcoming expressions. 2414

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

= max zExtreme Number
[zExtreme
Number ]Extreme Class

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


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


2418

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


= zExtreme Number |

2419


2420


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2421
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2422
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Super- 2423
HyperEdge. It’s, literarily, another name for “Extreme Quasi-United Dominating” but, precisely, 2424
it’s the generalization of “Extreme Quasi-United Dominating” since “Extreme Quasi-United Dominat- 2425
ing” happens “Extreme United Dominating” in an Extreme SuperHyperGraph as initial framework 2426
and background but “Extreme SuperHyperNeighborhood” may not happens “Extreme United 2427
Dominating” in an Extreme SuperHyperGraph as initial framework and preliminarily background 2428
since there are some ambiguities about the Extreme SuperHyperCardinality arise from it. To 2429
get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-United 2430
Dominating”, and “Extreme United Dominating” are up. 2431
Thus, let 2432
zExtreme Number , NExtreme SuperHyperNeighborhood and 2433
GExtreme United Dominating be an Extreme number, an Extreme SuperHyperNeighborhood and an 2434
Extreme United Dominating and the new terms are up. 2435
GExtreme United Dominating ∈ ∪zExtreme Number

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

2436

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

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

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


2440

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


2441


2442


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

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

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

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

There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme United Dominating is up. The obvious simple Extreme type-
SuperHyperSet called the Extreme United Dominating is an Extreme SuperHyperSet includes
only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-United Dominating is up. To sum them up, the
Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-United Dominating. Since
the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-United Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is
the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an Extreme
SuperHyperEdge for some Extreme SuperHyperVertices instead of all given by that Extreme
type-SuperHyperSet called the Extreme United Dominating and it’s an Extreme United Dominating.
Since it’s
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

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

does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2443
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2444
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2445
the 2446
“Extreme R-United Dominating” 2447
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2448
Extreme R-United Dominating, 2449
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-United Dominating. In other words, the least cardinality, the lower sharp bound
for the cardinality, of an Extreme R-United Dominating is the cardinality of
2450
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2451
Extreme SuperHyperVertices belong to any Extreme quasi-R-United Dominating if for any of 2452
them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2453
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2454
all minus all Extreme SuperHypeNeighbors to any amount of them. 2455
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2456
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2457
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2458
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2459
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2460
R-United Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2461
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2462
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2463

S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2464
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-United Dominating. Since it 2465
doesn’t have 2466
2467
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2468
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2469
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2470
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2471
but it isn’t an Extreme R-United Dominating. Since it doesn’t do the Extreme procedure such 2472
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2473
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2474
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2475
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2476
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2477
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2478
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-United Dominating, VESHE 2479
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-United Dominating, 2480
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2481
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2482
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2483
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2484
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2485
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2486
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-United Dominating only contains all 2487
interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2488
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2489
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2490
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2491
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2492
The SuperHyperNotion, namely, United Dominating, is up. There’s neither empty SuperHyperEdge 2493
nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2494
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme United 2495
Dominating. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2496

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−U nitedDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−U nitedDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−U nitedDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme United Dominating . The Extreme 2497

SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2498

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme United Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2499
is an Extreme type-SuperHyperSet with 2500

2501
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2502
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2503
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2504
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2505
Extreme SuperHyperSet. Thus the non-obvious Extreme United Dominating is up. The obvious 2506
simple Extreme type-SuperHyperSet called the Extreme United Dominating is an Extreme SuperHy- 2507
perSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet of 2508
the Extreme SuperHyperEdges[SuperHyperVertices], 2509

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHy- 2510
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme United 2511
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2512
perEdges[SuperHyperVertices], 2513

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


= az s + bz t .
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme United Dominating. Since 2514
the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2515

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme United Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2516
is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an 2517
Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme 2518
type-SuperHyperSet called the Extreme United Dominating and it’s an Extreme United Dominating. 2519
Since it’s 2520

2521
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2522
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2523
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2524
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2525
intended Extreme SuperHyperSet, 2526

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

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


= az s + bz t .
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme , not:
United Dominating 2528

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2530
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2531
SuperHyperSet called the 2532
“Extreme United Dominating ” 2533
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2534
Extreme United Dominating , 2535
is only and only 2536

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

CHAPTER 11 2538
The Extreme Departures on The 2539
Theoretical Results Toward Theoretical 2540
Motivations 2541
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2542
SuperHyperClasses. 2543
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2544

|E |
{{E3i+1 }1i=0 {E3i+1 }i=2ESHP }.
= z |EESHP |−1 + z 2 .
|V |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z VESHP |−1 + z 2 .
Proof. Let 2545
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2546
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
115
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperUnited

Dominating in the Example (43.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2547
new way to redefine as 2548
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 2549
ViEXT ERN AL in the literatures of SuperHyperUnited Dominating. The latter is straightforward. 2550
136EXM18a Example 11.0.2. In the Figure (32.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2551
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2552
(32.1), is the SuperHyperUnited Dominating. 2553
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2554

|E |
{{E3i+1 }1i=0 {E3i+1 }i=2ESHP }.
= z |EESHP |−1 + z 2 .

|V |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z VESHP |−1 + z 2 .
Proof. Let 2555
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2556
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 2557

136EXM19a Example 11.0.4. In the Figure (32.2), the connected Extreme SuperHyperCycle N SHC : 2561
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2562
SuperHyperModel (32.2), is the Extreme SuperHyperUnited Dominating. 2563
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2564

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

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

SuperHyperUnited Dominating in the Extreme Example (43.0.7) 136NSHG19a
Proof. Let 2565
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2566
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2567
way to redefine as 2568


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

SuperHyperUnited Dominating in the Extreme Example (43.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (32.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2571
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2572
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2573
ESHS : (V, E), in the Extreme SuperHyperModel (32.3), is the Extreme SuperHyperUnited 2574
Dominating. 2575
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2576

|P |
{{E3i+1 }1i=0 {E3i+1 }i=2
ESHP
}.
= z |PESHP |−1 + z 2 .
|P |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z PESHP |−1 + z 2 .
Proof. Let 2577
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
2578
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG
is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 2579
a new way to redefine as 2580

Then there’s no at least one SuperHyperUnited Dominating. Thus the notion of quasi may be up 2583
but the SuperHyperNotions based on SuperHyperUnited Dominating could be applied. There are 2584
only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 2585
the representative in the 2586
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperUnited Dominating taken from a connected Extreme SuperHyperBipartite 2587

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2588
SuperHyperPart SuperHyperEdges are attained in any solution 2589
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2590
136EXM21a Example 11.0.8. In the Extreme Figure (32.4), the connected Extreme SuperHyperBipartite 2591
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2592
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2593
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2594
Extreme SuperHyperModel (32.4), is the Extreme SuperHyperUnited Dominating. 2595

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

Extreme SuperHyperUnited Dominating in the Example (43.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2596
Then 2597

|P |
{{E3i+1 }1i=0 {E3i+1 }i=2
ESHP
}.
= z |PESHP |−1 + z 2 .
|P |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z PESHP |−1 + z 2 .
Proof. Let 2598
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2599
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperUnited Dominating taken from a connected Extreme SuperHyperMultipartite 2600

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

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2609
SuperHyperEdges are attained in any solution 2610
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2611
136EXM22a Example 11.0.10. In the Figure (32.5), the connected Extreme SuperHyperMultipartite 2613
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2614
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2615
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (32.5), is 2616
the Extreme SuperHyperUnited Dominating. 2617
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2618

Then, 2619

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

SuperHyperUnited Dominating in the Example (43.0.13) 136NSHG22a
|E |
{{E3i+1 }1i=0 {E3i+1 }i=2ESHP }.
= z |EESHP |−1 + z 2 .
|V |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z VESHP |−1 + z 2 .
Proof. Let 2620
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2621
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperUnited Dominating taken from a connected Extreme SuperHyperWheel 2622

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

Extreme SuperHyperUnited Dominating in the Extreme Example (43.0.15) 136NSHG23a
ESHW : (V, E). There’s a new way to redefine as 2623

Then there’s at least one SuperHyperUnited Dominating. Thus the notion of quasi isn’t up and 2626
the SuperHyperNotions based on SuperHyperUnited Dominating could be applied. The unique 2627
embedded SuperHyperUnited Dominating proposes some longest SuperHyperUnited Dominating excerpt 2628
from some representatives. The latter is straightforward. 2629
136EXM23a Example 11.0.12. In the Extreme Figure (32.6), the connected Extreme SuperHyperWheel 2630
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2631
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2632
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (32.6), is the 2633
Extreme SuperHyperUnited Dominating. 2634

CHAPTER 12 2635
The Surveys of Mathematical Sets On 2636
The Results But As The Initial Motivation 2637
For the SuperHyperUnited Dominating, Extreme SuperHyperUnited Dominating , and the Extreme 2638
SuperHyperUnited Dominating, some general results are introduced. 2639
Remark 12.0.1. Let remind that the Extreme SuperHyperUnited Dominating is “redefined” on the 2640
positions of the alphabets. 2641
Corollary 12.0.2. Assume Extreme SuperHyperUnited Dominating. Then 2642
Extreme SuperHyperU nitedDominating =

{theSuperHyperU nitedDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperU nitedDominating
|ExtremecardinalityamidthoseSuperHyperU nitedDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2643
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2644
and the neutrality, for i = 1, 2, 3, respectively. 2645
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2646
alphabet. Then the notion of Extreme SuperHyperUnited Dominating and SuperHyperUnited Dominating 2647
coincide. 2648
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperUnited 2650
Dominating if and only if it’s a SuperHyperUnited Dominating. 2651
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperUnited 2653
Dominating if and only if it’s a longest SuperHyperUnited Dominating. 2654
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2655
identical letter of the alphabet. Then its Extreme SuperHyperUnited Dominating is its SuperHyperUnited 2656
Dominating and reversely. 2657
125
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperUnited Dominating, SuperHy- 2658

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 2659
letter of the alphabet. Then its Extreme SuperHyperUnited Dominating is its SuperHyperUnited Dominating 2660
and reversely. 2661
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperUnited 2662
isn’t well-defined if and only if its SuperHyperUnited Dominating isn’t well-defined.
Dominating 2663
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2664
Extreme SuperHyperUnited Dominating isn’t well-defined if and only if its SuperHyperUnited Dominating 2665
isn’t well-defined. 2666

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2668
SuperHyperUnited Dominating isn’t well-defined if and only if its SuperHyperUnited Dominating isn’t 2669
well-defined. 2670
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperUnited 2671
is well-defined if and only if its SuperHyperUnited Dominating is well-defined.
Dominating 2672
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2673

Extreme SuperHyperUnited Dominating is well-defined if and only if its SuperHyperUnited Dominating is 2674
well-defined. 2675

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2677
SuperHyperUnited Dominating is well-defined if and only if its SuperHyperUnited Dominating is well- 2678
defined. 2679
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2680
(i) : the dual SuperHyperDefensive SuperHyperUnited Dominating; 2681
(ii) : the strong dual SuperHyperDefensive SuperHyperUnited Dominating; 2682
(iii) : the connected dual SuperHyperDefensive SuperHyperUnited Dominating; 2683
(iv) : the δ-dual SuperHyperDefensive SuperHyperUnited Dominating; 2684
(v) : the strong δ-dual SuperHyperDefensive SuperHyperUnited Dominating; 2685
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperUnited Dominating. 2686
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2687
(i) : the SuperHyperDefensive SuperHyperUnited Dominating; 2688
(ii) : the strong SuperHyperDefensive SuperHyperUnited Dominating; 2689
(iii) : the connected defensive SuperHyperDefensive SuperHyperUnited Dominating; 2690
(iv) : the δ-SuperHyperDefensive SuperHyperUnited Dominating; 2691
(v) : the strong δ-SuperHyperDefensive SuperHyperUnited Dominating; 2692

(vi) : the connected δ-SuperHyperDefensive SuperHyperUnited Dominating. 2693
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2694

independent SuperHyperSet is 2695
(iii) : the connected SuperHyperDefensive SuperHyperUnited Dominating; 2698
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2702

which is a SuperHyperUnited Dominating/SuperHyperPath. Then V is a maximal 2703
(i) : SuperHyperDefensive SuperHyperUnited Dominating; 2704
(ii) : strong SuperHyperDefensive SuperHyperUnited Dominating; 2705
(iii) : connected SuperHyperDefensive SuperHyperUnited Dominating; 2706
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperUnited Dominating; 2707
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperUnited Dominating; 2708
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperUnited Dominating; 2709
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2710
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2711

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2712
(i) : dual SuperHyperDefensive SuperHyperUnited Dominating; 2713
(ii) : strong dual SuperHyperDefensive SuperHyperUnited Dominating; 2714
(iii) : connected dual SuperHyperDefensive SuperHyperUnited Dominating; 2715
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperUnited Dominating; 2716
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperUnited Dominating; 2717
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperUnited Dominating; 2718

which is a SuperHyperUnited Dominating/SuperHyperPath. Then the number of 2721
(i) : the SuperHyperUnited Dominating; 2722

(ii) : the SuperHyperUnited Dominating; 2723
(iii) : the connected SuperHyperUnited Dominating; 2724
(iv) : the O(ESHG)-SuperHyperUnited Dominating; 2725
(v) : the strong O(ESHG)-SuperHyperUnited Dominating; 2726
(vi) : the connected O(ESHG)-SuperHyperUnited Dominating. 2727
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2728
coincide. 2729

which is a SuperHyperWheel. Then the number of 2731
(i) : the dual SuperHyperUnited Dominating; 2732
(ii) : the dual SuperHyperUnited Dominating; 2733
(iii) : the dual connected SuperHyperUnited Dominating; 2734
(iv) : the dual O(ESHG)-SuperHyperUnited Dominating; 2735
(v) : the strong dual O(ESHG)-SuperHyperUnited Dominating; 2736
(vi) : the connected dual O(ESHG)-SuperHyperUnited Dominating. 2737
coincide. 2739
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2741

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2742
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2743
is a 2744
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperUnited Dominating; 2748
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperUnited Dominating; 2749
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperUnited Dominating. 2750

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2753
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2754
SuperHyperPart is a 2755

(iv) : δ-SuperHyperDefensive SuperHyperUnited Dominating; 2759
(v) : strong δ-SuperHyperDefensive SuperHyperUnited Dominating; 2760
(vi) : connected δ-SuperHyperDefensive SuperHyperUnited Dominating. 2761

SuperHyperMultipartite. Then Then the number of 2764
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2771
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2772
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2774
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2775
(iv) : SuperHyperUnited Dominating; 2779
(v) : strong 1-SuperHyperDefensive SuperHyperUnited Dominating; 2780
(vi) : connected 1-SuperHyperDefensive SuperHyperUnited Dominating. 2781
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2782
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2783
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2784
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2785

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

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

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

2 + 1)-SuperHyperDefensive SuperHyperUnited Dominating. 2792
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2793
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2794
dual 2795
(iv) : 0-SuperHyperDefensive SuperHyperUnited Dominating; 2799
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2802
perComplete. Then there’s no independent SuperHyperSet. 2803
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2804
perUnited Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) and 2805
the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2806
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnited Dominating; 2810
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnited Dominating; 2811
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnited Dominating. 2812
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2813
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2814
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2815
t>
2
setting of a dual 2816



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2823
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2824
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2825
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2826
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2827
SuperHyperDefensive SuperHyperUnited Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2828
(i) v ∈ Ns (x); 2829
(ii) vx ∈ E. 2830
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2831
SuperHyperDefensive SuperHyperUnited Dominating, then 2832
(i) S is SuperHyperUnited Dominating set; 2833
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2834
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2835
(i) Γ ≤ O; 2836
(ii) Γs ≤ On . 2837
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2838
connected. Then 2839
(i) Γ ≤ O − 1; 2840
(ii) Γs ≤ On − Σ3i=1 σi (x). 2841
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2842
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperUnited 2843

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

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2849
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperUnited Dominating; 2850
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2851
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2852
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2853
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperUnited Dominating. Then 2855
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperUnited 2856

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

Dominating; 2864
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2866
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2867
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2869
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperUnited Dominating; 2870
(ii) Γ = 1; 2871
(iii) Γs = Σ3i=1 σi (c); 2872
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperUnited Dominating. 2873
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2874
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2875
SuperHyperDefensive SuperHyperUnited Dominating; 2876
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2877
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2878
i=1

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

b n c+1 ; 2885
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperUnited 2886
Dominating. 2887
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2888
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperUnited Dominating; 2889
(ii) Γ = b n2 c; 2890

bnc ; 2891
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHy- 2892
perUnited Dominating. 2893
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2894

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

Dominating for N SHF; 2897
(ii) Γ = m for N SHF : (V, E); 2898
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2899
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperUnited 2900
Dominating for N SHF : (V, E). 2901
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2902

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2903
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHyperUnited 2904
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2906

b n c+1 for N SHF : (V, E); 2907
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperUnited Dominating for 2908
N SHF : (V, E). 2909

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2911
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperUnited Dominating 2912
for N SHF : (V, E); 2913
(ii) Γ = b n2 c for N SHF : (V, E); 2914

bnc for N SHF : (V, E); 2915
S={vi }i=1
bnc
2
are only dual maximal SuperHyperUnited Dominating for 2916
N SHF : (V, E). 2917
following statements hold; 2919
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2920

SuperHyperUnited Dominating, then S is an s-SuperHyperDefensive SuperHyperUnited Dominating; 2921
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2922
SuperHyperUnited Dominating, then S is a dual s-SuperHyperDefensive SuperHyperUnited 2923

Dominating. 2924
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2927

SuperHyperUnited Dominating, then S is an s-SuperHyperPowerful SuperHyperUnited Dominating; 2928

SuperHyperUnited Dominating, then S is a dual s-SuperHyperPowerful SuperHyperUnited 2930
Dominating. 2931
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2932

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

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

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

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

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

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

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

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


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

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


SuperHyperGraph which is SuperHyperUnited Dominating. Then following statements hold; 2973
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperUnited 2974
Dominating; 2975
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2976

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

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

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

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


CHAPTER 13 2992
Extreme Applications in Cancer’s 2993
Extreme Recognition 2994
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2995
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2996
as the consequences of the model, some parameters are used. The cells are under attack of this 2997
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2998
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2999
In the following, some Extreme steps are Extreme devised on this disease. 3000
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3001
function. 3002
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3003
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3004
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3008
what’s done. 3009
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3010
they’ve got the names, and some general Extreme models. The moves and the Extreme 3011
traces of the cancer on the complex tracks and between complicated groups of cells could be 3012
fantasized by an Extreme SuperHyperPath(-/SuperHyperUnited Dominating, SuperHyperStar, 3013
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 3014
either the Extreme SuperHyperUnited Dominating or the Extreme SuperHyperUnited Dominating 3015
in those Extreme Extreme SuperHyperModels. 3016
137
CHAPTER 14 3017
Case 1: The Initial Extreme Steps 3018
Toward Extreme SuperHyperBipartite 3019
as Extreme SuperHyperModel 3020
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperBipartite 3021
is Extreme highlighted and Extreme featured. 3022
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperBipartite 3023
is obtained. 3024
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3025
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperUnited Dominating 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperUnited 3027
Dominating. 3028

CHAPTER 15 3029
Case 2: The Increasing Extreme Steps 3030
Toward Extreme 3031
SuperHyperMultipartite as Extreme 3032
SuperHyperModel 3033
Step 4. (Extreme Solution) In the Extreme Figure (36.1), the Extreme SuperHyperMultipart- 3034
ite is Extreme highlighted and Extreme featured. 3035
By using the Extreme Figure (36.1) and the Table (36.1), the Extreme SuperHyperMulti- 3036
partite is obtained. 3037
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3038
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

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

ESHM : (V, E), in the Extreme SuperHyperModel (36.1), is the Extreme SuperHy- 3040

CHAPTER 16 3042
Wondering Open Problems But As The 3043
Directions To Forming The Motivations 3044
In what follows, some “problems” and some “questions” are proposed. 3045
The SuperHyperUnited Dominating and the Extreme SuperHyperUnited Dominating are defined on a 3046
real-world application, titled “Cancer’s Recognitions”. 3047
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3048
recognitions? 3049
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperUnited Dominating and 3050
the Extreme SuperHyperUnited Dominating? 3051
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3052
them? 3053
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperUnited 3054
and the Extreme SuperHyperUnited Dominating?
Dominating 3055
Problem 16.0.5. The SuperHyperUnited Dominating and the Extreme SuperHyperUnited Dominating do a 3056
SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperUnited Dominating, 3057
are there else? 3058
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3059
Numbers types-results? 3060
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3061
the multiple types of SuperHyperNotions? 3062
143
CHAPTER 17 3063
Conclusion and Closing Remarks 3064
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3065
research are illustrated. Some benefits and some advantages of this research are highlighted. 3066
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3067
In this endeavor, two SuperHyperNotions are defined on the SuperHyperUnited Dominating. For 3068
that sake in the second definition, the main definition of the Extreme SuperHyperGraph is 3069
redefined on the position of the alphabets. Based on the new definition for the Extreme 3070
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperUnited Dominating, finds the 3071
convenient background to implement some results based on that. Some SuperHyperClasses 3072
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 3073
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 3074
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 3075
SuperHyperUnited Dominating, the new SuperHyperClasses and SuperHyperClasses, are introduced. 3076
Some general results are gathered in the section on the SuperHyperUnited Dominating and the 3077
Extreme SuperHyperUnited Dominating. The clarifications, instances and literature reviews have 3078
taken the whole way through. In this research, the literature reviews have fulfilled the lines 3079
containing the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph 3080
are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of 3081
this research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 3082
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 3083
based on the connectivities of the moves of the cancer in the longest and strongest styles with 3084
the formation of the design and the architecture are formally called “ SuperHyperUnited Dominating” 3085
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 3086
embedded styles to figure out the background for the SuperHyperNotions. In the Table (38.1), 3087
benefits and avenues for this research are, figured out, pointed out and spoken out. 3088
145
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperUnited Dominating
3. Extreme SuperHyperUnited Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3089
Extreme SuperHyperDuality But As The 3090
Super Forms 3092
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3093

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

Va ∈ Ei , Ej ; 3097
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3098
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3099
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3100
Vi , Vj ∈ Ea ; 3101
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3102
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3103
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3104
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3105

SuperHyperDuality. 3106
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3107

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3112
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3113
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3114
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3115
Extreme SuperHyperDuality; 3116
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3117

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3118
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3119
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3120
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3121
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3122
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3123

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3124
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3125
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3126
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3127
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3128
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3130
coefficient; 3131
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3132

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

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3155
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3156
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3157
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3158
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3159

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3160

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3168
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3169
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3170
Extreme coefficient. 3171
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3172
mentioned Extreme Figures in every Extreme items. 3173
• On the Figure (31.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3174
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3175
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3176
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3177
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3178
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3179
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3180
C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.
• On the Figure (31.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3182
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3183
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3184
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3185
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3186
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3187
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3188


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

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

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

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

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

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


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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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


3 × 3z 2 .



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

(1 × 1 × 2)z.


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

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



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

C(N SHG)Extreme SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Extreme R-SuperHyperDuality
= {ViEXT ERN AL }i=1 3

.
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .
Proof. Let 3232
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3236
(32.1), is the SuperHyperDuality. 3239
C(N SHG)Extreme SuperHyperDuality =

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


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

SuperHyperModel (32.2), is the Extreme SuperHyperDuality. 3248
C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z.
C(N SHG)Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 3250
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .



ESHS : (V, E), in the Extreme SuperHyperModel (32.3), is the Extreme SuperHyperDuality. 3258
C(N SHG)Extreme Quasi-SuperHyperDuality

= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
X
=( (min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |)choose|Pi ESHG:(V,E) |)
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
= {ViEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality
Proof. Let 3260
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 3263
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3264
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3265
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3266
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3267
representative in the 3268
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite ESHB : 3269

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (32.4), is the Extreme SuperHyperDuality. 3277
Then 3279

i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3280
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3281


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3285
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3286
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperDuality. 3298
Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3299
C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
Extreme Cardinality
|z.
C(N SHG)Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.

Proof. Let 3300
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Extreme Cardinality +1
ESHG:(V,E) Extreme Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperWheel ESHW : 3301

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

∃!Ez∗ ∈ EESHG:(V,E)
∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 3306
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3307
Extreme SuperHyperDuality. 3313

CHAPTER 19 3314
Extreme SuperHyperJoin But As The 3315
Super Forms 3317
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3318

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3329
|Vj |Extreme CARDINALITY ; 3330
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3331
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3332
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3333

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3337
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3338
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3339
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3341
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3342

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3349
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3350
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3351
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3352
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3353
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3354
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3355
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3356

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3372
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3373
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3375
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3376
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3377

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3380

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

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3388
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3391
• On the Figure (31.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3394
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3395
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3396
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3397

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

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

is up. The Extreme Algorithm is Extremely straightforward. 3410


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

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

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

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

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

4 × 5 × 5z 3 .

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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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

3 × 3z 2 .




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

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

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

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

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


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

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

C(N SHG)Extreme SuperHyperJoin =

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

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

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. 3456
(32.1), is the SuperHyperJoin. 3459

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


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

SuperHyperModel (32.2), is the Extreme SuperHyperJoin. 3468
C(N SHG)Extreme Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme Quasi-SuperHyperJoin SuperHyperPolynomial
C(N SHG)Extreme R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.
Proof. Let 3470



ESHS : (V, E), in the Extreme SuperHyperModel (32.3), is the Extreme SuperHyperJoin. 3478
C(N SHG)Extreme Quasi-SuperHyperJoin

= (PERFECT MATCHING).
{Ei ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3480
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3484
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3485
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3486
SuperHyperPart could have one SuperHyperVertex as the representative in the 3487
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3488

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (32.4), is the Extreme SuperHyperJoin. 3496
Then 3498

i

= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3499
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperMultipartite ESHM : 3500


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3505
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperJoin. 3516

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

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

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

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

CHAPTER 20 3531
Extreme SuperHyperPerfect But As The 3532
Super Forms 3534
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3535

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3547
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3548

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3552
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3553
Extreme SuperHyperPerfect; 3557
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3558

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3565
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3566
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3571
coefficient; 3572
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3573

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3609
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3610
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3611
Extreme coefficient. 3612
• On the Figure (31.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3615
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3616
SuperHyperPerfect. 3622
C(N SHG)Extreme SuperHyperPerfect = {E4 }.

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


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

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

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

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

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

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


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

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

3 × 4 × 4z 3 .

3 × 2z 2 .

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


3 × 3z 2 .



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

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


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

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



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

C(N SHG)Extreme SuperHyperPerfect =

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

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

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3677
(32.1), is the SuperHyperPerfect. 3680
C(N SHG)Extreme SuperHyperPerfect =

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


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

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (32.3), is the Extreme SuperHyperPerfect. 3699
C(N SHG)Extreme Quasi-SuperHyperPerfect

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3701
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 3705
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3706
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3707
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite ESHB : 3710

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

Then 3720

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3721
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperMultipartite 3722



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3725
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3726
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3727
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperPerfect. 3739
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

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


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

CHAPTER 21 3755
Extreme SuperHyperTotal But As The 3756
Super Forms 3758
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3759
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3762
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3763

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3769
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3770

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3774
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3778
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3779

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3794
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3796
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3797
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3798
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3800
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3801

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3802
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3805
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3806
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3807

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3814
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3815
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3818
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3819
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3820
coefficient; 3821
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3822

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3825
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3826
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3827
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3829
• On the Figure (31.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3832
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3833
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3834
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3835
SuperHyperTotal. 3839
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

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



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

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

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

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

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

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

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

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

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

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

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





4 × 3z 3 .

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

2 × 4 × 3z 4 .

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


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


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

|E | −2
= {Ei }i=1ESHG:(V,E) Extreme Cardinality .
C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Extreme Cardinality −2 .
C(N SHG)Extreme R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Extreme Cardinality .
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z |EESHG:(V,E) |Extreme Cardinality −2

Proof. Let 3890
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3894
(32.1), is the SuperHyperTotal. 3897
C(N SHG)Extreme SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Extreme Cardinality .
= (|EESHG:(V,E) |Extreme Cardinality − 1)
z |EESHG:(V,E) |Extreme Cardinality −2 .
C(N SHG)Extreme R-SuperHyperTotal
|E |Extreme Cardinality −2
= {ViEXT ERN AL }i=1ESHG:(V,E) .
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z |EESHG:(V,E) |Extreme Cardinality −2
Proof. Let 3899
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Extreme Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1


SuperHyperModel (32.2), is the Extreme SuperHyperTotal. 3906
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

= |i(i − 1) | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.
Proof. Let 3908
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

ESHS : (V, E), in the Extreme SuperHyperModel (32.3), is the Extreme SuperHyperTotal. 3916

C(N SHG)Extreme SuperHyperTotal

= {Ea ∈ EPi ESHG:(V,E) ,
i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
= {VaEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3918
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (32.4), is the Extreme SuperHyperTotal. 3934
Then 3936

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3937
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 3938



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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperTotal. 3954
∗
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)| Extreme Cardinality
|z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.
Proof. Let 3956
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 3957



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

CHAPTER 22 3970
Extreme SuperHyperConnected But As 3971
The Extensions Excerpt From Dense And 3972
Super Forms 3973
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3974

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3988
SuperHyperConnected. 3989
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3990
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3993

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4007
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4008
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4009
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4010
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4011
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4012
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4013
corresponded to its Extreme coefficient; 4014
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4015


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

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

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

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

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

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

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

corresponded to its Extreme coefficient. 4054
• On the Figure (31.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 4057
nected, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 4058

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

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


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

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

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

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

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

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

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

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

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

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

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme SuperHyperConnected = {E1 , E2 }.

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

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



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

4 × 3z 3 .

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

2 × 4 × 3z 4 .


C(N SHG)Extreme R-Quasi-SuperHyperConnected = {Vi+2i=011 }.


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

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

C(N SHG)Extreme Quasi-SuperHyperConnected =

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

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4119
(32.1), is the SuperHyperConnected. 4122
C(N SHG)Extreme Quasi-SuperHyperConnected =

−2
= {Ei }i=1 .
= (|EESHG:(V,E) |Extreme Cardinality − 1)
z Cardinality .
C(N SHG)Extreme R-Quasi-SuperHyperConnected

.
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z ESHG:(V,E) Extreme Cardinality
Proof. Let 4124
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1 .

SuperHyperModel (32.2), is the Extreme SuperHyperConnected. 4131
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |EESHG:(V,E) |Extreme Cardinality z.
C(N SHG)Extreme R-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 4133



ESHS : (V, E), in the Extreme SuperHyperModel (32.3), is the Extreme SuperHyperConnected. 4141
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 4143
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4152

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4153
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (32.4), is the Extreme SuperHyperConnected. 4160
Then 4162
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 4163
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4164


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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperConnected. 4181
∗
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Extreme Cardinality |z.
C(N SHG)Extreme V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 4183
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 4184



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4187
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4188
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4189
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4190
some representatives. The latter is straightforward. 4191
Extreme SuperHyperConnected. 4196

CHAPTER 23 4197
Background 4198
entitled “Current Trends in Mass Communication (CTMC)” with ISO abbreviation “J Curr 4206
Trends Comp Sci Res” in volume 2 and issue 1 with pages 32-55. 4207
217














See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 4380
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 4381
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 4382
HG269; HG270; HG271] alongside scientific research books at [HG60b; HG61b; HG62b; 4402


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

Bibliography 4418
HG11s [1] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4419
As Hyper Tool On Super Toot”, Current Trends in Mass Communication 2(1) (2023) 4420
32-55. (https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition- 4421
of-cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf) 4422

10.33140/JMTCM.01.03.09) 4443
223
10.20944/preprints202301.0282.v1). 4459
10.20944/preprints202301.0267.v1). 4462
(doi: 10.20944/preprints202301.0265.v1). 4467
prints202301.0262.v1). 4471
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4477

prints202301.0105.v1). 4480

Preprints 2023, 2023010044 4486

10.20944/preprints202301.0043.v1). 4489

(doi: 10.20944/preprints202212.0549.v1). 4498
(doi: 10.20944/preprints202212.0500.v1). 4505
odo.8017246). 4514
10.5281/zenodo.8020128). 4517
odo.7978571). 4520
10.5281/zenodo.7978857). 4523

10.5281/zenodo.7940830). 4526
10.5281/zenodo.7943578). 4529
odo.7916595). 4532
odo.7923632). 4535
(doi: 10.5281/zenodo.7904698). 4538
2023, (doi: 10.5281/zenodo.7904671). 4541
10.5281/zenodo.7871026). 4550
2023, (doi: 10.5281/zenodo.7874647). 4553
10.5281/zenodo.7857856). 4556
2023, (doi: 10.5281/zenodo.7857841). 4559

10.5281/zenodo.7853867). 4568
10.5281/zenodo.7853922). 4571
(doi: 10.5281/zenodo.7851519). 4574
(doi: 10.5281/zenodo.7851550). 4577
10.5281/zenodo.7834229). 4586
10.5281/zenodo.7834261). 4589
10.5281/zenodo.7824560). 4592
(doi: 10.5281/zenodo.7824623). 4595

2023, (doi: 10.5281/zenodo.7809365). 4606
2023, (doi: 10.5281/zenodo.7809358). 4609

10.5281/zenodo.7809219). 4612
10.5281/zenodo.7809328). 4615
2023, (doi: 10.5281/zenodo.7806767). 4618

2023, (doi: 10.5281/zenodo.7806838). 4621
10.5281/zenodo.7799902). 4630
(doi: 10.5281/zenodo.7804218). 4633
(doi: 10.5281/zenodo.7796334). 4636

10.5281/zenodo.7791952). 4642
10.5281/zenodo.7791982). 4645
10.5281/zenodo.7790026). 4648
10.5281/zenodo.7790052). 4651
2023, (doi: 10.5281/zenodo.7787066). 4654
10.5281/zenodo.7781476). 4660
10.5281/zenodo.7783082). 4663
10.5281/zenodo.7777857). 4666
10.5281/zenodo.7779286). 4669
(doi: 10.5281/zenodo.7771831). 4672
2023, (doi: 10.5281/zenodo.7772468). 4675
10.13140/RG.2.2.20913.25446). 4678

odo.7764916). 4681
10.13140/RG.2.2.11770.98247). 4684
10.13140/RG.2.2.12400.12808). 4687
2023, (doi: 10.13140/RG.2.2.22545.10089). 4690
10.13140/RG.2.2.11377.76644). 4696
10.13140/RG.2.2.23750.96329). 4699
10.13140/RG.2.2.31366.24641). 4702
10.13140/RG.2.2.34721.68960). 4705
2023, (doi: 10.13140/RG.2.2.30212.81289). 4708
10.13140/RG.2.2.24288.35842). 4714
10.13140/RG.2.2.32467.25124). 4717

10.13140/RG.2.2.31025.45925). 4720
10.13140/RG.2.2.17184.25602). 4723
10.13140/RG.2.2.23423.28327). 4726
10.13140/RG.2.2.28456.44805). 4729
10.13140/RG.2.2.23525.68320). 4732
10.13140/RG.2.2.20170.24000). 4735
10.13140/RG.2.2.36475.59683). 4738
10.13140/RG.2.2.29764.71046). 4741
2023, (doi: 10.13140/RG.2.2.18780.87683). 4744
10.13140/RG.2.2.26134.01603). 4750
10.13140/RG.2.2.27392.30721). 4753
10.13140/RG.2.2.33028.40321). 4756

10.13140/RG.2.2.21389.20966). 4759
10.13140/RG.2.2.16356.04489). 4762
10.13140/RG.2.2.21756.21129). 4765
10.13140/RG.2.2.30983.68009). 4768
10.13140/RG.2.2.28552.29445). 4771
(doi: 10.13140/RG.2.2.10936.21761). 4774
10.13140/RG.2.2.35105.89447). 4777
(doi: 10.13140/RG.2.2.30072.72960). 4780
10.13140/RG.2.2.31147.52003). 4783
10.13140/RG.2.2.32825.24163). 4786
10.13140/RG.2.2.13059.58401). 4789
10.13140/RG.2.2.11172.14720). 4792
2023, (doi: 10.13140/RG.2.2.22011.80165). 4795

ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4798
2023, (doi: 10.13140/RG.2.2.10493.84962). 4801
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4804
2023, (doi: 10.13140/RG.2.2.19944.14086). 4807
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4810
(doi: 10.13140/RG.2.2.33103.76968). 4813
(doi: 10.13140/RG.2.2.23037.44003). 4816
(doi: 10.13140/RG.2.2.35646.56641). 4819
10.13140/RG.2.2.18030.48967). 4822
(doi: 10.13140/RG.2.2.13973.81121). 4825
2023, (doi: 10.13140/RG.2.2.34106.47047). 4828
2023, (doi: 10.13140/RG.2.2.31956.88961). 4834

2023, (doi: 10.13140/RG.2.2.15179.67361). 4837
10.13140/RG.2.2.21510.45125). 4840
2023, (doi: 10.13140/RG.2.2.13121.84321). 4843
10.13140/RG.2.2.11758.69441). 4846
2023, (doi: 10.13140/RG.2.2.31891.35367). 4849
10.13140/RG.2.2.19360.87048). 4852
10.13140/RG.2.2.32363.21286). 4855
10.13140/RG.2.2.23266.81602). 4858
10.13140/RG.2.2.19911.37285). 4861
10.13140/RG.2.2.11050.90569). 4864
2023, (doi: 10.13140/RG.2.2.17761.79206). 4867
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4873

(doi: 10.13140/RG.2.2.30182.50241). 4876
2023, (doi: 10.13140/RG.2.2.17252.24968). 4909


2023010396 (doi: 10.20944/preprints202301.0396.v1). 4918

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




2023,(doi: 10.13140/RG.2.2.36745.93289). 4935
10.20944/preprints202301.0282.v1). 4942
10.20944/preprints202301.0267.v1).). 4945
(doi: 10.20944/preprints202301.0265.v1). 4950

prints202301.0262.v1). 4954

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

10.13140/RG.2.2.35061.65767). 4963

10.13140/RG.2.2.18494.15680). 4967
10.13140/RG.2.2.32530.73922). 4971

10.13140/RG.2.2.15897.70243). 4975
10.13140/RG.2.2.32530.73922). 4979

prints202301.0105.v1). 4982
10.13140/RG.2.2.23172.19849). 4989

10.13140/RG.2.2.17385.36968). 4999
Preprints 2023, 2023010044 5002
10.20944/preprints202301.0043.v1). 5005
2023, (doi: 10.13140/RG.2.2.28945.92007). 5008
10.13140/RG.2.2.35774.77123). 5014

10.13140/RG.2.2.29430.88642). 5020
(doi: 10.20944/preprints202212.0549.v1). 5026

10.13140/RG.2.2.19380.94084). 5029
(doi: 10.20944/preprints202212.0500.v1). 5040
10.13140/RG.2.2.20993.12640). 5043


10.13140/RG.2.2.29173.86244). 5058

10.5281/zenodo.8020181). 5063
10.5281/zenodo.7978921). 5065

odo.7943878). 5067
10.5281/zenodo.7943871). 5069
10.5281/zenodo.7923786). 5071
2023 (doi: 10.5281/zenodo.7905287). 5073

2023 (doi: 10.5281/zenodo.7874677). 5077
(doi: 10.5281/zenodo.7857906). 5079
2023 (doi: 10.5281/zenodo.7856329). 5081
10.5281/zenodo.7854561). 5083
2023 (doi: 10.5281/zenodo.7851893). 5085

(doi: 10.5281/zenodo.7835063). 5089
(doi: 10.5281/zenodo.7826705). 5091
2023 (doi: 10.5281/zenodo.7820680). 5093
10.5281/zenodo.7812750). 5095


2023 (doi: 10.5281/zenodo.7807782). 5101

2023 (doi: 10.5281/zenodo.7804449). 5103

(doi: 10.5281/zenodo.7792307). 5107
(doi: 10.5281/zenodo.7790728). 5109
2023 (doi: 10.5281/zenodo.7787712). 5111
10.5281/zenodo.7783791). 5113
10.5281/zenodo.7780123). 5115
(doi: 10.5281/zenodo.7773119). 5117
odo.7637762). 5119
10.5281/zenodo.7766174). 5121
10.5281/zenodo.7762232). 5123
(doi: 10.5281/zenodo.7758601). 5125
10.5281/zenodo.7754661). 5127
10.5281/zenodo.7750995) . 5129
(doi: 10.5281/zenodo.7749875). 5131
10.5281/zenodo.7747236). 5133
10.5281/zenodo.7742587). 5135
(doi: 10.5281/zenodo.7738635). 5137

10.5281/zenodo.7734719). 5139
10.5281/zenodo.7730484). 5141
(doi: 10.5281/zenodo.7730469). 5143
10.5281/zenodo.7722865). 5145
odo.7713563). 5147
odo.7709116). 5149
10.5281/zenodo.7706415). 5151
10.5281/zenodo.7706063). 5153
10.5281/zenodo.7701906). 5155
odo.7700205). 5157
10.5281/zenodo.7694876). 5159
10.5281/zenodo.7679410). 5161
10.5281/zenodo.7675982). 5163
10.5281/zenodo.7672388). 5165
odo.7668648). 5167
10.5281/zenodo.7662810). 5169
10.5281/zenodo.7659162). 5171
odo.7653233). 5173

odo.7653204). 5175
odo.7653142). 5177
odo.7653117). 5179
odo.7651687). 5182
odo.7651619). 5184
odo.7651439). 5186
odo.7650729). 5188
odo.7647868). 5190
odo.7647017). 5192
odo.7644894). 5194
odo.7632923). 5197
odo.7623459). 5199
10.5281/zenodo.7606416). 5201
10.5281/zenodo.7606416). 5203
odo.7606404). 5205
10.5281/zenodo.7580018). 5207

odo.7580018). 5209
odo.7580018). 5211
odo.7579929). 5213
10.5281/zenodo.7563170). 5215
odo.7563164). 5217
odo.7563160). 5219
odo.7563160). 5221
10.5281/zenodo.7563160). 5223
10.5281/zenodo.7557063). 5225
10.5281/zenodo.7557009). 5227
10.5281/zenodo.7539484). 5229
10.5281/zenodo.7523390). 5231
10.5281/zenodo.7523390). 5233
10.5281/zenodo.7523390). 5235
odo.7574952). 5237
10.5281/zenodo.7574992). 5239
odo.7523357). 5241
10.5281/zenodo.7523357). 5243

10.5281/zenodo.7504782). 5245
10.5281/zenodo.7504782). 5247
10.5281/zenodo.7504782). 5249
10.5281/zenodo.7499395). 5251
odo.7499395). 5253
10.5281/zenodo.7499395). 5255
10.5281/zenodo.7497450). 5257
10.5281/zenodo.7497450). 5259
10.5281/zenodo.7494862). 5261
odo.7494862). 5263
10.5281/zenodo.7494862). 5265
10.5281/zenodo.7493845). 5267
odo.7493845). 5269
10.5281/zenodo.7493845). 5271
odo.7539484). 5273
odo.7523390). 5275
odo.7523357). 5277
odo.7504782). 5279

odo.7499395). 5281
odo.7497450). 5283
odo.7494862). 5285
odo.7493845). 5287
odo.7480110). 5289
odo.7378758). 5291
odo.6320305). 5293
odo.6677173). 5295

CHAPTER 24 5296
ABSTRACT 5297
247
CHAPTER 25 5298
Cancer In Neutrosophic 5299
SuperHyperGraph 5300
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5301
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5302
disease is considered and as the consequences of the model, some parameters are used. The cells 5303
are under attack of this disease but the moves of the cancer in the special region are the matter 5304
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5305
treatments for this Neutrosophic disease. 5306
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5307
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5308
term Neutrosophic function. 5309
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5310
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5311
move from the cancer is identified by this research. Sometimes the move of the cancer 5312
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5313
about the moves and the effects of the cancer on that region; this event leads us to 5314
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5315
perception on what’s happened and what’s done. 5316
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5317
known and they’ve got the names, and some general Neutrosophic models. The moves 5318
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5319
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5320
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5321
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5322
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5323
Models. 5324
Some cells have been faced with some attacks from the situation which is caused by the 5325
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5326
which in that, the cells could be labelled as some groups and some groups or individuals have 5327
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5328
the embedded situations, the individuals of cells and the groups of cells could be considered 5329
249
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5330
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5331
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5332
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5333
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5334
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5335
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5336
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5337
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5338
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5339
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5340
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5341
out what’s going on this phenomenon. The special case of this disease is considered and as the 5342
consequences of the model, some parameters are used. The cells are under attack of this disease 5343
but the moves of the cancer in the special region are the matter of mind. The recognition of 5344
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5345
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5346
both bases are the background of this research. Sometimes the cancer has been happened on the 5347
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5348
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5349
in the forms of alliances’ styles with the formation of the design and the architecture are 5350
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5351
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5352
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5353
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5354
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5355
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5356
names, and some general models. The moves and the traces of the cancer on the complex tracks 5360
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5361
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5362
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5363
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5364
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5365
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5366
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5367
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5368
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5369
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5371
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5372
Question 25.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5374

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5378
Then the research has taken more motivations to define SuperHyperClasses and to find some 5379
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5380
some instances and examples to make clarifications about the framework of this research. The 5381
general results and some results about some connections are some avenues to make key point of 5382
this research, “Cancer’s Recognition”, more understandable and more clear. 5383
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5384
research on the modeling of the regions where are under the attacks of the cancer to 5385
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5386
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5387
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5388
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5389

instances and literature reviews have taken the whole way through. In this scientific research, 5390
the literature reviews have fulfilled the lines containing the notions and the results. The 5391
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5392
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5393
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5394
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5395
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5396
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5397
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5398
to figure out the background for the SuperHyperNotions. 5399

CHAPTER 26 5400
Neutrosophic United Dominating 5401
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5402
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5403
2023, (doi: 10.13140/RG.2.2.34953.52320). 5404

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5405
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5406
(doi: 10.13140/RG.2.2.33275.80161). 5407
10.13140/RG.2.2.11050.90569). 5410
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5411
10.13140/RG.2.2.17761.79206). 5413
10.13140/RG.2.2.19911.37285). 5416
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5417
10.13140/RG.2.2.23266.81602). 5419
10.13140/RG.2.2.19360.87048). 5422
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5423
10.13140/RG.2.2.32363.21286). 5425
10.13140/RG.2.2.11758.69441). 5428
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5429
10.13140/RG.2.2.31891.35367). 5431
10.13140/RG.2.2.21510.45125). 5434
253
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5435
10.13140/RG.2.2.13121.84321). 5437

CHAPTER 27 5438
New Ideas In Recognition of Cancer And 5439
Neutrosophic SuperHyperGraph By 5440
United Dominating As Hyper Ultra On 5441
Super Units 5442
255
CHAPTER 28 5443
ABSTRACT 5444
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperUnited 5445

Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a United Dominating pair 5446
S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5447
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperUnited Dominating 5448
if the following expression is called Neutrosophic e-SuperHyperUnited Dominating criteria holds 5449

Neutrosophic re-SuperHyperUnited Dominating if the following expression is called Neutrosophic 5450
e-SuperHyperUnited Dominating criteria holds 5451

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

SuperHyperUnited Dominating if the following expression is called Neutrosophic v-SuperHyperUnited 5453
Dominating criteria holds 5454
∀Va , ∃Vb0 ∈ ∪zi=1 Vi0 , : ∃Vc ∈ Vb0 , ∃Ed ∈ EN SHG , ∈ Va , Vc ∈ Ed

Neutrosophic rv-SuperHyperUnited Dominating if the following expression is called Neutrosophic 5455

v-SuperHyperUnited Dominating criteria holds 5456

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5457
HyperUnited Dominating if it’s either of Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic 5458
re-SuperHyperUnited Dominating, Neutrosophic v-SuperHyperUnited Dominating, and Neutrosophic 5459
rv-SuperHyperUnited Dominating. ((Neutrosophic) SuperHyperUnited Dominating). Assume a Neutro- 5460
sophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 5461
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperUnited Dominating 5462
257

Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5465
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 5466
Extreme SuperHyperVertices such that they form the Extreme SuperHyperUnited Dominating; a 5468
Neutrosophic SuperHyperUnited Dominating if it’s either of Neutrosophic e-SuperHyperUnited Dominat- 5469

ing, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic v-SuperHyperUnited Dominating, and 5470
Neutrosophic rv-SuperHyperUnited Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph 5471
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 5472
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 5473
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5474
SuperHyperUnited Dominating; an Extreme SuperHyperUnited Dominating SuperHyperPolynomial if it’s 5475

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolyno- 5478
mial contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 5479
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5480
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5488
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an 5491
Extreme V-SuperHyperUnited Dominating if it’s either of Neutrosophic e-SuperHyperUnited Domin- 5492
ating, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic v-SuperHyperUnited Dominating, 5493

and Neutrosophic rv-SuperHyperUnited Dominating and C(N SHG) for an Extreme SuperHyper- 5494
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5495
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Ex- 5496
treme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5497
they form the Extreme SuperHyperUnited Dominating; a Neutrosophic V-SuperHyperUnited Dominating 5498
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 5501
Dominating; an Extreme V-SuperHyperUnited Dominating SuperHyperPolynomial if it’s either of Neut- 5505
rosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic 5506
v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited Dominating and C(N SHG) 5507
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 5508

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

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 5518
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this 5521
scientific research, new setting is introduced for new SuperHyperNotions, namely, a Supe- 5522
rHyperUnited Dominating and Neutrosophic SuperHyperUnited Dominating. Two different types of 5523
SuperHyperDefinitions are debut for them but the research goes further and the SuperHy- 5524
perNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and 5525
well-reviewed. The literature review is implemented in the whole of this research. For shining 5526
the elegancy and the significancy of this research, the comparison between this SuperHyperNo- 5527
tion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The 5528
definitions are followed by the examples and the instances thus the clarifications are driven with 5529
different tools. The applications are figured out to make sense about the theoretical aspect of this 5530
ongoing research. The “Cancer’s Recognition” are the under research to figure out the challenges 5531
make sense about ongoing and upcoming research. The special case is up. The cells are viewed 5532
in the deemed ways. There are different types of them. Some of them are individuals and some 5533
of them are well-modeled by the group of cells. These types are all officially called “SuperHy- 5534
perVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks 5535
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research 5536
avenues to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed 5538
to pursue this research. It’s also officially collected in the form of some questions and some prob- 5539
lems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperUnited 5540
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 5541
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5544
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperUnited Dominating is a max- 5545
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5546
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5547
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5548
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 5549
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5550

δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperUnited 5551
Dominating . Since there’s more ways to get type-results to make a SuperHyperUnited Dominating 5552
more understandable. For the sake of having Neutrosophic SuperHyperUnited Dominating, there’s 5553
a need to “redefine” the notion of a “SuperHyperUnited Dominating ”. The SuperHyperVertices 5554

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 5555
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 5556
SuperHyperUnited Dominating . It’s redefined a Neutrosophic SuperHyperUnited Dominating if the 5557
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 5558
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 5559
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 5560
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The max- 5561
imum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its 5562
Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To 5563
get structural examples and instances, I’m going to introduce the next SuperHyperClass of 5564
SuperHyperGraph based on a SuperHyperUnited Dominating . It’s the main. It’ll be disciplinary to 5565
have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need 5566
to have all SuperHyperUnited Dominating until the SuperHyperUnited Dominating, then it’s officially 5567
called a “SuperHyperUnited Dominating” but otherwise, it isn’t a SuperHyperUnited Dominating . There 5568
are some instances about the clarifications for the main definition titled a “SuperHyperUnited 5569
Dominating ”. These two examples get more scrutiny and discernment since there are characterized 5570
in the disciplinary ways of the SuperHyperClass based on a SuperHyperUnited Dominating . For 5571
the sake of having a Neutrosophic SuperHyperUnited Dominating, there’s a need to “redefine” the 5572
notion of a “Neutrosophic SuperHyperUnited Dominating” and a “Neutrosophic SuperHyperUnited 5573

Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from 5574
the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 5575
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 5576
SuperHyperGraph” if the intended Table holds. And a SuperHyperUnited Dominating are redefined 5577
to a “Neutrosophic SuperHyperUnited Dominating” if the intended Table holds. It’s useful to define 5578
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 5579
type-results to make a Neutrosophic SuperHyperUnited Dominating more understandable. Assume 5580
intended Table holds. Thus SuperHyperPath, SuperHyperUnited Dominating, SuperHyperStar, 5582
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5583
SuperHyperPath”, “Neutrosophic SuperHyperUnited Dominating”, “Neutrosophic SuperHyperStar”, 5584
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutro- 5585

sophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 5586
SuperHyperUnited Dominating” where it’s the strongest [the maximum Neutrosophic value from all 5587
the SuperHyperUnited Dominating amid the maximum value amid all SuperHyperVertices from 5588
a SuperHyperUnited Dominating .] SuperHyperUnited Dominating . A graph is a SuperHyperUniform 5589
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5590
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 5591
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5592
with two exceptions; it’s SuperHyperUnited Dominating if it’s only one SuperVertex as intersection 5593
amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 5594
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 5595
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 5596
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 5597
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 5598
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 5599
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 5600

with any common SuperVertex. The SuperHyperModel proposes the specific designs and 5601
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 5602
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 5603
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 5604
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 5605
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 5606
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 5607
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 5608
Recognition” and the results and the definitions will be introduced in redeemed ways. The 5609
recognition of the cancer in the long-term function. The specific region has been assigned 5610
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 5611
to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5615
cancer on the complex tracks and between complicated groups of cells could be fantasized 5618
by a Neutrosophic SuperHyperPath(-/SuperHyperUnited Dominating, SuperHyperStar, SuperHy- 5619

perBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5620
longest SuperHyperUnited Dominating or the strongest SuperHyperUnited Dominating in those Neutro- 5621
sophic SuperHyperModels. For the longest SuperHyperUnited Dominating, called SuperHyperUnited 5622
Dominating, and the strongest SuperHyperUnited Dominating, called Neutrosophic SuperHyperUnited 5623
Dominating, some general results are introduced. Beyond that in SuperHyperStar, all possible 5624
SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to 5625
SuperHyperUnited Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity 5628
with Neutrosophic SuperHyperUnited Dominating theory, SuperHyperGraphs, and Neutrosophic 5629
SuperHyperGraphs theory are proposed. 5630
Keywords: Neutrosophic SuperHyperGraph, SuperHyperUnited Dominating, Cancer’s Neutro- 5631
sophic Recognition 5632

CHAPTER 29 5634
Applied Notions Under The Scrutiny Of 5635
The Motivation Of This Scientific 5636
Research 5637
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5638
try to bring the motivations in the narrative ways. Some cells have been faced with some 5639
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5640
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5641
as some groups and some groups or individuals have excessive labels which all are raised from 5642
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5643
of cells and the groups of cells could be considered as “new groups”. Thus it motivates 5644
us to find the proper SuperHyperModels for getting more proper analysis on this messy 5645
story. I’ve found the SuperHyperModels which are officially called “SuperHyperGraphs” and 5646
“Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells 5647
are defined as “SuperHyperVertices” and the relations between the individuals of cells and 5648
the groups of cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us 5649
to do research on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, 5650
the situations get worst. The situation is passed from the certainty and precise style. Thus 5651
it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5652
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5653
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5654
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5655
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5656
out what’s going on this phenomenon. The special case of this disease is considered and as the 5657
consequences of the model, some parameters are used. The cells are under attack of this disease 5658
but the moves of the cancer in the special region are the matter of mind. The recognition of 5659
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5660
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5661
both bases are the background of this research. Sometimes the cancer has been happened on the 5662
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5663
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5664
in the forms of alliances’ styles with the formation of the design and the architecture are 5665
formally called “ SuperHyperUnited Dominating” in the themes of jargons and buzzwords. The 5666
263
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5667
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5668
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5669
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5670
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5671

names, and some general models. The moves and the traces of the cancer on the complex tracks 5675
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5676
(-/SuperHyperUnited Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5677
SuperHyperWheel). The aim is to find either the optimal SuperHyperUnited Dominating or the 5678
Neutrosophic SuperHyperUnited Dominating in those Neutrosophic SuperHyperModels. Some 5679

general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5680
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5681
SuperHyperUnited Dominating. It, literarily, deforms and it doesn’t form. 5684
amount of SuperHyperUnited Dominating” of either individual of cells or the groups of cells based on 5686
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperUnited Dominating” 5687
Question 29.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5689
these messy and dense SuperHyperModels where embedded notions are illustrated? 5690
Thus it motivates us to define different types of “ SuperHyperUnited Dominating” and “Neutrosophic 5692
SuperHyperUnited Dominating” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5693

Then the research has taken more motivations to define SuperHyperClasses and to find some 5694
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5695
some instances and examples to make clarifications about the framework of this research. The 5696
general results and some results about some connections are some avenues to make key point of 5697
this research, “Cancer’s Recognition”, more understandable and more clear. 5698
The framework of this research is as follows. In the beginning, I introduce basic definitions 5699
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5700
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5701
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5702
review literature are applied to make sense about what’s going to figure out about the upcoming 5703
sections. The main definitions and their clarifications alongside some results about new notions, 5704
SuperHyperUnited Dominating and Neutrosophic SuperHyperUnited Dominating, are figured out in 5705
sections “ SuperHyperUnited Dominating” and “Neutrosophic SuperHyperUnited Dominating”. In the 5706
sense of tackling on getting results and in United Dominating to make sense about continuing the 5707
research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced 5708
and as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5709
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5710
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5711

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5712
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5713
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5714
and as concluding and closing section of theoretical research are contained in the section 5715
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 5716
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 5717
Results”, “ SuperHyperUnited Dominating”, “Neutrosophic SuperHyperUnited Dominating”, “Results 5718

on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5719
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5720
this research and going to figure out the word “best” as the description and adjective for this 5721
research as presented in section, “ SuperHyperUnited Dominating”. The keyword of this research 5722
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5723
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5724
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5725
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5726
research in the terms of “questions” and “problems” to make sense to figure out this research in 5727
featured style. The advantages and the limitations of this research alongside about what’s done 5728
in this research to make sense and to get sense about what’s figured out are included in the 5729
section, “Conclusion and Closing Remarks”. 5730

CHAPTER 30 5731
Neutrosophic Preliminaries Of This 5732
Scientific Research On the Redeemed 5733
Ways 5734
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5735
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5736

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5737
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5738
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5739
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5740
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5741
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5742

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

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

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

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 30.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG11s],Definition 5747
2.5,p.2). 5748
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5749
S = (V, E), where 5750
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 5751
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 5754
0
1, 2, . . . , n ); 5755
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5756
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5757

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



SuperEdge; 5780
If we choose different types of binary operations, then we could get hugely diverse types of 5783
general forms of Neutrosophic SuperHyperGraph (NSHG). 5784
Definition 30.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 5785

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5786
x, y, z, w ∈ [0, 1]: 5787
(i) 1 ⊗ x = x; 5788
(ii) x ⊗ y = y ⊗ x; 5789
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5790
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5791

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

where 5794

1, 2, . . . , n0 ); 5799
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5800
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5801
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5802
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5803
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5815
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5816
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5817
SuperEdge; 5823
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5826
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5827
makes the patterns and regularities. 5828
Definition 30.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5829
of elements of SuperHyperEdges are the same. 5830

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5831
makes to have SuperHyperUniform more understandable. 5832
Definition 30.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5833
Classes as follows. 5834
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5835
two given SuperHyperEdges with two exceptions; 5836
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5837
SuperHyperEdges; 5838
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5839
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5840
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5841
in common; 5842
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5843
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5844
SuperHyperEdge in common; 5845
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5846
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5847
SuperVertex. 5848
Definition 30.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 5849
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5850
(i) Vi , Vi+1 ∈ Ei0 ; 5851
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5852
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5853
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5854
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5855
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5856
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5857
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5858
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 30.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 5860
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5861
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5862
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5863
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5864
perPath . 5865
Definition 30.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG11s],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 5866
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5867
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5868
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5869
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5870
Definition 30.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5871

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5884
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5885

to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5886
Definition 30.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperUnited Dominating). 5887

(i) Neutrosophic e-SuperHyperUnited Dominating if the following expression is called 5891

Neutrosophic e-SuperHyperUnited Dominating criteria holds 5892

(ii) Neutrosophic re-SuperHyperUnited Dominating if the following expression is called 5893

Neutrosophic re-SuperHyperUnited Dominating criteria holds 5894

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 5895
(iii) Neutrosophic v-SuperHyperUnited Dominating if the following expression is called 5896

(iv) Neutrosophic rv-SuperHyperUnited Dominating if the following expression is called 5898


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 5900
(v) Neutrosophic SuperHyperUnited Dominating if it’s either of Neutrosophic e- 5901

SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, Neutrosophic 5902
v-SuperHyperUnited Dominating, and Neutrosophic rv-SuperHyperUnited Dominating. 5903
Definition 30.0.19. ((Neutrosophic) SuperHyperUnited Dominating). 5904


(i) an Extreme SuperHyperUnited Dominating if it’s either of Neutrosophic e- 5907

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHy- 5911
perEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 5912
(ii) a Neutrosophic SuperHyperUnited Dominating if it’s either of Neutrosophic e- 5914

SuperHyperVertices such that they form the Neutrosophic SuperHyperUnited Dominating; 5920
(iii) an Extreme SuperHyperUnited Dominating SuperHyperPolynomial if it’s either of 5921

Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, 5922
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 5926
(iv) a Neutrosophic SuperHyperUnited Dominating SuperHyperPolynomial if it’s either 5930


SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5936
is corresponded to its Neutrosophic coefficient; 5939
(v) an Extreme V-SuperHyperUnited Dominating if it’s either of Neutrosophic e- 5940

(vi) a Neutrosophic V-SuperHyperUnited Dominating if it’s either of Neutrosophic e- 5947


for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 5950

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet 5951
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperUnited 5953
Dominating; 5954
(vii) an Extreme V-SuperHyperUnited Dominating SuperHyperPolynomial if it’s either 5955

of Neutrosophic e-SuperHyperUnited Dominating, Neutrosophic re-SuperHyperUnited Dominating, 5956
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 5960
(viii) a Neutrosophic SuperHyperUnited Dominating SuperHyperPolynomial if it’s either 5964


is corresponded to its Neutrosophic coefficient. 5973
Definition 30.0.20. ((Extreme/Neutrosophic)δ−SuperHyperUnited Dominating). 5974

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

perUnited Dominating such that either of the following expressions hold for the Neutrosophic 5977
cardinalities of SuperHyperNeighbors of s ∈ S : 5978
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (30.1), holds if S is an δ−SuperHyperOffensive. And the Expression 5979
(30.1), holds if S is an δ−SuperHyperDefensive; 5980
(ii) a Neutrosophic δ−SuperHyperUnited Dominating is a Neutrosophic kind of Neutrosophic 5981
SuperHyperUnited Dominating such that either of the following Neutrosophic expressions hold 5982
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5983
|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 (30.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 5984
the Expression (30.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5985


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

136TBL4
For the sake of having a Neutrosophic SuperHyperUnited Dominating, there’s a need to 5986
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and 5987
the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 5988
It’s redefined Neutrosophic SuperHyperGraph if the Table (30.1) holds. 5991
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5992
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5993
There are some Neutrosophic SuperHyperClasses if the Table (30.2) holds. Thus Neut- 5995
rosophic SuperHyperPath , SuperHyperUnited Dominating, SuperHyperStar, SuperHyperBipart- 5996
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5997
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5998
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5999

perHyperWheel if the Table (30.2) holds. 6000
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperUnited Dominating. 6001

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperUnited Dominating 6002
more Neutrosophicly understandable. 6003
For the sake of having a Neutrosophic SuperHyperUnited Dominating, there’s a need to “redefine” 6004
the Neutrosophic notion of “Neutrosophic SuperHyperUnited Dominating”. The SuperHyperVertices 6005
136DEF1 Definition 30.0.23. Assume a SuperHyperUnited Dominating. It’s redefined a Neutrosophic 6008
SuperHyperUnited Dominating if the Table (30.3) holds. 6009


136TBL1

CHAPTER 31 6010
Neutrosophic SuperHyper But As United Dominating 6011
Super Forms 6013
Definition 31.0.1. (Neutrosophic event). 6014
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6015
is a probability United Dominating. Any Neutrosophic k-subset of A of V is called Neutrosophic 6016
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 6017
following expression is called Neutrosophic probability of A. 6018
X
E(A) = E(a). (31.1)
a∈A
Definition 31.0.2. (Neutrosophic Independent). 6019

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

s-independent if the following expression is called Neutrosophic s-independent criteria 6022
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Neutrosophic k-events of A and B is called Neutrosophic independent. 6023
The following expression is called Neutrosophic independent criteria 6024
E(A ∩ B) = P (A)P (B). (31.2)
Definition 31.0.3. (Neutrosophic Variable). 6025

is a probability United Dominating. Any k-function United Dominating like E is called Neutrosophic 6027
k-Variable. If k = 2, then any 2-function United Dominating like E is called Neutrosophic 6028
Variable. 6029
The notion of independent on Neutrosophic Variable is likewise. 6030
Definition 31.0.4. (Neutrosophic Expectation). 6031
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6032
279
a probability United Dominating. A Neutrosophic k-Variable E has a number is called Neutrosophic 6033
Expectation if the following expression is called Neutrosophic Expectation criteria 6034
X
Ex(E) = E(α)P (α).
α∈V
Definition 31.0.5. (Neutrosophic Crossing). 6035

is a probability United Dominating. A Neutrosophic number is called Neutrosophic Crossing if 6037

the following expression is called Neutrosophic Crossing criteria 6038
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 31.0.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6039
Consider S = (V, E) is a probability United Dominating. Let m and n propose special United Dominating. 6040
Then with m ≥ 4n, 6041
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Neutrosophic

random k-subset of V obtained by choosing each SuperHyperVertex of G Neutrosophic
independently with probability United Dominating p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 6042
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
6043
Theorem 31.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6044
Consider S = (V, E) is a probability United Dominating. Let P be a SuperHyperSet of n points in the 6045
plane, and let l be the Neutrosophic number √ of SuperHyperLines in the plane passing through at 6046
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6047
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 6048

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

Consider S = (V, E) is a probability United Dominating. Let P be a SuperHyperSet of n points in 6055
the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 6056
k < 5n4/3 . 6057
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6058
S = (V, E) is a probability United Dominating. Draw a SuperHyperUnit SuperHyperCircle around 6059

each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 6060
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 6061
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6062
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6063
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6064
n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3
Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 6065

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6066
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6067
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6068
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6069
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6070
4/3 4/3
k < 4n + n < 5n . 6071
Proposition 31.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6072
Consider S = (V, E) is a probability United Dominating. Let X be a nonnegative Neutrosophic 6073
Variable and t a positive real number. Then 6074
E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality. 6075
Corollary 31.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6076
Consider S = (V, E) is a probability United Dominating. Let Xn be a nonnegative integer-valued 6077
variable in a probability United Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 6078

P (Xn = 0) → 1 as n → ∞. 6079
Proof. 6080
Consider S = (V, E) is a probability United Dominating. A special SuperHyperGraph in Gn,p almost 6082
surely has stability number at most d2p−1 log ne. 6083

S = (V, E) is a probability United Dominating. A special SuperHyperGraph in Gn,p is up. Let 6085
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 6086
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 6087
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 6088
of the Neutrosophic SuperHyperGraph G. 6089
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6090
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6091
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .
Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 6092
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6093
X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 6094
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6095
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!
Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 6096
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6097
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6098
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6099
Definition 31.0.12. (Neutrosophic Variance). 6100

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6101
a probability United Dominating. A Neutrosophic k-Variable E has a number is called Neutrosophic 6102
Variance if the following expression is called Neutrosophic Variance criteria 6103
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability United Dominating. Let X be a Neutrosophic Variable and let t 6105
be a positive real number. Then 6106
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability United Dominating. Let X be a Neutrosophic Variable and let t be a 6108
positive real number. Then 6109
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6110
Consider S = (V, E) is a probability United Dominating. Let Xn be a Neutrosophic Variable in a 6112

probability United Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 6113
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability United Dominating. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s 6115
Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6116
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6117
Consider S = (V, E) is a probability United Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6119
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 6120
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6121
S = (V, E) is a probability United Dominating. As in the proof of related Theorem, the result is 6123
Consider S = (V, E) is a probability United Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be as 6126
defined in previous Theorem. Then either: 6127
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6128
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6129
Definition 31.0.17. (Neutrosophic Threshold). 6132
is a probability United Dominating. Let P be a monotone property of SuperHyperGraphs (one which 6134
is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for P is a 6135
function f (n) such that: 6136
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6137
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6138

Definition 31.0.18. (Neutrosophic Balanced). 6139

is a probability United Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6141
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6142
SubSuperHyperGraph is called Neutrosophic Balanced. 6143
Consider S = (V, E) is a probability United Dominating. Let F be a nonempty balanced Neutrosophic 6145
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 6146
threshold function for the property of containing F as a Neutrosophic SubSuperHyperGraph. 6147
136EXM1 Example 31.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6150
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6151
• On the Figure (31.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6152

SuperHyperUnited Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6153
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6154

is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6155
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6156
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6157
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6158
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6159
Neutrosophic SuperHyperUnited Dominating. 6160
C(N SHG)Neutrosophic United Dominating =

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

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6164
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6165
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6166

Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6167
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6168
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperUnited Dominating. 6169

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

Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example (43.0.3) 136NSHG1
{}.
= 0z 0 .
{}.
= 0z 0 .
6170


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







{{E5 , E4 }, {E2 }}.
= z 2 + z.
{{V1 , V2 }, {V4 }}.
= z 2 + z.
6178


{}.
= 0z 0 .


{{V1 , V6 }, {V9 , V15 }}.

= 2z 2 .
6182


{{Ei }17 22
i=12 , {Ei }i=18 }.
= z6 + z5.
{{Vi }6i=1 , {Vi , V21 }10
i=7 }.
= z6 + z5.
6186



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


{}.
= 0z 0 .



{}.
= 0z 0 .
6194


{{E3i+1 }1i=0 {E3i+1 , E23 }3i=2 }.
= z3 + z2.
{{V3i+1 }1i=0 {V3i+1 , V11 }3i=2 }.
= z6 + z5.
6198







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


{}.


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


{}.
= 0z 0 .
{V1 , V2 , V3 }, {V7 , V8 }}.
= z3 + z2.
6210




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


{}.


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


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




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







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


{}.



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


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


= z4 + z2.
6238


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



{E2 }.
= z |E2 | .
{V1 }.
= z |V1 | .
6246


{{E3i+1 }1i=0 {E3i+1 }3i=2 }.


Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example (43.0.3) 95NHG1
= 2z 2 .
{{V2i+1 }1i=0 {V2i+1 }5i=2 }.
= z4 + z2.
6250
Proposition 31.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6251
The all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-United 6252
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6253
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6254
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6255
of them. 6256


Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example (43.0.3) 95NHG2
Proposition 31.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6257
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6258
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6259
Neutrosophic quasi-R-United Dominating minus all Neutrosophic SuperHypeNeighbor to some of 6260
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6261
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6262
quasi-R-United Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but not all 6263
of them. 6264
Proposition 31.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-United Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-United Dominating is at 6265
least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6266
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6267
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6268
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic United 6269
Dominating in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 6270
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6271
SuperHyperVertices are contained in a Neutrosophic R-United Dominating. 6272

Proposition 31.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-United Dominating has, the least Neutrosophic cardinality,
the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic cardinality
of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-United Dominating with the least Neutrosophic cardinality, the 6273
lower sharp Neutrosophic bound for cardinality. 6274
Proposition 31.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6275

(V, E). Then in the worst case, literally, 6276
C(N SHG)N eutrosophicQuasi−U nitedDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−U nitedDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−U nitedDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−U nitedDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-United Dominating. In other words, the least cardinality, the lower 6277
sharp bound for the cardinality, of a Neutrosophic type-result-United Dominating is the cardinality of 6278

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−U nitedDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−U nitedDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−U nitedDominatingSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-United Dominating since
neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more
than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us
consider the Neutrosophic SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic
SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

sometimes the Neutrosophic SuperHyperSet

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

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-United Dominating. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-United Dominating is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types
but the SuperHyperStable is only up in this quasi-R-United Dominating. It’s the contradiction to
that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-United Dominating decorates the Neutrosophic
SuperHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic
style implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutro-
sophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower
Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHyper-
Vertices have perfect Neutrosophic connections inside each of SuperHyperEdges and the outside
of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used
Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from the fact
that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the targeted
Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore, the Neut-
rosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk
about the Neutrosophic R-United Dominating. Since at least two Neutrosophic SuperHyperVertices
involve to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge but
at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of Neutrosophic
SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic SuperHyper-
Graph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to mention that the
word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic SuperHyperGraph,

induces there’s no Neutrosophic appearance of the loop Neutrosophic version of the Neutro-
sophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be loopless. The
Neutrosophic adjective “loop” on the basic Neutrosophic framework engages one Neutrosophic
SuperHyperVertex but it never happens in this Neutrosophic setting. With these Neutrosophic
bases, on a Neutrosophic SuperHyperGraph, there’s at least one Neutrosophic SuperHyperEdge
thus there’s at least a Neutrosophic R-United Dominating has the Neutrosophic cardinality of a
Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-United Dominating has the Neutrosophic
cardinality at least a Neutrosophic SuperHyperEdge. Assume a Neutrosophic SuperHyperSet
V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic R-United Dominating since
either the Neutrosophic SuperHyperGraph is an obvious Neutrosophic SuperHyperModel thus
it never happens since there’s no Neutrosophic usage of this Neutrosophic framework and even
more there’s no Neutrosophic connection inside or the Neutrosophic SuperHyperGraph isn’t
obvious and as its consequences, there’s a Neutrosophic contradiction with the term “Neutro-
sophic R-United Dominating” since the maximum Neutrosophic cardinality never happens for this
Neutrosophic style of the Neutrosophic SuperHyperSet and beyond that there’s no Neutrosophic
connection inside as mentioned in first Neutrosophic case in the forms of drawback for this
selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-United Dominating is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet
But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic
term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic
SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes
a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum
and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet

Has the maximum Neutrosophic cardinality such that
Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices
Is a Neutrosophic R-United Dominating for the Neutrosophic SuperHyperGraph as used Neutrosophic

background in the Neutrosophic terms of worst Neutrosophic case and the common theme of
the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses of the
Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-United Dominating.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
United Dominating. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-United Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-United Dominating but with
slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z

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

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

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

fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic United Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s not
unique. To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If a
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-United Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-United Dominating is 6281
at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutro- 6282
sophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In 6283
other words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6284
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic United 6285

Dominating in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 6286
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6287
SuperHyperVertices are contained in a Neutrosophic R-United Dominating. 6288
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6289
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6290
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6291
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6292
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6293
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6294
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6295
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6296
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6297

SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6298

Neutrosophic quasi-R-United Dominating where the Neutrosophic completion of the Neutrosophic 6299
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-United Dominating. The 6300
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6301
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHy- 6302
perCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6303
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6304

timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in 6305
the minimum Neutrosophic style of the embedded Neutrosophic R-United Dominating. The interior 6306
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6307
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6308
common connections, more precise and more formal, the perfect unique connections inside the 6309
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose 6310
the Neutrosophic R-United Dominating. Thus Neutrosophic exterior SuperHyperVertices could be 6311
used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6312
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6313
embedded Neutrosophic United Dominating, there’s the usage of exterior Neutrosophic SuperHyper- 6314
Vertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6315
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6316
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with 6317
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 6318
the Neutrosophic R-United Dominating. The Neutrosophic R-United Dominating with the exclusion of 6319
the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge 6320
and with other terms, the Neutrosophic R-United Dominating with the inclusion of all Neutrosophic 6321
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-United 6322

Dominating. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6323
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6324
the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of 6325
any given Neutrosophic quasi-R-United Dominating minus all Neutrosophic SuperHypeNeighbor 6326
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6327
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6328

an Neutrosophic quasi-R-United Dominating, minus all Neutrosophic SuperHypeNeighbor to some 6329
of them but not all of them. 6330
The main definition of the Neutrosophic R-United Dominating has two titles. a Neutrosophic quasi-R- 6331
United Dominating and its corresponded quasi-maximum Neutrosophic R-SuperHyperCardinality are 6332
two titles in the terms of quasi-R-styles. For any Neutrosophic number, there’s a Neutrosophic 6333
quasi-R-United Dominating with that quasi-maximum Neutrosophic SuperHyperCardinality in the 6334
terms of the embedded Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic 6335
SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the collec- 6336
tion of all the Neutrosophic quasi-R-United Dominatings for all Neutrosophic numbers less than its 6337
Neutrosophic corresponded maximum number. The essence of the Neutrosophic United Dominating 6338
ends up but this essence starts up in the terms of the Neutrosophic quasi-R-United Dominating, 6339
again and more in the operations of collecting all the Neutrosophic quasi-R-United Dominatings 6340
acted on the all possible used formations of the Neutrosophic SuperHyperGraph to achieve one 6341
Neutrosophic number. This Neutrosophic number is 6342
considered as the equivalence class for all corresponded quasi-R-United Dominatings. Let 6343

zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic United Dominating be a Neutro- 6344
sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic United Dominating. Then 6345
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic United Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic United Dominating is re-formalized 6346
and redefined as follows. 6347
GNeutrosophic United Dominating ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6348
definition for the Neutrosophic United Dominating. 6349
GNeutrosophic United Dominating =

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic United 6350
Dominating poses the upcoming expressions. 6351

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



= max zNeutrosophic Number

And then, 6353


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


6355

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

6356


6357



Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6358
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6359
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6360
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-United 6361
Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-United Dominating” since 6362
“Neutrosophic Quasi-United Dominating” happens “Neutrosophic United Dominating” in a Neutrosophic 6363
SuperHyperGraph as initial framework and background but “Neutrosophic SuperHyperNeigh- 6364

borhood” may not happens “Neutrosophic United Dominating” in a Neutrosophic SuperHyperGraph 6365
as initial framework and preliminarily background since there are some ambiguities about the 6366
Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Neut- 6367
rosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-United Dominating”, and “Neutrosophic 6368
United Dominating” are up. 6369
Thus, let 6370

zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6371
GNeutrosophic United Dominating be a Neutrosophic number, a Neutrosophic SuperHyperNeighbor- 6372
hood and a Neutrosophic United Dominating and the new terms are up. 6373
GNeutrosophic United Dominating ∈ ∪zNeutrosophic Number

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

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

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



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


6378

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6379


6380


Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior
Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-United Dominating if for
any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of
them.

To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming
up.
The following Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices is the simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-United Dominating.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-United Dominating. The

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-United Dominating C(ESHG) for an Neutrosophic SuperHyperGraph

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic United Dominating is related to the Neutrosophic SuperHyperSet of the Neutro-
sophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic United Dominating is up. The obvious simple
Neutrosophic type-SuperHyperSet called the Neutrosophic United Dominating is a Neutrosophic
SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the Neutrosophic
SuperHyperSet of Neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-United Dominating is up. To sum them
up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-United

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Dominating
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}

is an Neutrosophic R-United Dominating C(ESHG) for an Neutrosophic SuperHyperGraph

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices
instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic United
Dominating and it’s an Neutrosophic United Dominating. Since it’s
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic United Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-United Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic United

Dominating, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6381
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6382
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6383
type-SuperHyperSet called the 6384
“Neutrosophic R-United Dominating” 6385
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6386
Neutrosophic R-United Dominating, 6387
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable embed-
ded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets of
the Neutrosophic R-United Dominating amid those obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic United Dominating, are

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-United Dominating. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a Neutrosophic R-United Dominating is the cardinality of
6388
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6389
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-United Dominating if 6390
for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6391
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6392
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6393
them. 6394
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6395
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6396
r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6397
Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6398
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6399

SuperHyperVertices. Consider there’s a Neutrosophic R-United Dominating with the least cardin- 6400
ality, the lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected 6401
Neutrosophic SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the 6402
Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the 6403
Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6404
some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-United Dominating. 6405
Since it doesn’t have 6406
6407
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6408
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6409
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6410
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6411

SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-United 6412
Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6413
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6414
are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6415
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6416
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6417

Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6418
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6419
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious Neut- 6420
rosophic R-United Dominating, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet 6421
of the Neutrosophic R-United Dominating, VESHE , is a Neutrosophic SuperHyperSet, VESHE , 6422
includes only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs 6423

are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6424

ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6425
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6426
SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6427
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6428
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-United Dominating only 6429
contains all interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic SuperHy- 6430
perVertices from the unique Neutrosophic SuperHyperEdge where there’s any of them has all 6431
possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHyperNeigh- 6432
borhoods in with no exception minus all Neutrosophic SuperHypeNeighbors to some of them 6433
not all of them but everything is possible about Neutrosophic SuperHyperNeighborhoods and 6434
Neutrosophic SuperHyperNeighbors out. 6435
The SuperHyperNotion, namely, United Dominating, is up. There’s neither empty SuperHyperEdge 6436
nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic Su- 6437
perHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6438
Neutrosophic United Dominating. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6439

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic United Dominating C(ESHG) for an Neutrosophic SuperHyperGraph 6443
ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6444
6445
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6447
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6448

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6449
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6450
Neutrosophic United Dominating is up. The obvious simple Neutrosophic type-SuperHyperSet 6451
called the Neutrosophic United Dominating is a Neutrosophic SuperHyperSet includes only two 6452
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6453
SuperHyperEdges[SuperHyperVertices], 6454

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6455
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6456
United Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6457
SuperHyperEdges[SuperHyperVertices], 6458

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6459
United Dominating. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6460

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6464

given by that Neutrosophic type-SuperHyperSet called the Neutrosophic United Dominating and 6465
it’s an Neutrosophic United Dominating. Since it’s 6466
6467
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6469
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6470

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6471
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6472

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic United Dominating, 6474
not: 6475

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Is the Neutrosophic SuperHyperSet, not: 6476

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6477
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6478
Neutrosophic type-SuperHyperSet called the 6479
“Neutrosophic United Dominating ” 6480
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6481
Neutrosophic United Dominating , 6482
is only and only 6483

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

CHAPTER 32 6485
The Neutrosophic Departures on The 6486
Theoretical Results Toward Theoretical 6487
Motivations 6488
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6489
Neutrosophic SuperHyperClasses. 6490
Proposition 32.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6491

|E |
{{E3i+1 }1i=0 {E3i+1 }i=2ESHP }.
= z |EESHP |−1 + z 2 .
|V |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z VESHP |−1 + z 2 .
Proof. Let 6492
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6493
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
321
Figure 32.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6494

136EXM18a Example 32.0.2. In the Figure (32.1), the connected Neutrosophic SuperHyperPath ESHP : 6498
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6499
SuperHyperModel (32.1), is the SuperHyperUnited Dominating. 6500
Proposition 32.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6501

|E |
{{E3i+1 }1i=0 {E3i+1 }i=2ESHP }.
= z |EESHP |−1 + z 2 .

|V |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z VESHP |−1 + z 2 .
Proof. Let 6502
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6503
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 6504

136EXM19a Example 32.0.4. In the Figure (32.2), the connected Neutrosophic SuperHyperCycle N SHC : 6508
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6509
Neutrosophic SuperHyperModel (32.2), is the Neutrosophic SuperHyperUnited Dominating. 6510
Proposition 32.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6511

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

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

Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example (43.0.7) 136NSHG19a
Proof. Let 6512
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6513
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6514


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

Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example (43.0.9) 136NSHG20a
136EXM20a Example 32.0.6. In the Figure (32.3), the connected Neutrosophic SuperHyperStar ESHS : 6518
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6519
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6520
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (32.3), is 6521
the Neutrosophic SuperHyperUnited Dominating. 6522
Proposition 32.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6523
Then 6524

|P |
{{E3i+1 }1i=0 {E3i+1 }i=2
ESHP
}.
= z |PESHP |−1 + z 2 .
|P |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z PESHP |−1 + z 2 .
Proof. Let 6525
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6526
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6527

only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6533
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperUnited Dominating taken from a connected Neutrosophic SuperHyperBipartite 6535
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6536
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 32.0.8. In the Neutrosophic Figure (32.4), the connected Neutrosophic SuperHy- 6539
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6540
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6541
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6542
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (32.4), is the Neutrosophic 6543

Figure 32.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperUnited Dominating in the Example (43.0.11) 136NSHG21a
Proposition 32.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6545
Then 6546

|P |
{{E3i+1 }1i=0 {E3i+1 }i=2
ESHP
}.
= z |PESHP |−1 + z 2 .
|P |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z PESHP |−1 + z 2 .
Proof. Let 6547
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

6548
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperUnited Dominating taken from a connected Neutrosophic SuperHyperMulti- 6549

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

only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6555
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6557
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6558
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 32.0.10. In the Figure (32.5), the connected Neutrosophic SuperHyperMultipartite 6562
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6563
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6564
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6565
in the Neutrosophic SuperHyperModel (32.5), is the Neutrosophic SuperHyperUnited Dominating. 6566
Proposition 32.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6567
Then, 6568

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

|E |
{{E3i+1 }1i=0 {E3i+1 }i=2ESHP }.
= z |EESHP |−1 + z 2 .
|V |
{{V2i+1 }1i=0 {V2i+1 }i=2
ESHP
}.
= z VESHP |−1 + z 2 .
Proof. Let 6569
P :
CEN T ER, E2∗
6570
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperUnited Dominating taken from a connected Neutrosophic SuperHyperWheel 6571

Figure 32.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperUnited Dominating in the Neutrosophic Example (43.0.15) 136NSHG23a

Then there’s at least one SuperHyperUnited Dominating. Thus the notion of quasi isn’t up and 6575
the SuperHyperNotions based on SuperHyperUnited Dominating could be applied. The unique 6576
embedded SuperHyperUnited Dominating proposes some longest SuperHyperUnited Dominating excerpt 6577
from some representatives. The latter is straightforward. 6578
136EXM23a Example 32.0.12. In the Neutrosophic Figure (32.6), the connected Neutrosophic SuperHyper- 6579
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6580
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6581

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6582
SuperHyperModel (32.6), is the Neutrosophic SuperHyperUnited Dominating. 6583

CHAPTER 33 6584
The Surveys of Mathematical Sets On 6585
The Results But As The Initial Motivation 6586
For the SuperHyperUnited Dominating, Neutrosophic SuperHyperUnited Dominating, and the Neutro- 6587
sophic SuperHyperUnited Dominating, some general results are introduced. 6588
Remark 33.0.1. Let remind that the Neutrosophic SuperHyperUnited Dominating is “redefined” on 6589
the positions of the alphabets. 6590
Corollary 33.0.2. Assume Neutrosophic SuperHyperUnited Dominating. Then 6591
N eutrosophic SuperHyperU nitedDominating =

{theSuperHyperU nitedDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperU nitedDominating
|N eutrosophiccardinalityamidthoseSuperHyperU nitedDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6592
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6593
the neutrality, for i = 1, 2, 3, respectively. 6594
Corollary 33.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6595
the alphabet. Then the notion of Neutrosophic SuperHyperUnited Dominating and SuperHyperUnited 6596
Dominating coincide. 6597
Corollary 33.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6598
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6599
SuperHyperUnited Dominating if and only if it’s a SuperHyperUnited Dominating. 6600
Corollary 33.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6601
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperUnited 6602
Dominating if and only if it’s a longest SuperHyperUnited Dominating. 6603
Corollary 33.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 6604
same identical letter of the alphabet. Then its Neutrosophic SuperHyperUnited Dominating is its 6605
SuperHyperUnited Dominating and reversely. 6606
331
Corollary 33.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnited Dominating, Su- 6607

perHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6608
identical letter of the alphabet. Then its Neutrosophic SuperHyperUnited Dominating is its SuperHy- 6609
perUnited Dominating and reversely. 6610
Corollary 33.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6611
perUnited Dominating isn’t well-defined if and only if its SuperHyperUnited Dominating isn’t well-defined. 6612
Corollary 33.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6613
Neutrosophic SuperHyperUnited Dominating isn’t well-defined if and only if its SuperHyperUnited 6614
Dominating isn’t well-defined. 6615
Corollary 33.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnited Dominating, Supe- 6616

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neut- 6617
rosophic SuperHyperUnited Dominating isn’t well-defined if and only if its SuperHyperUnited Dominating 6618
isn’t well-defined. 6619
Corollary 33.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6620
perUnited Dominating is well-defined if and only if its SuperHyperUnited Dominating is well-defined. 6621
Corollary 33.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6622

Neutrosophic SuperHyperUnited Dominating is well-defined if and only if its SuperHyperUnited Dominating 6623
is well-defined. 6624
Corollary 33.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnited Dominating, Su- 6625

perHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6626
Neutrosophic SuperHyperUnited Dominating is well-defined if and only if its SuperHyperUnited Dominating 6627
is well-defined. 6628
Proposition 33.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6629
(i) : the dual SuperHyperDefensive SuperHyperUnited Dominating; 6630
(ii) : the strong dual SuperHyperDefensive SuperHyperUnited Dominating; 6631
(iii) : the connected dual SuperHyperDefensive SuperHyperUnited Dominating; 6632
(iv) : the δ-dual SuperHyperDefensive SuperHyperUnited Dominating; 6633
(v) : the strong δ-dual SuperHyperDefensive SuperHyperUnited Dominating; 6634
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperUnited Dominating. 6635
Proposition 33.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6636
(iii) : the connected defensive SuperHyperDefensive SuperHyperUnited Dominating; 6639

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

independent SuperHyperSet is 6644
(iii) : the connected SuperHyperDefensive SuperHyperUnited Dominating; 6647
Proposition 33.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6651

Graph which is a SuperHyperUnited Dominating/SuperHyperPath. Then V is a maximal 6652
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperUnited Dominating; 6656
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperUnited Dominating; 6657
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperUnited Dominating; 6658
Proposition 33.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6660

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6661
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperUnited Dominating; 6665
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperUnited Dominating; 6666
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperUnited Dominating; 6667

Graph which is a SuperHyperUnited Dominating/SuperHyperPath. Then the number of 6670
(i) : the SuperHyperUnited Dominating; 6671

(ii) : the SuperHyperUnited Dominating; 6672
(iii) : the connected SuperHyperUnited Dominating; 6673
(iv) : the O(ESHG)-SuperHyperUnited Dominating; 6674
(v) : the strong O(ESHG)-SuperHyperUnited Dominating; 6675
(vi) : the connected O(ESHG)-SuperHyperUnited Dominating. 6676
coincide. 6678

Graph which is a SuperHyperWheel. Then the number of 6680
(i) : the dual SuperHyperUnited Dominating; 6681
(ii) : the dual SuperHyperUnited Dominating; 6682
(iii) : the dual connected SuperHyperUnited Dominating; 6683
(iv) : the dual O(ESHG)-SuperHyperUnited Dominating; 6684
(v) : the strong dual O(ESHG)-SuperHyperUnited Dominating; 6685
(vi) : the connected dual O(ESHG)-SuperHyperUnited Dominating. 6686
coincide. 6688
Proposition 33.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6689
perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6690

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

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6701
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6702
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6703
SuperHyperPart is a 6704

(iv) : δ-SuperHyperDefensive SuperHyperUnited Dominating; 6708
(v) : strong δ-SuperHyperDefensive SuperHyperUnited Dominating; 6709
(vi) : connected δ-SuperHyperDefensive SuperHyperUnited Dominating. 6710

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6712
plete SuperHyperMultipartite. Then Then the number of 6713
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6720
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6721
Proposition 33.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6723
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6724
(iv) : SuperHyperUnited Dominating; 6728
Proposition 33.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6731
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6732
Proposition 33.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6733
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6734

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



Proposition 33.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6742
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6743
of dual 6744
(iv) : 0-SuperHyperDefensive SuperHyperUnited Dominating; 6748

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6752

SuperHyperUnited Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6754
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6755
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnited Dominating; 6759
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnited Dominating; 6760
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnited Dominating. 6761

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



Proposition 33.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6772
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6773
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6774
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6775
Proposition 33.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6776

a dual SuperHyperDefensive SuperHyperUnited Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 6777
(i) v ∈ Ns (x); 6778
(ii) vx ∈ E. 6779
Proposition 33.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6780

a dual SuperHyperDefensive SuperHyperUnited Dominating, then 6781
(i) S is SuperHyperUnited Dominating set; 6782
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6783
Proposition 33.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6784
(i) Γ ≤ O; 6785
(ii) Γs ≤ On . 6786
Proposition 33.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6787
connected. Then 6788
(i) Γ ≤ O − 1; 6789
(ii) Γs ≤ On − Σ3i=1 σi (x). 6790
Proposition 33.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6791

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

Proposition 33.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6798
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperUnited Dominating; 6799
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6800
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6801
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6802
Proposition 33.0.38. Let ESHG : (V, E) be an even SuperHyperUnited Dominating. Then 6804
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperUnited 6805

Dominating; 6806
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6807
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6808
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6809
Proposition 33.0.39. Let ESHG : (V, E) be an odd SuperHyperUnited Dominating. Then 6811

Dominating; 6813
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6815
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6816
Proposition 33.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6818
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperUnited Dominating; 6819
(ii) Γ = 1; 6820
(iii) Γs = Σ3i=1 σi (c); 6821
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperUnited Dominating. 6822
Proposition 33.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6823
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6824
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6826
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6827
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6828
Proposition 33.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6830
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperUnited 6831
Dominating; 6832
(ii) Γ = b n2 c + 1; 6833

b n c+1 ; 6834
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperUnited 6835
Dominating. 6836
Proposition 33.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6837
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperUnited Dominating; 6838
(ii) Γ = b n2 c; 6839

bnc ; 6840
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHy- 6841
Proposition 33.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6843

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

(ii) Γ = m for N SHF : (V, E); 6847
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6848
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperUnited 6849
Dominating for N SHF : (V, E). 6850
Proposition 33.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6851

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6852
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHyperUnited 6853
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6855

b n c+1 for N SHF : (V, E); 6856
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperUnited Dominating for 6857
N SHF : (V, E). 6858

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

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6860
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperUnited Dominating 6861
for N SHF : (V, E); 6862
(ii) Γ = b n2 c for N SHF : (V, E); 6863

bnc for N SHF : (V, E); 6864
S={vi }i=1
bnc
2
are only dual maximal SuperHyperUnited Dominating for 6865
N SHF : (V, E). 6866
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6869

SuperHyperUnited Dominating, then S is an s-SuperHyperDefensive SuperHyperUnited Dominating; 6870
SuperHyperUnited Dominating, then S is a dual s-SuperHyperDefensive SuperHyperUnited 6872

Dominating. 6873
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6876

SuperHyperUnited Dominating, then S is an s-SuperHyperPowerful SuperHyperUnited Dominating; 6877

SuperHyperUnited Dominating, then S is a dual s-SuperHyperPowerful SuperHyperUnited 6879
Dominating. 6880
Proposition 33.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6881

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperUnited 6923
Dominating; 6924
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6925

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

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

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

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


CHAPTER 34 6941
Neutrosophic Applications in Cancer’s 6942
Neutrosophic Recognition 6943
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6944
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6945
disease is considered and as the consequences of the model, some parameters are used. The cells 6946
are under attack of this disease but the moves of the cancer in the special region are the matter 6947
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6948
treatments for this Neutrosophic disease. 6949
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6950
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6951
term Neutrosophic function. 6952
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6953
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6954
move from the cancer is identified by this research. Sometimes the move of the cancer 6955
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 6956
about the moves and the effects of the cancer on that region; this event leads us to 6957
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6958
perception on what’s happened and what’s done. 6959
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6960
known and they’ve got the names, and some general Neutrosophic models. The moves 6961
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6962
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperUnited 6963
Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyper- 6964
Wheel). The aim is to find either the Neutrosophic SuperHyperUnited Dominating or the 6965
Neutrosophic SuperHyperUnited Dominating in those Neutrosophic Neutrosophic SuperHyper- 6966
Models. 6967
343
CHAPTER 35 6968
Case 1: The Initial Neutrosophic Steps 6969
Toward Neutrosophic 6970
SuperHyperBipartite as Neutrosophic 6971
SuperHyperModel 6972
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6973
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6974
Figure 35.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6975
perBipartite is obtained. 6976
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6977
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6978
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6979
(35.1), is the Neutrosophic SuperHyperUnited Dominating. 6980

CHAPTER 36 6981
Case 2: The Increasing Neutrosophic 6982
Steps Toward Neutrosophic 6983
SuperHyperMultipartite as 6984
Neutrosophic SuperHyperModel 6985
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (36.1), the Neutrosophic Super- 6986
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6987
By using the Neutrosophic Figure (36.1) and the Table (36.1), the Neutrosophic SuperHy- 6988
perMultipartite is obtained. 6989
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6990
Figure 36.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

347
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (36.1), is the 6992
Neutrosophic SuperHyperUnited Dominating. 6993

CHAPTER 37 6994
Wondering Open Problems But As The 6995
Directions To Forming The Motivations 6996
In what follows, some “problems” and some “questions” are proposed. 6997
The SuperHyperUnited Dominating and the Neutrosophic SuperHyperUnited Dominating are defined on 6998
a real-world application, titled “Cancer’s Recognitions”. 6999
Question 37.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7000
recognitions? 7001
Question 37.0.2. Are there some SuperHyperNotions related to SuperHyperUnited Dominating and 7002
the Neutrosophic SuperHyperUnited Dominating? 7003
Question 37.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7004
them? 7005
Question 37.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperUnited 7006
and the Neutrosophic SuperHyperUnited Dominating?
Dominating 7007
Problem 37.0.5. The SuperHyperUnited Dominating and the Neutrosophic SuperHyperUnited Dominating 7008
do a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperUnited 7009
Dominating, are there else? 7010
Problem 37.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7011
Numbers types-results? 7012
Problem 37.0.7. What’s the independent research based on Cancer’s recognitions concerning 7013
the multiple types of SuperHyperNotions? 7014
349
CHAPTER 38 7015
Conclusion and Closing Remarks 7016
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7017
research are illustrated. Some benefits and some advantages of this research are highlighted. 7018
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 7019
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperUnited Dominating. 7020
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 7021
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 7022
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperUnited Dominating, finds 7023
the convenient background to implement some results based on that. Some SuperHyperClasses 7024
and some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 7025
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 7026
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 7027
SuperHyperUnited Dominating, the new SuperHyperClasses and SuperHyperClasses, are introduced. 7028
Some general results are gathered in the section on the SuperHyperUnited Dominating and the 7029
Neutrosophic SuperHyperUnited Dominating. The clarifications, instances and literature reviews 7030
have taken the whole way through. In this research, the literature reviews have fulfilled the 7031
lines containing the notions and the results. The SuperHyperGraph and Neutrosophic Super- 7032
HyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are 7033
the background of this research. Sometimes the cancer has been happened on the region, full 7034
of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 7035
some SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 7036
and strongest styles with the formation of the design and the architecture are formally called “ 7037
SuperHyperUnited Dominating” in the themes of jargons and buzzwords. The prefix “SuperHyper” 7038
refers to the theme of the embedded styles to figure out the background for the SuperHyperNo- 7039
tions. In the Table (38.1), benefits and avenues for this research are, figured out, pointed out 7040
and spoken out. 7041
351
Table 38.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperUnited Dominating
3. Neutrosophic SuperHyperUnited Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 39 7042
Neutrosophic SuperHyperDuality But As 7043
Super Forms 7045
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7046

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

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

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

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

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7057
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7058

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7059
sophic rv-SuperHyperDuality. 7060
Definition 39.0.2. ((Neutrosophic) SuperHyperDuality). 7061

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7066
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7067
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7068
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7069
353
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7071

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7073
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7074
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7075
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7076
form the Neutrosophic SuperHyperDuality; 7077
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7078
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7079

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7080
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7081
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7082
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7083
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7085
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7087

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7089
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7090
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7091
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7092
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 7093
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7094
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7095
coefficient; 7096
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7097

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7099
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7100
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7101
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7102
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7104

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7105
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7106
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7107
that they form the Neutrosophic SuperHyperDuality; 7110
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7111

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7112
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7113

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7115
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7118
power is corresponded to its Extreme coefficient; 7119
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7120

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7122

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7128
coefficient. 7129
136EXM1 Example 39.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7130
the mentioned Neutrosophic Figures in every Neutrosophic items. 7131

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7133
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7134
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7135
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7136
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7137
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7138
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7139
C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.

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

E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7143
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7144
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7145
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7146
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7147

every given Neutrosophic SuperHyperDuality. 7148




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

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


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

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

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

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

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .

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


4 × 5 × 5z 3 .

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

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


4 × 5 × 5z 3 .

3 × 3z 2 .



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


3 × 3z 2 .





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



(1 × 1 × 2)z.


(2 × 2 × 2)z.

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

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







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

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

.
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 7192
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Neutrosophic Cardinality , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality .
3 3


SuperHyperModel (32.1), is the SuperHyperDuality. 7199
C(N SHG)Neutrosophic SuperHyperDuality =

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

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

Neutrosophic SuperHyperModel (32.2), is the Neutrosophic SuperHyperDuality. 7208
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.

Proof. Let 7210


the Neutrosophic SuperHyperDuality. 7219
Then 7221
C(N SHG)Neutrosophic Quasi-SuperHyperDuality

i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Neutrosophic Cardinality
Proof. Let 7222
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7228
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7231

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 39.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7241

(V, E). Then 7242

i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Proof. Let 7243
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7244


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7248
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7249
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

in the Neutrosophic SuperHyperModel (32.5), is the Neutrosophic SuperHyperDuality. 7261
Proposition 39.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7262
Then, 7263
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
|z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 7264
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Neutrosophic Cardinality +1
ESHG:(V,E) Neutrosophic Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperWheel 7265


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7270
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7271
SuperHyperModel (32.6), is the Neutrosophic SuperHyperDuality. 7277

CHAPTER 40 7278
Neutrosophic SuperHyperJoin But As 7279
Super Forms 7281
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7282

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7286
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7288

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

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7293

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7294
|Vj |NEUTROSOPHIC CARDINALITY ; 7295
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7296

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7297
rv-SuperHyperJoin. 7298
Definition 40.0.2. ((Neutrosophic) SuperHyperJoin). 7299

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

367

Extreme SuperHyperJoin; 7308
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7309

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7311
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7312
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7313
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7314
Neutrosophic SuperHyperJoin; 7315
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7316

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7317
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7318
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7323
coefficient; 7324
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7325

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7326
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7327
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7328
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7329
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7330

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7332
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7333
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7334

Extreme SuperHyperJoin; 7340
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7341

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7343
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7344
Neutrosophic SuperHyperJoin; 7347

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7348

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7350

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7355
its Extreme coefficient; 7356
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7357

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7359
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7360

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7361
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7362
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7365
coefficient. 7366
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7370

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7371

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

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


every given Neutrosophic SuperHyperJoin. 7385




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

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


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

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

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

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

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z 3 .

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


4 × 5 × 5z 3 .

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

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


4 × 5 × 5z 3 .

3 × 3z 2 .



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


3 × 3z 2 .





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



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


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

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

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




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



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

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

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


SuperHyperModel (32.1), is the SuperHyperJoin. 7436

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

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

Neutrosophic SuperHyperModel (32.2), is the Neutrosophic SuperHyperJoin. 7445
C(N SHG)Neutrosophic Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperJoin SuperHyperPolynomial
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.

Proof. Let 7447


the Neutrosophic SuperHyperJoin. 7456
Then 7458
C(N SHG)Neutrosophic Quasi-SuperHyperJoin

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.


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

X X
EXT ERN AL |
Proof. Let 7459
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 7465
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7467

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7478

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Proof. Let 7479
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7480


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

in the Neutrosophic SuperHyperModel (32.5), is the Neutrosophic SuperHyperJoin. 7496

Then, 7498

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

.
Proof. Let 7499
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7500


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7504
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7505
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7506
SuperHyperModel (32.6), is the Neutrosophic SuperHyperJoin. 7511

CHAPTER 41 7512
Neutrosophic SuperHyperPerfect But As 7513
Super Forms 7515
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7516

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7527
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7528

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7529
rv-SuperHyperPerfect. 7530
Definition 41.0.2. ((Neutrosophic) SuperHyperPerfect). 7531

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7536
381
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7541

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7543
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7544
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7545
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7546
form the Neutrosophic SuperHyperPerfect; 7547
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7548

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7549
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7550
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7553
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7557

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7559
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7562
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7565
coefficient; 7566
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7567

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7575
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7576
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7577
that they form the Neutrosophic SuperHyperPerfect; 7580
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7581

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7583

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7586
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7590

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7592

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7598
coefficient. 7599

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

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

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


every given Neutrosophic SuperHyperPerfect. 7618





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

SuperHyperModel (32.1), is the SuperHyperPerfect. 7669
C(N SHG)Neutrosophic SuperHyperPerfect =

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


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

Neutrosophic SuperHyperModel (32.2), is the Neutrosophic SuperHyperPerfect. 7678
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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



the Neutrosophic SuperHyperPerfect. 7689
Then 7691
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 7692
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 7696
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7697
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7698
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7701

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7712

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 7713
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperMultipartite 7714



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 7717
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 7718
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 7719
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

in the Neutrosophic SuperHyperModel (32.5), is the Neutrosophic SuperHyperPerfect. 7731
Then, 7733
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7735


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7738
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7739
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7740
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7741
SuperHyperModel (32.6), is the Neutrosophic SuperHyperPerfect. 7747

CHAPTER 42 7748
Neutrosophic SuperHyperTotal But As 7749
Super Forms 7751
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7752

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7756

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7759
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7760

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7763
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7764

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7765
rv-SuperHyperTotal. 7766
Definition 42.0.2. ((Neutrosophic) SuperHyperTotal). 7767

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7772
Extreme SuperHyperTotal; 7776
395
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7777

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7779
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7780
Neutrosophic SuperHyperTotal; 7783
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7784
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7785

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7786
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7791
coefficient; 7792
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7793
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7794

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7795
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7796
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7797
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7798
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7799
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7800
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7801
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7802

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

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7811
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7812
Neutrosophic SuperHyperTotal; 7815
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7816

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

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7823
its Extreme coefficient; 7824
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7825
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7826

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7827
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7828
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7829
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7830
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7831
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7832
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7833

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

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

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


every given Neutrosophic SuperHyperTotal. 7852




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

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


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

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

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




3 × 4 × 4z 3 .


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


3 × 4 × 4z 3 .

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



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









4 × 3z 3 .


4 × 3z 4 .


2 × 4 × 3z 4 .



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


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

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

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


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

C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2
Proof. Let 7896
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

SuperHyperModel (32.1), is the SuperHyperTotal. 7903
C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2

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

Neutrosophic SuperHyperModel (32.2), is the Neutrosophic SuperHyperTotal. 7912
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.
Proof. Let 7914


the Neutrosophic SuperHyperTotal. 7923
Then 7925
C(N SHG)Neutrosophic SuperHyperTotal

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 7926
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7932
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7934

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7945

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 7946
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7947


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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

in the Neutrosophic SuperHyperModel (32.5), is the Neutrosophic SuperHyperTotal. 7963
Then, 7965
∗
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality
|z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.

Proof. Let 7966
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7967


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7971
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7972
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7973
SuperHyperModel (32.6), is the Neutrosophic SuperHyperTotal. 7979

CHAPTER 43 7980
Neutrosophic SuperHyperConnected But 7981
As The Extensions Excerpt From Dense 7982
And Super Forms 7983
Definition 43.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7984

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7988
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7989
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7990

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7991
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7992
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7993

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

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7996
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7997
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7998
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7999
rosophic rv-SuperHyperConnected. 8000
Definition 43.0.2. ((Neutrosophic) SuperHyperConnected). 8001

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

8004
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8005
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8006
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 8007
409
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 8008
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 8009
form the Extreme SuperHyperConnected; 8010
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8011

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8012
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8013

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8017
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8018
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8019

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8020
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8021
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8027

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8028
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8029
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8030
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8031
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8032
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8033

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8034
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8035
Neutrosophic coefficient; 8036
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8037

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8039
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8043
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8044

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8046
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8047
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8048
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8050

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8051

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8054
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8055

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8060

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8063
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8064
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8065
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8066

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8067
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8068
Neutrosophic coefficient. 8069
• On the Figure (31.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8072
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8073
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8075
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8076

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8077
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8078
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8079
C(N SHG)Neutrosophic SuperHyperConnected = {E4 }.

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

every given Neutrosophic SuperHyperConnected. 8087


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

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

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

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


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

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

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

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

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

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


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



4 × 3z 3 .

4 × 3z 4 .


2 × 4 × 3z 4 .

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


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

= 3 × 6z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

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

SuperHyperModel (32.1), is the SuperHyperConnected. 8138
C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

|EESHG:(V,E) |
−2
= {Ei }i=1 .
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected

.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 8140
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

Neutrosophic SuperHyperModel (32.2), is the Neutrosophic SuperHyperConnected. 8147
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |EESHG:(V,E) |Neutrosophic Cardinality z.
C(N SHG)Neutrosophic R-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 8149



the Neutrosophic SuperHyperConnected. 8158
Then 8160
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Neutrosophic V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8161
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 8166
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8167
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8170

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8181
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Neutrosophic V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8182
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8183


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

in the Neutrosophic SuperHyperModel (32.5), is the Neutrosophic SuperHyperConnected. 8200
Then, 8202
∗
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 8203
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8204


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8207
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8208
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8209
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8210
some representatives. The latter is straightforward. 8211
SuperHyperModel (32.6), is the Neutrosophic SuperHyperConnected. 8216

CHAPTER 44 8217
Background 8218
entitled “Current Trends in Mass Communication (CTMC)” with ISO abbreviation “J Curr 8226
Trends Comp Sci Res” in volume 1 and issue 1 with pages 37-60. 8227
423














See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 8400
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 8401
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 8402
HG269; HG270; HG271] alongside scientific research books at [HG60b; HG61b; HG62b; 8422


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

Bibliography 8438
HG11s [1] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8439
As Hyper Tool On Super Toot”, Current Trends in Mass Communication 1(1) (2023) 8440
37-60. 8441
10.33140/JMTCM.01.03.09) 8462
429
10.20944/preprints202301.0282.v1). 8478
10.20944/preprints202301.0267.v1). 8481
(doi: 10.20944/preprints202301.0265.v1). 8486
prints202301.0262.v1). 8490
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8496

prints202301.0105.v1). 8499

Preprints 2023, 2023010044 8505

10.20944/preprints202301.0043.v1). 8508

(doi: 10.20944/preprints202212.0549.v1). 8517
(doi: 10.20944/preprints202212.0500.v1). 8524
odo.8017246). 8533
10.5281/zenodo.8020128). 8536
odo.7978571). 8539
10.5281/zenodo.7978857). 8542

10.5281/zenodo.7940830). 8545
10.5281/zenodo.7943578). 8548
odo.7916595). 8551
odo.7923632). 8554
(doi: 10.5281/zenodo.7904698). 8557
2023, (doi: 10.5281/zenodo.7904671). 8560
10.5281/zenodo.7871026). 8569
2023, (doi: 10.5281/zenodo.7874647). 8572
10.5281/zenodo.7857856). 8575
2023, (doi: 10.5281/zenodo.7857841). 8578

10.5281/zenodo.7853867). 8587
10.5281/zenodo.7853922). 8590
(doi: 10.5281/zenodo.7851519). 8593
(doi: 10.5281/zenodo.7851550). 8596
10.5281/zenodo.7834229). 8605
10.5281/zenodo.7834261). 8608
10.5281/zenodo.7824560). 8611
(doi: 10.5281/zenodo.7824623). 8614

2023, (doi: 10.5281/zenodo.7809365). 8625
2023, (doi: 10.5281/zenodo.7809358). 8628

10.5281/zenodo.7809219). 8631
10.5281/zenodo.7809328). 8634
2023, (doi: 10.5281/zenodo.7806767). 8637

2023, (doi: 10.5281/zenodo.7806838). 8640
10.5281/zenodo.7799902). 8649
(doi: 10.5281/zenodo.7804218). 8652
(doi: 10.5281/zenodo.7796334). 8655

10.5281/zenodo.7791952). 8661
10.5281/zenodo.7791982). 8664
10.5281/zenodo.7790026). 8667
10.5281/zenodo.7790052). 8670
2023, (doi: 10.5281/zenodo.7787066). 8673
10.5281/zenodo.7781476). 8679
10.5281/zenodo.7783082). 8682
10.5281/zenodo.7777857). 8685
10.5281/zenodo.7779286). 8688
(doi: 10.5281/zenodo.7771831). 8691
2023, (doi: 10.5281/zenodo.7772468). 8694
10.13140/RG.2.2.20913.25446). 8697

odo.7764916). 8700
10.13140/RG.2.2.11770.98247). 8703
10.13140/RG.2.2.12400.12808). 8706
2023, (doi: 10.13140/RG.2.2.22545.10089). 8709
10.13140/RG.2.2.11377.76644). 8715
10.13140/RG.2.2.23750.96329). 8718
10.13140/RG.2.2.31366.24641). 8721
10.13140/RG.2.2.34721.68960). 8724
2023, (doi: 10.13140/RG.2.2.30212.81289). 8727
10.13140/RG.2.2.24288.35842). 8733
10.13140/RG.2.2.32467.25124). 8736

10.13140/RG.2.2.31025.45925). 8739
10.13140/RG.2.2.17184.25602). 8742
10.13140/RG.2.2.23423.28327). 8745
10.13140/RG.2.2.28456.44805). 8748
10.13140/RG.2.2.23525.68320). 8751
10.13140/RG.2.2.20170.24000). 8754
10.13140/RG.2.2.36475.59683). 8757
10.13140/RG.2.2.29764.71046). 8760
2023, (doi: 10.13140/RG.2.2.18780.87683). 8763
10.13140/RG.2.2.26134.01603). 8769
10.13140/RG.2.2.27392.30721). 8772
10.13140/RG.2.2.33028.40321). 8775

10.13140/RG.2.2.21389.20966). 8778
10.13140/RG.2.2.16356.04489). 8781
10.13140/RG.2.2.21756.21129). 8784
10.13140/RG.2.2.30983.68009). 8787
10.13140/RG.2.2.28552.29445). 8790
(doi: 10.13140/RG.2.2.10936.21761). 8793
10.13140/RG.2.2.35105.89447). 8796
(doi: 10.13140/RG.2.2.30072.72960). 8799
10.13140/RG.2.2.31147.52003). 8802
10.13140/RG.2.2.32825.24163). 8805
10.13140/RG.2.2.13059.58401). 8808
10.13140/RG.2.2.11172.14720). 8811
2023, (doi: 10.13140/RG.2.2.22011.80165). 8814

ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8817
2023, (doi: 10.13140/RG.2.2.10493.84962). 8820
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8823
2023, (doi: 10.13140/RG.2.2.19944.14086). 8826
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8829
(doi: 10.13140/RG.2.2.33103.76968). 8832
(doi: 10.13140/RG.2.2.23037.44003). 8835
(doi: 10.13140/RG.2.2.35646.56641). 8838
10.13140/RG.2.2.18030.48967). 8841
(doi: 10.13140/RG.2.2.13973.81121). 8844
2023, (doi: 10.13140/RG.2.2.34106.47047). 8847
2023, (doi: 10.13140/RG.2.2.31956.88961). 8853

2023, (doi: 10.13140/RG.2.2.15179.67361). 8856
10.13140/RG.2.2.21510.45125). 8859
2023, (doi: 10.13140/RG.2.2.13121.84321). 8862
10.13140/RG.2.2.11758.69441). 8865
2023, (doi: 10.13140/RG.2.2.31891.35367). 8868
10.13140/RG.2.2.19360.87048). 8871
10.13140/RG.2.2.32363.21286). 8874
10.13140/RG.2.2.23266.81602). 8877
10.13140/RG.2.2.19911.37285). 8880
10.13140/RG.2.2.11050.90569). 8883
2023, (doi: 10.13140/RG.2.2.17761.79206). 8886
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8892

(doi: 10.13140/RG.2.2.30182.50241). 8895
2023, (doi: 10.13140/RG.2.2.17252.24968). 8928


2023010396 (doi: 10.20944/preprints202301.0396.v1). 8937

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




2023,(doi: 10.13140/RG.2.2.36745.93289). 8954
10.20944/preprints202301.0282.v1). 8961
10.20944/preprints202301.0267.v1).). 8964
(doi: 10.20944/preprints202301.0265.v1). 8969

prints202301.0262.v1). 8973

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

10.13140/RG.2.2.35061.65767). 8982

10.13140/RG.2.2.18494.15680). 8986
10.13140/RG.2.2.32530.73922). 8990

10.13140/RG.2.2.15897.70243). 8994
10.13140/RG.2.2.32530.73922). 8998

prints202301.0105.v1). 9001
10.13140/RG.2.2.23172.19849). 9008

10.13140/RG.2.2.17385.36968). 9018
Preprints 2023, 2023010044 9021
10.20944/preprints202301.0043.v1). 9024
2023, (doi: 10.13140/RG.2.2.28945.92007). 9027
10.13140/RG.2.2.35774.77123). 9033

10.13140/RG.2.2.29430.88642). 9039
(doi: 10.20944/preprints202212.0549.v1). 9045

10.13140/RG.2.2.19380.94084). 9048
(doi: 10.20944/preprints202212.0500.v1). 9059
10.13140/RG.2.2.20993.12640). 9062


10.13140/RG.2.2.29173.86244). 9077

10.5281/zenodo.8020181). 9082
10.5281/zenodo.7978921). 9084

odo.7943878). 9086
10.5281/zenodo.7943871). 9088
10.5281/zenodo.7923786). 9090
2023 (doi: 10.5281/zenodo.7905287). 9092

2023 (doi: 10.5281/zenodo.7874677). 9096
(doi: 10.5281/zenodo.7857906). 9098
2023 (doi: 10.5281/zenodo.7856329). 9100
10.5281/zenodo.7854561). 9102
2023 (doi: 10.5281/zenodo.7851893). 9104

(doi: 10.5281/zenodo.7835063). 9108
(doi: 10.5281/zenodo.7826705). 9110
2023 (doi: 10.5281/zenodo.7820680). 9112
10.5281/zenodo.7812750). 9114


2023 (doi: 10.5281/zenodo.7807782). 9120

2023 (doi: 10.5281/zenodo.7804449). 9122

(doi: 10.5281/zenodo.7792307). 9126
(doi: 10.5281/zenodo.7790728). 9128
2023 (doi: 10.5281/zenodo.7787712). 9130
10.5281/zenodo.7783791). 9132
10.5281/zenodo.7780123). 9134
(doi: 10.5281/zenodo.7773119). 9136
odo.7637762). 9138
10.5281/zenodo.7766174). 9140
10.5281/zenodo.7762232). 9142
(doi: 10.5281/zenodo.7758601). 9144
10.5281/zenodo.7754661). 9146
10.5281/zenodo.7750995) . 9148
(doi: 10.5281/zenodo.7749875). 9150
10.5281/zenodo.7747236). 9152
10.5281/zenodo.7742587). 9154
(doi: 10.5281/zenodo.7738635). 9156

10.5281/zenodo.7734719). 9158
10.5281/zenodo.7730484). 9160
(doi: 10.5281/zenodo.7730469). 9162
10.5281/zenodo.7722865). 9164
odo.7713563). 9166
odo.7709116). 9168
10.5281/zenodo.7706415). 9170
10.5281/zenodo.7706063). 9172
10.5281/zenodo.7701906). 9174
odo.7700205). 9176
10.5281/zenodo.7694876). 9178
10.5281/zenodo.7679410). 9180
10.5281/zenodo.7675982). 9182
10.5281/zenodo.7672388). 9184
odo.7668648). 9186
10.5281/zenodo.7662810). 9188
10.5281/zenodo.7659162). 9190
odo.7653233). 9192

odo.7653204). 9194
odo.7653142). 9196
odo.7653117). 9198
odo.7651687). 9201
odo.7651619). 9203
odo.7651439). 9205
odo.7650729). 9207
odo.7647868). 9209
odo.7647017). 9211
odo.7644894). 9213
odo.7632923). 9216
odo.7623459). 9218
10.5281/zenodo.7606416). 9220
10.5281/zenodo.7606416). 9222
odo.7606404). 9224
10.5281/zenodo.7580018). 9226

odo.7580018). 9228
odo.7580018). 9230
odo.7579929). 9232
10.5281/zenodo.7563170). 9234
odo.7563164). 9236
odo.7563160). 9238
odo.7563160). 9240
10.5281/zenodo.7563160). 9242
10.5281/zenodo.7557063). 9244
10.5281/zenodo.7557009). 9246
10.5281/zenodo.7539484). 9248
10.5281/zenodo.7523390). 9250
10.5281/zenodo.7523390). 9252
10.5281/zenodo.7523390). 9254
odo.7574952). 9256
10.5281/zenodo.7574992). 9258
odo.7523357). 9260
10.5281/zenodo.7523357). 9262

10.5281/zenodo.7504782). 9264
10.5281/zenodo.7504782). 9266
10.5281/zenodo.7504782). 9268
10.5281/zenodo.7499395). 9270
odo.7499395). 9272
10.5281/zenodo.7499395). 9274
10.5281/zenodo.7497450). 9276
10.5281/zenodo.7497450). 9278
10.5281/zenodo.7494862). 9280
odo.7494862). 9282
10.5281/zenodo.7494862). 9284
10.5281/zenodo.7493845). 9286
odo.7493845). 9288
10.5281/zenodo.7493845). 9290
odo.7539484). 9292
odo.7523390). 9294
odo.7523357). 9296
odo.7504782). 9298

odo.7499395). 9300
odo.7497450). 9302
odo.7494862). 9304
odo.7493845). 9306
odo.7480110). 9308
odo.7378758). 9310
odo.6320305). 9312
odo.6677173). 9314

CHAPTER 45 9315
Books’ Contributions 9316
“Books’ Contributions”: | Featured Threads 9317

The following references are cited by chapters. 9318
9319
[Ref272] 9320
Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating In Recog- 9321
nition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 9322
odo.8027275). 9323
9324
[Ref273] 9325
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9326
By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 10.5281/zen- 9327
odo.8025707). 9328
9329
The links to the contributions of this scientific research book are listed below. 9330
[HG272] 9331
odo.8027275). 9334
9335
[TITLE] “New Ideas On Super Units By Hyper Ultra Of United Dominating In Recog- 9336
nition of Cancer With (Neutrosophic) SuperHyperGraph” 9337

9338
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9339
https://www.researchgate.net/publication/371492733 9340
9341
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9342
https://www.scribd.com/document/652392466 9343
9344
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9345
https://zenodo.org/record/8027275 9346
9347
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9348
https://www.academia.edu/103231308 9349
453
Figure 45.1: Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.8027275).
9350
[ADDRESSED CITATION] 9351
odo.8027275). 9354
[ASSIGNED NUMBER] #272 Article 9355
[DATE] June 2023 9356

[DOI] 10.5281/zenodo.8027275 9357
[LICENSE] CC BY-NC-ND 4.0 9358
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9359
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9360
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9361
9362
[HG273] 9363
By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 10.5281/zen- 9365
odo.8025707). 9366
9367
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9368

United Dominating As Hyper Ultra On Super Units” 9369
9370
https://www.researchgate.net/publication/371487997 9372
9373
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9374

(doi: 10.5281/zenodo.8027275).
(doi: 10.5281/zenodo.8027275).

Figure 45.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi:
10.5281/zenodo.8025707).
https://www.scribd.com/document/652261351 9375
9376
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9377
https://zenodo.org/record/8025707 9378
9379
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9380
https://www.academia.edu/103201836 9381
9382
By United Dominating As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 9385
odo.8017246). 9386
[ASSIGNED NUMBER] #273 Article 9387
[DATE] June 2023 9388
[DOI] 10.5281/zenodo.8025707 9389
[LICENSE] CC BY-NC-ND 4.0 9390

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9391
[AVAILABLE AT TWITTER’S IDS] 9392
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9393
googlebooks GooglePlay 9394
9395
[ASSIGNED NUMBER] | Book #176 9396

HG176b
Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9398
10.5281/zenodo.8027488). 9399

10.5281/zenodo.8025707).
10.5281/zenodo.8025707).

[TITLE] United Dominating In SuperHyperGraphs 9400

#Latest_Updates 9401
#The_Links 9402
9406
9408
#The_Links 9409
9410
[ASSIGNED NUMBER] | Book #176 9411

9412
[TITLE] United Dominating In SuperHyperGraphs 9413
9414
9418
– 9419
9420
[PUBLISHER] 9421
(Paperback): https://www.amazon.com/dp/- 9422
(Hardcover): https://www.amazon.com/dp/- 9423

(Kindle Edition): https://www.amazon.com/dp/- 9424
9425
– 9426
9427
[ISBN] 9428
(Paperback): - 9429
(Hardcover): - 9430
(Kindle Edition): CC BY-NC-ND 4.0 9431
(EBook): CC BY-NC-ND 4.0 9432
9433
– 9434
9435
[PRINT LENGTH] 9436
(Paperback): - pages 9437
(Hardcover): - pages 9438
(Kindle Edition): - pages 9439
(E-Book): - pages 9440
9441
– 9442
9443
9445

#The_Links 9446
9447
https://www.researchgate.net/publication/- 9449
9450
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9451
https://drhenrygarrett.wordpress.com/2023/07/22/ 9452
United-Dominating-In-SuperHyperGraphs/ 9453
9454
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9455
https://www.scribd.com/document/- 9456
9457
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9458
https://www.academia.edu/- 9459
9460
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9461
https://zenodo.org/record/- 9462
9463
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9464
https://books.google.com/books/about?id=- 9465
9466
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9467
https://play.google.com/store/books/details?id=- 9468

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9469

9470
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9471
9472
https://drhenrygarrett.wordpress.com/2023/07/22/ 9473
United-Dominating-In-SuperHyperGraphs/ 9474
9475
– 9476
9477
[POSTED BY] Dr. Henry Garrett 9478
9479
[DATE] June 012, 2023 9480

9481
[POSTED IN] 176 | United Dominating In SuperHyperGraphs 9482
9483
[TAGS] 9484
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9485
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9486
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9487
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9488
neutrosophic SuperHyperGraphs, Neutrosophic United Dominating In SuperHyperGraphs, Open 9489
Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 9490
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 9491
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 9492
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 9493

SuperHyperGraphs, United Dominating In SuperHyperGraphs, SuperHyperModeling, SuperHy- 9494
perVertices, Theoretical Research, Vertex, Vertices. 9495
In this scientific research book, there are some scientific research chapters on “Extreme United 9496
Dominating In SuperHyperGraphs” and “Neutrosophic United Dominating In SuperHyper- 9497
Graphs” about some scientific research on United Dominating In SuperHyperGraphs by two 9498
(Extreme/Neutrosophic) notions, namely, Extreme United Dominating In SuperHyperGraphs 9499

and Neutrosophic United Dominating In SuperHyperGraphs. With scientific research on 9500
the basic scientific research properties, the scientific research book starts to make Extreme 9501
United Dominating In SuperHyperGraphs theory and Neutrosophic United Dominating In 9502
SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9503

HG176b1.png
Figure 45.7: [HG176b] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.8027488).

HG176b2.png

HG176b3.png

CHAPTER 46 9504
“SuperHyperGraph-Based Books”: | 9505
Featured Tweets 9506
“SuperHyperGraph-Based Books”: | Featured Tweets 9507
465
Figure 46.1: “SuperHyperGraph-Based Books”: | Featured Tweets

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

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
























CHAPTER 47 9508
CV 9509
493
9510
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.
Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic
Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups
Activities: Traveling, Painting, Writing, Reading books and Papers
Professional Experiences
2017 - Present Continuous Member AMS
I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.
2017 - 2019 Continuous Member EMS
The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress
Awards and Achievements
Dec 2022 Award: Selected as a Reviewer @SciencePG
Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG
My name and affiliation is listed on the journal’s reviewer page:
http://www.sciencepg.com/journal/peerreviewers?journalid=303.
My name and affiliation is listed on the journal’s personal
page:https://membership.sciencepg.com/DrHenryGarrett
PDF: https://drhenrygarrett.files.wordpress.com/2023/04/certificate_for_reviewer.pdf
Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM
Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR
Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International
Association
Award: Distinguished Achievements

Honorary Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf
9511
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)
9512
Publications: Articles
2023 245 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
@ResearchGate: https://www.researchgate.net/publication/369977142
@Scribd: https://www.scribd.com/document/637993759
@ZENODO_ORG: https://zenodo.org/record/7824560
@academia: https://www.academia.edu/100136177
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

9513

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript

9514
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress

Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

9515
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
Zenodo 2023, (doi: 10.5281/zenodo.7793372).
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript

9516
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

9517
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9518
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
9519
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

9520
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

9521
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript

9522
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor
10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

9523
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript

9524
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In
10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript

9525
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

9526
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript

9527
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

9528
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript

9529
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
9530
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

9531

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript

9532
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

9533

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
9534
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript

9535
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
9536
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
9537
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition

Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
9538
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9539
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
9540
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

9541
2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
9542
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

9543
2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
9544
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
9545
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9546
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).
9547

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
9548
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
2021 0013 | Matroid And Its Outlines Manuscript
Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
2021 0012 | Matroid And Its Relations Manuscript
Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
2021 0011 | Metric Number in Dimension Manuscript
Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
9549
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9550
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9551
[HG157b] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Nhu4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Nhu4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1JK83H9
(Hardcover): https://www.amazon.com/dp/B0C1J3J6GZ
(Kindle Edition): https://www.amazon.com/dp/B0C1VXHLYJ
ISBN
(Paperback): 9798390583968
(Hardcover): 9798390584002
2023 156 | Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs Amazon
[HG156b] Henry Garrett, “”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7807782).
@googlebooks:https://books.google.com/books/about?id=pu-3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=pu-3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Cut-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1PBHJ
(Hardcover): https://www.amazon.com/dp/B0C1HVLC8V
(Kindle Edition): https://www.amazon.com/dp/B0C1SZJYH8
ISBN
(Paperback): 9798390476758
(Hardcover): 9798390476789
2023 155 | SuperHyperDuality Amazon

9552
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

9553
[HG153b] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7792307).
@googlebooks:https://books.google.com/books/about?id=4By3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=4By3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C12DH1TZ
(Hardcover): https://www.amazon.com/dp/B0C12JFJGM
(Kindle Edition): https://www.amazon.com/dp/B0C18V22Y2
ISBN
(Paperback): 9798389815193
(Hardcover): 9798389815209
2023 152 | Hamiltonian-Neighbor In SuperHyperGraphs Amazon
[HG152b] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7790728).
@googlebooks:https://books.google.com/books/about?id=hA63EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hA63EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C128T8FP
(Hardcover): https://www.amazon.com/dp/B0C12DHG8K
(Kindle Edition): https://www.amazon.com/dp/B0C16YJ5KL
ISBN
(Paperback): 9798389655539
(Hardcover): 9798389655638
2023 151 | Hamiltonian-Decomposition In SuperHyperGraphs Amazon

9554
[HG151b] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=84u2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=84u2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-
(Paperback): https://www.amazon.com/dp/B0C12D3JBS
(Hardcover): https://www.amazon.com/dp/B0C12D3K6P
(Kindle Edition): https://www.amazon.com/dp/B0C147QGJC
ISBN
(Paperback): 9798389394353
(Hardcover): 9798389394629
2023 150 | Hamiltonian-Cut In SuperHyperGraphs Amazon
[HG150b] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7783791).
@googlebooks:https://books.google.com/books/about?id=3Gy2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=3Gy2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPJTY4
(Hardcover): https://www.amazon.com/dp/B0C12528LZ
(Kindle Edition): https://www.amazon.com/dp/B0BZYLS8NZ
ISBN
(Paperback): 9798389221505
(Hardcover): 9798389222076
2023 149 | Trace-Neighbor In SuperHyperGraphs Amazon

9555
[HG149b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7780123).
@googlebooks:https://books.google.com/books/about?id=Tie2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Tie2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPDKDF
(Hardcover): https://www.amazon.com/dp/B0BZFP49GT
(Kindle Edition): https://www.amazon.com/dp/B0BZVLWRSD
ISBN
(Paperback): 9798389040786
(Hardcover): 9798389040946
2023 148 | Trace-Decomposition In SuperHyperGraphs Amazon
[HG148b] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7773119).
@googlebooks:https://books.google.com/books/about?id=y8a1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=y8a1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPFVRT
(Hardcover): https://www.amazon.com/dp/B0BZFP491Q
(Kindle Edition): https://www.amazon.com/dp/B0BZP8555H
ISBN
(Paperback): 9798388702937
(Hardcover): 9798388702999

9556
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9557
[HG145b] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7762232).
@googlebooks:https://books.google.com/books/about?id=q021EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q021EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBY449B
(Hardcover): https://www.amazon.com/dp/B0BZFCBXYR
(Kindle Edition): https://www.amazon.com/dp/B0BZCP4DSW
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388173157
2023 144 | Edge-Decomposition In SuperHyperGraphs Amazon
[HG144b] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7758601).
@googlebooks:https://books.google.com/books/about?id=5Pm0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5Pm0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBGNQTR
(Hardcover): https://www.amazon.com/dp/B0BZ6SNCXJ
(Kindle Edition): https://www.amazon.com/dp/B0BZ7WZF48
ISBN
(Paperback): 9798388014078
(Hardcover): 9798388014962
2023 143 | Edge-Cut In SuperHyperGraphs Amazon

9558
[HG143b] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7754661).
@googlebooks:https://books.google.com/books/about?id=L u0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=L u0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZ324MLT
(Hardcover): https://www.amazon.com/dp/B0BZ34DF21
(Kindle Edition): https://www.amazon.com/dp/B0BZ3Z9J8W
ISBN
(Paperback): 9798387863837
(Hardcover): 9798387865688
2023 142 | Vertex-Neighbor In SuperHyperGraphs Amazon
[HG142b] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7750995).
@googlebooks:https://books.google.com/books/about?id=5JO0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5JO0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR8YN3V
(Hardcover): https://www.amazon.com/dp/B0BYRL26L7
(Kindle Edition): https://www.amazon.com/dp/B0BYYW89VD
ISBN
(Paperback): 9798387725944
(Hardcover): 9798387727511
2023 141 | Vertex-Decomposition In SuperHyperGraphs Amazon

9559
[HG141b] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7749875).
@googlebooks:https://books.google.com/books/about?id=-oS0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=-oS0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR862GV
(Hardcover): https://www.amazon.com/dp/B0BYR7TZXZ
(Kindle Edition): https://www.amazon.com/dp/B0BYX3144B
ISBN
(Paperback): 9798387614910
(Hardcover): 9798387616792
2023 140 | Vertex-Cut In SuperHyperGraphs Amazon
[HG140b] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7747236).
@googlebooks:https://books.google.com/books/about?id=fmC0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=fmC0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRC9P2F
(Hardcover): https://www.amazon.com/dp/B0BYR7YKMC
(Kindle Edition): https://www.amazon.com/dp/B0BYX1HCTN
ISBN
(Paperback): 9798387610660
(Hardcover): 9798387611964
2023 139 | Stable-Neighbor In SuperHyperGraphs Amazon

9560
[HG139b] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7742587).
@googlebooks:https://books.google.com/books/about?id=5y60EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5y60EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR5PWBJ
(Hardcover): https://www.amazon.com/dp/B0BYRBV5KL
(Kindle Edition): https://www.amazon.com/dp/B0BYVK1CCH
ISBN
(Paperback): 9798387498947
(Hardcover): 9798387510786
2023 138 | Stable-Decompositions In SuperHyperGraphs Amazon
[HG138b] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7738635).
@googlebooks:https://books.google.com/books/about?id=q-CzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q-CzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR86GDV
(Hardcover): https://www.amazon.com/dp/B0BYR5GCRQ
(Kindle Edition): https://www.amazon.com/dp/B0BYVFCRJ3
ISBN
(Paperback): 9798387492839
(Hardcover): 9798387495489
2023 137 | Stable-Cut In SuperHyperGraphs Amazon

9561
[HG137b] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7734719).
@googlebooks:https://books.google.com/books/about?id=oKmzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=oKmzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRNDT1Z
(Hardcover): https://www.amazon.com/dp/B0BYR5GF4P
(Kindle Edition): https://www.amazon.com/dp/B0BYS8MJD6
ISBN
(Paperback): 9798387367335
(Hardcover): 9798387369513
2023 136 | Clique-Neighbors In SuperHyperGraphs Amazon
[HG136b] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7730484).
@googlebooks:https://books.google.com/books/about?id=NXyzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=NXyzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Neighbors-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM8JSFJ
(Hardcover): https://www.amazon.com/dp/B0BYLPSR1C
(Kindle Edition): https://www.amazon.com/dp/B0BYBQK51T
ISBN
(Paperback): 9798386938741
(Hardcover): 9798386938772
2023 135 | Clique-Decompositions In SuperHyperGraphs Amazon

9562
[HG135b] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7730469).
@googlebooks:https://books.google.com/books/about?id=D3yzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=D3yzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM1CV3S
(Hardcover): https://www.amazon.com/dp/B0BYLXRXTJ
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386938598
(Hardcover): 9798386938635
2023 134 | Clique-Cut In SuperHyperGraphs Amazon
[HG134b] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7722865).
@googlebooks:https://books.google.com/books/about?id=BEuzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=BEuzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYLPSHS5
(Hardcover): https://www.amazon.com/dp/B0BYM4QTKG
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386709860
(Hardcover): 9798386709891
2023 133 | Space In SuperHyperGraphs Amazon

9563
[HG133b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7713563).
@googlebooks:https://books.google.com/books/about?id=je-yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=je-yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/List-Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNPGDB5
(Hardcover): https://www.amazon.com/dp/B0BXNCSNBJ
(Kindle Edition): https://www.amazon.com/dp/B0BXYYCS5H
ISBN
(Paperback): 9798386468965
(Hardcover): 9798386469030
2023 0132 | Space In SuperHyperGraphs Amazon
[HG132b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7709116).
@googlebooks:https://books.google.com/books/about?id=M56yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=M56yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Space-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 131 | Edge-Connectivity In SuperHyperGraphs Amazon

9564
[HG131b] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7706415).
@googlebooks:https://books.google.com/books/about?id=9XKyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=9XKyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNDNSNQ
(Hardcover): https://www.amazon.com/dp/B0BXN418BY
(Kindle Edition): https://www.amazon.com/dp/B0BXQTPCWV
ISBN
(Paperback): 9798386227593
(Hardcover): 9798386229306
2023 130 | Vertex-Connectivity In SuperHyperGraphs Amazon
[HG130b] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7706063).
@googlebooks:https://books.google.com/books/about?id=12myEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=12myEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN7F5VZ
(Hardcover): https://www.amazon.com/dp/B0BXN6NP8X
(Kindle Edition): https://www.amazon.com/dp/B0BXR1ZMKJ
ISBN
(Paperback): 9798386225056
(Hardcover): 9798386225872
2023 129 | Tree-Decomposition In SuperHyperGraphs Amazon

9565
[HG129b] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7701906).
@googlebooks:https://books.google.com/books/about?id=FBmyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=FBmyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/04/22/Tree-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN4X4MD
(Hardcover): https://www.amazon.com/dp/B0BXNK5C1D
(Kindle Edition): https://www.amazon.com/dp/B0BXM1FT1M
ISBN
(Paperback): 9798386069155
(Hardcover): 9798386070076
2023 128 | Chord In SuperHyperGraphs Amazon
[HG128b] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7700205).
@googlebooks:https://books.google.com/books/about?id=mfSxEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=mfSxEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Chord-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW3HR3CT
(Hardcover): https://www.amazon.com/dp/B0BW2KMGVJ
(Kindle Edition): https://www.amazon.com/dp/B0BXJYTWD3
ISBN
(Paperback): 9798385981755
(Hardcover): 9798385984046
2023 127 | (i,j)-Domination In SuperHyperGraphs Amazon

9566
[HG127b] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7694876).
@googlebooks:https://books.google.com/books/about?id=QoexEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=QoexEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/(i,j)-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2GWHR4
(Hardcover): https://www.amazon.com/dp/B0BW3HG682
(Kindle Edition): https://www.amazon.com/dp/B0BXDK4WLM
ISBN
(Paperback): 9798385701025
(Hardcover): 9798385701797
2023 0126 | Edge-Domination In SuperHyperGraphs Amazon
[HG126b] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7679410).
@googlebooks:https://books.google.com/books/about?id=PEiwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=PEiwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/28/Edge-Domination-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2QM56Q
(Hardcover): https://www.amazon.com/dp/B0BW3GJNWL
(Kindle Edition): https://www.amazon.com/dp/B0BWWXGLX6
ISBN
(Paperback): 9798379089597
(Hardcover): 9798379090531
2023 0125 | K-Domination In SuperHyperGraphs Amazon

9567
[HG125b] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7675982).
@googlebooks:https://books.google.com/books/about?id=WyKwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=WyKwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/27/K-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 124 | K-Number In SuperHyperGraphs Amazon
[HG124b] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7672388).
@googlebooks:https://books.google.com/books/about?id=TtCvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TtCvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/K-Number-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/- @ZENODO_ORG:
https://zenodo.org/record/7672388
(Paperback): https://www.amazon.com/dp/B0BW32LV1S
(Hardcover): https://www.amazon.com/dp/B0BW31GSZB
(Kindle Edition): https://www.amazon.com/dp/B0BWR36VFF
ISBN
(Paperback): 9798378775477
(Hardcover): 9798378776733
2023 123 | Order In SuperHyperGraphs Amazon

9568
[HG123b] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7668648).
@googlebooks:https://books.google.com/books/about?id=U56vEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=U56vEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/Order-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2KJKJD
(Hardcover): https://www.amazon.com/dp/B0BW2BSXTG
(Kindle Edition): https://www.amazon.com/dp/B0BWMKNH7H
ISBN
(Paperback): 9798378647705
(Hardcover): 9798378648146
2023 122 | Coloring In SuperHyperGraphs Amazon
[HG122b] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7662810).
@googlebooks:https://books.google.com/books/about?id=jGavEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jGavEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW28MKQP
(Hardcover): https://www.amazon.com/dp/B0BW35Y9YW
(Kindle Edition): https://www.amazon.com/dp/B0BWN81GT3
ISBN
(Paperback): 9798378499175
(Hardcover): 9798378499717
2023 121 || “Dimension In SuperHyperGraphs” Amazon

9569
[HG9121b] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7659162).
@googlebooks:https://books.google.com/books/about?id=nAOvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=nAOvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Dimension-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW38DB6M
(Hardcover): https://www.amazon.com/dp/B0BW2KMB1J
(Kindle Edition): https://www.amazon.com/dp/B0BWCW6KJL
ISBN
(Paperback): 9798378343188
(Hardcover): 9798378343812
2023 120 || “Cancer In SuperHyperGraphs” Amazon
[HG120b] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653233).
@googlebooks:https://books.google.com/books/about?id=ZdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=ZdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/Cancer-in-
SuperHyperGraphs/
@Scribd:https://www.scribd.com/document/-
|| Cancer in SuperHyperGraphs
Link (Paperback): https://www.amazon.com/dp/B0BW3BK14G
(Hardcover): https://www.amazon.com/dp/B0BW2K9GPL (Kindle Edition):
https://www.amazon.com/dp/B0BW6JCNY1
ISBN (Paperback): 9798378064847 (Hardcover): 9798378065530 (Kindle Edition): CC BY-NC-
ND 4.0
2023 0119 || “SuperHyperWheel” Amazon

9570
[HG119b] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653204).
SuperHyperWheel
@googlebooks:https://books.google.com/books/about?id=S9muEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=S9muEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperWheel/
|| SuperHyperWheel
Link (Paperback): https://www.amazon.com/dp/B0BW2BX6X1
(Hardcover): https://www.amazon.com/dp/B0BW23H1M2 (Kindle Edition):
https://www.amazon.com/dp/B0BW6H5TVG
ND 4.0
2023 0118 || “SuperHyperMultipartite” Amazon
[HG118b] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653142).
SuperHyperMultipartite
@googlebooks:https://books.google.com/books/about?id=SdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=SdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperMultipartite/
|| SuperHyperMultipartite
Link (Paperback): https://www.amazon.com/dp/B0BW358WXN
(Hardcover): https://www.amazon.com/dp/B0BW2CR178 (Kindle Edition):
https://www.amazon.com/dp/B0BW6FTXNH
ND 4.0
2023 0117 || “SuperHyperBipartite” Amazon

9571
[HG117b] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653117).
SuperHyperBipartite
@googlebooks:https://books.google.com/books/about?id=s9iuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=s9iuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperBipartite/
|| SuperHyperBipartite
Link (Paperback): https://www.amazon.com/dp/B0BW267JRF
(Hardcover): https://www.amazon.com/dp/B0BW2ZSL9D (Kindle Edition):
https://www.amazon.com/dp/B0BW6G294W
ND 4.0
2023 0116 || “SuperHyperStar” Amazon
[HG116b] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653089).
SuperHyperStar
@googlebooks:https://books.google.com/books/about?id=8deuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8deuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperStar/
|| SuperHyperStar
Link (Paperback): https://www.amazon.com/dp/B0BW2XKM25
(Hardcover): https://www.amazon.com/dp/B0BW2RKDDX (Kindle Edition):
https://www.amazon.com/dp/B0BW6CTTXM
ND 4.0
2023 0115 || “SuperHyperCycle” Amazon

9572
[HG115b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651687).
SuperHyperCycle
@googlebooks:https://books.google.com/books/about?id=u8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperCycle/
|| SuperHyperCycle
Link (Paperback): https://www.amazon.com/dp/B0BW2XKLRW
(Hardcover): https://www.amazon.com/dp/B0BW2R9SSF (Kindle Edition):
https://www.amazon.com/dp/B0BW5G2J68
ND 4.0
2023 0114 || “SuperHyperPath” Amazon
[HG114b] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651619).
SuperHyperPath
@googlebooks:https://books.google.com/books/about?id=t8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=t8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/
|| SuperHyperPath
Link (Paperback): https://www.amazon.com/dp/B0BW2B6DPZ
(Hardcover): https://www.amazon.com/dp/B0BW2B6DP3 (Kindle Edition):
https://www.amazon.com/dp/B0BW5D6T17
ND 4.0
2023 0113 || “SuperHyperDomination” Amazon

9573
[HG113b] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651439).
SuperHyperDomination
@googlebooks:https://books.google.com/books/about?id=scSuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=scSuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDomination/
|| SuperHyperDomination
Link (Paperback): https://www.amazon.com/dp/B0BW2R9STC
(Hardcover): https://www.amazon.com/dp/B0BW3BJZRF (Kindle Edition):
https://www.amazon.com/dp/B0BW5FPZC8
ND 4.0
2023 0112 || “SuperHyperDominating” Amazon
[HG112b] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7650729).
SuperHyperDominating
@googlebooks:https://books.google.com/books/about?id=17uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=17uuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDominating/
|| SuperHyperDominating
Link (Paperback): https://www.amazon.com/dp/B0BW2K99NB (Hardcover):
https://www.amazon.com/dp/B0BW2PWT1G (Kindle Edition):
https://www.amazon.com/dp/B0BW4SFRXP
ISBN (Paperback): 9798377922339 (Hardcover): 9798377923053 (Kindle Edition): CC BY-
NC-ND 4.0
2023 0111 || “SuperHyperConnected” Amazon

9574
[HG111b] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647868).
SuperHyperConnected
@googlebooks:https://books.google.com/books/about?id=AmquEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=AmquEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/17/SuperHyperConnected/
|| SuperHyperConnected
Link (Paperback): https://www.amazon.com/dp/B0BW2LMPN5
(Hardcover): https://www.amazon.com/dp/B0BW358DDG (Kindle Edition):
https://www.amazon.com/dp/B0BW2ZBHG7
ND 4.0
2023 0110 || “SuperHyperTotal” Amazon
[HG110b] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647017).
SuperHyperTotal
@googlebooks:https://books.google.com/books/about?id=81uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=81uuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/17/superhypertotal/
|| SuperHyperTotal
Link (Paperback): https://www.amazon.com/dp/B0BW35VNQS
(Hardcover): https://www.amazon.com/dp/B0BW2CQZJZ (Kindle Edition):
https://www.amazon.com/dp/B0BW1TZTPX
ND 4.0
2023 0109 || “SuperHyperPerfect” Amazon

9575
[HG109b] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7644894).
SuperHyperPerfect
@googlebooks:https://books.google.com/books/about?id=JymuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=JymuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/16/SuperHyperPerfect/
|| SuperHyperPerfect
Link (Paperback): https://www.amazon.com/dp/B0BVSXB7TC
(Hardcover): https://www.amazon.com/dp/B0BVT8FRC2 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6CGKZ
ND 4.0
2023 0108 || “SuperHyperJoin” Amazon
[HG108b] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7641880).
SuperHyperJoin
@googlebooks:https://books.google.com/books/about?id=TeStEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TeStEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/15/superhyperjoin/
|| SuperHyperJoin
Link (Paperback): https://www.amazon.com/dp/B0BVT7HJ1K
(Hardcover): https://www.amazon.com/dp/B0BVSXX9W5 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6P9KC
ND 4.0
2023 0107 || “Path SuperHyperColoring” Amazon
[HG107b] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7632923).
|| Path SuperHyperColoring
@googlebooks: https://books.google.com/books/about?id=o3ytEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=o3ytEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BVDRFXXF (Hardcover):
https://www.amazon.com/dp/B0BVDMJ5MJ (Kindle Edition):
ND 4.0
9576
2023 0106 || “SuperHyperDensity” Amazon
[HG106b] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7623459).
|| SuperHyperDensity
Link (Paperback): https://www.amazon.com/dp/B0BV49Y61R (Hardcover):
https://www.amazon.com/dp/B0BV4DYQZL (Kindle Edition):
ND 4.0
@googlebooks: https://books.google.com/books/about?id=HdusEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=HdusEAAAQBAJ
2023 0105 || “Neutrosophic SuperHyperConnectivities” Amazon
[HG105b] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023.
Link (Paperback): https://www.amazon.com/dp/B0BTXCX57J (Hardcover):

https://www.amazon.com/dp/B0BTRXKGTX (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=YeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=YeurEAAAQBAJ
2023 Book 104 || “Extreme SuperHyperConnectivities” Amazon
[HG104b] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606416).
Link (Paperback): https://www.amazon.com/dp/B0BTRYB2S4 (Hardcover):

https://www.amazon.com/dp/B0BTT6VT96 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=X-urEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=X-urEAAAQBAJ
2023 Book 103 || “SuperHyperConnectivities” Amazon

9577
[HG103b] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606404).
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=UeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=UeurEAAAQBAJ
2023 Book 102 || “Neutrosophic SuperHyperCycle” Amazon
[HG102b] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT6ZXQ8V (Hardcover):

https://www.amazon.com/dp/B0BT7DZTBW (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=OCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=OCeqEAAAQBAJ
@WordPress: -
2023 Book 101 || “Extreme SuperHyperCycle” Amazon
[HG101b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=MCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=MCeqEAAAQBAJ
@WordPress: -
2023 Book 100 || “Extreme SuperHyperCycle” Amazon
[HG100b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT7HS2CD (Hardcover):

https://www.amazon.com/dp/B0BT75DHQ2 (Kindle Edition):
ND 4.0
2023 Book 99 || “SuperHyperCycle” Amazon

9578
[HG99b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7579929).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=LieqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=LieqEAAAQBAJ
@WordPress: -
2023 0098 | Neutrosophic SuperHyperGirth Amazon
[HG98b] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563170).
https://amazon.com/dp/B0BSV66BWV
https://amazon.com/dp/B0BSV7CZH4
9798374731323
9798374736922
CC BY-NC-ND 4.0
@googlebooks: http://books.google.com/books/about?id=yL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yL-qEAAAQBAJ
@WordPress: -
@Scribd: -
2023 0097 | Extreme SuperHyperGirth Amazon
[HG97b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563164).
https://www.amazon.com/dp/B0BSJPZV9J
https://www.amazon.com/dp/B0BSJPYVWJ
9798374731309
9798374736915
CC BY-NC-ND 4.0
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367351526E xtremeS uperHyperGirth
@Scribd: -
2023 0096 | “SuperHyperGirth” Amazon

9579
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

9580
[HG92b] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557009).
@googlebooks: http://books.google.com/books/about?id=47mqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=47mqEAAAQBAJ
https://www.amazon.com/dp/B0BSJDJSN7
https://www.amazon.com/dp/B0BSLKWW3F
9798374564266
9798374564785
CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0091 | “Overlook On SuperHyperMatching” Amazon
[HG91b] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: http://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
2023 0090 | “Neutrosophic Failed SuperHyperClique” Amazon
[HG90b] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=h7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=h7qqEAAAQBAJ
2023 0089 | “Extreme Failed SuperHyperClique” Amazon
[HG89b] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=gbqqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gbqqEAAAQBAJ
2023 0088 | “Overlook On Failed SuperHyperClique” Amazon
[HG88b] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=e7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=e7qqEAAAQBAJ
2023 0087 | “Extreme SuperHyperClique” Amazon

9581
[HG87b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574952).
Link (Paperback): https://www.amazon.com/dp/B0BT6WSZLD (Hardcover):

https://www.amazon.com/dp/B0BT743MW2 (Kindle Edition): ISBN (Paperback):
9798375140049 (Hardcover): 9798375141510 (Kindle Edition): CC BY-NC-ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=52 pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
@WordPress: -
2023 0086 | “Neutrosophic SuperHyperClique” Amazon
[HG86b] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574992).
@googlebooks: http://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BT6RD41C (Hardcover):
https://www.amazon.com/dp/B0BT733BB2 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
@WordPress: -
2023 0085 | “Extreme SuperHyperClique” Amazon
[HG85b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=52 pEAAAQBAJ

@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
2023 0084 | “Overlook On SuperHyperClique” Amazon
[HG84b] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=Cf6pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Cf6pEAAAQBAJ
9582
2023 0083 | “Neutrosophic Failed SuperHyperStable” Amazon
[HG83b] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=cLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cLuqEAAAQBAJ
2023 0082 | “Extreme Failed SuperHyperStable” Amazon
[HG82b] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=aruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=aruqEAAAQBAJ
2023 0081 | “Overlook On Failed SuperHyperStable” Amazon
[HG81b] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=YruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=YruqEAAAQBAJ
2023 0080 | “Neutrosophic SuperHyperStable” Amazon
[HG80b] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=gLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gLyqEAAAQBAJ
2023 0079 | “Extreme SuperHyperStable” Amazon
[HG79b] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=CryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=CryqEAAAQBAJ
2023 0078 | “Overlook On SuperHyperStable” Amazon
[HG78b] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=hLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=hLuqEAAAQBAJ
2023 0077 | Neutrosophic Failed SuperHyperForcing Amazon

9583
“Neutrosophic Failed SuperHyperForcing”
[HG77b] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=yLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yLyqEAAAQBAJ
2023 0076 | Extreme Failed SuperHyperForcing Amazon
[HG76b] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
“Extreme Failed SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=wLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=wLyqEAAAQBAJ
2023 0075 | Neutrosophic SuperHyperForcing Amazon
[HG75b] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Neutrosophic SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=5LyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=5LyqEAAAQBAJ
2023 0074 | Extreme SuperHyperForcing Amazon
[HG74b] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Extreme SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=3ryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=3ryqEAAAQBAJ
2023 0073 | Overlook On SuperHyperForcing Amazon
[HG73b] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Overlook On SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=zryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=zryqEAAAQBAJ
2023 0072 | Neutrosophic SuperHyperAlliances Amazon

9584
[HG72b] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Neutrosophic SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=cr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cr2qEAAAQBAJ
2023 0071 | Extreme SuperHyperAlliances Amazon
[HG71b] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Extreme SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=ZL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=ZL2qEAAAQBAJ
2023 0070 | Overlook On SuperHyperAlliances Amazon
[HG70b] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Overlook On SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=Sr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Sr2qEAAAQBAJ
2023 0069 | SuperHyperMatching Amazon
[HG69b] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: https://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/16/superhypermatching-
published-version/
Link
(Paperback): https://www.amazon.com/dp/B0BSDPXX1P
(Hardcover): https://www.amazon.com/dp/B0BSDC1L66
(Kindle Edition):
ISBN
(Paperback): 9798373872683
(Hardcover): 9798373875424
ASIN : B0BSDPXX1P Publisher : Independently published (January 15, 2023) Language
: English Paperback : 582 pages ISBN-13 : 979-8373872683 Item Weight : 3.6 pounds
Dimensions : 8.5 x 1.37 x 11 inches
ASIN : B0BSDC1L66 Publisher : Independently published (January 16, 2023) Language
: English Hardcover : 548 pages ISBN-13 : 979-8373875424 Item Weight : 3.3 pounds
9585
2023 0068 | Failed SuperHyperClique Amazon
[HG68b] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
https://www.amazon.com/dp/B0BRZ67NYN
https://www.amazon.com/dp/B0BRYZTK24
9798373274227
9798373277273
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/11/failed-superhyperclique-
published-version
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language
ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
: English Hardcover : 460 pages ISBN-13 : 979-8373277273 Item Weight : 2.78 pounds
2023 0067 | SuperHyperClique Amazon
[HG67b] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
https://www.amazon.com/dp/B0BRWK4S1Y
https://www.amazon.com/dp/B0BRM24YJX
9798373040471
9798373041935
@ZENODOO RG : zenodo.org/record/7523357
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/10/superhyperclique-published-
version-2/
ASIN : B0BRWK4S1Y Publisher : Independently published (January 8, 2023) Language
ASIN : B0BRM24YJX Publisher : Independently published (January 8, 2023) Language :
English Hardcover : 388 pages ISBN-13 : 979-8373041935 Item Weight : 2.36 pounds Dimensions
: 8.25 x 1.1 x 11 inches
2023 0066 | Failed SuperHyperStable Amazon

9586
[HG66b] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
https://www.amazon.com/dp/B0BRNG7DC8
https://www.amazon.com/dp/B0BRLVN39L
9798372597976
9798372599765
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/06/failed-superhyperstable-
published-version/
ASIN : B0BRNG7DC8 Publisher : Independently published (January 4, 2023) Language
ASIN : B0BRLVN39L Publisher : Independently published (January 4, 2023) Language :
: 8.25 x 0.91 x 11 inches
2023 0065 | SuperHyperStable Amazon
[HG65b] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
https://www.amazon.com/dp/B0BRDG5Z4Y
https://www.amazon.com/dp/B0BRJPG56M
9798372248519
9798372252011
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/03/superhyperstable-published-
version/
ASIN : B0BRDG5Z4Y Publisher : Independently published (January 2, 2023) Language
Dimensions : 8.27 x 0.7 x 11.69 inches
ASIN : B0BRJPG56M Publisher : Independently published (January 2, 2023) Language :
: 8.25 x 0.87 x 11 inches
2023 0064 | Failed SuperHyperForcing Amazon

9587
[HG64b] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=vryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vryqEAAAQBAJ
https://www.amazon.com/dp/B0BRH5B4QM
https://www.amazon.com/dp/B0BRGX4DBJ
9798372123649
9798372124509
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/01/failed-superhyperforcing-
published-version/
ASIN : B0BRH5B4QM Publisher : Independently published (January 1, 2023) Language
ASIN : B0BRGX4DBJ Publisher : Independently published (January 1, 2023) Language :
: 8.25 x 0.98 x 11 inches
2022 0063 | SuperHyperForcing Amazon
[HG63b] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language :
: 8.25 x 0.86 x 11 inches
https://www.amazon.com/dp/B0BRDG1KN1 https://www.amazon.com/dp/B0BRDFFQMF
9798371873347 9798371874092
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/30/superhyperforcing-
published-versian/
2022 0062 | SuperHyperAlliances Amazon

9588
[HG62b] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
ASIN : B0BR6YC3HG Publisher : Independently published (December 27, 2022) Language

ASIN : B0BR7CBTC6 Publisher : Independently published (December 27, 2022) Language :
: 8.25 x 0.64 x 11 inches
https://www.amazon.com/dp/B0BR6YC3HG https://www.amazon.com/dp/B0BR7CBTC6
9798371488343 9798371494849
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/28/superhyperalliances-
published-version/
2022 0061 | SuperHyperGraphs Amazon
[HG61b] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7480110).
@googlebooks: http://books.google.com/books/about?id=iL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=iL2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wor
ASIN : B0BR1NHY4Z Publisher : Independently published (December 24, 2022) Language :
English Paperback : 117 pages ISBN-13 : 979-8371090133 Item Weight : 13 ounces Dimensions
: 8.5 x 0.28 x 11 inches
ASIN : B0BQXTHTXY Publisher : Independently published (December 24, 2022) Language :
English Hardcover : 117 pages ISBN-13 : 979-8371093240 Item Weight : 12.6 ounces Dimensions
: 8.25 x 0.47 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BR1NHY4Z (Hardcover):
https://www.amazon.com/dp/B0BQXTHTXY (Kindle Edition):
ND 4.0
2022 0060 | Neut. SuperHyperEdges Amazon

9589
[HG60b] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7378758).
@GooglePlay: https://play.google.com/store/books/details?id=rr2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2022/11/29/neut-superhyperedges-
published-version/
ASIN : B0BNH11ZDY Publisher : Independently published (November 27, 2022) Language :
: 8.5 x 0.26 x 11 inches
ASIN : B0BNGZGPP6 Publisher : Independently published (November 27, 2022) Language :
: 8.25 x 0.45 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BNH11ZDY (Hardcover):
https://www.amazon.com/dp/B0BNGZGPP6
ND 4.0
2022 0059 | Neutrosophic k-Number Amazon
ASIN : B0BF3P5X4N Publisher : Independently published (September 14, 2022) Language

ASIN : B0BF2XCDZM Publisher : Independently published (September 14, 2022) Language :
: 8.25 x 0.57 x 11 inches
2022 0058 | Neutrosophic Schedule Amazon
ASIN : B0BBJWJJZF Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJLPWKH Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 1.35 x 11 inches
2022 0057 | Neutrosophic Wheel Amazon
ASIN : B0BBJRHXXG Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBK3KG82 Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.65 x 11 inches
2022 0056 | Neutrosophic t-partite Amazon
ASIN : B0BBJLZCHS Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJDFGJS Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.75 x 11 inches
2022 0055 | Neutrosophic Bipartite Amazon

9590
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

9591
ASIN : B0B7QGTNFW Publisher : Independently published (July 28, 2022) Language :

English Paperback : 133 pages ISBN-13 : 979-8842880348 Item Weight : 14.6 ounces Dimensions
: 8.5 x 0.32 x 11 inches
ASIN : B0B7QJWQ35 Publisher : Independently published (July 28, 2022) Language :
: 8.25 x 0.51 x 11 inches
2022 0047 | Neutrosophic Total Amazon
ASIN : B0B7GLB23F Publisher : Independently published (July 25, 2022) Language : English
Paperback : 137 pages ISBN-13 : 979-8842357741 Item Weight : 14.9 ounces Dimensions : 8.5
x 0.33 x 11 inches
ASIN : B0B6XVTDYC Publisher : Independently published (July 25, 2022) Language :
: 8.25 x 0.52 x 11 inches
2022 0046 | Neutrosophic Perfect Amazon
ASIN : B0B7CJHCYZ Publisher : Independently published (July 22, 2022) Language :

: 8.5 x 0.3 x 11 inches
ASIN : B0B7C732Z1 Publisher : Independently published (July 22, 2022) Language : English
Hardcover : 127 pages ISBN-13 : 979-8842028757 Item Weight : 13.6 ounces Dimensions : 8.25
x 0.49 x 11 inches
2022 0045 | Neutrosophic Joint Set Amazon
ASIN : B0B6L8WJ77 Publisher : Independently published (July 15, 2022) Language : English
Paperback : 139 pages ISBN-13 : 979-8840802199 Item Weight : 15 ounces Dimensions : 8.5 x
0.33 x 11 inches
ASIN : B0B6L9GJWR Publisher : Independently published (July 15, 2022) Language :
: 8.25 x 0.52 x 11 inches
August 30, 0044 | Neutrosophic Duality GLOBAL

2022 KNOWLEDGE -
Publishing
House&Amazon&Google
Scholar&UNM
[HG44b] H. Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6677173).
Neutrosophic Duality, GLOBAL KNOWLEDGE - Publishing House:
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131
United States. ISBN: 978-1-59973-743-0
Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing
House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0
(http://fs.unm.edu/NeutrosophicDuality.pdf).
ASIN : B0B4SJ8Y44 Publisher : Independently published (June 22, 2022) Language : English
Paperback : 115 pages ISBN-13 : 979-8837647598 Item Weight : 12.8 ounces Dimensions : 8.5
x 0.27 x 11 inches
ASIN : B0B46B4CXT Publisher : Independently published (June 22, 2022) Language : English
Hardcover : 115 pages ISBN-13 : 979-8837649981 Item Weight : 12.5 ounces Dimensions : 8.25
x 0.46 x 11 inches
GLOBAL KNOWLEDGE - Publishing House: http://fs.unm.edu/NeutrosophicDuality.pdf
UNM: http://fs.unm.edu/NeutrosophicDuality.pdf
Google Scholar: https://books.google.com/books?id=dWWkEAAAQBAJ
Paperback: https://www.amazon.com/dp/B0B4SJ8Y44
Hardcover: https://www.amazon.com/dp/B0B46B4CXT
2022 0043 | Neutrosophic Path-Coloring Amazon
9592
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
9593
2022 0036 | Clique Number in Neutrosophic Graph Amazon
ASIN : B09TV82Q7T Publisher : Independently published (March 7, 2022) Language

ASIN : B09TZBPWJG Publisher : Independently published (March 7, 2022) Language :
: 8.25 x 0.56 x 11 inches
2022 0035 | Independence in Neutrosophic Graphs Amazon
ASIN : B09TF227GG Publisher : Independently published (February 27, 2022) Language :

English Paperback : 149 pages ISBN-13 : 979-8424231681 Item Weight : 1 pounds Dimensions
: 8.5 x 0.35 x 11 inches
ASIN : B09TL1LSKD Publisher : Independently published (February 27, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0034 | Zero Forcing Number in Neutrosophic Graphs Amazon
ASIN : B09SW2YVKB Publisher : Independently published (February 18, 2022) Language :

: 8.5 x 0.35 x 11 inches
ASIN : B09SWLK7BG Publisher : Independently published (February 18, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0033 | Neutrosophic Quasi-Order Amazon
ASIN : B09S3RXQ5C Publisher : Independently published (February 8, 2022) Language :

: 8.5 x 0.26 x 11 inches
ASIN : B09S232DQH Publisher : Independently published (February 8, 2022) Language :
: 8.25 x 0.43 x 11 inches
Jan 29, 2022 0032 | Beyond Neutrosophic Graphs E-

publishing&Amazon&Google
Scholar&UNM
[HG32b] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6320305).
Beyond Neutrosophic Graphs, E-publishing:
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States
ISBN 978-1-59973-725-6
Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
ASIN : B0BBCQJQG5 Publisher : Independently published (August 8, 2022) Language
ASIN : B0BBC4BJZ5 Publisher : Independently published (August 8, 2022) Language : English
Hardcover : 257 pages ISBN-13 : 979-8847567497 Item Weight : 1.61 pounds Dimensions : 8.25
x 0.8 x 11 inches
E-publishing: Educational Publisher: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
UNM: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
Google Scholar:https://books.google.com/books?id=cWWkEAAAQBAJ
Paperback: https://www.amazon.com/gp/product/B0BBCQJQG5
Hardcover: https://www.amazon.com/Beyond-Neutrosophic-Graphs-Henry-
Garrett/dp/B0BBC4BJZ5
2022 0031 | Neutrosophic Alliances Amazon

9594
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

9595
ASIN : B09M554XCL Publisher : Independently published (November 20, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0022 | Theorems Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0021 | Dimension Amazon
ASIN : B09K2BBQG7 Publisher : Independently published (October 25, 2021) Language :

English Paperback : 55 pages ISBN-13 : 979-8753577146 Item Weight : 7 ounces Dimensions :
8.5 x 0.13 x 11 inches
-
2021 0020 | Beyond The Graph Theory Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0019 | Located Heart And Memories Amazon
ASIN : B09F14PL8T Publisher : Independently published (August 31, 2021) Language :

8.5 x 0.14 x 11 inches
-
2021 0018 | Number Graphs And Numbers Amazon
ASIN : B099BQRSF8 Publisher : Independently published (July 14, 2021) Language : English
Paperback : 32 pages ISBN-13 : 979-8537474135 Item Weight : 4.8 ounces Dimensions : 8.5 x
0.08 x 11 inches
-
2021 0017 | First Place Is Reserved Amazon
ASIN : B098CWD5PT Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.13 x 11 inches
-
2021 0016 | Detail-oriented Groups And Ideas Amazon
ASIN : B098CYYG3Q Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.17 x 11 inches
-
2021 0015 | Definition And Its Necessities Amazon
ASIN : B098DHRJFD Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.19 x 11 inches
-
9596
2021 0014 | Words And Their Directionss Amazon
ASIN : B098CYS8G2 Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.16 x 11 inches
-
2021 0013 | Tattooed Heart But Forever Amazon
ASIN : B098CR8HM6 Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.11 x 11 inches
-
2021 0012 | Metric Number In Dimension Amazon
ASIN : B0913597TV Publication date : March 24, 2021 Language : English File size : 28445
KB Text-to-Speech : Enabled Enhanced typesetting : Enabled X-Ray : Not Enabled Word
Wise : Not Enabled Print length : 48 pages Lending : Not Enabled Kindle
-
2021 0011 | Domination Theory And Beyond Amazon
ASIN : B098DMMZ87 Publisher : Independently published (June 30, 2021) Language

-
2021 0010 | Vital Glory Amazon
ASIN : B08PVNJYRM Publication date : December 6, 2020 Language : English File size
: 1544 KB Simultaneous device usage : Unlimited Text-to-Speech : Enabled Screen Reader :
Supported Enhanced typesetting : Enabled X-Ray : Not Enabled Word Wise : Enabled Print
length : 24 pages Lending : Enabled Kindle
-
2021 0009 | Análisis de modelos y orientación más allá AmazonUK&MoreBooks
Análisis de modelos y orientación más allá Planteamiento y problemas en dos modelos

Ediciones Nuestro Conocimiento (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59902-
2 ISBN-10:6203599026EAN:9786203599022Book language:Blurb/Shorttext:El enfoque para la
resolución de problemas es una selección obvia para hacer la investigación y el análisis de la
situación que puede provocar las perspectivas vagas que queremos no ser para extraer ideas
creativas y nuevas que queremos ser. Estudio simultáneamente dos modelos. Este estudio se
basa tanto en la investigación como en la discusión que el autor piensa que puede ser útil
para entender y hacer crecer nuestra fantası́a y la realidad juntas.Publishing house: Ediciones
Nuestro Conocimiento Website: https://sciencia-scripts.com By (author) : Henry Garrett
Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Dos modelos, optimización de rutas y transporte, Two Models, Optimizing Routes
and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/análisis-de-modelos-y-orientación-más-
allá/isbn/978-620-3-59902-2
Product details Publisher : Ediciones Nuestro Conocimiento (6 April 2021) Language :
Spanish ISBN-10 : 6203599026 ISBN-13 : 978-6203599022 Dimensions : 15 x 0.4 x 22 cm
Paperback:
https://www.amazon.co.uk/Análisis-modelos-orientación-allá-Planteamiento/dp/6203599026
2021 0008 | Анализ моделей и руководство за пределами Amazon&MoreBooks

9597
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9598
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
9599
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
9600
2021 0002 | Modell-Analysen und Anleitungen darüber hinaus Amazon | MoreBooks |
Walmart | eBay
eligible for voucher ISBN-13: 978-620-3-59901-5 ISBN-
10:6203599018EAN:9786203599015Book language: German Blurb/Shorttext:Die
Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann.Publishing house: Verlag
Unser Wissen Website: https://sciencia-scripts.com By (author) : Henry Garrett Number
of pages:68Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Zwei Modelle, Optimierung von Routen und Transport, Two Models, Optimizing
Routes and Transportation
MoreBooksHenry Garrett Modell-Analysen und Anleitungen darüber hinaus (Paperback)
About this item
Product details
Die Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann. Modell-Analysen und
Anleitungen darüber hinaus (Paperback) We aim to show you accurate product information.
Manufacturers, suppliers and others provide what you see here, and we have not verified it.
See our disclaimer Specifications
Language German Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 68 Author Henry Garrett Title Modell-Analysen und Anleitungen darüber hinaus
ISBN-13 9786203599015 Publication Date April, 2021 Assembled Product Dimensions (L x W
x H) 9.00 x 6.00 x 1.50 Inches ISBN-10 6203599018
Walmart
Seller assumes all responsibility for this listing. Item specifics Condition: New: A new, unread,
unused book in perfect condition with no missing or damaged pages. See the ... Read
moreabout the condition ISBN: 9786203599015 EAN: 9786203599015 Publication Year: 2021
Type: Textbook Format: Paperback Language: German Publication Name: Modell-Analysen
Und Anleitungen Daruber Hinaus Item Height: 229mm Author: Henry Garrett Publisher:
Verlag Unser Wissen Item Width: 152mm Subject: Mathematics Item Weight: 113g Number of
Pages: 68 Pages About this product Product Information Die Herangehensweise zur Loesung
von Problemen ist eine offensichtliche Auswahl fur die Forschung und Analyse der Situation, die
die vagen Perspektiven, die wir nicht sein wollen, fur die Extraktion von kreativen und neuen
Ideen, die wir sein wollen, hervorbringen kann. Ich studiere gleichzeitig zwei Modelle. Diese
Studie basiert sowohl auf der Forschung als auch auf der Diskussion, von der der Autor denkt,
dass sie fur das Verstandnis und das Zusammenwachsen unserer Fantasie und Realitat nutzlich
sein kann. Product Identifiers Publisher Verlag Unser Wissen ISBN-13 9786203599015 eBay
Product ID (ePID) 11049032082 Product Key Features Publication Name Modell-Analysen
Und Anleitungen Daruber Hinaus Format Paperback Language German Subject Mathematics
Publication Year 2021 Type Textbook Author Henry Garrett Number of Pages 68 Pages
Dimensions Item Height 229mm Item Width 152mm Item Weight 113g Additional Product
Features Title
A uthorHenryGarrett
eBay
Modell-Analysen und Anleitungen darüber hinaus: Ansatz und Probleme in zwei Modellen
(German Edition) Publisher : Verlag Unser Wissen (April 6, 2021) Language : German
Paperback : 68 pages ISBN-10 : 6203599018 ISBN-13 : 978-6203599015 Item Weight : 3.99
ounces Dimensions : 5.91 x 0.16 x 8.66 inches Paperback
2021 0001 | Model Analyses and Guidance Beyond Amazon&MoreBooks

9601
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
9602
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
...
9603
Social Accounts
I’ve listed my accounts below.
-My website [Covering all my contributions containing articles and books as free access to download with PDF
extension and more]: https://drhenrygarrett.wordpress.com
-Amazon [Some of my all books, here]: https://www.amzn.com/author/drhenrygarrett
-Twitter: @DrHenryGarrett (www.twitter.com/DrHenryGarrett)
– ResearchGate: https://www.researchgate.net/profile/Henry-Garrett-2
-Academia: https://independent.academia.edu/drhenrygarrett/
-Scribd: https://www.scribd.com/user/596815491/Henry-Garrett
-Scholar: https://scholar.google.com/citations?hl=enuser=SUjFCmcAAAAJview_op=list_workssortby=pubdate
-LinkedIn: https://www.linkedin.com/in/drhenrygarrett/
9604
Certificate of Reviewer
Reference: AJCST Date: December 11, 2022
The certificate is awarded to
Henry Garrett, Department of Mathematics, City University of New York, New York, United States
In recognition of the appointment as a Reviewer of American Journal of Computer Science and Technology(AJCST)
ISSN Print: 2640-0111; ISSN Online: 2640-012X
https://www.sciencepg.com/j/ajcst
from December 11, 2022 to December 11, 2024
9605
9606
9607
Henry Garrett
01/23/2022
9608
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
9609
View publication stats

United Dominating in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

United Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

United Dominating In SuperHyperGraphs

Book · June 2023

486 PUBLICATIONS 18,701 CITATIONS

Number Graphs And Numbers View project

Neutrosophic Graphs View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

5 Extreme United Dominating 47

6 New Ideas On Super Units By Hyper Ultra Of United Dominating In

8 Applied Notions Under The Scrutiny Of The Motivation Of This

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

10 Extreme SuperHyperUnited Dominating But As The Extensions Excerpt

11 The Extreme Departures on The Theoretical Results Toward Theoretical

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

13 Extreme Applications in Cancer’s Extreme Recognition 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

25 Cancer In Neutrosophic SuperHyperGraph 249

26 Neutrosophic United Dominating 253

27 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

29 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

30 Neutrosophic Preliminaries Of This Scientific Research On the Re-

31 Neutrosophic SuperHyperUnited Dominating But As The Extensions Ex-

32 The Neutrosophic Departures on The Theoretical Results Toward

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

34 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 343

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

36 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

37 Wondering Open Problems But As The Directions To Forming The

38 Conclusion and Closing Remarks 351

39 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

40 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

41 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

42 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

43 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

45 Books’ Contributions 453

46 “SuperHyperGraph-Based Books”: | Featured Tweets 465

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperUnited

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

31.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

31.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

32.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

35.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

36.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

46.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 466

Henry Garrett · Independent Researcher · Department of Mathematics ·

46.17“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 480