Connective Dominating in SuperHyperGraphs

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

DOI: 10.5281/zenodo.8051368
CITATIONS
1 author:
Henry Garrett
489 PUBLICATIONS 19,204 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Featured Articles View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 17 June 2023.
The user has requested enhancement of the downloaded file.

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

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

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

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 217
Bibliography 223
24 Cancer In Neutrosophic SuperHyperGraph 247
25 Neutrosophic Connective Dominating 251
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Connective Dominating As Hyper Conceit On Super Con 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 SuperHyperConnective Dominating But As The Extensions

Excerpt From Dense And Super Forms 277
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 331
33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 343
34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

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

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

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

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

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

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

SuperHyperConnective Dominating 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 SuperHy-

perConnective Dominating 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 SuperHyperConnective Dominating in the Example (42.0.11) . . . . . . . . . . 121
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperConnective Dominating in the Example (42.0.13) . . . . . . . . . . . . . . . . 123
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperConnective Dominating in the Extreme Example (42.0.15) . . . . . 124
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

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

SuperHyperConnective Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperConnective Dominating 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 SuperHyperConnective Dominating in the Neutrosophic Example (42.0.7) . 322
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperConnective Dominating in the Neutrosophic Example (42.0.9) . 323
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperConnective Dominating 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 SuperHyperConnective Dominating in the Neutrosophic Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 329

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG274] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8051360). . . . . . . . . . . . . . . . . . . . . . 454
44.4 [HG275] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Connective Dominating As Hyper Conceit On Super Con”,
44.7 [HG177b] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.8051368). . . . . . . . . . . . . . . . . . 461
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 466

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



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

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (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 . . . . . . . . . . . . . . . . . . 346

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

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

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

Connective Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to 41
make a Connective Dominating In SuperHyperGraphs more understandable. For the sake of 42
having Neutrosophic Connective Dominating In SuperHyperGraphs, there’s a need to “redefine” 43
the notion of a “Connective Dominating In SuperHyperGraphs ”. The SuperHyperVertices 44
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 45
this procedure, there’s the usage of the position of labels to assign to the values. Assume 46
a Connective Dominating In SuperHyperGraphs . It’s redefined a Neutrosophic Connective 47
Dominating In SuperHyperGraphs if the mentioned Table holds, concerning, “The Values of 48
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutro- 49
sophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 50
of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 51
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 52
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 53
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 54
introduce the next SuperHyperClass of SuperHyperGraph based on a Connective Dominating 55
In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the foundation of previous 56
definition in the kind of SuperHyperClass. If there’s a need to have all Connective Dominating 57
In SuperHyperGraphs until the Connective Dominating In SuperHyperGraphs, then it’s officially 58

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

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

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

In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 76
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Connective Dominating 77
In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipart- 78
ite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the 79

intended Table holds. A SuperHyperGraph has a “Neutrosophic Connective Dominating In 80

SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all the 81
Connective Dominating In SuperHyperGraphs amid the maximum value amid all SuperHy- 82
perVertices from a Connective Dominating In SuperHyperGraphs .] Connective Dominating 83
In SuperHyperGraphs . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and 84
the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHy- 85
perGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only 86
one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 87
Connective Dominating In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 88
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 89
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 90
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 91
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 92

intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 93
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 94
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 95
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 96
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 97
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 98

group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 99
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 100
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 101
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 102
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 103
Recognition” and the results and the definitions will be introduced in redeemed ways. The 104
recognition of the cancer in the long-term function. The specific region has been assigned 105
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 106
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 107
since there are some determinacy, indeterminacy and neutrality about the moves and the 108
effects of the cancer on that region; this event leads us to choose another model [it’s said 109
to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 110

and what’s done. There are some specific models, which are well-known and they’ve got the 111
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 112
cancer on the complex tracks and between complicated groups of cells could be fantasized 113
by a Neutrosophic SuperHyperPath(-/Connective Dominating In SuperHyperGraphs, Supe- 114
rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 115

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

basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 126
proposed. 127
Keywords: SuperHyperGraph, (Neutrosophic) Connective Dominating In SuperHyperGraphs, 128
Cancer’s Recognition 129

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

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

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

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

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

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

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

only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 217
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 218
the specific designs and the specific architectures. The SuperHyperModel is officially called 219
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 220
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 221
and the common and intended properties between “specific” cells and “specific group” of cells 222
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 223
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 224
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 225
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 226
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 227
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] and 228
the long cycle of the move from the cancer is identified by this research. Sometimes the move of 229
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neut- 230
rality about the moves and the effects of the cancer on that region; this event leads us to choose 231
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 232
on what’s happened and what’s done. There are some specific models, which are well-known 233
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and 234
the traces of the cancer on the complex tracks and between complicated groups of cells could be 235
fantasized by a Neutrosophic SuperHyperPath(-/Connective Dominating In SuperHyperGraphs, 236
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 237
is to find either the longest Connective Dominating In SuperHyperGraphs or the strongest 238
Connective Dominating In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 239
the longest Connective Dominating In SuperHyperGraphs, called Connective Dominating 240
In SuperHyperGraphs, and the strongest Connective Dominating In SuperHyperGraphs, 241

called Neutrosophic Connective Dominating In SuperHyperGraphs, some general results are 242
introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 243
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 244
to form any style of a Connective Dominating In SuperHyperGraphs. There isn’t any formation 245
of any Connective Dominating In SuperHyperGraphs but literarily, it’s the deformation of any 246
Connective Dominating In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A 247
basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 248
proposed. 249
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Connective Dominating In 250
SuperHyperGraphs, Cancer’s Neutrosophic Recognition 251

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

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

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




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

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

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

[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 356
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 357
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 358
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 359
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 360
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett 361
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 362
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 363
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 364
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 365

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

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

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

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

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

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

sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] 408
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 409
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic No- 410
tions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 411

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), 412
“Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyper- 413
Resolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material 414
of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic 415
SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by 416
Henry Garrett (2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; 417
HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; 418
HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; 421
HG272; HG273; HG274; HG275], there are some endeavors to formalize the basic Super- 437
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 438
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 439
HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 440
HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; HG106b; 443
HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; HG114b; 444

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

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

HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; 471
HG267; HG268; HG269; HG270; HG271; HG272; HG273; HG274; HG275] alongside 490
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 491


HG170b; HG171b; HG172b; HG173b; HG174b; HG175b; HG176b; HG177b]. Two 504
popular scientific research books in Scribd in the terms of high readers, 4331 and 5327 respect- 505
ively, on neutrosophic science is on [HG32b; HG44b]. 506

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

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

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

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

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

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

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

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

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

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

10.5281/zenodo.8051360). 604
HG273 [28] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 605
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 606
10.5281/zenodo.8025707). 607
HG272 [29] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 608
10.5281/zenodo.8027275). 610
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 612
odo.8017246). 613

HG270 [31] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 614
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 615
10.5281/zenodo.8020128). 616
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 618
odo.7978571). 619
HG268 [33] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 620
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 621
10.5281/zenodo.7978857). 622
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 624
10.5281/zenodo.7940830). 625
HG266 [35] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 626
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 627
10.5281/zenodo.7943578). 628
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 630
odo.7916595). 631
HG264 [37] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 632
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 633
odo.7923632). 634
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 636
(doi: 10.5281/zenodo.7904698). 637
HG262 [39] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 638
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 639
2023, (doi: 10.5281/zenodo.7904671). 640
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 642
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 643
HG260 [41] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 644
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 645
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 646
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 648
10.5281/zenodo.7871026). 649
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 651
2023, (doi: 10.5281/zenodo.7874647). 652

By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 654
10.5281/zenodo.7857856). 655
HG256 [45] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 656
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 657
2023, (doi: 10.5281/zenodo.7857841). 658
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 660
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 663
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 666
10.5281/zenodo.7853867). 667
HG252 [49] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 668
10.5281/zenodo.7853922). 670
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 672
(doi: 10.5281/zenodo.7851519). 673
HG250 [51] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 674
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 675
(doi: 10.5281/zenodo.7851550). 676
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 678
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 681
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 684
10.5281/zenodo.7834229). 685
HG246 [55] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 686
10.5281/zenodo.7834261). 688
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 690
10.5281/zenodo.7824560). 691

HG244 [57] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 692
(doi: 10.5281/zenodo.7824623). 694
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 696
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 699
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 702
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 704
2023, (doi: 10.5281/zenodo.7809365). 705
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 707
2023, (doi: 10.5281/zenodo.7809358). 708
HG238 [63] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 709

10.5281/zenodo.7809219). 711
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 713
10.5281/zenodo.7809328). 714
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 716
2023, (doi: 10.5281/zenodo.7806767). 717
HG235 [66] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 718
2023, (doi: 10.5281/zenodo.7806838). 720
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 722
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 723
HG233 [68] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 724
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 725
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 726
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 728
10.5281/zenodo.7799902). 729

HG231 [70] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 730
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 731
(doi: 10.5281/zenodo.7804218). 732
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 734
(doi: 10.5281/zenodo.7796334). 735
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 737
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 740
10.5281/zenodo.7791952). 741
HG225 [74] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 742
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 743
10.5281/zenodo.7791982). 744
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 746
10.5281/zenodo.7790026). 747
HG223 [76] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 748
10.5281/zenodo.7790052). 750
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 752
2023, (doi: 10.5281/zenodo.7787066). 753
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 755
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 756
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 758
10.5281/zenodo.7781476). 759
HG219 [80] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 760
10.5281/zenodo.7783082). 762
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 764
10.5281/zenodo.7777857). 765
HG217 [82] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 766
10.5281/zenodo.7779286). 768

HG215 [83] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 769
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 770
(doi: 10.5281/zenodo.7771831). 771
HG214 [84] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 772
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 773
2023, (doi: 10.5281/zenodo.7772468). 774
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 776
10.13140/RG.2.2.20913.25446). 777
HG212 [86] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 778
odo.7764916). 780
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 782
10.13140/RG.2.2.11770.98247). 783
HG210 [88] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 784
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 785
10.13140/RG.2.2.12400.12808). 786
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 788
2023, (doi: 10.13140/RG.2.2.22545.10089). 789
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 791
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 792
HG207 [91] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 793
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 794
10.13140/RG.2.2.11377.76644). 795
HG206 [92] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 796
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 797
10.13140/RG.2.2.23750.96329). 798
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 800
10.13140/RG.2.2.31366.24641). 801
HG204 [94] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 802
10.13140/RG.2.2.34721.68960). 804
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 806
2023, (doi: 10.13140/RG.2.2.30212.81289). 807

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 809
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 812
10.13140/RG.2.2.24288.35842). 813
HG200 [98] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 814
10.13140/RG.2.2.32467.25124). 816
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 818
10.13140/RG.2.2.31025.45925). 819
HG198 [100] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 820
10.13140/RG.2.2.17184.25602). 822
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 824
10.13140/RG.2.2.23423.28327). 825
HG196 [102] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 826
10.13140/RG.2.2.28456.44805). 828
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 830
10.13140/RG.2.2.23525.68320). 831
HG194 [104] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 832
10.13140/RG.2.2.20170.24000). 834
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 836
10.13140/RG.2.2.36475.59683). 837
HG192 [106] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 838
10.13140/RG.2.2.29764.71046). 840
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 842
2023, (doi: 10.13140/RG.2.2.18780.87683). 843
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 845

Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 848
10.13140/RG.2.2.26134.01603). 849
HG188 [110] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 850
10.13140/RG.2.2.27392.30721). 852
HG187 [111] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 853
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 854
10.13140/RG.2.2.33028.40321). 855
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 857
10.13140/RG.2.2.21389.20966). 858
HG185 [113] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 859
10.13140/RG.2.2.16356.04489). 861
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 863
10.13140/RG.2.2.21756.21129). 864
HG183 [115] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 865
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 866
10.13140/RG.2.2.30983.68009). 867
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 869
10.13140/RG.2.2.28552.29445). 870
HG181 [117] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 871
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 872
(doi: 10.13140/RG.2.2.10936.21761). 873
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 875
10.13140/RG.2.2.35105.89447). 876
HG179 [119] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 877
(doi: 10.13140/RG.2.2.30072.72960). 879
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 881
10.13140/RG.2.2.31147.52003). 882
HG177 [121] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 883
10.13140/RG.2.2.32825.24163). 885

Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 887
10.13140/RG.2.2.13059.58401). 888
HG175 [123] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 889
10.13140/RG.2.2.11172.14720). 891
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 893
2023, (doi: 10.13140/RG.2.2.22011.80165). 894
HG173 [125] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 895
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 896
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 897
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 899
2023, (doi: 10.13140/RG.2.2.10493.84962). 900
HG171 [127] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 901
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 903
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 905
2023, (doi: 10.13140/RG.2.2.19944.14086). 906
HG169 [129] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 907
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 909
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 911
(doi: 10.13140/RG.2.2.33103.76968). 912
HG167 [131] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 913
(doi: 10.13140/RG.2.2.23037.44003). 915
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 917
(doi: 10.13140/RG.2.2.35646.56641). 918
HG165 [133] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 919
10.13140/RG.2.2.18030.48967). 921
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 923
(doi: 10.13140/RG.2.2.13973.81121). 924

HG163 [135] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 925
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 926
2023, (doi: 10.13140/RG.2.2.34106.47047). 927
HG162 [136] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 928
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 929
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 932
2023, (doi: 10.13140/RG.2.2.31956.88961). 933
HG160 [138] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 934
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 935
2023, (doi: 10.13140/RG.2.2.15179.67361). 936
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 938
10.13140/RG.2.2.21510.45125). 939
HG158 [140] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 940
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 941
2023, (doi: 10.13140/RG.2.2.13121.84321). 942
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 944
10.13140/RG.2.2.11758.69441). 945
HG156 [142] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 946
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 947
2023, (doi: 10.13140/RG.2.2.31891.35367). 948
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 950
10.13140/RG.2.2.19360.87048). 951
HG154 [144] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 952
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 953
10.13140/RG.2.2.32363.21286). 954
HG153 [145] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 955
10.13140/RG.2.2.23266.81602). 957
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 959
10.13140/RG.2.2.19911.37285). 960
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 962
10.13140/RG.2.2.11050.90569). 963

HG150 [148] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 964
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 965
2023, (doi: 10.13140/RG.2.2.17761.79206). 966
HG149 [149] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 967
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 968
HG148 [150] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 970
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 971
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 972
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 974
(doi: 10.13140/RG.2.2.30182.50241). 975
HG146 [152] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 976
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 977
HG145 [153] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 979
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 980
HG144 [154] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 982
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 983
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 984
HG143 [155] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 985
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 986
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 987
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 990
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 993
HG140 [158] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 994
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 995
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 996
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 999
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1002

HG137 [161] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1003
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1004
HG136 [162] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1006
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1007
2023, (doi: 10.13140/RG.2.2.17252.24968). 1008
HG135 [163] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1009
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1010
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1011
HG134 [164] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1012
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1013

HG132 [165] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1015
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1016
2023010396 (doi: 10.20944/preprints202301.0396.v1). 1017
HG131 [166] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1018
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1019
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1020
HG130 [167] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1021
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1022
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1023
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1024
HG129 [168] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1025

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

HG128 [169] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1029
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1030
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1031
HG127 [170] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1032
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1033
2023,(doi: 10.13140/RG.2.2.36745.93289). 1034
HG126 [171] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1035
HG125 [172] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1038
10.20944/preprints202301.0282.v1). 1041

HG124 [173] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1042
10.20944/preprints202301.0267.v1).). 1044
(doi: 10.20944/preprints202301.0265.v1). 1049
HG122 [175] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1050
prints202301.0262.v1). 1053

2023010224, (doi: 10.20944/preprints202301.0224.v1). 1059
HG24 [178] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1060
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1061

10.13140/RG.2.2.35061.65767). 1062
HG25 [179] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1063
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1064
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1065

10.13140/RG.2.2.18494.15680). 1066
HG26 [180] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1067
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1068
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1069

10.13140/RG.2.2.32530.73922). 1070
HG27 [181] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1071
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1072
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1073

10.13140/RG.2.2.15897.70243). 1074

10.13140/RG.2.2.32530.73922). 1078
prints202301.0105.v1). 1081

HG28 [184] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1082
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1083
HG29 [185] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1085
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1086
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1087
10.13140/RG.2.2.23172.19849). 1088
HG30 [188] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1095
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1096
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1097
10.13140/RG.2.2.17385.36968). 1098
Preprints 2023, 2023010044 1101

10.20944/preprints202301.0043.v1). 1104
HG31 [191] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1105
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1106
2023, (doi: 10.13140/RG.2.2.28945.92007). 1107
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1112
10.13140/RG.2.2.35774.77123). 1113

HG35 [195] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1117
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1118
10.13140/RG.2.2.29430.88642). 1119


(doi: 10.20944/preprints202212.0549.v1). 1125
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1127
10.13140/RG.2.2.19380.94084). 1128
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1136
(doi: 10.20944/preprints202212.0500.v1). 1139
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1141

10.13140/RG.2.2.20993.12640). 1142
HG952 [203] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1143

HG95 [204] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1146
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1147
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1148
HG37 [207] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1155
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1156
10.13140/RG.2.2.29173.86244). 1157

HG38 [208] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1158
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1159
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1160
HG177b [209] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1161
(doi: 10.5281/zenodo.8051368). 1162
HG176b [210] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1163
(doi: 10.5281/zenodo.8027488). 1164
HG175b [211] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1165
10.5281/zenodo.8020181). 1166
HG174b [212] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1167
10.5281/zenodo.7978921). 1168
HG173b [213] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1169
odo.7943878). 1170
HG172b [214] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1171
10.5281/zenodo.7943871). 1172
HG171b [215] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1173
10.5281/zenodo.7923786). 1174
HG170b [216] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1175
2023 (doi: 10.5281/zenodo.7905287). 1176
HG169b [217] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1177

Garrett, 2023 (doi: 10.5281/zenodo.7904586). 1178
HG168b [218] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1179
2023 (doi: 10.5281/zenodo.7874677). 1180
HG167b [219] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1181
(doi: 10.5281/zenodo.7857906). 1182
HG166b [220] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1183
2023 (doi: 10.5281/zenodo.7856329). 1184
HG165b [221] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7854561). 1186
HG164b [222] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1187
2023 (doi: 10.5281/zenodo.7851893). 1188
HG163b [223] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1189

HG162b [224] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1191
(doi: 10.5281/zenodo.7835063). 1192

HG161b [225] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1193
(doi: 10.5281/zenodo.7826705). 1194
HG160b [226] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1195
2023 (doi: 10.5281/zenodo.7820680). 1196
HG159b [227] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1197
10.5281/zenodo.7812750). 1198
HG158b [228] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1199

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

HG156b [230] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1203
2023 (doi: 10.5281/zenodo.7807782). 1204
HG155b [231] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1205
2023 (doi: 10.5281/zenodo.7804449). 1206
HG154b [232] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1207

HG153b [233] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1209
(doi: 10.5281/zenodo.7792307). 1210
HG152b [234] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1211
(doi: 10.5281/zenodo.7790728). 1212
HG151b [235] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1213
2023 (doi: 10.5281/zenodo.7787712). 1214
HG150b [236] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1215
10.5281/zenodo.7783791). 1216
HG149b [237] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1217
10.5281/zenodo.7780123). 1218
HG148b [238] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1219
(doi: 10.5281/zenodo.7773119). 1220
HG147b [239] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1221
odo.7637762). 1222
HG146b [240] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1223
10.5281/zenodo.7766174). 1224
HG145b [241] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1225
10.5281/zenodo.7762232). 1226
HG144b [242] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1227
(doi: 10.5281/zenodo.7758601). 1228

HG143b [243] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7754661). 1230
HG142b [244] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1231
10.5281/zenodo.7750995) . 1232
HG141b [245] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1233
(doi: 10.5281/zenodo.7749875). 1234
HG140b [246] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1235
10.5281/zenodo.7747236). 1236
HG139b [247] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1237
10.5281/zenodo.7742587). 1238
HG138b [248] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1239
(doi: 10.5281/zenodo.7738635). 1240
HG137b [249] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7734719). 1242
HG136b [250] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7730484). 1244
HG135b [251] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1245
(doi: 10.5281/zenodo.7730469). 1246
HG134b [252] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1247
10.5281/zenodo.7722865). 1248
HG133b [253] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1249
odo.7713563). 1250
odo.7709116). 1252
HG131b [255] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1253
10.5281/zenodo.7706415). 1254
HG130b [256] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7706063). 1256
HG129b [257] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1257
10.5281/zenodo.7701906). 1258
HG128b [258] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1259
odo.7700205). 1260
HG127b [259] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1261
10.5281/zenodo.7694876). 1262
HG126b [260] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1263
10.5281/zenodo.7679410). 1264

HG125b [261] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1265
10.5281/zenodo.7675982). 1266
HG124b [262] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1267
10.5281/zenodo.7672388). 1268
HG123b [263] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1269
odo.7668648). 1270
HG122b [264] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1271
10.5281/zenodo.7662810). 1272
HG121b [265] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1273
10.5281/zenodo.7659162). 1274
HG120b [266] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.7653233). 1276
HG119b [267] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1277
odo.7653204). 1278
HG118b [268] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1279
odo.7653142). 1280
HG117b [269] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1281
odo.7653117). 1282
HG116b [270] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1283
HG115b [271] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1284
odo.7651687). 1285
HG114b [272] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1286
odo.7651619). 1287
HG113b [273] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1288
odo.7651439). 1289
HG112b [274] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1290
odo.7650729). 1291
HG111b [275] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1292
odo.7647868). 1293
HG110b [276] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1294
odo.7647017). 1295
HG109b [277] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1296
odo.7644894). 1297
HG108b [278] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1298

HG107b [279] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1299
odo.7632923). 1300
HG106b [280] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1301
odo.7623459). 1302
HG105b [281] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1303
10.5281/zenodo.7606416). 1304
HG104b [282] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1305
10.5281/zenodo.7606416). 1306
HG103b [283] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1307
odo.7606404). 1308
HG102b [284] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1309
10.5281/zenodo.7580018). 1310
HG101b [285] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1311
odo.7580018). 1312
odo.7580018). 1314
odo.7579929). 1316
HG98b [288] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1317
10.5281/zenodo.7563170). 1318
HG97b [289] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1319
odo.7563164). 1320
HG96b [290] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1321
odo.7563160). 1322
odo.7563160). 1324
HG94b [292] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1325
10.5281/zenodo.7563160). 1326
HG93b [293] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1327
10.5281/zenodo.7557063). 1328
HG92b [294] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1329
10.5281/zenodo.7557009). 1330
HG91b [295] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1331
10.5281/zenodo.7539484). 1332
HG90b [296] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1333
10.5281/zenodo.7523390). 1334

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

HG71b [315] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1371
odo.7493845). 1372
HG70b [316] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1373
10.5281/zenodo.7493845). 1374
HG69b [317] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1375
odo.7539484). 1376
HG68b [318] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1377
odo.7523390). 1378
HG67b [319] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1379
odo.7523357). 1380
HG66b [320] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1381
odo.7504782). 1382
HG65b [321] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1383
odo.7499395). 1384
HG64b [322] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1385
odo.7497450). 1386
HG63b [323] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1387
odo.7494862). 1388
HG62b [324] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1389
odo.7493845). 1390
HG61b [325] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1391
odo.7480110). 1392
HG60b [326] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1393
odo.7378758). 1394
HG32b [327] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1395
odo.6320305). 1396
HG44b [328] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1397
odo.6677173). 1398

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

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

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

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

CHAPTER 5 1507
Extreme Connective Dominating 1508
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1509
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1510
2023, (doi: 10.13140/RG.2.2.34953.52320). 1511

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1512
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1513
(doi: 10.13140/RG.2.2.33275.80161). 1514
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1515
10.13140/RG.2.2.11050.90569). 1517
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1518
10.13140/RG.2.2.17761.79206). 1520
10.13140/RG.2.2.19911.37285). 1523
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1524
10.13140/RG.2.2.23266.81602). 1526
10.13140/RG.2.2.19360.87048). 1529
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1530
10.13140/RG.2.2.32363.21286). 1532
10.13140/RG.2.2.11758.69441). 1535
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1536
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1537
10.13140/RG.2.2.31891.35367). 1538
10.13140/RG.2.2.21510.45125). 1541
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1542
10.13140/RG.2.2.13121.84321). 1544

CHAPTER 6 1545
New Ideas On Super Con By Hyper 1546
Conceit Of Connective Dominating In 1547
Recognition of Cancer With 1548
(Neutrosophic) SuperHyperGraph 1549
49
CHAPTER 7 1550
ABSTRACT 1551
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperConnective 1552

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

And∀Ea ∈ EN SHG : Ea is Neutrosophic connective;
Neutrosophic re-SuperHyperConnective Dominating if the following expression is called Neutrosophic 1557
e-SuperHyperConnective Dominating criteria holds 1558

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

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

Neutrosophic rv-SuperHyperConnective Dominating if the following expression is called Neutrosophic 1562

v-SuperHyperConnective Dominating criteria holds 1563

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Supe- 1564
rHyperConnective Dominating if it’s either of Neutrosophic e-SuperHyperConnective Dominating, Neut- 1565
rosophic re-SuperHyperConnective Dominating, Neutrosophic v-SuperHyperConnective Dominating, and 1566
Neutrosophic rv-SuperHyperConnective Dominating. ((Neutrosophic) SuperHyperConnective Dominat- 1567
ing). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1568
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1569
51
SuperHyperConnective Dominating if it’s either of Neutrosophic e-SuperHyperConnective Dominating, Neut- 1570

Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyperGraph 1572
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1573
Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 1574
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1575
SuperHyperConnective Dominating; a Neutrosophic SuperHyperConnective Dominating if it’s either of 1576

Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re-SuperHyperConnective Dominating, 1577
Neutrosophic v-SuperHyperConnective Dominating, and Neutrosophic rv-SuperHyperConnective Dom- 1578
inating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1579
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 1580
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1581
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperConnective 1582
Dominating; an Extreme SuperHyperConnective Dominating SuperHyperPolynomial if it’s either of 1583
inating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Su- 1586
perHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1587
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHy- 1588

perSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 1589
SuperHyperVertices such that they form the Extreme SuperHyperConnective Dominating; and the 1590
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperConnective 1591
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperConnective Dominating, 1592
Neutrosophic re-SuperHyperConnective Dominating, Neutrosophic v-SuperHyperConnective Dominating, 1593
and Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic SuperHy- 1594
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1595
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1596
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 1597
dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1598
that they form the Neutrosophic SuperHyperConnective Dominating; and the Neutrosophic power is 1599
corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperConnective Dominating if it’s 1600

either of Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re-SuperHyperConnective Dom- 1601
inating, Neutrosophic v-SuperHyperConnective Dominating, and Neutrosophic rv-SuperHyperConnective 1602
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1603
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1604
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and 1605

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnective Dominating; a 1606
Neutrosophic V-SuperHyperConnective Dominating if it’s either of Neutrosophic e-SuperHyperConnective 1607
Dominating, Neutrosophic re-SuperHyperConnective Dominating, Neutrosophic v-SuperHyperConnective 1608
Dominating, and Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic 1609
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutro- 1610
sophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1611

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 1612
they form the Neutrosophic SuperHyperConnective Dominating; an Extreme V-SuperHyperConnective 1613

and Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyper- 1616
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1617
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Su- 1618
perHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 1619
SuperHyperConnective Dominating; and the Extreme power is corresponded to its Extreme coef- 1621
ficient; a Neutrosophic SuperHyperConnective Dominating SuperHyperPolynomial if it’s either of 1622

Neutrosophic v-SuperHyperConnective Dominating, and Neutrosophic rv-SuperHyperConnective Dominat- 1624
ing and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1625
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1626
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 1627
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1628

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1629
SuperHyperConnective Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 1630
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 1631
namely, a SuperHyperConnective Dominating and Neutrosophic SuperHyperConnective Dominating. Two 1632
different types of SuperHyperDefinitions are debut for them but the research goes further 1633
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers 1637
are featured. The definitions are followed by the examples and the instances thus the cla- 1638
rifications are driven with different tools. The applications are figured out to make sense 1639
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 1640
under research to figure out the challenges make sense about ongoing and upcoming research. 1641
The special case is up. The cells are viewed in the deemed ways. There are different types 1642
of them. Some of them are individuals and some of them are well-modeled by the group of 1643
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 1644
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 1645
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1646
these complex and dense SuperHyperModels open up some avenues to research on theoret- 1647
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 1648
It’s also officially collected in the form of some questions and some problems. Assume a 1649
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperConnective Dominating is 1650
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1651
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1654
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperConnective Dominating is a max- 1655
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1656
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1657
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1658
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 1659
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 1660
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperConnective 1661

Dominating . Since there’s more ways to get type-results to make a SuperHyperConnective Dominating 1662
more understandable. For the sake of having Neutrosophic SuperHyperConnective Dominating, there’s 1663
a need to “redefine” the notion of a “SuperHyperConnective Dominating ”. The SuperHyperVertices 1664
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 1665
procedure, there’s the usage of the position of labels to assign to the values. Assume a Supe- 1666
rHyperConnective Dominating . It’s redefined a Neutrosophic SuperHyperConnective Dominating if the 1667
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 1668
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 1669
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 1670
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 1671
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 1672
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1673
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 1674
based on a SuperHyperConnective Dominating . It’s the main. It’ll be disciplinary to have the 1675
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 1676
SuperHyperConnective Dominating until the SuperHyperConnective Dominating, then it’s officially called a 1677
“SuperHyperConnective Dominating” but otherwise, it isn’t a SuperHyperConnective Dominating . There 1678
are some instances about the clarifications for the main definition titled a “SuperHyperConnective 1679
Dominating ”. These two examples get more scrutiny and discernment since there are characterized 1680
in the disciplinary ways of the SuperHyperClass based on a SuperHyperConnective Dominating . For 1681
the sake of having a Neutrosophic SuperHyperConnective Dominating, there’s a need to “redefine” 1682
the notion of a “Neutrosophic SuperHyperConnective Dominating” and a “Neutrosophic SuperHy- 1683
perConnective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1684
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1685
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 1686
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperConnective 1687
Dominating are redefined to a “Neutrosophic SuperHyperConnective Dominating” if the intended Table 1688
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 1689
ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperConnective Dominating 1690
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 1691
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperConnective 1692

Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyper- 1693
Wheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperConnective Dominating”, 1694
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Super- 1695
HyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 1696
SuperHyperGraph has a “Neutrosophic SuperHyperConnective Dominating” where it’s the strongest 1697
[the maximum Neutrosophic value from all the SuperHyperConnective Dominating amid the maximum 1698
value amid all SuperHyperVertices from a SuperHyperConnective Dominating .] SuperHyperConnective 1699
Dominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of 1700
elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 1701
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 1702
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperConnective 1703
Dominating if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s 1704
SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s Supe- 1705
rHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1706
and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s 1707

SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHy- 1708
perEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in 1709
common; it’s a SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1710
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. 1711
The SuperHyperModel proposes the specific designs and the specific architectures. The Super- 1712
HyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In 1713
this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled 1714
as “SuperHyperVertices” and the common and intended properties between “specific” cells and 1715
“specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful 1716
to have some degrees of determinacy, indeterminacy, and neutrality to have more precise Super- 1717
HyperModel which in this case the SuperHyperModel is called “Neutrosophic”. In the future 1718
research, the foundation will be based on the “Cancer’s Recognition” and the results and the 1719
definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term 1720
and neutrality about the moves and the effects of the cancer on that region; this event leads us 1724
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 1725
perception on what’s happened and what’s done. There are some specific models, which are 1726
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 1727
moves and the traces of the cancer on the complex tracks and between complicated groups of 1728
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperConnective Dominating, 1729
is to find either the longest SuperHyperConnective Dominating or the strongest SuperHyperConnective 1731
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperConnective Dom- 1732
inating, called SuperHyperConnective Dominating, and the strongest SuperHyperConnective Dominating, 1733
called Neutrosophic SuperHyperConnective Dominating, some general results are introduced. Beyond 1734
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1735
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1736
SuperHyperConnective Dominating. There isn’t any formation of any SuperHyperConnective Dominating 1737
but literarily, it’s the deformation of any SuperHyperConnective Dominating. It, literarily, deforms 1738
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperConnective Dominating 1739
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1740
Keywords: Extreme SuperHyperGraph, SuperHyperConnective Dominating, Cancer’s Extreme 1741
Recognition 1742

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

the research has taken more motivations to define SuperHyperClasses and to find some 1804
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us 1805
to get some instances and examples to make clarifications about the framework of this research. 1806
The general results and some results about some connections are some avenues to make key 1807
point of this research, “Cancer’s Recognition”, more understandable and more clear. 1808
The framework of this research is as follows. In the beginning, I introduce basic definitions 1809
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1810
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1811
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1812
review literature are applied to make sense about what’s going to figure out about the upcoming 1813
sections. The main definitions and their clarifications alongside some results about new 1814
notions, SuperHyperConnective Dominating and Extreme SuperHyperConnective Dominating, are figured 1815
out in sections “ SuperHyperConnective Dominating” and “Extreme SuperHyperConnective Dominating”. 1816
In the sense of tackling on getting results and in Connective Dominating to make sense about 1817
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1818
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1819
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1820
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1821

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1822
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1823
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1824
and as concluding and closing section of theoretical research are contained in the section 1825
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1826
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1827
Results”, “ SuperHyperConnective Dominating”, “Extreme SuperHyperConnective Dominating”, “Results 1828

on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious 1829
questions about what’s done about the SuperHyperNotions to make sense about excellency of 1830
this research and going to figure out the word “best” as the description and adjective for this 1831
research as presented in section, “ SuperHyperConnective Dominating”. The keyword of this research 1832
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 1833
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 1834
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 1835
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 1836
research in the terms of “questions” and “problems” to make sense to figure out this research in 1837
featured style. The advantages and the limitations of this research alongside about what’s done 1838
in this research to make sense and to get sense about what’s figured out are included in the 1839
section, “Conclusion and Closing Remarks”. 1840

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1847
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1848
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1849
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1850
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1851
ideas and their clarifications are addressed to Ref.[HG38]. 1852

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

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

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

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

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1872
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1873
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1874
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1875
E. Thus, the ii0 th element of the Connective Dominating of Neutrosophic SuperHyperGraph 1876
(NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1877

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

(Ref.[HG11s],Definition 2.7,p.3). 1879
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1880
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1881
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1882
(i) If |Vi | = 1, then Vi is called vertex; 1883
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1884
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1885
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1886
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1887
SuperEdge; 1888
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1889
SuperHyperEdge. 1890
If we choose different types of binary operations, then we could get hugely diverse types of 1891
general forms of Neutrosophic SuperHyperGraph (NSHG). 1892
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1893

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1894
x, y, z, w ∈ [0, 1]: 1895
(i) 1 ⊗ x = x; 1896
(ii) x ⊗ y = y ⊗ x; 1897
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1898
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1899

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

where 1902

1, 2, . . . , n0 ); 1907
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1908
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1909
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1910
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1911
0


SuperEdge; 1931
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1934
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1935
makes the patterns and regularities. 1936
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1937
of elements of SuperHyperEdges are the same. 1938

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1939
makes to have SuperHyperUniform more understandable. 1940
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1941
Classes as follows. 1942
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1943
two given SuperHyperEdges with two exceptions; 1944
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1945
SuperHyperEdges; 1946
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1947
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1948
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1949
in common; 1950
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1951
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1952
SuperHyperEdge in common; 1953
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1954
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1955
SuperVertex. 1956
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 1957
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1958
(i) Vi , Vi+1 ∈ Ei0 ; 1959
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1960
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1961
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1962
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1963
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1964
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1965
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1966
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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

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

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1992
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1993
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1994
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperConnective Dominat- 1995

ing). 1996
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutro- 1997
sophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 1998

is called 1999
(i) Neutrosophic e-SuperHyperConnective Dominating if the following expression is called 2000

Neutrosophic e-SuperHyperConnective Dominating criteria holds 2001

(ii) Neutrosophic re-SuperHyperConnective Dominating if the following expression is called 2002

Neutrosophic re-SuperHyperConnective Dominating criteria holds 2003

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2004
(iii) Neutrosophic v-SuperHyperConnective Dominating if the following expression is called 2005
Neutrosophic v-SuperHyperConnective Dominating criteria holds 2006

(iv) Neutrosophic rv-SuperHyperConnective Dominating if the following expression is called 2007

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2009
(v) Neutrosophic SuperHyperConnective Dominating if it’s either of Neutrosophic e- 2010

SuperHyperConnective Dominating, Neutrosophic re-SuperHyperConnective Dominating, Neutro- 2011
sophic v-SuperHyperConnective Dominating, and Neutrosophic rv-SuperHyperConnective Dom- 2012
inating. 2013

Definition 9.0.19. ((Neutrosophic) SuperHyperConnective Dominating). 2014

(i) an Extreme SuperHyperConnective Dominating if it’s either of Neutrosophic e- 2017

inating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2020
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 2021
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 2022

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnective 2023
Dominating; 2024
(ii) a Neutrosophic SuperHyperConnective Dominating if it’s either of Neutrosophic e- 2025

sophic v-SuperHyperConnective Dominating, and Neutrosophic rv-SuperHyperConnective Dominating 2027
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 2028
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 2029

HyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 2030
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 2031
perConnective Dominating; 2032
(iii) an Extreme SuperHyperConnective Dominating SuperHyperPolynomial if it’s either 2033

of Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re-SuperHyperConnective 2034
Dominating, Neutrosophic v-SuperHyperConnective Dominating, and Neutrosophic rv- 2035
SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyperGraph 2036

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 2037
cients defined as the Extreme number of the maximum Extreme cardinality of the 2038
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 2039
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2040
form the Extreme SuperHyperConnective Dominating; and the Extreme power is corresponded 2041
to its Extreme coefficient; 2042
(iv) a Neutrosophic SuperHyperConnective Dominating SuperHyperPolynomial 2043

if it’s either of Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re- 2044
SuperHyperConnective Dominating, Neutrosophic v-SuperHyperConnective Dominating, and Neut- 2045
rosophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic SuperHy- 2046
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 2047
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 2048
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 2049

S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neut- 2050
rosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperConnective 2051
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 2052
(v) an Extreme V-SuperHyperConnective Dominating if it’s either of Neutrosophic e- 2053


Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 2057

the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme Su- 2058
perHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 2059
SuperHyperConnective Dominating; 2060
(vi) a Neutrosophic V-SuperHyperConnective Dominating if it’s either of Neutrosophic e- 2061

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2065
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2066

perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2067
(vii) an Extreme V-SuperHyperConnective Dominating SuperHyperPolynomial if 2069

it’s either of Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re- 2070
SuperHyperConnective Dominating, Neutrosophic v-SuperHyperConnective Dominating, and Neutro- 2071
sophic rv-SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyperGraph 2072
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2073
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2074
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 2075

utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2076
the Extreme SuperHyperConnective Dominating; and the Extreme power is corresponded to its 2077
Extreme coefficient; 2078
(viii) a Neutrosophic SuperHyperConnective Dominating SuperHyperPolynomial 2079

sophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic SuperHyper- 2082
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutro- 2083
sophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 2084
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 2085
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 2086
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperConnective 2087
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 2088
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperConnective Dominating). 2089

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2090
(i) an δ−SuperHyperConnective Dominating is a Neutrosophic kind of Neutrosophic SuperHy- 2091
perConnective Dominating such that either of the following expressions hold for the Neutrosophic 2092
cardinalities of SuperHyperNeighbors of s ∈ S : 2093
|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 2094
(29.1), holds if S is an δ−SuperHyperDefensive; 2095

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
(ii) a Neutrosophic δ−SuperHyperConnective Dominating is a Neutrosophic kind of Neut- 2096

rosophic SuperHyperConnective Dominating such that either of the following Neutrosophic 2097
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2098
|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 2099

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2100
For the sake of having a Neutrosophic SuperHyperConnective Dominating, there’s a need to 2101
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2102
there’s the usage of the position of labels to assign to the values. 2104
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2105
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2106
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2107
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2108
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 2110
sophic SuperHyperPath , SuperHyperConnective Dominating, SuperHyperStar, SuperHyperBipart- 2111
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 2112
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 2113
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 2114
perHyperWheel if the Table (29.2) holds. 2115


136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperConnective Dominating. 2116

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperConnective Dominating 2117
more Neutrosophicly understandable. 2118
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperConnective Dominating”. The 2120
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 2121
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 2122
2123
136DEF1 Definition 9.0.23. Assume a SuperHyperConnective Dominating. It’s redefined a Neutrosophic 2124
SuperHyperConnective Dominating if the Table (29.3) holds. 2125

CHAPTER 10 2126
Extreme SuperHyper But As The Connective Dominating 2127
Extensions Excerpt From Dense And 2128
Super Forms 2129
Definition 10.0.1. (Extreme event). 2130

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2131
a probability Connective Dominating. Any Extreme k-subset of A of V is called Extreme k-event 2132
and if k = 2, then Extreme subset of A of V is called Extreme event. The following expression 2133
is called Extreme probability of A. 2134
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2135

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2136
probability Connective Dominating. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2137
if the following expression is called Extreme s-independent criteria 2138
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 2139
following expression is called Extreme independent criteria 2140
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2141

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2142
is a probability Connective Dominating. Any k-function Connective Dominating like E is called Extreme 2143
k-Variable. If k = 2, then any 2-function Connective Dominating like E is called Extreme Variable. 2144
The notion of independent on Extreme Variable is likewise. 2145
Definition 10.0.4. (Extreme Expectation). 2146
73
is a probability Connective Dominating. an Extreme k-Variable E has a number is called Extreme 2148
Expectation if the following expression is called Extreme Expectation criteria 2149
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2150

is a probability Connective Dominating. an Extreme number is called Extreme Crossing if the 2152
following expression is called Extreme Crossing criteria 2153
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 2154
S = (V, E) is a probability Connective Dominating. Let m and n propose special Connective Dominating. 2155
Then with m ≥ 4n, 2156
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 Connective Dominating p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 2157
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2158
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2159
Consider S = (V, E) is a probability Connective Dominating. Let P be a SuperHyperSet of n points in 2160
the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through at 2161
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2162
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2163

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

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

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

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

P (Xn = 0) → 1 as n → ∞. 2193
Proof. 2194
Consider S = (V, E) is a probability Connective Dominating. A special SuperHyperGraph in Gn,p 2196
almost surely has stability number at most d2p−1 log ne. 2197

S = (V, E) is a probability Connective Dominating. A special SuperHyperGraph in Gn,p is up. Let 2199
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 2200
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 2201
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 2202
of the Extreme SuperHyperGraph G. 2203
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2204
Extreme Variable for this Extreme Event. By equation, we have 2205
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 2206
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2207
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: 2208
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2209
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 2210
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2211
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2212
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2213
Definition 10.0.12. (Extreme Variance). 2214

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

S = (V, E) is a probability Connective Dominating. Let X be an Extreme Variable and let t be a 2222
positive real number. Then 2223
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2224
Consider S = (V, E) is a probability Connective Dominating. Let Xn be an Extreme Variable in a 2226

probability Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2227
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 2229
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2230
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2231
Consider S = (V, E) is a probability Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2233
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 2234
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2235
S = (V, E) is a probability Connective Dominating. As in the proof of related Theorem, the result is 2237
straightforward. 2238
Consider S = (V, E) is a probability Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be as 2240
defined in previous Theorem. Then either: 2241
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2242
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2243
S = (V, E) is a probability Connective Dominating. The latter is straightforward. 2245
Definition 10.0.17. (Extreme Threshold). 2246
is a probability Connective Dominating. Let P be a monotone property of SuperHyperGraphs (one 2248
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2249
a function f (n) such that: 2250
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2251
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2252

Definition 10.0.18. (Extreme Balanced). 2253

is a probability Connective Dominating. Let F be a fixed Extreme SuperHyperGraph. Then 2255
there is a threshold function for the property of containing a copy of F as an Extreme 2256
SubSuperHyperGraph is called Extreme Balanced. 2257
Consider S = (V, E) is a probability Connective Dominating. Let F be a nonempty balanced Extreme 2259
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2260
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2261
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2264
the mentioned Extreme Figures in every Extreme items. 2265
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHy- 2266
perConnective Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and 2267
E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge 2268
and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeigh- 2269
bor, there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyper- 2270
Vertex, V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it 2271
as an Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every 2272

given Extreme SuperHyperConnective Dominating. 2273
C(N SHG)Extreme Connective Dominating =

{}.
C(N SHG)Extreme Connective Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Connective Dominating =
{}.
C(N SHG)Extreme V-Connective Dominating SuperHyperPolynomial
= 0z 0 .
2274
perConnective Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 2276
and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 2277
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 2278
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 2279
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2280
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnective Dominating. 2281

{}.

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

= 0z 0 .
{}.
= 0z 0 .
2282
perConnective Dominating, is up. The Extreme Algorithm is Extremely straightforward. 2284

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



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

{E2 }.
= z 6−c .
{V5 }.

= z 7−c .
2291

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

{E15 , E16 , E17 }.

= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
2297

{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.

= z 3−a .
2300

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

{E1 , E2 , E3 }.



= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
2306

{E1 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
2309


{E1 }.
= z 5−a .
{V1 , V2 , V3 , V7 , V8 }.
= z 5−a .
2312

{E9 , E3 }.
= z 3−a .


{V1 , V6 }.
= z 5−a .
2315

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2327

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


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

{E6 }.
= z 4−a .


{V1 }.
= z 6−a .
2336

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


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

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

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2349
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2350
quasi-R-Connective Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of 2351
them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2352
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Connective Dominating, minus 2353
all Extreme SuperHypeNeighbor to some of them but not all of them. 2354
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-Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Connective Dominating is at least 2355
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2356
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2357

SuperHyperConnective Dominating in the Extreme Example (42.0.3) 95NHG2
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2358
SuperHyperVertices are renamed to Extreme Connective Dominating in some cases but the maximum 2359
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2360
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2361
Connective Dominating. 2362
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Connective Dominating has, the least Extreme cardinality, the lower
sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Connective Dominating with the least Extreme cardinality, the 2363
lower sharp Extreme bound for cardinality. 2364
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2365
Then in the worst case, literally, 2366
C(N SHG)ExtremeQuasi−ConnectiveDominating
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ConnectiveDominatingSuperHyperP olynomial = z 5 .

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

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

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

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

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

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

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

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

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

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

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


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

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

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2379
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2380
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2381
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2382
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2383
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2384
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2385
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2386
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2387
Thus it forms an Extreme quasi-R-Connective Dominating where the Extreme completion of the 2388
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Connective Dominating. 2389
The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In 2390

the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2391
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2392
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2393
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2394
Extreme style of the embedded Extreme R-Connective Dominating. The interior types of the Extreme 2395
SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors are only 2396
affected by the interior Extreme SuperHyperVertices. The common connections, more precise 2397
and more formal, the perfect unique connections inside the Extreme SuperHyperSet for any 2398
distinct types of Extreme SuperHyperVertices pose the Extreme R-Connective Dominating. Thus 2399
Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge and 2400
in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that Extreme 2401
SuperHyperEdge. In the embedded Extreme Connective Dominating, there’s the usage of exterior 2402
Extreme SuperHyperVertices since they’ve more connections inside more than outside. Thus the 2403
title “exterior” is more relevant than the title “interior”. One Extreme SuperHyperVertex has no 2404
connection, inside. Thus, the Extreme SuperHyperSet of the Extreme SuperHyperVertices with 2405
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 2406
the Extreme R-Connective Dominating. The Extreme R-Connective Dominating with the exclusion of the 2407
exclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other 2408

terms, the Extreme R-Connective Dominating with the inclusion of all Extreme SuperHyperVertices 2409
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Connective Dominating. To sum them 2410
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2411
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2412
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Connective 2413
Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other 2414
words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2415
Extreme SuperHyperVertices in an Extreme quasi-R-Connective Dominating, minus all Extreme 2416
SuperHypeNeighbor to some of them but not all of them. 2417
The main definition of the Extreme R-Connective Dominating has two titles. an Extreme quasi-R- 2418
Connective Dominating and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are 2419
two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R- 2420
Connective Dominating with that quasi-maximum Extreme SuperHyperCardinality in the terms of the 2421
embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then 2422
the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi- 2423
R-Connective Dominatings for all Extreme numbers less than its Extreme corresponded maximum 2424
number. The essence of the Extreme Connective Dominating ends up but this essence starts up in the 2425
terms of the Extreme quasi-R-Connective Dominating, again and more in the operations of collecting 2426
all the Extreme quasi-R-Connective Dominatings acted on the all possible used formations of the 2427
Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2428
considered as the equivalence class for all corresponded quasi-R-Connective Dominatings. Let 2429
zExtreme Number , SExtreme SuperHyperSet and GExtreme Connective Dominating be an Extreme number, 2430
an Extreme SuperHyperSet and an Extreme Connective Dominating. Then 2431
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

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

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

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

∪zExtreme Number {SExtreme SuperHyperSet |

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

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

= max zExtreme Number
[zExtreme
Number ]Extreme Class

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


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


2441

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


= zExtreme Number |

2442


2443


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2444
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2445
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2446
perEdge. It’s, literarily, another name for “Extreme Quasi-Connective Dominating” but, precisely, it’s 2447
the generalization of “Extreme Quasi-Connective Dominating” since “Extreme Quasi-Connective Dominat- 2448
ing” happens “Extreme Connective Dominating” in an Extreme SuperHyperGraph as initial framework 2449
and background but “Extreme SuperHyperNeighborhood” may not happens “Extreme Connective 2450
Dominating” in an Extreme SuperHyperGraph as initial framework and preliminarily background 2451
since there are some ambiguities about the Extreme SuperHyperCardinality arise from it. To get 2452
orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Connective 2453

Dominating”, and “Extreme Connective Dominating” are up. 2454
Thus, let 2455
zExtreme Number , NExtreme SuperHyperNeighborhood and 2456
GExtreme Connective Dominating be an Extreme number, an Extreme SuperHyperNeighborhood and 2457
an Extreme Connective Dominating and the new terms are up. 2458
GExtreme Connective Dominating ∈ ∪zExtreme Number

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

2459

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

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

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


2463

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


2464


2465


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

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

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

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

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

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

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

does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2466
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2467
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2468
the 2469
“Extreme R-Connective Dominating” 2470
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2471
Extreme R-Connective Dominating, 2472
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Connective Dominating. In other words, the least cardinality, the lower sharp bound
for the cardinality, of an Extreme R-Connective Dominating is the cardinality of
2473
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2474
Extreme SuperHyperVertices belong to any Extreme quasi-R-Connective Dominating if for any of 2475
them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2476
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2477
all minus all Extreme SuperHypeNeighbors to any amount of them. 2478
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2479
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2480
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2481
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2482
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2483
R-Connective Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2484
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2485
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2486

S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2487
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Connective Dominating. Since 2488
it doesn’t have 2489
2490
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2491
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2492
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2493
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2494
but it isn’t an Extreme R-Connective Dominating. Since it doesn’t do the Extreme procedure such 2495
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2496
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2497
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2498
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2499
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2500
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2501
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Connective Dominating, VESHE 2502
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Connective Dominating, 2503
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2504
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2505
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2506
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2507
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2508
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2509
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Connective Dominating only contains 2510
all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2511
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2512
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2513
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2514
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2515
The SuperHyperNotion, namely, Connective Dominating, is up. There’s neither empty SuperHy- 2516
perEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2517
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Connect- 2518
ive Dominating. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2519
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−ConnectiveDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−ConnectiveDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−ConnectiveDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Connective Dominating . The Extreme 2520

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

2524
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2525
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2526
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2527
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2528
Extreme SuperHyperSet. Thus the non-obvious Extreme Connective Dominating is up. The obvious 2529
simple Extreme type-SuperHyperSet called the Extreme Connective Dominating is an Extreme Supe- 2530
rHyperSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet 2531
of the Extreme SuperHyperEdges[SuperHyperVertices], 2532
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- 2533
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Connective 2534
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2535
perEdges[SuperHyperVertices], 2536
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 Connective Dominating. Since 2537
the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2538
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Connective Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2539
is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an 2540
Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme type- 2541
SuperHyperSet called the Extreme Connective Dominating and it’s an Extreme Connective Dominating. 2542
Since it’s 2543

2544
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2545
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2546
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2547
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2548
intended Extreme SuperHyperSet, 2549
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Connective Dominating , 2550
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.


= az s + bz t .
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme , not:
Connective Dominating 2551
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2552
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 2553
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2554
SuperHyperSet called the 2555
“Extreme Connective Dominating ” 2556
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2557
Extreme Connective Dominating , 2558
is only and only 2559
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2560

CHAPTER 11 2561
The Extreme Departures on The 2562
Theoretical Results Toward Theoretical 2563
Motivations 2564
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2565
SuperHyperClasses. 2566
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2567

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

perConnective Dominating in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2570
new way to redefine as 2571
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 2572
ViEXT ERN AL in the literatures of SuperHyperConnective Dominating. The latter is straightforward. 2573
2574
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2575
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2576
(31.1), is the SuperHyperConnective Dominating. 2577
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2578

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


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

2585
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2586
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2587
SuperHyperModel (31.2), is the Extreme SuperHyperConnective Dominating. 2588

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

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

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 2590
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2591
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

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

2596
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2597
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2598
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2599
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnective 2600
Dominating. 2601
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2602

|P min |
{E3i+2 }i=0
ESHP
.


| min |EESHP | |Ei |
{P min }
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
| min |P min | |Vi |
=z 2i+2 i=0 .
Proof. Let 2603
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|P i |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
2604
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 2605
a new way to redefine as 2606

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

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

Extreme SuperHyperConnective Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2616
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2617
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2618
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2619
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2620
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnective Dominating. 2621
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2622
Then 2623

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.

=z 2i+2 i=0 .
Proof. Let 2624
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
2625
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperConnective Dominating taken from a connected Extreme SuperHyperMulti- 2626

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

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

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

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

SuperHyperConnective Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2639
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2640
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2641
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2642
the Extreme SuperHyperConnective Dominating. 2643
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2644

Then, 2645

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 2646
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

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

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

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

Then there’s at least one SuperHyperConnective Dominating. Thus the notion of quasi isn’t up and 2652
the SuperHyperNotions based on SuperHyperConnective Dominating could be applied. The unique 2653
embedded SuperHyperConnective Dominating proposes some longest SuperHyperConnective Dominating 2654
excerpt from some representatives. The latter is straightforward. 2655
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2656
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2657
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2658
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2659
Extreme SuperHyperConnective Dominating. 2660

CHAPTER 12 2661
The Surveys of Mathematical Sets On 2662
The Results But As The Initial Motivation 2663
For the SuperHyperConnective Dominating, Extreme SuperHyperConnective Dominating, and the Extreme 2664
SuperHyperConnective Dominating, some general results are introduced. 2665
Remark 12.0.1. Let remind that the Extreme SuperHyperConnective Dominating is “redefined” on 2666
the positions of the alphabets. 2667
Corollary 12.0.2. Assume Extreme SuperHyperConnective Dominating. Then 2668
Extreme SuperHyperConnectiveDominating =
{theSuperHyperConnectiveDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperConnectiveDominating
|ExtremecardinalityamidthoseSuperHyperConnectiveDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2669
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2670
and the neutrality, for i = 1, 2, 3, respectively. 2671
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2672
alphabet. Then the notion of Extreme SuperHyperConnective Dominating and SuperHyperConnective 2673
Dominating coincide. 2674
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2675
the alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme 2676
SuperHyperConnective Dominating if and only if it’s a SuperHyperConnective Dominating. 2677
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of the al- 2678
phabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperConnective 2679
Dominating if and only if it’s a longest SuperHyperConnective Dominating. 2680
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2681
identical letter of the alphabet. Then its Extreme SuperHyperConnective Dominating is its SuperHy- 2682
perConnective Dominating and reversely. 2683
125
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperConnective Dominating, Supe- 2684

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2685
identical letter of the alphabet. Then its Extreme SuperHyperConnective Dominating is its SuperHy- 2686
perConnective Dominating and reversely. 2687
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperConnective 2688
isn’t well-defined if and only if its SuperHyperConnective Dominating isn’t well-defined.
Dominating 2689
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2690
Extreme SuperHyperConnective Dominating isn’t well-defined if and only if its SuperHyperConnective 2691
Dominating isn’t well-defined. 2692
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperConnective Dominating, Super- 2693

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2694
SuperHyperConnective Dominating isn’t well-defined if and only if its SuperHyperConnective Dominating 2695
isn’t well-defined. 2696
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHy- 2697
perConnective Dominating is well-defined if and only if its SuperHyperConnective Dominating is well-defined. 2698
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2699

Extreme SuperHyperConnective Dominating is well-defined if and only if its SuperHyperConnective 2700
Dominating is well-defined. 2701
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperConnective Dominating, Super- 2702

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2703
SuperHyperConnective Dominating is well-defined if and only if its SuperHyperConnective Dominating is 2704
well-defined. 2705
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2706
(i) : the dual SuperHyperDefensive SuperHyperConnective Dominating; 2707
(ii) : the strong dual SuperHyperDefensive SuperHyperConnective Dominating; 2708
(iii) : the connected dual SuperHyperDefensive SuperHyperConnective Dominating; 2709
(iv) : the δ-dual SuperHyperDefensive SuperHyperConnective Dominating; 2710
(v) : the strong δ-dual SuperHyperDefensive SuperHyperConnective Dominating; 2711
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperConnective Dominating. 2712
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2713
(i) : the SuperHyperDefensive SuperHyperConnective Dominating; 2714
(ii) : the strong SuperHyperDefensive SuperHyperConnective Dominating; 2715
(iii) : the connected defensive SuperHyperDefensive SuperHyperConnective Dominating; 2716
(iv) : the δ-SuperHyperDefensive SuperHyperConnective Dominating; 2717
(v) : the strong δ-SuperHyperDefensive SuperHyperConnective Dominating; 2718

(vi) : the connected δ-SuperHyperDefensive SuperHyperConnective Dominating. 2719
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2720

independent SuperHyperSet is 2721
(iii) : the connected SuperHyperDefensive SuperHyperConnective Dominating; 2724
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2728

which is a SuperHyperConnective Dominating/SuperHyperPath. Then V is a maximal 2729
(i) : SuperHyperDefensive SuperHyperConnective Dominating; 2730
(ii) : strong SuperHyperDefensive SuperHyperConnective Dominating; 2731
(iii) : connected SuperHyperDefensive SuperHyperConnective Dominating; 2732
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperConnective Dominating; 2733
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperConnective Dominating; 2734
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperConnective Dominating; 2735
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2736
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2737

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2738
(i) : dual SuperHyperDefensive SuperHyperConnective Dominating; 2739
(ii) : strong dual SuperHyperDefensive SuperHyperConnective Dominating; 2740
(iii) : connected dual SuperHyperDefensive SuperHyperConnective Dominating; 2741
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperConnective Dominating; 2742
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperConnective Dominating; 2743
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperConnective Dominating; 2744

which is a SuperHyperConnective Dominating/SuperHyperPath. Then the number of 2747
(i) : the SuperHyperConnective Dominating; 2748

(ii) : the SuperHyperConnective Dominating; 2749
(iii) : the connected SuperHyperConnective Dominating; 2750
(iv) : the O(ESHG)-SuperHyperConnective Dominating; 2751
(v) : the strong O(ESHG)-SuperHyperConnective Dominating; 2752
(vi) : the connected O(ESHG)-SuperHyperConnective Dominating. 2753
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2754
coincide. 2755

which is a SuperHyperWheel. Then the number of 2757
(i) : the dual SuperHyperConnective Dominating; 2758
(ii) : the dual SuperHyperConnective Dominating; 2759
(iii) : the dual connected SuperHyperConnective Dominating; 2760
(iv) : the dual O(ESHG)-SuperHyperConnective Dominating; 2761
(v) : the strong dual O(ESHG)-SuperHyperConnective Dominating; 2762
(vi) : the connected dual O(ESHG)-SuperHyperConnective Dominating. 2763
coincide. 2765
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2767

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2768
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2769
is a 2770
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperConnective Dominating; 2774
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperConnective Dominating; 2775
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperConnective Dominating. 2776

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2779
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2780
SuperHyperPart is a 2781

(iv) : δ-SuperHyperDefensive SuperHyperConnective Dominating; 2785
(v) : strong δ-SuperHyperDefensive SuperHyperConnective Dominating; 2786
(vi) : connected δ-SuperHyperDefensive SuperHyperConnective Dominating. 2787

SuperHyperMultipartite. Then Then the number of 2790
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2797
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2798
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2800
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2801
(iv) : SuperHyperConnective Dominating; 2805
(v) : strong 1-SuperHyperDefensive SuperHyperConnective Dominating; 2806
(vi) : connected 1-SuperHyperDefensive SuperHyperConnective Dominating. 2807
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2808
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2809
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2810
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2811

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

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

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

2 + 1)-SuperHyperDefensive SuperHyperConnective Dominating. 2818
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2819
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2820
dual 2821
(iv) : 0-SuperHyperDefensive SuperHyperConnective Dominating; 2825
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2828
perComplete. Then there’s no independent SuperHyperSet. 2829
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2830
perConnective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2831
and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2832
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperConnective Dominating; 2836
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperConnective Dominating; 2837
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperConnective Dominating. 2838
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2839
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2840
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2841
t>
2
setting of a dual 2842



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2849
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2850
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2851
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2852
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2853
SuperHyperDefensive SuperHyperConnective Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2854
(i) v ∈ Ns (x); 2855
(ii) vx ∈ E. 2856
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2857
SuperHyperDefensive SuperHyperConnective Dominating, then 2858
(i) S is SuperHyperConnective Dominating set; 2859
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2860
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2861
(i) Γ ≤ O; 2862
(ii) Γs ≤ On . 2863
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2864
connected. Then 2865
(i) Γ ≤ O − 1; 2866
(ii) Γs ≤ On − Σ3i=1 σi (x). 2867
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2868
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHy- 2869

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

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2875
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperConnective Dominating; 2876
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2877
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2878
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2879
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperConnective Dominating. Then 2881
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperConnective 2882

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2892
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2893
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2895
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperConnective Dominating; 2896
(ii) Γ = 1; 2897
(iii) Γs = Σ3i=1 σi (c); 2898
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperConnective Dominating. 2899
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2900
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2901
SuperHyperDefensive SuperHyperConnective Dominating; 2902
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2903
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2904
i=1

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

b n c+1 ; 2911
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperConnective 2912
Dominating. 2913
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2914
bnc
2
Dominating; 2916
(ii) Γ = b n2 c; 2917

bnc ; 2918
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHy- 2919
perConnective Dominating. 2920
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2921

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

Dominating for N SHF; 2924
(ii) Γ = m for N SHF : (V, E); 2925
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2926
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperConnective 2927
Dominating for N SHF : (V, E). 2928
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2929
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2930
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive SuperHy- 2931
perConnective Dominating for N SHF; 2932
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2933

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

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

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

bnc for N SHF : (V, E); 2942
S={vi }i=1
bnc
2
are only dual maximal SuperHyperConnective Dominating for 2943
N SHF : (V, E). 2944
following statements hold; 2946
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2947

SuperHyperConnective Dominating, then S is an s-SuperHyperDefensive SuperHyperConnective 2948
Dominating; 2949
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2950

SuperHyperConnective Dominating, then S is a dual s-SuperHyperDefensive SuperHyperConnective 2951
Dominating. 2952
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2955

SuperHyperConnective Dominating, then S is an s-SuperHyperPowerful SuperHyperConnective 2956
Dominating; 2957
SuperHyperConnective Dominating, then S is a dual s-SuperHyperPowerful SuperHyperConnective 2959

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

SuperHyperGraph. Then following statements hold; 2962
(i) if ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1, 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 V-SuperHyperDefensive 2967

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

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

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

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


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

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


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

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

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

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

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

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


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

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

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

CHAPTER 13 3021
Extreme Applications in Cancer’s 3022
Extreme Recognition 3023
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3024
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3025
as the consequences of the model, some parameters are used. The cells are under attack of this 3026
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3027
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3028
In the following, some Extreme steps are Extreme devised on this disease. 3029
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3030
function. 3031
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3032
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3033
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3037
what’s done. 3038
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3039
they’ve got the names, and some general Extreme models. The moves and the Extreme 3040
traces of the cancer on the complex tracks and between complicated groups of cells 3041
could be fantasized by an Extreme SuperHyperPath(-/SuperHyperConnective Dominating, 3042
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 3043
The aim is to find either the Extreme SuperHyperConnective Dominating or the Extreme 3044
SuperHyperConnective Dominating in those Extreme Extreme SuperHyperModels. 3045
137
CHAPTER 14 3046
Case 1: The Initial Extreme Steps 3047
Toward Extreme SuperHyperBipartite 3048
as Extreme SuperHyperModel 3049
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3050
is Extreme highlighted and Extreme featured. 3051
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3052
partite is obtained. 3053
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3054
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperConnective Dominating 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3058
Case 2: The Increasing Extreme Steps 3059
Toward Extreme 3060
SuperHyperMultipartite as Extreme 3061
SuperHyperModel 3062
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3063
ite is Extreme highlighted and Extreme featured. 3064
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3065
partite is obtained. 3066
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3067
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

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

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

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

CHAPTER 18 3119
Extreme SuperHyperDuality But As The 3120
Super Forms 3122
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3123

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

Va ∈ Ei , Ej ; 3127
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3128
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3129
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3130
Vi , Vj ∈ Ea ; 3131
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3132
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3133
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3134
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3135

SuperHyperDuality. 3136
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3137

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3142
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3143
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3144
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3145
Extreme SuperHyperDuality; 3146
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3147

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3148
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3149
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3150
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3151
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3152
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3153

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3154
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3155
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3158
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3160
coefficient; 3161
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3162

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

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3185
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3186
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3187
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3188
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3189

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3190

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3198
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3200
Extreme coefficient. 3201
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3202
mentioned Extreme Figures in every Extreme items. 3203
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3204
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3205
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3206
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3207
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3208
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3209
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3210
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- 3212
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3213
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3214
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3218


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

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 3262
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. 3266
(31.1), is the SuperHyperDuality. 3269
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 3271
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3288
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 3290
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 3293
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3294
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3295
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3296
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3297
representative in the 3298
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 : 3299

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3311

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

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

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

∃!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 3336
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3337
Extreme SuperHyperDuality. 3343

CHAPTER 19 3344
Extreme SuperHyperJoin But As The 3345
Super Forms 3347
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3348

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3359
|Vj |Extreme CARDINALITY ; 3360
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3361
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3362
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3363

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3367
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3368
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3369
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3370
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3371
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3372

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3379
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3380
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3381
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3382
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3383
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3384
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3385
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3386

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3402
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3403
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3405
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3406
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3407

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3410

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

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

SuperHyperJoin. 3431
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 3433
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3434
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3435
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3436
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3437
V3 , is excluded in every given Extreme SuperHyperJoin. 3438

is up. The Extreme Algorithm is Extremely straightforward. 3440


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3561
Extreme SuperHyperPerfect But As The 3562
Super Forms 3564
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3565

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3577
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3578

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3582
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3583
Extreme SuperHyperPerfect; 3587
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3588

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3595
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3596
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3601
coefficient; 3602
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3603

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3639
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3641
Extreme coefficient. 3642
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3645
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3646
SuperHyperPerfect. 3652
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 3654
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3655
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3659


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

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

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

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

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



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

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

Then 3750

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



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

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

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


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

CHAPTER 21 3785
Extreme SuperHyperTotal But As The 3786
Super Forms 3788
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3789
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3792
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3793

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3799
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3800

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3804
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3807
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3808
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3809

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3824
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3826
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3827
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3828
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3830
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3831

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3832
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3835
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3836
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3837

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3844
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3845
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3850
coefficient; 3851
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3852

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3855
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3856
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3857
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3859
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3862
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3863
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3864
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3865
SuperHyperTotal. 3869
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 3871
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3872
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3873
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3874
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3875
V3 , is excluded in every given Extreme SuperHyperTotal. 3876



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3924
(31.1), is the SuperHyperTotal. 3927
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 3929
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. 3936
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 3938
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4000
Extreme SuperHyperConnected But As 4001
The Extensions Excerpt From Dense And 4002
Super Forms 4003
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4004

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4018
SuperHyperConnected. 4019
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4020
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4023

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4037
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4038
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4039
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4040
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4041
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4042
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4043
corresponded to its Extreme coefficient; 4044
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4045


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

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

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

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

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

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

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

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

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


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

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

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 4145
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. 4149
(31.1), is the SuperHyperConnected. 4152
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 4154
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. 4161
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 4163



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4182

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4217
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4218
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4219
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4220
some representatives. The latter is straightforward. 4221
Extreme SuperHyperConnected. 4226

CHAPTER 23 4227
Background 4228
217



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Cir- 4298
cumstances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. 4299
[HG12] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 4300
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act 4302
on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry 4303

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


SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 4309
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 4310
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 4311
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 4312
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 4313
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 4314

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 4315
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 4316
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 4317
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 4318
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 4319
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 4320

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

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

in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 4333
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 4334
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 4335
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 4336
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 4337
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 4338
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 4339
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 4340
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 4341
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 4342
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 4343
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 4344
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 4347
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 4348
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 4349
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 4350
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 4351
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 4352
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 4353

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

perGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concern- 4355
ing SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in 4356
Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to 4357
Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutro- 4358
sophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; 4359
HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; 4360
HG266; HG267; HG268; HG269; HG270; HG271], there are some endeavors to formalize 4379
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 4380
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4381



HG267; HG268; HG269; HG270; HG271; HG272; HG273] alongside scientific re- 4432
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4433


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

Bibliography 4449
10.33140/JMTCM.01.03.09) 4472
223



10.20944/preprints202301.0282.v1). 4488

10.20944/preprints202301.0267.v1). 4491

(doi: 10.20944/preprints202301.0265.v1). 4496
prints202301.0262.v1). 4500
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4506

prints202301.0105.v1). 4509

Preprints 2023, 2023010044 4515
10.20944/preprints202301.0043.v1). 4518

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

(doi: 10.20944/preprints202212.0500.v1). 4534
10.5281/zenodo.8025707). 4543

10.5281/zenodo.8027275). 4546
odo.8017246). 4549
10.5281/zenodo.8020128). 4552
odo.7978571). 4555

10.5281/zenodo.7978857). 4558
10.5281/zenodo.7940830). 4561
10.5281/zenodo.7943578). 4564
odo.7916595). 4567
odo.7923632). 4570
(doi: 10.5281/zenodo.7904698). 4573
2023, (doi: 10.5281/zenodo.7904671). 4576
10.5281/zenodo.7871026). 4585
2023, (doi: 10.5281/zenodo.7874647). 4588
10.5281/zenodo.7857856). 4591
2023, (doi: 10.5281/zenodo.7857841). 4594

10.5281/zenodo.7853867). 4603
10.5281/zenodo.7853922). 4606
(doi: 10.5281/zenodo.7851519). 4609
(doi: 10.5281/zenodo.7851550). 4612
10.5281/zenodo.7834229). 4621
10.5281/zenodo.7834261). 4624
10.5281/zenodo.7824560). 4627
(doi: 10.5281/zenodo.7824623). 4630

2023, (doi: 10.5281/zenodo.7809365). 4641

2023, (doi: 10.5281/zenodo.7809358). 4644
10.5281/zenodo.7809219). 4647
10.5281/zenodo.7809328). 4650

2023, (doi: 10.5281/zenodo.7806767). 4653
2023, (doi: 10.5281/zenodo.7806838). 4656
10.5281/zenodo.7799902). 4665
(doi: 10.5281/zenodo.7804218). 4668
(doi: 10.5281/zenodo.7796334). 4671

10.5281/zenodo.7791952). 4677
10.5281/zenodo.7791982). 4680
10.5281/zenodo.7790026). 4683
10.5281/zenodo.7790052). 4686
2023, (doi: 10.5281/zenodo.7787066). 4689
10.5281/zenodo.7781476). 4695
10.5281/zenodo.7783082). 4698
10.5281/zenodo.7777857). 4701
10.5281/zenodo.7779286). 4704
(doi: 10.5281/zenodo.7771831). 4707
2023, (doi: 10.5281/zenodo.7772468). 4710

10.13140/RG.2.2.20913.25446). 4713
odo.7764916). 4716
10.13140/RG.2.2.11770.98247). 4719
10.13140/RG.2.2.12400.12808). 4722
2023, (doi: 10.13140/RG.2.2.22545.10089). 4725
10.13140/RG.2.2.11377.76644). 4731
10.13140/RG.2.2.23750.96329). 4734
10.13140/RG.2.2.31366.24641). 4737
10.13140/RG.2.2.34721.68960). 4740
2023, (doi: 10.13140/RG.2.2.30212.81289). 4743
10.13140/RG.2.2.24288.35842). 4749

10.13140/RG.2.2.32467.25124). 4752
10.13140/RG.2.2.31025.45925). 4755
10.13140/RG.2.2.17184.25602). 4758
10.13140/RG.2.2.23423.28327). 4761
10.13140/RG.2.2.28456.44805). 4764
10.13140/RG.2.2.23525.68320). 4767
10.13140/RG.2.2.20170.24000). 4770
10.13140/RG.2.2.36475.59683). 4773
10.13140/RG.2.2.29764.71046). 4776
2023, (doi: 10.13140/RG.2.2.18780.87683). 4779
10.13140/RG.2.2.26134.01603). 4785
10.13140/RG.2.2.27392.30721). 4788

10.13140/RG.2.2.33028.40321). 4791
10.13140/RG.2.2.21389.20966). 4794
10.13140/RG.2.2.16356.04489). 4797
10.13140/RG.2.2.21756.21129). 4800
10.13140/RG.2.2.30983.68009). 4803
10.13140/RG.2.2.28552.29445). 4806
(doi: 10.13140/RG.2.2.10936.21761). 4809
10.13140/RG.2.2.35105.89447). 4812
(doi: 10.13140/RG.2.2.30072.72960). 4815
10.13140/RG.2.2.31147.52003). 4818
10.13140/RG.2.2.32825.24163). 4821
10.13140/RG.2.2.13059.58401). 4824
10.13140/RG.2.2.11172.14720). 4827

2023, (doi: 10.13140/RG.2.2.22011.80165). 4830
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4833
2023, (doi: 10.13140/RG.2.2.10493.84962). 4836
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4839
2023, (doi: 10.13140/RG.2.2.19944.14086). 4842
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4845
(doi: 10.13140/RG.2.2.33103.76968). 4848
(doi: 10.13140/RG.2.2.23037.44003). 4851
(doi: 10.13140/RG.2.2.35646.56641). 4854
10.13140/RG.2.2.18030.48967). 4857
(doi: 10.13140/RG.2.2.13973.81121). 4860
2023, (doi: 10.13140/RG.2.2.34106.47047). 4863

2023, (doi: 10.13140/RG.2.2.31956.88961). 4869
2023, (doi: 10.13140/RG.2.2.15179.67361). 4872
10.13140/RG.2.2.21510.45125). 4875
2023, (doi: 10.13140/RG.2.2.13121.84321). 4878
10.13140/RG.2.2.11758.69441). 4881
2023, (doi: 10.13140/RG.2.2.31891.35367). 4884
10.13140/RG.2.2.19360.87048). 4887
10.13140/RG.2.2.32363.21286). 4890
10.13140/RG.2.2.23266.81602). 4893
10.13140/RG.2.2.19911.37285). 4896
10.13140/RG.2.2.11050.90569). 4899
2023, (doi: 10.13140/RG.2.2.17761.79206). 4902

ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4908
(doi: 10.13140/RG.2.2.30182.50241). 4911
2023, (doi: 10.13140/RG.2.2.17252.24968). 4944


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

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



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

10.20944/preprints202301.0282.v1). 4977
10.20944/preprints202301.0267.v1).). 4980


(doi: 10.20944/preprints202301.0265.v1). 4985
prints202301.0262.v1). 4989

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

10.13140/RG.2.2.35061.65767). 4998
10.13140/RG.2.2.18494.15680). 5002
10.13140/RG.2.2.32530.73922). 5006
10.13140/RG.2.2.15897.70243). 5010

10.13140/RG.2.2.32530.73922). 5014
prints202301.0105.v1). 5017

10.13140/RG.2.2.23172.19849). 5024
10.13140/RG.2.2.17385.36968). 5034
Preprints 2023, 2023010044 5037
10.20944/preprints202301.0043.v1). 5040

2023, (doi: 10.13140/RG.2.2.28945.92007). 5043
10.13140/RG.2.2.35774.77123). 5049

10.13140/RG.2.2.29430.88642). 5055

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

10.13140/RG.2.2.19380.94084). 5064
(doi: 10.20944/preprints202212.0500.v1). 5075
10.13140/RG.2.2.20993.12640). 5078


10.13140/RG.2.2.29173.86244). 5093

(doi: 10.5281/zenodo.8027488). 5098
10.5281/zenodo.8020181). 5100
10.5281/zenodo.7978921). 5102
odo.7943878). 5104
10.5281/zenodo.7943871). 5106
10.5281/zenodo.7923786). 5108
2023 (doi: 10.5281/zenodo.7905287). 5110

2023 (doi: 10.5281/zenodo.7874677). 5114
(doi: 10.5281/zenodo.7857906). 5116
2023 (doi: 10.5281/zenodo.7856329). 5118
10.5281/zenodo.7854561). 5120
2023 (doi: 10.5281/zenodo.7851893). 5122

(doi: 10.5281/zenodo.7835063). 5126
(doi: 10.5281/zenodo.7826705). 5128
2023 (doi: 10.5281/zenodo.7820680). 5130
10.5281/zenodo.7812750). 5132



2023 (doi: 10.5281/zenodo.7807782). 5138
2023 (doi: 10.5281/zenodo.7804449). 5140

(doi: 10.5281/zenodo.7792307). 5144
(doi: 10.5281/zenodo.7790728). 5146
2023 (doi: 10.5281/zenodo.7787712). 5148
10.5281/zenodo.7783791). 5150
10.5281/zenodo.7780123). 5152
(doi: 10.5281/zenodo.7773119). 5154
odo.7637762). 5156
10.5281/zenodo.7766174). 5158
10.5281/zenodo.7762232). 5160
(doi: 10.5281/zenodo.7758601). 5162
10.5281/zenodo.7754661). 5164
10.5281/zenodo.7750995) . 5166
(doi: 10.5281/zenodo.7749875). 5168

10.5281/zenodo.7747236). 5170
10.5281/zenodo.7742587). 5172
(doi: 10.5281/zenodo.7738635). 5174
10.5281/zenodo.7734719). 5176
10.5281/zenodo.7730484). 5178
(doi: 10.5281/zenodo.7730469). 5180
10.5281/zenodo.7722865). 5182
odo.7713563). 5184
odo.7709116). 5186
10.5281/zenodo.7706415). 5188
10.5281/zenodo.7706063). 5190
10.5281/zenodo.7701906). 5192
odo.7700205). 5194
10.5281/zenodo.7694876). 5196
10.5281/zenodo.7679410). 5198
10.5281/zenodo.7675982). 5200
10.5281/zenodo.7672388). 5202
odo.7668648). 5204

10.5281/zenodo.7662810). 5206
10.5281/zenodo.7659162). 5208
odo.7653233). 5210
odo.7653204). 5212
odo.7653142). 5214
odo.7653117). 5216
odo.7651687). 5219
odo.7651619). 5221
odo.7651439). 5223
odo.7650729). 5225
odo.7647868). 5227
odo.7647017). 5229
odo.7644894). 5231
odo.7632923). 5234
odo.7623459). 5236
10.5281/zenodo.7606416). 5238

10.5281/zenodo.7606416). 5240
odo.7606404). 5242
10.5281/zenodo.7580018). 5244
odo.7580018). 5246
odo.7580018). 5248
odo.7579929). 5250
10.5281/zenodo.7563170). 5252
odo.7563164). 5254
odo.7563160). 5256
odo.7563160). 5258
10.5281/zenodo.7563160). 5260
10.5281/zenodo.7557063). 5262
10.5281/zenodo.7557009). 5264
10.5281/zenodo.7539484). 5266
10.5281/zenodo.7523390). 5268
10.5281/zenodo.7523390). 5270
10.5281/zenodo.7523390). 5272
odo.7574952). 5274

10.5281/zenodo.7574992). 5276
odo.7523357). 5278
10.5281/zenodo.7523357). 5280
10.5281/zenodo.7504782). 5282
10.5281/zenodo.7504782). 5284
10.5281/zenodo.7504782). 5286
10.5281/zenodo.7499395). 5288
odo.7499395). 5290
10.5281/zenodo.7499395). 5292
10.5281/zenodo.7497450). 5294
10.5281/zenodo.7497450). 5296
10.5281/zenodo.7494862). 5298
odo.7494862). 5300
10.5281/zenodo.7494862). 5302
10.5281/zenodo.7493845). 5304
odo.7493845). 5306
10.5281/zenodo.7493845). 5308
odo.7539484). 5310

odo.7523390). 5312
odo.7523357). 5314
odo.7504782). 5316
odo.7499395). 5318
odo.7497450). 5320
odo.7494862). 5322
odo.7493845). 5324
odo.7480110). 5326
odo.7378758). 5328
odo.6320305). 5330
odo.6677173). 5332

CHAPTER 24 5333
Cancer In Neutrosophic 5334
SuperHyperGraph 5335
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5336
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5337
disease is considered and as the consequences of the model, some parameters are used. The cells 5338
are under attack of this disease but the moves of the cancer in the special region are the matter 5339
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5340
treatments for this Neutrosophic disease. 5341
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5342
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5343
term Neutrosophic function. 5344
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5345
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5346
move from the cancer is identified by this research. Sometimes the move of the cancer 5347
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5348
about the moves and the effects of the cancer on that region; this event leads us to 5349
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5350
perception on what’s happened and what’s done. 5351
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5352
known and they’ve got the names, and some general Neutrosophic models. The moves 5353
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5354
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5355
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5356
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5357
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5358
Models. 5359
Some cells have been faced with some attacks from the situation which is caused by the 5360
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5361
which in that, the cells could be labelled as some groups and some groups or individuals have 5362
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5363
the embedded situations, the individuals of cells and the groups of cells could be considered 5364
247
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5365
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5366
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5367
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5368
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5369
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5370
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5371
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5372
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5373
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5374
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5375
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5376
out what’s going on this phenomenon. The special case of this disease is considered and as the 5377
consequences of the model, some parameters are used. The cells are under attack of this disease 5378
but the moves of the cancer in the special region are the matter of mind. The recognition of 5379
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5380
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5381
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5384
in the forms of alliances’ styles with the formation of the design and the architecture are 5385
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5386
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5387
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5388
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5389
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5390
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5391
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5392
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5393
and what’s done. There are some specific models, which are well-known and they’ve got the 5394
names, and some general models. The moves and the traces of the cancer on the complex tracks 5395
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5396
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5397
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5398
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5399
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5400
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5401
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5402
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5403
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5404
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5406
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5407
based on the fixed groups of cells or the fixed groups of group of cells? 5408
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5409

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5413
Then the research has taken more motivations to define SuperHyperClasses and to find some 5414
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5415
some instances and examples to make clarifications about the framework of this research. The 5416
general results and some results about some connections are some avenues to make key point of 5417
this research, “Cancer’s Recognition”, more understandable and more clear. 5418
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5419
research on the modeling of the regions where are under the attacks of the cancer to 5420
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5421
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5422
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5423
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5424

instances and literature reviews have taken the whole way through. In this scientific research, 5425
the literature reviews have fulfilled the lines containing the notions and the results. The 5426
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5427
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5428
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5429
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5430
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5431
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5432
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5433
to figure out the background for the SuperHyperNotions. 5434

CHAPTER 25 5435
Neutrosophic Connective Dominating 5436
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5437
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5438
2023, (doi: 10.13140/RG.2.2.34953.52320). 5439

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5440
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5441
(doi: 10.13140/RG.2.2.33275.80161). 5442
10.13140/RG.2.2.11050.90569). 5445
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5446
10.13140/RG.2.2.17761.79206). 5448
10.13140/RG.2.2.19911.37285). 5451
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5452
10.13140/RG.2.2.23266.81602). 5454
10.13140/RG.2.2.19360.87048). 5457
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5458
10.13140/RG.2.2.32363.21286). 5460
10.13140/RG.2.2.11758.69441). 5463
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5464
10.13140/RG.2.2.31891.35367). 5466
10.13140/RG.2.2.21510.45125). 5469
251
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5470
10.13140/RG.2.2.13121.84321). 5472

CHAPTER 26 5473
New Ideas In Recognition of Cancer And 5474
Neutrosophic SuperHyperGraph By 5475
Connective Dominating As Hyper Conceit 5476
On Super Con 5477
253
CHAPTER 27 5478
ABSTRACT 5479
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperConnective 5480

Dominating ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Connective Dominating 5481
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5482
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperConnective Dominating 5483
if the following expression is called Neutrosophic e-SuperHyperConnective Dominating criteria holds 5484

Neutrosophic re-SuperHyperConnective Dominating if the following expression is called Neutrosophic 5485
e-SuperHyperConnective Dominating criteria holds 5486

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

v-SuperHyperConnective Dominating if the following expression is called Neutrosophic v- 5488
SuperHyperConnective Dominating criteria holds 5489

Neutrosophic rv-SuperHyperConnective Dominating if the following expression is called Neutrosophic 5490

v-SuperHyperConnective Dominating criteria holds 5491

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Supe- 5492
rHyperConnective Dominating if it’s either of Neutrosophic e-SuperHyperConnective Dominating, Neut- 5493
Neutrosophic rv-SuperHyperConnective Dominating. ((Neutrosophic) SuperHyperConnective Dominat- 5495
ing). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5496
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5497
255
SuperHyperConnective Dominating if it’s either of Neutrosophic e-SuperHyperConnective Dominating, Neut- 5498

Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyperGraph 5500
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 5501
Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 5502
SuperHyperConnective Dominating; a Neutrosophic SuperHyperConnective Dominating if it’s either of 5504

inating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 5507
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperConnective 5510
Dominating; an Extreme SuperHyperConnective Dominating SuperHyperPolynomial if it’s either of 5511
inating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Su- 5514
perHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 5515
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHy- 5516

perSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 5517
SuperHyperVertices such that they form the Extreme SuperHyperConnective Dominating; and the 5518
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperConnective 5519
and Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic SuperHy- 5522
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5523
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5524
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5525
dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 5526
that they form the Neutrosophic SuperHyperConnective Dominating; and the Neutrosophic power is 5527
corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperConnective Dominating if it’s 5528

either of Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re-SuperHyperConnective Dom- 5529
inating, Neutrosophic v-SuperHyperConnective Dominating, and Neutrosophic rv-SuperHyperConnective 5530
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5531
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 5532
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and 5533

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnective Dominating; a 5534
Neutrosophic V-SuperHyperConnective Dominating if it’s either of Neutrosophic e-SuperHyperConnective 5535
Dominating, Neutrosophic re-SuperHyperConnective Dominating, Neutrosophic v-SuperHyperConnective 5536
Dominating, and Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic 5537
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutro- 5538
sophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5539

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 5540
they form the Neutrosophic SuperHyperConnective Dominating; an Extreme V-SuperHyperConnective 5541

and Neutrosophic rv-SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyper- 5544
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 5545
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Su- 5546
perHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 5547
SuperHyperConnective Dominating; and the Extreme power is corresponded to its Extreme coef- 5549
ficient; a Neutrosophic SuperHyperConnective Dominating SuperHyperPolynomial if it’s either of 5550

Neutrosophic v-SuperHyperConnective Dominating, and Neutrosophic rv-SuperHyperConnective Dominat- 5552
ing and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5553
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 5555
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 5556

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5557
SuperHyperConnective Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 5558
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 5559
namely, a SuperHyperConnective Dominating and Neutrosophic SuperHyperConnective Dominating. Two 5560
different types of SuperHyperDefinitions are debut for them but the research goes further 5561
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers 5565
are featured. The definitions are followed by the examples and the instances thus the cla- 5566
rifications are driven with different tools. The applications are figured out to make sense 5567
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 5568
under research to figure out the challenges make sense about ongoing and upcoming research. 5569
The special case is up. The cells are viewed in the deemed ways. There are different types 5570
of them. Some of them are individuals and some of them are well-modeled by the group of 5571
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 5572
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 5573
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 5574
these complex and dense SuperHyperModels open up some avenues to research on theoret- 5575
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 5576
It’s also officially collected in the form of some questions and some problems. Assume a 5577
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperConnective Dominating is 5578
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5579
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5582
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperConnective Dominating is a max- 5583
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5584
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5585
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5586
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 5587
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5588
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperConnective 5589

Dominating . Since there’s more ways to get type-results to make a SuperHyperConnective Dominating 5590
more understandable. For the sake of having Neutrosophic SuperHyperConnective Dominating, there’s 5591
a need to “redefine” the notion of a “SuperHyperConnective Dominating ”. The SuperHyperVertices 5592
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 5593
procedure, there’s the usage of the position of labels to assign to the values. Assume a Supe- 5594
rHyperConnective Dominating . It’s redefined a Neutrosophic SuperHyperConnective Dominating if the 5595
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 5596
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 5597
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 5598
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 5599
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 5600
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 5601
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 5602
based on a SuperHyperConnective Dominating . It’s the main. It’ll be disciplinary to have the 5603
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 5604
SuperHyperConnective Dominating until the SuperHyperConnective Dominating, then it’s officially called a 5605
“SuperHyperConnective Dominating” but otherwise, it isn’t a SuperHyperConnective Dominating . There 5606
are some instances about the clarifications for the main definition titled a “SuperHyperConnective 5607
Dominating ”. These two examples get more scrutiny and discernment since there are characterized 5608
in the disciplinary ways of the SuperHyperClass based on a SuperHyperConnective Dominating . For 5609
the sake of having a Neutrosophic SuperHyperConnective Dominating, there’s a need to “redefine” 5610
the notion of a “Neutrosophic SuperHyperConnective Dominating” and a “Neutrosophic SuperHy- 5611
perConnective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5612
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5613
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 5614
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperConnective 5615
Dominating are redefined to a “Neutrosophic SuperHyperConnective Dominating” if the intended Table 5616
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 5617
ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperConnective Dominating 5618
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 5619
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperConnective 5620

Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyper- 5621
Wheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperConnective Dominating”, 5622
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Super- 5623
HyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 5624
SuperHyperGraph has a “Neutrosophic SuperHyperConnective Dominating” where it’s the strongest 5625
[the maximum Neutrosophic value from all the SuperHyperConnective Dominating amid the maximum 5626
value amid all SuperHyperVertices from a SuperHyperConnective Dominating .] SuperHyperConnective 5627
Dominating . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of 5628
elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 5629
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 5630
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperConnective 5631
Dominating if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s 5632
SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s Supe- 5633
rHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5634
and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s 5635

SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHy- 5636
perEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in 5637
common; it’s a SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5638
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. 5639
The SuperHyperModel proposes the specific designs and the specific architectures. The Super- 5640
HyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In 5641
this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled 5642
as “SuperHyperVertices” and the common and intended properties between “specific” cells and 5643
“specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful 5644
to have some degrees of determinacy, indeterminacy, and neutrality to have more precise Super- 5645
HyperModel which in this case the SuperHyperModel is called “Neutrosophic”. In the future 5646
research, the foundation will be based on the “Cancer’s Recognition” and the results and the 5647
definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term 5648
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5652
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5653
perception on what’s happened and what’s done. There are some specific models, which are 5654
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 5655
moves and the traces of the cancer on the complex tracks and between complicated groups of 5656
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperConnective Dominating, 5657
is to find either the longest SuperHyperConnective Dominating or the strongest SuperHyperConnective 5659
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperConnective Dom- 5660
inating, called SuperHyperConnective Dominating, and the strongest SuperHyperConnective Dominating, 5661
called Neutrosophic SuperHyperConnective Dominating, some general results are introduced. Beyond 5662
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5663
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5664
SuperHyperConnective Dominating. There isn’t any formation of any SuperHyperConnective Dominating 5665
but literarily, it’s the deformation of any SuperHyperConnective Dominating. It, literarily, deforms 5666
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperConnective Dominating 5667
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5668
Keywords: Neutrosophic SuperHyperGraph, SuperHyperConnective Dominating, Cancer’s Neutro- 5669
sophic Recognition 5670


CHAPTER 28 5672
Applied Notions Under The Scrutiny Of 5673
The Motivation Of This Scientific 5674
Research 5675
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5676
try to bring the motivations in the narrative ways. Some cells have been faced with some 5677
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5678
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5679
as some groups and some groups or individuals have excessive labels which all are raised from 5680
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5681
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5682
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5683
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5684
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5685
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5686
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5687
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5688
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5689
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5690
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5691
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5692
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5693
is the disease but the model is going to figure out what’s going on this phenomenon. The 5694
special case of this disease is considered and as the consequences of the model, some parameters 5695
are used. The cells are under attack of this disease but the moves of the cancer in the 5696
special region are the matter of mind. The recognition of the cancer could help to find some 5697
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5698
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5699
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 5700
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 5701
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 5702
the formation of the design and the architecture are formally called “ SuperHyperConnective 5703
Dominating” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 5704
261
theme of the embedded styles to figure out the background for the SuperHyperNotions. The 5705
recognition of the cancer in the long-term function. The specific region has been assigned 5706
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 5707
effects of the cancer on that region; this event leads us to choose another model [it’s said to 5710
be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and 5711

what’s done. There are some specific models, which are well-known and they’ve got the names, 5712
and some general models. The moves and the traces of the cancer on the complex tracks and 5713
between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath (- 5714
/SuperHyperConnective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5715
SuperHyperWheel). The aim is to find either the optimal SuperHyperConnective Dominating or the 5716
Neutrosophic SuperHyperConnective Dominating in those Neutrosophic SuperHyperModels. Some 5717

general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5718
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5719
have at least three SuperHyperEdges to form any style of a SuperHyperConnective Dominating. There 5720
isn’t any formation of any SuperHyperConnective Dominating but literarily, it’s the deformation of 5721
any SuperHyperConnective Dominating. It, literarily, deforms and it doesn’t form. 5722
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find 5723
the “ amount of SuperHyperConnective Dominating” of either individual of cells or the groups of cells 5724
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperConnective 5725
Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5726
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5727
these messy and dense SuperHyperModels where embedded notions are illustrated? 5728
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5729
it motivates us to define different types of “ SuperHyperConnective Dominating” and “Neutrosophic 5730
SuperHyperConnective Dominating” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5731

Then the research has taken more motivations to define SuperHyperClasses and to find some 5732
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5733
some instances and examples to make clarifications about the framework of this research. The 5734
general results and some results about some connections are some avenues to make key point of 5735
this research, “Cancer’s Recognition”, more understandable and more clear. 5736
The framework of this research is as follows. In the beginning, I introduce basic definitions 5737
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5738
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5739
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5740
review literature are applied to make sense about what’s going to figure out about the upcoming 5741
sections. The main definitions and their clarifications alongside some results about new notions, 5742
SuperHyperConnective Dominating and Neutrosophic SuperHyperConnective Dominating, are figured out in 5743
sections “ SuperHyperConnective Dominating” and “Neutrosophic SuperHyperConnective Dominating”. In 5744
the sense of tackling on getting results and in Connective Dominating to make sense about continuing 5745
the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5746
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5747
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5748
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5749

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5750
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5751
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5752
and as concluding and closing section of theoretical research are contained in the section “General 5753
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5754
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5755
“ SuperHyperConnective Dominating”, “Neutrosophic SuperHyperConnective Dominating”, “Results on 5756

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5757
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5758
this research and going to figure out the word “best” as the description and adjective for this 5759
research as presented in section, “ SuperHyperConnective Dominating”. The keyword of this research 5760
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5761
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5762
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5763
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5764
research in the terms of “questions” and “problems” to make sense to figure out this research in 5765
featured style. The advantages and the limitations of this research alongside about what’s done 5766
in this research to make sense and to get sense about what’s figured out are included in the 5767
section, “Conclusion and Closing Remarks”. 5768

CHAPTER 29 5769
Neutrosophic Preliminaries Of This 5770
Scientific Research On the Redeemed 5771
Ways 5772
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5773
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5774

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5775
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5776
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5777
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5778
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5779
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5780

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

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

Let X be a Connective Dominating of points (objects) with generic elements in X denoted by x. A
single valued Neutrosophic set A (SVNS A) is characterized by truth-membership function
TA (x), an indeterminacy-membership function IA (x), and a falsity-membership function FA (x).
For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
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.[HG11s],Definition 5785
2.5,p.2). 5786
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5787
S = (V, E), where 5788
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 5789
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 5792
0
1, 2, . . . , n ); 5793
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5794
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5795

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5824
x, y, z, w ∈ [0, 1]: 5825
(i) 1 ⊗ x = x; 5826
(ii) x ⊗ y = y ⊗ x; 5827
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5828
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5829

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

where 5832

1, 2, . . . , n0 ); 5837
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5838
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5839
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5840
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5841
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5853
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5854
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5855
SuperEdge; 5861
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5864
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5865
makes the patterns and regularities. 5866
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5867
of elements of SuperHyperEdges are the same. 5868

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5869
makes to have SuperHyperUniform more understandable. 5870
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5871
Classes as follows. 5872
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5873
two given SuperHyperEdges with two exceptions; 5874
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5875
SuperHyperEdges; 5876
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5877
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5878
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5879
in common; 5880
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5881
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5882
SuperHyperEdge in common; 5883
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5884
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5885
SuperVertex. 5886
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 5887
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5888
(i) Vi , Vi+1 ∈ Ei0 ; 5889
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5890
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5891
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5892
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5893
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5894
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5895
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5896
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5898
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5899
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5900
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5901
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5902
perPath . 5903
Definition 29.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

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

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5922
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5923
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5924
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperConnective Dominat- 5925

ing). 5926
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutro- 5927
sophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 5928

is called 5929
(i) Neutrosophic e-SuperHyperConnective Dominating if the following expression is called 5930

Neutrosophic e-SuperHyperConnective Dominating criteria holds 5931

(ii) Neutrosophic re-SuperHyperConnective Dominating if the following expression is called 5932

Neutrosophic re-SuperHyperConnective Dominating criteria holds 5933

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 5934
(iii) Neutrosophic v-SuperHyperConnective Dominating if the following expression is called 5935

(iv) Neutrosophic rv-SuperHyperConnective Dominating if the following expression is called 5937

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 5939
(v) Neutrosophic SuperHyperConnective Dominating if it’s either of Neutrosophic e- 5940

inating. 5943

Definition 29.0.19. ((Neutrosophic) SuperHyperConnective Dominating). 5944

(i) an Extreme SuperHyperConnective Dominating if it’s either of Neutrosophic e- 5947

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 5951
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 5952

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnective 5953
Dominating; 5954
(ii) a Neutrosophic SuperHyperConnective Dominating if it’s either of Neutrosophic e- 5955

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 5959

HyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 5960
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 5961
(iii) an Extreme SuperHyperConnective Dominating SuperHyperPolynomial if it’s either 5963

of Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re-SuperHyperConnective 5964
Dominating, Neutrosophic v-SuperHyperConnective Dominating, and Neutrosophic rv- 5965
SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyperGraph 5966

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 5967
cients defined as the Extreme number of the maximum Extreme cardinality of the 5968
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5969
form the Extreme SuperHyperConnective Dominating; and the Extreme power is corresponded 5971
(iv) a Neutrosophic SuperHyperConnective Dominating SuperHyperPolynomial 5973

SuperHyperConnective Dominating, Neutrosophic v-SuperHyperConnective Dominating, and Neut- 5975
rosophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic SuperHy- 5976
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5977
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 5978

S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neut- 5980
rosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperConnective 5981
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 5982
(v) an Extreme V-SuperHyperConnective Dominating if it’s either of Neutrosophic e- 5983


Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 5987

the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme Su- 5988
perHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5989
(vi) a Neutrosophic V-SuperHyperConnective Dominating if it’s either of Neutrosophic e- 5991


(vii) an Extreme V-SuperHyperConnective Dominating SuperHyperPolynomial if 5999

it’s either of Neutrosophic e-SuperHyperConnective Dominating, Neutrosophic re- 6000
sophic rv-SuperHyperConnective Dominating and C(N SHG) for an Extreme SuperHyperGraph 6002

the Extreme SuperHyperConnective Dominating; and the Extreme power is corresponded to its 6007
Extreme coefficient; 6008
(viii) a Neutrosophic SuperHyperConnective Dominating SuperHyperPolynomial 6009

sophic rv-SuperHyperConnective Dominating and C(N SHG) for a Neutrosophic SuperHyper- 6012
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutro- 6013
sophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 6014
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 6015
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 6016
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperConnective 6017
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 6018
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperConnective Dominating). 6019

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6020
(i) an δ−SuperHyperConnective Dominating is a Neutrosophic kind of Neutrosophic SuperHy- 6021
perConnective Dominating such that either of the following expressions hold for the Neutrosophic 6022
cardinalities of SuperHyperNeighbors of s ∈ S : 6023
|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 6024
(29.1), holds if S is an δ−SuperHyperDefensive; 6025


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

136TBL4
(ii) a Neutrosophic δ−SuperHyperConnective Dominating is a Neutrosophic kind of Neut- 6026

rosophic SuperHyperConnective Dominating such that either of the following Neutrosophic 6027
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6028
|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 6029

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6030
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6032
there’s the usage of the position of labels to assign to the values. 6034
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6036
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6037
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6038
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 6040
sophic SuperHyperPath , SuperHyperConnective Dominating, SuperHyperStar, SuperHyperBipart- 6041
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 6042
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 6043
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 6044
perHyperWheel if the Table (29.2) holds. 6045


136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperConnective Dominating. 6046

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperConnective Dominating 6047
more Neutrosophicly understandable. 6048
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperConnective Dominating”. The 6050
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 6051
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 6052
6053
136DEF1 Definition 29.0.23. Assume a SuperHyperConnective Dominating. It’s redefined a Neutrosophic 6054
SuperHyperConnective Dominating if the Table (29.3) holds. 6055

CHAPTER 30 6056
Neutrosophic SuperHyper But As Connective Dominating 6057
Super Forms 6059
Definition 30.0.1. (Neutrosophic event). 6060
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6061
is a probability Connective Dominating. Any Neutrosophic k-subset of A of V is called Neutrosophic 6062
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 6063
following expression is called Neutrosophic probability of A. 6064
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6065

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

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6072
a probability Connective Dominating. Any k-function Connective Dominating like E is called Neutrosophic 6073
k-Variable. If k = 2, then any 2-function Connective Dominating like E is called Neutrosophic 6074
Variable. 6075
The notion of independent on Neutrosophic Variable is likewise. 6076
Definition 30.0.4. (Neutrosophic Expectation). 6077
277
is a probability Connective Dominating. A Neutrosophic k-Variable E has a number is called 6079

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6080
criteria 6081
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6082
is a probability Connective Dominating. A Neutrosophic number is called Neutrosophic Crossing 6084
if the following expression is called Neutrosophic Crossing criteria 6085
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). 6086
Consider S = (V, E) is a probability Connective Dominating. Let m and n propose special Connective 6087
Dominating. Then with m ≥ 4n, 6088
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 Connective Dominating p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 6089
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
6090
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6091
the plane, and let l be the Neutrosophic number√of SuperHyperLines in the plane passing through 6093
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6094
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 6095

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

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

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6113
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6114
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6115
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6116
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6117
4/3 4/3
k < 4n + n < 5n . 6118
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6119
Consider S = (V, E) is a probability Connective Dominating. Let X be a nonnegative Neutrosophic 6120
Variable and t a positive real number. Then 6121
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. 6122
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6123
Consider S = (V, E) is a probability Connective Dominating. Let Xn be a nonnegative integer-valued 6124
variable in a probability Connective Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 6125

P (Xn = 0) → 1 as n → ∞. 6126
Proof. 6127
Consider S = (V, E) is a probability Connective Dominating. A special SuperHyperGraph in Gn,p 6129
almost surely has stability number at most d2p−1 log ne. 6130

S = (V, E) is a probability Connective Dominating. A special SuperHyperGraph in Gn,p is up. Let 6132
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 6133
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 6134
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 6135
of the Neutrosophic SuperHyperGraph G. 6136
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6137
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6138
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 6139
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6140
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: 6141
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6142
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 6143
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6144
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6145
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6146
Definition 30.0.12. (Neutrosophic Variance). 6147
is a probability Connective Dominating. A Neutrosophic k-Variable E has a number is called 6149
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6150
criteria 6151
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Connective Dominating. Let X be a Neutrosophic Variable and 6153
let t be a positive real number. Then 6154
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Connective Dominating. Let X be a Neutrosophic Variable and let t be a 6156
positive real number. Then 6157
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6158
Consider S = (V, E) is a probability Connective Dominating. Let Xn be a Neutrosophic Variable in a 6160

probability Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 6161
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 6163
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6164
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6165
Consider S = (V, E) is a probability Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6167
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 6168
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6169
S = (V, E) is a probability Connective Dominating. As in the proof of related Theorem, the result is 6171
Consider S = (V, E) is a probability Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be as 6174
defined in previous Theorem. Then either: 6175
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6176
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6177
Definition 30.0.17. (Neutrosophic Threshold). 6180
is a probability Connective Dominating. Let P be a monotone property of SuperHyperGraphs (one 6182
which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for 6183
P is a function f (n) such that: 6184
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6185
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6186

Definition 30.0.18. (Neutrosophic Balanced). 6187

is a probability Connective Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6189
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6190
SubSuperHyperGraph is called Neutrosophic Balanced. 6191
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6192

(V, E). Consider S = (V, E) is a probability Connective Dominating. Let F be a nonempty 6193
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6194
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6195
SubSuperHyperGraph. 6196
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6199
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6200
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6201

SuperHyperConnective Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6202
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6203
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6204

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6205
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6206
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6207
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6208
Neutrosophic SuperHyperConnective Dominating. 6209
C(N SHG)Neutrosophic Connective Dominating =

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

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

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

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

Dominating. 6219

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


{}.
= 0z 0 .
{}.



= 0z 0 .
6224


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






{E2 }.
= z 6−c .
{V5 }.
= z 7−c .
6232


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



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


{E15 , E16 , E17 }.
= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
6240




{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
6244


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


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


{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
6252







{E1 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
6256


{E1 }.


= z 5−a .
{V1 , V2 , V3 , V7 , V8 }.
= z 5−a .
6260


{E9 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
6264




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


{E3i+1 }1i=0 .


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


{E3i+1 }1i=0 .


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


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







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


{E3i+1 }3i=0 .



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


{E6 }.
= z 4−a .
{V1 }.


= z 6−a .
6292


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


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

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


Neutrosophic SuperHyperConnective Dominating in the Neutrosophic Example (42.0.3) 95NHG2
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6303
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6304
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6305
of them. 6306
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6307
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6308
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6309
Neutrosophic quasi-R-Connective Dominating minus all Neutrosophic SuperHypeNeighbor to some of 6310
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6311
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6312
quasi-R-Connective Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6313
all of them. 6314
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-Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Connective Dominating is at 6315
least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6316
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6317
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6318
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Connective 6319

Dominating in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 6320
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6321
SuperHyperVertices are contained in a Neutrosophic R-Connective Dominating. 6322
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Connective Dominating has, the least Neutrosophic cardinality,
the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic cardinality
of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Connective Dominating with the least Neutrosophic cardinality, 6323
the lower sharp Neutrosophic bound for cardinality. 6324
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6325

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

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ConnectiveDominatingSuperHyperP 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-Connective Dominating since
neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more
than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us
consider the Neutrosophic SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic
SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet

of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

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

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-Connective Dominating. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Connective Dominating is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types
but the SuperHyperStable is only up in this quasi-R-Connective Dominating. It’s the contradiction
to that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Connective Dominating decorates the Neutrosophic
SuperHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic
style implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutro-
sophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower
Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHy-
perVertices have perfect Neutrosophic connections inside each of SuperHyperEdges and the
outside of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of
the used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from
the fact that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the
targeted Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore,
the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Connective Dominating. Since at least two Neutrosophic Supe-
rHyperVertices involve to make a title in the Neutrosophic background of the Neutrosophic

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

SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the Neutrosophic
version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious
Neutrosophic SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Neutrosophic adjective for the initial
Neutrosophic SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neut-
rosophic version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph
is said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting.
With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one
Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Connective Dominating has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Connective
Dominating has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge. Assume a
Neutrosophic SuperHyperSet V \V \{z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic
R-Connective Dominating since either the Neutrosophic SuperHyperGraph is an obvious Neutrosophic
SuperHyperModel thus it never happens since there’s no Neutrosophic usage of this Neutro-
sophic framework and even more there’s no Neutrosophic connection inside or the Neutrosophic
SuperHyperGraph isn’t obvious and as its consequences, there’s a Neutrosophic contradiction
with the term “Neutrosophic R-Connective Dominating” since the maximum Neutrosophic cardinality
never happens for this Neutrosophic style of the Neutrosophic SuperHyperSet and beyond that
there’s no Neutrosophic connection inside as mentioned in first Neutrosophic case in the forms
of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Connective Dominating is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet

But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic
term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic
SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes
a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum

and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet
Has the maximum Neutrosophic cardinality such that
Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices
Is a Neutrosophic R-Connective Dominating for the Neutrosophic SuperHyperGraph as used

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common
theme of the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses
of the Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Connective Dominating.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Connective Dominating. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Connective Dominating is
{aE , bE , cE , . . . , zE } .

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

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

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

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

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

fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Connective Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s not
unique. To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If a
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Connective Domin- 6332
atingis at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6333
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Super- 6334
HyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6335
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6336
to Neutrosophic Connective Dominating in some cases but the maximum number of the Neutrosophic 6337
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6338
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Connective Dominating. 6339
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6340
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6341

the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6342
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6343
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6344
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6345
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6346
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6347
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6348

SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6349
Neutrosophic quasi-R-Connective Dominating where the Neutrosophic completion of the Neutrosophic 6350
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Connective Dominating. The 6351
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6352
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHy- 6353
perCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6354
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6355
timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6356
minimum Neutrosophic style of the embedded Neutrosophic R-Connective Dominating. The interior 6357
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6358
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6359
common connections, more precise and more formal, the perfect unique connections inside the 6360
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose 6361
the Neutrosophic R-Connective Dominating. Thus Neutrosophic exterior SuperHyperVertices could be 6362
used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6363
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6364
embedded Neutrosophic Connective Dominating, there’s the usage of exterior Neutrosophic SuperHy- 6365
perVertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6366
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6367
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one 6368
SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the 6369
Neutrosophic R-Connective Dominating. The Neutrosophic R-Connective Dominating with the exclusion of 6370
the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and 6371
with other terms, the Neutrosophic R-Connective Dominating with the inclusion of all Neutrosophic 6372
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Connective 6373
Dominating. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6374
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6375
the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of 6376
any given Neutrosophic quasi-R-Connective Dominating minus all Neutrosophic SuperHypeNeighbor 6377
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6378
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices 6379
in an Neutrosophic quasi-R-Connective Dominating, minus all Neutrosophic SuperHypeNeighbor to 6380
some of them but not all of them. 6381
The main definition of the Neutrosophic R-Connective Dominating has two titles. a Neut- 6382
rosophic quasi-R-Connective Dominating and its corresponded quasi-maximum Neutrosophic R- 6383

SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 6384
ber, there’s a Neutrosophic quasi-R-Connective Dominating with that quasi-maximum Neutrosophic 6385
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 6386
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 6387

lead us to take the collection of all the Neutrosophic quasi-R-Connective Dominatings for all Neut- 6388
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 6389
of the Neutrosophic Connective Dominating ends up but this essence starts up in the terms of the 6390
Neutrosophic quasi-R-Connective Dominating, again and more in the operations of collecting all the 6391
Neutrosophic quasi-R-Connective Dominatings acted on the all possible used formations of the Neut- 6392
rosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic number is 6393
considered as the equivalence class for all corresponded quasi-R-Connective Dominatings. Let 6394
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Connective Dominating be a Neutro- 6395
sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Connective Dominating. Then 6396
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Connective Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Connective Dominating is re-formalized 6397
and redefined as follows. 6398
GNeutrosophic Connective Dominating ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6399
definition for the Neutrosophic Connective Dominating. 6400
GNeutrosophic Connective Dominating =

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic Connective 6401
poses the upcoming expressions.
Dominating 6402

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


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

= max zNeutrosophic Number

And then, 6404


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


6406

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

6407



6408


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6409
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6410
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6411
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Connective 6412
Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Connective Dominating” since 6413
“Neutrosophic Quasi-Connective Dominating” happens “Neutrosophic Connective Dominating” in a Neut- 6414
rosophic SuperHyperGraph as initial framework and background but “Neutrosophic Super- 6415
HyperNeighborhood” may not happens “Neutrosophic Connective Dominating” in a Neutrosophic 6416
SuperHyperGraph as initial framework and preliminarily background since there are some am- 6417
biguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, 6418
the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Connective Dominating”, 6419
and “Neutrosophic Connective Dominating” are up. 6420
Thus, let 6421
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6422
GNeutrosophic Connective Dominating be a Neutrosophic number, a Neutrosophic SuperHyperNeigh- 6423
borhood and a Neutrosophic Connective Dominating and the new terms are up. 6424
GNeutrosophic Connective Dominating ∈ ∪zNeutrosophic Number

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

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


∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |

6427

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


6429

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6430


6431



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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Connective Dominating C(ESHG) for an Neutrosophic SuperHyperGraph

ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Connective Dominating is related to the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Connective Dominating is up. The obvious simple
Neutrosophic type-SuperHyperSet called the Neutrosophic Connective Dominating is a Neutrosophic
SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the Neutrosophic
SuperHyperSet of Neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Connective Dominating is up. To sum them
up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

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

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Connective Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Connective Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Connective

Dominating, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6432
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6433
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6434
type-SuperHyperSet called the 6435
“Neutrosophic R-Connective Dominating” 6436
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6437
Neutrosophic R-Connective Dominating, 6438
is only and only

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

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

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Connective Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Connective Dominating is the cardinality of
6439
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6440
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Connective Dominating 6441

if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6442
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6443
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6444
them. 6445
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6446
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6447

all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6448
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6449
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6450
Consider there’s a Neutrosophic R-Connective Dominating with the least cardinality, the lower 6451
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6452
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6453
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6454
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6455
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Connective Dominating. Since it doesn’t 6456
have 6457
6458
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6459

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6460
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6461
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6462
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Connective 6463
Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6464
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6465

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6466
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6467
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6468
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6469
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6470
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6471
obvious Neutrosophic R-Connective Dominating, VESHE is up. The obvious simple Neutrosophic 6472
type-SuperHyperSet of the Neutrosophic R-Connective Dominating, VESHE , is a Neutrosophic Super- 6473
HyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6474
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6475
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6476
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6477
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6478

a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6479
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6480
R-Connective Dominating only contains all interior Neutrosophic SuperHyperVertices and all exterior 6481
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6482
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6483
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6484

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6485
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6486
The SuperHyperNotion, namely, Connective Dominating, is up. There’s neither empty SuperHy- 6487
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6488
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6489
Neutrosophic Connective Dominating. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6490


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

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


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

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

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6500
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6501
Neutrosophic Connective Dominating is up. The obvious simple Neutrosophic type-SuperHyperSet 6502
called the Neutrosophic Connective Dominating is a Neutrosophic SuperHyperSet includes only two 6503
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6504
SuperHyperEdges[SuperHyperVertices], 6505

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- 6506
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6507
Connective Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6508
SuperHyperEdges[SuperHyperVertices], 6509

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 Con- 6510

nective Dominating. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6511

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

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6514
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6515
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Connective Dominating and 6516
it’s an Neutrosophic Connective Dominating. Since it’s 6517

6518
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6520
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6521
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6522
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6523

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

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 Connective 6525

Dominating , not: 6526

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

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- 6528
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6529
Neutrosophic type-SuperHyperSet called the 6530
“Neutrosophic Connective Dominating ” 6531
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6532
Neutrosophic Connective Dominating , 6533
is only and only 6534

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

CHAPTER 31 6536
The Neutrosophic Departures on The 6537
Theoretical Results Toward Theoretical 6538
Motivations 6539
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6540
Neutrosophic SuperHyperClasses. 6541
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6542

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

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

6549
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6550
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6551
SuperHyperModel (31.1), is the SuperHyperConnective Dominating. 6552
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6553

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


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

6560
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6561
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6562
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperConnective Dominating. 6563

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

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

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 6565
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6566
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

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

6571
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6572
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6573
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6574
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6575
the Neutrosophic SuperHyperConnective Dominating. 6576
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6577

Then 6578

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
=z 2i+2 i=0 .
Proof. Let 6579
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6580
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). 6581

are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6587
P :

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperConnective Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnective Dominating taken from a connected Neutrosophic SuperHyperBi- 6589

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

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6597
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6599

Then 6600

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
=z 2i+2 i=0 .
Proof. Let 6601
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6602
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperConnective Dominating taken from a connected Neutrosophic SuperHyper- 6603
Multipartite ESHM : (V, E). There’s a new way to redefine as 6604

are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6609
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6611
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6612
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6616
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6617
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6618
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6619
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperConnective Dominating. 6620
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6621

Then, 6622

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 6623
P :
CEN T ER, E2∗
6624
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperConnective Dominating taken from a connected Neutrosophic SuperHyper- 6625

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

Then there’s at least one SuperHyperConnective Dominating. Thus the notion of quasi isn’t up and 6629
the SuperHyperNotions based on SuperHyperConnective Dominating could be applied. The unique 6630
embedded SuperHyperConnective Dominating proposes some longest SuperHyperConnective Dominating 6631
excerpt from some representatives. The latter is straightforward. 6632
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6633
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6634
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6635
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6636
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnective Dominating. 6637

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6638
The Surveys of Mathematical Sets On 6639
The Results But As The Initial Motivation 6640
For the SuperHyperConnective Dominating, Neutrosophic SuperHyperConnective Dominating, and the 6641
Neutrosophic SuperHyperConnective Dominating, some general results are introduced. 6642
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperConnective Dominating is “redefined” 6643
on the positions of the alphabets. 6644
Corollary 32.0.2. Assume Neutrosophic SuperHyperConnective Dominating. Then 6645
N eutrosophic SuperHyperConnectiveDominating =
{theSuperHyperConnectiveDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperConnectiveDominating
|N eutrosophiccardinalityamidthoseSuperHyperConnectiveDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6646
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6647
the neutrality, for i = 1, 2, 3, respectively. 6648
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6649
alphabet. Then the notion of Neutrosophic SuperHyperConnective Dominating and SuperHyperConnective 6650
Dominating coincide. 6651
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6652
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6653
SuperHyperConnective Dominating if and only if it’s a SuperHyperConnective Dominating. 6654
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6655
of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 6656
SuperHyperConnective Dominating if and only if it’s a longest SuperHyperConnective Dominating. 6657
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6658
identical letter of the alphabet. Then its Neutrosophic SuperHyperConnective Dominating is its 6659
SuperHyperConnective Dominating and reversely. 6660
331
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperConnective Dominating, 6661

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6662
identical letter of the alphabet. Then its Neutrosophic SuperHyperConnective Dominating is its 6663
SuperHyperConnective Dominating and reversely. 6664
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic Super- 6665
HyperConnective Dominating isn’t well-defined if and only if its SuperHyperConnective Dominating isn’t 6666
well-defined. 6667
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6668

Neutrosophic SuperHyperConnective Dominating isn’t well-defined if and only if its SuperHyperConnective 6669
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6672

Neutrosophic SuperHyperConnective Dominating isn’t well-defined if and only if its SuperHyperConnective 6673
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6675
perConnective Dominating is well-defined if and only if its SuperHyperConnective Dominating is well-defined. 6676
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6677

Neutrosophic SuperHyperConnective Dominating is well-defined if and only if its SuperHyperConnective 6678

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6681
Neutrosophic SuperHyperConnective Dominating is well-defined if and only if its SuperHyperConnective 6682

Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6684
(i) : the dual SuperHyperDefensive SuperHyperConnective Dominating; 6685
(ii) : the strong dual SuperHyperDefensive SuperHyperConnective Dominating; 6686
(iii) : the connected dual SuperHyperDefensive SuperHyperConnective Dominating; 6687
(iv) : the δ-dual SuperHyperDefensive SuperHyperConnective Dominating; 6688
(v) : the strong δ-dual SuperHyperDefensive SuperHyperConnective Dominating; 6689
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperConnective Dominating. 6690
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6691
(iii) : the connected defensive SuperHyperDefensive SuperHyperConnective Dominating; 6694

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

independent SuperHyperSet is 6699
(iii) : the connected SuperHyperDefensive SuperHyperConnective Dominating; 6702
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6706

Graph which is a SuperHyperConnective Dominating/SuperHyperPath. Then V is a maximal 6707
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperConnective Dominating; 6711
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperConnective Dominating; 6712
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperConnective Dominating; 6713
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6715
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6716
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperConnective Dominating; 6720
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperConnective Dominating; 6721
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperConnective Dominating; 6722
Graph which is a SuperHyperConnective Dominating/SuperHyperPath. Then the number of 6725

(i) : the SuperHyperConnective Dominating; 6726
(ii) : the SuperHyperConnective Dominating; 6727
(iii) : the connected SuperHyperConnective Dominating; 6728
(iv) : the O(ESHG)-SuperHyperConnective Dominating; 6729
(v) : the strong O(ESHG)-SuperHyperConnective Dominating; 6730
(vi) : the connected O(ESHG)-SuperHyperConnective Dominating. 6731
coincide. 6733

Graph which is a SuperHyperWheel. Then the number of 6735
(i) : the dual SuperHyperConnective Dominating; 6736
(ii) : the dual SuperHyperConnective Dominating; 6737
(iii) : the dual connected SuperHyperConnective Dominating; 6738
(iv) : the dual O(ESHG)-SuperHyperConnective Dominating; 6739
(v) : the strong dual O(ESHG)-SuperHyperConnective Dominating; 6740
(vi) : the connected dual O(ESHG)-SuperHyperConnective Dominating. 6741
coincide. 6743
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6744

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6756
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6757
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6758
SuperHyperPart is a 6759
(iv) : δ-SuperHyperDefensive SuperHyperConnective Dominating; 6763
(v) : strong δ-SuperHyperDefensive SuperHyperConnective Dominating; 6764
(vi) : connected δ-SuperHyperDefensive SuperHyperConnective Dominating. 6765
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6767

plete SuperHyperMultipartite. Then Then the number of 6768
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6775
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6776
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6778
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6779
(iv) : SuperHyperConnective Dominating; 6783

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6786
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6787
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6788
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6789

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6797
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6798
of dual 6799
(iv) : 0-SuperHyperDefensive SuperHyperConnective Dominating; 6803

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6807

SuperHyperConnective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6809
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6810
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperConnective Dominating; 6814
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperConnective Dominating; 6815
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperConnective Dominating. 6816


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


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

a dual SuperHyperDefensive SuperHyperConnective Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 6832
(i) v ∈ Ns (x); 6833
(ii) vx ∈ E. 6834
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6835

a dual SuperHyperDefensive SuperHyperConnective Dominating, then 6836
(i) S is SuperHyperConnective Dominating set; 6837
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6838
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6839
(i) Γ ≤ O; 6840
(ii) Γs ≤ On . 6841
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6842
connected. Then 6843
(i) Γ ≤ O − 1; 6844
(ii) Γs ≤ On − Σ3i=1 σi (x). 6845
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6846

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6850
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6851
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6853
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperConnective Dominating; 6854
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6855
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6856
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6857
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperConnective Dominating. Then 6859
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperConnective 6860

Dominating; 6861
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6862
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6863
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6864
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperConnective Dominating. Then 6866

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6870
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6871
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6873
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperConnective Dominating; 6874
(ii) Γ = 1; 6875
(iii) Γs = Σ3i=1 σi (c); 6876
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperConnective Dominating. 6877
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6878

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6879
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6881
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6882
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6883
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6885
b n c+1
2
Dominating; 6887
(ii) Γ = b n2 c + 1; 6888

b n c+1 ; 6889
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperConnective 6890
Dominating. 6891
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6892
bnc
2
Dominating; 6894
(ii) Γ = b n2 c; 6895

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

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6900
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperConnective 6901

Dominating for N SHF; 6902
(ii) Γ = m for N SHF : (V, E); 6903
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6904
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperConnective 6905
Dominating for N SHF : (V, E). 6906
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6907
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6908

b n c+1
is a dual maximal SuperHyperDefensive SuperHy- 6909
perConnective Dominating for N SHF; 6910
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6911

b n c+1 for N SHF : (V, E); 6912
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperConnective Dominating 6913
for N SHF : (V, E). 6914
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6915

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6916
bnc
Dominating for N SHF : (V, E); 6918
(ii) Γ = b n2 c for N SHF : (V, E); 6919

bnc for N SHF : (V, E); 6920
S={vi }i=1
bnc
2
are only dual maximal SuperHyperConnective Dominating for 6921
N SHF : (V, E). 6922
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6925

SuperHyperConnective Dominating, then S is an s-SuperHyperDefensive SuperHyperConnective 6926
Dominating; 6927

SuperHyperConnective Dominating, then S is a dual s-SuperHyperDefensive SuperHyperConnective 6929
Dominating. 6930
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6933
SuperHyperConnective Dominating, then S is an s-SuperHyperPowerful SuperHyperConnective 6934

Dominating; 6935

SuperHyperConnective Dominating, then S is a dual s-SuperHyperPowerful SuperHyperConnective 6937
Dominating. 6938
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6939

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHy- 6981
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6983

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

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


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

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

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


CHAPTER 33 6999
Neutrosophic Applications in Cancer’s 7000
Neutrosophic Recognition 7001
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7002
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7003
disease is considered and as the consequences of the model, some parameters are used. The cells 7004
are under attack of this disease but the moves of the cancer in the special region are the matter 7005
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7006
treatments for this Neutrosophic disease. 7007
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7008
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7009
term Neutrosophic function. 7010
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7011
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7012
move from the cancer is identified by this research. Sometimes the move of the cancer 7013
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 7014
about the moves and the effects of the cancer on that region; this event leads us to 7015
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7016
perception on what’s happened and what’s done. 7017
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7018
known and they’ve got the names, and some general Neutrosophic models. The 7019
moves and the Neutrosophic traces of the cancer on the complex tracks and between 7020
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 7021
/SuperHyperConnective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 7022
tipartite, SuperHyperWheel). The aim is to find either the Neutrosophic SuperHy- 7023
perConnective Dominating or the Neutrosophic SuperHyperConnective Dominating in those Neutro- 7024
sophic Neutrosophic SuperHyperModels. 7025
343
CHAPTER 34 7026
Case 1: The Initial Neutrosophic Steps 7027
Toward Neutrosophic 7028
SuperHyperBipartite as Neutrosophic 7029
SuperHyperModel 7030
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7031
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7032
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7033
perBipartite is obtained. 7034
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7035
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7036
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7037
(34.1), is the Neutrosophic SuperHyperConnective Dominating. 7038

CHAPTER 35 7039
Case 2: The Increasing Neutrosophic 7040
Steps Toward Neutrosophic 7041
SuperHyperMultipartite as 7042
Neutrosophic SuperHyperModel 7043
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7044
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7045
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7046
perMultipartite is obtained. 7047
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7048
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

347
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7050
Neutrosophic SuperHyperConnective Dominating. 7051

CHAPTER 36 7052
Wondering Open Problems But As The 7053
Directions To Forming The Motivations 7054
In what follows, some “problems” and some “questions” are proposed. 7055
The SuperHyperConnective Dominating and the Neutrosophic SuperHyperConnective Dominating are 7056
defined on a real-world application, titled “Cancer’s Recognitions”. 7057
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7058
recognitions? 7059
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperConnective Dominating 7060
and the Neutrosophic SuperHyperConnective Dominating? 7061
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7062
them? 7063
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperConnective 7064
and the Neutrosophic SuperHyperConnective Dominating?
Dominating 7065
Problem 36.0.5. The SuperHyperConnective Dominating and the Neutrosophic SuperHyperConnective 7066
Dominatingdo a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHy- 7067
perConnective Dominating, are there else? 7068
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7069
Numbers types-results? 7070
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7071
the multiple types of SuperHyperNotions? 7072
349
CHAPTER 37 7073
Conclusion and Closing Remarks 7074
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7075
research are illustrated. Some benefits and some advantages of this research are highlighted. 7076
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 7077
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperConnective Dominating. 7078
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 7079
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 7080
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperConnective Dominating, 7081
finds the convenient background to implement some results based on that. Some SuperHy- 7082
perClasses and some Neutrosophic SuperHyperClasses are the cases of this research on the 7083
modeling of the regions where are under the attacks of the cancer to recognize this disease as 7084
it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHy- 7085
perNotion, SuperHyperConnective Dominating, the new SuperHyperClasses and SuperHyperClasses, 7086
are introduced. Some general results are gathered in the section on the SuperHyperConnective 7087
Dominating and the Neutrosophic SuperHyperConnective Dominating. The clarifications, instances and 7088
literature reviews have taken the whole way through. In this research, the literature reviews 7089
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 7090
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 7091
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 7094
longest and strongest styles with the formation of the design and the architecture are formally 7095
called “ SuperHyperConnective Dominating” in the themes of jargons and buzzwords. The prefix 7096
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 7097
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 7098
pointed out and spoken out. 7099
351
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperConnective Dominating
3. Neutrosophic SuperHyperConnective Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7100
Neutrosophic SuperHyperDuality But As 7101
Super Forms 7103
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7104

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7106
or E 0 is called 7107
(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7108

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

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

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

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7115
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7116

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7117
sophic rv-SuperHyperDuality. 7118
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7119

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7124
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7125
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7126
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7127
353
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7129

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7131
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7132
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7133
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7134
form the Neutrosophic SuperHyperDuality; 7135
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7136
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7137

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7138
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7139
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7140
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7141
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7143
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7145

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7147
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7148
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7149
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7150
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7153
coefficient; 7154
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7155

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7157
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7158
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7159
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7160
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7162

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7163
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7164
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7165
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7166
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7167
that they form the Neutrosophic SuperHyperDuality; 7168
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7169

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7170
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7171

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7173
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7176
power is corresponded to its Extreme coefficient; 7177
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7178

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7180

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7183
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7186
coefficient. 7187
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7188
the mentioned Neutrosophic Figures in every Neutrosophic items. 7189

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7191
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7192
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7193
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7194
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7195
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7196
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7197
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 7201
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7202
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7203
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7204
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7205

every given Neutrosophic SuperHyperDuality. 7206




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7266
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 7268


the Neutrosophic SuperHyperDuality. 7277
Then 7279
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 7280
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7286
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7289

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7290
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7299

(V, E). Then 7300

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 7301
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7302


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

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

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7318
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7319
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7320
Then, 7321
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 7322
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 7323


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7328
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7329
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7335

CHAPTER 39 7336
Neutrosophic SuperHyperJoin But As 7337
Super Forms 7339
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7340

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7344
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7346

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

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7351

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7352
|Vj |NEUTROSOPHIC CARDINALITY ; 7353
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7354

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7355
rv-SuperHyperJoin. 7356
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7357

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

367

Extreme SuperHyperJoin; 7366
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7367

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7369
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7370
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7371
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7372
Neutrosophic SuperHyperJoin; 7373
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7374

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7375
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7376
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7381
coefficient; 7382
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7383

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7384
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7385
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7386
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7387
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7389

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7390
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7391
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7392

Extreme SuperHyperJoin; 7398
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7399

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7401
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7402
Neutrosophic SuperHyperJoin; 7405

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7406

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7408

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7413
its Extreme coefficient; 7414
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7415

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7417
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7418

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7419
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7423
coefficient. 7424
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7428

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7429

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7494

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7503
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 7505


the Neutrosophic SuperHyperJoin. 7514
Then 7516
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 7517
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 7523
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7525

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


(V, E). Then 7536

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7538


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

Then, 7556

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

.
Proof. Let 7557
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7558


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7562
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7563
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7564
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7569

CHAPTER 40 7570
Neutrosophic SuperHyperPerfect But As 7571
Super Forms 7573
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7574

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7585
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7586

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7587
rv-SuperHyperPerfect. 7588
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7589

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7594
381
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7599

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7601
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7602
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7603
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7604
form the Neutrosophic SuperHyperPerfect; 7605
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7606

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7607
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7608
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7611
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7615

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7617
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7620
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7623
coefficient; 7624
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7625

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7633
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7634
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7635
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7636
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7637
that they form the Neutrosophic SuperHyperPerfect; 7638
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7639

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7641

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7644
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7648

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7650
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7653

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7656
coefficient. 7657

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

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7727
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 7729
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7747
Then 7749
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 7750
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 7754
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7755
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7756
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7759

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

(V, E). Then 7770

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7793


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7796
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7797
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7798
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7799
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7805

CHAPTER 41 7806
Neutrosophic SuperHyperTotal But As 7807
Super Forms 7809
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7810

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7814

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7817
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7818

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7821
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7822

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7823
rv-SuperHyperTotal. 7824
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7825

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7830
Extreme SuperHyperTotal; 7834
395
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7835

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7837
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7838
Neutrosophic SuperHyperTotal; 7841
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7842
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7843

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7844
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7849
coefficient; 7850
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7851
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7852

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7853
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7854
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7855
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7858
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7859
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7860

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

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7869
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7870
Neutrosophic SuperHyperTotal; 7873
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7874

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

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7881
its Extreme coefficient; 7882
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7883
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7884

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7885
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7886
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7887
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7888
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7889
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7890
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7891

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

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7961
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 7963
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. 7970
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 7972


the Neutrosophic SuperHyperTotal. 7981
Then 7983
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 7984
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7990
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7992

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8003

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8005


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8010
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. 8021
Then, 8023
∗
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 8024
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8025


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8029
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8030
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8031
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8037

CHAPTER 42 8038
Neutrosophic SuperHyperConnected But 8039
As The Extensions Excerpt From Dense 8040
And Super Forms 8041
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8042

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8046
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8047
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8048

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8049
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8050
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8051

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

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 8054
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8055
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8056
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8057
rosophic rv-SuperHyperConnected. 8058
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8059

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

8062
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8063
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8064
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 8065
409
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 8066
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 8067
form the Extreme SuperHyperConnected; 8068
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8069

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8070
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8071
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8072
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8073
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8074

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8075
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8076
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8077

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8078
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8079
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8080
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8085

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8086
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8087
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8088
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8090
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8091

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8092
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8093
Neutrosophic coefficient; 8094
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8095

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8097
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8098
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8099
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8100
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8101
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8102

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8104
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8105
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8106
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8107
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8108

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8109

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8112
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8113

and the Extreme power is corresponded to its Extreme coefficient; 8117
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8118

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8121
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8123
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8124

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8125
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8126
Neutrosophic coefficient. 8127
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8130
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8131
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8133
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8134

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8135
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8136
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8137
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. 8145


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 8189
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. 8196
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 8198
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. 8205
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 8207



the Neutrosophic SuperHyperConnected. 8216
Then 8218
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 8219
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 8224
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8225
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8228

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8239
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 8240
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8241


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8245
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8246
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8247
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. 8258
Then, 8260
∗
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 8261
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8262


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8265
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8266
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8267
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8268
some representatives. The latter is straightforward. 8269
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8274

CHAPTER 43 8275
Background 8276
423



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Cir- 8346
cumstances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. 8347
[HG12] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 8348
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act 8350
on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry 8351

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


SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 8357
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 8358
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 8359
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 8360
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 8361
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 8362

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 8363
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 8364
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 8365
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 8366
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 8367
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 8368

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

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

in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 8381
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 8382
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 8383
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 8384
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 8385
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 8386
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 8387
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 8388
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 8389
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 8390
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 8391
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 8392
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 8395
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 8396
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 8397
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 8398
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 8399
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 8400
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 8401

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

perGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concern- 8403
ing SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in 8404
Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to 8405
Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutro- 8406
sophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; 8407
HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; 8408
HG266; HG267; HG268; HG269; HG270; HG271], there are some endeavors to formalize 8427
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 8428
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8429



HG267; HG268; HG269; HG270; HG271; HG272; HG273] alongside scientific re- 8480
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 8481


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

Bibliography 8497
10.33140/JMTCM.01.03.09) 8520
429



10.20944/preprints202301.0282.v1). 8536

10.20944/preprints202301.0267.v1). 8539

(doi: 10.20944/preprints202301.0265.v1). 8544
prints202301.0262.v1). 8548
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8554

prints202301.0105.v1). 8557

Preprints 2023, 2023010044 8563
10.20944/preprints202301.0043.v1). 8566

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

(doi: 10.20944/preprints202212.0500.v1). 8582
10.5281/zenodo.8025707). 8591

10.5281/zenodo.8027275). 8594
odo.8017246). 8597
10.5281/zenodo.8020128). 8600
odo.7978571). 8603

10.5281/zenodo.7978857). 8606
10.5281/zenodo.7940830). 8609
10.5281/zenodo.7943578). 8612
odo.7916595). 8615
odo.7923632). 8618
(doi: 10.5281/zenodo.7904698). 8621
2023, (doi: 10.5281/zenodo.7904671). 8624
10.5281/zenodo.7871026). 8633
2023, (doi: 10.5281/zenodo.7874647). 8636
10.5281/zenodo.7857856). 8639
2023, (doi: 10.5281/zenodo.7857841). 8642

10.5281/zenodo.7853867). 8651
10.5281/zenodo.7853922). 8654
(doi: 10.5281/zenodo.7851519). 8657
(doi: 10.5281/zenodo.7851550). 8660
10.5281/zenodo.7834229). 8669
10.5281/zenodo.7834261). 8672
10.5281/zenodo.7824560). 8675
(doi: 10.5281/zenodo.7824623). 8678

2023, (doi: 10.5281/zenodo.7809365). 8689

2023, (doi: 10.5281/zenodo.7809358). 8692
10.5281/zenodo.7809219). 8695
10.5281/zenodo.7809328). 8698

2023, (doi: 10.5281/zenodo.7806767). 8701
2023, (doi: 10.5281/zenodo.7806838). 8704
10.5281/zenodo.7799902). 8713
(doi: 10.5281/zenodo.7804218). 8716
(doi: 10.5281/zenodo.7796334). 8719

10.5281/zenodo.7791952). 8725
10.5281/zenodo.7791982). 8728
10.5281/zenodo.7790026). 8731
10.5281/zenodo.7790052). 8734
2023, (doi: 10.5281/zenodo.7787066). 8737
10.5281/zenodo.7781476). 8743
10.5281/zenodo.7783082). 8746
10.5281/zenodo.7777857). 8749
10.5281/zenodo.7779286). 8752
(doi: 10.5281/zenodo.7771831). 8755
2023, (doi: 10.5281/zenodo.7772468). 8758

10.13140/RG.2.2.20913.25446). 8761
odo.7764916). 8764
10.13140/RG.2.2.11770.98247). 8767
10.13140/RG.2.2.12400.12808). 8770
2023, (doi: 10.13140/RG.2.2.22545.10089). 8773
10.13140/RG.2.2.11377.76644). 8779
10.13140/RG.2.2.23750.96329). 8782
10.13140/RG.2.2.31366.24641). 8785
10.13140/RG.2.2.34721.68960). 8788
2023, (doi: 10.13140/RG.2.2.30212.81289). 8791
10.13140/RG.2.2.24288.35842). 8797

10.13140/RG.2.2.32467.25124). 8800
10.13140/RG.2.2.31025.45925). 8803
10.13140/RG.2.2.17184.25602). 8806
10.13140/RG.2.2.23423.28327). 8809
10.13140/RG.2.2.28456.44805). 8812
10.13140/RG.2.2.23525.68320). 8815
10.13140/RG.2.2.20170.24000). 8818
10.13140/RG.2.2.36475.59683). 8821
10.13140/RG.2.2.29764.71046). 8824
2023, (doi: 10.13140/RG.2.2.18780.87683). 8827
10.13140/RG.2.2.26134.01603). 8833
10.13140/RG.2.2.27392.30721). 8836

10.13140/RG.2.2.33028.40321). 8839
10.13140/RG.2.2.21389.20966). 8842
10.13140/RG.2.2.16356.04489). 8845
10.13140/RG.2.2.21756.21129). 8848
10.13140/RG.2.2.30983.68009). 8851
10.13140/RG.2.2.28552.29445). 8854
(doi: 10.13140/RG.2.2.10936.21761). 8857
10.13140/RG.2.2.35105.89447). 8860
(doi: 10.13140/RG.2.2.30072.72960). 8863
10.13140/RG.2.2.31147.52003). 8866
10.13140/RG.2.2.32825.24163). 8869
10.13140/RG.2.2.13059.58401). 8872
10.13140/RG.2.2.11172.14720). 8875

2023, (doi: 10.13140/RG.2.2.22011.80165). 8878
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8881
2023, (doi: 10.13140/RG.2.2.10493.84962). 8884
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8887
2023, (doi: 10.13140/RG.2.2.19944.14086). 8890
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8893
(doi: 10.13140/RG.2.2.33103.76968). 8896
(doi: 10.13140/RG.2.2.23037.44003). 8899
(doi: 10.13140/RG.2.2.35646.56641). 8902
10.13140/RG.2.2.18030.48967). 8905
(doi: 10.13140/RG.2.2.13973.81121). 8908
2023, (doi: 10.13140/RG.2.2.34106.47047). 8911

2023, (doi: 10.13140/RG.2.2.31956.88961). 8917
2023, (doi: 10.13140/RG.2.2.15179.67361). 8920
10.13140/RG.2.2.21510.45125). 8923
2023, (doi: 10.13140/RG.2.2.13121.84321). 8926
10.13140/RG.2.2.11758.69441). 8929
2023, (doi: 10.13140/RG.2.2.31891.35367). 8932
10.13140/RG.2.2.19360.87048). 8935
10.13140/RG.2.2.32363.21286). 8938
10.13140/RG.2.2.23266.81602). 8941
10.13140/RG.2.2.19911.37285). 8944
10.13140/RG.2.2.11050.90569). 8947
2023, (doi: 10.13140/RG.2.2.17761.79206). 8950

ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8956
(doi: 10.13140/RG.2.2.30182.50241). 8959
2023, (doi: 10.13140/RG.2.2.17252.24968). 8992


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

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



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

10.20944/preprints202301.0282.v1). 9025
10.20944/preprints202301.0267.v1).). 9028


(doi: 10.20944/preprints202301.0265.v1). 9033
prints202301.0262.v1). 9037

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

10.13140/RG.2.2.35061.65767). 9046
10.13140/RG.2.2.18494.15680). 9050
10.13140/RG.2.2.32530.73922). 9054
10.13140/RG.2.2.15897.70243). 9058

10.13140/RG.2.2.32530.73922). 9062
prints202301.0105.v1). 9065

10.13140/RG.2.2.23172.19849). 9072
10.13140/RG.2.2.17385.36968). 9082
Preprints 2023, 2023010044 9085
10.20944/preprints202301.0043.v1). 9088

2023, (doi: 10.13140/RG.2.2.28945.92007). 9091
10.13140/RG.2.2.35774.77123). 9097

10.13140/RG.2.2.29430.88642). 9103

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

10.13140/RG.2.2.19380.94084). 9112
(doi: 10.20944/preprints202212.0500.v1). 9123
10.13140/RG.2.2.20993.12640). 9126


10.13140/RG.2.2.29173.86244). 9141

(doi: 10.5281/zenodo.8027488). 9146
10.5281/zenodo.8020181). 9148
10.5281/zenodo.7978921). 9150
odo.7943878). 9152
10.5281/zenodo.7943871). 9154
10.5281/zenodo.7923786). 9156
2023 (doi: 10.5281/zenodo.7905287). 9158

2023 (doi: 10.5281/zenodo.7874677). 9162
(doi: 10.5281/zenodo.7857906). 9164
2023 (doi: 10.5281/zenodo.7856329). 9166
10.5281/zenodo.7854561). 9168
2023 (doi: 10.5281/zenodo.7851893). 9170

(doi: 10.5281/zenodo.7835063). 9174
(doi: 10.5281/zenodo.7826705). 9176
2023 (doi: 10.5281/zenodo.7820680). 9178
10.5281/zenodo.7812750). 9180



2023 (doi: 10.5281/zenodo.7807782). 9186
2023 (doi: 10.5281/zenodo.7804449). 9188

(doi: 10.5281/zenodo.7792307). 9192
(doi: 10.5281/zenodo.7790728). 9194
2023 (doi: 10.5281/zenodo.7787712). 9196
10.5281/zenodo.7783791). 9198
10.5281/zenodo.7780123). 9200
(doi: 10.5281/zenodo.7773119). 9202
odo.7637762). 9204
10.5281/zenodo.7766174). 9206
10.5281/zenodo.7762232). 9208
(doi: 10.5281/zenodo.7758601). 9210
10.5281/zenodo.7754661). 9212
10.5281/zenodo.7750995) . 9214
(doi: 10.5281/zenodo.7749875). 9216

10.5281/zenodo.7747236). 9218
10.5281/zenodo.7742587). 9220
(doi: 10.5281/zenodo.7738635). 9222
10.5281/zenodo.7734719). 9224
10.5281/zenodo.7730484). 9226
(doi: 10.5281/zenodo.7730469). 9228
10.5281/zenodo.7722865). 9230
odo.7713563). 9232
odo.7709116). 9234
10.5281/zenodo.7706415). 9236
10.5281/zenodo.7706063). 9238
10.5281/zenodo.7701906). 9240
odo.7700205). 9242
10.5281/zenodo.7694876). 9244
10.5281/zenodo.7679410). 9246
10.5281/zenodo.7675982). 9248
10.5281/zenodo.7672388). 9250
odo.7668648). 9252

10.5281/zenodo.7662810). 9254
10.5281/zenodo.7659162). 9256
odo.7653233). 9258
odo.7653204). 9260
odo.7653142). 9262
odo.7653117). 9264
odo.7651687). 9267
odo.7651619). 9269
odo.7651439). 9271
odo.7650729). 9273
odo.7647868). 9275
odo.7647017). 9277
odo.7644894). 9279
odo.7632923). 9282
odo.7623459). 9284
10.5281/zenodo.7606416). 9286

10.5281/zenodo.7606416). 9288
odo.7606404). 9290
10.5281/zenodo.7580018). 9292
odo.7580018). 9294
odo.7580018). 9296
odo.7579929). 9298
10.5281/zenodo.7563170). 9300
odo.7563164). 9302
odo.7563160). 9304
odo.7563160). 9306
10.5281/zenodo.7563160). 9308
10.5281/zenodo.7557063). 9310
10.5281/zenodo.7557009). 9312
10.5281/zenodo.7539484). 9314
10.5281/zenodo.7523390). 9316
10.5281/zenodo.7523390). 9318
10.5281/zenodo.7523390). 9320
odo.7574952). 9322

10.5281/zenodo.7574992). 9324
odo.7523357). 9326
10.5281/zenodo.7523357). 9328
10.5281/zenodo.7504782). 9330
10.5281/zenodo.7504782). 9332
10.5281/zenodo.7504782). 9334
10.5281/zenodo.7499395). 9336
odo.7499395). 9338
10.5281/zenodo.7499395). 9340
10.5281/zenodo.7497450). 9342
10.5281/zenodo.7497450). 9344
10.5281/zenodo.7494862). 9346
odo.7494862). 9348
10.5281/zenodo.7494862). 9350
10.5281/zenodo.7493845). 9352
odo.7493845). 9354
10.5281/zenodo.7493845). 9356
odo.7539484). 9358

odo.7523390). 9360
odo.7523357). 9362
odo.7504782). 9364
odo.7499395). 9366
odo.7497450). 9368
odo.7494862). 9370
odo.7493845). 9372
odo.7480110). 9374
odo.7378758). 9376
odo.6320305). 9378
odo.6677173). 9380

CHAPTER 44 9381
Books’ Contributions 9382
“Books’ Contributions”: | Featured Threads 9383

The following references are cited by chapters. 9384
9385
[Ref274] 9386
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating In 9387
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 9388
odo.8051360). 9389
9390
[Ref275] 9391
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9392
Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 10.5281/zen- 9393
odo.8051346). 9394
9395
The links to the contributions of this scientific research book are listed below. 9396
[HG274] 9397
odo.8051360). 9400
9401
[TITLE] “New Ideas On Super Con By Hyper Conceit Of Connective Dominating In 9402
Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9403

9404
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9405
https://www.researchgate.net/publication/371667111 9406
9407
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9408
https://www.scribd.com/document/653686499 9409
9410
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9411
https://zenodo.org/record/8051360 9412
9413
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9414
https://www.academia.edu/103489763 9415
453
Figure 44.1: [HG274] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.8051360).
9416
[ADDRESSED CITATION] 9417
odo.8051360). 9420
[ASSIGNED NUMBER] #274 Article 9421
[DATE] June 2023 9422

[DOI] 10.5281/zenodo.8051360 9423
[LICENSE] CC BY-NC-ND 4.0 9424
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9425
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9426
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9427
9428
[HG275] 9429
odo.8051346). 9432
9433
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9434

Connective Dominating As Hyper Conceit On Super Con” 9435
9436
https://www.researchgate.net/publication/371667103 9438
9439
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9440

(doi: 10.5281/zenodo.8051360).
(doi: 10.5281/zenodo.8051360).

Figure 44.4: [HG275] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023,
(doi: 10.5281/zenodo.8051346).
https://www.scribd.com/document/653684939 9441
9442
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9443
9445
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9446
https://www.academia.edu/103489459 9447
9448
odo.8051346). 9452
[ASSIGNED NUMBER] #275 Article 9453
[DATE] June 2023 9454
[DOI] 10.5281/zenodo.8051346 9455
[LICENSE] CC BY-NC-ND 4.0 9456

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9457
[AVAILABLE AT TWITTER’S IDS] 9458
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9459
googlebooks GooglePlay 9460
9461
[ASSIGNED NUMBER] | Book #177 9462

HG177b
Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9464
10.5281/zenodo.8051368). 9465

(doi: 10.5281/zenodo.8051346).
(doi: 10.5281/zenodo.8051346).

[TITLE] Connective Dominating In SuperHyperGraphs 9466

#Latest_Updates 9467
#The_Links 9468
9472
9474
#The_Links 9475
9476
[ASSIGNED NUMBER] | Book #177 9477

9478
[TITLE] Connective Dominating In SuperHyperGraphs 9479
9480
9484
– 9485
9486
[PUBLISHER] 9487
(Paperback): https://www.amazon.com/dp/- 9488
(Hardcover): https://www.amazon.com/dp/- 9489

(Kindle Edition): https://www.amazon.com/dp/- 9490
9491
– 9492
9493
[ISBN] 9494
(Paperback): - 9495
(Hardcover): - 9496
(Kindle Edition): CC BY-NC-ND 4.0 9497
(EBook): CC BY-NC-ND 4.0 9498
9499
– 9500
9501
[PRINT LENGTH] 9502
(Paperback): - pages 9503
(Hardcover): - pages 9504
(Kindle Edition): - pages 9505
(E-Book): - pages 9506
9507
– 9508
9509
9511

#The_Links 9512
9513
https://www.researchgate.net/publication/- 9515
9516
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9517
https://drhenrygarrett.wordpress.com/2023/07/22/ 9518
Connective-Dominating-In-SuperHyperGraphs/ 9519
9520
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9521
https://www.scribd.com/document/- 9522
9523
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9524
https://www.academia.edu/- 9525
9526
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9527
9529
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9530
https://books.google.com/books/about?id=- 9531
9532
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9533
https://play.google.com/store/books/details?id=- 9534

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9535

9536
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9537
9538
https://drhenrygarrett.wordpress.com/2023/07/22/ 9539
Connective-Dominating-In-SuperHyperGraphs/ 9540
9541
– 9542
9543
[POSTED BY] Dr. Henry Garrett 9544
9545
[DATE] June 017, 2023 9546

9547
[POSTED IN] 177 | Connective Dominating In SuperHyperGraphs 9548
9549
[TAGS] 9550
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9551
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9552
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9553
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9554
neutrosophic SuperHyperGraphs, Neutrosophic Connective Dominating In SuperHyperGraphs, 9555
Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real- 9556
World Applications, Recent Research, Recognitions, Research, scientific research Article, 9557
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9558
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Su- 9559

perHyperGraph Theory, SuperHyperGraphs, Connective Dominating In SuperHyperGraphs, 9560
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9561
In this scientific research book, there are some scientific research chapters on “Extreme 9562
Connective Dominating In SuperHyperGraphs” and “Neutrosophic Connective Dominating In 9563
SuperHyperGraphs” about some scientific research on Connective Dominating In SuperHyper- 9564
Graphs by two (Extreme/Neutrosophic) notions, namely, Extreme Connective Dominating In 9565

SuperHyperGraphs and Neutrosophic Connective Dominating In SuperHyperGraphs. With 9566
scientific research on the basic scientific research properties, the scientific research book 9567
starts to make Extreme Connective Dominating In SuperHyperGraphs theory and Neutro- 9568
sophic Connective Dominating In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9569
understandable. 9570

HG177b1.png
Figure 44.7: [HG177b] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr.

Henry Garrett, 2023 (doi: 10.5281/zenodo.8051368).

HG177b2.png


HG177b3.png


CHAPTER 45 9571
“SuperHyperGraph-Based Books”: | 9572
Featured Tweets 9573
“SuperHyperGraph-Based Books”: | Featured Tweets 9574
465
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 9575
CV 9576
493
9577
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
9578
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)
9579
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

9580

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

9581
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

9582
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

9583
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

9584
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

9585
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).
9586
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

9587
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

9588
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

9589
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

9590
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

9591
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

9592
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

9593
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

9594
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

9595
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

9596
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).
9597
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

9598

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

9599
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

9600

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: -
9601
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

9602
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).
9603
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
9604
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
9605
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
9606
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).
9607
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

9608
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).
9609
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”,

9610
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).
9611
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).
9612
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
9613
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).
9614

(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).
9615
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).
9616
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7820680).
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9617
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9618
[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

9619
[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

9620
[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

9621
[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

9622
[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

9623
[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

9624
[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

9625
[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

9626
[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

9627
[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

9628
[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

9629
[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

9630
[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

9631
[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

9632
[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

9633
[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

9634
[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

9635
[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

9636
[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

9637
[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

9638
[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

9639
[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

9640
[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

9641
[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

9642
[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
9643
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

9644
[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

9645
[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

9646
[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

9647
[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

9648
[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
9649
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

9650
“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

9651
[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
9652
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

9653
[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

9654
[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

9655
[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

9656
[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

9657
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

9658
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
9659
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
9660
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

9661
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

9662
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
-
9663
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

9664
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9665
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
9666
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
9667
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

9668
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
9669
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
...
9670
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/
9671
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
9672
9673
9674
Henry Garrett
01/23/2022
9675
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
9676
View publication stats

Connective Dominating in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Connective Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Connective Dominating In SuperHyperGraphs

Book · June 2023

489 PUBLICATIONS 19,204 CITATIONS

Featured Articles 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

5 Extreme Connective Dominating 47

6 New Ideas On Super Con By Hyper Conceit Of Connective Dominating

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 SuperHyperConnective Dominating But As The Extensions Excerpt

11 The Extreme Departures on The Theoretical Results Toward Theoretical

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

13 Extreme Applications in Cancer’s Extreme Recognition 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 247

25 Neutrosophic Connective Dominating 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 SuperHyperConnective Dominating But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

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

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 343

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 351

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 453

45 “SuperHyperGraph-Based Books”: | Featured Tweets 465

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

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

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 466

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.17“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 480