Matrix-Based in SuperHyperGraphs

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

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

Matrix-Based 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 Matrix-Based 47
6 New Ideas On Super mat By Hyper matte Of Matrix-Based In Cancer’s

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

Scientific Research 57
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61
10 Extreme SuperHyperMatrix-Based But As The Extensions Excerpt From

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

Motivations 119
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 131
13 Extreme Applications in Cancer’s Extreme Recognition 143
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

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

Motivations 149
17 Conclusion and Closing Remarks 151
18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 223
Bibliography 229
24 Cancer In Neutrosophic SuperHyperGraph 253
25 Neutrosophic Matrix-Based 257
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Matrix-Based As Hyper mat On Super matte 259
27 ABSTRACT 261
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 271

30 Neutrosophic SuperHyperMatrix-Based But As The Extensions Excerpt

From Dense And Super Forms 283
31 The Neutrosophic Departures on The Theoretical Results Toward

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

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

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

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

Motivations 359
37 Conclusion and Closing Remarks 361
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 419
43 Background 433
Bibliography 439
44 Books’ Contributions 463
45 “SuperHyperGraph-Based Books”: | Featured Tweets 475
46 CV 503

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

SuperHyperMatrix-Based 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

SuperHyperMatrix-Based in the Example (42.0.5) . . . . . . . . . . . . . . . . . . . . 121
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 SuperHyperMatrix-Based in the Example (42.0.11) . . . . . . . . . . . . . . . 126
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperMatrix-Based in the Extreme Example (42.0.15) . . . . . . . . . 129
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperMatrix-Based . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.3) . . . . 289


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 SuperHyperMatrix-Based in the Neutrosophic Example (42.0.7) . . . . . 332
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.9) . . . . . 334
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperMatrix-Based in the Example (42.0.11) . . . . . . 336
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.15) 339
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic


35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7978857). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 464
10.5281/zenodo.7978857). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465
10.5281/zenodo.7978857). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi:
10.5281/zenodo.7978571). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 466
10.5281/zenodo.7978571). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 467
10.5281/zenodo.7978571). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 467
44.7 [HG174b] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7978921). . . . . . . . . . . . . . . . . . . . . . 471
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 476

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 477
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 478
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 484



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

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 148
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 152

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 356

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 358
37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 362
xi
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme Matrix- 1
Based In SuperHyperGraphs” and “Neutrosophic Matrix-Based In SuperHyperGraphs” about 2
some scientific research on Matrix-Based In SuperHyperGraphs by two (Extreme/Neutrosophic) 3

notions, namely, Extreme Matrix-Based In SuperHyperGraphs and Neutrosophic Matrix-Based 4
In SuperHyperGraphs. With scientific research on the basic scientific research properties, the 5
scientific research book starts to make Extreme Matrix-Based In SuperHyperGraphs theory and 6
Neutrosophic Matrix-Based In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 7
understandable. 8
9
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 10
Notions, namely, a Matrix-Based In SuperHyperGraphs and Neutrosophic Matrix-Based In 11
SuperHyperGraphs . Two different types of SuperHyperDefinitions are debut for them but 12
the scientific research goes further and the SuperHyperNotion, SuperHyperUniform, and 13
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 δ−Matrix-Based In SuperHyperGraphs 29
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 30
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 31
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 32
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 33
1
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−Matrix-Based 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

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

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

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

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

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

SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 76
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 77
Table holds. A SuperHyperGraph has a “Neutrosophic Matrix-Based In SuperHyperGraphs” 78
where it’s the strongest [the maximum Neutrosophic value from all the Matrix-Based In 79

SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a Matrix-Based 80
In SuperHyperGraphs .] Matrix-Based In SuperHyperGraphs . A graph is a SuperHyper- 81
Uniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are 82
the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 83
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 84
SuperHyperEdges with two exceptions; it’s Matrix-Based In SuperHyperGraphs if it’s only one 85
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 86
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 87
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 88
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 89
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 90
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 91
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 92
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 93
the specific designs and the specific architectures. The SuperHyperModel is officially called 94
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 95
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 96
and the common and intended properties between “specific” cells and “specific group” of 97
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 98

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

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

Recognition 125
AMS Subject Classification: 05C17, 05C22, 05E45 126
127
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 128
Notion, namely, Neutrosophic Matrix-Based In SuperHyperGraphs . Two different types of 129
SuperHyperDefinitions are debut for them but the scientific research goes further and the 130
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 131

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

|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 156
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 157
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 158
version of Matrix-Based In SuperHyperGraphs . Since there’s more ways to get type-results 159
to make Matrix-Based In SuperHyperGraphs more understandable. For the sake of having 160
Neutrosophic Matrix-Based In SuperHyperGraphs, there’s a need to “redefine” the notion of 161
“Matrix-Based In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are 162
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of 163
the position of labels to assign to the values. Assume a Matrix-Based In SuperHyperGraphs . 164
It’s redefined Neutrosophic Matrix-Based In SuperHyperGraphs if the mentioned Table holds, 165
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 166
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 167
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 168
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 169
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 170

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

sophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 190
Table holds. Thus SuperHyperPath, Matrix-Based In SuperHyperGraphs, SuperHyperStar, 191
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 192
SuperHyperPath”, “Neutrosophic Matrix-Based In SuperHyperGraphs”, “Neutrosophic Super- 193
HyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 194
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has 195
“Neutrosophic Matrix-Based In SuperHyperGraphs” where it’s the strongest [the maximum 196
Neutrosophic value from all Matrix-Based In SuperHyperGraphs amid the maximum value 197
amid all SuperHyperVertices from a Matrix-Based In SuperHyperGraphs .] Matrix-Based 198
In SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph and the 199
number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHy- 200
perGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only 201
one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 202
Matrix-Based In SuperHyperGraphs if it’s only one SuperVertex as intersection amid two 203
given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid 204
all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 205
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 206
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 207
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 208
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 209
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 210
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 211
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 212
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 213
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 214
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 215
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 216

and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 217
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 218
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 219
ways. The Neutrosophic recognition of the cancer in the long-term function. The specific 220
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 221
the move from the cancer is identified by this research. Sometimes the move of the cancer 222
about the moves and the effects of the cancer on that region; this event leads us to choose 224
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 225
on what’s happened and what’s done. There are some specific models, which are well-known 226
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 227
could be fantasized by a Neutrosophic SuperHyperPath(-/Matrix-Based In SuperHyperGraphs, 229

is to find either the longest Matrix-Based In SuperHyperGraphs or the strongest Matrix-Based 231
In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest Matrix-Based 232
In SuperHyperGraphs, called Matrix-Based In SuperHyperGraphs, and the strongest Matrix- 233
Based In SuperHyperGraphs, called Neutrosophic Matrix-Based In SuperHyperGraphs, some 234
general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths 235
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 236
SuperHyperEdges to form any style of a Matrix-Based In SuperHyperGraphs. There isn’t any 237
formation of any Matrix-Based In SuperHyperGraphs but literarily, it’s the deformation of 238
any Matrix-Based In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A basic 239
familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 240
proposed. 241
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Matrix-Based In SuperHyper- 242
Graphs, Cancer’s Neutrosophic Recognition 243

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

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

[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 274
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 275
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 276




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

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

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

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

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

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

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

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

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

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

HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; HG116; 405
HG263; HG264; HG265; HG266; HG267; HG268; HG269], there are some endeavors to 420
formalize the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyper- 421
Graph alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 422
HG65b; HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; 423
HG95b; HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; 426
HG104b; HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; 427


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

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


HG169b; HG170b; HG171b; HG172b; HG173b; HG174b]. Two popular scientific re- 486
search books in Scribd in the terms of high readers, 4331 and 5327 respectively, on neutrosophic 487
science is on [HG32b; HG44b]. 488

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

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

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

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

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

By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 598
(doi: 10.5281/zenodo.7904698). 599
HG262 [32] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 600
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 601
2023, (doi: 10.5281/zenodo.7904671). 602
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 604
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 605
HG260 [34] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 606
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 607
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 608
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 610
10.5281/zenodo.7871026). 611
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 613
2023, (doi: 10.5281/zenodo.7874647). 614
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 616
10.5281/zenodo.7857856). 617
HG256 [38] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 618
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 619
2023, (doi: 10.5281/zenodo.7857841). 620
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 622
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 625
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 628
10.5281/zenodo.7853867). 629
HG252 [42] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 630
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 631
10.5281/zenodo.7853922). 632
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 634
(doi: 10.5281/zenodo.7851519). 635

HG250 [44] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 636
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 637
(doi: 10.5281/zenodo.7851550). 638
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 640
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 643
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 646
10.5281/zenodo.7834229). 647
HG246 [48] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 648
10.5281/zenodo.7834261). 650
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 652
10.5281/zenodo.7824560). 653
HG244 [50] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 654
(doi: 10.5281/zenodo.7824623). 656
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 658
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 661
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 664
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 666
2023, (doi: 10.5281/zenodo.7809365). 667
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 669
2023, (doi: 10.5281/zenodo.7809358). 670
HG238 [56] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 671
10.5281/zenodo.7809219). 673

Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 675
10.5281/zenodo.7809328). 676
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 678
2023, (doi: 10.5281/zenodo.7806767). 679
HG235 [59] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 680
2023, (doi: 10.5281/zenodo.7806838). 682
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 684
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 685
HG233 [61] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 686
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 687
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 688
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 690
10.5281/zenodo.7799902). 691
HG231 [63] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 692
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 693
(doi: 10.5281/zenodo.7804218). 694
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 696
(doi: 10.5281/zenodo.7796334). 697
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 699
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 702
10.5281/zenodo.7791952). 703
HG225 [67] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 704
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 705
10.5281/zenodo.7791982). 706
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 708
10.5281/zenodo.7790026). 709
HG223 [69] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 710
10.5281/zenodo.7790052). 712

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 714
2023, (doi: 10.5281/zenodo.7787066). 715
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 717
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 718
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 720
10.5281/zenodo.7781476). 721
HG219 [73] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 722
10.5281/zenodo.7783082). 724
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 726
10.5281/zenodo.7777857). 727
HG217 [75] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 728
10.5281/zenodo.7779286). 730
HG215 [76] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 731
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 732
(doi: 10.5281/zenodo.7771831). 733
HG214 [77] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 734
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 735
2023, (doi: 10.5281/zenodo.7772468). 736
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 738
10.13140/RG.2.2.20913.25446). 739
HG212 [79] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 740
odo.7764916). 742
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 744
10.13140/RG.2.2.11770.98247). 745
HG210 [81] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 746
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 747
10.13140/RG.2.2.12400.12808). 748
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 750
2023, (doi: 10.13140/RG.2.2.22545.10089). 751

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 753
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 754
HG207 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 755
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.11377.76644). 757
HG206 [85] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 758
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 759
10.13140/RG.2.2.23750.96329). 760
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 762
10.13140/RG.2.2.31366.24641). 763
HG204 [87] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 764
10.13140/RG.2.2.34721.68960). 766
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 768
2023, (doi: 10.13140/RG.2.2.30212.81289). 769
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 771
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 774
10.13140/RG.2.2.24288.35842). 775
HG200 [91] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 776
10.13140/RG.2.2.32467.25124). 778
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 780
10.13140/RG.2.2.31025.45925). 781
HG198 [93] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 782
10.13140/RG.2.2.17184.25602). 784
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 786
10.13140/RG.2.2.23423.28327). 787
HG196 [95] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 788
10.13140/RG.2.2.28456.44805). 790

Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 792
10.13140/RG.2.2.23525.68320). 793
HG194 [97] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 794
10.13140/RG.2.2.20170.24000). 796
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 798
10.13140/RG.2.2.36475.59683). 799
HG192 [99] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 800
10.13140/RG.2.2.29764.71046). 802
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 804
2023, (doi: 10.13140/RG.2.2.18780.87683). 805
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 807
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 810
10.13140/RG.2.2.26134.01603). 811
HG188 [103] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 812
10.13140/RG.2.2.27392.30721). 814
HG187 [104] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 815
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 816
10.13140/RG.2.2.33028.40321). 817
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 819
10.13140/RG.2.2.21389.20966). 820
HG185 [106] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 821
10.13140/RG.2.2.16356.04489). 823
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 825
10.13140/RG.2.2.21756.21129). 826
HG183 [108] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 827
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 828
10.13140/RG.2.2.30983.68009). 829

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 831
10.13140/RG.2.2.28552.29445). 832
HG181 [110] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 833
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 834
(doi: 10.13140/RG.2.2.10936.21761). 835
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 837
10.13140/RG.2.2.35105.89447). 838
HG179 [112] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 839
(doi: 10.13140/RG.2.2.30072.72960). 841
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 843
10.13140/RG.2.2.31147.52003). 844
HG177 [114] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 845
10.13140/RG.2.2.32825.24163). 847
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 849
10.13140/RG.2.2.13059.58401). 850
HG175 [116] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 851
10.13140/RG.2.2.11172.14720). 853
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 855
2023, (doi: 10.13140/RG.2.2.22011.80165). 856
HG173 [118] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 857
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 858
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 859
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 861
2023, (doi: 10.13140/RG.2.2.10493.84962). 862
HG171 [120] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 863
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 865
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 867
2023, (doi: 10.13140/RG.2.2.19944.14086). 868

HG169 [122] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 869
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 871
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 873
(doi: 10.13140/RG.2.2.33103.76968). 874
HG167 [124] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 875
(doi: 10.13140/RG.2.2.23037.44003). 877
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 879
(doi: 10.13140/RG.2.2.35646.56641). 880
HG165 [126] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 881
10.13140/RG.2.2.18030.48967). 883
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 885
(doi: 10.13140/RG.2.2.13973.81121). 886
HG163 [128] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 887
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 888
2023, (doi: 10.13140/RG.2.2.34106.47047). 889
HG162 [129] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 890
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 891
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 894
2023, (doi: 10.13140/RG.2.2.31956.88961). 895
HG160 [131] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 896
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 897
2023, (doi: 10.13140/RG.2.2.15179.67361). 898
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.21510.45125). 901
HG158 [133] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 902
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 903
2023, (doi: 10.13140/RG.2.2.13121.84321). 904
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 906
10.13140/RG.2.2.11758.69441). 907

HG156 [135] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 908
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 909
2023, (doi: 10.13140/RG.2.2.31891.35367). 910
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 912
10.13140/RG.2.2.19360.87048). 913
HG154 [137] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 914
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 915
10.13140/RG.2.2.32363.21286). 916
HG153 [138] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 917
10.13140/RG.2.2.23266.81602). 919
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 921
10.13140/RG.2.2.19911.37285). 922
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 924
10.13140/RG.2.2.11050.90569). 925
HG150 [141] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 926
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 927
2023, (doi: 10.13140/RG.2.2.17761.79206). 928
HG149 [142] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 929
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 930
HG148 [143] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 932
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 933
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 934
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 936
(doi: 10.13140/RG.2.2.30182.50241). 937
HG146 [145] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 938
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 939
HG145 [146] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 941
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 942
HG144 [147] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 944
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 945
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 946

HG143 [148] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 947
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 948
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 949
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 952
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 955
HG140 [151] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 956
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 957
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 958
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 961
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 964
HG137 [154] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 965
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 966

HG136 [155] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 968
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 969
2023, (doi: 10.13140/RG.2.2.17252.24968). 970
HG135 [156] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 971
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 972
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 973
HG134 [157] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 974
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 975
HG132 [158] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 977
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 978

2023010396 (doi: 10.20944/preprints202301.0396.v1). 979
HG131 [159] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 980
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 981
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 982
HG130 [160] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 983
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 984
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 985
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 986

HG129 [161] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 987

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 988
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 989
HG128 [162] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 991
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 992
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 993
HG127 [163] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 994
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 995
2023,(doi: 10.13140/RG.2.2.36745.93289). 996
HG126 [164] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 997

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

10.20944/preprints202301.0282.v1). 1003
HG124 [166] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1004

10.20944/preprints202301.0267.v1).). 1006

(doi: 10.20944/preprints202301.0265.v1). 1011
HG122 [168] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1012
prints202301.0262.v1). 1015


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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1023
10.13140/RG.2.2.35061.65767). 1024

HG25 [172] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1025
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1026
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1027
10.13140/RG.2.2.18494.15680). 1028
HG26 [173] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1029
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1030
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1031
10.13140/RG.2.2.32530.73922). 1032
HG27 [174] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1033
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1034
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1035
10.13140/RG.2.2.15897.70243). 1036

10.13140/RG.2.2.32530.73922). 1040
prints202301.0105.v1). 1043
HG28 [177] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1044
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1045
HG29 [178] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1047
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1048
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1049
10.13140/RG.2.2.23172.19849). 1050

HG30 [181] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1057
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1058
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1059
10.13140/RG.2.2.17385.36968). 1060
Preprints 2023, 2023010044 1063

10.20944/preprints202301.0043.v1). 1066
HG31 [184] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1067
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1068

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

10.13140/RG.2.2.29430.88642). 1081
(doi: 10.20944/preprints202212.0549.v1). 1087
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1089
10.13140/RG.2.2.19380.94084). 1090


SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1098
(doi: 10.20944/preprints202212.0500.v1). 1101

Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1103
10.13140/RG.2.2.20993.12640). 1104
HG952 [196] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1105

HG95 [197] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1108
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1109
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1110
HG37 [200] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1117
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1118
10.13140/RG.2.2.29173.86244). 1119
HG38 [201] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1120
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1121
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1122
HG174b [202] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1123
10.5281/zenodo.7978921). 1124
HG173b [203] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1125
odo.7943878). 1126
HG172b [204] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1127
10.5281/zenodo.7943871). 1128
HG171b [205] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1129
10.5281/zenodo.7923786). 1130
HG170b [206] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1131
2023 (doi: 10.5281/zenodo.7905287). 1132
HG169b [207] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1133

Garrett, 2023 (doi: 10.5281/zenodo.7904586). 1134
HG168b [208] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1135
2023 (doi: 10.5281/zenodo.7874677). 1136
HG167b [209] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1137
(doi: 10.5281/zenodo.7857906). 1138

HG166b [210] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1139
2023 (doi: 10.5281/zenodo.7856329). 1140
HG165b [211] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1141
10.5281/zenodo.7854561). 1142
HG164b [212] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1143
2023 (doi: 10.5281/zenodo.7851893). 1144
HG163b [213] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1145

HG162b [214] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1147
(doi: 10.5281/zenodo.7835063). 1148
HG161b [215] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1149
(doi: 10.5281/zenodo.7826705). 1150
HG160b [216] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1151
2023 (doi: 10.5281/zenodo.7820680). 1152
HG159b [217] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1153
10.5281/zenodo.7812750). 1154
HG158b [218] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1155
HG157b [219] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1157

HG156b [220] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1159
2023 (doi: 10.5281/zenodo.7807782). 1160
HG155b [221] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1161
2023 (doi: 10.5281/zenodo.7804449). 1162
HG154b [222] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1163

HG153b [223] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1165
(doi: 10.5281/zenodo.7792307). 1166
HG152b [224] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1167
(doi: 10.5281/zenodo.7790728). 1168
HG151b [225] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1169
2023 (doi: 10.5281/zenodo.7787712). 1170
HG150b [226] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1171
10.5281/zenodo.7783791). 1172
HG149b [227] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1173
10.5281/zenodo.7780123). 1174

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

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

HG112b [264] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1246
odo.7650729). 1247
HG111b [265] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1248
odo.7647868). 1249
HG110b [266] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1250
odo.7647017). 1251
HG109b [267] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1252
odo.7644894). 1253
HG108b [268] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1254
HG107b [269] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1255
odo.7632923). 1256
HG106b [270] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1257
odo.7623459). 1258
HG105b [271] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1259
10.5281/zenodo.7606416). 1260
HG104b [272] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1261
10.5281/zenodo.7606416). 1262
HG103b [273] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1263
odo.7606404). 1264
HG102b [274] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1265
10.5281/zenodo.7580018). 1266
HG101b [275] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1267
odo.7580018). 1268
odo.7580018). 1270
odo.7579929). 1272
HG98b [278] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1273
10.5281/zenodo.7563170). 1274
HG97b [279] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.7563164). 1276
HG96b [280] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1277
odo.7563160). 1278
odo.7563160). 1280

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

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

HG44b [318] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1353
odo.6677173). 1354

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

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

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

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

CHAPTER 5 1463
Extreme Matrix-Based 1464
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1465
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1466
2023, (doi: 10.13140/RG.2.2.34953.52320). 1467

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1468
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1469
(doi: 10.13140/RG.2.2.33275.80161). 1470
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1471
10.13140/RG.2.2.11050.90569). 1473
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1474
10.13140/RG.2.2.17761.79206). 1476
10.13140/RG.2.2.19911.37285). 1479
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1480
10.13140/RG.2.2.23266.81602). 1482
10.13140/RG.2.2.19360.87048). 1485
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1486
10.13140/RG.2.2.32363.21286). 1488
10.13140/RG.2.2.11758.69441). 1491
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1492
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1493
10.13140/RG.2.2.31891.35367). 1494
10.13140/RG.2.2.21510.45125). 1497
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1498
10.13140/RG.2.2.13121.84321). 1500

CHAPTER 6 1501
New Ideas On Super mat By Hyper matte 1502
Of Matrix-Based In Cancer’s Recognition 1503
With (Neutrosophic) SuperHyperGraph 1504
49
CHAPTER 7 1505
ABSTRACT 1506
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperMatrix-Based). 1507

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Matrix-Based pair S = (V, E). Consider 1508
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 1509
V 0 or E 0 is called Neutrosophic e-SuperHyperMatrix-Based if the following expression is called 1510
Neutrosophic e-SuperHyperMatrix-Based criteria holds 1511
The incidence matrix forms;
Neutrosophic re-SuperHyperMatrix-Based if the following expression is called Neutrosophic e- 1512
SuperHyperMatrix-Based criteria holds 1513
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic v- 1514

SuperHyperMatrix-Based if the following expression is called Neutrosophic v-SuperHyperMatrix-Based 1515
criteria holds 1516
The adjacency matrix forms;
Neutrosophic rv-SuperHyperMatrix-Based if the following expression is called Neutrosophic v- 1517
and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic 1519

SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix-Based, Neutrosophic 1520
re-SuperHyperMatrix-Based, Neutrosophic v-SuperHyperMatrix-Based, and Neutrosophic rv- 1521
SuperHyperMatrix-Based. ((Neutrosophic) SuperHyperMatrix-Based). Assume a Neutrosophic 1522
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 1523

(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperMatrix-Based if it’s either 1524
of Neutrosophic e-SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutrosophic 1525
v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for an 1526
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 1527
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consec- 1528
utive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1529
51
that they form the Extreme SuperHyperMatrix-Based; a Neutrosophic SuperHyperMatrix-Based if it’s 1530
either of Neutrosophic e-SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutro- 1531
sophic v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for 1532
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 1533
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1534
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1535
such that they form the Neutrosophic SuperHyperMatrix-Based; an Extreme SuperHyperMatrix- 1536
Based SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperMatrix-Based, Neutro- 1537
sophic re-SuperHyperMatrix-Based, Neutrosophic v-SuperHyperMatrix-Based, and Neutrosophic 1538
rv-SuperHyperMatrix-Based and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 1539
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1540
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 1541
SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 1542

Extreme SuperHyperVertices such that they form the Extreme SuperHyperMatrix-Based; and the 1543
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperMatrix- 1544
rv-SuperHyperMatrix-Based and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 1547
is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined 1548

as the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 1549
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 1550
secutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 1551
they form the Neutrosophic SuperHyperMatrix-Based; and the Neutrosophic power is corres- 1552
ponded to its Neutrosophic coefficient; an Extreme V-SuperHyperMatrix-Based if it’s either 1553
of Neutrosophic e-SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutro- 1554

sophic v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) 1555
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 1556
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 1557
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 1558
SuperHyperVertices such that they form the Extreme SuperHyperMatrix-Based; a Neutro- 1559
sophic V-SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix-Based, Neut- 1560

rosophic re-SuperHyperMatrix-Based, Neutrosophic v-SuperHyperMatrix-Based, and Neutrosophic 1561
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 1563
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1564
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1565
SuperHyperMatrix-Based; an Extreme V-SuperHyperMatrix-Based SuperHyperPolynomial if it’s either 1566
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1569
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1570
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme car- 1571

dinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1572
they form the Extreme SuperHyperMatrix-Based; and the Extreme power is corresponded to its 1573
Extreme coefficient; a Neutrosophic SuperHyperMatrix-Based SuperHyperPolynomial if it’s either 1574

v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for a Neut- 1576
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1577
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1578
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 1579
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1580
SuperHyperVertices such that they form the Neutrosophic SuperHyperMatrix-Based; and the 1581
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1582
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperMatrix-Based and 1583
Neutrosophic SuperHyperMatrix-Based. Two different types of SuperHyperDefinitions are debut 1584
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1585
Recognition” are the under research to figure out the challenges make sense about ongoing and 1592
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 1593
are different types of them. Some of them are individuals and some of them are well-modeled 1594
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 1595
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 1596
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 1597
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 1598
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 1599
this research. It’s also officially collected in the form of some questions and some problems. 1600
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperMatrix-Based 1601
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperMatrix-Based is a maximal 1606

Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 1607
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 1608
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1609
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1611

Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1612
SuperHyperMatrix-Based . Since there’s more ways to get type-results to make a SuperHyperMatrix- 1613
Based more understandable. For the sake of having Neutrosophic SuperHyperMatrix-Based, there’s 1614
a need to “redefine” the notion of a “SuperHyperMatrix-Based ”. The SuperHyperVertices and the 1615
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperMatrix-Based 1617
. It’s redefined a Neutrosophic SuperHyperMatrix-Based if the mentioned Table holds, concerning, 1618
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 1619
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 1620
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 1621

Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 1622
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 1623
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 1624
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on a 1625
SuperHyperMatrix-Based . It’s the main. It’ll be disciplinary to have the foundation of previous 1626
definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperMatrix-Based 1627
until the SuperHyperMatrix-Based, then it’s officially called a “SuperHyperMatrix-Based” but other- 1628
wise, it isn’t a SuperHyperMatrix-Based . There are some instances about the clarifications for the 1629
main definition titled a “SuperHyperMatrix-Based ”. These two examples get more scrutiny and 1630
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 1631
on a SuperHyperMatrix-Based . For the sake of having a Neutrosophic SuperHyperMatrix-Based, 1632
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperMatrix-Based” and a 1633
“Neutrosophic SuperHyperMatrix-Based ”. The SuperHyperVertices and the SuperHyperEdges 1634

are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 1635
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 1636
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 1637
SuperHyperMatrix-Based are redefined to a “Neutrosophic SuperHyperMatrix-Based” if the intended 1638
Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s 1639
more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperMatrix-Based 1640

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperMatrix-Based, 1642
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, 1643
are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperMatrix-Based”, “Neutrosophic Su- 1644
perHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 1645
a “Neutrosophic SuperHyperMatrix-Based” where it’s the strongest [the maximum Neutrosophic 1647
value from all the SuperHyperMatrix-Based amid the maximum value amid all SuperHyperVertices 1648
from a SuperHyperMatrix-Based .] SuperHyperMatrix-Based . A graph is a SuperHyperUniform 1649
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 1650
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 1651
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1652
with two exceptions; it’s SuperHyperMatrix-Based if it’s only one SuperVertex as intersection amid 1653
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 1654
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 1655

sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 1659
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 1660

Recognition” and the results and the definitions will be introduced in redeemed ways. The 1669
recognition of the cancer in the long-term function. The specific region has been assigned 1670
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 1671
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 1674
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 1675
done. There are some specific models, which are well-known and they’ve got the names, and 1676
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 1677
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 1678
SuperHyperPath(-/SuperHyperMatrix-Based, SuperHyperStar, SuperHyperBipartite, SuperHyper- 1679
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperMatrix-Based or 1680
the strongest SuperHyperMatrix-Based in those Neutrosophic SuperHyperModels. For the longest 1681
SuperHyperMatrix-Based, called SuperHyperMatrix-Based, and the strongest SuperHyperMatrix-Based, 1682
called Neutrosophic SuperHyperMatrix-Based, some general results are introduced. Beyond that 1683
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1684
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1685
SuperHyperMatrix-Based. There isn’t any formation of any SuperHyperMatrix-Based but literarily, 1686
it’s the deformation of any SuperHyperMatrix-Based. It, literarily, deforms and it doesn’t form. 1687
A basic familiarity with Neutrosophic SuperHyperMatrix-Based theory, SuperHyperGraphs, and 1688
Neutrosophic SuperHyperGraphs theory are proposed. 1689
Keywords: Neutrosophic SuperHyperGraph, SuperHyperMatrix-Based, Cancer’s Neutrosophic 1690
Recognition 1691

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

of tackling on getting results and in Matrix-Based to make sense about continuing the research, 1765
the ideas of SuperHyperUniform and Extreme SuperHyperUniform are introduced and as their 1766
consequences, corresponded SuperHyperClasses are figured out to debut what’s done in this 1767
section, titled “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1768
As going back to origin of the notions, there are some smart steps toward the common 1769
notions to extend the new notions in new frameworks, SuperHyperGraph and Extreme 1770

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

SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 1772
concluding and closing section of theoretical research are contained in the section “General 1773
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1774
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 1775
“ SuperHyperMatrix-Based”, “Extreme SuperHyperMatrix-Based”, “Results on SuperHyperClasses” 1776
and “Results on Extreme SuperHyperClasses”. There are curious questions about what’s 1777
done about the SuperHyperNotions to make sense about excellency of this research and 1778
going to figure out the word “best” as the description and adjective for this research as 1779
presented in section, “ SuperHyperMatrix-Based”. The keyword of this research debut in the section 1780
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1781
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1782
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1783

are some scrutiny and discernment on what’s done and what’s happened in this research in 1784
the terms of “questions” and “problems” to make sense to figure out this research in featured 1785
style. The advantages and the limitations of this research alongside about what’s done in this 1786
research to make sense and to get sense about what’s figured out are included in the section, 1787
“Conclusion and Closing Remarks”. 1788

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

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

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

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

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

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 9.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 1804
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1805
where 1806
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1807
(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); 1808
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1809
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1810
1, 2, . . . , n0 ); 1811
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1812
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1813

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

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

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

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

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

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

where 1850

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


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

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

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

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

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

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1940
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1941
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1942
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperMatrix-Based). 1943

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1945
or E 0 is called 1946
(i) Neutrosophic e-SuperHyperMatrix-Based if the following expression is called Neutro- 1947
sophic e-SuperHyperMatrix-Based criteria holds 1948
(ii) Neutrosophic re-SuperHyperMatrix-Based if the following expression is called Neut- 1949

rosophic re-SuperHyperMatrix-Based criteria holds 1950
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 1951
(iii) Neutrosophic v-SuperHyperMatrix-Based if the following expression is called Neutro- 1952

sophic v-SuperHyperMatrix-Based criteria holds 1953
(iv) Neutrosophic rv-SuperHyperMatrix-Based if the following expression is called Neut- 1954

rosophic v-SuperHyperMatrix-Based criteria holds 1955

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 1956
(v) Neutrosophic SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix- 1957

Based, Neutrosophic re-SuperHyperMatrix-Based, Neutrosophic v-SuperHyperMatrix-Based, and 1958
Neutrosophic rv-SuperHyperMatrix-Based. 1959
Definition 9.0.19. ((Neutrosophic) SuperHyperMatrix-Based). 1960

(i) an Extreme SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix- 1963

Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for an Extreme SuperHyperGraph 1965
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1966
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 1967
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1968
form the Extreme SuperHyperMatrix-Based; 1969

(ii) a Neutrosophic SuperHyperMatrix-Based if it’s either of Neutrosophic e- 1970

SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutrosophic v- 1971
SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for a 1972
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinal- 1973
ity of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1974
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1975
SuperHyperVertices such that they form the Neutrosophic SuperHyperMatrix-Based; 1976
(iii) an Extreme SuperHyperMatrix-Based SuperHyperPolynomial if it’s either of Neut- 1977
rosophic e-SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutrosophic 1978

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

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

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 2000
(vi) a Neutrosophic V-SuperHyperMatrix-Based if it’s either of Neutrosophic e- 2003

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 2006
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 2007
(vii) an Extreme V-SuperHyperMatrix-Based SuperHyperPolynomial if it’s either of 2010


C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 2013
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 2014
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 2015
Extreme SuperHyperVertices such that they form the Extreme SuperHyperMatrix-Based; 2017
and the Extreme power is corresponded to its Extreme coefficient; 2018
(viii) a Neutrosophic SuperHyperMatrix-Based SuperHyperPolynomial if it’s either of 2019


number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 2024
Neutrosophic coefficient. 2028
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperMatrix-Based). 2029

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2030
(i) an δ−SuperHyperMatrix-Based is a Neutrosophic kind of Neutrosophic SuperHyperMatrix- 2031
Based such that either of the following expressions hold for the Neutrosophic cardinalities 2032
of SuperHyperNeighbors of s ∈ S : 2033
|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 2034

(29.1), holds if S is an δ−SuperHyperDefensive; 2035
(ii) a Neutrosophic δ−SuperHyperMatrix-Based is a Neutrosophic kind of Neutrosophic 2036

SuperHyperMatrix-Based such that either of the following Neutrosophic expressions hold for 2037
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2038
|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 2039

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2040
For the sake of having a Neutrosophic SuperHyperMatrix-Based, there’s a need to “redefine” the 2041
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 2042
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 2043
of the position of labels to assign to the values. 2044
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2045
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2046

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
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2047
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2048
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 2050
sophic SuperHyperPath , SuperHyperMatrix-Based, SuperHyperStar, SuperHyperBipartite, Super- 2051
HyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutro- 2052
sophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic SuperHy- 2053
perBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic SuperHy- 2054

perWheel if the Table (29.2) holds. 2055
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperMatrix-Based. Since 2056

there’s more ways to get type-results to make a Neutrosophic SuperHyperMatrix-Based more 2057
Neutrosophicly understandable. 2058
Neutrosophic notion of “Neutrosophic SuperHyperMatrix-Based”. The SuperHyperVertices and the 2060
there’s the usage of the position of labels to assign to the values. 2062
136DEF1 Definition 9.0.23. Assume a SuperHyperMatrix-Based. It’s redefined a Neutrosophic 2063

SuperHyperMatrix-Based if the Table (29.3) holds. 2064


136TBL1

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

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

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

a probability Matrix-Based. Any k-function Matrix-Based like E is called Extreme k-Variable. If 2082
k = 2, then any 2-function Matrix-Based like E is called Extreme Variable. 2083
The notion of independent on Extreme Variable is likewise. 2084
Definition 10.0.4. (Extreme Expectation). 2085
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2086
73
probability Matrix-Based. an Extreme k-Variable E has a number is called Extreme Expectation 2087
if the following expression is called Extreme Expectation criteria 2088
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2089

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2090
is a probability Matrix-Based. an Extreme number is called Extreme Crossing if the following 2091
expression is called Extreme Crossing criteria 2092
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 2093
S = (V, E) is a probability Matrix-Based. Let m and n propose special Matrix-Based. Then with m ≥ 4n, 2094
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Matrix-Based p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 2095
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
2096
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2097
Consider S = (V, E) is a probability Matrix-Based. Let P be a SuperHyperSet of n points in the 2098
plane, and let l be the Extreme number√of SuperHyperLines in the plane passing through at least 2099
k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2100
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2101

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

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

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

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

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

S = (V, E) is a probability Matrix-Based. A special SuperHyperGraph in Gn,p is up. Let G ∈ Gn,p 2137
and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. The 2138
probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability 2139
that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 2140
Extreme SuperHyperGraph G. 2141
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2142
Extreme Variable for this Extreme Event. By equation, we have 2143
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .
Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 2144
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2145
X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 2146
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2147
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

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

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

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

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

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

Definition 10.0.18. (Extreme Balanced). 2191

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2192
probability Matrix-Based. Let F be a fixed Extreme SuperHyperGraph. Then there is a threshold 2193
function for the property of containing a copy of F as an Extreme SubSuperHyperGraph is 2194
called Extreme Balanced. 2195
Consider S = (V, E) is a probability Matrix-Based. Let F be a nonempty balanced Extreme 2197
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2198
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2199
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2202
the mentioned Extreme Figures in every Extreme items. 2203
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperMatrix- 2204
Based, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 2205
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 2206

an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2207
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2208
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2209
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2210
SuperHyperMatrix-Based. 2211
C(N SHG)Extreme Matrix-Based =

 
0 1 0 1
0 0 0 1
 
0 0 0 0
0 0 0 1
C(N SHG)Extreme Matrix-Based SuperHyperPolynomial
= 2z.
C(N SHG)Extreme V-Matrix-Based =
 
0 1 0 1
1 0 0 1
 
0 0 0 0
1 1 0 0
C(N SHG)Extreme V-Matrix-Based SuperHyperPolynomial
= z3.
2212
Based, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some 2214
empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the 2215
terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 2216

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperMatrix-Based in the Extreme Example (42.0.3) 136NSHG1
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2217
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2218
V3 , is excluded in every given Extreme SuperHyperMatrix-Based. 2219

 
0 0 0 1
0 0 0 1
 
0 0 0 0
0 0 0 1
= 3z.
 
0 1 0 1
1 0 0 1
 
0 0 0 0
1 1 0 0
= z3.
2220

, is up. The Extreme Algorithm is Extremely straightforward.

Based 2222

 
0 0 0 1
0 0 0 1
0 0 0 1
= 3z.
 
0 1 1
1 0 1
1 1 0
= z3.
2223
Based, is up. The Extreme Algorithm is Extremely straightforward. 2225

 
0 0 0 1 1
0 0 0 1 1
 
1 0 0 1 1
 
1 1 0 0 0
 
0 0 1 1 1
 
1 1 0 0 0
 
0 0 0 1 1
0 2 0 0 0
= z3 + z2.
 
0 1 1 0 1 0 1 0
1 0 1 0 1 0 1 0
 
1 1 0 1 1 0 1 0
 
0 0 1 0 0 1 0 1
 
1 1 1 0 0 0 1 0
 
0 0 1 1 0 0 0 1
 
1 1 1 0 1 0 0 0
0 0 0 1 0 1 0 0
= 2z 5 + 2z 3 .
2226


Based 2228

 
1 0 0 0
0 1 0 0
 
0 0 1 0
 
0 0 0 1
1 1 1 1
= z4.
 
0 0 0 0 1
0 0 0 0 1
 
0 0 0 0 1
 
0 0 0 0 1
0 0 0 0 1
= z.
2229

 
0 ... 1 ... 1 ... 0
0
 ... 1 ... 1 ... 0 
. . . ... ... ... ... ... . . .
0 ... 1 ... 1 ... 0
= za.
 
0 ... 1 ... 1 ... 1 ... 0
 0 ... 1 ... 1 ... 1 ... 0
 
. . . . . . . . . . . . . . . . . . ... ... . . .
0 ... 1 ... 1 ... 1 ... 0
= zb.
2232

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2235

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2238

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2241

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2244

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2247

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2250

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2253

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2256

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.

2259

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2262


Based 2264

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2265

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2268

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2271

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2274

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
2277

SuperHyperMatrix-Based in the Extreme Example (42.0.3) 95NHG1
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.

SuperHyperMatrix-Based in the Extreme Example (42.0.3) 95NHG2
2280
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The 2281
all interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Matrix-Based if for any 2282
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2283
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2284
all minus all Extreme SuperHypeNeighbors to any amount of them. 2285
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2286

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2287
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2288
quasi-R-Matrix-Based minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2289
In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only 2290
two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Matrix-Based, minus all Extreme 2291
SuperHypeNeighbor to some of them but not all of them. 2292
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-Matrix-Based is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Matrix-Based is at least the 2293
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2294
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2295

number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2296
SuperHyperVertices are renamed to Extreme Matrix-Based in some cases but the maximum number of 2297
the Extreme SuperHyperEdge with the maximum Extreme number of Extreme SuperHyperVertices, 2298
has the Extreme SuperHyperVertices are contained in an Extreme R-Matrix-Based. 2299
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Matrix-Based 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-Matrix-Based with the least Extreme cardinality, the lower sharp 2300
Extreme bound for cardinality. 2301
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2302
Then in the worst case, literally, 2303
C(N SHG)ExtremeQuasi−M atrix−Based

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−M atrix−BasedSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−M atrix−Based = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−M atrix−BasedSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Matrix-Based. In other words, the least cardinality, the lower sharp bound 2304
for the cardinality, of an Extreme type-result-Matrix-Based is the cardinality of 2305

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−M atrix−BasedSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−M atrix−Based = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−M atrix−BasedSuperHyperP 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-Matrix-Based 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-Matrix-Based. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Matrix-Based 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-Matrix-Based. 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-Matrix-Based decorates the Extreme SuperHyperVertices
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-Matrix-Based. 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-Matrix-Based has the Extreme cardinality of an Extreme SuperHyperEdge.
Thus, an Extreme R-Matrix-Based has the Extreme cardinality at least an Extreme SuperHyperEdge.
Assume an Extreme SuperHyperSet V \V \{z}. This Extreme SuperHyperSet isn’t an Extreme R-
Matrix-Based 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-Matrix-Based”
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-Matrix-Based 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-Matrix-Based 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-Matrix-Based. Those Extreme SuperHyperVertices are
potentially included in an Extreme style-R-Matrix-Based. 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-Matrix-Based is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Matrix-Based 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-Matrix-Based. 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, 2306
Extreme R-Matrix-Based =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2307
Extreme R-Matrix-Based =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Matrix-Based where E ∈ EESHG:(V,E) is fixed that

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

with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2310
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2311
SuperHyperVertices are renamed to Extreme Matrix-Based in some cases but the maximum number 2312
of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme SuperHyper- 2313
Vertices, has the Extreme SuperHyperVertices are contained in an Extreme R-Matrix-Based. 2314
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Extreme 2315
SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the Extreme 2316
optimal SuperHyperObject. It specially delivers some remarks on the Extreme SuperHyperSet of 2317
the Extreme SuperHyperVertices such that there’s distinct amount of Extreme SuperHyperEdges 2318
for distinct amount of Extreme SuperHyperVertices up to all taken from that Extreme Super- 2319
HyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of the Extreme 2320
SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or it doesn’t 2321

have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 2322
least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. Thus 2323
it forms an Extreme quasi-R-Matrix-Based where the Extreme completion of the Extreme incidence 2324
is up in that. Thus it’s, literarily, an Extreme embedded R-Matrix-Based. The SuperHyperNotions 2325
of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these 2326
types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus 2327
the embedded setting is elected such that those SuperHyperSets have the maximum Extreme 2328
SuperHyperCardinality and they’re Extreme SuperHyperOptimal. The less than two distinct 2329
types of Extreme SuperHyperVertices are included in the minimum Extreme style of the 2330
embedded Extreme R-Matrix-Based. The interior types of the Extreme SuperHyperVertices are 2331
deciders. Since the Extreme number of SuperHyperNeighbors are only affected by the interior 2332
Extreme SuperHyperVertices. The common connections, more precise and more formal, the 2333

perfect unique connections inside the Extreme SuperHyperSet for any distinct types of Extreme 2334
SuperHyperVertices pose the Extreme R-Matrix-Based. Thus Extreme exterior SuperHyperVertices 2335
could be used only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with 2336
the interior Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded 2337
Extreme Matrix-Based, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2338
more connections inside more than outside. Thus the title “exterior” is more relevant than the 2339
title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme 2340
SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has been 2341
ignored in the exploring to lead on the optimal case implying the Extreme R-Matrix-Based. The 2342
Extreme R-Matrix-Based with the exclusion of the exclusion of all Extreme SuperHyperVertices 2343
in one Extreme SuperHyperEdge and with other terms, the Extreme R-Matrix-Based with the 2344
inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme 2345
quasi-R-Matrix-Based. To sum them up, in a connected non-obvious Extreme SuperHyperGraph 2346

ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the 2347
maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of any given 2348
Extreme quasi-R-Matrix-Based minus all Extreme SuperHypeNeighbor to some of them but not all 2349
of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2350
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Matrix-Based, minus all 2351
Extreme SuperHypeNeighbor to some of them but not all of them. 2352

The main definition of the Extreme R-Matrix-Based has two titles. an Extreme quasi-R-Matrix-Based 2353
and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are two titles in the 2354
terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R-Matrix-Based with 2355
that quasi-maximum Extreme SuperHyperCardinality in the terms of the embedded Extreme 2356
SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then the Extreme 2357
quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi-R-Matrix-Baseds 2358
for all Extreme numbers less than its Extreme corresponded maximum number. The essence of 2359
the Extreme Matrix-Based ends up but this essence starts up in the terms of the Extreme quasi-R- 2360
Matrix-Based, again and more in the operations of collecting all the Extreme quasi-R-Matrix-Baseds 2361
acted on the all possible used formations of the Extreme SuperHyperGraph to achieve one 2362
Extreme number. This Extreme number is 2363
considered as the equivalence class for all corresponded quasi-R-Matrix-Baseds. Let 2364
zExtreme Number , SExtreme SuperHyperSet and GExtreme Matrix-Based be an Extreme number, an 2365
Extreme SuperHyperSet and an Extreme Matrix-Based. Then 2366
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Matrix-Based ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Matrix-Based is re-formalized and redefined 2367
as follows. 2368
GExtreme Matrix-Based ∈ ∪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 2369
definition for the Extreme Matrix-Based. 2370
GExtreme Matrix-Based =
{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 Matrix-Based 2371
poses the upcoming expressions. 2372
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2373
= maxzExtreme Number

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


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


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

2377
= max zExtreme Number

2378

Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2379
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2380
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Super- 2381
HyperEdge. It’s, literarily, another name for “Extreme Quasi-Matrix-Based” but, precisely, it’s 2382
the generalization of “Extreme Quasi-Matrix-Based” since “Extreme Quasi-Matrix-Based” happens 2383
“Extreme Matrix-Based” in an Extreme SuperHyperGraph as initial framework and background but 2384
“Extreme SuperHyperNeighborhood” may not happens “Extreme Matrix-Based” in an Extreme 2385
SuperHyperGraph as initial framework and preliminarily background since there are some 2386
ambiguities about the Extreme SuperHyperCardinality arise from it. To get orderly keywords, 2387
the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Matrix-Based”, and “Extreme 2388
Matrix-Based” are up. 2389
Thus, let 2390

zExtreme Number , NExtreme SuperHyperNeighborhood and 2391

GExtreme Matrix-Based be an Extreme number, an Extreme SuperHyperNeighborhood and an 2392
Extreme Matrix-Based and the new terms are up. 2393
GExtreme Matrix-Based ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2394
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2395
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2396
And with go back to initial structure, 2397
GExtreme Matrix-Based ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =



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

2399
= max zExtreme Number

2400

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

Is the simple Extreme type-SuperHyperSet of the Extreme R-Matrix-Based. The Extreme

SuperHyperSet of the Extreme SuperHyperVertices,

Is an Extreme R-Matrix-Based 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 Matrix-Based is related to the Extreme SuperHyperSet of the Extreme SuperHyper-
Vertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Matrix-Based is up. The obvious simple Extreme type-
SuperHyperSet called the Extreme Matrix-Based 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-Matrix-Based is up. To sum them up, the Extreme
SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Matrix-Based. Since the
Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Matrix-Based 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 Matrix-Based and it’s an Extreme Matrix-Based. 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
Matrix-Based. There isn’t only less than two Extreme SuperHyperVertices inside the intended
Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Matrix-Based,

is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Matrix-Based , not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2401
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2402
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2403
the 2404
“Extreme R-Matrix-Based” 2405
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2406
Extreme R-Matrix-Based, 2407
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-Matrix-Based amid those obvious simple Extreme type-SuperHyperSets of the Extreme
Matrix-Based, 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-Matrix-Based. In other words, the least cardinality, the lower sharp bound for the
cardinality, of an Extreme R-Matrix-Based is the cardinality of
2408
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2409
Extreme SuperHyperVertices belong to any Extreme quasi-R-Matrix-Based if for any of them, and 2410
any of other corresponded Extreme SuperHyperVertex, some interior Extreme SuperHyperVer- 2411
tices are mutually Extreme SuperHyperNeighbors with no Extreme exception at all minus all 2412
Extreme SuperHypeNeighbors to any amount of them. 2413

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2414
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2415
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2416
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2417
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2418
R-Matrix-Based with the least cardinality, the lower sharp Extreme bound for Extreme cardinality. 2419
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme SuperHyperSet 2420
of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet S of the 2421
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2422
Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Matrix-Based. Since it doesn’t have 2423
2424
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2425
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2426
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2427
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2428
but it isn’t an Extreme R-Matrix-Based. Since it doesn’t do the Extreme procedure such that 2429
such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2430
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2431
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2432
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2433
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2434
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2435
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Matrix-Based, VESHE is 2436
up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Matrix-Based, VESHE , 2437
is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does 2438
forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2439
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2440
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2441
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2442
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2443
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Matrix-Based only contains all interior 2444
Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique 2445
Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHyper- 2446
Neighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all 2447
Extreme SuperHypeNeighbors to some of them not all of them but everything is possible about 2448
Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2449

The SuperHyperNotion, namely, Matrix-Based, is up. There’s neither empty SuperHyperEdge 2450
nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2451
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme 2452
Matrix-Based. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2453

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−M atrix−BasedSuperHyperP olynomial
= 2z b 2 c
.

C(N SHG)ExtremeR−Quasi−M atrix−Based = {Vi }si=1 , {Vj }tj=1 .

C(N SHG)ExtremeR−Quasi−M atrix−BasedSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Matrix-Based. The Extreme 2454
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2455

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Matrix-Based C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is an 2456

Extreme type-SuperHyperSet with 2457
2458
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2459
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2460

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2461
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2462
Extreme SuperHyperSet. Thus the non-obvious Extreme Matrix-Based is up. The obvious simple 2463
Extreme type-SuperHyperSet called the Extreme Matrix-Based is an Extreme SuperHyperSet 2464
includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet of the 2465
Extreme SuperHyperEdges[SuperHyperVertices], 2466

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHy- 2467
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Matrix- 2468
Based is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2469
perEdges[SuperHyperVertices], 2470

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 Matrix-Based. Since the 2471
Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2472

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Matrix-Based C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) is the 2473
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an Extreme Supe- 2474
rHyperEdge for some Extreme SuperHyperVertices given by that Extreme type-SuperHyperSet 2475
called the Extreme Matrix-Based and it’s an Extreme Matrix-Based. Since it’s 2476
2477
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2478
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2479
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2480
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2481
intended Extreme SuperHyperSet, 2482

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

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 Matrix-Based , not: 2484

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

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 2486
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2487
SuperHyperSet called the 2488
“Extreme Matrix-Based ” 2489
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2490
Extreme Matrix-Based , 2491
is only and only 2492

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

= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2493

CHAPTER 11 2494
The Extreme Departures on The 2495
Theoretical Results Toward Theoretical 2496
Motivations 2497
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2498
SuperHyperClasses. 2499
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2500

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
Proof. Let 2501
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
119
2502
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
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 2503
new way to redefine as 2504
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 2505
ViEXT ERN AL in the literatures of SuperHyperMatrix-Based. The latter is straightforward. 2506
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2507
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2508
(31.1), is the SuperHyperMatrix-Based. 2509
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2510

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.
Proof. Let 2511
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,

Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperMatrix-Based in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2512
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 2513


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

SuperHyperMatrix-Based in the Extreme Example (42.0.7) 136NSHG19a
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2517
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2518
SuperHyperModel (31.2), is the Extreme SuperHyperMatrix-Based. 2519
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2520

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.

Proof. Let 2521
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2522
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2523
way to redefine as 2524

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2527
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2528
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2529
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperMatrix-Based. 2530
2531
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2532

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.

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

SuperHyperMatrix-Based in the Extreme Example (42.0.9) 136NSHG20a
Proof. Let 2533
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
2534
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 2535
a new way to redefine as 2536


ViEXT ERN AL in the literatures of SuperHyperMatrix-Based. The latter is straightforward. Then 2538
there’s no at least one SuperHyperMatrix-Based. Thus the notion of quasi may be up but the 2539
SuperHyperNotions based on SuperHyperMatrix-Based could be applied. There are only two 2540
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 2541
representative in the 2542
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperMatrix-Based taken from a connected Extreme SuperHyperBipartite 2543

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2544
SuperHyperPart SuperHyperEdges are attained in any solution 2545
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2546
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2547
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2548
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2549
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2550
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperMatrix-Based. 2551
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2552
Then 2553

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.

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

Extreme SuperHyperMatrix-Based in the Example (42.0.11) 136NSHG21a
Proof. Let 2554
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2555
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperMatrix-Based taken from a connected Extreme SuperHyperMultipartite 2556

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


The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2558
to ViEXT ERN AL in the literatures of SuperHyperMatrix-Based. The latter is straightforward. 2559
Then there’s no at least one SuperHyperMatrix-Based. Thus the notion of quasi may be up 2560
but the SuperHyperNotions based on SuperHyperMatrix-Based could be applied. There are only 2561
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 2562
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2564
(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2565
SuperHyperEdges are attained in any solution 2566
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2567
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2569
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2570
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2571
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2572
the Extreme SuperHyperMatrix-Based. 2573
∗
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ). 2574
Then, 2575

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . ... ... . . .
− ... − ... − ... − ... −
= zb.

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

Proof. Let 2576
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2577
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperMatrix-Based taken from a connected Extreme SuperHyperWheel ESHW : 2578

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

Then there’s at least one SuperHyperMatrix-Based. Thus the notion of quasi isn’t up and 2582
the SuperHyperNotions based on SuperHyperMatrix-Based could be applied. The unique 2583
embedded SuperHyperMatrix-Based proposes some longest SuperHyperMatrix-Based excerpt from 2584
some representatives. The latter is straightforward. 2585

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

Extreme SuperHyperMatrix-Based in the Extreme Example (42.0.15) 136NSHG23a
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2586
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2587
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2588
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2589
Extreme SuperHyperMatrix-Based. 2590

CHAPTER 12 2591
The Surveys of Mathematical Sets On 2592
The Results But As The Initial Motivation 2593
For the SuperHyperMatrix-Based, Extreme SuperHyperMatrix-Based, and the Extreme 2594

SuperHyperMatrix-Based, some general results are introduced. 2595
Remark 12.0.1. Let remind that the Extreme SuperHyperMatrix-Based is “redefined” on the 2596
positions of the alphabets. 2597
Corollary 12.0.2. Assume Extreme SuperHyperMatrix-Based. Then 2598
Extreme SuperHyperM atrix − Based =

{theSuperHyperM atrix − Basedof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperM atrix − Based
|ExtremecardinalityamidthoseSuperHyperM atrix−Based. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2599
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2600
and the neutrality, for i = 1, 2, 3, respectively. 2601
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2602
alphabet. Then the notion of Extreme SuperHyperMatrix-Based and SuperHyperMatrix-Based coincide. 2603
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperMatrix- 2605
Based if and only if it’s a SuperHyperMatrix-Based. 2606
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperMatrix- 2608
Based if and only if it’s a longest SuperHyperMatrix-Based. 2609
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2610

identical letter of the alphabet. Then its Extreme SuperHyperMatrix-Based is its SuperHyperMatrix- 2611
Based and reversely. 2612
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperMatrix-Based, SuperHyper- 2613
Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 2614
131
letter of the alphabet. Then its Extreme SuperHyperMatrix-Based is its SuperHyperMatrix-Based and 2615
reversely. 2616
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperMatrix- 2617
isn’t well-defined if and only if its SuperHyperMatrix-Based isn’t well-defined.
Based 2618
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2619
Extreme SuperHyperMatrix-Based isn’t well-defined if and only if its SuperHyperMatrix-Based isn’t 2620
well-defined. 2621

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2623
SuperHyperMatrix-Based isn’t well-defined if and only if its SuperHyperMatrix-Based isn’t well-defined. 2624
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperMatrix- 2625
is well-defined if and only if its SuperHyperMatrix-Based is well-defined.
Based 2626
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2627

Extreme SuperHyperMatrix-Based is well-defined if and only if its SuperHyperMatrix-Based is well- 2628
defined. 2629

Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2631
SuperHyperMatrix-Based is well-defined if and only if its SuperHyperMatrix-Based is well-defined. 2632
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2633
(i) : the dual SuperHyperDefensive SuperHyperMatrix-Based; 2634
(ii) : the strong dual SuperHyperDefensive SuperHyperMatrix-Based; 2635
(iii) : the connected dual SuperHyperDefensive SuperHyperMatrix-Based; 2636
(iv) : the δ-dual SuperHyperDefensive SuperHyperMatrix-Based; 2637
(v) : the strong δ-dual SuperHyperDefensive SuperHyperMatrix-Based; 2638
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperMatrix-Based. 2639
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2640
(i) : the SuperHyperDefensive SuperHyperMatrix-Based; 2641
(ii) : the strong SuperHyperDefensive SuperHyperMatrix-Based; 2642
(iii) : the connected defensive SuperHyperDefensive SuperHyperMatrix-Based; 2643
(iv) : the δ-SuperHyperDefensive SuperHyperMatrix-Based; 2644
(v) : the strong δ-SuperHyperDefensive SuperHyperMatrix-Based; 2645
(vi) : the connected δ-SuperHyperDefensive SuperHyperMatrix-Based. 2646
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2647
independent SuperHyperSet is 2648

(iii) : the connected SuperHyperDefensive SuperHyperMatrix-Based; 2651
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2655

which is a SuperHyperMatrix-Based/SuperHyperPath. Then V is a maximal 2656
(i) : SuperHyperDefensive SuperHyperMatrix-Based; 2657
(ii) : strong SuperHyperDefensive SuperHyperMatrix-Based; 2658
(iii) : connected SuperHyperDefensive SuperHyperMatrix-Based; 2659
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperMatrix-Based; 2660
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperMatrix-Based; 2661
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperMatrix-Based; 2662
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2663
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2664

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2665
(i) : dual SuperHyperDefensive SuperHyperMatrix-Based; 2666
(ii) : strong dual SuperHyperDefensive SuperHyperMatrix-Based; 2667
(iii) : connected dual SuperHyperDefensive SuperHyperMatrix-Based; 2668
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperMatrix-Based; 2669
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperMatrix-Based; 2670
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperMatrix-Based; 2671
which is a SuperHyperMatrix-Based/SuperHyperPath. Then the number of 2674
(i) : the SuperHyperMatrix-Based; 2675
(ii) : the SuperHyperMatrix-Based; 2676
(iii) : the connected SuperHyperMatrix-Based; 2677
(iv) : the O(ESHG)-SuperHyperMatrix-Based; 2678

(v) : the strong O(ESHG)-SuperHyperMatrix-Based; 2679
(vi) : the connected O(ESHG)-SuperHyperMatrix-Based. 2680
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2681
coincide. 2682

which is a SuperHyperWheel. Then the number of 2684
(i) : the dual SuperHyperMatrix-Based; 2685
(ii) : the dual SuperHyperMatrix-Based; 2686
(iii) : the dual connected SuperHyperMatrix-Based; 2687
(iv) : the dual O(ESHG)-SuperHyperMatrix-Based; 2688
(v) : the strong dual O(ESHG)-SuperHyperMatrix-Based; 2689
(vi) : the connected dual O(ESHG)-SuperHyperMatrix-Based. 2690
coincide. 2692

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2694
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2695
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2696
is a 2697
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperMatrix-Based; 2701
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperMatrix-Based; 2702
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperMatrix-Based. 2703

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2706
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2707
SuperHyperPart is a 2708

(iv) : δ-SuperHyperDefensive SuperHyperMatrix-Based; 2712
(v) : strong δ-SuperHyperDefensive SuperHyperMatrix-Based; 2713
(vi) : connected δ-SuperHyperDefensive SuperHyperMatrix-Based. 2714

SuperHyperMultipartite. Then Then the number of 2717
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2724
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2725
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2727
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2728
(iv) : SuperHyperMatrix-Based; 2732
(v) : strong 1-SuperHyperDefensive SuperHyperMatrix-Based; 2733
(vi) : connected 1-SuperHyperDefensive SuperHyperMatrix-Based. 2734
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2735
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2736
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2737
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2738
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2739
t>
2

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperMatrix-Based; 2743
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperMatrix-Based. 2745
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2746
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2747
dual 2748
(iv) : 0-SuperHyperDefensive SuperHyperMatrix-Based; 2752
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2755
perComplete. Then there’s no independent SuperHyperSet. 2756
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2757
SuperHyperMatrix-Based/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2758

and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2759
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperMatrix-Based; 2763
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperMatrix-Based; 2764
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperMatrix-Based. 2765
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2766
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2767
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2768
t>
2
setting of a dual 2769



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2776
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2777
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2778
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2779
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2780
SuperHyperDefensive SuperHyperMatrix-Based, then ∀v ∈ V \ S, ∃x ∈ S such that 2781
(i) v ∈ Ns (x); 2782
(ii) vx ∈ E. 2783
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2784
SuperHyperDefensive SuperHyperMatrix-Based, then 2785
(i) S is SuperHyperMatrix-Based set; 2786
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2787
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2788
(i) Γ ≤ O; 2789
(ii) Γs ≤ On . 2790
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2791
connected. Then 2792
(i) Γ ≤ O − 1; 2793
(ii) Γs ≤ On − Σ3i=1 σi (x). 2794
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2795
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperMatrix- 2796

Based; 2797
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2798
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2799
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2800
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2802
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperMatrix-Based; 2803

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

Based; 2810
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2811
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2812
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2813
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperMatrix-Based. Then 2815

Based; 2817
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2819
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2820
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2822
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperMatrix-Based; 2823
(ii) Γ = 1; 2824
(iii) Γs = Σ3i=1 σi (c); 2825
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperMatrix-Based. 2826
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2827
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2828
SuperHyperDefensive SuperHyperMatrix-Based; 2829
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2830
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2831
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2832
SuperHyperDefensive SuperHyperMatrix-Based. 2833
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2834

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperMatrix-Based; 2835
(ii) Γ = b n2 c + 1; 2836
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 2837
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperMatrix- 2838
Based. 2839
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2840
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperMatrix-Based; 2841
(ii) Γ = b n2 c; 2842
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 2843
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive 2844
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2846
Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2847
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperMatrix- 2848

Based for N SHF; 2849
(ii) Γ = m for N SHF : (V, E); 2850
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2851
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperMatrix-Based 2852
for N SHF : (V, E). 2853
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2854

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2855
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2856
SuperHyperMatrix-Based for N SHF; 2857
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2858

2
for N SHF : (V, E); 2859
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperMatrix-Based for 2860
N SHF : (V, E). 2861
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2862

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2863
bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperMatrix-Based for 2864
N SHF : (V, E); 2865

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

2
for N SHF : (V, E); 2867
S={vi }i=1
bnc
2
are only dual maximal SuperHyperMatrix-Based for 2868
N SHF : (V, E). 2869
following statements hold; 2871
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2872

SuperHyperMatrix-Based, then S is an s-SuperHyperDefensive SuperHyperMatrix-Based; 2873
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2874

SuperHyperMatrix-Based, then S is a dual s-SuperHyperDefensive SuperHyperMatrix-Based. 2875
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2878

SuperHyperMatrix-Based, then S is an s-SuperHyperPowerful SuperHyperMatrix-Based; 2879

SuperHyperMatrix-Based, then S is a dual s-SuperHyperPowerful SuperHyperMatrix-Based. 2881
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2882

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

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

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

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

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

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


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

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

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


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

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


SuperHyperGraph which is SuperHyperMatrix-Based. Then following statements hold; 2923
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperMatrix- 2924
Based; 2925
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2926

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

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

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

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

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


CHAPTER 13 2942
Extreme Applications in Cancer’s 2943
Extreme Recognition 2944
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2945
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2946
as the consequences of the model, some parameters are used. The cells are under attack of this 2947
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2948
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2949
In the following, some Extreme steps are Extreme devised on this disease. 2950
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2951
function. 2952
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2953
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2954
effects of the cancer on that region; this event leads us to choose another model [it’s said 2957
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2958
what’s done. 2959
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2960
they’ve got the names, and some general Extreme models. The moves and the Extreme 2961
traces of the cancer on the complex tracks and between complicated groups of cells could 2962
be fantasized by an Extreme SuperHyperPath(-/SuperHyperMatrix-Based, SuperHyperStar, 2963
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 2964
either the Extreme SuperHyperMatrix-Based or the Extreme SuperHyperMatrix-Based in those 2965
Extreme Extreme SuperHyperModels. 2966
143
CHAPTER 14 2967
Case 1: The Initial Extreme Steps 2968
Toward Extreme SuperHyperBipartite 2969
as Extreme SuperHyperModel 2970
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2971
is Extreme highlighted and Extreme featured. 2972
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBipartite 2973
is obtained. 2974
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2975
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperMatrix-Based 136NSHGaa21aa
145
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperMatrix- 2977
Based. 2978

CHAPTER 15 2979
Case 2: The Increasing Extreme Steps 2980
Toward Extreme 2981
SuperHyperMultipartite as Extreme 2982
SuperHyperModel 2983
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2984
ite is Extreme highlighted and Extreme featured. 2985
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2986
partite is obtained. 2987
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 2988
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

147
Belong to The Extreme SuperHyperMultipartite

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

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

CHAPTER 16 2992
Wondering Open Problems But As The 2993
Directions To Forming The Motivations 2994
In what follows, some “problems” and some “questions” are proposed. 2995
The SuperHyperMatrix-Based and the Extreme SuperHyperMatrix-Based are defined on a real-world 2996
application, titled “Cancer’s Recognitions”. 2997
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2998
recognitions? 2999
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperMatrix-Based and the 3000
Extreme SuperHyperMatrix-Based? 3001
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3002
them? 3003
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperMatrix-Based 3004
and the Extreme SuperHyperMatrix-Based? 3005
Problem 16.0.5. The SuperHyperMatrix-Based and the Extreme SuperHyperMatrix-Based do a 3006

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperMatrix-Based, 3007
are there else? 3008
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3009
Numbers types-results? 3010
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3011
the multiple types of SuperHyperNotions? 3012
149
CHAPTER 17 3013
Conclusion and Closing Remarks 3014
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3015
research are illustrated. Some benefits and some advantages of this research are highlighted. 3016
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3017
In this endeavor, two SuperHyperNotions are defined on the SuperHyperMatrix-Based. For 3018
that sake in the second definition, the main definition of the Extreme SuperHyperGraph is 3019
redefined on the position of the alphabets. Based on the new definition for the Extreme 3020
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperMatrix-Based, finds the 3021
convenient background to implement some results based on that. Some SuperHyperClasses 3022
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 3023
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 3024
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 3025
SuperHyperMatrix-Based, the new SuperHyperClasses and SuperHyperClasses, are introduced. 3026
Some general results are gathered in the section on the SuperHyperMatrix-Based and the Extreme 3027
SuperHyperMatrix-Based. The clarifications, instances and literature reviews have taken the 3028
whole way through. In this research, the literature reviews have fulfilled the lines containing 3029
the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph are the 3030
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 3031
based on the connectivities of the moves of the cancer in the longest and strongest styles with 3034
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 3037
benefits and avenues for this research are, figured out, pointed out and spoken out. 3038
151
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperMatrix-Based
3. Extreme SuperHyperMatrix-Based 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3039
Extreme SuperHyperDuality But As The 3040
Super Forms 3042
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3043

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

Va ∈ Ei , Ej ; 3047
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3048
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3049
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3050
Vi , Vj ∈ Ea ; 3051
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3052
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3053
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3054
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3055

SuperHyperDuality. 3056
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3057

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3062
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3063
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3064
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3065
Extreme SuperHyperDuality; 3066
153
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3067

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3068
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3069
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3070
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3071
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3072
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3073

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3074
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3075
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3076
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3077
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3078
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3080
coefficient; 3081
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3082

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

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3100

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3105
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3106
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3107
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3108
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3109

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3110

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3118
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3119
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3120
Extreme coefficient. 3121
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3122
mentioned Extreme Figures in every Extreme items. 3123
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3124
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3125
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- 3132
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3133
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3134
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3135
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3136
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3137
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3138


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

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 3182
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. 3186
(31.1), is the SuperHyperDuality. 3189
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 3191
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3208
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 3210
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

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3214
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3215
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3216
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 : 3219

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3231


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


∃!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 3256
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3257
Extreme SuperHyperDuality. 3263

CHAPTER 19 3264
Extreme SuperHyperJoin But As The 3265
Super Forms 3267
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3268

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3279
|Vj |Extreme CARDINALITY ; 3280
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3281
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3282
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3283

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3287
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3288
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3289
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3290
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3291
167
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3292

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3299
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3300
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3301
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3302
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3303
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3304
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3305
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3306

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3322
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3323
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3325
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3326
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3327

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3330

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

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

SuperHyperJoin. 3351
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 3353
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3354
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3355
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3356
V3 , is excluded in every given Extreme SuperHyperJoin. 3358

is up. The Extreme Algorithm is Extremely straightforward. 3360


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3481
Extreme SuperHyperPerfect But As The 3482
Super Forms 3484
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3485

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3497
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3498

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3502
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3503
Extreme SuperHyperPerfect; 3507
181
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3508

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3515
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3516
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3521
coefficient; 3522
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3523

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3559
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3560
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3561
Extreme coefficient. 3562
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3565
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3566
SuperHyperPerfect. 3572
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 3574
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3575
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3579


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

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

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

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

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



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

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

Then 3670

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



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

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

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


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

CHAPTER 21 3705
Extreme SuperHyperTotal But As The 3706
Super Forms 3708
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3709
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3712
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3713

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3719
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3720

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3724
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3727
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3728
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3729

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3730
195

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3744
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3746
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3747
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3748
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3750
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3751

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3752
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3755
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3756
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3757

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3764
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3765
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3768
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3769
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3770
coefficient; 3771
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3772

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3775
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3776
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3777
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3779
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3782
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3783
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3784
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3785
SuperHyperTotal. 3789
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 3791
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3792
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3793
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3794
V3 , is excluded in every given Extreme SuperHyperTotal. 3796



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3844
(31.1), is the SuperHyperTotal. 3847
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 3849
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. 3856
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 3858
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3920
Extreme SuperHyperConnected But As 3921
The Extensions Excerpt From Dense And 3922
Super Forms 3923
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3924

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3938
SuperHyperConnected. 3939
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3940
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3943

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3945
209
Extreme SuperHyperConnected; 3949
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3950

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3957
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3958
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3959
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3960
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 3963
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3965


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

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

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

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

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

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

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

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

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


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

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

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 4065
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. 4069
(31.1), is the SuperHyperConnected. 4072
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 4074
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. 4081
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 4083



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4102

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


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 4118
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 4119
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4137
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4138
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4139
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4140
Extreme SuperHyperConnected. 4146

CHAPTER 23 4147
Background 4148

223








“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 4265
eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 4266
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 4267
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 4268
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 4269
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 4270
Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 4271

HG262; HG263; HG264; HG265; HG266; HG267], there are some endeavors to formalize 4290
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 4291


HG169b; HG170b; HG171b; HG172b; HG173b]. Two popular scientific research books 4305
in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutrosophic science is on 4306
[HG32b; HG44b]. 4307

HG260; HG261; HG262; HG263; HG264; HG265; HG266; HG267] alongside scientific 4342
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4343


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

Bibliography 4358
10.33140/JMTCM.01.03.09) 4362


229
10.20944/preprints202301.0282.v1). 4395
10.20944/preprints202301.0267.v1). 4398

(doi: 10.20944/preprints202301.0265.v1). 4403
prints202301.0262.v1). 4407
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4413
prints202301.0105.v1). 4416
Preprints 2023, 2023010044 4422
10.20944/preprints202301.0043.v1). 4425

(doi: 10.20944/preprints202212.0549.v1). 4434
(doi: 10.20944/preprints202212.0500.v1). 4441
10.5281/zenodo.7940830). 4450
10.5281/zenodo.7943578). 4453
odo.7916595). 4456
odo.7923632). 4459
(doi: 10.5281/zenodo.7904698). 4462
2023, (doi: 10.5281/zenodo.7904671). 4465

10.5281/zenodo.7871026). 4474
2023, (doi: 10.5281/zenodo.7874647). 4477
10.5281/zenodo.7857856). 4480
2023, (doi: 10.5281/zenodo.7857841). 4483
10.5281/zenodo.7853867). 4492
10.5281/zenodo.7853922). 4495
(doi: 10.5281/zenodo.7851519). 4498
(doi: 10.5281/zenodo.7851550). 4501

10.5281/zenodo.7834229). 4510
10.5281/zenodo.7834261). 4513
10.5281/zenodo.7824560). 4516
(doi: 10.5281/zenodo.7824623). 4519
2023, (doi: 10.5281/zenodo.7809365). 4530
2023, (doi: 10.5281/zenodo.7809358). 4533
10.5281/zenodo.7809219). 4536
10.5281/zenodo.7809328). 4539
2023, (doi: 10.5281/zenodo.7806767). 4542

2023, (doi: 10.5281/zenodo.7806838). 4545
10.5281/zenodo.7799902). 4554
(doi: 10.5281/zenodo.7804218). 4557
(doi: 10.5281/zenodo.7796334). 4560
10.5281/zenodo.7791952). 4566
10.5281/zenodo.7791982). 4569
10.5281/zenodo.7790026). 4572
10.5281/zenodo.7790052). 4575
2023, (doi: 10.5281/zenodo.7787066). 4578

10.5281/zenodo.7781476). 4584
10.5281/zenodo.7783082). 4587
10.5281/zenodo.7777857). 4590
10.5281/zenodo.7779286). 4593
(doi: 10.5281/zenodo.7771831). 4596
2023, (doi: 10.5281/zenodo.7772468). 4599
10.13140/RG.2.2.20913.25446). 4602
odo.7764916). 4605
10.13140/RG.2.2.11770.98247). 4608
10.13140/RG.2.2.12400.12808). 4611
2023, (doi: 10.13140/RG.2.2.22545.10089). 4614
10.13140/RG.2.2.11377.76644). 4620

10.13140/RG.2.2.23750.96329). 4623
10.13140/RG.2.2.31366.24641). 4626
10.13140/RG.2.2.34721.68960). 4629
2023, (doi: 10.13140/RG.2.2.30212.81289). 4632
10.13140/RG.2.2.24288.35842). 4638
10.13140/RG.2.2.32467.25124). 4641
10.13140/RG.2.2.31025.45925). 4644
10.13140/RG.2.2.17184.25602). 4647
10.13140/RG.2.2.23423.28327). 4650
10.13140/RG.2.2.28456.44805). 4653
10.13140/RG.2.2.23525.68320). 4656
10.13140/RG.2.2.20170.24000). 4659

10.13140/RG.2.2.36475.59683). 4662
10.13140/RG.2.2.29764.71046). 4665
2023, (doi: 10.13140/RG.2.2.18780.87683). 4668
10.13140/RG.2.2.26134.01603). 4674
10.13140/RG.2.2.27392.30721). 4677
10.13140/RG.2.2.33028.40321). 4680
10.13140/RG.2.2.21389.20966). 4683
10.13140/RG.2.2.16356.04489). 4686
10.13140/RG.2.2.21756.21129). 4689
10.13140/RG.2.2.30983.68009). 4692
10.13140/RG.2.2.28552.29445). 4695
(doi: 10.13140/RG.2.2.10936.21761). 4698

10.13140/RG.2.2.35105.89447). 4701
(doi: 10.13140/RG.2.2.30072.72960). 4704
10.13140/RG.2.2.31147.52003). 4707
10.13140/RG.2.2.32825.24163). 4710
10.13140/RG.2.2.13059.58401). 4713
10.13140/RG.2.2.11172.14720). 4716
2023, (doi: 10.13140/RG.2.2.22011.80165). 4719
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4722
2023, (doi: 10.13140/RG.2.2.10493.84962). 4725
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4728
2023, (doi: 10.13140/RG.2.2.19944.14086). 4731
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4734
(doi: 10.13140/RG.2.2.33103.76968). 4737

(doi: 10.13140/RG.2.2.23037.44003). 4740
(doi: 10.13140/RG.2.2.35646.56641). 4743
10.13140/RG.2.2.18030.48967). 4746
(doi: 10.13140/RG.2.2.13973.81121). 4749
2023, (doi: 10.13140/RG.2.2.34106.47047). 4752
2023, (doi: 10.13140/RG.2.2.31956.88961). 4758
2023, (doi: 10.13140/RG.2.2.15179.67361). 4761
10.13140/RG.2.2.21510.45125). 4764
2023, (doi: 10.13140/RG.2.2.13121.84321). 4767
10.13140/RG.2.2.11758.69441). 4770
2023, (doi: 10.13140/RG.2.2.31891.35367). 4773
10.13140/RG.2.2.19360.87048). 4776

10.13140/RG.2.2.32363.21286). 4779
10.13140/RG.2.2.23266.81602). 4782
10.13140/RG.2.2.19911.37285). 4785
10.13140/RG.2.2.11050.90569). 4788
2023, (doi: 10.13140/RG.2.2.17761.79206). 4791
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4797
(doi: 10.13140/RG.2.2.30182.50241). 4800


2023, (doi: 10.13140/RG.2.2.17252.24968). 4833
2023010396 (doi: 10.20944/preprints202301.0396.v1). 4842

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



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


10.20944/preprints202301.0282.v1). 4866
10.20944/preprints202301.0267.v1).). 4869

(doi: 10.20944/preprints202301.0265.v1). 4874
prints202301.0262.v1). 4878

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

10.13140/RG.2.2.35061.65767). 4887
10.13140/RG.2.2.18494.15680). 4891

10.13140/RG.2.2.32530.73922). 4895
10.13140/RG.2.2.15897.70243). 4899
10.13140/RG.2.2.32530.73922). 4903
prints202301.0105.v1). 4906
10.13140/RG.2.2.23172.19849). 4913


10.13140/RG.2.2.17385.36968). 4923

Preprints 2023, 2023010044 4926
10.20944/preprints202301.0043.v1). 4929

2023, (doi: 10.13140/RG.2.2.28945.92007). 4932

10.13140/RG.2.2.35774.77123). 4938
10.13140/RG.2.2.29430.88642). 4944

(doi: 10.20944/preprints202212.0549.v1). 4950
10.13140/RG.2.2.19380.94084). 4953

(doi: 10.20944/preprints202212.0500.v1). 4964
10.13140/RG.2.2.20993.12640). 4967



10.13140/RG.2.2.29173.86244). 4982
odo.7943878). 4987
10.5281/zenodo.7943871). 4989
10.5281/zenodo.7923786). 4991
2023 (doi: 10.5281/zenodo.7905287). 4993

2023 (doi: 10.5281/zenodo.7874677). 4997
(doi: 10.5281/zenodo.7857906). 4999
2023 (doi: 10.5281/zenodo.7856329). 5001
10.5281/zenodo.7854561). 5003

2023 (doi: 10.5281/zenodo.7851893). 5005

(doi: 10.5281/zenodo.7835063). 5009
(doi: 10.5281/zenodo.7826705). 5011
2023 (doi: 10.5281/zenodo.7820680). 5013
10.5281/zenodo.7812750). 5015


2023 (doi: 10.5281/zenodo.7807782). 5021
2023 (doi: 10.5281/zenodo.7804449). 5023

(doi: 10.5281/zenodo.7792307). 5027
(doi: 10.5281/zenodo.7790728). 5029
2023 (doi: 10.5281/zenodo.7787712). 5031
10.5281/zenodo.7783791). 5033
10.5281/zenodo.7780123). 5035
(doi: 10.5281/zenodo.7773119). 5037
odo.7637762). 5039

10.5281/zenodo.7766174). 5041
10.5281/zenodo.7762232). 5043
(doi: 10.5281/zenodo.7758601). 5045
10.5281/zenodo.7754661). 5047
10.5281/zenodo.7750995) . 5049
(doi: 10.5281/zenodo.7749875). 5051
10.5281/zenodo.7747236). 5053
10.5281/zenodo.7742587). 5055
(doi: 10.5281/zenodo.7738635). 5057
10.5281/zenodo.7734719). 5059
10.5281/zenodo.7730484). 5061
(doi: 10.5281/zenodo.7730469). 5063
10.5281/zenodo.7722865). 5065
odo.7713563). 5067
odo.7709116). 5069
10.5281/zenodo.7706415). 5071
10.5281/zenodo.7706063). 5073
10.5281/zenodo.7701906). 5075

odo.7700205). 5077
10.5281/zenodo.7694876). 5079
10.5281/zenodo.7679410). 5081
10.5281/zenodo.7675982). 5083
10.5281/zenodo.7672388). 5085
odo.7668648). 5087
10.5281/zenodo.7662810). 5089
10.5281/zenodo.7659162). 5091
odo.7653233). 5093
odo.7653204). 5095
odo.7653142). 5097
odo.7653117). 5099
odo.7651687). 5102
odo.7651619). 5104
odo.7651439). 5106
odo.7650729). 5108
odo.7647868). 5110

odo.7647017). 5112
odo.7644894). 5114
odo.7632923). 5117
odo.7623459). 5119
10.5281/zenodo.7606416). 5121
10.5281/zenodo.7606416). 5123
odo.7606404). 5125
10.5281/zenodo.7580018). 5127
odo.7580018). 5129
odo.7580018). 5131
odo.7579929). 5133
10.5281/zenodo.7563170). 5135
odo.7563164). 5137
odo.7563160). 5139
odo.7563160). 5141
10.5281/zenodo.7563160). 5143
10.5281/zenodo.7557063). 5145

10.5281/zenodo.7557009). 5147
10.5281/zenodo.7539484). 5149
10.5281/zenodo.7523390). 5151
10.5281/zenodo.7523390). 5153
10.5281/zenodo.7523390). 5155
odo.7574952). 5157
10.5281/zenodo.7574992). 5159
odo.7523357). 5161
10.5281/zenodo.7523357). 5163
10.5281/zenodo.7504782). 5165
10.5281/zenodo.7504782). 5167
10.5281/zenodo.7504782). 5169
10.5281/zenodo.7499395). 5171
odo.7499395). 5173
10.5281/zenodo.7499395). 5175
10.5281/zenodo.7497450). 5177
10.5281/zenodo.7497450). 5179
10.5281/zenodo.7494862). 5181

odo.7494862). 5183
10.5281/zenodo.7494862). 5185
10.5281/zenodo.7493845). 5187
odo.7493845). 5189
10.5281/zenodo.7493845). 5191
odo.7539484). 5193
odo.7523390). 5195
odo.7523357). 5197
odo.7504782). 5199
odo.7499395). 5201
odo.7497450). 5203
odo.7494862). 5205
odo.7493845). 5207
odo.7480110). 5209
odo.7378758). 5211
odo.6320305). 5213
odo.6677173). 5215

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5296
Then the research has taken more motivations to define SuperHyperClasses and to find some 5297
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5298
some instances and examples to make clarifications about the framework of this research. The 5299
general results and some results about some connections are some avenues to make key point of 5300
this research, “Cancer’s Recognition”, more understandable and more clear. 5301
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5302
research on the modeling of the regions where are under the attacks of the cancer to 5303
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5304
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5305
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5306
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5307

instances and literature reviews have taken the whole way through. In this scientific research, 5308
the literature reviews have fulfilled the lines containing the notions and the results. The 5309
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5310
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5311
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5312
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5313
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5314
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5315
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5316
to figure out the background for the SuperHyperNotions. 5317

CHAPTER 25 5318
Neutrosophic Matrix-Based 5319
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5320
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5321
2023, (doi: 10.13140/RG.2.2.34953.52320). 5322

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5323
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5324
(doi: 10.13140/RG.2.2.33275.80161). 5325
10.13140/RG.2.2.11050.90569). 5328
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5329
10.13140/RG.2.2.17761.79206). 5331
10.13140/RG.2.2.19911.37285). 5334
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5335
10.13140/RG.2.2.23266.81602). 5337
10.13140/RG.2.2.19360.87048). 5340
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5341
10.13140/RG.2.2.32363.21286). 5343
10.13140/RG.2.2.11758.69441). 5346
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5347
10.13140/RG.2.2.31891.35367). 5349
10.13140/RG.2.2.21510.45125). 5352
257
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5353
10.13140/RG.2.2.13121.84321). 5355

CHAPTER 26 5356
New Ideas In Recognition of Cancer And 5357
Neutrosophic SuperHyperGraph By 5358
Matrix-Based As Hyper mat On Super 5359
matte 5360
259
CHAPTER 27 5361
ABSTRACT 5362
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperMatrix-Based). 5363

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Matrix-Based pair S = (V, E). Consider 5364
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 5365
V 0 or E 0 is called Neutrosophic e-SuperHyperMatrix-Based if the following expression is called 5366
Neutrosophic e-SuperHyperMatrix-Based criteria holds 5367
Neutrosophic re-SuperHyperMatrix-Based if the following expression is called Neutrosophic e- 5368
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic v- 5370

SuperHyperMatrix-Based if the following expression is called Neutrosophic v-SuperHyperMatrix-Based 5371
criteria holds 5372
Neutrosophic rv-SuperHyperMatrix-Based if the following expression is called Neutrosophic v- 5373
and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic 5375

SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix-Based, Neutrosophic 5376
re-SuperHyperMatrix-Based, Neutrosophic v-SuperHyperMatrix-Based, and Neutrosophic rv- 5377
SuperHyperMatrix-Based. ((Neutrosophic) SuperHyperMatrix-Based). Assume a Neutrosophic 5378
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5379

(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperMatrix-Based if it’s either 5380
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 5383
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consec- 5384
utive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5385
261
that they form the Extreme SuperHyperMatrix-Based; a Neutrosophic SuperHyperMatrix-Based if it’s 5386
either of Neutrosophic e-SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutro- 5387
sophic v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for 5388
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 5389
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5390
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5391
such that they form the Neutrosophic SuperHyperMatrix-Based; an Extreme SuperHyperMatrix- 5392
rv-SuperHyperMatrix-Based and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 5395
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 5396
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 5397

Extreme SuperHyperVertices such that they form the Extreme SuperHyperMatrix-Based; and the 5399
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperMatrix- 5400
is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined 5404

as the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 5405
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 5406
secutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 5407
they form the Neutrosophic SuperHyperMatrix-Based; and the Neutrosophic power is corres- 5408
ponded to its Neutrosophic coefficient; an Extreme V-SuperHyperMatrix-Based if it’s either 5409
of Neutrosophic e-SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutro- 5410

sophic v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) 5411
SuperHyperVertices such that they form the Extreme SuperHyperMatrix-Based; a Neutro- 5415
sophic V-SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix-Based, Neut- 5416

rosophic re-SuperHyperMatrix-Based, Neutrosophic v-SuperHyperMatrix-Based, and Neutrosophic 5417
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5421
SuperHyperMatrix-Based; an Extreme V-SuperHyperMatrix-Based SuperHyperPolynomial if it’s either 5422
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 5425
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5426
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme car- 5427

dinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5428
they form the Extreme SuperHyperMatrix-Based; and the Extreme power is corresponded to its 5429
Extreme coefficient; a Neutrosophic SuperHyperMatrix-Based SuperHyperPolynomial if it’s either 5430

v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for a Neut- 5432
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5433
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5434
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 5435
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 5436
SuperHyperVertices such that they form the Neutrosophic SuperHyperMatrix-Based; and the 5437
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5438
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperMatrix-Based and 5439
Neutrosophic SuperHyperMatrix-Based. Two different types of SuperHyperDefinitions are debut 5440
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5441
Recognition” are the under research to figure out the challenges make sense about ongoing and 5448
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5449
are different types of them. Some of them are individuals and some of them are well-modeled 5450
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 5451
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 5452
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 5453
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 5454
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 5455
this research. It’s also officially collected in the form of some questions and some problems. 5456
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperMatrix-Based 5457
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperMatrix-Based is a maximal 5462

Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 5463
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 5464
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5465
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5467

Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5468
SuperHyperMatrix-Based . Since there’s more ways to get type-results to make a SuperHyperMatrix- 5469
Based more understandable. For the sake of having Neutrosophic SuperHyperMatrix-Based, there’s 5470
a need to “redefine” the notion of a “SuperHyperMatrix-Based ”. The SuperHyperVertices and the 5471
there’s the usage of the position of labels to assign to the values. Assume a SuperHyperMatrix-Based 5473
. It’s redefined a Neutrosophic SuperHyperMatrix-Based if the mentioned Table holds, concerning, 5474
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 5475
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 5476
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 5477

Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 5478
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 5479
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 5480
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on a 5481
SuperHyperMatrix-Based . It’s the main. It’ll be disciplinary to have the foundation of previous 5482
definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperMatrix-Based 5483
until the SuperHyperMatrix-Based, then it’s officially called a “SuperHyperMatrix-Based” but other- 5484
wise, it isn’t a SuperHyperMatrix-Based . There are some instances about the clarifications for the 5485
main definition titled a “SuperHyperMatrix-Based ”. These two examples get more scrutiny and 5486
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 5487
on a SuperHyperMatrix-Based . For the sake of having a Neutrosophic SuperHyperMatrix-Based, 5488
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperMatrix-Based” and a 5489
“Neutrosophic SuperHyperMatrix-Based ”. The SuperHyperVertices and the SuperHyperEdges 5490

are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 5491
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 5492
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 5493
SuperHyperMatrix-Based are redefined to a “Neutrosophic SuperHyperMatrix-Based” if the intended 5494
Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s 5495
more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperMatrix-Based 5496

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperMatrix-Based, 5498
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, 5499
are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperMatrix-Based”, “Neutrosophic Su- 5500
perHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 5501
a “Neutrosophic SuperHyperMatrix-Based” where it’s the strongest [the maximum Neutrosophic 5503
value from all the SuperHyperMatrix-Based amid the maximum value amid all SuperHyperVertices 5504
from a SuperHyperMatrix-Based .] SuperHyperMatrix-Based . A graph is a SuperHyperUniform 5505
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5506
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 5507
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5508
with two exceptions; it’s SuperHyperMatrix-Based if it’s only one SuperVertex as intersection amid 5509
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 5510
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 5511

sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 5515
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 5516

Recognition” and the results and the definitions will be introduced in redeemed ways. The 5525
recognition of the cancer in the long-term function. The specific region has been assigned 5526
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 5527
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 5530
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 5531
done. There are some specific models, which are well-known and they’ve got the names, and 5532
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 5533
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 5534
SuperHyperPath(-/SuperHyperMatrix-Based, SuperHyperStar, SuperHyperBipartite, SuperHyper- 5535
Multipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperMatrix-Based or 5536
the strongest SuperHyperMatrix-Based in those Neutrosophic SuperHyperModels. For the longest 5537
SuperHyperMatrix-Based, called SuperHyperMatrix-Based, and the strongest SuperHyperMatrix-Based, 5538
called Neutrosophic SuperHyperMatrix-Based, some general results are introduced. Beyond that 5539
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5540
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5541
SuperHyperMatrix-Based. There isn’t any formation of any SuperHyperMatrix-Based but literarily, 5542
it’s the deformation of any SuperHyperMatrix-Based. It, literarily, deforms and it doesn’t form. 5543
A basic familiarity with Neutrosophic SuperHyperMatrix-Based theory, SuperHyperGraphs, and 5544
Neutrosophic SuperHyperGraphs theory are proposed. 5545
Keywords: Neutrosophic SuperHyperGraph, SuperHyperMatrix-Based, Cancer’s Neutrosophic 5546
Recognition 5547

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

the research has taken more motivations to define SuperHyperClasses and to find some 5609
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us 5610
to get some instances and examples to make clarifications about the framework of this research. 5611
The general results and some results about some connections are some avenues to make key 5612
point of this research, “Cancer’s Recognition”, more understandable and more clear. 5613
The framework of this research is as follows. In the beginning, I introduce basic definitions 5614
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5615
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5616
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5617
review literature are applied to make sense about what’s going to figure out about the upcoming 5618
sections. The main definitions and their clarifications alongside some results about new 5619
notions, SuperHyperMatrix-Based and Neutrosophic SuperHyperMatrix-Based, are figured out in 5620

sections “ SuperHyperMatrix-Based” and “Neutrosophic SuperHyperMatrix-Based”. In the sense of 5621
tackling on getting results and in Matrix-Based to make sense about continuing the research, 5622
the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5623
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5624
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5625
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5626

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5627
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5628
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5629
and as concluding and closing section of theoretical research are contained in the section “General 5630
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5631
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 5632
SuperHyperMatrix-Based”, “Neutrosophic SuperHyperMatrix-Based”, “Results on SuperHyperClasses” 5633

and “Results on Neutrosophic SuperHyperClasses”. There are curious questions about what’s 5634
done about the SuperHyperNotions to make sense about excellency of this research and 5635
going to figure out the word “best” as the description and adjective for this research as 5636
presented in section, “ SuperHyperMatrix-Based”. The keyword of this research debut in the section 5637
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5638
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5639
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5640
are some scrutiny and discernment on what’s done and what’s happened in this research in 5641
the terms of “questions” and “problems” to make sense to figure out this research in featured 5642
style. The advantages and the limitations of this research alongside about what’s done in this 5643
research to make sense and to get sense about what’s figured out are included in the section, 5644
“Conclusion and Closing Remarks”. 5645

CHAPTER 29 5646
Neutrosophic Preliminaries Of This 5647
Scientific Research On the Redeemed 5648
Ways 5649
In this section, the basic material in this scientific research, is referred to [Single Valued 5650
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5651

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5652
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5653
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5654
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5655
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5656
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5657
their clarifications are addressed to Ref.[HG38]. 5658
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5659
the new ideas and their clarifications are elicited. 5660
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

Let X be a Matrix-Based 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}.
271

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

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5700
x, y, z, w ∈ [0, 1]: 5701
(i) 1 ⊗ x = x; 5702
(ii) x ⊗ y = y ⊗ x; 5703
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5704
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5705

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

where 5708

1, 2, . . . , n0 ); 5713
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5714
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5715
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5716
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5717
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5729
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5730
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5731
SuperEdge; 5737
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5740
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5741
makes the patterns and regularities. 5742
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5743
of elements of SuperHyperEdges are the same. 5744

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5745
makes to have SuperHyperUniform more understandable. 5746
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5747
Classes as follows. 5748
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5749
two given SuperHyperEdges with two exceptions; 5750
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5751
SuperHyperEdges; 5752
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5753
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5754
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5755
in common; 5756
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5757
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5758
SuperHyperEdge in common; 5759
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5760
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5761
SuperVertex. 5762
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 5763
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5764
(i) Vi , Vi+1 ∈ Ei0 ; 5765
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5766
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5767
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5768
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5769
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5770
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5771
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5772
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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

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

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5798
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5799
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5800
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperMatrix-Based). 5801

(i) Neutrosophic e-SuperHyperMatrix-Based if the following expression is called Neutro- 5805
sophic e-SuperHyperMatrix-Based criteria holds 5806
(ii) Neutrosophic re-SuperHyperMatrix-Based if the following expression is called Neut- 5807

rosophic re-SuperHyperMatrix-Based criteria holds 5808
and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 5809
(iii) Neutrosophic v-SuperHyperMatrix-Based if the following expression is called Neutro- 5810

sophic v-SuperHyperMatrix-Based criteria holds 5811
(iv) Neutrosophic rv-SuperHyperMatrix-Based if the following expression is called Neut- 5812

rosophic v-SuperHyperMatrix-Based criteria holds 5813

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 5814
(v) Neutrosophic SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix- 5815

Neutrosophic rv-SuperHyperMatrix-Based. 5817
Definition 29.0.19. ((Neutrosophic) SuperHyperMatrix-Based). 5818

(i) an Extreme SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix- 5821


(ii) a Neutrosophic SuperHyperMatrix-Based if it’s either of Neutrosophic e- 5828

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinal- 5831
ity of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 5832
(iii) an Extreme SuperHyperMatrix-Based SuperHyperPolynomial if it’s either of Neut- 5835
rosophic e-SuperHyperMatrix-Based, Neutrosophic re-SuperHyperMatrix-Based, Neutrosophic 5836

v-SuperHyperMatrix-Based, and Neutrosophic rv-SuperHyperMatrix-Based and C(N SHG) for 5837
tices such that they form the Extreme SuperHyperMatrix-Based; and the Extreme power is 5842
(iv) a Neutrosophic SuperHyperMatrix-Based SuperHyperPolynomial if it’s either of 5844

(v) an Extreme V-SuperHyperMatrix-Based if it’s either of Neutrosophic e-SuperHyperMatrix- 5854

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5858
(vi) a Neutrosophic V-SuperHyperMatrix-Based if it’s either of Neutrosophic e- 5861

(vii) an Extreme V-SuperHyperMatrix-Based SuperHyperPolynomial if it’s either of 5868


Extreme SuperHyperVertices such that they form the Extreme SuperHyperMatrix-Based; 5875
(viii) a Neutrosophic SuperHyperMatrix-Based SuperHyperPolynomial if it’s either of 5877


Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperMatrix-Based). 5887

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5888
(i) an δ−SuperHyperMatrix-Based is a Neutrosophic kind of Neutrosophic SuperHyperMatrix- 5889
Based such that either of the following expressions hold for the Neutrosophic cardinalities 5890
of SuperHyperNeighbors of s ∈ S : 5891
|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 5892

(29.1), holds if S is an δ−SuperHyperDefensive; 5893
(ii) a Neutrosophic δ−SuperHyperMatrix-Based is a Neutrosophic kind of Neutrosophic 5894

SuperHyperMatrix-Based such that either of the following Neutrosophic expressions hold for 5895
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5896
|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 5897

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5898
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 5900
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 5901
of the position of labels to assign to the values. 5902
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5904


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

136TBL4
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5905
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5906
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5908
sophic SuperHyperPath , SuperHyperMatrix-Based, SuperHyperStar, SuperHyperBipartite, Super- 5909
HyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutro- 5910
sophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic SuperHy- 5911
perBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic SuperHy- 5912

perWheel if the Table (29.2) holds. 5913
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperMatrix-Based. Since 5914

there’s more ways to get type-results to make a Neutrosophic SuperHyperMatrix-Based more 5915
Neutrosophicly understandable. 5916
Neutrosophic notion of “Neutrosophic SuperHyperMatrix-Based”. The SuperHyperVertices and the 5918
there’s the usage of the position of labels to assign to the values. 5920
136DEF1 Definition 29.0.23. Assume a SuperHyperMatrix-Based. It’s redefined a Neutrosophic 5921

SuperHyperMatrix-Based if the Table (29.3) holds. 5922


136TBL1

CHAPTER 30 5923
Neutrosophic SuperHyper But As The Matrix-Based 5924
Super Forms 5926
Definition 30.0.1. (Neutrosophic event). 5927

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5928
is a probability Matrix-Based. Any Neutrosophic k-subset of A of V is called Neutrosophic 5929
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5930
following expression is called Neutrosophic probability of A. 5931
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5932

is a probability Matrix-Based. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic s- 5934
independent if the following expression is called Neutrosophic s-independent criteria 5935
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. 5936

The following expression is called Neutrosophic independent criteria 5937
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 5938

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5939
a probability Matrix-Based. Any k-function Matrix-Based like E is called Neutrosophic k-Variable. 5940
If k = 2, then any 2-function Matrix-Based like E is called Neutrosophic Variable. 5941
The notion of independent on Neutrosophic Variable is likewise. 5942
Definition 30.0.4. (Neutrosophic Expectation). 5943
283
is a probability Matrix-Based. A Neutrosophic k-Variable E has a number is called Neutrosophic 5945

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

is a probability Matrix-Based. A Neutrosophic number is called Neutrosophic Crossing if the 5949

following expression is called Neutrosophic Crossing criteria 5950
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). 5951
Consider S = (V, E) is a probability Matrix-Based. Let m and n propose special Matrix-Based. Then 5952
with m ≥ 4n, 5953
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 Matrix-Based 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: 5954
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5955
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5956
plane, and let l be the Neutrosophic number √of SuperHyperLines in the plane passing through at 5958
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5959
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 5960

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

plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5968
k < 5n4/3 . 5969
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5970
S = (V, E) is a probability Matrix-Based. Draw a SuperHyperUnit SuperHyperCircle around 5971

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5978
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5979
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5980
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5981
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5982
4/3 4/3
k < 4n + n < 5n . 5983
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5984
Consider S = (V, E) is a probability Matrix-Based. Let X be a nonnegative Neutrosophic Variable 5985
and t a positive real number. Then 5986
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. 5987
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5988
Consider S = (V, E) is a probability Matrix-Based. Let Xn be a nonnegative integer-valued variable 5989
in a probability Matrix-Based (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as 5990

n → ∞. 5991
Proof. 5992
Consider S = (V, E) is a probability Matrix-Based. A special SuperHyperGraph in Gn,p almost 5994
surely has stability number at most d2p−1 log ne. 5995

S = (V, E) is a probability Matrix-Based. A special SuperHyperGraph in Gn,p is up. Let G ∈ Gn,p 5997
and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. The 5998
probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability 5999
that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 6000
Neutrosophic SuperHyperGraph G. 6001
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6002
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6003
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 6004
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6005
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: 6006
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6007
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 6008
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6009
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6010
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6011
Definition 30.0.12. (Neutrosophic Variance). 6012

is a probability Matrix-Based. A Neutrosophic k-Variable E has a number is called Neutrosophic 6014
Variance if the following expression is called Neutrosophic Variance criteria 6015
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Matrix-Based. Let X be a Neutrosophic Variable and let t be a 6017
positive real number. Then 6018
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Matrix-Based. Let X be a Neutrosophic Variable and let t be a positive 6020
real number. Then 6021
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
6022
Consider S = (V, E) is a probability Matrix-Based. Let Xn be a Neutrosophic Variable in a probability 6024
2
Matrix-Based (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E (Xn ), then 6025
E(Xn = 0) → 0 as n → ∞
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 6026
(V, E) is a probability Matrix-Based. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s Inequality, and 6027
observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 6028
when Xn = 0. 6029
Consider S = (V, E) is a probability Matrix-Based. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6031
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 6032
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6033
S = (V, E) is a probability Matrix-Based. As in the proof of related Theorem, the result is 6035
Consider S = (V, E) is a probability Matrix-Based. Let G ∈ Gn,1/2 and let f and k ∗ be as defined 6038
in previous Theorem. Then either: 6039
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6040
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6041
Definition 30.0.17. (Neutrosophic Threshold). 6044

is a probability Matrix-Based. Let P be a monotone property of SuperHyperGraphs (one which is 6046

preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for P is a 6047
function f (n) such that: 6048
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6049
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6050

Definition 30.0.18. (Neutrosophic Balanced). 6051

is a probability Matrix-Based. Let F be a fixed Neutrosophic SuperHyperGraph. Then there 6053
is a threshold function for the property of containing a copy of F as a Neutrosophic 6054
SubSuperHyperGraph is called Neutrosophic Balanced. 6055
Consider S = (V, E) is a probability Matrix-Based. Let F be a nonempty balanced Neutrosophic 6057
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 6058
threshold function for the property of containing F as a Neutrosophic SubSuperHyperGraph. 6059
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6062
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6063
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6064

SuperHyperMatrix-Based, is up. The Neutrosophic Algorithm is Neutrosophicly straight- 6065
forward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop 6066
Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the 6067
terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHy- 6068
perEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated 6069

means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6070
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6071
C(N SHG)Neutrosophic Matrix-Based =

 
0 1 0 1
0 0 0 1
 
0 0 0 0
0 0 0 1
C(N SHG)Neutrosophic Matrix-Based SuperHyperPolynomial
= 2z.
C(N SHG)Neutrosophic V-Matrix-Based =
 
0 1 0 1
1 0 0 1
 
0 0 0 0
1 1 0 0
C(N SHG)Neutrosophic V-Matrix-Based SuperHyperPolynomial
= z3.
6073

SuperHyperMatrix-Based, is up. The Neutrosophic Algorithm is Neutrosophicly straight- 6075
forward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a 6076

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

Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.3) 136NSHG1
Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeigh- 6077

bor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 6078
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no Neutrosophic Super- 6079

HyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, 6080
V3 , is excluded in every given Neutrosophic SuperHyperMatrix-Based. 6081

 
0 0 0 1
0 0 0 1
 
0 0 0 0
0 0 0 1
= 3z.
 
0 1 0 1
1 0 0 1
 
0 0 0 0
1 1 0 0
= z3.
6082
SuperHyperMatrix-Based, is up. The Neutrosophic Algorithm is Neutrosophicly straightfor- 6084


ward. 6085

 
0 0 0 1
0 0 0 1
0 0 0 1
= 3z.
 
0 1 1
1 0 1
1 1 0
= z3.
6086

ward. 6089


 
0 0 0 1 1
0 0 0 1 1
 
1 0 0 1 1
 
1 1 0 0 0
 
0 0 1 1 1
 
1 1 0 0 0
 
0 0 0 1 1
0 2 0 0 0
= z3 + z2.
 
0 1 1 0 1 0 1 0
1 0 1 0 1 0 1 0
 
1 1 0 1 1 0 1 0
 
0 0 1 0 0 1 0 1
 
1 1 1 0 0 0 1 0
 
0 0 1 1 0 0 0 1
 
1 1 1 0 1 0 0 0
0 0 0 1 0 1 0 0
= 2z 5 + 2z 3 .
6090


ward. 6093

 
1 0 0 0
0 1 0 0
 
0 0 1 0
 
0 0 0 1
1 1 1 1
= z4.
 
0 0 0 0 1
0 0 0 0 1
 
0 0 0 0 1
 
0 0 0 0 1
0 0 0 0 1
= z.
6094

ward. 6097


 
0 ... 1 ... 1 ... 0
0
 ... 1 ... 1 ... 0 
. . . ... ... ... ... ... . . .
0 ... 1 ... 1 ... 0
= za.
 
0 ... 1 ... 1 ... 1 ... 0
 0 ... 1 ... 1 ... 1 ... 0
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
0 ... 1 ... 1 ... 1 ... 0
= zb.
6098

ward. 6101


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6102

ward. 6105


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6106

ward. 6109


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6110

ward. 6113


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6114

ward. 6117


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6118

ward. 6121


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6122

ward. 6125


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6126

ward. 6129


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6130

ward. 6133


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.


6134

ward. 6137

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6138



ward. 6141

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6142

ward. 6145


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6146

ward. 6149


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6150

ward. 6153


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6154

ward. 6157


 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
6158

ward. 6161


Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.3) 95NHG1
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . ... ... ... ... ... ... ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.


Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.3) 95NHG2
6162
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6163
The all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Matrix- 6164
Based if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6165
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6166
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6167
them. 6168
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6169

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6170
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6171
Neutrosophic quasi-R-Matrix-Based minus all Neutrosophic SuperHypeNeighbor to some of them 6172
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6173
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6174
quasi-R-Matrix-Based, minus all Neutrosophic SuperHypeNeighbor to some of them but not all of 6175
them. 6176
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-Matrix-Based is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Matrix-Based is at least 6177
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6178
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6179
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6180
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Matrix- 6181
Based in some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 6182
maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6183

SuperHyperVertices are contained in a Neutrosophic R-Matrix-Based. 6184
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Matrix-Based 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-Matrix-Based with the least Neutrosophic cardinality, the 6185
lower sharp Neutrosophic bound for cardinality. 6186
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6187

(V, E). Then in the worst case, literally, 6188
C(N SHG)N eutrosophicQuasi−M atrix−Based

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−M atrix−BasedSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−M atrix−Based = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−M atrix−BasedSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Matrix-Based. In other words, the least cardinality, the lower sharp 6189
bound for the cardinality, of a Neutrosophic type-result-Matrix-Based is the cardinality of 6190

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−M atrix−BasedSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−M atrix−Based = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−M atrix−BasedSuperHyperP 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-Matrix-Based 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-Matrix-Based. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Matrix-Based 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-Matrix-Based. 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-Matrix-Based decorates the Neutrosophic Supe-
rHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic style
implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutrosophic
cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower Neutro-
sophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHyperVertices
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-Matrix-Based. Since at least two Neutrosophic SuperHyperVertices
involve to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of Neut-
rosophic 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 Neutrosophic 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 Neutro-
sophic SuperHyperEdge thus there’s at least a Neutrosophic R-Matrix-Based has the Neutrosophic
cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Matrix-Based has the
Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge. Assume a Neutrosophic
SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a Neutrosophic R-Matrix-Based
since either the Neutrosophic SuperHyperGraph is an obvious Neutrosophic SuperHyperModel
thus it never happens since there’s no Neutrosophic usage of this Neutrosophic framework and
even more there’s no Neutrosophic connection inside or the Neutrosophic SuperHyperGraph
isn’t obvious and as its consequences, there’s a Neutrosophic contradiction with the term
“Neutrosophic R-Matrix-Based” 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-Matrix-Based 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-Matrix-Based 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-Matrix-Based. Those
Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-Matrix-Based.
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-Matrix-Based is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Matrix-Based but with
slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z
and
E
is formalized with mathematical literatures on the Neutrosophic R-Matrix-Based. Let Zi ∼ Zj ,
be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the Neutrosophic
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6191
Neutrosophic R-Matrix-Based =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6192
Neutrosophic R-Matrix-Based =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Matrix-Based where E ∈ EESHG:(V,E) is fixed

that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices but in
a Neutrosophic Matrix-Based, 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-Matrix-Based is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Matrix-Based is at least 6193
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6194
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6195
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6196
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic 6197
Matrix-Based in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 6198

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6199
SuperHyperVertices are contained in a Neutrosophic R-Matrix-Based. 6200
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6201
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6202
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6203
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6204
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6205

to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6206
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6207
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6208
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6209
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms 6210
a Neutrosophic quasi-R-Matrix-Based where the Neutrosophic completion of the Neutrosophic 6211

incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Matrix-Based. The 6212
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6213
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyper- 6214
Cardinality. Thus the embedded setting is elected such that those SuperHyperSets have the 6215
maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOptimal. 6216
The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6217
minimum Neutrosophic style of the embedded Neutrosophic R-Matrix-Based. The interior types 6218
of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6219
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6220
common connections, more precise and more formal, the perfect unique connections inside the 6221
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the 6222
Neutrosophic R-Matrix-Based. Thus Neutrosophic exterior SuperHyperVertices could be used only 6223
in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior 6224
Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded 6225
Neutrosophic Matrix-Based, there’s the usage of exterior Neutrosophic SuperHyperVertices since 6226
they’ve more connections inside more than outside. Thus the title “exterior” is more relevant 6227
than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. 6228
Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one 6229
SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the 6230
Neutrosophic R-Matrix-Based. The Neutrosophic R-Matrix-Based with the exclusion of the exclusion 6231
of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other 6232
terms, the Neutrosophic R-Matrix-Based with the inclusion of all Neutrosophic SuperHyperVertices 6233
in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Matrix-Based. To sum them 6234

up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6235
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6236
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6237
quasi-R-Matrix-Based minus all Neutrosophic SuperHypeNeighbor to some of them but not all of 6238
them. In other words, there’s only an unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) 6239
has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Matrix-Based, 6240

minus all Neutrosophic SuperHypeNeighbor to some of them but not all of them. 6241
The main definition of the Neutrosophic R-Matrix-Based has two titles. a Neutrosophic quasi-R- 6242
Matrix-Based and its corresponded quasi-maximum Neutrosophic R-SuperHyperCardinality are 6243
two titles in the terms of quasi-R-styles. For any Neutrosophic number, there’s a Neutrosophic 6244

quasi-R-Matrix-Based with that quasi-maximum Neutrosophic SuperHyperCardinality in the terms 6245

of the embedded Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic Super- 6246
HyperGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the collection of 6247
all the Neutrosophic quasi-R-Matrix-Baseds for all Neutrosophic numbers less than its Neutrosophic 6248
corresponded maximum number. The essence of the Neutrosophic Matrix-Based ends up but this 6249
essence starts up in the terms of the Neutrosophic quasi-R-Matrix-Based, again and more in the 6250
operations of collecting all the Neutrosophic quasi-R-Matrix-Baseds acted on the all possible used 6251
formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. This 6252
Neutrosophic number is 6253
considered as the equivalence class for all corresponded quasi-R-Matrix-Baseds. Let 6254
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Matrix-Based be a Neutrosophic 6255
number, a Neutrosophic SuperHyperSet and a Neutrosophic Matrix-Based. Then 6256
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Matrix-Based ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Matrix-Based is re-formalized and 6257
redefined as follows. 6258
GNeutrosophic Matrix-Based ∈ ∪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 6259
definition for the Neutrosophic Matrix-Based. 6260
GNeutrosophic Matrix-Based =
{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 Matrix- 6261

Based poses the upcoming expressions. 6262
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6263
= max zNeutrosophic Number

And then, 6264

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


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

6267



6268

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6269
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Supe- 6270
rHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident 6271
to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi- 6272
Matrix-Based” but, precisely, it’s the generalization of “Neutrosophic Quasi-Matrix-Based” since 6273
“Neutrosophic Quasi-Matrix-Based” happens “Neutrosophic Matrix-Based” in a Neutrosophic Super- 6274

HyperGraph as initial framework and background but “Neutrosophic SuperHyperNeighborhood” 6275
may not happens “Neutrosophic Matrix-Based” in a Neutrosophic SuperHyperGraph as initial 6276
framework and preliminarily background since there are some ambiguities about the Neutro- 6277
sophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Neutrosophic 6278
SuperHyperNeighborhood”, “Neutrosophic Quasi-Matrix-Based”, and “Neutrosophic Matrix-Based” 6279
are up. 6280

Thus, let 6281
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6282
GNeutrosophic Matrix-Based be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood 6283
and a Neutrosophic Matrix-Based and the new terms are up. 6284
GNeutrosophic Matrix-Based ∈ ∪zNeutrosophic Number

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

6286
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6287
And with go back to initial structure, 6288
GNeutrosophic Matrix-Based ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6290
[zNeutrosophic
Number ]Neutrosophic Class

6291


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

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

the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Matrix-Based.

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

not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6292
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6293
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6294
type-SuperHyperSet called the 6295
“Neutrosophic R-Matrix-Based” 6296
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6297
Neutrosophic R-Matrix-Based, 6298

is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic R-Matrix-Based amid those obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic Matrix-Based, 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-Matrix-Based. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a Neutrosophic R-Matrix-Based is the cardinality of
6299
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6300
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Matrix-Based if for 6301
any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6302
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6303

Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6304
them. 6305
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6306
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6307
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6308
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6309

exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6310
Consider there’s a Neutrosophic R-Matrix-Based with the least cardinality, the lower sharp Neutro- 6311
sophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic SuperHyperGraph 6312
ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6313
VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic SuperHyperVertices such 6314
that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices 6315

uniquely but it isn’t a Neutrosophic R-Matrix-Based. Since it doesn’t have 6316
6317
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6318
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6319
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6320
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6321

SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Matrix-Based. 6322

Since it doesn’t do the Neutrosophic procedure such that such that there’s a Neutrosophic 6323
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there are at least 6324
one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected 6325
Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled 6326
its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the Neut- 6327
rosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s only 6328

one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6329
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6330
Neutrosophic R-Matrix-Based, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet 6331
of the Neutrosophic R-Matrix-Based, VESHE , is a Neutrosophic SuperHyperSet, VESHE , includes 6332
only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs are 6333
titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6334

ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6335
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6336
SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6337
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6338
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Matrix-Based only contains 6339
all interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic SuperHyperVertices 6340
from the unique Neutrosophic SuperHyperEdge where there’s any of them has all possible Neut- 6341
rosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHyperNeighborhoods in 6342
with no exception minus all Neutrosophic SuperHypeNeighbors to some of them not all of them 6343
but everything is possible about Neutrosophic SuperHyperNeighborhoods and Neutrosophic 6344
SuperHyperNeighbors out. 6345
The SuperHyperNotion, namely, Matrix-Based, is up. There’s neither empty SuperHyperEdge 6346
nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6347
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6348
the Neutrosophic Matrix-Based. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6349

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

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

= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Matrix-Based C(ESHG) for an Neutrosophic SuperHyperGraph ESHG : 6353
(V, E) is a Neutrosophic type-SuperHyperSet with 6354

6355
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6357
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6358
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6359
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6360
Neutrosophic Matrix-Based is up. The obvious simple Neutrosophic type-SuperHyperSet called 6361
the Neutrosophic Matrix-Based is a Neutrosophic SuperHyperSet includes only two Neutrosophic 6362
SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6363

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- 6365
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6366
Matrix-Based is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6367
SuperHyperEdges[SuperHyperVertices], 6368

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 6369
.
Matrix-BasedSince the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6370


b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Matrix-Based C(ESHG) for an Neutrosophic SuperHyperGraph ESHG : (V, E) 6372
is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6373

no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices given by that 6374
Neutrosophic type-SuperHyperSet called the Neutrosophic Matrix-Based and it’s an Neutrosophic 6375
Matrix-Based. Since it’s 6376
6377
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6379

HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6380
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6381
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6382

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

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 Matrix-Based , 6384
not: 6385

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

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- 6387
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6388
Neutrosophic type-SuperHyperSet called the 6389
“Neutrosophic Matrix-Based ” 6390
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6391
Neutrosophic Matrix-Based , 6392
is only and only 6393

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

CHAPTER 31 6395
The Neutrosophic Departures on The 6396
Theoretical Results Toward Theoretical 6397
Motivations 6398
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6399
Neutrosophic SuperHyperClasses. 6400
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6401

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
Proof. Let 6402
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
329
6403
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6404

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6408
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6409
SuperHyperModel (31.1), is the SuperHyperMatrix-Based. 6410
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6411

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.
Proof. Let 6412
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,

Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6413
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). 6414


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

Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.7) 136NSHG19a
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6418
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6419
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperMatrix-Based. 6420
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6421

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.

Proof. Let 6422
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6423
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6424

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6428
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6429
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6430
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6431
the Neutrosophic SuperHyperMatrix-Based. 6432
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6433
Then 6434

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.

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

Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.9) 136NSHG20a
Proof. Let 6435
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6436
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). 6437


ViEXT ERN AL in the literatures of SuperHyperMatrix-Based. The latter is straightforward. Then 6440
there’s no at least one SuperHyperMatrix-Based. Thus the notion of quasi may be up but the 6441
SuperHyperNotions based on SuperHyperMatrix-Based could be applied. There are only two 6442
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperMatrix-Based taken from a connected Neutrosophic SuperHyperBipartite 6445
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6446
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6449
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6450
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6451
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6452

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6453
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6455
Then 6456

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperMatrix-Based in the Example (42.0.11) 136NSHG21a
Proof. Let 6457
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6458
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperMatrix-Based taken from a connected Neutrosophic SuperHyperMultipartite 6459



Then there’s no at least one SuperHyperMatrix-Based. Thus the notion of quasi may be up 6463
but the SuperHyperNotions based on SuperHyperMatrix-Based could be applied. There are only 6464
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6467
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6468
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6472
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6473
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6474
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6475
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperMatrix-Based. 6476
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6477
Then, 6478

 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . ... . . .
− ... − ... − ... − ... −
= za.
 
− ... − ... − ... − ... −
− ... − ... − ... − ... −
 
. . . . . . . . . . . . . . . . . . . . . . . . . . .
− ... − ... − ... − ... −
= zb.

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

Proof. Let 6479
P :
CEN T ER, E2∗
6480
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperMatrix-Based taken from a connected Neutrosophic SuperHyperWheel 6481


Then there’s at least one SuperHyperMatrix-Based. Thus the notion of quasi isn’t up and 6485
the SuperHyperNotions based on SuperHyperMatrix-Based could be applied. The unique 6486
embedded SuperHyperMatrix-Based proposes some longest SuperHyperMatrix-Based excerpt from 6487

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperMatrix-Based in the Neutrosophic Example (42.0.15) 136NSHG23a
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6489
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6490
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6491

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6492
SuperHyperModel (31.6), is the Neutrosophic SuperHyperMatrix-Based. 6493

CHAPTER 32 6494
The Surveys of Mathematical Sets On 6495
The Results But As The Initial Motivation 6496
For the SuperHyperMatrix-Based, Neutrosophic SuperHyperMatrix-Based, and the Neutrosophic 6497

SuperHyperMatrix-Based, some general results are introduced. 6498
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperMatrix-Based is “redefined” on the 6499
positions of the alphabets. 6500
Corollary 32.0.2. Assume Neutrosophic SuperHyperMatrix-Based. Then 6501
N eutrosophic SuperHyperM atrix − Based =

{theSuperHyperM atrix − Basedof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperM atrix − Based
|N eutrosophiccardinalityamidthoseSuperHyperM atrix−Based. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6502
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6503
the neutrality, for i = 1, 2, 3, respectively. 6504
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6505
the alphabet. Then the notion of Neutrosophic SuperHyperMatrix-Based and SuperHyperMatrix-Based 6506
coincide. 6507
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6508
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6509
SuperHyperMatrix-Based if and only if it’s a SuperHyperMatrix-Based. 6510
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6511
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperMatrix- 6512
Based if and only if it’s a longest SuperHyperMatrix-Based. 6513
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 6514
same identical letter of the alphabet. Then its Neutrosophic SuperHyperMatrix-Based is its 6515
SuperHyperMatrix-Based and reversely. 6516
341
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperMatrix-Based, SuperHy- 6517

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 6518
letter of the alphabet. Then its Neutrosophic SuperHyperMatrix-Based is its SuperHyperMatrix-Based 6519
and reversely. 6520
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6521

SuperHyperMatrix-Based isn’t well-defined if and only if its SuperHyperMatrix-Based isn’t well-defined. 6522
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6523

Neutrosophic SuperHyperMatrix-Based isn’t well-defined if and only if its SuperHyperMatrix-Based isn’t 6524
well-defined. 6525
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperMatrix-Based, Super- 6526

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neut- 6527
rosophic SuperHyperMatrix-Based isn’t well-defined if and only if its SuperHyperMatrix-Based isn’t 6528
well-defined. 6529
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6530

SuperHyperMatrix-Based is well-defined if and only if its SuperHyperMatrix-Based is well-defined. 6531
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6532

Neutrosophic SuperHyperMatrix-Based is well-defined if and only if its SuperHyperMatrix-Based is 6533
well-defined. 6534
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperMatrix-Based, SuperHy- 6535

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutro- 6536
sophic SuperHyperMatrix-Based is well-defined if and only if its SuperHyperMatrix-Based is well-defined. 6537
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6538
(i) : the dual SuperHyperDefensive SuperHyperMatrix-Based; 6539
(ii) : the strong dual SuperHyperDefensive SuperHyperMatrix-Based; 6540
(iii) : the connected dual SuperHyperDefensive SuperHyperMatrix-Based; 6541
(iv) : the δ-dual SuperHyperDefensive SuperHyperMatrix-Based; 6542
(v) : the strong δ-dual SuperHyperDefensive SuperHyperMatrix-Based; 6543
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperMatrix-Based. 6544
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6545
(iii) : the connected defensive SuperHyperDefensive SuperHyperMatrix-Based; 6548

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

independent SuperHyperSet is 6553
(iii) : the connected SuperHyperDefensive SuperHyperMatrix-Based; 6556
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6560

Graph which is a SuperHyperMatrix-Based/SuperHyperPath. Then V is a maximal 6561
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperMatrix-Based; 6565
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperMatrix-Based; 6566
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperMatrix-Based; 6567
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6569

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6570
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperMatrix-Based; 6574
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperMatrix-Based; 6575
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperMatrix-Based; 6576

Graph which is a SuperHyperMatrix-Based/SuperHyperPath. Then the number of 6579
(i) : the SuperHyperMatrix-Based; 6580

(ii) : the SuperHyperMatrix-Based; 6581
(iii) : the connected SuperHyperMatrix-Based; 6582
(iv) : the O(ESHG)-SuperHyperMatrix-Based; 6583
(v) : the strong O(ESHG)-SuperHyperMatrix-Based; 6584
(vi) : the connected O(ESHG)-SuperHyperMatrix-Based. 6585
coincide. 6587

Graph which is a SuperHyperWheel. Then the number of 6589
(i) : the dual SuperHyperMatrix-Based; 6590
(ii) : the dual SuperHyperMatrix-Based; 6591
(iii) : the dual connected SuperHyperMatrix-Based; 6592
(iv) : the dual O(ESHG)-SuperHyperMatrix-Based; 6593
(v) : the strong dual O(ESHG)-SuperHyperMatrix-Based; 6594
(vi) : the connected dual O(ESHG)-SuperHyperMatrix-Based. 6595
coincide. 6597
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6598
perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6599

Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6600
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6601
SuperHyperVertices is a 6602
O(ESHG)
O(ESHG)
O(ESHG)

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6610
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6611
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6612
SuperHyperPart is a 6613

(iv) : δ-SuperHyperDefensive SuperHyperMatrix-Based; 6617
(v) : strong δ-SuperHyperDefensive SuperHyperMatrix-Based; 6618
(vi) : connected δ-SuperHyperDefensive SuperHyperMatrix-Based. 6619

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6621
plete SuperHyperMultipartite. Then Then the number of 6622
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6629
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6630
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6632
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6633
(iv) : SuperHyperMatrix-Based; 6637
Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6640
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6641
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6642
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6643

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



Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6651
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6652
of dual 6653
(iv) : 0-SuperHyperDefensive SuperHyperMatrix-Based; 6657

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6661

SuperHyperMatrix-Based/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 6663
and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6664
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperMatrix-Based; 6668
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperMatrix-Based; 6669
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperMatrix-Based. 6670

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



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

a dual SuperHyperDefensive SuperHyperMatrix-Based, then ∀v ∈ V \ S, ∃x ∈ S such that 6686
(i) v ∈ Ns (x); 6687
(ii) vx ∈ E. 6688
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6689

a dual SuperHyperDefensive SuperHyperMatrix-Based, then 6690
(i) S is SuperHyperMatrix-Based set; 6691
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6692
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6693
(i) Γ ≤ O; 6694
(ii) Γs ≤ On . 6695
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6696
connected. Then 6697
(i) Γ ≤ O − 1; 6698
(ii) Γs ≤ On − Σ3i=1 σi (x). 6699
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6700

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

Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6707
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperMatrix-Based; 6708
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6709
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6710
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6711
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperMatrix-Based. Then 6713
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperMatrix- 6714

Based; 6715
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6716
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6717
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6718
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperMatrix-Based. Then 6720

Based; 6722
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6724
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6725
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6727
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperMatrix-Based; 6728
(ii) Γ = 1; 6729
(iii) Γs = Σ3i=1 σi (c); 6730
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperMatrix-Based. 6731
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6732
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6733
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6735
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6736
i=1

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

2
; 6742
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperMatrix- 6743
Based. 6744
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6745
bn
2c
(ii) Γ = b n2 c; 6747

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

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

Based for N SHF; 6754
(ii) Γ = m for N SHF : (V, E); 6755
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6756
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperMatrix-Based 6757
for N SHF : (V, E). 6758
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6759

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6760
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6761
SuperHyperMatrix-Based for N SHF; 6762
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6763

2
for N SHF : (V, E); 6764
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperMatrix-Based for 6765
N SHF : (V, E). 6766

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

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6768
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperMatrix-Based for 6769
N SHF : (V, E); 6770
(ii) Γ = b n2 c for N SHF : (V, E); 6771
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 6772
S={vi }i=1
bnc
2
are only dual maximal SuperHyperMatrix-Based for 6773
N SHF : (V, E). 6774
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6777
SuperHyperMatrix-Based, then S is an s-SuperHyperDefensive SuperHyperMatrix-Based; 6778

SuperHyperMatrix-Based, then S is a dual s-SuperHyperDefensive SuperHyperMatrix-Based. 6780
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6783

SuperHyperMatrix-Based, then S is an s-SuperHyperPowerful SuperHyperMatrix-Based; 6784

SuperHyperMatrix-Based, then S is a dual s-SuperHyperPowerful SuperHyperMatrix-Based. 6786
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6787

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

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

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

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

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

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


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

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

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

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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperMatrix- 6829
Based; 6830
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6831

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

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


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

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


CHAPTER 33 6847
Neutrosophic Applications in Cancer’s 6848
Neutrosophic Recognition 6849
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6850
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6851
disease is considered and as the consequences of the model, some parameters are used. The cells 6852
are under attack of this disease but the moves of the cancer in the special region are the matter 6853
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6854
treatments for this Neutrosophic disease. 6855
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6856
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6857
term Neutrosophic function. 6858
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6859
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6860
move from the cancer is identified by this research. Sometimes the move of the cancer 6861
about the moves and the effects of the cancer on that region; this event leads us to 6863
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6864
perception on what’s happened and what’s done. 6865
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6866
known and they’ve got the names, and some general Neutrosophic models. The moves 6867
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6868
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperMatrix- 6869
Based, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 6870
The aim is to find either the Neutrosophic SuperHyperMatrix-Based or the Neutrosophic 6871
SuperHyperMatrix-Based in those Neutrosophic Neutrosophic SuperHyperModels. 6872
353
CHAPTER 34 6873
Case 1: The Initial Neutrosophic Steps 6874
Toward Neutrosophic 6875
SuperHyperBipartite as Neutrosophic 6876
SuperHyperModel 6877
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6878
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6879
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

355
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6880
perBipartite is obtained. 6881
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6882
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6883
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6884
(34.1), is the Neutrosophic SuperHyperMatrix-Based. 6885

CHAPTER 35 6886
Case 2: The Increasing Neutrosophic 6887
Steps Toward Neutrosophic 6888
SuperHyperMultipartite as 6889
Neutrosophic SuperHyperModel 6890
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6891
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6892
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6893
perMultipartite is obtained. 6894
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6895
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

357
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6897
Neutrosophic SuperHyperMatrix-Based. 6898

CHAPTER 36 6899
Wondering Open Problems But As The 6900
Directions To Forming The Motivations 6901
In what follows, some “problems” and some “questions” are proposed. 6902
The SuperHyperMatrix-Based and the Neutrosophic SuperHyperMatrix-Based are defined on a real- 6903
world application, titled “Cancer’s Recognitions”. 6904
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6905
recognitions? 6906
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperMatrix-Based and the 6907
Neutrosophic SuperHyperMatrix-Based? 6908
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6909
them? 6910
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperMatrix-Based 6911
and the Neutrosophic SuperHyperMatrix-Based? 6912
Problem 36.0.5. The SuperHyperMatrix-Based and the Neutrosophic SuperHyperMatrix-Based do a 6913

SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperMatrix-Based, are 6914
there else? 6915
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6916
Numbers types-results? 6917
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6918
the multiple types of SuperHyperNotions? 6919
359
CHAPTER 37 6920
Conclusion and Closing Remarks 6921
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6922
research are illustrated. Some benefits and some advantages of this research are highlighted. 6923
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6924
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperMatrix-Based. For 6925
that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph is 6926
redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6927
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperMatrix-Based, finds the 6928
convenient background to implement some results based on that. Some SuperHyperClasses and 6929
some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 6930
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 6931
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 6932
SuperHyperMatrix-Based, the new SuperHyperClasses and SuperHyperClasses, are introduced. 6933
Some general results are gathered in the section on the SuperHyperMatrix-Based and the Neutro- 6934
sophic SuperHyperMatrix-Based. The clarifications, instances and literature reviews have taken the 6935
whole way through. In this research, the literature reviews have fulfilled the lines containing the 6936
notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 6937
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 6938
based on the connectivities of the moves of the cancer in the longest and strongest styles with 6941
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 6944
benefits and avenues for this research are, figured out, pointed out and spoken out. 6945
361
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperMatrix-Based
3. Neutrosophic SuperHyperMatrix-Based 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6946
Neutrosophic SuperHyperDuality But As 6947
Super Forms 6949
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6950

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

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

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

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

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6961
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6962

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6963
sophic rv-SuperHyperDuality. 6964
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6965

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6970
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 6971
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 6972
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 6973
363
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6975

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6977
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 6978
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 6979
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 6980
form the Neutrosophic SuperHyperDuality; 6981
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6982
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6983

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6984
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6985
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6986
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6987
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 6989
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6991

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6993
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6994
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6995
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6996
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 6997
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6998
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6999
coefficient; 7000
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7001

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7003
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7004
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7005
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7006
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7008

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7009
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7010
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7011
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7012
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7013
that they form the Neutrosophic SuperHyperDuality; 7014
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7015

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7016
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7017

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7019
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7022
power is corresponded to its Extreme coefficient; 7023
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7024

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7026

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7029
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7032
coefficient. 7033
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7034
the mentioned Neutrosophic Figures in every Neutrosophic items. 7035

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7037
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7038
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7039
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7040
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7041
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7042
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 7047
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7048
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7049
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7050
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7051

every given Neutrosophic SuperHyperDuality. 7052




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7112
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 7114


the Neutrosophic SuperHyperDuality. 7123
Then 7125
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 7126
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7132
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7135

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7145

(V, E). Then 7146

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 7147
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7148


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

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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7165
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7166
Then, 7167
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 7168
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 7169


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7174
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7175
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7181

CHAPTER 39 7182
Neutrosophic SuperHyperJoin But As 7183
Super Forms 7185
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7186

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7190
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7192

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

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7197

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7198
|Vj |NEUTROSOPHIC CARDINALITY ; 7199
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7200

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7201
rv-SuperHyperJoin. 7202
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7203

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

377

Extreme SuperHyperJoin; 7212
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7213

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7215
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7216
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7218
Neutrosophic SuperHyperJoin; 7219
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7220

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7221
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7222
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7227
coefficient; 7228
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7229

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7230
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7231
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7232
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7233
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7234
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7235

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7236
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7237
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7238

Extreme SuperHyperJoin; 7244
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7245

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7247
Neutrosophic SuperHyperJoin; 7251

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7252

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7254

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7259
its Extreme coefficient; 7260
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7261

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7263
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7264

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7265
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7266
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7269
coefficient. 7270
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7274

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7275

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7340

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7349
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 7351


the Neutrosophic SuperHyperJoin. 7360
Then 7362
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 7363
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 7369
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7371

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


(V, E). Then 7382

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7384


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

Then, 7402

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

.
Proof. Let 7403
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7404


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7408
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7409
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7410
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7415

CHAPTER 40 7416
Neutrosophic SuperHyperPerfect But As 7417
Super Forms 7419
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7420

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7431
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7432

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7433
rv-SuperHyperPerfect. 7434
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7435

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7440
391
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7445

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7447
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7448
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7449
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7450
form the Neutrosophic SuperHyperPerfect; 7451
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7452

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7453
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7454
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7457
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7461

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7463
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7466
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7469
coefficient; 7470
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7471

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7479
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7480
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7481
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7482
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7483
that they form the Neutrosophic SuperHyperPerfect; 7484
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7485

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7487

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7490
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7494

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7496
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7499

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7502
coefficient. 7503

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

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7573
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 7575
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7593
Then 7595
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 7596
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 7600
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7601
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7602
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7605

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

(V, E). Then 7616

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7639


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7642
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7643
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7644
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7645
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7651

CHAPTER 41 7652
Neutrosophic SuperHyperTotal But As 7653
Super Forms 7655
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7656

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7660

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7663
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7664

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7667
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7668

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7669
rv-SuperHyperTotal. 7670
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7671

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7676
Extreme SuperHyperTotal; 7680
405
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7681

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7683
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7684
Neutrosophic SuperHyperTotal; 7687
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7688
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7689

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7690
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7695
coefficient; 7696
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7697
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7698

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7699
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7700
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7701
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7702
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7703
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7704
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7705
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7706

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

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7715
Neutrosophic SuperHyperTotal; 7719
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7720

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

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7727
its Extreme coefficient; 7728
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7729
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7730

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7731
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7732
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7733
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7734
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7735
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7736
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7737

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

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7807
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 7809
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. 7816
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 7818


the Neutrosophic SuperHyperTotal. 7827
Then 7829
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 7830
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7836
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7838

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7849

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7851


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7856
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. 7867
Then, 7869
∗
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 7870
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7871


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7875
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7876
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7877
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7883

CHAPTER 42 7884
Neutrosophic SuperHyperConnected But 7885
As The Extensions Excerpt From Dense 7886
And Super Forms 7887
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7888

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7892
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7893
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7894

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7895
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7896
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7897

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

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7900
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7901
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7902
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7903
rosophic rv-SuperHyperConnected. 7904
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7905

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

7908
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7909
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7910
419
form the Extreme SuperHyperConnected; 7914
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7915

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7916
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7917
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 7918
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 7919

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7921
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7922
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7923

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7924
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7931

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7932
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7933

Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 7939
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7941

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7943
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7947
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7948

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 7950
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7954

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7955


(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7964


Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 7972
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7976
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7977
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7979
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7980

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7981
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7982
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7983
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. 7991


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 8035
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. 8042
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 8044
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. 8051
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 8053



the Neutrosophic SuperHyperConnected. 8062
Then 8064
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 8065
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 8070
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8071
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8074

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8085
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 8086
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8087


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8091
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8092
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. 8104
Then, 8106
∗
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 8107
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8108


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8111
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8112
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8113
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8114
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8120

CHAPTER 43 8121
Background 8122

433








“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 8239
eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 8240
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 8241
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 8242
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 8243
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 8244
Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 8245

HG262; HG263; HG264; HG265; HG266; HG267], there are some endeavors to formalize 8264
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 8265


HG169b; HG170b; HG171b; HG172b; HG173b]. Two popular scientific research books 8279
in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutrosophic science is on 8280
[HG32b; HG44b]. 8281

HG260; HG261; HG262; HG263; HG264; HG265; HG266; HG267] alongside scientific 8316
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 8317


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

Bibliography 8332
10.33140/JMTCM.01.03.09) 8336


439
10.20944/preprints202301.0282.v1). 8369
10.20944/preprints202301.0267.v1). 8372

(doi: 10.20944/preprints202301.0265.v1). 8377
prints202301.0262.v1). 8381
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8387
prints202301.0105.v1). 8390
Preprints 2023, 2023010044 8396
10.20944/preprints202301.0043.v1). 8399

(doi: 10.20944/preprints202212.0549.v1). 8408
(doi: 10.20944/preprints202212.0500.v1). 8415
10.5281/zenodo.7940830). 8424
10.5281/zenodo.7943578). 8427
odo.7916595). 8430
odo.7923632). 8433
(doi: 10.5281/zenodo.7904698). 8436
2023, (doi: 10.5281/zenodo.7904671). 8439

10.5281/zenodo.7871026). 8448
2023, (doi: 10.5281/zenodo.7874647). 8451
10.5281/zenodo.7857856). 8454
2023, (doi: 10.5281/zenodo.7857841). 8457
10.5281/zenodo.7853867). 8466
10.5281/zenodo.7853922). 8469
(doi: 10.5281/zenodo.7851519). 8472
(doi: 10.5281/zenodo.7851550). 8475

10.5281/zenodo.7834229). 8484
10.5281/zenodo.7834261). 8487
10.5281/zenodo.7824560). 8490
(doi: 10.5281/zenodo.7824623). 8493
2023, (doi: 10.5281/zenodo.7809365). 8504
2023, (doi: 10.5281/zenodo.7809358). 8507
10.5281/zenodo.7809219). 8510
10.5281/zenodo.7809328). 8513
2023, (doi: 10.5281/zenodo.7806767). 8516

2023, (doi: 10.5281/zenodo.7806838). 8519
10.5281/zenodo.7799902). 8528
(doi: 10.5281/zenodo.7804218). 8531
(doi: 10.5281/zenodo.7796334). 8534
10.5281/zenodo.7791952). 8540
10.5281/zenodo.7791982). 8543
10.5281/zenodo.7790026). 8546
10.5281/zenodo.7790052). 8549
2023, (doi: 10.5281/zenodo.7787066). 8552

10.5281/zenodo.7781476). 8558
10.5281/zenodo.7783082). 8561
10.5281/zenodo.7777857). 8564
10.5281/zenodo.7779286). 8567
(doi: 10.5281/zenodo.7771831). 8570
2023, (doi: 10.5281/zenodo.7772468). 8573
10.13140/RG.2.2.20913.25446). 8576
odo.7764916). 8579
10.13140/RG.2.2.11770.98247). 8582
10.13140/RG.2.2.12400.12808). 8585
2023, (doi: 10.13140/RG.2.2.22545.10089). 8588
10.13140/RG.2.2.11377.76644). 8594

10.13140/RG.2.2.23750.96329). 8597
10.13140/RG.2.2.31366.24641). 8600
10.13140/RG.2.2.34721.68960). 8603
2023, (doi: 10.13140/RG.2.2.30212.81289). 8606
10.13140/RG.2.2.24288.35842). 8612
10.13140/RG.2.2.32467.25124). 8615
10.13140/RG.2.2.31025.45925). 8618
10.13140/RG.2.2.17184.25602). 8621
10.13140/RG.2.2.23423.28327). 8624
10.13140/RG.2.2.28456.44805). 8627
10.13140/RG.2.2.23525.68320). 8630
10.13140/RG.2.2.20170.24000). 8633

10.13140/RG.2.2.36475.59683). 8636
10.13140/RG.2.2.29764.71046). 8639
2023, (doi: 10.13140/RG.2.2.18780.87683). 8642
10.13140/RG.2.2.26134.01603). 8648
10.13140/RG.2.2.27392.30721). 8651
10.13140/RG.2.2.33028.40321). 8654
10.13140/RG.2.2.21389.20966). 8657
10.13140/RG.2.2.16356.04489). 8660
10.13140/RG.2.2.21756.21129). 8663
10.13140/RG.2.2.30983.68009). 8666
10.13140/RG.2.2.28552.29445). 8669
(doi: 10.13140/RG.2.2.10936.21761). 8672

10.13140/RG.2.2.35105.89447). 8675
(doi: 10.13140/RG.2.2.30072.72960). 8678
10.13140/RG.2.2.31147.52003). 8681
10.13140/RG.2.2.32825.24163). 8684
10.13140/RG.2.2.13059.58401). 8687
10.13140/RG.2.2.11172.14720). 8690
2023, (doi: 10.13140/RG.2.2.22011.80165). 8693
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8696
2023, (doi: 10.13140/RG.2.2.10493.84962). 8699
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8702
2023, (doi: 10.13140/RG.2.2.19944.14086). 8705
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8708
(doi: 10.13140/RG.2.2.33103.76968). 8711

(doi: 10.13140/RG.2.2.23037.44003). 8714
(doi: 10.13140/RG.2.2.35646.56641). 8717
10.13140/RG.2.2.18030.48967). 8720
(doi: 10.13140/RG.2.2.13973.81121). 8723
2023, (doi: 10.13140/RG.2.2.34106.47047). 8726
2023, (doi: 10.13140/RG.2.2.31956.88961). 8732
2023, (doi: 10.13140/RG.2.2.15179.67361). 8735
10.13140/RG.2.2.21510.45125). 8738
2023, (doi: 10.13140/RG.2.2.13121.84321). 8741
10.13140/RG.2.2.11758.69441). 8744
2023, (doi: 10.13140/RG.2.2.31891.35367). 8747
10.13140/RG.2.2.19360.87048). 8750

10.13140/RG.2.2.32363.21286). 8753
10.13140/RG.2.2.23266.81602). 8756
10.13140/RG.2.2.19911.37285). 8759
10.13140/RG.2.2.11050.90569). 8762
2023, (doi: 10.13140/RG.2.2.17761.79206). 8765
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8771
(doi: 10.13140/RG.2.2.30182.50241). 8774


2023, (doi: 10.13140/RG.2.2.17252.24968). 8807
2023010396 (doi: 10.20944/preprints202301.0396.v1). 8816

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



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


10.20944/preprints202301.0282.v1). 8840
10.20944/preprints202301.0267.v1).). 8843

(doi: 10.20944/preprints202301.0265.v1). 8848
prints202301.0262.v1). 8852

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

10.13140/RG.2.2.35061.65767). 8861
10.13140/RG.2.2.18494.15680). 8865

10.13140/RG.2.2.32530.73922). 8869
10.13140/RG.2.2.15897.70243). 8873
10.13140/RG.2.2.32530.73922). 8877
prints202301.0105.v1). 8880
10.13140/RG.2.2.23172.19849). 8887


10.13140/RG.2.2.17385.36968). 8897

Preprints 2023, 2023010044 8900
10.20944/preprints202301.0043.v1). 8903

2023, (doi: 10.13140/RG.2.2.28945.92007). 8906

10.13140/RG.2.2.35774.77123). 8912
10.13140/RG.2.2.29430.88642). 8918

(doi: 10.20944/preprints202212.0549.v1). 8924
10.13140/RG.2.2.19380.94084). 8927

(doi: 10.20944/preprints202212.0500.v1). 8938
10.13140/RG.2.2.20993.12640). 8941



10.13140/RG.2.2.29173.86244). 8956
odo.7943878). 8961
10.5281/zenodo.7943871). 8963
10.5281/zenodo.7923786). 8965
2023 (doi: 10.5281/zenodo.7905287). 8967

2023 (doi: 10.5281/zenodo.7874677). 8971
(doi: 10.5281/zenodo.7857906). 8973
2023 (doi: 10.5281/zenodo.7856329). 8975
10.5281/zenodo.7854561). 8977

2023 (doi: 10.5281/zenodo.7851893). 8979

(doi: 10.5281/zenodo.7835063). 8983
(doi: 10.5281/zenodo.7826705). 8985
2023 (doi: 10.5281/zenodo.7820680). 8987
10.5281/zenodo.7812750). 8989


2023 (doi: 10.5281/zenodo.7807782). 8995
2023 (doi: 10.5281/zenodo.7804449). 8997

(doi: 10.5281/zenodo.7792307). 9001
(doi: 10.5281/zenodo.7790728). 9003
2023 (doi: 10.5281/zenodo.7787712). 9005
10.5281/zenodo.7783791). 9007
10.5281/zenodo.7780123). 9009
(doi: 10.5281/zenodo.7773119). 9011
odo.7637762). 9013

10.5281/zenodo.7766174). 9015
10.5281/zenodo.7762232). 9017
(doi: 10.5281/zenodo.7758601). 9019
10.5281/zenodo.7754661). 9021
10.5281/zenodo.7750995) . 9023
(doi: 10.5281/zenodo.7749875). 9025
10.5281/zenodo.7747236). 9027
10.5281/zenodo.7742587). 9029
(doi: 10.5281/zenodo.7738635). 9031
10.5281/zenodo.7734719). 9033
10.5281/zenodo.7730484). 9035
(doi: 10.5281/zenodo.7730469). 9037
10.5281/zenodo.7722865). 9039
odo.7713563). 9041
odo.7709116). 9043
10.5281/zenodo.7706415). 9045
10.5281/zenodo.7706063). 9047
10.5281/zenodo.7701906). 9049

odo.7700205). 9051
10.5281/zenodo.7694876). 9053
10.5281/zenodo.7679410). 9055
10.5281/zenodo.7675982). 9057
10.5281/zenodo.7672388). 9059
odo.7668648). 9061
10.5281/zenodo.7662810). 9063
10.5281/zenodo.7659162). 9065
odo.7653233). 9067
odo.7653204). 9069
odo.7653142). 9071
odo.7653117). 9073
odo.7651687). 9076
odo.7651619). 9078
odo.7651439). 9080
odo.7650729). 9082
odo.7647868). 9084

odo.7647017). 9086
odo.7644894). 9088
odo.7632923). 9091
odo.7623459). 9093
10.5281/zenodo.7606416). 9095
10.5281/zenodo.7606416). 9097
odo.7606404). 9099
10.5281/zenodo.7580018). 9101
odo.7580018). 9103
odo.7580018). 9105
odo.7579929). 9107
10.5281/zenodo.7563170). 9109
odo.7563164). 9111
odo.7563160). 9113
odo.7563160). 9115
10.5281/zenodo.7563160). 9117
10.5281/zenodo.7557063). 9119

10.5281/zenodo.7557009). 9121
10.5281/zenodo.7539484). 9123
10.5281/zenodo.7523390). 9125
10.5281/zenodo.7523390). 9127
10.5281/zenodo.7523390). 9129
odo.7574952). 9131
10.5281/zenodo.7574992). 9133
odo.7523357). 9135
10.5281/zenodo.7523357). 9137
10.5281/zenodo.7504782). 9139
10.5281/zenodo.7504782). 9141
10.5281/zenodo.7504782). 9143
10.5281/zenodo.7499395). 9145
odo.7499395). 9147
10.5281/zenodo.7499395). 9149
10.5281/zenodo.7497450). 9151
10.5281/zenodo.7497450). 9153
10.5281/zenodo.7494862). 9155

odo.7494862). 9157
10.5281/zenodo.7494862). 9159
10.5281/zenodo.7493845). 9161
odo.7493845). 9163
10.5281/zenodo.7493845). 9165
odo.7539484). 9167
odo.7523390). 9169
odo.7523357). 9171
odo.7504782). 9173
odo.7499395). 9175
odo.7497450). 9177
odo.7494862). 9179
odo.7493845). 9181
odo.7480110). 9183
odo.7378758). 9185
odo.6320305). 9187
odo.6677173). 9189

CHAPTER 44 9190
Books’ Contributions 9191
“Books’ Contributions”: | Featured Threads 9192

The following references are cited by chapters. 9193
9194
[Ref268] 9195
Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In Cancer’s Recog- 9196
nition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7978857). 9197
9198
[Ref269] 9199
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9200
Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zenodo.7978571). 9201
9202
The links to the contributions of this scientific research book are listed below. 9203
[HG268] 9204

9207
[TITLE] “New Ideas On Super mat By Hyper matte Of Matrix-Based In Cancer’s Re- 9208
cognition With (Neutrosophic) SuperHyperGraph” 9209
9210
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9211
https://www.researchgate.net/publication/371110937 9212
9213
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9214
https://www.scribd.com/document/648824640 9215
9216
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9217
https://zenodo.org/record/7978857 9218
9219
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9220
https://www.academia.edu/102476454 9221
9222
[ADDRESSED CITATION] 9223
463
Figure 44.1: Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-
Based In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7978857).

[ASSIGNED NUMBER] #268 Article 9226
[DATE] May 2023 9227
[DOI] 10.5281/zenodo.7978857 9228
[LICENSE] CC BY-NC-ND 4.0 9229
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9230
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9231

ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9232
9233
[HG269] 9234
9237
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9238
Matrix-Based As Hyper mat On Super matte” 9239
9240
https://www.researchgate.net/publication/371110081 9242
9243
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9244
https://www.scribd.com/document/648798970 9245
9246
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9247
9249

10.5281/zenodo.7978857).
10.5281/zenodo.7978857).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi:
10.5281/zenodo.7978571).
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9250

https://www.academia.edu/102468794 9251
9252

[ASSIGNED NUMBER] #269 Article 9256
[DATE] May 2023 9257
[DOI] 10.5281/zenodo.7978571 9258
[LICENSE] CC BY-NC-ND 4.0 9259

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9260
[AVAILABLE AT TWITTER’S IDS] 9261
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9262
googlebooks GooglePlay 9263
9264
[ASSIGNED NUMBER] | Book #174 9265

HG174b
Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9267
10.5281/zenodo.7978921). 9268
[TITLE] Matrix-Based In SuperHyperGraphs 9269
#Latest_Updates 9270
#The_Links 9271

10.5281/zenodo.7978571).
10.5281/zenodo.7978571).

9275
9277
#The_Links 9278
9279
[ASSIGNED NUMBER] | Book #174 9280
9281
[TITLE] Matrix-Based In SuperHyperGraphs 9282
9283
9287
– 9288
9289
[PUBLISHER] 9290
(Paperback): https://www.amazon.com/dp/- 9291
(Hardcover): https://www.amazon.com/dp/- 9292

(Kindle Edition): https://www.amazon.com/dp/- 9293
9294
– 9295
9296
[ISBN] 9297
(Paperback): - 9298
(Hardcover): - 9299
(Kindle Edition): CC BY-NC-ND 4.0 9300
(EBook): CC BY-NC-ND 4.0 9301
9302
– 9303
9304
[PRINT LENGTH] 9305
(Paperback): - pages 9306
(Hardcover): - pages 9307
(Kindle Edition): - pages 9308
(E-Book): - pages 9309
9310
– 9311
9312
9314
#The_Links 9315
9316
https://www.researchgate.net/publication/- 9318
9319
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9320

https://drhenrygarrett.wordpress.com/2023/07/22/ 9321
Matrix-Based-In-SuperHyperGraphs/ 9322
9323
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9324
https://www.scribd.com/document/- 9325
9326
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9327

https://www.academia.edu/- 9328
9329
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9330
9332
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9333
https://books.google.com/books/about?id=- 9334
9335
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9336
https://play.google.com/store/books/details?id=- 9337

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9338

9339
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9340
9341
https://drhenrygarrett.wordpress.com/2023/07/22/ 9342
Matrix-Based-In-SuperHyperGraphs/ 9343
9344
– 9345
9346
[POSTED BY] Dr. Henry Garrett 9347
9348
[DATE] May 028, 2023 9349

9350
[POSTED IN] 174 | Matrix-Based In SuperHyperGraphs 9351
9352
[TAGS] 9353
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9354
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9355
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9356
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9357
neutrosophic SuperHyperGraphs, Neutrosophic Matrix-Based In SuperHyperGraphs, Open 9358
Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 9359
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 9360
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 9361
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 9362

SuperHyperGraphs, Matrix-Based In SuperHyperGraphs, SuperHyperModeling, SuperHyper- 9363
Vertices, Theoretical Research, Vertex, Vertices. 9364
In this scientific research book, there are some scientific research chapters on “Extreme Matrix- 9365
Based In SuperHyperGraphs” and “Neutrosophic Matrix-Based In SuperHyperGraphs” about 9366
some scientific research on Matrix-Based In SuperHyperGraphs by two (Extreme/Neutrosophic) 9367
notions, namely, Extreme Matrix-Based In SuperHyperGraphs and Neutrosophic Matrix-Based 9368

In SuperHyperGraphs. With scientific research on the basic scientific research properties, the 9369
scientific research book starts to make Extreme Matrix-Based In SuperHyperGraphs theory and 9370
Neutrosophic Matrix-Based In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9371
understandable. 9372

HG174b1.png
Figure 44.7: [HG174b] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry

Garrett, 2023 (doi: 10.5281/zenodo.7978921).

HG174b2.png


HG174b3.png


CHAPTER 45 9373
“SuperHyperGraph-Based Books”: | 9374
Featured Tweets 9375
“SuperHyperGraph-Based Books”: | Featured Tweets 9376
475
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 9377
CV 9378
503
9379
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
9380
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)
9381
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

9382

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

9383
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

9384
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

9385
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

9386
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

9387
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).
9388
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

9389
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

9390
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

9391
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

9392
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

9393
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

9394
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

9395
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

9396
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

9397
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

9398
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).
9399
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

9400

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

9401
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

9402

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: -
9403
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

9404
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).
9405
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
9406
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
9407
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
9408
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).
9409
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

9410
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).
9411
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”,

9412
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).
9413
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).
9414
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
9415
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).
9416

(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).
9417
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).
9418
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9419
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9420
[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

9421
[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

9422
[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

9423
[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

9424
[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

9425
[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

9426
[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

9427
[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

9428
[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

9429
[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

9430
[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

9431
[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

9432
[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

9433
[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

9434
[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

9435
[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

9436
[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

9437
[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

9438
[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

9439
[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

9440
[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

9441
[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

9442
[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

9443
[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

9444
[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
9445
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

9446
[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

9447
[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

9448
[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

9449
[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

9450
[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
9451
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

9452
“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

9453
[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
9454
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

9455
[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

9456
[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

9457
[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

9458
[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

9459
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

9460
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
9461
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
9462
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

9463
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

9464
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
-
9465
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

9466
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9467
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
9468
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
9469
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

9470
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
9471
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
...
9472
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/
9473
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
9474
9475
9476
Henry Garrett
01/23/2022
9477
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
9478
View publication stats

Matrix-Based 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

Matrix-Based in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · May 2023

479 PUBLICATIONS 17,712 CITATIONS

Number Graphs And Numbers View project

Featured Articles View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super mat By Hyper matte Of Matrix-Based In Cancer’s

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 SuperHyperMatrix-Based But As The Extensions Excerpt From

11 The Extreme Departures on The Theoretical Results Toward Theoretical

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

13 Extreme Applications in Cancer’s Extreme Recognition 143

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 151

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 253

25 Neutrosophic Matrix-Based 257

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 SuperHyperMatrix-Based But As The Extensions Excerpt

31 The Neutrosophic Departures on The Theoretical Results Toward

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

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 353

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 361

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 463

45 “SuperHyperGraph-Based Books”: | Featured Tweets 475

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 476

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.19“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 491

Henry Garrett · Independent Researcher · Department of Mathematics ·

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