Dominating-Edges in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/370818924
Dominating-Edges In SuperHyperGraphs
Book · May 2023

DOI: 10.5281/zenodo.7943871
CITATIONS
1 author:
Henry Garrett
475 PUBLICATIONS 17,114 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 17 May 2023.
The user has requested enhancement of the downloaded file.

Dominating-Edges 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 Dominating-Edges 47
6 New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges In

Cancer’s Recognition 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 SuperHyperDominating-Edges 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 Cancer In Neutrosophic SuperHyperGraph 247
25 Neutrosophic Dominating-Edges 251
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Dominating-Edges As Hyper Dome On Super Eddy 253
27 ABSTRACT 255
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 265

30 Neutrosophic SuperHyperDominating-Edges But As The Extensions Excerpt

31 The Neutrosophic Departures on The Theoretical Results Toward

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

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

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

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

Motivations 347
37 Conclusion and Closing Remarks 349
38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

43 Background 421
Bibliography 427
44 Books’ Contributions 451
45 “SuperHyperGraph-Based Books”: | Featured Tweets 463
46 CV 491

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

SuperHyperDominating-Edges in the Extreme Example (42.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

SuperHyperDominating-Edges in the Example (42.0.5) . . . . . . . . . . . . . . . . . . 116
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperDominating-Edges in the Example (42.0.11) . . . . . . . . . . . . . 121
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperDominating-Edges in the Extreme Example (42.0.15) . . . . . . . 124
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperDominating-Edges . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.3) . . 283


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

31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.7) . . . 322
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.9) . . . 323
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperDominating-Edges in the Example (42.0.11) . . . . 325
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 328

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7943578). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 452
(doi: 10.5281/zenodo.7943578). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
(doi: 10.5281/zenodo.7943578). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023,
(doi: 10.5281/zenodo.7940830). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 454
(doi: 10.5281/zenodo.7940830). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
(doi: 10.5281/zenodo.7940830). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
44.7 [HG172b] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7943871). . . . . . . . . . . . . . . . . . . . . . 459
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 464

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 465
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 466
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 472



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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 344

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 346
37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 350
xi
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme 1
Dominating-Edges In SuperHyperGraphs” and “Neutrosophic Dominating-Edges In SuperHy- 2
perGraphs” about some scientific research on Dominating-Edges In SuperHyperGraphs by two 3

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

a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 35
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 36
Neighbors 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 Dominating-Edges In 40

SuperHyperGraphs . Since there’s more ways to get type-results to make a Dominating-Edges 41
In SuperHyperGraphs more understandable. For the sake of having Neutrosophic Dominating- 42
Edges In SuperHyperGraphs, there’s a need to “redefine” the notion of a “Dominating-Edges In 43
SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 44
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 Dominating-Edges In SuperHyperGraphs . It’s 46

redefined a Neutrosophic Dominating-Edges In SuperHyperGraphs if the mentioned Table holds, 47
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 48
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 49
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 50
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 51
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 52
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 53
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 54
based on a Dominating-Edges In SuperHyperGraphs . It’s the main. It’ll be disciplinary 55
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 56
need to have all Dominating-Edges In SuperHyperGraphs until the Dominating-Edges In 57
SuperHyperGraphs, then it’s officially called a “Dominating-Edges In SuperHyperGraphs” but 58

otherwise, it isn’t a Dominating-Edges In SuperHyperGraphs . There are some instances about 59
the clarifications for the main definition titled a “Dominating-Edges In SuperHyperGraphs ”. 60
These two examples get more scrutiny and discernment since there are characterized in the 61
disciplinary ways of the SuperHyperClass based on a Dominating-Edges In SuperHyperGraphs 62
. For the sake of having a Neutrosophic Dominating-Edges In SuperHyperGraphs, there’s a 63
need to “redefine” the notion of a “Neutrosophic Dominating-Edges In SuperHyperGraphs” 64

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

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

SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Dominating-Edges In 76
SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 77
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 78
Table holds. A SuperHyperGraph has a “Neutrosophic Dominating-Edges In SuperHyperGraphs” 79

where it’s the strongest [the maximum Neutrosophic value from all the Dominating-Edges In 80
SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a Dominating- 81
Edges In SuperHyperGraphs .] Dominating-Edges 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 Dominating-Edges In SuperHyperGraphs if it’s only 86

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

longest Dominating-Edges In SuperHyperGraphs, called Dominating-Edges In SuperHyper- 116
Graphs, and the strongest Dominating-Edges In SuperHyperGraphs, called Neutrosophic 117
Dominating-Edges In SuperHyperGraphs, some general results are introduced. Beyond that 118
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 119
not enough since it’s essential to have at least three SuperHyperEdges to form any style of 120
a Dominating-Edges In SuperHyperGraphs. There isn’t any formation of any Dominating- 121

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

|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 157
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 158
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 159
version of Dominating-Edges In SuperHyperGraphs . Since there’s more ways to get type-results 160
to make Dominating-Edges In SuperHyperGraphs more understandable. For the sake of 161

having Neutrosophic Dominating-Edges In SuperHyperGraphs, there’s a need to “redefine” 162
the notion of “Dominating-Edges In SuperHyperGraphs ”. The SuperHyperVertices and the 163
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 164
there’s the usage of the position of labels to assign to the values. Assume a Dominating-Edges 165
In SuperHyperGraphs . It’s redefined Neutrosophic Dominating-Edges In SuperHyperGraphs 166
if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 167
HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the 168
key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values 169
of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 170
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 171

Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 172
To get structural examples and instances, I’m going to introduce the next SuperHyperClass of 173
SuperHyperGraph based on Dominating-Edges In SuperHyperGraphs . It’s the main. It’ll be 174
disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If 175
there’s a need to have all Dominating-Edges In SuperHyperGraphs until the Dominating-Edges 176
In SuperHyperGraphs, then it’s officially called “Dominating-Edges In SuperHyperGraphs” but 177
otherwise, it isn’t Dominating-Edges In SuperHyperGraphs . There are some instances about 178
the clarifications for the main definition titled “Dominating-Edges In SuperHyperGraphs ”. 179
disciplinary ways of the SuperHyperClass based on Dominating-Edges In SuperHyperGraphs 181
. For the sake of having Neutrosophic Dominating-Edges In SuperHyperGraphs, there’s a 182
need to “redefine” the notion of “Neutrosophic Dominating-Edges In SuperHyperGraphs” and 183
“Neutrosophic Dominating-Edges In SuperHyperGraphs ”. The SuperHyperVertices and the 184

SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 185
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 186
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. 187
And Dominating-Edges In SuperHyperGraphs are redefined “Neutrosophic Dominating-Edges 188
In SuperHyperGraphs” if the intended Table holds. It’s useful to define “Neutrosophic” version 189
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make 190
Neutrosophic Dominating-Edges In SuperHyperGraphs more understandable. Assume a Neut- 191
rosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 192
Table holds. Thus SuperHyperPath, Dominating-Edges In SuperHyperGraphs, SuperHyperStar, 193
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 194
SuperHyperPath”, “Neutrosophic Dominating-Edges In SuperHyperGraphs”, “Neutrosophic 195
SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPart- 196

ite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 197
has “Neutrosophic Dominating-Edges In SuperHyperGraphs” where it’s the strongest [the 198
maximum Neutrosophic value from all Dominating-Edges In SuperHyperGraphs amid the 199
maximum value amid all SuperHyperVertices from a Dominating-Edges In SuperHyperGraphs 200
.] Dominating-Edges In SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyper- 201
Graph and the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 202
SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s 203
only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; 204
it’s Dominating-Edges In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 205
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 206
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 207
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 208
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 209
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 210
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 211
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 212
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 213
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 214
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 215
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 216
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 217

“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 218
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 219
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 220
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 221
ways. The Neutrosophic recognition of the cancer in the long-term function. The specific 222
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 223
the move from the cancer is identified by this research. Sometimes the move of the cancer 224
about the moves and the effects of the cancer on that region; this event leads us to choose 226
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 227
on what’s happened and what’s done. There are some specific models, which are well-known 228
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and 229
the traces of the cancer on the complex tracks and between complicated groups of cells could 230
be fantasized by a Neutrosophic SuperHyperPath(-/Dominating-Edges In SuperHyperGraphs, 231
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 232
aim is to find either the longest Dominating-Edges In SuperHyperGraphs or the strongest 233
Dominating-Edges In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the 234
longest Dominating-Edges In SuperHyperGraphs, called Dominating-Edges In SuperHyper- 235
Graphs, and the strongest Dominating-Edges In SuperHyperGraphs, called Neutrosophic 236

Dominating-Edges In SuperHyperGraphs, some general results are introduced. Beyond that 237
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 238
not enough since it’s essential to have at least three SuperHyperEdges to form any style of 239
a Dominating-Edges In SuperHyperGraphs. There isn’t any formation of any Dominating- 240
Edges In SuperHyperGraphs but literarily, it’s the deformation of any Dominating-Edges 241
In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A basic familiarity with 242
SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are proposed. 243
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Dominating-Edges In SuperHy- 244
perGraphs, Cancer’s Neutrosophic Recognition 245

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

Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 263
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 264
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 265
Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 266
33131 United States. This research book presents different types of notions SuperHyperResolving 267
and Dominating-Edges In SuperHyperGraphs in the setting of duality in neutrosophic graph 268

theory and neutrosophic SuperHyperGraph theory. This research book has scrutiny on the 269
complement of the intended set and the intended set, simultaneously. It’s smart to consider a 270
set but acting on its complement that what’s done in this research book which is popular in the 271
terms of high readers in Scribd. 272
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 273
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 274
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 275
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 276
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 277
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 278




CHAPTER 2 279
Background 280
There are some scientific researches covering the topic of this research. In what follows, there 281
are some discussion and literature reviews about them. 282
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 283
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 284
Neutrosophic Super Hyper Classes” in Ref. [HG1] by Henry Garrett (2022). In this research 285
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 286
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 287
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 288
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 289

abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 290
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph 291
and SuperHyperGraph. It’s the breakthrough toward independent results based on initial 292
background and fundamental SuperHyperNumbers. 293
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co- 294
Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 295
Applications in Cancer’s Treatments” in Ref. [HG2] by Henry Garrett (2023). In this research 296
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 297
perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 298
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 299
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 300
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 301
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 302
toward independent results based on initial background and fundamental SuperHyperNumbers. 303
The seminal paper and groundbreaking article is titled “A Research on Cancer’s Recognition 304
and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets 305
as Hyper Covering Versus Super separations” in Ref. [HG3] by Henry Garrett (2023). In 306
this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 307
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Recognition. 308
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 309
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 310
11
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 314
degree alongside chromatic numbers in the setting of some classes related to neutrosophic hyper- 315
graphs” in Ref. [HG93] by Henry Garrett (2023). In this research article, a novel approach 316
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 317
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 318
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 319
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 2 and 320
issue 1 with pages 16-24. The research article studies deeply with choosing neutrosophic hyper- 321
graphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 322
results based on initial background. In some articles are titled “0039 | Closing Numbers and 323
Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 324
(Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1- 325
Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), 326
“Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition 327
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry 328
Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions 329
Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs 330
Titled Cancer’s Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of 331
Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. 332

[HG8] by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and 333
Affected Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 334
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 335
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 336
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 337
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 338
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 339
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 340
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 341
Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 342
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 343
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 344

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

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 350
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 351
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 352
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 353
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 354
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 355

in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 356
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 357
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 358
Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 359

Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 360
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 361
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 362
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 363
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 364
Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 365
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 366

Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyper- 367
Dominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions 368
in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett 369
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recog- 370
nition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The 371
Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 372
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 373
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 374
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 375
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 376
Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 377
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recogni- 378
tion called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 379
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 380
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 381
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 382
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 383
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 384
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 385
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 386
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 387
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 388
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 389
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 390

[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 391
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 392
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 393
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 394
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 395

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 396
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 397
eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 398
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 399
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 400
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 401
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 402
Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 403
HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; 404

HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; 407
HG262; HG263; HG264; HG265; HG266; HG267], there are some endeavors to formalize 422
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 423
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 424
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; 425
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 428
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 429


HG169b; HG170b; HG171b; HG172b; HG173b]. Two popular scientific research books 437
in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutrosophic science is on 438
[HG32b; HG44b]. 439
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 440
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 441
more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 442
by Dr. Henry Garrett. This research book covers different types of notions and settings in 443
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 444
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 445
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 446
has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 447
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 448
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 449
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 450
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 451

that what’s done in this research book which is popular in the terms of high readers in Scribd. 452
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions 453
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyper- 454
Graphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; 455
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 456
HG260; HG261; HG262; HG263; HG264; HG265; HG266; HG267] alongside scientific 474
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 475


HG171b; HG172b; HG173b]. Two popular scientific research books in Scribd in the terms 488
of high readers, 4331 and 5327 respectively, on neutrosophic science is on [HG32b; HG44b]. 489

Bibliography 490
HG1 [1] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 491
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 492
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 493
10.33140/JMTCM.01.03.09) 494
HG2 [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 495
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 496
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 497
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 498
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 499
alongside-a.pdf) 500
HG3 [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 501
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 502
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 503
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 504

recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 505
hamiltonian-sets-.pdf) 506
HG93 [4] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 507
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 508
Trends Comp Sci Res 2(1) (2023) 16-24. (https://www.opastpublishers.com/open-access- 509
articles/neutrosophic-codegree-and-neutrosophic-degree-alongside-chromatic-numbers- 510
in-the-setting-of-some-classes-related-to-neut.pdf) 511
HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 512
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 513
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 514
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 515

https://oa.mg/work/10.5281/zenodo.6319942 516
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 517
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 518
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 519
https://oa.mg/work/10.13140/rg.2.2.35241.26724 520
17
HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 521
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 522
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 523
HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 524
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 525
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 526
10.20944/preprints202301.0282.v1). 527
HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 528
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 529
10.20944/preprints202301.0267.v1). 530
HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 531
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 532
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 533
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 534

(doi: 10.20944/preprints202301.0265.v1). 535
HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 536
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 537
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 538
prints202301.0262.v1). 539
HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 540
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 541
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 542
HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 543
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 544
2023010224, (doi: 10.20944/preprints202301.0224.v1). 545
HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 546
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 547
prints202301.0105.v1). 548
HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 549
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 550
HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 552
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 553
Preprints 2023, 2023010044 554
HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 555
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 556
10.20944/preprints202301.0043.v1). 557
HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 558
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 559

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 564
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 565
(doi: 10.20944/preprints202212.0549.v1). 566
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 567
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 568
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 569
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 570
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 571
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 572
(doi: 10.20944/preprints202212.0500.v1). 573
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 574
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 575
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 577
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 578
HG267 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 580
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 581
10.5281/zenodo.7940830). 582
HG266 [26] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 583
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 584
10.5281/zenodo.7943578). 585
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 587
odo.7916595). 588
HG264 [28] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 589
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 590
odo.7923632). 591
HG263 [29] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 592
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 593
(doi: 10.5281/zenodo.7904698). 594
HG262 [30] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 595
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 596
2023, (doi: 10.5281/zenodo.7904671). 597

By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 599
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 600
HG260 [32] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 601
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 602
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 603
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 605
10.5281/zenodo.7871026). 606
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 608
2023, (doi: 10.5281/zenodo.7874647). 609
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 611
10.5281/zenodo.7857856). 612
HG256 [36] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 613
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 614
2023, (doi: 10.5281/zenodo.7857841). 615
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 617
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 620
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 623
10.5281/zenodo.7853867). 624
HG252 [40] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 625
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 626
10.5281/zenodo.7853922). 627
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 629
(doi: 10.5281/zenodo.7851519). 630
HG250 [42] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 631
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 632
(doi: 10.5281/zenodo.7851550). 633
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 635

Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 638
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 641
10.5281/zenodo.7834229). 642
HG246 [46] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 643
10.5281/zenodo.7834261). 645
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 647
10.5281/zenodo.7824560). 648
HG244 [48] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 649
(doi: 10.5281/zenodo.7824623). 651
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 653
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 656
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 659
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 661
2023, (doi: 10.5281/zenodo.7809365). 662
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 664
2023, (doi: 10.5281/zenodo.7809358). 665
HG238 [54] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 666
10.5281/zenodo.7809219). 668
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 670
10.5281/zenodo.7809328). 671
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 673
2023, (doi: 10.5281/zenodo.7806767). 674

HG235 [57] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 675
2023, (doi: 10.5281/zenodo.7806838). 677
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 679
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 680
HG233 [59] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 681
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 682
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 683
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 685
10.5281/zenodo.7799902). 686
HG231 [61] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 687
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 688
(doi: 10.5281/zenodo.7804218). 689
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 691
(doi: 10.5281/zenodo.7796334). 692
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 694
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 697
10.5281/zenodo.7791952). 698
HG225 [65] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 699
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 700
10.5281/zenodo.7791982). 701
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 703
10.5281/zenodo.7790026). 704
HG223 [67] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 705
10.5281/zenodo.7790052). 707
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 709
2023, (doi: 10.5281/zenodo.7787066). 710
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 712
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 713

By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 715
10.5281/zenodo.7781476). 716
HG219 [71] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 717
10.5281/zenodo.7783082). 719
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 721
10.5281/zenodo.7777857). 722
HG217 [73] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 723
10.5281/zenodo.7779286). 725
HG215 [74] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 726
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 727
(doi: 10.5281/zenodo.7771831). 728
HG214 [75] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 729
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 730
2023, (doi: 10.5281/zenodo.7772468). 731
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 733
10.13140/RG.2.2.20913.25446). 734
HG212 [77] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 735
odo.7764916). 737
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 739
10.13140/RG.2.2.11770.98247). 740
HG210 [79] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 741
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 742
10.13140/RG.2.2.12400.12808). 743
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 745
2023, (doi: 10.13140/RG.2.2.22545.10089). 746
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 748
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 749
HG207 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 750
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 751
10.13140/RG.2.2.11377.76644). 752

HG206 [83] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 753
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 754
10.13140/RG.2.2.23750.96329). 755
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 757
10.13140/RG.2.2.31366.24641). 758
HG204 [85] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 759
10.13140/RG.2.2.34721.68960). 761
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 763
2023, (doi: 10.13140/RG.2.2.30212.81289). 764
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 766
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 769
10.13140/RG.2.2.24288.35842). 770
HG200 [89] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 771
10.13140/RG.2.2.32467.25124). 773
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 775
10.13140/RG.2.2.31025.45925). 776
HG198 [91] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 777
10.13140/RG.2.2.17184.25602). 779
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 781
10.13140/RG.2.2.23423.28327). 782
HG196 [93] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 783
10.13140/RG.2.2.28456.44805). 785
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 787
10.13140/RG.2.2.23525.68320). 788
HG194 [95] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 789
10.13140/RG.2.2.20170.24000). 791

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 793
10.13140/RG.2.2.36475.59683). 794
HG192 [97] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 795
10.13140/RG.2.2.29764.71046). 797
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 799
2023, (doi: 10.13140/RG.2.2.18780.87683). 800
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 802
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 805
10.13140/RG.2.2.26134.01603). 806
HG188 [101] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 807
10.13140/RG.2.2.27392.30721). 809
HG187 [102] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 810
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 811
10.13140/RG.2.2.33028.40321). 812
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 814
10.13140/RG.2.2.21389.20966). 815
HG185 [104] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 816
10.13140/RG.2.2.16356.04489). 818
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 820
10.13140/RG.2.2.21756.21129). 821
HG183 [106] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 822
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 823
10.13140/RG.2.2.30983.68009). 824
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 826
10.13140/RG.2.2.28552.29445). 827
HG181 [108] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 828
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 829
(doi: 10.13140/RG.2.2.10936.21761). 830

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 832
10.13140/RG.2.2.35105.89447). 833
HG179 [110] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 834
(doi: 10.13140/RG.2.2.30072.72960). 836
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 838
10.13140/RG.2.2.31147.52003). 839
HG177 [112] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 840
10.13140/RG.2.2.32825.24163). 842
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 844
10.13140/RG.2.2.13059.58401). 845
HG175 [114] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 846
10.13140/RG.2.2.11172.14720). 848
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 850
2023, (doi: 10.13140/RG.2.2.22011.80165). 851
HG173 [116] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 852
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 853
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 854
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 856
2023, (doi: 10.13140/RG.2.2.10493.84962). 857
HG171 [118] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 858
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 860
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 862
2023, (doi: 10.13140/RG.2.2.19944.14086). 863
HG169 [120] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 864
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 866
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 868
(doi: 10.13140/RG.2.2.33103.76968). 869

HG167 [122] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 870
(doi: 10.13140/RG.2.2.23037.44003). 872
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 874
(doi: 10.13140/RG.2.2.35646.56641). 875
HG165 [124] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 876
10.13140/RG.2.2.18030.48967). 878
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 880
(doi: 10.13140/RG.2.2.13973.81121). 881
HG163 [126] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 882
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 883
2023, (doi: 10.13140/RG.2.2.34106.47047). 884
HG162 [127] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 885
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 886
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 889
2023, (doi: 10.13140/RG.2.2.31956.88961). 890
HG160 [129] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 891
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 892
2023, (doi: 10.13140/RG.2.2.15179.67361). 893
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 895
10.13140/RG.2.2.21510.45125). 896
HG158 [131] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 897
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 898
2023, (doi: 10.13140/RG.2.2.13121.84321). 899
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 901
10.13140/RG.2.2.11758.69441). 902
HG156 [133] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 903
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 904
2023, (doi: 10.13140/RG.2.2.31891.35367). 905
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 907
10.13140/RG.2.2.19360.87048). 908

HG154 [135] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 909
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 910
10.13140/RG.2.2.32363.21286). 911
HG153 [136] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 912
10.13140/RG.2.2.23266.81602). 914
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 916
10.13140/RG.2.2.19911.37285). 917
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 919
10.13140/RG.2.2.11050.90569). 920
HG150 [139] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 921
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 922
2023, (doi: 10.13140/RG.2.2.17761.79206). 923
HG149 [140] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 924
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 925
HG148 [141] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 927
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 928
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 929
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 931
(doi: 10.13140/RG.2.2.30182.50241). 932
HG146 [143] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 933
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 934
HG145 [144] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 936
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 937
HG144 [145] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 939
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 940
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 941
HG143 [146] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 942
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 943
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 944
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 947

Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 950
HG140 [149] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 951
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 952
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 953
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 956
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 959
HG137 [152] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 960
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 961
HG136 [153] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 963
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 964

2023, (doi: 10.13140/RG.2.2.17252.24968). 965
HG135 [154] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 966
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 967
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 968
HG134 [155] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 969
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 970
HG132 [156] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 972
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 973
2023010396 (doi: 10.20944/preprints202301.0396.v1). 974
HG131 [157] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 975
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 976

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 977
HG130 [158] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 978
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 979
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 980
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 981
HG129 [159] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 982

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

HG128 [160] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 986
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 987
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 988
HG127 [161] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 989
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 990

2023,(doi: 10.13140/RG.2.2.36745.93289). 991
HG126 [162] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 992

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

10.20944/preprints202301.0282.v1). 998
HG124 [164] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 999
10.20944/preprints202301.0267.v1).). 1001

(doi: 10.20944/preprints202301.0265.v1). 1006
HG122 [166] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1007
prints202301.0262.v1). 1010

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1018
10.13140/RG.2.2.35061.65767). 1019
HG25 [170] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1020
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1021
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1022
10.13140/RG.2.2.18494.15680). 1023

HG26 [171] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1024
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1025
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1026
10.13140/RG.2.2.32530.73922). 1027
HG27 [172] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1028
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1029
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1030
10.13140/RG.2.2.15897.70243). 1031
10.13140/RG.2.2.32530.73922). 1035
prints202301.0105.v1). 1038
HG28 [175] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1039
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1040
HG29 [176] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1042
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1043
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1044
10.13140/RG.2.2.23172.19849). 1045

HG30 [179] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1052
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1053
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1054

10.13140/RG.2.2.17385.36968). 1055

Preprints 2023, 2023010044 1058
10.20944/preprints202301.0043.v1). 1061

HG31 [182] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1062
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1063
2023, (doi: 10.13140/RG.2.2.28945.92007). 1064

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1069
10.13140/RG.2.2.35774.77123). 1070
HG35 [186] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1074
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1075
10.13140/RG.2.2.29430.88642). 1076

(doi: 10.20944/preprints202212.0549.v1). 1082
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1084
10.13140/RG.2.2.19380.94084). 1085
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1093

(doi: 10.20944/preprints202212.0500.v1). 1096
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1098
10.13140/RG.2.2.20993.12640). 1099

HG952 [194] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1100

HG95 [195] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1103
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1104

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1105
HG37 [198] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1112
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1113
10.13140/RG.2.2.29173.86244). 1114
HG38 [199] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1115
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1116
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1117
HG173b [200] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1118
odo.7943878). 1119
HG172b [201] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1120
10.5281/zenodo.7943871). 1121
HG171b [202] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1122
10.5281/zenodo.7923786). 1123
HG170b [203] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1124
2023 (doi: 10.5281/zenodo.7905287). 1125
HG169b [204] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1126

Garrett, 2023 (doi: 10.5281/zenodo.7904586). 1127
HG168b [205] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1128
2023 (doi: 10.5281/zenodo.7874677). 1129
HG167b [206] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1130
(doi: 10.5281/zenodo.7857906). 1131
HG166b [207] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1132
2023 (doi: 10.5281/zenodo.7856329). 1133
HG165b [208] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1134
10.5281/zenodo.7854561). 1135

HG164b [209] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1136
2023 (doi: 10.5281/zenodo.7851893). 1137
HG163b [210] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1138

HG162b [211] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1140
(doi: 10.5281/zenodo.7835063). 1141
HG161b [212] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1142
(doi: 10.5281/zenodo.7826705). 1143
HG160b [213] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1144
2023 (doi: 10.5281/zenodo.7820680). 1145
HG159b [214] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1146
10.5281/zenodo.7812750). 1147
HG158b [215] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1148

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

HG156b [217] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1152
2023 (doi: 10.5281/zenodo.7807782). 1153
HG155b [218] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1154
2023 (doi: 10.5281/zenodo.7804449). 1155
HG154b [219] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1156

HG153b [220] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1158
(doi: 10.5281/zenodo.7792307). 1159
HG152b [221] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1160
(doi: 10.5281/zenodo.7790728). 1161
HG151b [222] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1162
2023 (doi: 10.5281/zenodo.7787712). 1163
HG150b [223] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1164
10.5281/zenodo.7783791). 1165
HG149b [224] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1166
10.5281/zenodo.7780123). 1167
HG148b [225] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1168
(doi: 10.5281/zenodo.7773119). 1169
HG147b [226] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1170
odo.7637762). 1171

HG146b [227] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1172
10.5281/zenodo.7766174). 1173
HG145b [228] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1174
10.5281/zenodo.7762232). 1175
HG144b [229] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1176
(doi: 10.5281/zenodo.7758601). 1177
HG143b [230] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1178
10.5281/zenodo.7754661). 1179
HG142b [231] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1180
10.5281/zenodo.7750995) . 1181
HG141b [232] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1182
(doi: 10.5281/zenodo.7749875). 1183
HG140b [233] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1184
10.5281/zenodo.7747236). 1185
HG139b [234] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1186
10.5281/zenodo.7742587). 1187
HG138b [235] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1188
(doi: 10.5281/zenodo.7738635). 1189
HG137b [236] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1190
10.5281/zenodo.7734719). 1191
HG136b [237] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1192
10.5281/zenodo.7730484). 1193
HG135b [238] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1194
(doi: 10.5281/zenodo.7730469). 1195
HG134b [239] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1196
10.5281/zenodo.7722865). 1197
HG133b [240] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1198
odo.7713563). 1199
odo.7709116). 1201
HG131b [242] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1202
10.5281/zenodo.7706415). 1203
HG130b [243] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1204
10.5281/zenodo.7706063). 1205
HG129b [244] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1206
10.5281/zenodo.7701906). 1207

HG128b [245] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7700205). 1209
HG127b [246] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1210
10.5281/zenodo.7694876). 1211
HG126b [247] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1212
10.5281/zenodo.7679410). 1213
HG125b [248] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1214
10.5281/zenodo.7675982). 1215
HG124b [249] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1216
10.5281/zenodo.7672388). 1217
HG123b [250] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1218
odo.7668648). 1219
HG122b [251] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1220
10.5281/zenodo.7662810). 1221
HG121b [252] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1222
10.5281/zenodo.7659162). 1223
HG120b [253] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1224
odo.7653233). 1225
HG119b [254] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1226
odo.7653204). 1227
HG118b [255] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1228
odo.7653142). 1229
HG117b [256] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1230
odo.7653117). 1231
HG116b [257] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1232
HG115b [258] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1233
odo.7651687). 1234
HG114b [259] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1235
odo.7651619). 1236
HG113b [260] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1237
odo.7651439). 1238
HG112b [261] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1239
odo.7650729). 1240
HG111b [262] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1241
odo.7647868). 1242

HG110b [263] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1243
odo.7647017). 1244
HG109b [264] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1245
odo.7644894). 1246
HG108b [265] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1247
HG107b [266] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1248
odo.7632923). 1249
HG106b [267] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1250
odo.7623459). 1251
HG105b [268] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1252
10.5281/zenodo.7606416). 1253
HG104b [269] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1254
10.5281/zenodo.7606416). 1255
HG103b [270] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1256
odo.7606404). 1257
HG102b [271] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1258
10.5281/zenodo.7580018). 1259
HG101b [272] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1260
odo.7580018). 1261
odo.7580018). 1263
odo.7579929). 1265
HG98b [275] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1266
10.5281/zenodo.7563170). 1267
HG97b [276] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1268
odo.7563164). 1269
HG96b [277] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1270
odo.7563160). 1271
odo.7563160). 1273
HG94b [279] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1274
10.5281/zenodo.7563160). 1275
HG93b [280] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1276
10.5281/zenodo.7557063). 1277

HG92b [281] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1278
10.5281/zenodo.7557009). 1279
HG91b [282] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1280
10.5281/zenodo.7539484). 1281
HG90b [283] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1282
10.5281/zenodo.7523390). 1283
HG89b [284] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1284
10.5281/zenodo.7523390). 1285
HG88b [285] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1286
10.5281/zenodo.7523390). 1287
HG87b [286] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1288
odo.7574952). 1289
HG86b [287] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1290
10.5281/zenodo.7574992). 1291
odo.7523357). 1293
HG84b [289] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1294
10.5281/zenodo.7523357). 1295
HG83b [290] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1296
10.5281/zenodo.7504782). 1297
HG82b [291] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1298
10.5281/zenodo.7504782). 1299
HG81b [292] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1300
10.5281/zenodo.7504782). 1301
HG80b [293] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1302
10.5281/zenodo.7499395). 1303
HG79b [294] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1304
odo.7499395). 1305
HG78b [295] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1306
10.5281/zenodo.7499395). 1307
HG77b [296] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1308
10.5281/zenodo.7497450). 1309
HG76b [297] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1310
10.5281/zenodo.7497450). 1311
HG75b [298] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1312
10.5281/zenodo.7494862). 1313

HG74b [299] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1314
odo.7494862). 1315
HG73b [300] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1316
10.5281/zenodo.7494862). 1317
HG72b [301] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1318
10.5281/zenodo.7493845). 1319
HG71b [302] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1320
odo.7493845). 1321
HG70b [303] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1322
10.5281/zenodo.7493845). 1323
HG69b [304] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1324
odo.7539484). 1325
HG68b [305] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1326
odo.7523390). 1327
HG67b [306] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1328
odo.7523357). 1329
HG66b [307] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1330
odo.7504782). 1331
HG65b [308] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1332
odo.7499395). 1333
HG64b [309] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1334
odo.7497450). 1335
HG63b [310] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1336
odo.7494862). 1337
HG62b [311] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1338
odo.7493845). 1339
HG61b [312] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1340
odo.7480110). 1341
HG60b [313] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1342
odo.7378758). 1343
HG32b [314] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1344
odo.6320305). 1345
HG44b [315] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1346
odo.6677173). 1347

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

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1397
is going to figure out what’s going on this phenomenon. The special case of this disease is 1398
considered and as the consequences of the model, some parameters are used. The cells are 1399
under attack of this disease but the moves of the cancer in the special region are the matter of 1400
mind. The recognition of the cancer could help to find some treatments for this disease. The 1401
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1402
Recognition” and both bases are the background of this research. Sometimes the cancer has 1403
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1404
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1405
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1406
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1407
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1408
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1409
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1410
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1411
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1412
and neutrality about the moves and the effects of the cancer on that region; this event leads 1413
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1414
perception on what’s happened and what’s done. There are some specific models, which 1415
are well-known and they’ve got the names, and some general models. The moves and the 1416
traces of the cancer on the complex tracks and between complicated groups of cells could 1417
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1418
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1419
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1420

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1421
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1422
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1423
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1424
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1425
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1426
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1427
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1428
based on the fixed groups of cells or the fixed groups of group of cells? 1429
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1430
messy and dense SuperHyperModels where embedded notions are illustrated? 1431
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1432
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1433
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1434

research has taken more motivations to define SuperHyperClasses and to find some connections 1435
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1436
instances and examples to make clarifications about the framework of this research. The general 1437
results and some results about some connections are some avenues to make key point of this 1438
research, “Cancer’s Recognition”, more understandable and more clear. 1439
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1440
on the modeling of the regions where are under the attacks of the cancer to recognize 1441
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1442
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1443
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1444
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1445
instances and literature reviews have taken the whole way through. In this scientific research, 1446
the literature reviews have fulfilled the lines containing the notions and the results. The 1447
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1448
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1449
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1450
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1451
of the moves of the cancer in the longest and strongest styles with the formation of the design 1452
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1453
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1454
out the background for the SuperHyperNotions. 1455

CHAPTER 5 1456
Extreme Dominating-Edges 1457
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1458
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1459
2023, (doi: 10.13140/RG.2.2.34953.52320). 1460

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1461
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1462
(doi: 10.13140/RG.2.2.33275.80161). 1463
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1464
10.13140/RG.2.2.11050.90569). 1466
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1467
10.13140/RG.2.2.17761.79206). 1469
10.13140/RG.2.2.19911.37285). 1472
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1473
10.13140/RG.2.2.23266.81602). 1475
10.13140/RG.2.2.19360.87048). 1478
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1479
10.13140/RG.2.2.32363.21286). 1481
10.13140/RG.2.2.11758.69441). 1484
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1485
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1486
10.13140/RG.2.2.31891.35367). 1487
10.13140/RG.2.2.21510.45125). 1490
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1491
10.13140/RG.2.2.13121.84321). 1493

CHAPTER 6 1494
New Ideas On Super Eddy By Hyper 1495
Dome Of Dominating-Edges In Cancer’s 1496
Recognition With (Neutrosophic) 1497
SuperHyperGraph 1498
49
CHAPTER 7 1499
ABSTRACT 1500
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDominating- 1501

Edges). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Dominating-Edges pair S = (V, E). 1502
Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 1503
either V 0 or E 0 is called Neutrosophic e-SuperHyperDominating-Edges if the following expression is 1504
called Neutrosophic e-SuperHyperDominating-Edges criteria holds 1505
E ∈ EN SHG either of its endpoints or one SuperHyperVertex

from their SuperHyperNeighbors is inVa ∈ Ea ;
Neutrosophic re-SuperHyperDominating-Edges if the following expression is called Neutrosophic 1506
e-SuperHyperDominating-Edges criteria holds 1507

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

v-SuperHyperDominating-Edges if the following expression is called Neutrosophic v- 1509
SuperHyperDominating-Edges criteria holds 1510

Neutrosophic rv-SuperHyperDominating-Edges if the following expression is called Neutrosophic 1511

v-SuperHyperDominating-Edges criteria holds 1512

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic 1513

SuperHyperDominating-Edges if it’s either of Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic 1514
re-SuperHyperDominating-Edges, Neutrosophic v-SuperHyperDominating-Edges, and Neutrosophic rv- 1515
SuperHyperDominating-Edges. ((Neutrosophic) SuperHyperDominating-Edges). Assume a Neutrosophic 1516
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 1517
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperDominating-Edges if it’s 1518
51
either of Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, 1519

Neutrosophic v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges and 1520
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1521
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1522
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 1523
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating-Edges; a 1524
Neutrosophic SuperHyperDominating-Edges if it’s either of Neutrosophic e-SuperHyperDominating- 1525

Edges, Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic v-SuperHyperDominating-Edges, and 1526
Neutrosophic rv-SuperHyperDominating-Edges and C(N SHG) for a Neutrosophic SuperHyperGraph 1527
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 1528
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1529
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1530
SuperHyperDominating-Edges; an Extreme SuperHyperDominating-Edges SuperHyperPolynomial if it’s 1531

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolyno- 1534
mial contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1535
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1536
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1537
they form the Extreme SuperHyperDominating-Edges; and the Extreme power is corresponded to 1538
its Extreme coefficient; a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if it’s 1539
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHy- 1542
perPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 1543
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Su- 1544
perHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1545
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating- 1546
Edges; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Ex- 1547
treme V-SuperHyperDominating-Edges if it’s either of Neutrosophic e-SuperHyperDominating-Edges, 1548
Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic v-SuperHyperDominating-Edges, and 1549

Neutrosophic rv-SuperHyperDominating-Edges and C(N SHG) for an Extreme SuperHyperGraph 1550
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1551
high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1552
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1553
the Extreme SuperHyperDominating-Edges; a Neutrosophic V-SuperHyperDominating-Edges if it’s 1554

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1557
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 1558
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 1559
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating-Edges; 1560
an Extreme V-SuperHyperDominating-Edges SuperHyperPolynomial if it’s either of Neutro- 1561
sophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic 1562
v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges and C(N SHG) 1563
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1564

contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1565
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1566
its Extreme coefficient; a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if 1569
it’s either of Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating- 1570
Edges, Neutrosophic v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges 1571

and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1572
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1573
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 1574
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1575
SuperHyperDominating-Edges; and the Neutrosophic power is corresponded to its Neutrosophic 1577

coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 1578
namely, a SuperHyperDominating-Edges and Neutrosophic SuperHyperDominating-Edges. Two different 1579
types of SuperHyperDefinitions are debut for them but the research goes further and the 1580
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 1581
and well-reviewed. The literature review is implemented in the whole of this research. For 1582
shining the elegancy and the significancy of this research, the comparison between this Su- 1583
perHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 1584
featured. The definitions are followed by the examples and the instances thus the clarifica- 1585
tions are driven with different tools. The applications are figured out to make sense about 1586
the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under 1587
research to figure out the challenges make sense about ongoing and upcoming research. The 1588
special case is up. The cells are viewed in the deemed ways. There are different types of 1589
them. Some of them are individuals and some of them are well-modeled by the group of 1590
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 1591
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 1592
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1593
these complex and dense SuperHyperModels open up some avenues to research on theoret- 1594
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 1595
It’s also officially collected in the form of some questions and some problems. Assume a 1596
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDominating-Edges is a 1597
maximal of SuperHyperVertices with a maximum cardinality such that either of the following 1598
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 1599
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1600
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1601
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDominating-Edges is a max- 1602
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1603
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1604
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1605
and |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first Expression, holds if S is a 1606
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperDominating- 1608
Edges . Since there’s more ways to get type-results to make a SuperHyperDominating-Edges more 1609
understandable. For the sake of having Neutrosophic SuperHyperDominating-Edges, there’s a 1610

need to “redefine” the notion of a “SuperHyperDominating-Edges ”. The SuperHyperVertices 1611

a SuperHyperDominating-Edges . It’s redefined a Neutrosophic SuperHyperDominating-Edges if the 1614
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 1615
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 1616
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 1617
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The max- 1618
imum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its 1619
Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To 1620
get structural examples and instances, I’m going to introduce the next SuperHyperClass of 1621
SuperHyperGraph based on a SuperHyperDominating-Edges . It’s the main. It’ll be disciplinary to 1622
have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 1623
have all SuperHyperDominating-Edges until the SuperHyperDominating-Edges, then it’s officially called a 1624
“SuperHyperDominating-Edges” but otherwise, it isn’t a SuperHyperDominating-Edges . There are some 1625
instances about the clarifications for the main definition titled a “SuperHyperDominating-Edges ”. 1626
disciplinary ways of the SuperHyperClass based on a SuperHyperDominating-Edges . For the sake 1628
of having a Neutrosophic SuperHyperDominating-Edges, there’s a need to “redefine” the notion 1629

of a “Neutrosophic SuperHyperDominating-Edges” and a “Neutrosophic SuperHyperDominating-Edges 1630
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 1631
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 1632
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 1633
SuperHyperGraph” if the intended Table holds. And a SuperHyperDominating-Edges are redefined 1634
to a “Neutrosophic SuperHyperDominating-Edges” if the intended Table holds. It’s useful to define 1635
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 1636
type-results to make a Neutrosophic SuperHyperDominating-Edges more understandable. Assume 1637
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 1638
intended Table holds. Thus SuperHyperPath, SuperHyperDominating-Edges, SuperHyperStar, 1639
SuperHyperPath”, “Neutrosophic SuperHyperDominating-Edges”, “Neutrosophic SuperHyperStar”, 1641

“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutro- 1642
sophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 1643
SuperHyperDominating-Edges” where it’s the strongest [the maximum Neutrosophic value from all 1644
the SuperHyperDominating-Edges amid the maximum value amid all SuperHyperVertices from 1645
a SuperHyperDominating-Edges .] SuperHyperDominating-Edges . A graph is a SuperHyperUniform 1646

if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 1647
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 1648
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1649
with two exceptions; it’s SuperHyperDominating-Edges if it’s only one SuperVertex as intersection 1650
amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 1651
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 1656

as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 1657
Recognition” and the results and the definitions will be introduced in redeemed ways. The 1666
recognition of the cancer in the long-term function. The specific region has been assigned 1667
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 1668
to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1672
and what’s done. There are some specific models, which are well-known and they’ve got the 1673
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1674
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 1675
Neutrosophic SuperHyperPath(-/SuperHyperDominating-Edges, SuperHyperStar, SuperHyperBi- 1676
partite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 1677
SuperHyperDominating-Edges or the strongest SuperHyperDominating-Edges in those Neutrosophic 1678
SuperHyperModels. For the longest SuperHyperDominating-Edges, called SuperHyperDominating-Edges, 1679
and the strongest SuperHyperDominating-Edges, called Neutrosophic SuperHyperDominating-Edges, 1680
some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHy- 1681
perPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at 1682
least three SuperHyperEdges to form any style of a SuperHyperDominating-Edges. There isn’t 1683
any formation of any SuperHyperDominating-Edges but literarily, it’s the deformation of any 1684
SuperHyperDominating-Edges. It, literarily, deforms and it doesn’t form. A basic familiarity 1685
with Neutrosophic SuperHyperDominating-Edges theory, SuperHyperGraphs, and Neutrosophic 1686
SuperHyperGraphs theory are proposed. 1687

Keywords: SuperHyperGraph, SuperHyperDominating-Edges, Cancer’s Recognition 1688

CHAPTER 8 1690
Applied Notions Under The Scrutiny Of 1691
The Motivation Of This Scientific 1692
Research 1693
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1694
try to bring the motivations in the narrative ways. Some cells have been faced with some 1695
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1696
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1697
as some groups and some groups or individuals have excessive labels which all are raised from 1698
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1699
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1700
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1701
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1702
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1703
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1704
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1705
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1706
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1707
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1708
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1709
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1710
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1711
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1712
The special case of this disease is considered and as the consequences of the model, some 1713
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1714
the special region are the matter of mind. The recognition of the cancer could help to find some 1715
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1716
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1717
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1718
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1719
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 1720
formation of the design and the architecture are formally called “ SuperHyperDominating-Edges” 1721
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1722
57
embedded styles to figure out the background for the SuperHyperNotions. The recognition 1723
of the cancer in the long-term function. The specific region has been assigned by the model 1724
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 1725
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 1726
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 1727
cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1728
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1729
are some specific models, which are well-known and they’ve got the names, and some general 1730
models. The moves and the traces of the cancer on the complex tracks and between complicated 1731
groups of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperDominating-Edges, 1732
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 1733
is to find either the optimal SuperHyperDominating-Edges or the Extreme SuperHyperDominating-Edges 1734
in those Extreme SuperHyperModels. Some general results are introduced. Beyond that in 1735
SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1736
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 1737
of a SuperHyperDominating-Edges. There isn’t any formation of any SuperHyperDominating-Edges but 1738
literarily, it’s the deformation of any SuperHyperDominating-Edges. It, literarily, deforms and it 1739
doesn’t form. 1740
amount of SuperHyperDominating-Edges” of either individual of cells or the groups of cells based on 1742
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDominating-Edges” 1743
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1745
messy and dense SuperHyperModels where embedded notions are illustrated? 1746
Thus it motivates us to define different types of “ SuperHyperDominating-Edges” and “Extreme 1748
SuperHyperDominating-Edges” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1749

research has taken more motivations to define SuperHyperClasses and to find some connections 1750
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1751
instances and examples to make clarifications about the framework of this research. The general 1752
results and some results about some connections are some avenues to make key point of this 1753
research, “Cancer’s Recognition”, more understandable and more clear. 1754
The framework of this research is as follows. In the beginning, I introduce basic definitions 1755
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1756
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1757
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1758
review literature are applied to make sense about what’s going to figure out about the upcoming 1759
sections. The main definitions and their clarifications alongside some results about new 1760
notions, SuperHyperDominating-Edges and Extreme SuperHyperDominating-Edges, are figured out 1761

in sections “ SuperHyperDominating-Edges” and “Extreme SuperHyperDominating-Edges”. In the 1762
sense of tackling on getting results and in Dominating-Edges to make sense about continuing 1763
the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are introduced 1764
and as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 1765
done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1766
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps 1767

toward the common notions to extend the new notions in new frameworks, SuperHyperGraph 1768
and Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results 1769
on Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1770
and as concluding and closing section of theoretical research are contained in the section 1771
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1772
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1773
Results”, “ SuperHyperDominating-Edges”, “Extreme SuperHyperDominating-Edges”, “Results on 1774

SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1775
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1776
and going to figure out the word “best” as the description and adjective for this research as 1777
presented in section, “ SuperHyperDominating-Edges”. The keyword of this research debut in the 1778
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1779
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 1780
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 1781
there are some scrutiny and discernment on what’s done and what’s happened in this research 1782
in the terms of “questions” and “problems” to make sense to figure out this research in featured 1783
style. The advantages and the limitations of this research alongside about what’s done in this 1784
research to make sense and to get sense about what’s figured out are included in the section, 1785
“Conclusion and Closing Remarks”. 1786

CHAPTER 9 1787
Extreme Preliminaries Of This Scientific 1788
Research On the Redeemed Ways 1789
In this section, the basic material in this scientific research, is referred to [Single Valued 1790
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1791
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1792

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1793
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1794
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1795
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1796
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1797
their clarifications are addressed to Ref.[HG38]. 1798

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

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

Let X be a Dominating-Edges 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.[HG38],Definition 2.5,p.2). 1802
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1803
where 1804
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1805
(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); 1806
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1807
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1808
1, 2, . . . , n0 ); 1809
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1810
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1811

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1818
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1819
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1820
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1821
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1822
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1823

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

(Ref.[HG38],Definition 2.7,p.3). 1825
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1826
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1827
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1828
(i) If |Vi | = 1, then Vi is called vertex; 1829
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1830
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1831
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1832
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1833
SuperEdge; 1834
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1835
SuperHyperEdge. 1836
If we choose different types of binary operations, then we could get hugely diverse types of 1837
general forms of Neutrosophic SuperHyperGraph (NSHG). 1838
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1839

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1840
x, y, z, w ∈ [0, 1]: 1841
(i) 1 ⊗ x = x; 1842
(ii) x ⊗ y = y ⊗ x; 1843
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1844
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1845

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

where 1848

1, 2, . . . , n0 ); 1853
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1854
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1855
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1856
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1857
0


SuperEdge; 1877
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1880
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1881
makes the patterns and regularities. 1882
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1883
of elements of SuperHyperEdges are the same. 1884

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1885
makes to have SuperHyperUniform more understandable. 1886
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1887
Classes as follows. 1888
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1889
two given SuperHyperEdges with two exceptions; 1890
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1891
SuperHyperEdges; 1892
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1893
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1894
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1895
in common; 1896
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1897
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1898
SuperHyperEdge in common; 1899
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1900
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1901
SuperVertex. 1902
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 1903
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1904
(i) Vi , Vi+1 ∈ Ei0 ; 1905
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1906
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1907
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1908
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1909
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1910
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1911
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1912
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1914
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1915
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1916
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1917
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1918
perPath . 1919
Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],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 1920
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1921
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1922
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1923
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1924
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1925

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

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


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

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

to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1940
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperDominating-Edges). 1941

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1943
or E 0 is called 1944
(i) Neutrosophic e-SuperHyperDominating-Edges if the following expression is called 1945

Neutrosophic e-SuperHyperDominating-Edges criteria holds 1946

(ii) Neutrosophic re-SuperHyperDominating-Edges if the following expression is called 1947

Neutrosophic re-SuperHyperDominating-Edges criteria holds 1948

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 1949
(iii) Neutrosophic v-SuperHyperDominating-Edges if the following expression is called 1950
Neutrosophic v-SuperHyperDominating-Edges criteria holds 1951

(iv) Neutrosophic rv-SuperHyperDominating-Edges if the following expression is called 1952


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 1954
(v) Neutrosophic SuperHyperDominating-Edges if it’s either of Neutrosophic e- 1955

SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic 1956
v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges. 1957
Definition 9.0.19. ((Neutrosophic) SuperHyperDominating-Edges). 1958


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

SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic v- 1962
SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges and C(N SHG) 1963
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 1964
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHy- 1965
perEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 1966
SuperHyperVertices such that they form the Extreme SuperHyperDominating-Edges; 1967
(ii) a Neutrosophic SuperHyperDominating-Edges if it’s either of Neutrosophic e- 1968

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 1971
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1972
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1973
SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating-Edges; 1974
(iii) an Extreme SuperHyperDominating-Edges SuperHyperPolynomial if it’s either of 1975

Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, 1976
Neutrosophic v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges 1977
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1978
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 1979
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 1980
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 1981
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating-Edges; 1982
and the Extreme power is corresponded to its Extreme coefficient; 1983
(iv) a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if it’s either 1984

of Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, 1985
Neutrosophic v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating- 1986

Edges and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1987
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as 1988
the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 1989
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1990
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1991
that they form the Neutrosophic SuperHyperDominating-Edges; and the Neutrosophic power 1992
is corresponded to its Neutrosophic coefficient; 1993
(v) an Extreme V-SuperHyperDominating-Edges if it’s either of Neutrosophic e- 1994

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 1998
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 1999
(vi) a Neutrosophic V-SuperHyperDominating-Edges if it’s either of Neutrosophic e- 2001


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

sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating- 2007
Edges; 2008
(vii) an Extreme V-SuperHyperDominating-Edges SuperHyperPolynomial if it’s either 2009

of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 2014
(viii) a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if it’s either 2018


SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2024
is corresponded to its Neutrosophic coefficient. 2027
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDominating-Edges). 2028

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2029
(i) an δ−SuperHyperDominating-Edges is a Neutrosophic kind of Neutrosophic 2030

SuperHyperDominating-Edges such that either of the following expressions hold for the 2031
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2032
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 2033
(29.1), holds if S is an δ−SuperHyperDefensive; 2034
(ii) a Neutrosophic δ−SuperHyperDominating-Edges is a Neutrosophic kind of Neutrosophic 2035
SuperHyperDominating-Edges such that either of the following Neutrosophic expressions hold 2036
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2037
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2038
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2039

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

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

136TBL4
For the sake of having a Neutrosophic SuperHyperDominating-Edges, there’s a need to 2040

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and 2041
the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 2042
procedure, there’s the usage of the position of labels to assign to the values. 2043
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2044
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2045
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2046
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2047
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neut- 2049
rosophic SuperHyperPath , SuperHyperDominating-Edges, SuperHyperStar, SuperHyperBipart- 2050
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 2051
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 2052
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 2053

perHyperWheel if the Table (29.2) holds. 2054
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperDominating-Edges. 2055

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperDominating-Edges 2056
more Neutrosophicly understandable. 2057
For the sake of having a Neutrosophic SuperHyperDominating-Edges, there’s a need to “redefine” 2058
the Neutrosophic notion of “Neutrosophic SuperHyperDominating-Edges”. The SuperHyperVertices 2059
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 2060
136DEF1 Definition 9.0.23. Assume a SuperHyperDominating-Edges. It’s redefined a Neutrosophic 2062
SuperHyperDominating-Edges if the Table (29.3) holds. 2063


136TBL1

CHAPTER 10 2064
Extreme SuperHyper But As The Dominating-Edges 2065
Extensions Excerpt From Dense And 2066
Super Forms 2067
Definition 10.0.1. (Extreme event). 2068

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2069
a probability Dominating-Edges. Any Extreme k-subset of A of V is called Extreme k-event and 2070
if k = 2, then Extreme subset of A of V is called Extreme event. The following expression is 2071
called Extreme probability of A. 2072
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2073

a probability Dominating-Edges. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2075
if the following expression is called Extreme s-independent criteria 2076
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 2077
following expression is called Extreme independent criteria 2078
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2079

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2080
probability Dominating-Edges. Any k-function Dominating-Edges like E is called Extreme k-Variable. 2081
If k = 2, then any 2-function Dominating-Edges like E is called Extreme Variable. 2082
The notion of independent on Extreme Variable is likewise. 2083
Definition 10.0.4. (Extreme Expectation). 2084
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2085
73
is a probability Dominating-Edges. an Extreme k-Variable E has a number is called Extreme 2086

Expectation if the following expression is called Extreme Expectation criteria 2087
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2088

a probability Dominating-Edges. an Extreme number is called Extreme Crossing if the following 2090
expression is called Extreme Crossing criteria 2091
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 2092
S = (V, E) is a probability Dominating-Edges. Let m and n propose special Dominating-Edges. Then with 2093
m ≥ 4n, 2094
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 Dominating-Edges 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: 2095
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2096
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2097
Consider S = (V, E) is a probability Dominating-Edges. Let P be a SuperHyperSet of n points in the 2098
plane, and let l be the Extreme number√of SuperHyperLines in the plane passing through at least 2099
k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2100
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2101

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

Consider S = (V, E) is a probability Dominating-Edges. Let P be a SuperHyperSet of n points in 2108
the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2109
k < 5n4/3 . 2110
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2111
S = (V, E) is a probability Dominating-Edges. Draw a SuperHyperUnit SuperHyperCircle around 2112
each SuperHyperPoint of P. Let ni be the Extreme number of these SuperHyperCircles 2113
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 2114
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2115

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

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

P (Xn = 0) → 1 as n → ∞. 2131
Proof. 2132
Consider S = (V, E) is a probability Dominating-Edges. A special SuperHyperGraph in Gn,p almost 2134
surely has stability number at most d2p−1 log ne. 2135

S = (V, E) is a probability Dominating-Edges. A special SuperHyperGraph in Gn,p is up. Let 2137
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 2138
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 2139
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 2140
of the Extreme SuperHyperGraph G. 2141
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2142
Extreme Variable for this Extreme Event. By equation, we have 2143
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 2144
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2145
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: 2146
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2147
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 2148
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2149
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2150
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2151
Definition 10.0.12. (Extreme Variance). 2152

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2153
is a probability Dominating-Edges. an Extreme k-Variable E has a number is called Extreme 2154
Variance if the following expression is called Extreme Variance criteria 2155
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Dominating-Edges. Let X be an Extreme Variable and let t be a 2157
positive real number. Then 2158
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Dominating-Edges. Let X be an Extreme Variable and let t be a positive 2160
real number. Then 2161
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
2162
Consider S = (V, E) is a probability Dominating-Edges. Let Xn be an Extreme Variable in a 2164
probability Dominating-Edges (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2165
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Dominating-Edges. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s 2167
Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2168
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2169
Consider S = (V, E) is a probability Dominating-Edges. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2171
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 2172
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2173
S = (V, E) is a probability Dominating-Edges. As in the proof of related Theorem, the result is 2175
straightforward. 2176
Consider S = (V, E) is a probability Dominating-Edges. Let G ∈ Gn,1/2 and let f and k ∗ be as defined 2178
in previous Theorem. Then either: 2179
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2180
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2181
S = (V, E) is a probability Dominating-Edges. The latter is straightforward. 2183
Definition 10.0.17. (Extreme Threshold). 2184

a probability Dominating-Edges. Let P be a monotone property of SuperHyperGraphs (one which is 2186

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

Definition 10.0.18. (Extreme Balanced). 2191

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 2192
(V, E) is a probability Dominating-Edges. Let F be a fixed Extreme SuperHyperGraph. Then 2193
there is a threshold function for the property of containing a copy of F as an Extreme 2194
SubSuperHyperGraph is called Extreme Balanced. 2195
Consider S = (V, E) is a probability Dominating-Edges. Let F be a nonempty balanced Extreme 2197
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2198

threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2199
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2202
the mentioned Extreme Figures in every Extreme items. 2203
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme 2204

SuperHyperDominating-Edges, is up. The Extreme Algorithm is Extremely straightfor- 2205
ward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2206
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2207
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . The 2208
Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2209
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2210

V3 , is excluded in every given Extreme SuperHyperDominating-Edges. 2211
C(N SHG)Extreme Dominating-Edges

= {}.
C(N SHG)Extreme Dominating-Edges SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Dominating-Edges
= {}.
C(N SHG)Extreme V-Dominating-Edges SuperHyperPolynomial
= 0z 0 .
2212

ward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2215
SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2216
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2217
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2218
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2219
SuperHyperDominating-Edges. 2220

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperDominating-Edges in the Extreme Example (42.0.3) 136NSHG1
= {}.
= 0z 0 .
= {}.
= 0z 0 .
2221

ward. 2224

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



ward. 2228

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

ward. 2232

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .

= {V5 }.
= z7.
2233

ward. 2236

= {Ei22
i=1
}.
X |E 22 |
= z ii=1 .
= {Vi11
i=1
}.
X |V 11 |
= z ii=1 .
2237


ward. 2240

= {E3i+12i=0 , E2i+15i=0 }.
X |E 2 ,E 5 |
= z 3i+1i=0 2i+1i=0 .
= {V3i+12i=0 }.
X |V 2 |
= z 3i+1i=0 .
2241

ward. 2244

= {E2 , E4 }.
= z5 + z3.
= {V13 }.
= z5.
2245

ward. 2248

= {E3i+13i=0 , E2i+14i=0 , E3i7i=4 }.
X |E 3 ,E 4 ,E 7 |
= z 3i+1i=0 2i+1i=0 3ii=4 .
= {V3i+13i=0 }.


X |V 3 |
= z 3i+1i=0 .
2249

ward. 2252

= {E2 , , E5 , E6 , E7 }.
= z 5 + z 3 + 2z 2 .
= {V13 }.
= z5.
2253


ward. 2256

= {E3 , E4 , E5 , E8 }.
= z 3 + 3z 2 .
= {V6 }.
= z5.
2257

ward. 2260

= {E1 , E6 }.
= z5 + z2.


= {V8 }.
= z8.
2261

ward. 2264

= {E3 , E4 , E5 , E8 }.
= z 3 + 3z 2 .
= {V6 }.
= z5.
2265


ward. 2268

= {E1 }.
= z2.
= {V3 }.
= z5.
2269

ward. 2272

= {Ei+3 ∈ EN SHG }.

X
= z |Ei+3 ∈EN SHG | .
= {Vi ∈ VEi+3 ∈EN SHG }.
X |V ∈V
= z i Ei+3 ∈EN SHG | .
2273

ward. 2276

= {Ei+3 ∈ EN SHG }.

X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
2277

ward. 2280

= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
2281



ward. 2284

= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
2285

ward. 2288

= {Ei+3 ∈ EN SHG }.


X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
2289

ward. 2292

= {Ei ∈ EN SHG }.
X
= z |Ei ∈EN SHG | .
= {V1 }.

= z6.
2293

ward. 2296

= {E1 , E2 }.
= z 10 + z 2 .
= {V1 }.
= z5.
2297

SuperHyperDominating-Edges in the Extreme Example (42.0.3) 95NHG1
ward. 2300

= {Ei+3 ∈ EN SHG }i6=1 .
X
= z |Ei+3 ∈EN SHG |i6=1 .
= {Vi ∈ VEi+3 ∈EN SHG }i6=1 .
X |V ∈V
= z i Ei+3 ∈EN SHG |i6=1 .
2301
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2302
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Dominating-Edges if for any 2303

SuperHyperDominating-Edges in the Extreme Example (42.0.3) 95NHG2
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2304
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2305
all minus all Extreme SuperHypeNeighbors to any amount of them. 2306
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2307
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2308
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2309
quasi-R-Dominating-Edges minus all Extreme SuperHypeNeighbor to some of them but not all of 2310
them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2311
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Dominating-Edges, minus all 2312
Extreme SuperHypeNeighbor to some of them but not all of them. 2313
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-Dominating-Edges is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Dominating-Edges is at least the 2314
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2315
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2316
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2317
SuperHyperVertices are renamed to Extreme Dominating-Edges in some cases but the maximum 2318
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2319

SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2320

Dominating-Edges. 2321
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Dominating-Edges 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-Dominating-Edges with the least Extreme cardinality, the lower 2322
sharp Extreme bound for cardinality. 2323
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2324
Then in the worst case, literally, 2325
C(N SHG)ExtremeQuasi−Dominating−Edges
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Dominating−EdgesSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Dominating−Edges = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Dominating−EdgesSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Dominating-Edges. In other words, the least cardinality, the lower sharp 2326
bound for the cardinality, of an Extreme type-result-Dominating-Edges is the cardinality of 2327
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Dominating−EdgesSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Dominating−Edges = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Dominating−EdgesSuperHyperP 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-Dominating-Edges 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-Dominating-Edges. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Dominating-Edges 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-Dominating-Edges. 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-Dominating-Edges 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 max-
imum 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 Supe-
rHyperVertex 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-Dominating-Edges. 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-Dominating-Edges has the Extreme cardinality of an Extreme Su-
perHyperEdge. Thus, an Extreme R-Dominating-Edges has the Extreme cardinality at least an
Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This Extreme
SuperHyperSet isn’t an Extreme R-Dominating-Edges 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-Dominating-Edges” 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-Dominating-Edges 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-Dominating-Edges 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-Dominating-Edges. Those Extreme SuperHyperVertices
are potentially included in an Extreme style-R-Dominating-Edges. 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-Dominating-Edges is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Dominating-Edges 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-Dominating-Edges. 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, 2328
Extreme R-Dominating-Edges =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2329
Extreme R-Dominating-Edges =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Dominating-Edges where E ∈ EESHG:(V,E) is fixed

that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in an
Extreme Dominating-Edges, 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-Dominating-Edges is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Dominating-Edges is at least the 2330
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2331

with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2332
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2333
SuperHyperVertices are renamed to Extreme Dominating-Edges in some cases but the maximum 2334
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2335
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2336
Dominating-Edges. 2337
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2338
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2339
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2340
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of 2341
Extreme SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken 2342
from that Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme 2343
SuperHyperSet of the Extreme SuperHyperVertices is either has the maximum Extreme 2344
SuperHyperCardinality or it doesn’t have maximum Extreme SuperHyperCardinality. In 2345
a non-obvious SuperHyperModel, there’s at least one Extreme SuperHyperEdge containing 2346
at least all Extreme SuperHyperVertices. Thus it forms an Extreme quasi-R-Dominating-Edges 2347
where the Extreme completion of the Extreme incidence is up in that. Thus it’s, literarily, an 2348
Extreme embedded R-Dominating-Edges. The SuperHyperNotions of embedded SuperHyperSet and 2349

quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 2350
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such 2351
that those SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re 2352
Extreme SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices 2353
are included in the minimum Extreme style of the embedded Extreme R-Dominating-Edges. The 2354
interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2355
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2356
common connections, more precise and more formal, the perfect unique connections inside 2357
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2358
Extreme R-Dominating-Edges. Thus Extreme exterior SuperHyperVertices could be used only in 2359
one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior Extreme 2360
SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme Dominating-Edges, 2361
there’s the usage of exterior Extreme SuperHyperVertices since they’ve more connections inside 2362
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One 2363
Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme SuperHyperSet 2364
of the Extreme SuperHyperVertices with one SuperHyperElement has been ignored in the 2365
exploring to lead on the optimal case implying the Extreme R-Dominating-Edges. The Extreme 2366
R-Dominating-Edges with the exclusion of the exclusion of all Extreme SuperHyperVertices in 2367
one Extreme SuperHyperEdge and with other terms, the Extreme R-Dominating-Edges with the 2368
inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme 2369
quasi-R-Dominating-Edges. To sum them up, in a connected non-obvious Extreme SuperHyperGraph 2370
ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the 2371
maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of any given 2372
Extreme quasi-R-Dominating-Edges minus all Extreme SuperHypeNeighbor to some of them but not 2373
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2374
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Dominating-Edges, minus 2375
all Extreme SuperHypeNeighbor to some of them but not all of them. 2376
The main definition of the Extreme R-Dominating-Edges has two titles. an Extreme quasi-R- 2377
Dominating-Edges and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are two 2378
titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R- 2379
Dominating-Edges with that quasi-maximum Extreme SuperHyperCardinality in the terms of the 2380
embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, 2381
then the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme 2382
quasi-R-Dominating-Edgess for all Extreme numbers less than its Extreme corresponded maximum 2383
number. The essence of the Extreme Dominating-Edges ends up but this essence starts up in the 2384
terms of the Extreme quasi-R-Dominating-Edges, again and more in the operations of collecting all 2385
the Extreme quasi-R-Dominating-Edgess acted on the all possible used formations of the Extreme 2386
SuperHyperGraph to achieve one Extreme number. This Extreme number is 2387
considered as the equivalence class for all corresponded quasi-R-Dominating-Edgess. Let 2388
zExtreme Number , SExtreme SuperHyperSet and GExtreme Dominating-Edges be an Extreme number, an 2389
Extreme SuperHyperSet and an Extreme Dominating-Edges. Then 2390
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Dominating-Edges ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

As its consequences, the formal definition of the Extreme Dominating-Edges is re-formalized and 2391
redefined as follows. 2392
GExtreme Dominating-Edges ∈ ∪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 2393
definition for the Extreme Dominating-Edges. 2394
GExtreme Dominating-Edges =
{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 Dominating-Edges 2395
poses the upcoming expressions. 2396
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2397
= max zExtreme Number
[zExtreme
Number ]Extreme Class

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



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


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

2401

2402

Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2403
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2404

such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2405
perEdge. It’s, literarily, another name for “Extreme Quasi-Dominating-Edges” but, precisely, it’s the 2406
generalization of “Extreme Quasi-Dominating-Edges” since “Extreme Quasi-Dominating-Edges” happens 2407
“Extreme Dominating-Edges” in an Extreme SuperHyperGraph as initial framework and background 2408
but “Extreme SuperHyperNeighborhood” may not happens “Extreme Dominating-Edges” in an 2409
Extreme SuperHyperGraph as initial framework and preliminarily background since there are 2410

some ambiguities about the Extreme SuperHyperCardinality arise from it. To get orderly 2411
keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Dominating-Edges”, 2412
and “Extreme Dominating-Edges” are up. 2413
Thus, let 2414
zExtreme Number , NExtreme SuperHyperNeighborhood and 2415
GExtreme Dominating-Edges be an Extreme number, an Extreme SuperHyperNeighborhood and an 2416
Extreme Dominating-Edges and the new terms are up. 2417
GExtreme Dominating-Edges ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2418
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2419
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2420
And with go back to initial structure, 2421
GExtreme Dominating-Edges ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =



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

2423

2424

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

Is the simple Extreme type-SuperHyperSet of the Extreme R-Dominating-Edges. The Extreme

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

the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Dominating-Edges 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 Dominating-Edges and it’s an Extreme Dominating-Edges.
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

. There isn’t only less than two Extreme SuperHyperVertices inside the intended
Dominating-Edges
Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Dominating-Edges,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Dominating-Edges , not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2425
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2426
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2427
the 2428
“Extreme R-Dominating-Edges” 2429
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2430
Extreme R-Dominating-Edges, 2431
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 Ex-
treme R-Dominating-Edges amid those obvious simple Extreme type-SuperHyperSets of the Extreme
Dominating-Edges, 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-Dominating-Edges. In other words, the least cardinality, the lower sharp bound for
the cardinality, of an Extreme R-Dominating-Edges is the cardinality of

2432
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2433
Extreme SuperHyperVertices belong to any Extreme quasi-R-Dominating-Edges if for any of them, 2434
and any of other corresponded Extreme SuperHyperVertex, some interior Extreme SuperHyper- 2435
Vertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at all minus 2436
all Extreme SuperHypeNeighbors to any amount of them. 2437
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2438
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2439
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2440
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2441
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2442
R-Dominating-Edges with the least cardinality, the lower sharp Extreme bound for Extreme 2443
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2444
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2445
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2446
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Dominating-Edges. Since it 2447
doesn’t have 2448
2449
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2450

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2451
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2452
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2453
but it isn’t an Extreme R-Dominating-Edges. Since it doesn’t do the Extreme procedure such 2454
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2455
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2456
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2457
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2458
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2459
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2460
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Dominating-Edges, VESHE is 2461
up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Dominating-Edges, VESHE , 2462
is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does 2463
forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2464
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2465
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2466
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2467

SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2468
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Dominating-Edges only contains all 2469
interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2470
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2471
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2472
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2473
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2474
The SuperHyperNotion, namely, Dominating-Edges, is up. There’s neither empty SuperHyperEdge 2475
nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2476
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme 2477

Dominating-Edges . The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2478
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Dominating−EdgesSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Dominating−Edges = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Dominating−EdgesSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Dominating-Edges. The Extreme 2479
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2480
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Dominating-Edges C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2481

is an Extreme type-SuperHyperSet with 2482
2483
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2484

perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2485
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2486
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2487
Extreme SuperHyperSet. Thus the non-obvious Extreme Dominating-Edges is up. The obvious 2488
simple Extreme type-SuperHyperSet called the Extreme Dominating-Edges is an Extreme SuperHy- 2489
perSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet of 2490
the Extreme SuperHyperEdges[SuperHyperVertices], 2491
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2492
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Dominating- 2493
Edges is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2494
perEdges[SuperHyperVertices], 2495
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 Dominating-Edges. Since 2496
the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2497
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Dominating-Edges C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2498

is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an 2499
Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme 2500
type-SuperHyperSet called the Extreme Dominating-Edges and it’s an Extreme Dominating-Edges. 2501
Since it’s 2502
2503
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2504

perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2505
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2506
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2507
intended Extreme SuperHyperSet, 2508
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.


= az s + bz t .
Thus the non-obvious Extreme Dominating-Edges , 2509
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 Dominating-Edges , not: 2510
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2511
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 2512
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2513
SuperHyperSet called the 2514
“Extreme Dominating-Edges ” 2515
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2516
Extreme Dominating-Edges , 2517

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

CHAPTER 11 2520
The Extreme Departures on The 2521
Theoretical Results Toward Theoretical 2522
Motivations 2523
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2524
SuperHyperClasses. 2525
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2526

= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
Proof. Let 2527
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2528
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

SuperHyperDominating-Edges in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2529
new way to redefine as 2530
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 2531
ViEXT ERN AL in the literatures of SuperHyperDominating-Edges. The latter is straightforward. 2532
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2533
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2534
(31.1), is the SuperHyperDominating-Edges. 2535
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2536

= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .


X |V ∈V
Proof. Let 2537
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2538
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 2539

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2543
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2544
SuperHyperModel (31.2), is the Extreme SuperHyperDominating-Edges. 2545
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2546

= {Ei ∈ EN SHG }.
X
= {CEN T ER}.
= z |CEN T ER| .

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

SuperHyperDominating-Edges in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2547
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2548
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 2549
way to redefine as 2550


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

SuperHyperDominating-Edges in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2553
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2554
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2555
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDominating- 2556
Edges. 2557
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2558

= {Ei ∈ EVa }.
X
= {Va }.
= z |Va | .
Proof. Let 2559
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
2560
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 2561
a new way to redefine as 2562

Then there’s no at least one SuperHyperDominating-Edges. Thus the notion of quasi may be up but 2565
the SuperHyperNotions based on SuperHyperDominating-Edges could be applied. There are only 2566
two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 2567
representative in the 2568
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperDominating-Edges taken from a connected Extreme SuperHyperBipartite 2569

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2570
SuperHyperPart SuperHyperEdges are attained in any solution 2571
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2572
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2573
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2574
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2575
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2576
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperDominating-Edges. 2577

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

Extreme SuperHyperDominating-Edges in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2578
Then 2579

= {Ei ∈ EVa }.
X
= {Va }.
= z |Va | .
Proof. Let 2580
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2581
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperDominating-Edges taken from a connected Extreme SuperHyperMultipartite 2582

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

Then there’s no at least one SuperHyperDominating-Edges. Thus the notion of quasi may be up 2586
but the SuperHyperNotions based on SuperHyperDominating-Edges could be applied. There are 2587
only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 2588
the representative in the 2589
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2590

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2591
SuperHyperEdges are attained in any solution 2592
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2593
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2595
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2596
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2597
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2598
the Extreme SuperHyperDominating-Edges. 2599
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2600

Then, 2601

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

= {Ei ∈ EN SHG }.
X
= {CEN T ER}.
= z |CEN T ER| .
Proof. Let 2602
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2603
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperDominating-Edges taken from a connected Extreme SuperHyperWheel 2604

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

Extreme SuperHyperDominating-Edges in the Extreme Example (42.0.15) 136NSHG23a
ESHW : (V, E). There’s a new way to redefine as 2605

Then there’s at least one SuperHyperDominating-Edges. Thus the notion of quasi isn’t up and the 2608
SuperHyperNotions based on SuperHyperDominating-Edges could be applied. The unique embedded 2609
SuperHyperDominating-Edges proposes some longest SuperHyperDominating-Edges excerpt from some 2610
representatives. The latter is straightforward. 2611
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2612
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2613
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2614
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2615
Extreme SuperHyperDominating-Edges. 2616

CHAPTER 12 2617
The Surveys of Mathematical Sets On 2618
The Results But As The Initial Motivation 2619
For the SuperHyperDominating-Edges, Extreme SuperHyperDominating-Edges, and the Extreme 2620

SuperHyperDominating-Edges, some general results are introduced. 2621
Remark 12.0.1. Let remind that the Extreme SuperHyperDominating-Edges is “redefined” on the 2622
positions of the alphabets. 2623
Corollary 12.0.2. Assume Extreme SuperHyperDominating-Edges. Then 2624
Extreme SuperHyperDominating − Edges =

{theSuperHyperDominating − Edgesof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperDominating − Edges
|ExtremecardinalityamidthoseSuperHyperDominating−Edges. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2625
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2626
and the neutrality, for i = 1, 2, 3, respectively. 2627
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2628
alphabet. Then the notion of Extreme SuperHyperDominating-Edges and SuperHyperDominating-Edges 2629
coincide. 2630
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2631
the alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme 2632
SuperHyperDominating-Edges if and only if it’s a SuperHyperDominating-Edges. 2633
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of the alpha- 2634
bet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperDominating- 2635
Edges if and only if it’s a longest SuperHyperDominating-Edges. 2636
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the 2637
same identical letter of the alphabet. Then its Extreme SuperHyperDominating-Edges is its 2638
SuperHyperDominating-Edges and reversely. 2639
125
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperDominating-Edges, SuperHy- 2640

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 2641
letter of the alphabet. Then its Extreme SuperHyperDominating-Edges is its SuperHyperDominating-Edges 2642
and reversely. 2643
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperDominating- 2644
isn’t well-defined if and only if its SuperHyperDominating-Edges isn’t well-defined.
Edges 2645
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2646

Extreme SuperHyperDominating-Edges isn’t well-defined if and only if its SuperHyperDominating-Edges 2647
isn’t well-defined. 2648

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2650
SuperHyperDominating-Edges isn’t well-defined if and only if its SuperHyperDominating-Edges isn’t well- 2651
defined. 2652
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperDominating- 2653
is well-defined if and only if its SuperHyperDominating-Edges is well-defined.
Edges 2654
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2655

Extreme SuperHyperDominating-Edges is well-defined if and only if its SuperHyperDominating-Edges is 2656
well-defined. 2657

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2659
SuperHyperDominating-Edges is well-defined if and only if its SuperHyperDominating-Edges is well-defined. 2660
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2661
(i) : the dual SuperHyperDefensive SuperHyperDominating-Edges; 2662
(ii) : the strong dual SuperHyperDefensive SuperHyperDominating-Edges; 2663
(iii) : the connected dual SuperHyperDefensive SuperHyperDominating-Edges; 2664
(iv) : the δ-dual SuperHyperDefensive SuperHyperDominating-Edges; 2665
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDominating-Edges; 2666
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDominating-Edges. 2667
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2668
(i) : the SuperHyperDefensive SuperHyperDominating-Edges; 2669
(ii) : the strong SuperHyperDefensive SuperHyperDominating-Edges; 2670
(iii) : the connected defensive SuperHyperDefensive SuperHyperDominating-Edges; 2671
(iv) : the δ-SuperHyperDefensive SuperHyperDominating-Edges; 2672
(v) : the strong δ-SuperHyperDefensive SuperHyperDominating-Edges; 2673

(vi) : the connected δ-SuperHyperDefensive SuperHyperDominating-Edges. 2674
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2675

independent SuperHyperSet is 2676
(iii) : the connected SuperHyperDefensive SuperHyperDominating-Edges; 2679
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2683

which is a SuperHyperDominating-Edges/SuperHyperPath. Then V is a maximal 2684
(i) : SuperHyperDefensive SuperHyperDominating-Edges; 2685
(ii) : strong SuperHyperDefensive SuperHyperDominating-Edges; 2686
(iii) : connected SuperHyperDefensive SuperHyperDominating-Edges; 2687
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDominating-Edges; 2688
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDominating-Edges; 2689
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDominating-Edges; 2690
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2691
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2692

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2693
(i) : dual SuperHyperDefensive SuperHyperDominating-Edges; 2694
(ii) : strong dual SuperHyperDefensive SuperHyperDominating-Edges; 2695
(iii) : connected dual SuperHyperDefensive SuperHyperDominating-Edges; 2696
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDominating-Edges; 2697
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDominating-Edges; 2698
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDominating-Edges; 2699

which is a SuperHyperDominating-Edges/SuperHyperPath. Then the number of 2702
(i) : the SuperHyperDominating-Edges; 2703

(ii) : the SuperHyperDominating-Edges; 2704
(iii) : the connected SuperHyperDominating-Edges; 2705
(iv) : the O(ESHG)-SuperHyperDominating-Edges; 2706
(v) : the strong O(ESHG)-SuperHyperDominating-Edges; 2707
(vi) : the connected O(ESHG)-SuperHyperDominating-Edges. 2708
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2709
coincide. 2710

which is a SuperHyperWheel. Then the number of 2712
(i) : the dual SuperHyperDominating-Edges; 2713
(ii) : the dual SuperHyperDominating-Edges; 2714
(iii) : the dual connected SuperHyperDominating-Edges; 2715
(iv) : the dual O(ESHG)-SuperHyperDominating-Edges; 2716
(v) : the strong dual O(ESHG)-SuperHyperDominating-Edges; 2717
(vi) : the connected dual O(ESHG)-SuperHyperDominating-Edges. 2718
coincide. 2720
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2722

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2723
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2724
is a 2725
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperDominating-Edges; 2729
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperDominating-Edges; 2730
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperDominating-Edges. 2731

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2734
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2735
SuperHyperPart is a 2736

(iv) : δ-SuperHyperDefensive SuperHyperDominating-Edges; 2740
(v) : strong δ-SuperHyperDefensive SuperHyperDominating-Edges; 2741
(vi) : connected δ-SuperHyperDefensive SuperHyperDominating-Edges. 2742

SuperHyperMultipartite. Then Then the number of 2745
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2752
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2753
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2755
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2756
(iv) : SuperHyperDominating-Edges; 2760
(v) : strong 1-SuperHyperDefensive SuperHyperDominating-Edges; 2761
(vi) : connected 1-SuperHyperDefensive SuperHyperDominating-Edges. 2762
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2763
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2764
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2765
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2766

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

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

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

2 + 1)-SuperHyperDefensive SuperHyperDominating-Edges. 2773
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2774
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2775
dual 2776
(iv) : 0-SuperHyperDefensive SuperHyperDominating-Edges; 2780
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2783
perComplete. Then there’s no independent SuperHyperSet. 2784
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2785

SuperHyperDominating-Edges/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2786
and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2787
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating-Edges; 2791
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating-Edges; 2792
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating-Edges. 2793
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2794
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2795
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2796
t>
2
setting of a dual 2797



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

SuperHyperDominating-Edges; 2825
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2826
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2827
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2828

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2830
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperDominating-Edges; 2831
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2832
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2833
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2834
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperDominating-Edges. Then 2836
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperDominating- 2837

Edges; 2838
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2839
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2840
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2841
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperDominating-Edges. Then 2843

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2847
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2848
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2850
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDominating-Edges; 2851
(ii) Γ = 1; 2852
(iii) Γs = Σ3i=1 σi (c); 2853
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDominating-Edges. 2854
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2855
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2856
SuperHyperDefensive SuperHyperDominating-Edges; 2857
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2858
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2859
i=1

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

2
; 2865
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperDominating- 2866
Edges. 2867
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2868
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperDominating-Edges; 2869
(ii) Γ = b n2 c; 2870
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 2871
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive 2872
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2874

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2875
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperDominating- 2876

Edges for N SHF; 2877
(ii) Γ = m for N SHF : (V, E); 2878
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2879
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperDominating- 2880
Edges for N SHF : (V, E). 2881
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2882

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2883
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2884
SuperHyperDominating-Edges for N SHF; 2885
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2886
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 2887
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperDominating-Edges for 2888
N SHF : (V, E). 2889

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2891
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperDominating-Edges 2892
for N SHF : (V, E); 2893
(ii) Γ = b n2 c for N SHF : (V, E); 2894
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 2895
S={vi }i=1
bnc
2
are only dual maximal SuperHyperDominating-Edges for 2896
N SHF : (V, E). 2897
following statements hold; 2899
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2900

SuperHyperDominating-Edges, then S is an s-SuperHyperDefensive SuperHyperDominating-Edges; 2901
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2902
SuperHyperDominating-Edges, then S is a dual s-SuperHyperDefensive SuperHyperDominating- 2903

Edges. 2904
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2907

SuperHyperDominating-Edges, then S is an s-SuperHyperPowerful SuperHyperDominating-Edges; 2908

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

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

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

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

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

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

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


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

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

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

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

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


SuperHyperGraph which is SuperHyperDominating-Edges. Then following statements hold; 2952
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 2953
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2955

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

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


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

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


CHAPTER 13 2971
Extreme Applications in Cancer’s 2972
Extreme Recognition 2973
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2974
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2975
as the consequences of the model, some parameters are used. The cells are under attack of this 2976
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2977
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2978
In the following, some Extreme steps are Extreme devised on this disease. 2979
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2980
function. 2981
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2982
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2983
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2987
what’s done. 2988
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2989
they’ve got the names, and some general Extreme models. The moves and the Extreme 2990
traces of the cancer on the complex tracks and between complicated groups of cells could be 2991
fantasized by an Extreme SuperHyperPath(-/SuperHyperDominating-Edges, SuperHyperStar, 2992
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 2993
either the Extreme SuperHyperDominating-Edges or the Extreme SuperHyperDominating-Edges 2994
in those Extreme Extreme SuperHyperModels. 2995
137
CHAPTER 14 2996
Case 1: The Initial Extreme Steps 2997
Toward Extreme SuperHyperBipartite 2998
as Extreme SuperHyperModel 2999
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3000
is Extreme highlighted and Extreme featured. 3001
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3002
partite is obtained. 3003
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3004
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperDominating-Edges 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

136TBLaa21aa
result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBi- 3005

partite ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme 3006

CHAPTER 15 3008
Case 2: The Increasing Extreme Steps 3009
Toward Extreme 3010
SuperHyperMultipartite as Extreme 3011
SuperHyperModel 3012
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3013
ite is Extreme highlighted and Extreme featured. 3014
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3015
partite is obtained. 3016
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 3017
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

136TBLaa22aa
ult, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperMul- 3018

tipartite ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme 3019

CHAPTER 16 3021
Wondering Open Problems But As The 3022
Directions To Forming The Motivations 3023
In what follows, some “problems” and some “questions” are proposed. 3024
The SuperHyperDominating-Edges and the Extreme SuperHyperDominating-Edges are defined on a 3025
real-world application, titled “Cancer’s Recognitions”. 3026
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3027
recognitions? 3028
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperDominating-Edges and 3029
the Extreme SuperHyperDominating-Edges? 3030
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3031
them? 3032
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDominating- 3033
and the Extreme SuperHyperDominating-Edges?
Edges 3034
Problem 16.0.5. The SuperHyperDominating-Edges and the Extreme SuperHyperDominating-Edges do a 3035

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperDominating-Edges, 3036
are there else? 3037
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3038
Numbers types-results? 3039
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3040
the multiple types of SuperHyperNotions? 3041
143
CHAPTER 17 3042
Conclusion and Closing Remarks 3043
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3044
research are illustrated. Some benefits and some advantages of this research are highlighted. 3045
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3046
In this endeavor, two SuperHyperNotions are defined on the SuperHyperDominating-Edges. For 3047
that sake in the second definition, the main definition of the Extreme SuperHyperGraph is 3048
redefined on the position of the alphabets. Based on the new definition for the Extreme 3049
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperDominating-Edges, finds the 3050
convenient background to implement some results based on that. Some SuperHyperClasses 3051
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 3052
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 3053
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 3054
SuperHyperDominating-Edges, the new SuperHyperClasses and SuperHyperClasses, are introduced. 3055
Some general results are gathered in the section on the SuperHyperDominating-Edges and the 3056
Extreme SuperHyperDominating-Edges. The clarifications, instances and literature reviews have 3057
taken the whole way through. In this research, the literature reviews have fulfilled the lines 3058
containing the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph 3059
are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of 3060
this research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 3061
based on the connectivities of the moves of the cancer in the longest and strongest styles with 3063
the formation of the design and the architecture are formally called “ SuperHyperDominating-Edges” 3064
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 3066
benefits and avenues for this research are, figured out, pointed out and spoken out. 3067
145
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperDominating-Edges
3. Extreme SuperHyperDominating-Edges 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3068
Extreme SuperHyperDuality But As The 3069
Super Forms 3071
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3072

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

Va ∈ Ei , Ej ; 3076
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3077
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3078
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3079
Vi , Vj ∈ Ea ; 3080
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3081
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3082
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3083
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3084

SuperHyperDuality. 3085
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3086

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3091
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3092
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3093
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3094
Extreme SuperHyperDuality; 3095
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3096

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3097
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3098
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3099
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3100
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3101
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3102

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3103
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3104
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3105
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3106
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3107
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3109
coefficient; 3110
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3111

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

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3134
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3135
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3136
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3137
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3138

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3139

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3147
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3148
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3149
Extreme coefficient. 3150
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3151
mentioned Extreme Figures in every Extreme items. 3152
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3153
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3154
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3155
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3156
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3157
C(N SHG)Extreme SuperHyperDuality = {E4 }.

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


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

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 3211
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. 3215
(31.1), is the SuperHyperDuality. 3218
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 3220
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3237
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 3239
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 3242
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3243
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3244
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3245
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3246
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 : 3248

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3260


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

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

∃!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 3285
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3286
Extreme SuperHyperDuality. 3292

CHAPTER 19 3293
Extreme SuperHyperJoin But As The 3294
Super Forms 3296
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3297

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3308
|Vj |Extreme CARDINALITY ; 3309
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3310
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3311
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3312

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3316
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3320
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3321

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3328
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3329
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3330
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3331
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3332
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3333
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3334
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3335

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3351
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3352
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3354
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3355
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3356

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3359

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

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

SuperHyperJoin. 3380
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 3382
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3383
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3384
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3385
V3 , is excluded in every given Extreme SuperHyperJoin. 3387

is up. The Extreme Algorithm is Extremely straightforward. 3389


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3510
Extreme SuperHyperPerfect But As The 3511
Super Forms 3513
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3514

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3526
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3527

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3531
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3532
Extreme SuperHyperPerfect; 3536
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3537

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3544
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3545
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3550
coefficient; 3551
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3552

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3588
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3589
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3590
Extreme coefficient. 3591
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3594
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3595
SuperHyperPerfect. 3601
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 3603
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3604
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3608


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

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

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

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

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



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

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

Then 3699

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



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

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

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


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

CHAPTER 21 3734
Extreme SuperHyperTotal But As The 3735
Super Forms 3737
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3738
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3741
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3742

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3748
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3749

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

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

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3773
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3775
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3776
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3777
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3779
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3780

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3781
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3784
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3785
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3786

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3793
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3794
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3797
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3798
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3799
coefficient; 3800
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3801

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3804
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3805
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3806
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3808
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3811
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3812
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3813
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3814
SuperHyperTotal. 3818
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 3820
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3821
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3822
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3823
V3 , is excluded in every given Extreme SuperHyperTotal. 3825



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3873
(31.1), is the SuperHyperTotal. 3876
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 3878
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Extreme Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1


SuperHyperModel (31.2), is the Extreme SuperHyperTotal. 3885
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 3887
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3949
Extreme SuperHyperConnected But As 3950
The Extensions Excerpt From Dense And 3951
Super Forms 3952
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3953

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3967
SuperHyperConnected. 3968
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3969
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3972

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3986
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3987
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3988
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3989
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3990
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3991
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 3992
corresponded to its Extreme coefficient; 3993
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3994


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

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

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

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

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

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

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

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

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 4045
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 4046
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 4050


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

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

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 4094
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. 4098
(31.1), is the SuperHyperConnected. 4101
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 4103
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1 .

SuperHyperModel (31.2), is the Extreme SuperHyperConnected. 4110
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 4112



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4131

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4166
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4167
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4168
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4169
some representatives. The latter is straightforward. 4170
Extreme SuperHyperConnected. 4175

CHAPTER 23 4176
Background 4177

217









HG262; HG263; HG264; HG265], there are some endeavors to formalize the basic Super- 4319
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 4320


HG171b]. Two popular scientific research books in Scribd in the terms of high readers, 4334
4190 and 5189 respectively, on neutrosophic science is on [HG32b; HG44b]. 4335

See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the no- 4349
tions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in Super- 4350
HyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; 4351
HG259; HG260; HG261; HG262; HG263; HG264; HG265] alongside scientific re- 4370
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4371


Bibliography 4386
10.33140/JMTCM.01.03.09) 4390


223
10.20944/preprints202301.0282.v1). 4423
10.20944/preprints202301.0267.v1). 4426

(doi: 10.20944/preprints202301.0265.v1). 4431
prints202301.0262.v1). 4435
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4441
prints202301.0105.v1). 4444
Preprints 2023, 2023010044 4450
10.20944/preprints202301.0043.v1). 4453

(doi: 10.20944/preprints202212.0549.v1). 4462
(doi: 10.20944/preprints202212.0500.v1). 4469
odo.7916595). 4478
odo.7923632). 4481

(doi: 10.5281/zenodo.7904698). 4484
2023, (doi: 10.5281/zenodo.7904671). 4487

10.5281/zenodo.7871026). 4496
2023, (doi: 10.5281/zenodo.7874647). 4499
10.5281/zenodo.7857856). 4502
2023, (doi: 10.5281/zenodo.7857841). 4505
10.5281/zenodo.7853867). 4514
10.5281/zenodo.7853922). 4517
(doi: 10.5281/zenodo.7851519). 4520
(doi: 10.5281/zenodo.7851550). 4523
10.5281/zenodo.7834229). 4532

10.5281/zenodo.7834261). 4535
10.5281/zenodo.7824560). 4538
(doi: 10.5281/zenodo.7824623). 4541
2023, (doi: 10.5281/zenodo.7809365). 4552
2023, (doi: 10.5281/zenodo.7809358). 4555
10.5281/zenodo.7809219). 4558
10.5281/zenodo.7809328). 4561
2023, (doi: 10.5281/zenodo.7806767). 4564
2023, (doi: 10.5281/zenodo.7806838). 4567

10.5281/zenodo.7799902). 4576
(doi: 10.5281/zenodo.7804218). 4579
(doi: 10.5281/zenodo.7796334). 4582
10.5281/zenodo.7791952). 4588
10.5281/zenodo.7791982). 4591
10.5281/zenodo.7790026). 4594
10.5281/zenodo.7790052). 4597
2023, (doi: 10.5281/zenodo.7787066). 4600
10.5281/zenodo.7781476). 4606
10.5281/zenodo.7783082). 4609

10.5281/zenodo.7777857). 4612
10.5281/zenodo.7779286). 4615
(doi: 10.5281/zenodo.7771831). 4618
2023, (doi: 10.5281/zenodo.7772468). 4621
10.13140/RG.2.2.20913.25446). 4624
odo.7764916). 4627
10.13140/RG.2.2.11770.98247). 4630
10.13140/RG.2.2.12400.12808). 4633
2023, (doi: 10.13140/RG.2.2.22545.10089). 4636
10.13140/RG.2.2.11377.76644). 4642
10.13140/RG.2.2.23750.96329). 4645
10.13140/RG.2.2.31366.24641). 4648

10.13140/RG.2.2.34721.68960). 4651
2023, (doi: 10.13140/RG.2.2.30212.81289). 4654
10.13140/RG.2.2.24288.35842). 4660
10.13140/RG.2.2.32467.25124). 4663
10.13140/RG.2.2.31025.45925). 4666
10.13140/RG.2.2.17184.25602). 4669
10.13140/RG.2.2.23423.28327). 4672
10.13140/RG.2.2.28456.44805). 4675
10.13140/RG.2.2.23525.68320). 4678
10.13140/RG.2.2.20170.24000). 4681
10.13140/RG.2.2.36475.59683). 4684
10.13140/RG.2.2.29764.71046). 4687

2023, (doi: 10.13140/RG.2.2.18780.87683). 4690
10.13140/RG.2.2.26134.01603). 4696
10.13140/RG.2.2.27392.30721). 4699
10.13140/RG.2.2.33028.40321). 4702
10.13140/RG.2.2.21389.20966). 4705
10.13140/RG.2.2.16356.04489). 4708
10.13140/RG.2.2.21756.21129). 4711
10.13140/RG.2.2.30983.68009). 4714
10.13140/RG.2.2.28552.29445). 4717
(doi: 10.13140/RG.2.2.10936.21761). 4720
10.13140/RG.2.2.35105.89447). 4723
(doi: 10.13140/RG.2.2.30072.72960). 4726

10.13140/RG.2.2.31147.52003). 4729
10.13140/RG.2.2.32825.24163). 4732
10.13140/RG.2.2.13059.58401). 4735
10.13140/RG.2.2.11172.14720). 4738
2023, (doi: 10.13140/RG.2.2.22011.80165). 4741
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4744
2023, (doi: 10.13140/RG.2.2.10493.84962). 4747
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4750
2023, (doi: 10.13140/RG.2.2.19944.14086). 4753
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4756
(doi: 10.13140/RG.2.2.33103.76968). 4759
(doi: 10.13140/RG.2.2.23037.44003). 4762
(doi: 10.13140/RG.2.2.35646.56641). 4765

10.13140/RG.2.2.18030.48967). 4768
(doi: 10.13140/RG.2.2.13973.81121). 4771
2023, (doi: 10.13140/RG.2.2.34106.47047). 4774
2023, (doi: 10.13140/RG.2.2.31956.88961). 4780
2023, (doi: 10.13140/RG.2.2.15179.67361). 4783
10.13140/RG.2.2.21510.45125). 4786
2023, (doi: 10.13140/RG.2.2.13121.84321). 4789
10.13140/RG.2.2.11758.69441). 4792
2023, (doi: 10.13140/RG.2.2.31891.35367). 4795
10.13140/RG.2.2.19360.87048). 4798
10.13140/RG.2.2.32363.21286). 4801
10.13140/RG.2.2.23266.81602). 4804

10.13140/RG.2.2.19911.37285). 4807
10.13140/RG.2.2.11050.90569). 4810
2023, (doi: 10.13140/RG.2.2.17761.79206). 4813
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4819
(doi: 10.13140/RG.2.2.30182.50241). 4822

2023, (doi: 10.13140/RG.2.2.17252.24968). 4855

2023010396 (doi: 10.20944/preprints202301.0396.v1). 4864
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4867


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


10.20944/preprints202301.0282.v1). 4888

10.20944/preprints202301.0267.v1).). 4891

(doi: 10.20944/preprints202301.0265.v1). 4896
prints202301.0262.v1). 4900

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

10.13140/RG.2.2.35061.65767). 4909
10.13140/RG.2.2.18494.15680). 4913
10.13140/RG.2.2.32530.73922). 4917
10.13140/RG.2.2.15897.70243). 4921

10.13140/RG.2.2.32530.73922). 4925
prints202301.0105.v1). 4928
10.13140/RG.2.2.23172.19849). 4935

10.13140/RG.2.2.17385.36968). 4945
Preprints 2023, 2023010044 4948

10.20944/preprints202301.0043.v1). 4951

2023, (doi: 10.13140/RG.2.2.28945.92007). 4954
10.13140/RG.2.2.35774.77123). 4960


10.13140/RG.2.2.29430.88642). 4966
(doi: 10.20944/preprints202212.0549.v1). 4972
10.13140/RG.2.2.19380.94084). 4975


(doi: 10.20944/preprints202212.0500.v1). 4986
10.13140/RG.2.2.20993.12640). 4989




10.13140/RG.2.2.29173.86244). 5004
10.5281/zenodo.7923786). 5009
2023 (doi: 10.5281/zenodo.7905287). 5011

2023 (doi: 10.5281/zenodo.7874677). 5015
(doi: 10.5281/zenodo.7857906). 5017
2023 (doi: 10.5281/zenodo.7856329). 5019
10.5281/zenodo.7854561). 5021
2023 (doi: 10.5281/zenodo.7851893). 5023

(doi: 10.5281/zenodo.7835063). 5027
(doi: 10.5281/zenodo.7826705). 5029
2023 (doi: 10.5281/zenodo.7820680). 5031
10.5281/zenodo.7812750). 5033



2023 (doi: 10.5281/zenodo.7807782). 5039
2023 (doi: 10.5281/zenodo.7804449). 5041

(doi: 10.5281/zenodo.7792307). 5045
(doi: 10.5281/zenodo.7790728). 5047
2023 (doi: 10.5281/zenodo.7787712). 5049
10.5281/zenodo.7783791). 5051
10.5281/zenodo.7780123). 5053
(doi: 10.5281/zenodo.7773119). 5055
odo.7637762). 5057
10.5281/zenodo.7766174). 5059
10.5281/zenodo.7762232). 5061
(doi: 10.5281/zenodo.7758601). 5063
10.5281/zenodo.7754661). 5065
10.5281/zenodo.7750995) . 5067
(doi: 10.5281/zenodo.7749875). 5069

10.5281/zenodo.7747236). 5071
10.5281/zenodo.7742587). 5073
(doi: 10.5281/zenodo.7738635). 5075
10.5281/zenodo.7734719). 5077
10.5281/zenodo.7730484). 5079
(doi: 10.5281/zenodo.7730469). 5081
10.5281/zenodo.7722865). 5083
odo.7713563). 5085
odo.7709116). 5087
10.5281/zenodo.7706415). 5089
10.5281/zenodo.7706063). 5091
10.5281/zenodo.7701906). 5093
odo.7700205). 5095
10.5281/zenodo.7694876). 5097
10.5281/zenodo.7679410). 5099
10.5281/zenodo.7675982). 5101
10.5281/zenodo.7672388). 5103
odo.7668648). 5105

10.5281/zenodo.7662810). 5107
10.5281/zenodo.7659162). 5109
odo.7653233). 5111
odo.7653204). 5113
odo.7653142). 5115
odo.7653117). 5117
odo.7651687). 5120
odo.7651619). 5122
odo.7651439). 5124
odo.7650729). 5126
odo.7647868). 5128
odo.7647017). 5130
odo.7644894). 5132
odo.7632923). 5135
odo.7623459). 5137
10.5281/zenodo.7606416). 5139

10.5281/zenodo.7606416). 5141
odo.7606404). 5143
10.5281/zenodo.7580018). 5145
odo.7580018). 5147
odo.7580018). 5149
odo.7579929). 5151
10.5281/zenodo.7563170). 5153
odo.7563164). 5155
odo.7563160). 5157
odo.7563160). 5159
10.5281/zenodo.7563160). 5161
10.5281/zenodo.7557063). 5163
10.5281/zenodo.7557009). 5165
10.5281/zenodo.7539484). 5167
10.5281/zenodo.7523390). 5169
10.5281/zenodo.7523390). 5171
10.5281/zenodo.7523390). 5173
odo.7574952). 5175

10.5281/zenodo.7574992). 5177
odo.7523357). 5179
10.5281/zenodo.7523357). 5181
10.5281/zenodo.7504782). 5183
10.5281/zenodo.7504782). 5185
10.5281/zenodo.7504782). 5187
10.5281/zenodo.7499395). 5189
odo.7499395). 5191
10.5281/zenodo.7499395). 5193
10.5281/zenodo.7497450). 5195
10.5281/zenodo.7497450). 5197
10.5281/zenodo.7494862). 5199
odo.7494862). 5201
10.5281/zenodo.7494862). 5203
10.5281/zenodo.7493845). 5205
odo.7493845). 5207
10.5281/zenodo.7493845). 5209
odo.7539484). 5211

odo.7523390). 5213
odo.7523357). 5215
odo.7504782). 5217
odo.7499395). 5219
odo.7497450). 5221
odo.7494862). 5223
odo.7493845). 5225
odo.7480110). 5227
odo.7378758). 5229
odo.6320305). 5231
odo.6677173). 5233

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5314
Then the research has taken more motivations to define SuperHyperClasses and to find some 5315
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5316
some instances and examples to make clarifications about the framework of this research. The 5317
general results and some results about some connections are some avenues to make key point of 5318
this research, “Cancer’s Recognition”, more understandable and more clear. 5319
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5320
research on the modeling of the regions where are under the attacks of the cancer to 5321
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5322
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5323
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5324
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5325

instances and literature reviews have taken the whole way through. In this scientific research, 5326
the literature reviews have fulfilled the lines containing the notions and the results. The 5327
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5328
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5329
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5330
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5331
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5332
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5333
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5334
to figure out the background for the SuperHyperNotions. 5335

CHAPTER 25 5336
Neutrosophic Dominating-Edges 5337
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5338
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5339
2023, (doi: 10.13140/RG.2.2.34953.52320). 5340

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5341
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5342
(doi: 10.13140/RG.2.2.33275.80161). 5343
10.13140/RG.2.2.11050.90569). 5346
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5347
10.13140/RG.2.2.17761.79206). 5349
10.13140/RG.2.2.19911.37285). 5352
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5353
10.13140/RG.2.2.23266.81602). 5355
10.13140/RG.2.2.19360.87048). 5358
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5359
10.13140/RG.2.2.32363.21286). 5361
10.13140/RG.2.2.11758.69441). 5364
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5365
10.13140/RG.2.2.31891.35367). 5367
10.13140/RG.2.2.21510.45125). 5370
251
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5371
10.13140/RG.2.2.13121.84321). 5373

CHAPTER 26 5374
New Ideas In Recognition of Cancer And 5375
Neutrosophic SuperHyperGraph By 5376
Dominating-Edges As Hyper Dome On 5377
Super Eddy 5378
253
CHAPTER 27 5379
ABSTRACT 5380
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperDominating- 5381

Edges). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Dominating-Edges pair S = (V, E). 5382
Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 5383
either V 0 or E 0 is called Neutrosophic e-SuperHyperDominating-Edges if the following expression is 5384
called Neutrosophic e-SuperHyperDominating-Edges criteria holds 5385

Neutrosophic re-SuperHyperDominating-Edges if the following expression is called Neutrosophic 5386
e-SuperHyperDominating-Edges criteria holds 5387

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

v-SuperHyperDominating-Edges if the following expression is called Neutrosophic v- 5389
SuperHyperDominating-Edges criteria holds 5390

Neutrosophic rv-SuperHyperDominating-Edges if the following expression is called Neutrosophic 5391

v-SuperHyperDominating-Edges criteria holds 5392

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic 5393

SuperHyperDominating-Edges if it’s either of Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic 5394
re-SuperHyperDominating-Edges, Neutrosophic v-SuperHyperDominating-Edges, and Neutrosophic rv- 5395
SuperHyperDominating-Edges. ((Neutrosophic) SuperHyperDominating-Edges). Assume a Neutrosophic 5396
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5397
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperDominating-Edges if it’s 5398
255

Extreme SuperHyperVertices such that they form the Extreme SuperHyperDominating-Edges; a 5404
Neutrosophic SuperHyperDominating-Edges if it’s either of Neutrosophic e-SuperHyperDominating- 5405

Edges, Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic v-SuperHyperDominating-Edges, and 5406
Neutrosophic rv-SuperHyperDominating-Edges and C(N SHG) for a Neutrosophic SuperHyperGraph 5407
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 5408
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 5409
SuperHyperDominating-Edges; an Extreme SuperHyperDominating-Edges SuperHyperPolynomial if it’s 5411

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolyno- 5414
mial contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 5415
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5416
its Extreme coefficient; a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if it’s 5419
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHy- 5422
perPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 5423
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Su- 5424
perHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 5425
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating- 5426
Edges; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Ex- 5427
treme V-SuperHyperDominating-Edges if it’s either of Neutrosophic e-SuperHyperDominating-Edges, 5428
Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic v-SuperHyperDominating-Edges, and 5429

Neutrosophic rv-SuperHyperDominating-Edges and C(N SHG) for an Extreme SuperHyperGraph 5430
high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5432
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5433
the Extreme SuperHyperDominating-Edges; a Neutrosophic V-SuperHyperDominating-Edges if it’s 5434

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 5437
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating-Edges; 5440
an Extreme V-SuperHyperDominating-Edges SuperHyperPolynomial if it’s either of Neutro- 5441
sophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic 5442
v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges and C(N SHG) 5443
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 5444

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 5446
its Extreme coefficient; a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if 5449
it’s either of Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating- 5450
Edges, Neutrosophic v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges 5451

and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5452
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 5454
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 5455
SuperHyperDominating-Edges; and the Neutrosophic power is corresponded to its Neutrosophic 5457

coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 5458
namely, a SuperHyperDominating-Edges and Neutrosophic SuperHyperDominating-Edges. Two different 5459
types of SuperHyperDefinitions are debut for them but the research goes further and the 5460
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 5461
and well-reviewed. The literature review is implemented in the whole of this research. For 5462
shining the elegancy and the significancy of this research, the comparison between this Su- 5463
perHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 5464
featured. The definitions are followed by the examples and the instances thus the clarifica- 5465
tions are driven with different tools. The applications are figured out to make sense about 5466
the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under 5467
research to figure out the challenges make sense about ongoing and upcoming research. The 5468
special case is up. The cells are viewed in the deemed ways. There are different types of 5469
them. Some of them are individuals and some of them are well-modeled by the group of 5470
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 5471
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 5472
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 5473
these complex and dense SuperHyperModels open up some avenues to research on theoret- 5474
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 5475
It’s also officially collected in the form of some questions and some problems. Assume a 5476
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperDominating-Edges is a 5477
maximal of SuperHyperVertices with a maximum cardinality such that either of the following 5478
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 5479
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5480
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5481
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperDominating-Edges is a max- 5482
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5483
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5484
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5485
and |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first Expression, holds if S is a 5486
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperDominating- 5488
Edges . Since there’s more ways to get type-results to make a SuperHyperDominating-Edges more 5489
understandable. For the sake of having Neutrosophic SuperHyperDominating-Edges, there’s a 5490

need to “redefine” the notion of a “SuperHyperDominating-Edges ”. The SuperHyperVertices 5491

a SuperHyperDominating-Edges . It’s redefined a Neutrosophic SuperHyperDominating-Edges if the 5494
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 5495
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 5496
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 5497
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The max- 5498
imum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its 5499
Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To 5500
get structural examples and instances, I’m going to introduce the next SuperHyperClass of 5501
SuperHyperGraph based on a SuperHyperDominating-Edges . It’s the main. It’ll be disciplinary to 5502
have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 5503
have all SuperHyperDominating-Edges until the SuperHyperDominating-Edges, then it’s officially called a 5504
“SuperHyperDominating-Edges” but otherwise, it isn’t a SuperHyperDominating-Edges . There are some 5505
instances about the clarifications for the main definition titled a “SuperHyperDominating-Edges ”. 5506
disciplinary ways of the SuperHyperClass based on a SuperHyperDominating-Edges . For the sake 5508
of having a Neutrosophic SuperHyperDominating-Edges, there’s a need to “redefine” the notion 5509

of a “Neutrosophic SuperHyperDominating-Edges” and a “Neutrosophic SuperHyperDominating-Edges 5510
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 5511
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 5512
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 5513
SuperHyperGraph” if the intended Table holds. And a SuperHyperDominating-Edges are redefined 5514
to a “Neutrosophic SuperHyperDominating-Edges” if the intended Table holds. It’s useful to define 5515
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 5516
type-results to make a Neutrosophic SuperHyperDominating-Edges more understandable. Assume 5517
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5518
intended Table holds. Thus SuperHyperPath, SuperHyperDominating-Edges, SuperHyperStar, 5519
SuperHyperPath”, “Neutrosophic SuperHyperDominating-Edges”, “Neutrosophic SuperHyperStar”, 5521

“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutro- 5522
sophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 5523
SuperHyperDominating-Edges” where it’s the strongest [the maximum Neutrosophic value from all 5524
the SuperHyperDominating-Edges amid the maximum value amid all SuperHyperVertices from 5525
a SuperHyperDominating-Edges .] SuperHyperDominating-Edges . A graph is a SuperHyperUniform 5526

if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5527
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 5528
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5529
with two exceptions; it’s SuperHyperDominating-Edges if it’s only one SuperVertex as intersection 5530
amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 5531
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 5536

as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 5537
Recognition” and the results and the definitions will be introduced in redeemed ways. The 5546
recognition of the cancer in the long-term function. The specific region has been assigned 5547
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 5548
to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5552
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5554
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 5555
Neutrosophic SuperHyperPath(-/SuperHyperDominating-Edges, SuperHyperStar, SuperHyperBi- 5556
partite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 5557
SuperHyperDominating-Edges or the strongest SuperHyperDominating-Edges in those Neutrosophic 5558
SuperHyperModels. For the longest SuperHyperDominating-Edges, called SuperHyperDominating-Edges, 5559
and the strongest SuperHyperDominating-Edges, called Neutrosophic SuperHyperDominating-Edges, 5560
some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHy- 5561
perPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at 5562
least three SuperHyperEdges to form any style of a SuperHyperDominating-Edges. There isn’t 5563
any formation of any SuperHyperDominating-Edges but literarily, it’s the deformation of any 5564
SuperHyperDominating-Edges. It, literarily, deforms and it doesn’t form. A basic familiarity 5565
with Neutrosophic SuperHyperDominating-Edges theory, SuperHyperGraphs, and Neutrosophic 5566
SuperHyperGraphs theory are proposed. 5567

Keywords: Neutrosophic SuperHyperGraph, SuperHyperDominating-Edges, Cancer’s Neutro- 5568
sophic Recognition 5569


CHAPTER 28 5571
Applied Notions Under The Scrutiny Of 5572
The Motivation Of This Scientific 5573
Research 5574
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5575
try to bring the motivations in the narrative ways. Some cells have been faced with some 5576
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5577
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5578
as some groups and some groups or individuals have excessive labels which all are raised from 5579
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5580
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5581
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5582
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5583
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5584
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5585
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5586
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5587
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5588
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5589
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5590
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5591
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5592
is the disease but the model is going to figure out what’s going on this phenomenon. The 5593
special case of this disease is considered and as the consequences of the model, some parameters 5594
are used. The cells are under attack of this disease but the moves of the cancer in the 5595
special region are the matter of mind. The recognition of the cancer could help to find some 5596
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5597
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5598
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 5601
formation of the design and the architecture are formally called “ SuperHyperDominating-Edges” 5602
261
embedded styles to figure out the background for the SuperHyperNotions. The recognition of the 5604
cancer in the long-term function. The specific region has been assigned by the model [it’s called 5605
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. 5606
Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, 5607
indeterminacy and neutrality about the moves and the effects of the cancer on that region; 5608
this event leads us to choose another model [it’s said to be Neutrosophic SuperHyperGraph] 5609
to have convenient perception on what’s happened and what’s done. There are some specific 5610
models, which are well-known and they’ve got the names, and some general models. The 5611
moves and the traces of the cancer on the complex tracks and between complicated groups 5612
of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperDominating-Edges, 5613
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5614
is to find either the optimal SuperHyperDominating-Edges or the Neutrosophic SuperHyperDominating- 5615
Edges in those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that 5616
in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 5617
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 5618
of a SuperHyperDominating-Edges. There isn’t any formation of any SuperHyperDominating-Edges but 5619
literarily, it’s the deformation of any SuperHyperDominating-Edges. It, literarily, deforms and it 5620
doesn’t form. 5621
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5622
“ amount of SuperHyperDominating-Edges” of either individual of cells or the groups of cells based on 5623
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperDominating-Edges” 5624
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5626
these messy and dense SuperHyperModels where embedded notions are illustrated? 5627
Thus it motivates us to define different types of “ SuperHyperDominating-Edges” and “Neutrosophic 5629
SuperHyperDominating-Edges” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5630

Then the research has taken more motivations to define SuperHyperClasses and to find some 5631
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5632
some instances and examples to make clarifications about the framework of this research. The 5633
general results and some results about some connections are some avenues to make key point of 5634
this research, “Cancer’s Recognition”, more understandable and more clear. 5635
The framework of this research is as follows. In the beginning, I introduce basic definitions 5636
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5637
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5638
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5639
review literature are applied to make sense about what’s going to figure out about the upcoming 5640
sections. The main definitions and their clarifications alongside some results about new 5641
notions, SuperHyperDominating-Edges and Neutrosophic SuperHyperDominating-Edges, are figured out 5642

in sections “ SuperHyperDominating-Edges” and “Neutrosophic SuperHyperDominating-Edges”. In the 5643
sense of tackling on getting results and in Dominating-Edges to make sense about continuing the 5644
research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced 5645
and as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5646
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5647
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5648

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5649
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5650
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5651
and as concluding and closing section of theoretical research are contained in the section 5652
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 5653
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 5654
Results”, “ SuperHyperDominating-Edges”, “Neutrosophic SuperHyperDominating-Edges”, “Results on 5655

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5656
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5657
this research and going to figure out the word “best” as the description and adjective for this 5658
research as presented in section, “ SuperHyperDominating-Edges”. The keyword of this research 5659
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5660
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5661
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5662
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5663
research in the terms of “questions” and “problems” to make sense to figure out this research in 5664
featured style. The advantages and the limitations of this research alongside about what’s done 5665
in this research to make sense and to get sense about what’s figured out are included in the 5666
section, “Conclusion and Closing Remarks”. 5667

CHAPTER 29 5668
Neutrosophic Preliminaries Of This 5669
Scientific Research On the Redeemed 5670
Ways 5671
In this section, the basic material in this scientific research, is referred to [Single Valued 5672
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5673

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5674
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5675
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5676
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5677
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5678
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5679
their clarifications are addressed to Ref.[HG38]. 5680
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5681
the new ideas and their clarifications are elicited. 5682
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

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

TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 29.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 5684
where 5686
1, 2, . . . , n0 ); 5691
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5692
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5693

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



SuperEdge; 5716
If we choose different types of binary operations, then we could get hugely diverse types of 5719
general forms of Neutrosophic SuperHyperGraph (NSHG). 5720
Definition 29.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 5721

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5722
x, y, z, w ∈ [0, 1]: 5723
(i) 1 ⊗ x = x; 5724
(ii) x ⊗ y = y ⊗ x; 5725
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5726
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5727

TA (x), IA (x), FA (x) >, x ∈ X} (with respect to t-norm Tnorm ):
TA (X) = Tnorm [TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = Tnorm [IA (vi ), IA (vj )]vi ,vj ∈X ,

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

where 5730

1, 2, . . . , n0 ); 5735
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5736
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5737
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5738
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5739
0


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

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5767
makes to have SuperHyperUniform more understandable. 5768
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5769
Classes as follows. 5770
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5771
two given SuperHyperEdges with two exceptions; 5772
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5773
SuperHyperEdges; 5774
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5775
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5776
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5777
in common; 5778
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5779
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5780
SuperHyperEdge in common; 5781
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5782
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5783
SuperVertex. 5784
Definition 29.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 5785
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5786
(i) Vi , Vi+1 ∈ Ei0 ; 5787
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5788
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5789
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5790
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5791
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5792
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5793
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5794
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 29.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

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

(Ref.[HG38],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 5802
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5803
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5804
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5805
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5806
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5807

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

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


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

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

to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5822
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperDominating-Edges). 5823

(i) Neutrosophic e-SuperHyperDominating-Edges if the following expression is called 5827

Neutrosophic e-SuperHyperDominating-Edges criteria holds 5828

(ii) Neutrosophic re-SuperHyperDominating-Edges if the following expression is called 5829

Neutrosophic re-SuperHyperDominating-Edges criteria holds 5830

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 5831
(iii) Neutrosophic v-SuperHyperDominating-Edges if the following expression is called 5832

(iv) Neutrosophic rv-SuperHyperDominating-Edges if the following expression is called 5834


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 5836
(v) Neutrosophic SuperHyperDominating-Edges if it’s either of Neutrosophic e- 5837

SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, Neutrosophic 5838
v-SuperHyperDominating-Edges, and Neutrosophic rv-SuperHyperDominating-Edges. 5839
Definition 29.0.19. ((Neutrosophic) SuperHyperDominating-Edges). 5840


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

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHy- 5847
perEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 5848
(ii) a Neutrosophic SuperHyperDominating-Edges if it’s either of Neutrosophic e- 5850

SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating-Edges; 5856
(iii) an Extreme SuperHyperDominating-Edges SuperHyperPolynomial if it’s either of 5857

Neutrosophic e-SuperHyperDominating-Edges, Neutrosophic re-SuperHyperDominating-Edges, 5858
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 5862
(iv) a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if it’s either 5866


SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5872
is corresponded to its Neutrosophic coefficient; 5875
(v) an Extreme V-SuperHyperDominating-Edges if it’s either of Neutrosophic e- 5876

(vi) a Neutrosophic V-SuperHyperDominating-Edges if it’s either of Neutrosophic e- 5883


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

sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperDominating- 5889
Edges; 5890
(vii) an Extreme V-SuperHyperDominating-Edges SuperHyperPolynomial if it’s either 5891

of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 5896
(viii) a Neutrosophic SuperHyperDominating-Edges SuperHyperPolynomial if it’s either 5900


is corresponded to its Neutrosophic coefficient. 5909
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperDominating-Edges). 5910

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5911
(i) an δ−SuperHyperDominating-Edges is a Neutrosophic kind of Neutrosophic 5912

SuperHyperDominating-Edges such that either of the following expressions hold for the 5913
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5914
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 5915
(29.1), holds if S is an δ−SuperHyperDefensive; 5916
(ii) a Neutrosophic δ−SuperHyperDominating-Edges is a Neutrosophic kind of Neutrosophic 5917
SuperHyperDominating-Edges such that either of the following Neutrosophic expressions hold 5918
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5919
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 5920
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5921


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

136TBL4
For the sake of having a Neutrosophic SuperHyperDominating-Edges, there’s a need to 5922

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and 5923
the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 5924
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5927
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5928
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5929
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neut- 5931
rosophic SuperHyperPath , SuperHyperDominating-Edges, SuperHyperStar, SuperHyperBipart- 5932
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5933
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5934
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5935

perHyperWheel if the Table (29.2) holds. 5936
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperDominating-Edges. 5937

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperDominating-Edges 5938
more Neutrosophicly understandable. 5939
For the sake of having a Neutrosophic SuperHyperDominating-Edges, there’s a need to “redefine” 5940
the Neutrosophic notion of “Neutrosophic SuperHyperDominating-Edges”. The SuperHyperVertices 5941
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 5942
136DEF1 Definition 29.0.23. Assume a SuperHyperDominating-Edges. It’s redefined a Neutrosophic 5944
SuperHyperDominating-Edges if the Table (29.3) holds. 5945


136TBL1

CHAPTER 30 5946
Neutrosophic SuperHyper But As Dominating-Edges 5947
Super Forms 5949
Definition 30.0.1. (Neutrosophic event). 5950
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5951
is a probability Dominating-Edges. Any Neutrosophic k-subset of A of V is called Neutrosophic 5952
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5953
following expression is called Neutrosophic probability of A. 5954
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5955

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

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

is a probability Dominating-Edges. Any k-function Dominating-Edges like E is called Neutrosophic 5963

k-Variable. If k = 2, then any 2-function Dominating-Edges like E is called Neutrosophic 5964
Variable. 5965
The notion of independent on Neutrosophic Variable is likewise. 5966
Definition 30.0.4. (Neutrosophic Expectation). 5967
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5968
277
a probability Dominating-Edges. A Neutrosophic k-Variable E has a number is called Neutrosophic 5969

Expectation if the following expression is called Neutrosophic Expectation criteria 5970
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5971

is a probability Dominating-Edges. A Neutrosophic number is called Neutrosophic Crossing if 5973

the following expression is called Neutrosophic Crossing criteria 5974
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 30.0.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5975
Consider S = (V, E) is a probability Dominating-Edges. Let m and n propose special Dominating-Edges. 5976
Then with m ≥ 4n, 5977
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 Dominating-Edges 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: 5978
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5979
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5980
Consider S = (V, E) is a probability Dominating-Edges. Let P be a SuperHyperSet of n points in the 5981
plane, and let l be the Neutrosophic number √ of SuperHyperLines in the plane passing through at 5982
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5983
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 5984

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

Consider S = (V, E) is a probability Dominating-Edges. Let P be a SuperHyperSet of n points in 5991
the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5992
k < 5n4/3 . 5993
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5994
S = (V, E) is a probability Dominating-Edges. Draw a SuperHyperUnit SuperHyperCircle around 5995

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6002
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6003
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6004
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6005
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6006
4/3 4/3
k < 4n + n < 5n . 6007
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6008
Consider S = (V, E) is a probability Dominating-Edges. Let X be a nonnegative Neutrosophic Variable 6009
and t a positive real number. Then 6010
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. 6011
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6012
Consider S = (V, E) is a probability Dominating-Edges. Let Xn be a nonnegative integer-valued 6013
variable in a probability Dominating-Edges (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 6014

P (Xn = 0) → 1 as n → ∞. 6015
Proof. 6016
Consider S = (V, E) is a probability Dominating-Edges. A special SuperHyperGraph in Gn,p almost 6018
surely has stability number at most d2p−1 log ne. 6019

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

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

S = (V, E) is a probability Dominating-Edges. Let X be a Neutrosophic Variable and let t be a 6044
positive real number. Then 6045
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6046
Consider S = (V, E) is a probability Dominating-Edges. Let Xn be a Neutrosophic Variable in a 6048

probability Dominating-Edges (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 6049
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Dominating-Edges. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s 6051
Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6052
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6053
Consider S = (V, E) is a probability Dominating-Edges. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6055
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 6056
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6057
S = (V, E) is a probability Dominating-Edges. As in the proof of related Theorem, the result is 6059
Consider S = (V, E) is a probability Dominating-Edges. Let G ∈ Gn,1/2 and let f and k ∗ be as defined 6062
in previous Theorem. Then either: 6063
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6064
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6065
Definition 30.0.17. (Neutrosophic Threshold). 6068
is a probability Dominating-Edges. Let P be a monotone property of SuperHyperGraphs (one which 6070
is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for P is a 6071
function f (n) such that: 6072
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6073
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6074

Definition 30.0.18. (Neutrosophic Balanced). 6075

is a probability Dominating-Edges. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6077
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6078
SubSuperHyperGraph is called Neutrosophic Balanced. 6079
Consider S = (V, E) is a probability Dominating-Edges. Let F be a nonempty balanced Neutrosophic 6081
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 6082
threshold function for the property of containing F as a Neutrosophic SubSuperHyperGraph. 6083
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6086
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6087
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6088

SuperHyperDominating-Edges, is up. The Neutrosophic Algorithm is Neutrosophicly 6089
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6090

is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6091
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6092
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6093
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6094
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6095
Neutrosophic SuperHyperDominating-Edges. 6096
C(N SHG)Neutrosophic Dominating-Edges

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

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

Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6103
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6104
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperDominating-Edges. 6105

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

Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.3) 136NSHG1
= {}.
= 0z 0 .
= {}.
= 0z 0 .
6106


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







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


= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .


= {V5 }.
= z7.
6118


= {Ei22
i=1
}.
X |E 22 |
= z ii=1 .
= {Vi11
i=1
}.
X |V 11 |
= z ii=1 .
6122




= {E3i+12i=0 , E2i+15i=0 }.
X |E 2 ,E 5 |
= z 3i+1i=0 2i+1i=0 .
= {V3i+12i=0 }.
X |V 2 |
= z 3i+1i=0 .
6126



= {E2 , E4 }.
= z5 + z3.
= {V13 }.
= z5.
6130


= {E3i+13i=0 , E2i+14i=0 , E3i7i=4 }.
X |E 3 ,E 4 ,E 7 |
= z 3i+1i=0 2i+1i=0 3ii=4 .
= {V3i+13i=0 }.



X |V 3 |
= z 3i+1i=0 .
6134


= {E2 , , E5 , E6 , E7 }.
= z 5 + z 3 + 2z 2 .
= {V13 }.
= z5.
6138






= {E3 , E4 , E5 , E8 }.
= z 3 + 3z 2 .
= {V6 }.
= z5.
6142


= {E1 , E6 }.
= z5 + z2.



= {V8 }.
= z8.
6146


= {E3 , E4 , E5 , E8 }.
= z 3 + 3z 2 .
= {V6 }.
= z5.
6150




= {E1 }.
= z2.
= {V3 }.
= z5.
6154


= {Ei+3 ∈ EN SHG }.


X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
6158


= {Ei+3 ∈ EN SHG }.


X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
6162


= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
6166







= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
6170


= {Ei+3 ∈ EN SHG }.



X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
6174


= {Ei ∈ EN SHG }.
X
= {V1 }.


= z6.
6178


= {E1 , E2 }.
= z 10 + z 2 .
= {V1 }.
= z5.
6182


Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.3) 95NHG1

= {Ei+3 ∈ EN SHG }i6=1 .
X
= z |Ei+3 ∈EN SHG |i6=1 .
= {Vi ∈ VEi+3 ∈EN SHG }i6=1 .
X |V ∈V
= z i Ei+3 ∈EN SHG |i6=1 .
6186
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6187
The all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Dominating- 6188


Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.3) 95NHG2
Edges if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6189
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6190
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6191
them. 6192
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6193

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6194
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6195
Neutrosophic quasi-R-Dominating-Edges minus all Neutrosophic SuperHypeNeighbor to some of 6196
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6197
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6198
quasi-R-Dominating-Edges, minus all Neutrosophic SuperHypeNeighbor to some of them but not all 6199
of them. 6200
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Dominating-Edges is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Dominating-Edges is at 6201
least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6202
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6203
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6204

Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Dominating- 6205

Edges in some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 6206
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6207
SuperHyperVertices are contained in a Neutrosophic R-Dominating-Edges. 6208
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Dominating-Edges 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-Dominating-Edges with the least Neutrosophic cardinality, the 6209
lower sharp Neutrosophic bound for cardinality. 6210
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6211

(V, E). Then in the worst case, literally, 6212
C(N SHG)N eutrosophicQuasi−Dominating−Edges

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Dominating−EdgesSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Dominating−Edges = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Dominating−EdgesSuperHyperP 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-Dominating-Edges 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-Dominating-Edges. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Dominating-Edges 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-Dominating-Edges. 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-Dominating-Edges 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-Dominating-Edges. 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-Dominating-Edges has the Neutrosophic cardinality of a
Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Dominating-Edges has the Neutrosophic
cardinality at least a Neutrosophic SuperHyperEdge. Assume a Neutrosophic SuperHyperSet
V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic R-Dominating-Edges since either
the Neutrosophic SuperHyperGraph is an obvious Neutrosophic SuperHyperModel thus it never
happens since there’s no Neutrosophic usage of this Neutrosophic framework and even more
there’s no Neutrosophic connection inside or the Neutrosophic SuperHyperGraph isn’t obvious
and as its consequences, there’s a Neutrosophic contradiction with the term “Neutrosophic
R-Dominating-Edges” since the maximum Neutrosophic cardinality never happens for this Neut-
rosophic 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-Dominating-Edges 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-Dominating-Edges 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-Dominating-Edges.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Dominating-Edges. 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-Dominating-Edges is
{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Neutrosophic R-Dominating-Edges 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-Dominating-Edges. 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, 6215
Neutrosophic R-Dominating-Edges =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6216
Neutrosophic R-Dominating-Edges =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Dominating-Edges where E ∈ EESHG:(V,E) is

fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Dominating-Edges, 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-Dominating-Edges is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Dominating-Edges is at 6217
least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutro- 6218
sophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In 6219
other words, the maximum number of the Neutrosophic SuperHyperEdges contains the max- 6220
imum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic 6221
Dominating-Edges in some cases but the maximum number of the Neutrosophic SuperHyperEdge 6222
with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutro- 6223
sophic SuperHyperVertices are contained in a Neutrosophic R-Dominating-Edges. 6224
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6225
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6226

the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6227
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6228
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6229
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6230
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6231
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6232
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6233

SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6234
Neutrosophic quasi-R-Dominating-Edges where the Neutrosophic completion of the Neutrosophic 6235
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Dominating-Edges. The 6236
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6237
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHy- 6238
perCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6239
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6240
timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in 6241
the minimum Neutrosophic style of the embedded Neutrosophic R-Dominating-Edges. The interior 6242
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6243
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6244
common connections, more precise and more formal, the perfect unique connections inside the 6245
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose 6246
the Neutrosophic R-Dominating-Edges. Thus Neutrosophic exterior SuperHyperVertices could be 6247
used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6248
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6249
embedded Neutrosophic Dominating-Edges, there’s the usage of exterior Neutrosophic SuperHyper- 6250
Vertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6251
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6252
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with 6253
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 6254
the Neutrosophic R-Dominating-Edges. The Neutrosophic R-Dominating-Edges with the exclusion of the 6255
exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and 6256
with other terms, the Neutrosophic R-Dominating-Edges with the inclusion of all Neutrosophic Supe- 6257
rHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Dominating-Edges. 6258
To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). 6259
There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6260
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neut- 6261
rosophic quasi-R-Dominating-Edges minus all Neutrosophic SuperHypeNeighbor to some of them 6262

but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6263
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6264
quasi-R-Dominating-Edges, minus all Neutrosophic SuperHypeNeighbor to some of them but not all 6265
of them. 6266
The main definition of the Neutrosophic R-Dominating-Edges has two titles. a Neutrosophic quasi-R- 6267
Dominating-Edges and its corresponded quasi-maximum Neutrosophic R-SuperHyperCardinality are 6268

two titles in the terms of quasi-R-styles. For any Neutrosophic number, there’s a Neutrosophic 6269
quasi-R-Dominating-Edges with that quasi-maximum Neutrosophic SuperHyperCardinality in the 6270
terms of the embedded Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic 6271
SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the collec- 6272

tion of all the Neutrosophic quasi-R-Dominating-Edgess for all Neutrosophic numbers less than its 6273
Neutrosophic corresponded maximum number. The essence of the Neutrosophic Dominating-Edges 6274
ends up but this essence starts up in the terms of the Neutrosophic quasi-R-Dominating-Edges, 6275
again and more in the operations of collecting all the Neutrosophic quasi-R-Dominating-Edgess 6276
acted on the all possible used formations of the Neutrosophic SuperHyperGraph to achieve one 6277
Neutrosophic number. This Neutrosophic number is 6278
considered as the equivalence class for all corresponded quasi-R-Dominating-Edgess. Let 6279
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Dominating-Edges be a Neutrosophic 6280
number, a Neutrosophic SuperHyperSet and a Neutrosophic Dominating-Edges. Then 6281
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Dominating-Edges ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Dominating-Edges is re-formalized 6282
and redefined as follows. 6283
GNeutrosophic Dominating-Edges ∈ ∪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 6284
definition for the Neutrosophic Dominating-Edges. 6285
GNeutrosophic Dominating-Edges =
{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 6286
poses the upcoming expressions.
Dominating-Edges 6287
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |


To translate the statement to this mathematical literature, the formulae will be revised. 6288
= max zNeutrosophic Number

And then, 6289

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


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

6292


6293

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6294
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Supe- 6295
rHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident 6296
to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi- 6297
Dominating-Edges” but, precisely, it’s the generalization of “Neutrosophic Quasi-Dominating-Edges” since 6298
“Neutrosophic Quasi-Dominating-Edges” happens “Neutrosophic Dominating-Edges” in a Neutrosophic 6299
SuperHyperGraph as initial framework and background but “Neutrosophic SuperHyperNeigh- 6300
borhood” may not happens “Neutrosophic Dominating-Edges” in a Neutrosophic SuperHyperGraph 6301
as initial framework and preliminarily background since there are some ambiguities about the 6302
Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Neut- 6303
rosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Dominating-Edges”, and “Neutrosophic 6304
Dominating-Edges” are up. 6305
Thus, let 6306
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6307
GNeutrosophic Dominating-Edges be a Neutrosophic number, a Neutrosophic SuperHyperNeighbor- 6308
hood and a Neutrosophic Dominating-Edges and the new terms are up. 6309
GNeutrosophic Dominating-Edges ∈ ∪zNeutrosophic Number

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

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |

6312
And with go back to initial structure, 6313
GNeutrosophic Dominating-Edges ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6314
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6315

6316


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

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

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

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

Edges, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6317
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6318
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6319
type-SuperHyperSet called the 6320
“Neutrosophic R-Dominating-Edges” 6321
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6322
Neutrosophic R-Dominating-Edges, 6323
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-Dominating-Edges amid those obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic Dominating-Edges, 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-Dominating-Edges. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a Neutrosophic R-Dominating-Edges is the cardinality of
6324
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6325
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Dominating-Edges if 6326

for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6327
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6328
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6329
them. 6330
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6331
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6332

r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6333
Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6334
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6335
SuperHyperVertices. Consider there’s a Neutrosophic R-Dominating-Edges with the least cardin- 6336
ality, the lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected 6337
Neutrosophic SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the 6338
Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the 6339
Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6340
some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Dominating-Edges. 6341
Since it doesn’t have 6342
6343
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6344

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6345
some SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic 6346
SuperHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutro- 6347
sophic SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic 6348
R-Dominating-Edges. Since it doesn’t do the Neutrosophic procedure such that such that there’s 6349
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely 6350

[there are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in 6351
the connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyper- 6352
Vertex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6353
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6354
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Su- 6355
perHyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus 6356
the obvious Neutrosophic R-Dominating-Edges, VESHE is up. The obvious simple Neutrosophic 6357
type-SuperHyperSet of the Neutrosophic R-Dominating-Edges, VESHE , is a Neutrosophic SuperHy- 6358
perSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6359
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6360
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6361
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6362
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6363

a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6364
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6365
R-Dominating-Edges only contains all interior Neutrosophic SuperHyperVertices and all exterior 6366
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6367
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6368
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6369

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6370
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6371
The SuperHyperNotion, namely, Dominating-Edges, is up. There’s neither empty SuperHyperEdge 6372
nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic Su- 6373
perHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6374
Neutrosophic Dominating-Edges. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6375


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

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


= az s + bz t .
Is an Neutrosophic Dominating-Edges C(ESHG) for an Neutrosophic SuperHyperGraph 6379

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

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6385
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6386
Neutrosophic Dominating-Edges is up. The obvious simple Neutrosophic type-SuperHyperSet 6387
called the Neutrosophic Dominating-Edges is a Neutrosophic SuperHyperSet includes only two 6388
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6389
SuperHyperEdges[SuperHyperVertices], 6390

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- 6391
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6392
Dominating-Edges is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6393
SuperHyperEdges[SuperHyperVertices], 6394

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 6395

Dominating-Edges. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6396

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

(V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that 6399
there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices given 6400
by that Neutrosophic type-SuperHyperSet called the Neutrosophic Dominating-Edges and it’s an 6401
Neutrosophic Dominating-Edges. Since it’s 6402

6403
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6405
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6406
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6407
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6408

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

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 Dominating-Edges , 6410

not: 6411

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

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- 6413
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6414
Neutrosophic type-SuperHyperSet called the 6415
“Neutrosophic Dominating-Edges ” 6416
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6417
Neutrosophic Dominating-Edges , 6418
is only and only 6419

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

CHAPTER 31 6421
The Neutrosophic Departures on The 6422
Theoretical Results Toward Theoretical 6423
Motivations 6424
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6425
Neutrosophic SuperHyperClasses. 6426
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6427

= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .
X |V ∈V
Proof. Let 6428
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6429
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
319
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6430

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6434
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6435
SuperHyperModel (31.1), is the SuperHyperDominating-Edges. 6436
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6437

= {Ei+3 ∈ EN SHG }.
X
= z |Ei+3 ∈EN SHG | .


X |V ∈V
Proof. Let 6438
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6439
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). 6440

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6444
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6445
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDominating-Edges. 6446
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6447

= {Ei ∈ EN SHG }.
X
= {CEN T ER}.
= z |CEN T ER| .

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

Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.7) 136NSHG19a
Proof. Let 6448
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6449
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6450


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

Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6454
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6455
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6456
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6457
the Neutrosophic SuperHyperDominating-Edges. 6458
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6459
Then 6460

= {Ei ∈ EVa }.
X
= {Va }.
= z |Va | .
Proof. Let 6461
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6462
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). 6463

Then there’s no at least one SuperHyperDominating-Edges. Thus the notion of quasi may be up but 6467
the SuperHyperNotions based on SuperHyperDominating-Edges could be applied. There are only 6468
two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 6469
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperDominating-Edges taken from a connected Neutrosophic SuperHyperBipartite 6471
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6472
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6475
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6476
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6477
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6478
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6479

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperDominating-Edges in the Example (42.0.11) 136NSHG21a
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6481
Then 6482

= {Ei ∈ EVa }.
X
= {Va }.
= z |Va | .
Proof. Let 6483
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

6484
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperDominating-Edges taken from a connected Neutrosophic SuperHyperMulti- 6485

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

Then there’s no at least one SuperHyperDominating-Edges. Thus the notion of quasi may be up 6489
but the SuperHyperNotions based on SuperHyperDominating-Edges could be applied. There are 6490
only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6491
the representative in the 6492
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6493
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6494
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6498
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6499
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6500
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6501
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDominating-Edges. 6502
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6503
Then, 6504

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

= {Ei ∈ EN SHG }.
X
= {CEN T ER}.
= z |CEN T ER| .
Proof. Let 6505
P :
CEN T ER, E2∗
6506
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperDominating-Edges taken from a connected Neutrosophic SuperHyperWheel 6507

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperDominating-Edges in the Neutrosophic Example (42.0.15) 136NSHG23a

Then there’s at least one SuperHyperDominating-Edges. Thus the notion of quasi isn’t up and the 6511
SuperHyperNotions based on SuperHyperDominating-Edges could be applied. The unique embedded 6512
SuperHyperDominating-Edges proposes some longest SuperHyperDominating-Edges excerpt from some 6513
representatives. The latter is straightforward. 6514
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6515
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6516
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6517

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6518
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDominating-Edges. 6519

CHAPTER 32 6520
The Surveys of Mathematical Sets On 6521
The Results But As The Initial Motivation 6522
For the SuperHyperDominating-Edges, Neutrosophic SuperHyperDominating-Edges, and the Neutro- 6523

sophic SuperHyperDominating-Edges, some general results are introduced. 6524
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperDominating-Edges is “redefined” on 6525
the positions of the alphabets. 6526
Corollary 32.0.2. Assume Neutrosophic SuperHyperDominating-Edges. Then 6527
N eutrosophic SuperHyperDominating − Edges =

{theSuperHyperDominating − Edgesof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperDominating − Edges
|N eutrosophiccardinalityamidthoseSuperHyperDominating−Edges. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6528
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6529
the neutrality, for i = 1, 2, 3, respectively. 6530
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6531
alphabet. Then the notion of Neutrosophic SuperHyperDominating-Edges and SuperHyperDominating- 6532
Edges coincide. 6533
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6534
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6535
SuperHyperDominating-Edges if and only if it’s a SuperHyperDominating-Edges. 6536
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6537
of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 6538
SuperHyperDominating-Edges if and only if it’s a longest SuperHyperDominating-Edges. 6539
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 6540
same identical letter of the alphabet. Then its Neutrosophic SuperHyperDominating-Edges is its 6541
329
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperDominating-Edges, Supe- 6543

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6544
identical letter of the alphabet. Then its Neutrosophic SuperHyperDominating-Edges is its 6545
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6547
SuperHyperDominating-Edges isn’t well-defined if and only if its SuperHyperDominating-Edges isn’t 6548

well-defined. 6549
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6550

Neutrosophic SuperHyperDominating-Edges isn’t well-defined if and only if its SuperHyperDominating- 6551
Edges isn’t well-defined. 6552
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperDominating-Edges, Super- 6553
HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neut- 6554

rosophic SuperHyperDominating-Edges isn’t well-defined if and only if its SuperHyperDominating-Edges 6555
isn’t well-defined. 6556
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6557

SuperHyperDominating-Edges is well-defined if and only if its SuperHyperDominating-Edges is well-defined. 6558
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6559

Neutrosophic SuperHyperDominating-Edges is well-defined if and only if its SuperHyperDominating-Edges 6560
is well-defined. 6561
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperDominating-Edges, Su- 6562

perHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6563
Neutrosophic SuperHyperDominating-Edges is well-defined if and only if its SuperHyperDominating-Edges 6564

is well-defined. 6565
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6566
(i) : the dual SuperHyperDefensive SuperHyperDominating-Edges; 6567
(ii) : the strong dual SuperHyperDefensive SuperHyperDominating-Edges; 6568
(iii) : the connected dual SuperHyperDefensive SuperHyperDominating-Edges; 6569
(iv) : the δ-dual SuperHyperDefensive SuperHyperDominating-Edges; 6570
(v) : the strong δ-dual SuperHyperDefensive SuperHyperDominating-Edges; 6571
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperDominating-Edges. 6572
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6573
(iii) : the connected defensive SuperHyperDefensive SuperHyperDominating-Edges; 6576

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

independent SuperHyperSet is 6581
(iii) : the connected SuperHyperDefensive SuperHyperDominating-Edges; 6584
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6588

Graph which is a SuperHyperDominating-Edges/SuperHyperPath. Then V is a maximal 6589
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperDominating-Edges; 6593
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperDominating-Edges; 6594
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperDominating-Edges; 6595
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6597
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6598
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperDominating-Edges; 6602
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperDominating-Edges; 6603
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperDominating-Edges; 6604
Graph which is a SuperHyperDominating-Edges/SuperHyperPath. Then the number of 6607

(i) : the SuperHyperDominating-Edges; 6608
(ii) : the SuperHyperDominating-Edges; 6609
(iii) : the connected SuperHyperDominating-Edges; 6610
(iv) : the O(ESHG)-SuperHyperDominating-Edges; 6611
(v) : the strong O(ESHG)-SuperHyperDominating-Edges; 6612
(vi) : the connected O(ESHG)-SuperHyperDominating-Edges. 6613
coincide. 6615

Graph which is a SuperHyperWheel. Then the number of 6617
(i) : the dual SuperHyperDominating-Edges; 6618
(ii) : the dual SuperHyperDominating-Edges; 6619
(iii) : the dual connected SuperHyperDominating-Edges; 6620
(iv) : the dual O(ESHG)-SuperHyperDominating-Edges; 6621
(v) : the strong dual O(ESHG)-SuperHyperDominating-Edges; 6622
(vi) : the connected dual O(ESHG)-SuperHyperDominating-Edges. 6623
coincide. 6625
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6626

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6638
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6639
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6640
SuperHyperPart is a 6641
(iv) : δ-SuperHyperDefensive SuperHyperDominating-Edges; 6645
(v) : strong δ-SuperHyperDefensive SuperHyperDominating-Edges; 6646
(vi) : connected δ-SuperHyperDefensive SuperHyperDominating-Edges. 6647
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6649

plete SuperHyperMultipartite. Then Then the number of 6650
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6657
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6658
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6660
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6661
(iv) : SuperHyperDominating-Edges; 6665

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6668
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6669
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6670
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6671

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6679
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6680
of dual 6681
(iv) : 0-SuperHyperDefensive SuperHyperDominating-Edges; 6685

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6689

SuperHyperDominating-Edges/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 6691
and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6692
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating-Edges; 6696
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating-Edges; 6697
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperDominating-Edges. 6698


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


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

a dual SuperHyperDefensive SuperHyperDominating-Edges, then ∀v ∈ V \ S, ∃x ∈ S such that 6714
(i) v ∈ Ns (x); 6715
(ii) vx ∈ E. 6716
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6717

a dual SuperHyperDefensive SuperHyperDominating-Edges, then 6718
(i) S is SuperHyperDominating-Edges set; 6719
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6720
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6721
(i) Γ ≤ O; 6722
(ii) Γs ≤ On . 6723
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6724
connected. Then 6725
(i) Γ ≤ O − 1; 6726
(ii) Γs ≤ On − Σ3i=1 σi (x). 6727
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6728

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6732
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6733
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6735
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperDominating-Edges; 6736
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6737
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6738
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6739
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperDominating-Edges. Then 6741
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperDominating- 6742

Edges; 6743
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6744
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6745
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6746
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperDominating-Edges. Then 6748

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6752
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6753
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6755
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperDominating-Edges; 6756
(ii) Γ = 1; 6757
(iii) Γs = Σ3i=1 σi (c); 6758
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperDominating-Edges. 6759
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6760

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6761
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6763
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6764
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6765
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6767
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperDominating-Edges; 6768
(ii) Γ = b n2 c + 1; 6769

b n c+1 ; 6770
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperDominating- 6771
Edges. 6772
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6773
bnc
2
is a dual SuperHyperDefensive SuperHyperDominating-Edges; 6774
(ii) Γ = b n2 c; 6775

bnc ; 6776
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive 6777
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6779

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

Edges for N SHF; 6782
(ii) Γ = m for N SHF : (V, E); 6783
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6784
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperDominating- 6785
Edges for N SHF : (V, E). 6786
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6787

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6788
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6789
SuperHyperDominating-Edges for N SHF; 6790

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

b n c+1 for N SHF : (V, E); 6792
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperDominating-Edges for 6793
N SHF : (V, E). 6794
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6795

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6796
bnc
2
is a dual SuperHyperDefensive SuperHyperDominating-Edges 6797
for N SHF : (V, E); 6798
(ii) Γ = b n2 c for N SHF : (V, E); 6799

bnc for N SHF : (V, E); 6800
S={vi }i=1
bnc
2
are only dual maximal SuperHyperDominating-Edges for 6801
N SHF : (V, E). 6802
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6805

SuperHyperDominating-Edges, then S is an s-SuperHyperDefensive SuperHyperDominating-Edges; 6806

SuperHyperDominating-Edges, then S is a dual s-SuperHyperDefensive SuperHyperDominating- 6808
Edges. 6809
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6812

SuperHyperDominating-Edges, then S is an s-SuperHyperPowerful SuperHyperDominating-Edges; 6813

SuperHyperDominating-Edges, then S is a dual s-SuperHyperPowerful SuperHyperDominating-Edges. 6815
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6816

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

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

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

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

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


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

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


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

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

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

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

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

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


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

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

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

CHAPTER 33 6876
Neutrosophic Applications in Cancer’s 6877
Neutrosophic Recognition 6878
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6879
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6880
disease is considered and as the consequences of the model, some parameters are used. The cells 6881
are under attack of this disease but the moves of the cancer in the special region are the matter 6882
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6883
treatments for this Neutrosophic disease. 6884
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6885
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6886
term Neutrosophic function. 6887
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6888
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6889
move from the cancer is identified by this research. Sometimes the move of the cancer 6890
about the moves and the effects of the cancer on that region; this event leads us to 6892
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6893
perception on what’s happened and what’s done. 6894
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6895
known and they’ve got the names, and some general Neutrosophic models. The 6896
moves and the Neutrosophic traces of the cancer on the complex tracks and between 6897
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 6898
/SuperHyperDominating-Edges, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipart- 6899
ite, SuperHyperWheel). The aim is to find either the Neutrosophic SuperHyperDominating- 6900
Edges or the Neutrosophic SuperHyperDominating-Edges in those Neutrosophic Neutrosophic 6901
SuperHyperModels. 6902
341
CHAPTER 34 6903
Case 1: The Initial Neutrosophic Steps 6904
Toward Neutrosophic 6905
SuperHyperBipartite as Neutrosophic 6906
SuperHyperModel 6907
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6908
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6909
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

343
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6910
perBipartite is obtained. 6911
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6912
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6913
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6914
(34.1), is the Neutrosophic SuperHyperDominating-Edges. 6915

CHAPTER 35 6916
Case 2: The Increasing Neutrosophic 6917
Steps Toward Neutrosophic 6918
SuperHyperMultipartite as 6919
Neutrosophic SuperHyperModel 6920
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6921
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6922
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6923
perMultipartite is obtained. 6924
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6925
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6927
Neutrosophic SuperHyperDominating-Edges. 6928

CHAPTER 36 6929
Wondering Open Problems But As The 6930
Directions To Forming The Motivations 6931
In what follows, some “problems” and some “questions” are proposed. 6932
The SuperHyperDominating-Edges and the Neutrosophic SuperHyperDominating-Edges are defined on a 6933
real-world application, titled “Cancer’s Recognitions”. 6934
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6935
recognitions? 6936
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperDominating-Edges and 6937
the Neutrosophic SuperHyperDominating-Edges? 6938
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6939
them? 6940
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperDominating- 6941
and the Neutrosophic SuperHyperDominating-Edges?
Edges 6942
Problem 36.0.5. The SuperHyperDominating-Edges and the Neutrosophic SuperHyperDominating-Edges 6943

do a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperDominating- 6944
Edges, are there else? 6945
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6946
Numbers types-results? 6947
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6948
the multiple types of SuperHyperNotions? 6949
347
CHAPTER 37 6950
Conclusion and Closing Remarks 6951
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6952
research are illustrated. Some benefits and some advantages of this research are highlighted. 6953
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6954
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperDominating-Edges. 6955
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 6956
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6957
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperDominating-Edges, finds 6958
the convenient background to implement some results based on that. Some SuperHyperClasses 6959
and some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 6960
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 6961
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 6962
SuperHyperDominating-Edges, the new SuperHyperClasses and SuperHyperClasses, are introduced. 6963
Some general results are gathered in the section on the SuperHyperDominating-Edges and the Neutro- 6964
sophic SuperHyperDominating-Edges. The clarifications, instances and literature reviews have taken 6965
the whole way through. In this research, the literature reviews have fulfilled the lines containing 6966
the notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 6967
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 6968
based on the connectivities of the moves of the cancer in the longest and strongest styles with 6971
the formation of the design and the architecture are formally called “ SuperHyperDominating-Edges” 6972
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 6974
benefits and avenues for this research are, figured out, pointed out and spoken out. 6975
349
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperDominating-Edges
3. Neutrosophic SuperHyperDominating-Edges 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6976
Neutrosophic SuperHyperDuality But As 6977
Super Forms 6979
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6980

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

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

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

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

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6991
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6992

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6993
sophic rv-SuperHyperDuality. 6994
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6995

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7000
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7001
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7002
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7003
351
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7005

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7007
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7008
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7009
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7010
form the Neutrosophic SuperHyperDuality; 7011
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7012
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7013

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7014
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7015
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7016
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7017
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7019
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7021

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7023
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7024
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7025
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7026
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 7027
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7028
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7029
coefficient; 7030
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7031

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7033
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7034
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7035
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7036
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7038

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7039
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7040
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7041
that they form the Neutrosophic SuperHyperDuality; 7044
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7045

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7046
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7047

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7049
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7052
power is corresponded to its Extreme coefficient; 7053
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7054

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7056

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7059
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7062
coefficient. 7063
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7064
the mentioned Neutrosophic Figures in every Neutrosophic items. 7065

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7067
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7068
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7069
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7070
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7071
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7072
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7073
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 7077
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7078
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7079
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7080
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7081

every given Neutrosophic SuperHyperDuality. 7082




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 7126
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Neutrosophic Cardinality , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality .
3 3


SuperHyperModel (31.1), is the SuperHyperDuality. 7133
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 7135
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7142
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 7144


the Neutrosophic SuperHyperDuality. 7153
Then 7155
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 7156
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7162
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7165

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7175

(V, E). Then 7176

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 7177
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7178


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

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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7195
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7196
Then, 7197
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 7198
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 7199


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7204
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7205
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7211

CHAPTER 39 7212
Neutrosophic SuperHyperJoin But As 7213
Super Forms 7215
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7216

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7220
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7222

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

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7227

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7228
|Vj |NEUTROSOPHIC CARDINALITY ; 7229
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7230

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7231
rv-SuperHyperJoin. 7232
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7233

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

365

Extreme SuperHyperJoin; 7242
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7243

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7245
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7246
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7247
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7248
Neutrosophic SuperHyperJoin; 7249
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7250

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7251
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7252
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7257
coefficient; 7258
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7259

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7260
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7261
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7262
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7263
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7264
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7265

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7266
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7267
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7268

Extreme SuperHyperJoin; 7274
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7275

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7277
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7278
Neutrosophic SuperHyperJoin; 7281

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7282

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7284

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7289
its Extreme coefficient; 7290
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7291

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7293
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7294

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7295
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7296
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7299
coefficient. 7300
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7304

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7305

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7370

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7379
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 7381


the Neutrosophic SuperHyperJoin. 7390
Then 7392
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 7393
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 7399
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7401

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


(V, E). Then 7412

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7414


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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperJoin. 7430

Then, 7432

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

.
Proof. Let 7433
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7434


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7438
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7439
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7440
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7445

CHAPTER 40 7446
Neutrosophic SuperHyperPerfect But As 7447
Super Forms 7449
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7450

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7461
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7462

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7463
rv-SuperHyperPerfect. 7464
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7465

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7470
379
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7475

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7477
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7478
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7479
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7480
form the Neutrosophic SuperHyperPerfect; 7481
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7482

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7483
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7484
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7487
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7491

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7493
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7496
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7499
coefficient; 7500
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7501

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7509
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7510
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7511
that they form the Neutrosophic SuperHyperPerfect; 7514
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7515

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7517

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7520
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7524

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7526
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7529

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7532
coefficient. 7533

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

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7603
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 7605
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7623
Then 7625
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 7626
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 7630
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7631
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7632
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7635

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

(V, E). Then 7646

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



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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperPerfect. 7665
Then, 7667
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7669


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7672
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7673
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7674
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7675
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7681

CHAPTER 41 7682
Neutrosophic SuperHyperTotal But As 7683
Super Forms 7685
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7686

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7690

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7693
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7694

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7697
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7698

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7699
rv-SuperHyperTotal. 7700
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7701

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7706
Extreme SuperHyperTotal; 7710
393
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7711

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7713
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7714
Neutrosophic SuperHyperTotal; 7717
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7718
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7719

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7720
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7725
coefficient; 7726
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7727
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7728

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7729
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7730
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7731
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7732
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7733
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7734
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7735
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7736

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

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7745
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7746
Neutrosophic SuperHyperTotal; 7749
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7750

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

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7757
its Extreme coefficient; 7758
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7759
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7760

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7761
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7762
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7763
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7764
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7765
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7766
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7767

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

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7837
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 7839
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Neutrosophic Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperTotal. 7846
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 7848


the Neutrosophic SuperHyperTotal. 7857
Then 7859
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 7860
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7866
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7868

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7879

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7881


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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperTotal. 7897
Then, 7899
∗
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 7900
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7901


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7905
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7906
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7907
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7913

CHAPTER 42 7914
Neutrosophic SuperHyperConnected But 7915
As The Extensions Excerpt From Dense 7916
And Super Forms 7917
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7918

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7922
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7923
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7924

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7925
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7926
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7927

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

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7930
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7931
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7932
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7933
rosophic rv-SuperHyperConnected. 7934
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7935

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

7938
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7939
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7940
407
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 7942
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 7943
form the Extreme SuperHyperConnected; 7944
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7945

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7946
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7947

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7951
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7952
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7953

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7954
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7955
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7961

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7962
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7963
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7964
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7966
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 7967

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7968
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 7969
Neutrosophic coefficient; 7970
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7971

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7973
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7977
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7978

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 7980
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 7981
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 7982
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7984

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7985

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7988
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 7989

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7994

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7997
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7999
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8000

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8001
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8002
Neutrosophic coefficient. 8003
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8006
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8007
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8009
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8010

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8011
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8012
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8013
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. 8021


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 8065
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

SuperHyperModel (31.1), is the SuperHyperConnected. 8072
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 8074
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperConnected. 8081
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 8083



the Neutrosophic SuperHyperConnected. 8092
Then 8094
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 8095
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 8100
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8101
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8104

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8115
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 8116
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8117


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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperConnected. 8134
Then, 8136
∗
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 8137
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8138


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8141
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8142
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8143
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8144
some representatives. The latter is straightforward. 8145
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8150

CHAPTER 43 8151
Background 8152

421









HG262; HG263; HG264; HG265], there are some endeavors to formalize the basic Super- 8294
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 8295



See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the no- 8324
tions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in Super- 8325
HyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; 8326
HG259; HG260; HG261; HG262; HG263; HG264; HG265] alongside scientific re- 8345
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 8346


Bibliography 8361
10.33140/JMTCM.01.03.09) 8365


427
10.20944/preprints202301.0282.v1). 8398
10.20944/preprints202301.0267.v1). 8401

(doi: 10.20944/preprints202301.0265.v1). 8406
prints202301.0262.v1). 8410
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8416
prints202301.0105.v1). 8419
Preprints 2023, 2023010044 8425
10.20944/preprints202301.0043.v1). 8428

(doi: 10.20944/preprints202212.0549.v1). 8437
(doi: 10.20944/preprints202212.0500.v1). 8444
odo.7916595). 8453
odo.7923632). 8456

(doi: 10.5281/zenodo.7904698). 8459
2023, (doi: 10.5281/zenodo.7904671). 8462

10.5281/zenodo.7871026). 8471
2023, (doi: 10.5281/zenodo.7874647). 8474
10.5281/zenodo.7857856). 8477
2023, (doi: 10.5281/zenodo.7857841). 8480
10.5281/zenodo.7853867). 8489
10.5281/zenodo.7853922). 8492
(doi: 10.5281/zenodo.7851519). 8495
(doi: 10.5281/zenodo.7851550). 8498
10.5281/zenodo.7834229). 8507

10.5281/zenodo.7834261). 8510
10.5281/zenodo.7824560). 8513
(doi: 10.5281/zenodo.7824623). 8516
2023, (doi: 10.5281/zenodo.7809365). 8527
2023, (doi: 10.5281/zenodo.7809358). 8530
10.5281/zenodo.7809219). 8533
10.5281/zenodo.7809328). 8536
2023, (doi: 10.5281/zenodo.7806767). 8539
2023, (doi: 10.5281/zenodo.7806838). 8542

10.5281/zenodo.7799902). 8551
(doi: 10.5281/zenodo.7804218). 8554
(doi: 10.5281/zenodo.7796334). 8557
10.5281/zenodo.7791952). 8563
10.5281/zenodo.7791982). 8566
10.5281/zenodo.7790026). 8569
10.5281/zenodo.7790052). 8572
2023, (doi: 10.5281/zenodo.7787066). 8575
10.5281/zenodo.7781476). 8581
10.5281/zenodo.7783082). 8584

10.5281/zenodo.7777857). 8587
10.5281/zenodo.7779286). 8590
(doi: 10.5281/zenodo.7771831). 8593
2023, (doi: 10.5281/zenodo.7772468). 8596
10.13140/RG.2.2.20913.25446). 8599
odo.7764916). 8602
10.13140/RG.2.2.11770.98247). 8605
10.13140/RG.2.2.12400.12808). 8608
2023, (doi: 10.13140/RG.2.2.22545.10089). 8611
10.13140/RG.2.2.11377.76644). 8617
10.13140/RG.2.2.23750.96329). 8620
10.13140/RG.2.2.31366.24641). 8623

10.13140/RG.2.2.34721.68960). 8626
2023, (doi: 10.13140/RG.2.2.30212.81289). 8629
10.13140/RG.2.2.24288.35842). 8635
10.13140/RG.2.2.32467.25124). 8638
10.13140/RG.2.2.31025.45925). 8641
10.13140/RG.2.2.17184.25602). 8644
10.13140/RG.2.2.23423.28327). 8647
10.13140/RG.2.2.28456.44805). 8650
10.13140/RG.2.2.23525.68320). 8653
10.13140/RG.2.2.20170.24000). 8656
10.13140/RG.2.2.36475.59683). 8659
10.13140/RG.2.2.29764.71046). 8662

2023, (doi: 10.13140/RG.2.2.18780.87683). 8665
10.13140/RG.2.2.26134.01603). 8671
10.13140/RG.2.2.27392.30721). 8674
10.13140/RG.2.2.33028.40321). 8677
10.13140/RG.2.2.21389.20966). 8680
10.13140/RG.2.2.16356.04489). 8683
10.13140/RG.2.2.21756.21129). 8686
10.13140/RG.2.2.30983.68009). 8689
10.13140/RG.2.2.28552.29445). 8692
(doi: 10.13140/RG.2.2.10936.21761). 8695
10.13140/RG.2.2.35105.89447). 8698
(doi: 10.13140/RG.2.2.30072.72960). 8701

10.13140/RG.2.2.31147.52003). 8704
10.13140/RG.2.2.32825.24163). 8707
10.13140/RG.2.2.13059.58401). 8710
10.13140/RG.2.2.11172.14720). 8713
2023, (doi: 10.13140/RG.2.2.22011.80165). 8716
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8719
2023, (doi: 10.13140/RG.2.2.10493.84962). 8722
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8725
2023, (doi: 10.13140/RG.2.2.19944.14086). 8728
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8731
(doi: 10.13140/RG.2.2.33103.76968). 8734
(doi: 10.13140/RG.2.2.23037.44003). 8737
(doi: 10.13140/RG.2.2.35646.56641). 8740

10.13140/RG.2.2.18030.48967). 8743
(doi: 10.13140/RG.2.2.13973.81121). 8746
2023, (doi: 10.13140/RG.2.2.34106.47047). 8749
2023, (doi: 10.13140/RG.2.2.31956.88961). 8755
2023, (doi: 10.13140/RG.2.2.15179.67361). 8758
10.13140/RG.2.2.21510.45125). 8761
2023, (doi: 10.13140/RG.2.2.13121.84321). 8764
10.13140/RG.2.2.11758.69441). 8767
2023, (doi: 10.13140/RG.2.2.31891.35367). 8770
10.13140/RG.2.2.19360.87048). 8773
10.13140/RG.2.2.32363.21286). 8776
10.13140/RG.2.2.23266.81602). 8779

10.13140/RG.2.2.19911.37285). 8782
10.13140/RG.2.2.11050.90569). 8785
2023, (doi: 10.13140/RG.2.2.17761.79206). 8788
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8794
(doi: 10.13140/RG.2.2.30182.50241). 8797

2023, (doi: 10.13140/RG.2.2.17252.24968). 8830

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8839
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8842


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


10.20944/preprints202301.0282.v1). 8863

10.20944/preprints202301.0267.v1).). 8866

(doi: 10.20944/preprints202301.0265.v1). 8871
prints202301.0262.v1). 8875

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

10.13140/RG.2.2.35061.65767). 8884
10.13140/RG.2.2.18494.15680). 8888
10.13140/RG.2.2.32530.73922). 8892
10.13140/RG.2.2.15897.70243). 8896

10.13140/RG.2.2.32530.73922). 8900
prints202301.0105.v1). 8903
10.13140/RG.2.2.23172.19849). 8910

10.13140/RG.2.2.17385.36968). 8920
Preprints 2023, 2023010044 8923

10.20944/preprints202301.0043.v1). 8926

2023, (doi: 10.13140/RG.2.2.28945.92007). 8929
10.13140/RG.2.2.35774.77123). 8935


10.13140/RG.2.2.29430.88642). 8941
(doi: 10.20944/preprints202212.0549.v1). 8947
10.13140/RG.2.2.19380.94084). 8950


(doi: 10.20944/preprints202212.0500.v1). 8961
10.13140/RG.2.2.20993.12640). 8964




10.13140/RG.2.2.29173.86244). 8979
10.5281/zenodo.7923786). 8984
2023 (doi: 10.5281/zenodo.7905287). 8986

2023 (doi: 10.5281/zenodo.7874677). 8990
(doi: 10.5281/zenodo.7857906). 8992
2023 (doi: 10.5281/zenodo.7856329). 8994
10.5281/zenodo.7854561). 8996
2023 (doi: 10.5281/zenodo.7851893). 8998

(doi: 10.5281/zenodo.7835063). 9002
(doi: 10.5281/zenodo.7826705). 9004
2023 (doi: 10.5281/zenodo.7820680). 9006
10.5281/zenodo.7812750). 9008



2023 (doi: 10.5281/zenodo.7807782). 9014
2023 (doi: 10.5281/zenodo.7804449). 9016

(doi: 10.5281/zenodo.7792307). 9020
(doi: 10.5281/zenodo.7790728). 9022
2023 (doi: 10.5281/zenodo.7787712). 9024
10.5281/zenodo.7783791). 9026
10.5281/zenodo.7780123). 9028
(doi: 10.5281/zenodo.7773119). 9030
odo.7637762). 9032
10.5281/zenodo.7766174). 9034
10.5281/zenodo.7762232). 9036
(doi: 10.5281/zenodo.7758601). 9038
10.5281/zenodo.7754661). 9040
10.5281/zenodo.7750995) . 9042
(doi: 10.5281/zenodo.7749875). 9044

10.5281/zenodo.7747236). 9046
10.5281/zenodo.7742587). 9048
(doi: 10.5281/zenodo.7738635). 9050
10.5281/zenodo.7734719). 9052
10.5281/zenodo.7730484). 9054
(doi: 10.5281/zenodo.7730469). 9056
10.5281/zenodo.7722865). 9058
odo.7713563). 9060
odo.7709116). 9062
10.5281/zenodo.7706415). 9064
10.5281/zenodo.7706063). 9066
10.5281/zenodo.7701906). 9068
odo.7700205). 9070
10.5281/zenodo.7694876). 9072
10.5281/zenodo.7679410). 9074
10.5281/zenodo.7675982). 9076
10.5281/zenodo.7672388). 9078
odo.7668648). 9080

10.5281/zenodo.7662810). 9082
10.5281/zenodo.7659162). 9084
odo.7653233). 9086
odo.7653204). 9088
odo.7653142). 9090
odo.7653117). 9092
odo.7651687). 9095
odo.7651619). 9097
odo.7651439). 9099
odo.7650729). 9101
odo.7647868). 9103
odo.7647017). 9105
odo.7644894). 9107
odo.7632923). 9110
odo.7623459). 9112
10.5281/zenodo.7606416). 9114

10.5281/zenodo.7606416). 9116
odo.7606404). 9118
10.5281/zenodo.7580018). 9120
odo.7580018). 9122
odo.7580018). 9124
odo.7579929). 9126
10.5281/zenodo.7563170). 9128
odo.7563164). 9130
odo.7563160). 9132
odo.7563160). 9134
10.5281/zenodo.7563160). 9136
10.5281/zenodo.7557063). 9138
10.5281/zenodo.7557009). 9140
10.5281/zenodo.7539484). 9142
10.5281/zenodo.7523390). 9144
10.5281/zenodo.7523390). 9146
10.5281/zenodo.7523390). 9148
odo.7574952). 9150

10.5281/zenodo.7574992). 9152
odo.7523357). 9154
10.5281/zenodo.7523357). 9156
10.5281/zenodo.7504782). 9158
10.5281/zenodo.7504782). 9160
10.5281/zenodo.7504782). 9162
10.5281/zenodo.7499395). 9164
odo.7499395). 9166
10.5281/zenodo.7499395). 9168
10.5281/zenodo.7497450). 9170
10.5281/zenodo.7497450). 9172
10.5281/zenodo.7494862). 9174
odo.7494862). 9176
10.5281/zenodo.7494862). 9178
10.5281/zenodo.7493845). 9180
odo.7493845). 9182
10.5281/zenodo.7493845). 9184
odo.7539484). 9186

odo.7523390). 9188
odo.7523357). 9190
odo.7504782). 9192
odo.7499395). 9194
odo.7497450). 9196
odo.7494862). 9198
odo.7493845). 9200
odo.7480110). 9202
odo.7378758). 9204
odo.6320305). 9206
odo.6677173). 9208

CHAPTER 44 9209
Books’ Contributions 9210
“Books’ Contributions”: | Featured Threads 9211

The following references are cited by chapters. 9212
9213
[Ref266] 9214
Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges In 9215
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 9216
odo.7943578). 9217
9218
[Ref267] 9219
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9220
By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 10.5281/zen- 9221
odo.7940830). 9222
9223
The links to the contributions of this scientific research book are listed below. 9224
[HG266] 9225
odo.7943578). 9228
9229
[TITLE] “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges In Cancer’s 9230
Recognition With (Neutrosophic) SuperHyperGraph” 9231

9232
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9233
https://www.researchgate.net/publication/370817003 9234
9235
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9236
https://www.scribd.com/document/645992061 9237
9238
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9239
https://zenodo.org/record/7943578 9240
9241
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9242
https://www.academia.edu/101899997 9243
451
Figure 44.1: Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-
Edges In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7943578).
9244
[ADDRESSED CITATION] 9245
odo.7943578). 9248
[ASSIGNED NUMBER] #266 Article 9249
[DATE] May 2023 9250

[DOI] 10.5281/zenodo.7943578 9251
[LICENSE] CC BY-NC-ND 4.0 9252
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9253
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9254
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9255
9256
[HG267] 9257
odo.7940830). 9260
9261
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9262

Dominating-Edges As Hyper Dome On Super Eddy” 9263
9264
https://www.researchgate.net/publication/370779902 9266
9267
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9268

10.5281/zenodo.7943578).
10.5281/zenodo.7943578).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023,
(doi: 10.5281/zenodo.7940830).
https://www.scribd.com/document/645848012 9269
9270
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9271
9273
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9274
https://www.academia.edu/101859078 9275
9276
odo.7940830). 9280
[ASSIGNED NUMBER] #267 Article 9281
[DATE] May 2023 9282
[DOI] 10.5281/zenodo.7940830 9283
[LICENSE] CC BY-NC-ND 4.0 9284

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9285
[AVAILABLE AT TWITTER’S IDS] 9286
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9287
googlebooks GooglePlay 9288
9289
[ASSIGNED NUMBER] | Book #172 9290

HG172b
Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9292
10.5281/zenodo.7943871). 9293

(doi: 10.5281/zenodo.7940830).
(doi: 10.5281/zenodo.7940830).

[TITLE] Dominating-Edges In SuperHyperGraphs 9294

#Latest_Updates 9295
#The_Links 9296
9300
9302
#The_Links 9303
9304
[ASSIGNED NUMBER] | Book #172 9305

9306
[TITLE] Dominating-Edges In SuperHyperGraphs 9307
9308
9312
– 9313
9314
[PUBLISHER] 9315
(Paperback): https://www.amazon.com/dp/- 9316
(Hardcover): https://www.amazon.com/dp/- 9317

(Kindle Edition): https://www.amazon.com/dp/- 9318
9319
– 9320
9321
[ISBN] 9322
(Paperback): - 9323
(Hardcover): - 9324
(Kindle Edition): CC BY-NC-ND 4.0 9325
(EBook): CC BY-NC-ND 4.0 9326
9327
– 9328
9329
[PRINT LENGTH] 9330
(Paperback): - pages 9331
(Hardcover): - pages 9332
(Kindle Edition): - pages 9333
(E-Book): - pages 9334
9335
– 9336
9337
9339

#The_Links 9340
9341
https://www.researchgate.net/publication/- 9343
9344
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9345
https://drhenrygarrett.wordpress.com/2023/07/22/ 9346
Dominating-Edges-In-SuperHyperGraphs/ 9347
9348
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9349
https://www.scribd.com/document/- 9350
9351
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9352
https://www.academia.edu/- 9353
9354
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9355
9357
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9358
https://books.google.com/books/about?id=- 9359
9360
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9361
https://play.google.com/store/books/details?id=- 9362

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9363

9364
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9365
9366
https://drhenrygarrett.wordpress.com/2023/07/22/ 9367
Dominating-Edges-In-SuperHyperGraphs/ 9368
9369
– 9370
9371
[POSTED BY] Dr. Henry Garrett 9372
9373
[DATE] May 017, 2023 9374

9375
[POSTED IN] 172 | Dominating-Edges In SuperHyperGraphs 9376
9377
[TAGS] 9378
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9379
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9380
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9381
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9382
neutrosophic SuperHyperGraphs, Neutrosophic Dominating-Edges In SuperHyperGraphs, Open 9383
Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 9384
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 9385
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 9386
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 9387

SuperHyperGraphs, Dominating-Edges In SuperHyperGraphs, SuperHyperModeling, SuperHy- 9388
perVertices, Theoretical Research, Vertex, Vertices. 9389
In this scientific research book, there are some scientific research chapters on “Extreme 9390
Dominating-Edges In SuperHyperGraphs” and “Neutrosophic Dominating-Edges In SuperHy- 9391
perGraphs” about some scientific research on Dominating-Edges In SuperHyperGraphs by two 9392
(Extreme/Neutrosophic) notions, namely, Extreme Dominating-Edges In SuperHyperGraphs 9393

and Neutrosophic Dominating-Edges In SuperHyperGraphs. With scientific research on 9394
the basic scientific research properties, the scientific research book starts to make Extreme 9395
Dominating-Edges In SuperHyperGraphs theory and Neutrosophic Dominating-Edges In 9396
SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9397

HG172b1.png
Figure 44.7: [HG172b] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry

Garrett, 2023 (doi: 10.5281/zenodo.7943871).

HG172b2.png


HG172b3.png


CHAPTER 45 9398
“SuperHyperGraph-Based Books”: | 9399
Featured Tweets 9400
“SuperHyperGraph-Based Books”: | Featured Tweets 9401
463
Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

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

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
























CHAPTER 46 9402
CV 9403
491
9404
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
9405
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)
9406
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

9407

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

9408
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

9409
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

9410
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

9411
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

9412
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).
9413
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

9414
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

9415
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

9416
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

9417
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

9418
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

9419
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

9420
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

9421
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

9422
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

9423
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).
9424
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

9425

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

9426
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

9427

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: -
9428
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

9429
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).
9430
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
9431
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
9432
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
9433
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).
9434
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

9435
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).
9436
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”,

9437
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).
9438
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).
9439
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
9440
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).
9441

(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).
9442
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).
9443
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

9444
[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

9445
[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

9446
[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

9447
[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

9448
[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

9449
[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

9450
[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

9451
[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

9452
[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

9453
[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

9454
[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

9455
[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

9456
[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

9457
[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

9458
[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

9459
[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

9460
[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

9461
[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

9462
[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

9463
[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

9464
[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

9465
[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

9466
[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

9467
[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

9468
[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

9469
[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
9470
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

9471
[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

9472
[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

9473
[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

9474
[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

9475
[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
9476
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

9477
“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

9478
[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
9479
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

9480
[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

9481
[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

9482
[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

9483
[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

9484
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

9485
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
9486
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
9487
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

9488
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

9489
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
-
9490
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

9491
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9492
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
9493
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
9494
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

9495
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
9496
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
...
9497
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/
9498
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
9499
9500
9501
Henry Garrett
01/23/2022
9502
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
9503
View publication stats

Dominating-Edges 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

Dominating-Edges in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · May 2023

475 PUBLICATIONS 17,114 CITATIONS

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

Number Graphs And Numbers View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 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 SuperHyperDominating-Edges 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

24 Cancer In Neutrosophic SuperHyperGraph 247

25 Neutrosophic Dominating-Edges 251

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

Henry Garrett · Independent Researcher · Department of Mathematics ·

30 Neutrosophic SuperHyperDominating-Edges But As The Extensions Excerpt

31 The Neutrosophic Departures on The Theoretical Results Toward

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

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 341

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

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 349

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 451

45 “SuperHyperGraph-Based Books”: | Featured Tweets 463

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

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 464

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.17“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 478

Henry Garrett · Independent Researcher · Department of Mathematics ·

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