Eulerian-Path-Neighbor in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/369998309
Eulerian-Path-Neighbor In SuperHyperGraphs
Book · April 2023

DOI: 10.5281/zenodo.7826705
CITATIONS
1 author:
Henry Garrett
445 PUBLICATIONS 12,180 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Fuzzy Logic View project
On Combinatorics View project
All content following this page was uploaded by Henry Garrett on 13 April 2023.
The user has requested enhancement of the downloaded file.

Eulerian-Path-Neighbor 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 13
Bibliography 19
3 Acknowledgements 41
4 Cancer In Extreme SuperHyperGraph 43
5 Extreme Eulerian-Path-Neighbor 47
6 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor 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 SuperHyperEulerian-Path-Neighbor But As The Extensions Excerpt

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 217
Bibliography 223
24 Cancer In Neutrosophic SuperHyperGraph 245
25 Neutrosophic Eulerian-Path-Neighbor 249
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous 251
27 ABSTRACT 253
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 263

30 Neutrosophic SuperHyperEulerian-Path-Neighbor But As The Extensions

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

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

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

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

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

Motivations 345
37 Conclusion and Closing Remarks 347
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 405
43 Background 419
Bibliography 425
44 Books’ Contributions 447
45 “SuperHyperGraph-Based Books”: | Featured Tweets 455
46 CV 483

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

SuperHyperEulerian-Path-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . . . 79
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 a Extreme SuperHyperPath Associated to the Notions of Extreme

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

SuperHyperEulerian-Path-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.3) 281


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 SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.7) . 320
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.9) . 321
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Path-Neighbor in the Example (42.0.11) . . 323
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326

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 Nebulous By Hyper Nebbish Of Eulerian-
Path-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7824623). . . . . . . . . . . . . . . . . . . . . . 448
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”,
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 456

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 457
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 458
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 464



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) 71

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

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 342

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

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

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

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 41
Eulerian-Path-Neighbor In SuperHyperGraphs . Since there’s more ways to get type-results to 42
make a Eulerian-Path-Neighbor In SuperHyperGraphs more understandable. For the sake of 43
having Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs, there’s a need to “redefine” 44
the notion of a “Eulerian-Path-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices 45
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 46
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 47
Eulerian-Path-Neighbor In SuperHyperGraphs . It’s redefined a Neutrosophic Eulerian-Path- 48
Neighbor In SuperHyperGraphs if the mentioned Table holds, concerning, “The Values of 49
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutro- 50
sophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 51
of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 52

Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 53
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 54
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 55
introduce the next SuperHyperClass of SuperHyperGraph based on a Eulerian-Path-Neighbor 56
In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the foundation of previous 57
definition in the kind of SuperHyperClass. If there’s a need to have all Eulerian-Path-Neighbor 58

In SuperHyperGraphs until the Eulerian-Path-Neighbor In SuperHyperGraphs, then it’s 59
officially called a “Eulerian-Path-Neighbor In SuperHyperGraphs” but otherwise, it isn’t a 60
Eulerian-Path-Neighbor In SuperHyperGraphs . There are some instances about the clarifica- 61
tions for the main definition titled a “Eulerian-Path-Neighbor In SuperHyperGraphs ”. These 62
two examples get more scrutiny and discernment since there are characterized in the disciplinary 63
ways of the SuperHyperClass based on a Eulerian-Path-Neighbor In SuperHyperGraphs . For 64

the sake of having a Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs, there’s a 65
need to “redefine” the notion of a “Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs” 66
and a “Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices 67
this procedure, there’s the usage of the position of labels to assign to the values. Assume 69
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 70
intended Table holds. And a Eulerian-Path-Neighbor In SuperHyperGraphs are redefined 71
to a “Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs” if the intended Table 72
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 73
ways to get Neutrosophic type-results to make a Neutrosophic Eulerian-Path-Neighbor In 74
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 75

are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 76
Eulerian-Path-Neighbor In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, Super- 77
HyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 78
Eulerian-Path-Neighbor In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutro- 79

sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 80

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

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 116
is to find either the longest Eulerian-Path-Neighbor In SuperHyperGraphs or the strongest 117
Eulerian-Path-Neighbor In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 118
the longest Eulerian-Path-Neighbor In SuperHyperGraphs, called Eulerian-Path-Neighbor 119
In SuperHyperGraphs, and the strongest Eulerian-Path-Neighbor In SuperHyperGraphs, 120
called Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs, some general results are 121

introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 122
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 123
to form any style of a Eulerian-Path-Neighbor In SuperHyperGraphs. There isn’t any formation 124
of any Eulerian-Path-Neighbor In SuperHyperGraphs but literarily, it’s the deformation of any 125

Eulerian-Path-Neighbor In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A 126

basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 127
proposed. 128
Keywords: SuperHyperGraph, (Neutrosophic) Eulerian-Path-Neighbor In SuperHyper- 129
Graphs, Cancer’s Recognition 130

AMS Subject Classification: 05C17, 05C22, 05E45 131
132
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 133
Notion, namely, Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs . Two different 134

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

a maximal Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs of SuperHyperVertices 159
with maximum Neutrosophic cardinality such that either of the following expressions hold for 160
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 161
|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 162
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 163
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 164

version of Eulerian-Path-Neighbor In SuperHyperGraphs . Since there’s more ways to get 165
type-results to make Eulerian-Path-Neighbor In SuperHyperGraphs more understandable. 166
For the sake of having Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs, there’s 167
a need to “redefine” the notion of “Eulerian-Path-Neighbor In SuperHyperGraphs ”. The 168
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 169
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 170

values. Assume a Eulerian-Path-Neighbor In SuperHyperGraphs . It’s redefined Neutrosophic 171

Eulerian-Path-Neighbor In SuperHyperGraphs if the mentioned Table holds, concerning, 172
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 173
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 174
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 175
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 176
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 177
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 178
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 179
Eulerian-Path-Neighbor In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have 180
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 181
have all Eulerian-Path-Neighbor In SuperHyperGraphs until the Eulerian-Path-Neighbor In 182
SuperHyperGraphs, then it’s officially called “Eulerian-Path-Neighbor In SuperHyperGraphs” 183

but otherwise, it isn’t Eulerian-Path-Neighbor In SuperHyperGraphs . There are some in- 184
stances about the clarifications for the main definition titled “Eulerian-Path-Neighbor In 185
SuperHyperGraphs ”. These two examples get more scrutiny and discernment since there are 186
characterized in the disciplinary ways of the SuperHyperClass based on Eulerian-Path-Neighbor 187
In SuperHyperGraphs . For the sake of having Neutrosophic Eulerian-Path-Neighbor In Super- 188
HyperGraphs, there’s a need to “redefine” the notion of “Neutrosophic Eulerian-Path-Neighbor 189

In SuperHyperGraphs” and “Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs ”. 190
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 191
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 192
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 193
the intended Table holds. And Eulerian-Path-Neighbor In SuperHyperGraphs are redefined 194
“Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs” if the intended Table holds. It’s 195

useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get 196
Neutrosophic type-results to make Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs 197
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 198
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Eulerian-Path-Neighbor 199
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 200
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Eulerian-Path-Neighbor 201

In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipart- 202
ite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the 203
intended Table holds. A SuperHyperGraph has “Neutrosophic Eulerian-Path-Neighbor In 204
SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 205
Eulerian-Path-Neighbor In SuperHyperGraphs amid the maximum value amid all SuperHy- 206
perVertices from a Eulerian-Path-Neighbor In SuperHyperGraphs .] Eulerian-Path-Neighbor 207
In SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph and the 208
number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHy- 209
perGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only 210
one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 211
Eulerian-Path-Neighbor In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 212

two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 213
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 214
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 215
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 216

intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 217
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 218
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 219
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 220
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 221
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 222
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 223
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 224
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 225
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 226
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 227
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 228
ways. The Neutrosophic recognition of the cancer in the long-term function. The specific 229
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 230
the move from the cancer is identified by this research. Sometimes the move of the cancer 231
the traces of the cancer on the complex tracks and between complicated groups of cells could be 237
fantasized by a Neutrosophic SuperHyperPath(-/Eulerian-Path-Neighbor In SuperHyperGraphs, 238
is to find either the longest Eulerian-Path-Neighbor In SuperHyperGraphs or the strongest 240
Eulerian-Path-Neighbor In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 241

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

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

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

978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 286




CHAPTER 2 287
Background 288
There are some scientific researches covering the topic of this research. In what follows, there 289
are some discussion and literature reviews about them. 290
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 291
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 292
hypergraphs” in Ref. [HG1] by Henry Garrett (2022). In this research article, a novel approach 293
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 294
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 295
prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science Re- 296
search (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 297
1 with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 298
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 299
based on initial background. 300
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super Hy- 301
per Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 302
Neutrosophic Super Hyper Classes” in Ref. [HG2] by Henry Garrett (2022). In this research 303
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 304
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 305
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 306
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 307
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 308
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph 309
and SuperHyperGraph. It’s the breakthrough toward independent results based on initial 310
background and fundamental SuperHyperNumbers. 311
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and 312
Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs 313
Alongside Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In 314
this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 315
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Treatments. 316
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 317
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Com- 318
put Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 319
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 320
toward independent results based on initial background and fundamental SuperHyperNumbers. 321
13
In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as 322
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 323
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 324
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 325
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 326
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 327
“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 328
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 329
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 330
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 331
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 332
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 333
Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 334

Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 335
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 336
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 337
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 338
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 339
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 340

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 341
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 342
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 343
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 345
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 346
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 347
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 348
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 349
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry 350
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic Su- 351
perHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 352

Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 353
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 354
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 355
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 356
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 357

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 358
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) Super- 359
HyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet 360
On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 361
Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry 362
Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 363

With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), 364
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs 365
and SuperHyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by 366
Henry Garrett (2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic 367

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses” 368
in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And 369
Polynomials To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. 370
[HG24] by Henry Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves 371
In The Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 372
Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett 373
(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition 374
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) 375
SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All 376
Possible Connections of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 377
SuperHyperClique on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. 378
[HG27] by Henry Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic 379
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” 380

in Ref. [HG28] by Henry Garrett (2023), “Demonstrating Complete Connections in Every 381
Embedded Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 382
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett 383
(2023), “Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed 384
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutro- 385
sophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As 386
(Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition Titled 387
“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 391

1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyper- 393
Graphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry 394
(Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions 396
on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 397
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett 398

(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic 399
SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Ini- 400
tial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 401
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. 402
[HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 403
HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; 404
HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; 407

HG242; HG243; HG244; HG245], there are some endeavors to formalize the basic Super- 420
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 421
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 422
HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 423
HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; HG106b; 426
HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; HG114b; 427

HG155b; HG156b; HG157b; HG158b; HG159b; HG160b; HG161b]. Two popular 433
scientific research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on 434
neutrosophic science is on [HG32b; HG44b]. 435
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 436
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 437
more than 4276 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 438
by Dr. Henry Garrett. This research book covers different types of notions and settings in 439
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 440
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 441
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 442
has more than 5274 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 443
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 444
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 445
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended 446
set and the intended set, simultaneously. It’s smart to consider a set but acting on its 447
complement that what’s done in this research book which is popular in the terms of high readers 448
in Scribd. 449
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions 450
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyper- 451
Graphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; 452

HG239; HG240; HG241; HG242; HG243; HG244; HG245] alongside scientific re- 469
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 470


Bibliography 484
HG1 [1] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 485
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 486
Trends Comp Sci Res 1(1) (2022) 06-14. 487
HG2 [2] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 488
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 489
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 490
10.33140/JMTCM.01.03.09) 491
HG3 [3] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 492
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 493
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 494
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 495
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 496
alongside-a.pdf) 497
HG216 [4] Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 498
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 499
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 500
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 501
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 502
hamiltonian-sets-.pdf) 503
HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 504
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 505
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 506
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 507
https://oa.mg/work/10.5281/zenodo.6319942 508
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 509
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 510
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 511
https://oa.mg/work/10.13140/rg.2.2.35241.26724 512
19
HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 513
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 514
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 515
HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 516
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 517
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 518
10.20944/preprints202301.0282.v1). 519
HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 520
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 521
10.20944/preprints202301.0267.v1). 522
HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 523
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 524
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 525
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 526

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 556
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 557
(doi: 10.20944/preprints202212.0549.v1). 558
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 559
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 560
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 561
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 562
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 563
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 564
(doi: 10.20944/preprints202212.0500.v1). 565
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 566
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 567
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 569
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 570
HG245 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 572
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 573
10.5281/zenodo.7824560). 574
HG244 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 575
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 576
(doi: 10.5281/zenodo.7824623). 577
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 579
Zenodo 2023, (doi: 10.5281/zenodo.7819531). 580
HG242 [28] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 581
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 582
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 585
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 587
2023, (doi: 10.5281/zenodo.7809365). 588
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 590
2023, (doi: 10.5281/zenodo.7809358). 591

HG238 [32] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 592
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 593
10.5281/zenodo.7809219). 594
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 596
10.5281/zenodo.7809328). 597
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 599
2023, (doi: 10.5281/zenodo.7806767). 600
HG235 [35] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 601
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 602
2023, (doi: 10.5281/zenodo.7806838). 603
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 605
ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 606
HG233 [37] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 607
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 608
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 609
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 611
(doi: 10.5281/zenodo.7799902). 612
HG231 [39] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 613
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 614
2023, (doi: 10.5281/zenodo.7804218). 615
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 617
(doi: 10.5281/zenodo.7796334). 618
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 620
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 623
10.5281/zenodo.7791952). 624
HG225 [43] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 625
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 626
(doi: 10.5281/zenodo.7791982). 627
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 629
10.5281/zenodo.7790026). 630

HG223 [45] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 631
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 632
2023, (doi: 10.5281/zenodo.7790052). 633
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 635
2023, (doi: 10.5281/zenodo.7787066). 636
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 638
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 639
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 641
10.5281/zenodo.7781476). 642
HG219 [49] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 643
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 644
10.5281/zenodo.7783082). 645
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 647
10.5281/zenodo.7777857). 648
HG217 [51] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 649
10.5281/zenodo.7779286). 651
HG215 [52] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 652
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 653
(doi: 10.5281/zenodo.7771831). 654
HG214 [53] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 655
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 656
2023, (doi: 10.5281/zenodo.7772468). 657
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 659
10.13140/RG.2.2.20913.25446). 660
HG212 [55] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 661
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 662
10.5281/zenodo.7764916). 663
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 665
10.13140/RG.2.2.11770.98247). 666
HG210 [57] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 667
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 668
10.13140/RG.2.2.12400.12808). 669

By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 671
2023, (doi: 10.13140/RG.2.2.22545.10089). 672
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 674
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 675
HG207 [60] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 676
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 677
10.13140/RG.2.2.11377.76644). 678
HG206 [61] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 679
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 680
10.13140/RG.2.2.23750.96329). 681
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 683
10.13140/RG.2.2.31366.24641). 684
HG204 [63] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 685
10.13140/RG.2.2.34721.68960). 687
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 689
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 692
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 695
10.13140/RG.2.2.24288.35842). 696
HG200 [67] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 697
10.13140/RG.2.2.32467.25124). 699
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 701
10.13140/RG.2.2.31025.45925). 702
HG198 [69] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 703
10.13140/RG.2.2.17184.25602). 705
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 707
10.13140/RG.2.2.23423.28327). 708

HG196 [71] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 709
10.13140/RG.2.2.28456.44805). 711
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 713
10.13140/RG.2.2.23525.68320). 714
HG194 [73] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 715
10.13140/RG.2.2.20170.24000). 717
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 719
10.13140/RG.2.2.36475.59683). 720
HG192 [75] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 721
10.13140/RG.2.2.29764.71046). 723
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 725
2023, (doi: 10.13140/RG.2.2.18780.87683). 726
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 728
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 731
10.13140/RG.2.2.26134.01603). 732
HG188 [79] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 733
10.13140/RG.2.2.27392.30721). 735
HG187 [80] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 736
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 737
10.13140/RG.2.2.33028.40321). 738
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 740
10.13140/RG.2.2.21389.20966). 741
HG185 [82] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 742
10.13140/RG.2.2.16356.04489). 744
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 746
10.13140/RG.2.2.21756.21129). 747

HG183 [84] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 748
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 749
10.13140/RG.2.2.30983.68009). 750
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 752
10.13140/RG.2.2.28552.29445). 753
HG181 [86] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 754
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 755
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 756
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 758
10.13140/RG.2.2.35105.89447). 759
HG179 [88] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 760
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 761
(doi: 10.13140/RG.2.2.30072.72960). 762
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 764
10.13140/RG.2.2.31147.52003). 765
HG177 [90] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 766
10.13140/RG.2.2.32825.24163). 768
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 770
10.13140/RG.2.2.13059.58401). 771
HG175 [92] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 772
10.13140/RG.2.2.11172.14720). 774
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 776
2023, (doi: 10.13140/RG.2.2.22011.80165). 777
HG173 [94] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 778
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 779
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 780
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 782
HG171 [96] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 784
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 786

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 788
2023, (doi: 10.13140/RG.2.2.19944.14086). 789
HG169 [98] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 790
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 792
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 794
(doi: 10.13140/RG.2.2.33103.76968). 795
HG167 [100] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 796
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 797
2023, (doi: 10.13140/RG.2.2.23037.44003). 798
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 800
(doi: 10.13140/RG.2.2.35646.56641). 801
HG165 [102] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 802
(doi: 10.13140/RG.2.2.18030.48967). 804
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 806
(doi: 10.13140/RG.2.2.13973.81121). 807
HG163 [104] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 808
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 809
2023, (doi: 10.13140/RG.2.2.34106.47047). 810
HG162 [105] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 811
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 812
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 815
2023, (doi: 10.13140/RG.2.2.31956.88961). 816
HG160 [107] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 817
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 818
2023, (doi: 10.13140/RG.2.2.15179.67361). 819
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 821
10.13140/RG.2.2.21510.45125). 822
HG158 [109] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 823
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 824
2023, (doi: 10.13140/RG.2.2.13121.84321). 825

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 827
10.13140/RG.2.2.11758.69441). 828
HG156 [111] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 829
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 830
2023, (doi: 10.13140/RG.2.2.31891.35367). 831
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 833
10.13140/RG.2.2.19360.87048). 834
HG154 [113] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 835
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 836
2023, (doi: 10.13140/RG.2.2.32363.21286). 837
HG153 [114] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 838
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 839
(doi: 10.13140/RG.2.2.23266.81602). 840
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 842
10.13140/RG.2.2.19911.37285). 843
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 845
10.13140/RG.2.2.11050.90569). 846
HG150 [117] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 847
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 848
HG149 [118] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 850
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 851
HG148 [119] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 853
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 854
HG147 [120] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 856
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 857
(doi: 10.13140/RG.2.2.30182.50241). 858
HG146 [121] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 859
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 860
HG145 [122] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 862
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 863

HG144 [123] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 865
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 866
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 867
HG143 [124] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 868
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 869
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 870
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 873
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 876
HG140 [127] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 877
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 878
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 879
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 882
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 885
HG137 [130] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 886
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 887
HG136 [131] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 889
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 890
2023, (doi: 10.13140/RG.2.2.17252.24968). 891
HG135 [132] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 892
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 893
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 894
HG134 [133] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 895
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 896
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 897
HG132 [134] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 898
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 899
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 900
HG131 [135] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 901
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 902
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 903

HG130 [136] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 904
Recognition in The Confrontation With Super Attacks In Hyper Situations By 905
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 906
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 907
HG129 [137] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 908

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 909
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 910
HG128 [138] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 912
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 913
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 914
HG127 [139] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 915
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 916
2023,(doi: 10.13140/RG.2.2.36745.93289). 917
HG126 [140] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 918

HG125 [141] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 921
10.20944/preprints202301.0282.v1). 924
HG124 [142] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 925
10.20944/preprints202301.0267.v1).). 927
HG123 [143] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 928
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 929
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 930
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 931
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 932
HG122 [144] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 933
prints202301.0262.v1). 936
HG121 [145] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 937
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 938
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 939
2023010224, (doi: 10.20944/preprints202301.0224.v1). 942

HG24 [147] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 943

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 944
10.13140/RG.2.2.35061.65767). 945
HG25 [148] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 946
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 947
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 948
10.13140/RG.2.2.18494.15680). 949
HG26 [149] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 950
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 951

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 952
10.13140/RG.2.2.32530.73922). 953
HG27 [150] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 954
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 955
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 956
10.13140/RG.2.2.15897.70243). 957
10.13140/RG.2.2.32530.73922). 961
prints202301.0105.v1). 964
HG28 [153] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 965
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 966

HG29 [154] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 968
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 969
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 970
10.13140/RG.2.2.23172.19849). 971

HG30 [157] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 978
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 979
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 980
10.13140/RG.2.2.17385.36968). 981

HG107 [158] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 982
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 983
Beyond”, Preprints 2023, 2023010044 984
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 986

(doi: 10.20944/preprints202301.0043.v1). 987
HG31 [160] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 988
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 989
2023, (doi: 10.13140/RG.2.2.28945.92007). 990
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 995
10.13140/RG.2.2.35774.77123). 996

HG35 [164] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1000
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1001
10.13140/RG.2.2.29430.88642). 1002
(doi: 10.20944/preprints202212.0549.v1). 1008
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1010

10.13140/RG.2.2.19380.94084). 1011
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1019

(doi: 10.20944/preprints202212.0500.v1). 1022
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1024
10.13140/RG.2.2.20993.12640). 1025
HG952 [172] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1026
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1027

SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 1030

ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1031
HG942 [174] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1032

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1033
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 1034

Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 1037
HG37 [176] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1038
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1039
10.13140/RG.2.2.29173.86244). 1040
HG38 [177] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1041
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1042
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1043
HG161b [178] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1044
(doi: 10.5281/zenodo.7826705). 1045
HG160b [179] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1046
2023 (doi: 10.5281/zenodo.7820680). 1047
HG159b [180] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1048
10.5281/zenodo.7812750). 1049
HG158b [181] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1050

Garrett, 2023 (doi: 10.5281/zenodo.7812142). 1051
HG157b [182] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1052

Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 1053
HG156b [183] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1054
2023 (doi: 10.5281/zenodo.7807782). 1055
HG155b [184] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1056
2023 (doi: 10.5281/zenodo.7804449). 1057

HG154b [185] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1058

HG153b [186] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1060
(doi: 10.5281/zenodo.7792307). 1061
HG152b [187] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1062
(doi: 10.5281/zenodo.7790728). 1063
HG151b [188] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1064
2023 (doi: 10.5281/zenodo.7787712). 1065
HG150b [189] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1066
10.5281/zenodo.7783791). 1067
HG149b [190] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1068
10.5281/zenodo.7780123). 1069
HG148b [191] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1070
(doi: 10.5281/zenodo.7773119). 1071
HG147b [192] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1072
odo.7637762). 1073
HG146b [193] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1074
10.5281/zenodo.7766174). 1075
HG145b [194] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1076
10.5281/zenodo.7762232). 1077
HG144b [195] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1078
(doi: 10.5281/zenodo.7758601). 1079
HG143b [196] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1080
10.5281/zenodo.7754661). 1081
HG142b [197] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1082
10.5281/zenodo.7750995) . 1083
HG141b [198] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1084
(doi: 10.5281/zenodo.7749875). 1085
HG140b [199] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1086
10.5281/zenodo.7747236). 1087
HG139b [200] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1088
10.5281/zenodo.7742587). 1089
HG138b [201] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1090
(doi: 10.5281/zenodo.7738635). 1091
HG137b [202] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1092
10.5281/zenodo.7734719). 1093

HG136b [203] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1094
10.5281/zenodo.7730484). 1095
HG135b [204] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1096
(doi: 10.5281/zenodo.7730469). 1097
HG134b [205] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1098
10.5281/zenodo.7722865). 1099
HG133b [206] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1100
odo.7713563). 1101
odo.7709116). 1103
HG131b [208] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1104
10.5281/zenodo.7706415). 1105
HG130b [209] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1106
(doi: 10.5281/zenodo.7706063). 1107
HG129b [210] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1108
(doi: 10.5281/zenodo.7701906). 1109
HG128b [211] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1110
odo.7700205). 1111
HG127b [212] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1112
10.5281/zenodo.7694876). 1113
HG126b [213] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1114
10.5281/zenodo.7679410). 1115
HG125b [214] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1116
10.5281/zenodo.7675982). 1117
HG124b [215] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1118
10.5281/zenodo.7672388). 1119
HG123b [216] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1120
odo.7668648). 1121
HG122b [217] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1122
10.5281/zenodo.7662810). 1123
HG121b [218] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1124
10.5281/zenodo.7659162). 1125
HG120b [219] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1126
odo.7653233). 1127
HG119b [220] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1128
odo.7653204). 1129

HG118b [221] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1130
odo.7653142). 1131
HG117b [222] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1132
odo.7653117). 1133
HG116b [223] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1134
odo.7653089). 1135
HG115b [224] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1136
odo.7651687). 1137
HG114b [225] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1138
odo.7651619). 1139
HG113b [226] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1140
odo.7651439). 1141
HG112b [227] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1142
odo.7650729). 1143
HG111b [228] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1144
odo.7647868). 1145
HG110b [229] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1146
odo.7647017). 1147
HG109b [230] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1148
odo.7644894). 1149
HG108b [231] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1150
odo.7641880). 1151
HG107b [232] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1152
odo.7632923). 1153
HG106b [233] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1154
odo.7623459). 1155
HG105b [234] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1156
10.5281/zenodo.7606416). 1157
HG104b [235] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1158
10.5281/zenodo.7606416). 1159
HG103b [236] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1160
odo.7606404). 1161
HG102b [237] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1162
10.5281/zenodo.7580018). 1163
HG101b [238] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1164
odo.7580018). 1165

odo.7580018). 1167
odo.7579929). 1169
HG98b [241] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1170
10.5281/zenodo.7563170). 1171
HG97b [242] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1172
odo.7563164). 1173
HG96b [243] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1174
odo.7563160). 1175
odo.7563160). 1177
HG94b [245] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1178
10.5281/zenodo.7563160). 1179
HG93b [246] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1180
10.5281/zenodo.7557063). 1181
HG92b [247] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1182
10.5281/zenodo.7557009). 1183
HG91b [248] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1184
10.5281/zenodo.7539484). 1185
HG90b [249] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1186
10.5281/zenodo.7523390). 1187
HG89b [250] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1188
10.5281/zenodo.7523390). 1189
HG88b [251] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1190
10.5281/zenodo.7523390). 1191
HG87b [252] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1192
odo.7574952). 1193
HG86b [253] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1194
10.5281/zenodo.7574992). 1195
odo.7523357). 1197
HG84b [255] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1198
10.5281/zenodo.7523357). 1199
HG83b [256] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1200
10.5281/zenodo.7504782). 1201

HG82b [257] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1202
10.5281/zenodo.7504782). 1203
HG81b [258] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1204
10.5281/zenodo.7504782). 1205
HG80b [259] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1206
10.5281/zenodo.7499395). 1207
HG79b [260] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7499395). 1209
HG78b [261] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1210
10.5281/zenodo.7499395). 1211
HG77b [262] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1212
10.5281/zenodo.7497450). 1213
HG76b [263] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1214
10.5281/zenodo.7497450). 1215
HG75b [264] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1216
10.5281/zenodo.7494862). 1217
HG74b [265] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1218
odo.7494862). 1219
HG73b [266] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1220
10.5281/zenodo.7494862). 1221
HG72b [267] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1222
10.5281/zenodo.7493845). 1223
HG71b [268] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1224
10.5281/zenodo.7493845). 1225
HG70b [269] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1226
10.5281/zenodo.7493845). 1227
HG69b [270] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1228
odo.7539484). 1229
HG68b [271] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1230
odo.7523390). 1231
HG67b [272] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1232
odo.7523357). 1233
HG66b [273] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1234
odo.7504782). 1235
HG65b [274] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1236
odo.7499395). 1237

HG64b [275] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1238
odo.7497450). 1239
HG63b [276] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1240
odo.7494862). 1241
HG62b [277] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1242
odo.7493845). 1243
HG61b [278] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1244
odo.7480110). 1245
HG60b [279] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1246
odo.7378758). 1247
HG32b [280] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1248
odo.6320305). 1249
HG44b [281] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1250
odo.6677173). 1251

CHAPTER 3 1252
Acknowledgements 1253
The author is going to express his gratitude and his appreciation about the brains and their 1254
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1255
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1256 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
1257
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 1258
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1259
ideas to be on the star lines of words and shining like stars, forever. 1260
41
CHAPTER 4 1261
Cancer In Extreme SuperHyperGraph 1262
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1263
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1264
as the consequences of the model, some parameters are used. The cells are under attack of this 1265
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1266
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1267
In the following, some Extreme steps are Extreme devised on this disease. 1268
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1269
function. 1270
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1271
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1272
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1273
since there are some determinacy, indeterminacy and neutrality about the moves and the 1274
effects of the cancer on that region; this event leads us to choose another model [it’s said 1275
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1276
what’s done. 1277
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1278
they’ve got the names, and some general Extreme models. The moves and the Extreme 1279
traces of the cancer on the complex tracks and between complicated groups of cells could be 1280
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1281
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1282
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1283
in those Extreme Extreme SuperHyperModels. 1284
Some cells have been faced with some attacks from the situation which is caused by the 1285
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1286
which in that, the cells could be labelled as some groups and some groups or individuals have 1287
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1288
the embedded situations, the individuals of cells and the groups of cells could be considered 1289
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1290
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1291
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1292
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1293
43
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1294
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1295
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1296
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1297
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1298
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1299
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1300

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1301
is going to figure out what’s going on this phenomenon. The special case of this disease is 1302
considered and as the consequences of the model, some parameters are used. The cells are 1303
under attack of this disease but the moves of the cancer in the special region are the matter of 1304
mind. The recognition of the cancer could help to find some treatments for this disease. The 1305
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1306
Recognition” and both bases are the background of this research. Sometimes the cancer has 1307
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1308
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1309
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1310
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1311
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1312
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1313
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1314
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1315
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1316
and neutrality about the moves and the effects of the cancer on that region; this event leads 1317
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1318
perception on what’s happened and what’s done. There are some specific models, which 1319
are well-known and they’ve got the names, and some general models. The moves and the 1320
traces of the cancer on the complex tracks and between complicated groups of cells could 1321
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1322
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1323
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1324

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1325
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1326
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1327
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1328
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1329
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1330
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1331
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1332
based on the fixed groups of cells or the fixed groups of group of cells? 1333
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1334
messy and dense SuperHyperModels where embedded notions are illustrated? 1335
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1336
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1337
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1338

research has taken more motivations to define SuperHyperClasses and to find some connections 1339
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1340
instances and examples to make clarifications about the framework of this research. The general 1341
results and some results about some connections are some avenues to make key point of this 1342
research, “Cancer’s Recognition”, more understandable and more clear. 1343
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1344
on the modeling of the regions where are under the attacks of the cancer to recognize 1345
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1346
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1347
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1348
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1349
instances and literature reviews have taken the whole way through. In this scientific research, 1350
the literature reviews have fulfilled the lines containing the notions and the results. The 1351
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1352
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1353
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1354
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1355
of the moves of the cancer in the longest and strongest styles with the formation of the design 1356
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1357
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1358
out the background for the SuperHyperNotions. 1359

CHAPTER 5 1360
Extreme Eulerian-Path-Neighbor 1361
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1362
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1363
2023, (doi: 10.13140/RG.2.2.34953.52320). 1364

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1365
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1366
(doi: 10.13140/RG.2.2.33275.80161). 1367
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1368
10.13140/RG.2.2.11050.90569). 1370
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1371
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1372
10.13140/RG.2.2.17761.79206). 1373
10.13140/RG.2.2.19911.37285). 1376
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1377
10.13140/RG.2.2.23266.81602). 1379
10.13140/RG.2.2.19360.87048). 1382
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1383
10.13140/RG.2.2.32363.21286). 1385
10.13140/RG.2.2.11758.69441). 1388
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1389
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1390
10.13140/RG.2.2.31891.35367). 1391
10.13140/RG.2.2.21510.45125). 1394
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1395
10.13140/RG.2.2.13121.84321). 1397

CHAPTER 6 1398
New Ideas On Super Nebulous By Hyper 1399
Nebbish Of Eulerian-Path-Neighbor In 1400
Cancer’s Recognition With 1401
(Neutrosophic) SuperHyperGraph 1402
49
CHAPTER 7 1403
ABSTRACT 1404
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1405
Path-Neighbor ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Path-Neighbor 1406

pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 1407
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperEulerian-Path-Neighbor 1408
if the following expression is called Neutrosophic e-SuperHyperEulerian-Path-Neighbor criteria holds 1409
∀N (Ea ) ∈ P : P is
a SuperHyperPath and it has
the all number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Path-Neighbor if the following expression is called Neutrosophic 1410

e-SuperHyperEulerian-Path-Neighbor criteria holds 1411
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1412

SuperHyperEulerian-Path-Neighbor if the following expression is called Neutrosophic v- 1413
SuperHyperEulerian-Path-Neighbor criteria holds 1414
∀N (Va ) ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Path-Neighbor if the following expression is called Neutrosophic 1415

v-SuperHyperEulerian-Path-Neighbor criteria holds 1416
∀N (Va ) ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1417
SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, 1418
51
Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Path-Neighbor, 1419

and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor. ((Neutrosophic) SuperHyperEulerian-Path- 1420
Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1421
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1422
and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor and C(N SHG) for an Extreme SuperHyper- 1425
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1426
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 1427
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1428
the Extreme SuperHyperEulerian-Path-Neighbor; a Neutrosophic SuperHyperEulerian-Path-Neighbor if it’s 1429
either of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path- 1430
Neighbor, Neutrosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian- 1431

Path-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 1432
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 1433
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges 1434
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1435
Path-Neighbor; an Extreme SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s either of 1436
Neutrosophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, 1437

Neutrosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path- 1438
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1439
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1440
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 1441
S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 1442
SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Path-Neighbor; and the 1443
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian- 1444
Path-Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, 1445
and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor and C(N SHG) for a Neutrosophic Su- 1447
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1448
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 1449
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 1450
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1451
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1452
Path-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an 1453
Extreme V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian- 1454

Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neutrosophic v-SuperHyperEulerian- 1455
Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor and C(N SHG) for an Extreme 1456
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 1457
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 1458
conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHy- 1459
perVertices such that they form the Extreme SuperHyperEulerian-Path-Neighbor; a Neutrosophic 1460
V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, 1461
and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor and C(N SHG) for a Neutrosophic Super- 1463
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1464

SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 1465

seNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 1466
they form the Neutrosophic SuperHyperEulerian-Path-Neighbor; an Extreme V-SuperHyperEulerian- 1467
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1471
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 1472
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1473
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1474
SuperHyperEulerian-Path-Neighbor; and the Extreme power is corresponded to its Extreme coefficient; 1475
a Neutrosophic SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s either of Neutro- 1476
sophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neut- 1477

rosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor 1478
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1479
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1480
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 1481
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1482
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1483
SuperHyperEulerian-Path-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic 1484
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 1485
namely, a SuperHyperEulerian-Path-Neighbor and Neutrosophic SuperHyperEulerian-Path-Neighbor. Two 1486
different types of SuperHyperDefinitions are debut for them but the research goes further 1487
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 1494
under research to figure out the challenges make sense about ongoing and upcoming research. 1495
The special case is up. The cells are viewed in the deemed ways. There are different types 1496
of them. Some of them are individuals and some of them are well-modeled by the group of 1497
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 1498
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 1499
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1500
these complex and dense SuperHyperModels open up some avenues to research on theoret- 1501
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 1502
It’s also officially collected in the form of some questions and some problems. Assume a 1503
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Path-Neighbor is 1504
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1505

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1507
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1508
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Path-Neighbor is a max- 1509
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1510

that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1511
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1512
and |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first Expression, holds if S is a 1513
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 1514
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperEulerian- 1515
Path-Neighbor . Since there’s more ways to get type-results to make a SuperHyperEulerian-Path-Neighbor 1516
more understandable. For the sake of having Neutrosophic SuperHyperEulerian-Path-Neighbor, there’s 1517
a need to “redefine” the notion of a “SuperHyperEulerian-Path-Neighbor ”. The SuperHyperVertices 1518
a SuperHyperEulerian-Path-Neighbor . It’s redefined a Neutrosophic SuperHyperEulerian-Path-Neighbor 1521
if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 1522
HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with 1523

the key points, “The Values of The Vertices & The Number of Position in Alphabet”, 1524
“The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Values of 1525
The Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The 1526
maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum 1527
Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce 1528
the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Path-Neighbor 1529

. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 1530
kind of SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Path-Neighbor until 1531
the SuperHyperEulerian-Path-Neighbor, then it’s officially called a “SuperHyperEulerian-Path-Neighbor” 1532
but otherwise, it isn’t a SuperHyperEulerian-Path-Neighbor . There are some instances about the 1533
clarifications for the main definition titled a “SuperHyperEulerian-Path-Neighbor ”. These two 1534
examples get more scrutiny and discernment since there are characterized in the disciplinary 1535
ways of the SuperHyperClass based on a SuperHyperEulerian-Path-Neighbor . For the sake of having 1536
a Neutrosophic SuperHyperEulerian-Path-Neighbor, there’s a need to “redefine” the notion of a “Neut- 1537
rosophic SuperHyperEulerian-Path-Neighbor” and a “Neutrosophic SuperHyperEulerian-Path-Neighbor ”. 1538
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 1539
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 1540
values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyper- 1541

Graph” if the intended Table holds. And a SuperHyperEulerian-Path-Neighbor are redefined to a 1542
“Neutrosophic SuperHyperEulerian-Path-Neighbor” if the intended Table holds. It’s useful to define 1543
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 1544
results to make a Neutrosophic SuperHyperEulerian-Path-Neighbor more understandable. Assume 1545
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 1546

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Path-Neighbor, SuperHyperStar, 1547
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1548
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Path-Neighbor”, “Neutrosophic SuperHyper- 1549
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1550
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1551
“Neutrosophic SuperHyperEulerian-Path-Neighbor” where it’s the strongest [the maximum Neutro- 1552
sophic value from all the SuperHyperEulerian-Path-Neighbor amid the maximum value amid all 1553
SuperHyperVertices from a SuperHyperEulerian-Path-Neighbor .] SuperHyperEulerian-Path-Neighbor . 1554
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1555
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1556

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1557
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Path-Neighbor if it’s 1558
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 1559
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1560
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1561
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 1562
the traces of the cancer on the complex tracks and between complicated groups of cells could 1583
be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Path-Neighbor, SuperHyper- 1584
Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1585
either the longest SuperHyperEulerian-Path-Neighbor or the strongest SuperHyperEulerian-Path-Neighbor 1586
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Path-Neighbor, 1587

called SuperHyperEulerian-Path-Neighbor, and the strongest SuperHyperEulerian-Path-Neighbor, called 1588
Neutrosophic SuperHyperEulerian-Path-Neighbor, some general results are introduced. Beyond that 1589
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1590
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1591
SuperHyperEulerian-Path-Neighbor. There isn’t any formation of any SuperHyperEulerian-Path-Neighbor 1592

but literarily, it’s the deformation of any SuperHyperEulerian-Path-Neighbor. It, literarily, deforms 1593
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Path-Neighbor 1594
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1595
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Path-Neighbor, Cancer’s Neutro- 1596
sophic Recognition 1597


CHAPTER 8 1599
Applied Notions Under The Scrutiny Of 1600
The Motivation Of This Scientific 1601
Research 1602
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1603
try to bring the motivations in the narrative ways. Some cells have been faced with some 1604
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1605
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1606
as some groups and some groups or individuals have excessive labels which all are raised from 1607
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1608
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1609
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1610
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1611
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1612
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1613
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1614
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1615
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1616
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1617
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1618
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1619
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1620
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1621
The special case of this disease is considered and as the consequences of the model, some 1622
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1623
the special region are the matter of mind. The recognition of the cancer could help to find some 1624
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1625
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1626
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1627
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1628
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 1629
formation of the design and the architecture are formally called “ SuperHyperEulerian-Path-Neighbor” 1630
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1631
57
embedded styles to figure out the background for the SuperHyperNotions. The recognition of 1632
the cancer in the long-term function. The specific region has been assigned by the model [it’s 1633
called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this 1634
research. Sometimes the move of the cancer hasn’t be easily identified since there are some 1635
determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that 1636
region; this event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] 1637
to have convenient perception on what’s happened and what’s done. There are some specific 1638
models, which are well-known and they’ve got the names, and some general models. The 1639
moves and the traces of the cancer on the complex tracks and between complicated groups 1640
of cells could be fantasized by a Extreme SuperHyperPath (-/SuperHyperEulerian-Path-Neighbor, 1641
is to find either the optimal SuperHyperEulerian-Path-Neighbor or the Extreme SuperHyperEulerian-Path- 1643
Neighbor in those Extreme SuperHyperModels. Some general results are introduced. Beyond that 1644
in SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1645
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1646
and it doesn’t form. 1649
amount of SuperHyperEulerian-Path-Neighbor” of either individual of cells or the groups of cells based 1651
on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian-Path- 1652
Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 1653
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1654
messy and dense SuperHyperModels where embedded notions are illustrated? 1655
Thus it motivates us to define different types of “ SuperHyperEulerian-Path-Neighbor” and “Extreme 1657
SuperHyperEulerian-Path-Neighbor” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then 1658

the research has taken more motivations to define SuperHyperClasses and to find some 1659
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us 1660
to get some instances and examples to make clarifications about the framework of this research. 1661
The general results and some results about some connections are some avenues to make key 1662
point of this research, “Cancer’s Recognition”, more understandable and more clear. 1663
The framework of this research is as follows. In the beginning, I introduce basic definitions 1664
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1665
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1666
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1667
review literature are applied to make sense about what’s going to figure out about the upcoming 1668
sections. The main definitions and their clarifications alongside some results about new 1669
notions, SuperHyperEulerian-Path-Neighbor and Extreme SuperHyperEulerian-Path-Neighbor, are figured 1670

out in sections “ SuperHyperEulerian-Path-Neighbor” and “Extreme SuperHyperEulerian-Path-Neighbor”. 1671
In the sense of tackling on getting results and in Eulerian-Path-Neighbor to make sense about 1672
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1673
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1674
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1675
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1676

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1677
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1678
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1679
and as concluding and closing section of theoretical research are contained in the section 1680
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1681
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1682
Results”, “ SuperHyperEulerian-Path-Neighbor”, “Extreme SuperHyperEulerian-Path-Neighbor”, “Results 1683

on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious 1684
questions about what’s done about the SuperHyperNotions to make sense about excellency of 1685
this research and going to figure out the word “best” as the description and adjective for this 1686
research as presented in section, “ SuperHyperEulerian-Path-Neighbor”. The keyword of this research 1687
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 1688
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 1689
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 1690
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 1691
research in the terms of “questions” and “problems” to make sense to figure out this research in 1692
featured style. The advantages and the limitations of this research alongside about what’s done 1693
in this research to make sense and to get sense about what’s figured out are included in the 1694
section, “Conclusion and Closing Remarks”. 1695

CHAPTER 9 1696
Extreme Preliminaries Of This Scientific 1697
Research On the Redeemed Ways 1698
In this section, the basic material in this scientific research, is referred to [Single Valued 1699
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1700
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1701

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1702
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1703
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1704
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1705
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1706
their clarifications are addressed to Ref.[HG38]. 1707

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

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

Let X be a Eulerian-Path-Neighbor 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). 1711
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1712
where 1713
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1714
(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); 1715
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1716
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1717
1, 2, . . . , n0 ); 1718
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1719
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1720

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1727
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1728
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1729
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1730
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1731
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1732

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

(Ref.[HG38],Definition 2.7,p.3). 1734
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1735
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1736
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1737
(i) If |Vi | = 1, then Vi is called vertex; 1738
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1739
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1740
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1741
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1742
SuperEdge; 1743
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1744
SuperHyperEdge. 1745
If we choose different types of binary operations, then we could get hugely diverse types of 1746
general forms of Neutrosophic SuperHyperGraph (NSHG). 1747
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1748

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1749
x, y, z, w ∈ [0, 1]: 1750
(i) 1 ⊗ x = x; 1751
(ii) x ⊗ y = y ⊗ x; 1752
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1753
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1754

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

where 1757

1, 2, . . . , n0 ); 1762
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1763
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1764
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1765
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1766
0


SuperEdge; 1786
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1789
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1790
makes the patterns and regularities. 1791
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1792
of elements of SuperHyperEdges are the same. 1793

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1794
makes to have SuperHyperUniform more understandable. 1795
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1796
Classes as follows. 1797
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1798
two given SuperHyperEdges with two exceptions; 1799
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1800
SuperHyperEdges; 1801
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1802
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1803
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1804
in common; 1805
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1806
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1807
SuperHyperEdge in common; 1808
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1809
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1810
SuperVertex. 1811
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 1812
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1813
(i) Vi , Vi+1 ∈ Ei0 ; 1814
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1815
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1816
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1817
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1818
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1819
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1820
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1821
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1823
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1824
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1825
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1826
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1827
perPath . 1828
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 1829
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1830
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1831
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1832
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1833
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1834

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1847
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1848
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1849
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Path- 1850

Neighbor). 1851
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1853
or E 0 is called 1854
(i) Neutrosophic e-SuperHyperEulerian-Path-Neighbor if the following expression is called 1855

Neutrosophic e-SuperHyperEulerian-Path-Neighbor criteria holds 1856
∀N (Ea ) ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Path-Neighbor if the following expression is called 1857

Neutrosophic re-SuperHyperEulerian-Path-Neighbor criteria holds 1858
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1859
(iii) Neutrosophic v-SuperHyperEulerian-Path-Neighbor if the following expression is called 1860
Neutrosophic v-SuperHyperEulerian-Path-Neighbor criteria holds 1861
∀N (Va ) ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Path-Neighbor if the following expression is called 1862
∀N (Va ) ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1864

(v) Neutrosophic SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 1865

SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neutro- 1866
sophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path- 1867
Neighbor. 1868
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Path-Neighbor). 1869

(i) an Extreme SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 1872

SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neut- 1873
rosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path- 1874
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1875
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 1876

the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1877
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1878
SuperHyperEulerian-Path-Neighbor; 1879
(ii) a Neutrosophic SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 1880

Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1883
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1884
sophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1885
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutro- 1886
sophic SuperHyperEulerian-Path-Neighbor; 1887
(iii) an Extreme SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s either 1888

of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian- 1889
Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv- 1890
SuperHyperEulerian-Path-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 1891

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 1892
cients defined as the Extreme number of the maximum Extreme cardinality of the 1893
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1894
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1895
that they form the Extreme SuperHyperEulerian-Path-Neighbor; and the Extreme power is 1896
corresponded to its Extreme coefficient; 1897
(iv) a Neutrosophic SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s 1898

either of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian- 1899
SuperHyperEulerian-Path-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 1901

N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1902
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality 1903
of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neut- 1904
rosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 1905
SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Path-Neighbor; 1906
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 1907

(v) an Extreme V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 1908

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1912
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 1913
(vi) a Neutrosophic V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic 1916
e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neut- 1917

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 1920
(vii) an Extreme V-SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s 1924


Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1930
(viii) a Neutrosophic SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s 1934


of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neut- 1940
and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 1943
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Path-Neighbor). 1944

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1945
(i) an δ−SuperHyperEulerian-Path-Neighbor is a Neutrosophic kind of Neutrosophic 1946

SuperHyperEulerian-Path-Neighbor such that either of the following expressions hold for 1947
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1948
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2

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
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 1949

(29.1), holds if S is an δ−SuperHyperDefensive; 1950
(ii) a Neutrosophic δ−SuperHyperEulerian-Path-Neighbor is a Neutrosophic kind of Neut- 1951

rosophic SuperHyperEulerian-Path-Neighbor such that either of the following Neutrosophic 1952
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1953
|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 1954

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1955
For the sake of having a Neutrosophic SuperHyperEulerian-Path-Neighbor, there’s a need to 1956

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 1957
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 1958
there’s the usage of the position of labels to assign to the values. 1959
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1960
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 1961
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1962
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1963
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 1965
sophic SuperHyperPath , SuperHyperEulerian-Path-Neighbor, SuperHyperStar, SuperHyperBipart- 1966
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 1967
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 1968
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 1969
perHyperWheel if the Table (29.2) holds. 1970
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Path-Neighbor. 1971
Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Path- 1972
Neighbor more Neutrosophicly understandable. 1973
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Path-Neighbor”. The 1975
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1976
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1977
1978

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

136TBL4

136TBL1
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Path-Neighbor. It’s redefined a Neutrosophic 1979

SuperHyperEulerian-Path-Neighbor if the Table (29.3) holds. 1980

CHAPTER 10 1981
Extreme SuperHyper But As The Eulerian-Path-Neighbor 1982
Extensions Excerpt From Dense And 1983
Super Forms 1984
Definition 10.0.1. (Extreme event). 1985

Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1986
a probability Eulerian-Path-Neighbor. Any Extreme k-subset of A of V is called Extreme k-event 1987
and if k = 2, then Extreme subset of A of V is called Extreme event. The following expression 1988
is called Extreme probability of A. 1989
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 1990

Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 1991
probability Eulerian-Path-Neighbor. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 1992
if the following expression is called Extreme s-independent criteria 1993
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 1994
following expression is called Extreme independent criteria 1995
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 1996

probability Eulerian-Path-Neighbor. Any k-function Eulerian-Path-Neighbor like E is called Extreme k- 1998
Variable. If k = 2, then any 2-function Eulerian-Path-Neighbor like E is called Extreme Variable. 1999
The notion of independent on Extreme Variable is likewise. 2000
Definition 10.0.4. (Extreme Expectation). 2001
Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2002
73
is a probability Eulerian-Path-Neighbor. A Extreme k-Variable E has a number is called Extreme 2003

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

probability Eulerian-Path-Neighbor. A Extreme number is called Extreme Crossing if the following 2007
expression is called Extreme Crossing criteria 2008
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2009
S = (V, E) is a probability Eulerian-Path-Neighbor. Let m and n propose special Eulerian-Path-Neighbor. 2010
Then with m ≥ 4n, 2011
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Eulerian-Path-Neighbor 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: 2012
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2013
Theorem 10.0.7. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2014
S = (V, E) is a probability Eulerian-Path-Neighbor. Let P be a SuperHyperSet of n points in the plane, 2015
and let l be the Extreme number √ of SuperHyperLines in the plane passing through at least k + 1 2016
of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2017
Proof. Form a Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2018

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

Theorem 10.0.8. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2024
S = (V, E) is a probability Eulerian-Path-Neighbor. Let P be a SuperHyperSet of n points in the plane, 2025
and let k be the number of pairs of points of P at unit SuperHyperDistance. Then k < 5n4/3 . 2026
Proof. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2027
S = (V, E) is a probability Eulerian-Path-Neighbor. Draw a SuperHyperUnit SuperHyperCircle 2028
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2029
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2030
Now form a Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2031
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 2032

SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2033
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 2034

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2035
as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2036
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2037
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2038
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2039
Proposition 10.0.9. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2040
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let X be a nonnegative Extreme Variable 2041
and t a positive real number. Then 2042
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. 2043
Corollary 10.0.10. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2044
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let Xn be a nonnegative integer-valued 2045
variable in a probability Eulerian-Path-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 2046
P (Xn = 0) → 1 as n → ∞. 2047
Proof. 2048
Theorem 10.0.11. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2049
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. A special SuperHyperGraph in Gn,p 2050
almost surely has stability number at most d2p−1 log ne. 2051

S = (V, E) is a probability Eulerian-Path-Neighbor. A special SuperHyperGraph in Gn,p is up. 2053
Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where 2054
k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2055
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2056
SuperHyperEdge of the Extreme SuperHyperGraph G. 2057
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2058
Extreme Variable for this Extreme Event. By equation, we have 2059
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 2060
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2061
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: 2062
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2063
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 2064
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2065
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 2066
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2067
Definition 10.0.12. (Extreme Variance). 2068

is a probability Eulerian-Path-Neighbor. A Extreme k-Variable E has a number is called Extreme 2070
Variance if the following expression is called Extreme Variance criteria 2071
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let X be a Extreme Variable and let t 2073
be a positive real number. Then 2074
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Path-Neighbor. Let X be a Extreme Variable and let t be 2076
a positive real number. Then 2077
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2078
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let Xn be a Extreme Variable in a 2080

probability Eulerian-Path-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2081
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Path-Neighbor. Set X := Xn and t := |Ex(Xn )| in 2083
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2084
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2085
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2087
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2088
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2089
S = (V, E) is a probability Eulerian-Path-Neighbor. As in the proof of related Theorem, the result is 2091
straightforward. 2092
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be as 2094
defined in previous Theorem. Then either: 2095
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2096
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2097
S = (V, E) is a probability Eulerian-Path-Neighbor. The latter is straightforward. 2099
Definition 10.0.17. (Extreme Threshold). 2100
is a probability Eulerian-Path-Neighbor. Let P be a monotone property of SuperHyperGraphs (one 2102
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2103
a function f (n) such that: 2104
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2105
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2106

Definition 10.0.18. (Extreme Balanced). 2107

probability Eulerian-Path-Neighbor. Let F be a fixed Extreme SuperHyperGraph. Then there is a 2109
threshold function for the property of containing a copy of F as a Extreme SubSuperHyperGraph 2110
is called Extreme Balanced. 2111
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let F be a nonempty balanced Extreme 2113
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2114
threshold function for the property of containing F as a Extreme SubSuperHyperGraph. 2115
136EXM1 Example 10.0.20. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 2118
mentioned Extreme Figures in every Extreme items. 2119
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEulerian- 2120
Path-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are 2121
some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2122
E4 is a Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2123
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2124
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 2125
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2126
SuperHyperEulerian-Path-Neighbor. 2127
C(N SHG)Extreme Eulerian-Path-Neighbor

= {E4 }.
C(N SHG)Extreme Eulerian-Path-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Eulerian-Path-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Eulerian-Path-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .
2128
Path-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 2130
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the 2131
terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, 2132
E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2133
SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHyperVertex, 2134
V3 , is excluded in every given Extreme SuperHyperEulerian-Path-Neighbor. 2135

= {E4 }.

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Path-Neighbor in the Extreme Example (42.0.3) 136NSHG1

= z3.
= {V1 , V2 , V4 }.
= z 5 + 2z 3 + z.
2136
Path-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. 2138

= {E4 }.
= z3.
= {V1 , V2 , V3 }.
= z8 + z4 + z3.
2139



= {E1 }.
= z3.
= {V3 }.
= z2.
2142

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

= 0z 0 .
2145

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

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

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

= 0z 0 .
2154

= {}.
= 0z 0 .
= {}.
= 0z 0 .
2157
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2158

SuperHyperEulerian-Path-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2159
forward. 2160


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

forward. 2164

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

= 0z 0 .
2165

forward. 2168

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

forward. 2172

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

forward. 2176

= {E1 , E2 }.
= 2z 2 .


= {V1 }.
= z5.
2177

forward. 2180

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


forward. 2184

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



forward. 2188

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

forward. 2192

= {}.


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

forward. 2196

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

= 0z 0 .
2197

forward. 2200

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

forward. 2204

= {E1 , E2 }.
= z 10 + z 2 .
= {V2 ({R}, {M6 }, {L6 }, {F }, {P }, {J}, {M }), V1 , V3 }.
= z 5 + 2z 3 + 7z.
2205

forward. 2208

= {}.

SuperHyperEulerian-Path-Neighbor in the Extreme Example (42.0.3) 95NHG1
= 0z 0 .
= {}.
= 0z 0 .
2209
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2210
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Path-Neighbor if for 2211
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2212
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2213
all minus all Extreme SuperHypeNeighbors to any amount of them. 2214
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2215
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2216

SuperHyperEulerian-Path-Neighbor in the Extreme Example (42.0.3) 95NHG2
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2217
quasi-R-Eulerian-Path-Neighbor minus all Extreme SuperHypeNeighbor to some of them but not all of 2218
them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2219
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Path-Neighbor, minus 2220
all Extreme SuperHypeNeighbor to some of them but not all of them. 2221
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If a

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Path-Neighbor is at least 2222
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2223
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2224
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2225
SuperHyperVertices are renamed to Extreme Eulerian-Path-Neighbor in some cases but the maximum 2226
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2227
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in a Extreme R-Eulerian- 2228
Path-Neighbor. 2229
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Eulerian-Path-Neighbor 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 a Extreme type-result-R-Eulerian-Path-Neighbor with the least Extreme cardinality, the lower 2230
sharp Extreme bound for cardinality. 2231
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2232
Then in the worst case, literally, 2233
C(N SHG)ExtremeQuasi−Eulerian−P ath−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−P ath−N eighborSuperHyperP olynomial = z 5 .
Is a Extreme type-result-Eulerian-Path-Neighbor. In other words, the least cardinality, the lower sharp 2234
bound for the cardinality, of a Extreme type-result-Eulerian-Path-Neighbor is the cardinality of 2235

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−P ath−N eighborSuperHyperP 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-Eulerian-Path-Neighbor 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 a 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-Eulerian-Path-Neighbor. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor. 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-Eulerian-Path-Neighbor decorates the Extreme SuperHyper-
Vertices don’t have received any Extreme connections so as this Extreme style implies different
versions of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of
Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum
Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex
in the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore,
the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about
the Extreme R-Eulerian-Path-Neighbor. 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 adject-
ive 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 a Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge
thus there’s at least a Extreme R-Eulerian-Path-Neighbor has the Extreme cardinality of a Extreme
SuperHyperEdge. Thus, a Extreme R-Eulerian-Path-Neighbor has the Extreme cardinality at least
a Extreme SuperHyperEdge. Assume a Extreme SuperHyperSet V \ V \ {z}. This Extreme
SuperHyperSet isn’t a Extreme R-Eulerian-Path-Neighbor 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 a Extreme contradiction with
the term “Extreme R-Eulerian-Path-Neighbor” 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-Eulerian-Path-Neighbor 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 a
Extreme SuperHyperClass of a Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes a 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 a Extreme R-Eulerian-Path-Neighbor 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 a 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 a Extreme R-Eulerian-Path-Neighbor. Those Extreme SuperHyperVertices
are potentially included in a Extreme style-R-Eulerian-Path-Neighbor. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of a 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-Eulerian-Path-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor. 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, 2236
Extreme R-Eulerian-Path-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2237
Extreme R-Eulerian-Path-Neighbor =
Thus E ∈ EESHG:(V,E) is a Extreme quasi-R-Eulerian-Path-Neighbor where E ∈ EESHG:(V,E) is

fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in
a Extreme Eulerian-Path-Neighbor, 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 a Extreme
SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Path-Neighbor is at least 2238
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2239
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2240
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2241
SuperHyperVertices are renamed to Extreme Eulerian-Path-Neighbor in some cases but the maximum 2242
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2243
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in a Extreme R-Eulerian- 2244
Path-Neighbor. 2245
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2246
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2247
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2248
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2249
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2250
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2251
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2252
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2253
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2254
Thus it forms a Extreme quasi-R-Eulerian-Path-Neighbor where the Extreme completion of the 2255
Extreme incidence is up in that. Thus it’s, literarily, a Extreme embedded R-Eulerian-Path- 2256
Neighbor. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. 2257

In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2258
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2259
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2260
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2261
Extreme style of the embedded Extreme R-Eulerian-Path-Neighbor. The interior types of the Extreme 2262
SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors are only 2263

affected by the interior Extreme SuperHyperVertices. The common connections, more precise 2264
and more formal, the perfect unique connections inside the Extreme SuperHyperSet for any 2265
distinct types of Extreme SuperHyperVertices pose the Extreme R-Eulerian-Path-Neighbor. Thus 2266
Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge and 2267
in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that Extreme 2268
SuperHyperEdge. In the embedded Extreme Eulerian-Path-Neighbor, there’s the usage of exterior 2269
Extreme SuperHyperVertices since they’ve more connections inside more than outside. Thus the 2270
title “exterior” is more relevant than the title “interior”. One Extreme SuperHyperVertex has no 2271
connection, inside. Thus, the Extreme SuperHyperSet of the Extreme SuperHyperVertices with 2272
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 2273
the Extreme R-Eulerian-Path-Neighbor. The Extreme R-Eulerian-Path-Neighbor with the exclusion of the 2274
exclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other 2275
terms, the Extreme R-Eulerian-Path-Neighbor with the inclusion of all Extreme SuperHyperVertices 2276
in one Extreme SuperHyperEdge, is a Extreme quasi-R-Eulerian-Path-Neighbor. To sum them up, 2277
in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2278
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2279
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Eulerian-Path-Neighbor 2280
minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 2281
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2282
Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Path-Neighbor, minus all Extreme 2283
SuperHypeNeighbor to some of them but not all of them. 2284
The main definition of the Extreme R-Eulerian-Path-Neighbor has two titles. a Extreme quasi-R- 2285
Eulerian-Path-Neighbor and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are 2286
two titles in the terms of quasi-R-styles. For any Extreme number, there’s a Extreme quasi-R- 2287
Eulerian-Path-Neighbor with that quasi-maximum Extreme SuperHyperCardinality in the terms of the 2288
embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then 2289
the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi- 2290
R-Eulerian-Path-Neighbors for all Extreme numbers less than its Extreme corresponded maximum 2291
number. The essence of the Extreme Eulerian-Path-Neighbor ends up but this essence starts up in the 2292
terms of the Extreme quasi-R-Eulerian-Path-Neighbor, again and more in the operations of collecting 2293
all the Extreme quasi-R-Eulerian-Path-Neighbors acted on the all possible used formations of the 2294
Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2295
considered as the equivalence class for all corresponded quasi-R-Eulerian-Path-Neighbors. Let 2296
zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Path-Neighbor be a Extreme number, 2297
a Extreme SuperHyperSet and a Extreme Eulerian-Path-Neighbor. Then 2298
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Path-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Path-Neighbor is re-formalized and 2299
redefined as follows. 2300
GExtreme Eulerian-Path-Neighbor ∈ ∪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 2301
definition for the Extreme Eulerian-Path-Neighbor. 2302
GExtreme Eulerian-Path-Neighbor =
{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 Eulerian-Path- 2303
poses the upcoming expressions.
Neighbor 2304
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2305
= max zExtreme Number

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

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



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

2309

2310

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2311
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2312
that any amount of its Extreme SuperHyperVertices are incident to a Extreme SuperHyperEdge. 2313
It’s, literarily, another name for “Extreme Quasi-Eulerian-Path-Neighbor” but, precisely, it’s the 2314
generalization of “Extreme Quasi-Eulerian-Path-Neighbor” since “Extreme Quasi-Eulerian-Path-Neighbor” 2315
happens “Extreme Eulerian-Path-Neighbor” in a Extreme SuperHyperGraph as initial framework and 2316
background but “Extreme SuperHyperNeighborhood” may not happens “Extreme Eulerian-Path- 2317
Neighbor” in a Extreme SuperHyperGraph as initial framework and preliminarily background 2318

since there are some ambiguities about the Extreme SuperHyperCardinality arise from it. To 2319
get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Eulerian- 2320
Path-Neighbor”, and “Extreme Eulerian-Path-Neighbor” are up. 2321
Thus, let 2322
zExtreme Number , NExtreme SuperHyperNeighborhood and 2323
GExtreme Eulerian-Path-Neighbor be a Extreme number, a Extreme SuperHyperNeighborhood and a 2324

Extreme Eulerian-Path-Neighbor and the new terms are up. 2325
GExtreme Eulerian-Path-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2326
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2327
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2328
And with go back to initial structure, 2329
GExtreme Eulerian-Path-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


2330

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

2331

2332

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

SuperHyperSet of the Extreme SuperHyperVertices,

Is an Extreme R-Eulerian-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph

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

rHyperVertices such that there’s no a Extreme SuperHyperEdge amid some Extreme SuperHy-
perVertices instead of all given by
Extreme Eulerian-Path-Neighbor is related to the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Eulerian-Path-Neighbor is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Eulerian-Path-Neighbor is a 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-Eulerian-Path-Neighbor is up. To sum them up, the
Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Path-Neighbor.

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

rHyperVertices such that there’s no a Extreme SuperHyperEdge for some amount Extreme
SuperHyperVertices instead of all given by that Extreme type-SuperHyperSet called the
Extreme Eulerian-Path-Neighbor. There isn’t only less than two Extreme SuperHyperVertices inside
the intended Extreme SuperHyperSet,

Thus the non-obvious Extreme R-Eulerian-Path-Neighbor,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian-Path-Neighbor,

not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2333
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2334
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2335
the 2336
“Extreme R-Eulerian-Path-Neighbor” 2337
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2338
Extreme R-Eulerian-Path-Neighbor, 2339
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyperMod-

eling. It’s also, not only a Extreme free-triangle embedded SuperHyperModel and a Extreme
on-triangle embedded SuperHyperModel but also it’s a Extreme stable embedded SuperHy-
perModel. But all only non-obvious simple Extreme type-SuperHyperSets of the Extreme
R-Eulerian-Path-Neighbor amid those obvious simple Extreme type-SuperHyperSets of the Extreme
Eulerian-Path-Neighbor, 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 a Extreme R-Eulerian-Path-Neighbor. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a Extreme R-Eulerian-Path-Neighbor is the cardinality of
2340
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2341
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Path-Neighbor if for any of 2342

them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2343
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2344
all minus all Extreme SuperHypeNeighbors to any amount of them. 2345
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let a Extreme SuperHy- 2346
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2347
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2348
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2349
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s a Extreme 2350
R-Eulerian-Path-Neighbor with the least cardinality, the lower sharp Extreme bound for Extreme 2351
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2352
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is a Extreme SuperHyperSet 2353
S of the Extreme SuperHyperVertices such that there’s a Extreme SuperHyperEdge to have 2354
some Extreme SuperHyperVertices uniquely but it isn’t a Extreme R-Eulerian-Path-Neighbor. Since 2355
it doesn’t have 2356
2357
the maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme Supe- 2358
rHyperVertices such that there’s a Extreme SuperHyperEdge to have some SuperHyperVertices 2359
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2360
maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme SuperHyperVertices 2361

but it isn’t a Extreme R-Eulerian-Path-Neighbor. Since it doesn’t do the Extreme procedure such 2362
that such that there’s a Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2363
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2364
in the connected Extreme SuperHyperGraph ESHG : (V, E), a Extreme SuperHyperVertex, 2365
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2366
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2367
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2368
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Eulerian-Path-Neighbor, VESHE 2369
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Path-Neighbor, 2370
VESHE , is a Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2371
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connec- 2372
ted Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the 2373
Extreme SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality 2374
of a Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s a Extreme 2375
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2376
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Eulerian-Path-Neighbor only contains 2377
all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2378
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2379
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2380
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2381
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2382
The SuperHyperNotion, namely, Eulerian-Path-Neighbor, is up. There’s neither empty SuperHy- 2383
perEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2384
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2385
Path-Neighbor. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2386

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Eulerian−P ath−N eighborSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Eulerian−P ath−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Eulerian−P ath−N eighborSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Eulerian-Path-Neighbor. The Extreme 2387
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2388

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph ESHG : 2389

(V, E) is a Extreme type-SuperHyperSet with 2390
2391
rHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of a 2393

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2394
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2395
Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Path-Neighbor is up. The obvious 2396
simple Extreme type-SuperHyperSet called the Extreme Eulerian-Path-Neighbor is a Extreme Super- 2397
HyperSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet 2398
of the Extreme SuperHyperEdges[SuperHyperVertices], 2399

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- 2400
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2401

Path-Neighbor is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2402
perEdges[SuperHyperVertices], 2403

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 Eulerian-Path-Neighbor. Since 2404
the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2405

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2406
is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no a 2407

Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme type- 2408
SuperHyperSet called the Extreme Eulerian-Path-Neighbor and it’s an Extreme Eulerian-Path-Neighbor. 2409
Since it’s 2410
2411
rHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of a 2413

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2414
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2415
intended Extreme SuperHyperSet, 2416

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

= az s + bz t .
Thus the non-obvious Extreme Eulerian-Path-Neighbor , 2417

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme , not:

Eulerian-Path-Neighbor 2418

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

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 2420
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2421
SuperHyperSet called the 2422
“Extreme Eulerian-Path-Neighbor ” 2423
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2424
Extreme Eulerian-Path-Neighbor , 2425

is only and only 2426

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

CHAPTER 11 2428
The Extreme Departures on The 2429
Theoretical Results Toward Theoretical 2430
Motivations 2431
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2432
SuperHyperClasses. 2433
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2434

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2435
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2436
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
115
Figure 11.1: a Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Path-Neighbor in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2437
new way to redefine as 2438
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 2439
ViEXT ERN AL in the literatures of SuperHyperEulerian-Path-Neighbor. The latter is straightforward. 2440
2441
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2442
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2443
(31.1), is the SuperHyperEulerian-Path-Neighbor. 2444
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2445

= {}.
= 0z 0 .

= {}.
= 0z 0 .
Proof. Let 2446
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2447
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 2448

2452
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2453
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2454
SuperHyperModel (31.2), is the Extreme SuperHyperEulerian-Path-Neighbor. 2455
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2456

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

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

SuperHyperEulerian-Path-Neighbor in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2457
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2458
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 2459
way to redefine as 2460

2463

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

SuperHyperEulerian-Path-Neighbor in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2464
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2465
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2466
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2467
Path-Neighbor. 2468
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2469

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2470
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
2471
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 2472
a new way to redefine as 2473

Then there’s no at least one SuperHyperEulerian-Path-Neighbor. Thus the notion of quasi may be up 2476
but the SuperHyperNotions based on SuperHyperEulerian-Path-Neighbor could be applied. There 2477
are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 2478
as the representative in the 2479
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Path-Neighbor taken from a connected Extreme SuperHyperBipartite 2480
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2481
SuperHyperPart SuperHyperEdges are attained in any solution 2482
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2483
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2484
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2485
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2486
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2487
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Path-Neighbor. 2488

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

Extreme SuperHyperEulerian-Path-Neighbor in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2489
Then 2490

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2491
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2492
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Path-Neighbor taken from a connected Extreme SuperHyperMulti- 2493

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

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2502
SuperHyperEdges are attained in any solution 2503
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2504
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2506
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2507
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2508
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2509
the Extreme SuperHyperEulerian-Path-Neighbor. 2510
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2511

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

= {}.
= 0z 0 .
= {CEN T ER}.
X
= z |Vi ∈VN SHG | .
Proof. Let 2512
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2513
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Path-Neighbor taken from a connected Extreme SuperHyperWheel 2514

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

Extreme SuperHyperEulerian-Path-Neighbor in the Extreme Example (42.0.15) 136NSHG23a
ESHW : (V, E). There’s a new way to redefine as 2515

Then there’s at least one SuperHyperEulerian-Path-Neighbor. Thus the notion of quasi isn’t up and 2518
the SuperHyperNotions based on SuperHyperEulerian-Path-Neighbor could be applied. The unique 2519
embedded SuperHyperEulerian-Path-Neighbor proposes some longest SuperHyperEulerian-Path-Neighbor 2520
excerpt from some representatives. The latter is straightforward. 2521
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2522
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2523
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2524
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2525
Extreme SuperHyperEulerian-Path-Neighbor. 2526

CHAPTER 12 2527
The Surveys of Mathematical Sets On 2528
The Results But As The Initial Motivation 2529
For the SuperHyperEulerian-Path-Neighbor, Extreme SuperHyperEulerian-Path-Neighbor, and the Extreme 2530

SuperHyperEulerian-Path-Neighbor, some general results are introduced. 2531
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Path-Neighbor is “redefined” on 2532
the positions of the alphabets. 2533
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Path-Neighbor. Then 2534
Extreme SuperHyperEulerian − P ath − N eighbor =

{theSuperHyperEulerian − P ath − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − P ath − N eighbor
|ExtremecardinalityamidthoseSuperHyperEulerian−P ath−N eighbor. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2535
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2536
and the neutrality, for i = 1, 2, 3, respectively. 2537
Corollary 12.0.3. Assume a Extreme SuperHyperGraph on the same identical letter of the 2538
alphabet. Then the notion of Extreme SuperHyperEulerian-Path-Neighbor and SuperHyperEulerian-Path- 2539
Neighbor coincide. 2540
Corollary 12.0.4. Assume a Extreme SuperHyperGraph on the same identical letter of 2541
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Extreme 2542
SuperHyperEulerian-Path-Neighbor if and only if it’s a SuperHyperEulerian-Path-Neighbor. 2543
Corollary 12.0.5. Assume a Extreme SuperHyperGraph on the same identical letter of 2544
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2545
SuperHyperEulerian-Path-Neighbor if and only if it’s a longest SuperHyperEulerian-Path-Neighbor. 2546
Corollary 12.0.6. Assume SuperHyperClasses of a Extreme SuperHyperGraph on the same 2547
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Path-Neighbor is its 2548
SuperHyperEulerian-Path-Neighbor and reversely. 2549
125
Corollary 12.0.7. Assume a Extreme SuperHyperPath(-/SuperHyperEulerian-Path-Neighbor, SuperHy- 2550

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 2551
letter of the alphabet. Then its Extreme SuperHyperEulerian-Path-Neighbor is its SuperHyperEulerian- 2552
Path-Neighbor and reversely. 2553
Corollary 12.0.8. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2554
isn’t well-defined if and only if its SuperHyperEulerian-Path-Neighbor isn’t well-defined.
Path-Neighbor 2555
Corollary 12.0.9. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its Extreme 2556
SuperHyperEulerian-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Path-Neighbor isn’t 2557

well-defined. 2558
Corollary 12.0.10. Assume a Extreme SuperHyperPath(-/SuperHyperEulerian-Path-Neighbor, Super- 2559

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2560
SuperHyperEulerian-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Path-Neighbor 2561
isn’t well-defined. 2562
Corollary 12.0.11. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2563
is well-defined if and only if its SuperHyperEulerian-Path-Neighbor is well-defined.
Path-Neighbor 2564
Corollary 12.0.12. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its 2565

Extreme SuperHyperEulerian-Path-Neighbor is well-defined if and only if its SuperHyperEulerian-Path- 2566
Neighbor is well-defined. 2567
Corollary 12.0.13. Assume a Extreme SuperHyperPath(-/SuperHyperEulerian-Path-Neighbor, Super- 2568

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2569
SuperHyperEulerian-Path-Neighbor is well-defined if and only if its SuperHyperEulerian-Path-Neighbor is 2570
well-defined. 2571
Proposition 12.0.14. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then V is 2572
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2573
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2574
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2575
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2576
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2577
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2578
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be a Extreme SuperHyperGraph. Then ∅ is 2579
(i) : the SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2580
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2581
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2582
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2583
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2584

(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2585
Proposition 12.0.16. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then an independent 2586
SuperHyperSet is 2587
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2590
Proposition 12.0.17. Let ESHG : (V, E) be a Extreme SuperHyperUniform SuperHyperGraph 2594

which is a SuperHyperEulerian-Path-Neighbor/SuperHyperPath. Then V is a maximal 2595
(i) : SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2596
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2597
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2598
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2599
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2600
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2601
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2602
Proposition 12.0.18. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is a 2603

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2604
(i) : dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2605
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2606
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2607
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2608
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2609
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2610

which is a SuperHyperEulerian-Path-Neighbor/SuperHyperPath. Then the number of 2613
(i) : the SuperHyperEulerian-Path-Neighbor; 2614

(ii) : the SuperHyperEulerian-Path-Neighbor; 2615
(iii) : the connected SuperHyperEulerian-Path-Neighbor; 2616
(iv) : the O(ESHG)-SuperHyperEulerian-Path-Neighbor; 2617
(v) : the strong O(ESHG)-SuperHyperEulerian-Path-Neighbor; 2618
(vi) : the connected O(ESHG)-SuperHyperEulerian-Path-Neighbor. 2619
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2620
coincide. 2621

which is a SuperHyperWheel. Then the number of 2623
(i) : the dual SuperHyperEulerian-Path-Neighbor; 2624
(ii) : the dual SuperHyperEulerian-Path-Neighbor; 2625
(iii) : the dual connected SuperHyperEulerian-Path-Neighbor; 2626
(iv) : the dual O(ESHG)-SuperHyperEulerian-Path-Neighbor; 2627
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Path-Neighbor; 2628
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Path-Neighbor. 2629
coincide. 2631
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2633

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2634
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2635
is a 2636
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2640
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2641
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2642

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2645
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2646
SuperHyperPart is a 2647

(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2651
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2652
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2653

SuperHyperMultipartite. Then Then the number of 2656
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2663
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2664
Proposition 12.0.24. Let ESHG : (V, E) be a Extreme SuperHyperGraph. The number of 2666
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2667
(iv) : SuperHyperEulerian-Path-Neighbor; 2671
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2672
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2673
Proposition 12.0.25. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then the number is 2674
at most O(ESHG) and the Extreme number is at most On (ESHG). 2675
Proposition 12.0.26. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Su- 2676
perHyperComplete. The number is O(ESHG:(V,E))2 + 1 and the Extreme number is 2677

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

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2682
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2684
Proposition 12.0.27. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is ∅. The 2685
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2686
dual 2687
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2691
Proposition 12.0.28. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHy- 2694
perComplete. Then there’s no independent SuperHyperSet. 2695
Proposition 12.0.29. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is 2696

SuperHyperEulerian-Path-Neighbor/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2697
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2698
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2702
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2703
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2704
Proposition 12.0.30. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Super- 2705
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2706
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2707
t>
2
setting of a dual 2708



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2715
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2716
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2717
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2718
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2719
SuperHyperDefensive SuperHyperEulerian-Path-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 2720
(i) v ∈ Ns (x); 2721
(ii) vx ∈ E. 2722
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2723
SuperHyperDefensive SuperHyperEulerian-Path-Neighbor, then 2724
(i) S is SuperHyperEulerian-Path-Neighbor set; 2725
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2726
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2727
(i) Γ ≤ O; 2728
(ii) Γs ≤ On . 2729
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2730
connected. Then 2731
(i) Γ ≤ O − 1; 2732
(ii) Γs ≤ On − Σ3i=1 σi (x). 2733
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2734
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2735

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

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2741
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2742
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2743
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2744
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2745
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Path-Neighbor. Then 2747
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 2748

Path-Neighbor; 2749
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2750
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2751
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2752
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Path-Neighbor. Then 2754

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2758
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2759
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2761
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Path-Neighbor; 2762
(ii) Γ = 1; 2763
(iii) Γs = Σ3i=1 σi (c); 2764
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Path-Neighbor. 2765
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2766
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2767
SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 2768
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2769
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2770
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2771
SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 2772
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2773
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperEulerian-Path- 2774
Neighbor; 2775
(ii) Γ = b n2 c + 1; 2776
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 2777
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2778
Path-Neighbor. 2779
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2780
bnc
2
Neighbor; 2782
(ii) Γ = b n2 c; 2783
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 2784
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 2785
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2787

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

Path-Neighbor for N SHF; 2790
(ii) Γ = m for N SHF : (V, E); 2791
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2792
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Path- 2793
Neighbor for N SHF : (V, E). 2794
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2795
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2796
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2797
SuperHyperEulerian-Path-Neighbor for N SHF; 2798
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2799

2
for N SHF : (V, E); 2800
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperEulerian-Path-Neighbor 2801
for N SHF : (V, E). 2802
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2803

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2804
bnc
2
Neighbor for N SHF : (V, E); 2806
(ii) Γ = b n2 c for N SHF : (V, E); 2807
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 2808
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Path-Neighbor for 2809
N SHF : (V, E). 2810
following statements hold; 2812
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2813

SuperHyperEulerian-Path-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian-Path- 2814
Neighbor; 2815
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2816

SuperHyperEulerian-Path-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 2817
Path-Neighbor. 2818
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2821

SuperHyperEulerian-Path-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian-Path- 2822
Neighbor; 2823
SuperHyperEulerian-Path-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 2825

Path-Neighbor. 2826
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2827

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

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

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

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

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


SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2848
(i) ∀a ∈ S, |Ns (a) ∩ S| b O−1 2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2851
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 2853
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual (O − 1)-SuperHyperDefensive 2855


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

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

SuperHyperGraph which is SuperHyperEulerian-Path-Neighbor. Then following statements hold; 2868
(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 2869
Path-Neighbor; 2870

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

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

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


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

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

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

CHAPTER 13 2887
Extreme Applications in Cancer’s 2888
Extreme Recognition 2889
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2890
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2891
as the consequences of the model, some parameters are used. The cells are under attack of this 2892
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2893
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2894
In the following, some Extreme steps are Extreme devised on this disease. 2895
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2896
function. 2897
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2898
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2899
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 2900
since there are some determinacy, indeterminacy and neutrality about the moves and the 2901
effects of the cancer on that region; this event leads us to choose another model [it’s said 2902
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2903
what’s done. 2904
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known 2905
and they’ve got the names, and some general Extreme models. The moves and the 2906
Extreme traces of the cancer on the complex tracks and between complicated groups of 2907
cells could be fantasized by a Extreme SuperHyperPath(-/SuperHyperEulerian-Path-Neighbor, 2908
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 2909
The aim is to find either the Extreme SuperHyperEulerian-Path-Neighbor or the Extreme 2910
SuperHyperEulerian-Path-Neighbor in those Extreme Extreme SuperHyperModels. 2911
137
CHAPTER 14 2912
Case 1: The Initial Extreme Steps 2913
Toward Extreme SuperHyperBipartite 2914
as Extreme SuperHyperModel 2915
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2916
is Extreme highlighted and Extreme featured. 2917
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 2918
partite is obtained. 2919
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2920
Figure 14.1: a Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Path-Neighbor 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 2924
Case 2: The Increasing Extreme Steps 2925
Toward Extreme 2926
SuperHyperMultipartite as Extreme 2927
SuperHyperModel 2928
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2929
ite is Extreme highlighted and Extreme featured. 2930
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2931
partite is obtained. 2932
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 2933
Figure 15.1: a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

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

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

CHAPTER 16 2937
Wondering Open Problems But As The 2938
Directions To Forming The Motivations 2939
In what follows, some “problems” and some “questions” are proposed. 2940
The SuperHyperEulerian-Path-Neighbor and the Extreme SuperHyperEulerian-Path-Neighbor are defined 2941
on a real-world application, titled “Cancer’s Recognitions”. 2942
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2943
recognitions? 2944
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Path-Neighbor 2945

and the Extreme SuperHyperEulerian-Path-Neighbor? 2946
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2947
them? 2948
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 2949
and the Extreme SuperHyperEulerian-Path-Neighbor?
Path-Neighbor 2950
Problem 16.0.5. The SuperHyperEulerian-Path-Neighbor and the Extreme SuperHyperEulerian- 2951

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
Path-Neighbor 2952
SuperHyperEulerian-Path-Neighbor, are there else? 2953
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2954
Numbers types-results? 2955
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2956
the multiple types of SuperHyperNotions? 2957
143
CHAPTER 17 2958
Conclusion and Closing Remarks 2959
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2960
research are illustrated. Some benefits and some advantages of this research are highlighted. 2961
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2962
In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Path-Neighbor. 2963
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph 2964
is redefined on the position of the alphabets. Based on the new definition for the Extreme 2965
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperEulerian-Path-Neighbor, finds 2966
the convenient background to implement some results based on that. Some SuperHyperClasses 2967
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the regions 2968
where are under the attacks of the cancer to recognize this disease as it’s mentioned on the title 2969
“Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, SuperHyperEulerian- 2970
Path-Neighbor, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general 2971
results are gathered in the section on the SuperHyperEulerian-Path-Neighbor and the Extreme 2972
SuperHyperEulerian-Path-Neighbor. The clarifications, instances and literature reviews have taken 2973
the whole way through. In this research, the literature reviews have fulfilled the lines containing 2974
the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph are the 2975
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 2976
based on the connectivities of the moves of the cancer in the longest and strongest styles with the 2979
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 2982
benefits and avenues for this research are, figured out, pointed out and spoken out. 2983
145
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Path-Neighbor
3. Extreme SuperHyperEulerian-Path-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 2984
Extreme SuperHyperDuality But As The 2985
Super Forms 2987
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2988

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

Va ∈ Ei , Ej ; 2992
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2993
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2994
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2995
Vi , Vj ∈ Ea ; 2996
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2997
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2998
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2999
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3000

SuperHyperDuality. 3001
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3002

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3007
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3008
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3009
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3010
Extreme SuperHyperDuality; 3011
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3012

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3013
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3014
Extreme cardinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet 3015
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3017
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3018

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3019
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3020
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3021
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3022
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3023
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3024
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3025
coefficient; 3026
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3027

and Extreme rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 3029
SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3032
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3034
coefficient; 3035
(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3036

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3038
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3040
Extreme SuperHyperDuality; 3042
(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3043

SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3045
is the maximum Extreme cardinality of the Extreme SuperHyperVertices of a Extreme Su- 3046
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3047
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3048
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3049

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3050
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3051
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3052
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3053
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3054

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3055

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 3056
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3058

and Extreme rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 3060
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality 3063
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3065
to its Extreme coefficient. 3066
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3069
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3070
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is a 3071
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3072
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3073
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 3074
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.
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 3078
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in 3079
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 3080
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 3081
no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHy- 3082
perVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3083


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

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 3127
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. 3131
(31.1), is the SuperHyperDuality. 3134
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 3136
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3153
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 3155
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 3158
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3159
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3160
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3161
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3162
representative in the 3163
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 : 3164

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3176

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3180
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3181
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. 3193
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 3195
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 : 3196

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

∃!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 3201
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3202
Extreme SuperHyperDuality. 3208

CHAPTER 19 3209
Extreme SuperHyperJoin But As The 3210
Super Forms 3212
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3213

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

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

6 Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3219
|Ej |NEUTROSOPIC CARDINALITY ; 3220
(iii) Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3221

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3224
|Vj |NEUTROSOPIC CARDINALITY ; 3225
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3226
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3227
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3228

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3232
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3233
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3234
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3235
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3236
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3237

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3239
cardinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet S of 3240
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3241
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3242
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3243

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3244
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3245
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3246
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3247
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3248
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3250
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3251

rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is 3253
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3254
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3255
of a Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3256
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3259

cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 3262

SuperHyperJoin; 3265
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3266

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3268
cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of 3269
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3270
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3271
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3272
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3273

is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3275
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3276
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3277

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

rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is 3282
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3283
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3284
of a Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3285
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3287
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3290
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3291

SuperHyperJoin. 3297
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 3299
empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the terms 3300
of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3301
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3302
V3 , is excluded in every given Extreme SuperHyperJoin. 3304

is up. The Extreme Algorithm is Extremely straightforward. 3306


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3427
Extreme SuperHyperPerfect But As The 3428
Super Forms 3430
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3431

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3443
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3444

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3448
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3449
Extreme SuperHyperPerfect; 3453
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3454

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3461
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3462
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3467
coefficient; 3468
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3469

and Extreme rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 3471
SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3474
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3476
coefficient; 3477
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3478

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

SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3487
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3490
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3491

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


tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 3498
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3500

and Extreme rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 3502
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality 3505
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3507
to its Extreme coefficient. 3508
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3511
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3512
SuperHyperPerfect. 3518
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.
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 3520
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in 3521
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 3522
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 3523
no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHy- 3524
perVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3525


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

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

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

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

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



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

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

Then 3616

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



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

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

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


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

CHAPTER 21 3651
Extreme SuperHyperTotal But As The 3652
Super Forms 3654
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3655
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3658
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3659

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

(v) Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3664

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3665
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3666

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3670
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3672
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3673
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3674
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3675

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

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3680
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3681

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3682
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3683
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3684
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3685
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3686
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3687
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3688
cient; 3689
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3690

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3691
treme rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph N SHG : 3692
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3693
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3694
perEdges of a Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3695

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3696
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3697
cient; 3698
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3699

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3701
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3703
SuperHyperTotal; 3705
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3706

Extreme cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S 3709
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3710
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3711
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3712

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3713
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3714
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3717
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3718
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3719
Extreme coefficient; 3720

(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3721

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3722
treme rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph N SHG : 3723
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3724
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVer- 3725
tices of a Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3726
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3728
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3731
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3732

SuperHyperTotal. 3738
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 3740
empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the terms 3741
of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3742
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3743
V3 , is excluded in every given Extreme SuperHyperTotal. 3745



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3793
(31.1), is the SuperHyperTotal. 3796
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 3798
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. 3805
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 3807
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3869
Extreme SuperHyperConnected But As 3870
The Extensions Excerpt From Dense And 3871
Super Forms 3872
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3873

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

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

(iii) Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3881

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

(v) Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3886

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3887
SuperHyperConnected. 3888
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3889
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3892

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

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3901
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of a Extreme 3902
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3903
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3904
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3905

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3906
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3907
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3908
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3909
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3910
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3911
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3912
power is corresponded to its Extreme coefficient; 3913
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3914

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for a 3916

cardinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet S of high 3919
(v) an Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected,3923

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3925
Extreme SuperHyperConnected; 3929
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3930

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3932
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3935
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 3936

of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3937
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3938

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

contains the Extreme coefficients defined as the Extreme number of the maximum 3940
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3941
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 3943
Extreme power is corresponded to its Extreme coefficient; 3944
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3945

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for a 3947
cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of high 3950

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

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.
• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3964
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 3965
E3 are some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. 3966
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3967
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3968
there’s no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme 3969
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 3970


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

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

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 4014
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. 4018
(31.1), is the SuperHyperConnected. 4021
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 4023
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. 4030
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 4032



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4051

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4086
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4087
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4088
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4089
some representatives. The latter is straightforward. 4090
Extreme SuperHyperConnected. 4095

CHAPTER 23 4096
Background 4097
217











in Scribd. 4258



Bibliography 4293
10.33140/JMTCM.01.03.09) 4300
223
10.20944/preprints202301.0282.v1). 4328
10.20944/preprints202301.0267.v1). 4331

(doi: 10.20944/preprints202301.0265.v1). 4336
prints202301.0262.v1). 4340
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4346
prints202301.0105.v1). 4349
Preprints 2023, 2023010044 4355
10.20944/preprints202301.0043.v1). 4358

(doi: 10.20944/preprints202212.0549.v1). 4367
(doi: 10.20944/preprints202212.0500.v1). 4374
10.5281/zenodo.7824560). 4383
(doi: 10.5281/zenodo.7824623). 4386
2023, (doi: 10.5281/zenodo.7809365). 4397
2023, (doi: 10.5281/zenodo.7809358). 4400

10.5281/zenodo.7809219). 4403
10.5281/zenodo.7809328). 4406
2023, (doi: 10.5281/zenodo.7806767). 4409
2023, (doi: 10.5281/zenodo.7806838). 4412
(doi: 10.5281/zenodo.7799902). 4421
2023, (doi: 10.5281/zenodo.7804218). 4424
(doi: 10.5281/zenodo.7796334). 4427
10.5281/zenodo.7791952). 4433
(doi: 10.5281/zenodo.7791982). 4436
10.5281/zenodo.7790026). 4439

2023, (doi: 10.5281/zenodo.7790052). 4442
2023, (doi: 10.5281/zenodo.7787066). 4445
10.5281/zenodo.7781476). 4451
10.5281/zenodo.7783082). 4454
10.5281/zenodo.7777857). 4457
10.5281/zenodo.7779286). 4460
(doi: 10.5281/zenodo.7771831). 4463
2023, (doi: 10.5281/zenodo.7772468). 4466
10.13140/RG.2.2.20913.25446). 4469
10.5281/zenodo.7764916). 4472
10.13140/RG.2.2.11770.98247). 4475
10.13140/RG.2.2.12400.12808). 4478

2023, (doi: 10.13140/RG.2.2.22545.10089). 4481
10.13140/RG.2.2.11377.76644). 4487
10.13140/RG.2.2.23750.96329). 4490
10.13140/RG.2.2.31366.24641). 4493
10.13140/RG.2.2.34721.68960). 4496
10.13140/RG.2.2.24288.35842). 4505
10.13140/RG.2.2.32467.25124). 4508
10.13140/RG.2.2.31025.45925). 4511
10.13140/RG.2.2.17184.25602). 4514
10.13140/RG.2.2.23423.28327). 4517

10.13140/RG.2.2.28456.44805). 4520
10.13140/RG.2.2.23525.68320). 4523
10.13140/RG.2.2.20170.24000). 4526
10.13140/RG.2.2.36475.59683). 4529
10.13140/RG.2.2.29764.71046). 4532
2023, (doi: 10.13140/RG.2.2.18780.87683). 4535
10.13140/RG.2.2.26134.01603). 4541
10.13140/RG.2.2.27392.30721). 4544
10.13140/RG.2.2.33028.40321). 4547
10.13140/RG.2.2.21389.20966). 4550
10.13140/RG.2.2.16356.04489). 4553
10.13140/RG.2.2.21756.21129). 4556

10.13140/RG.2.2.30983.68009). 4559
10.13140/RG.2.2.28552.29445). 4562
10.13140/RG.2.2.35105.89447). 4568
(doi: 10.13140/RG.2.2.30072.72960). 4571
10.13140/RG.2.2.31147.52003). 4574
10.13140/RG.2.2.32825.24163). 4577
10.13140/RG.2.2.13059.58401). 4580
10.13140/RG.2.2.11172.14720). 4583
2023, (doi: 10.13140/RG.2.2.22011.80165). 4586
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4589
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4595

2023, (doi: 10.13140/RG.2.2.19944.14086). 4598
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4601
(doi: 10.13140/RG.2.2.33103.76968). 4604
2023, (doi: 10.13140/RG.2.2.23037.44003). 4607
(doi: 10.13140/RG.2.2.35646.56641). 4610
(doi: 10.13140/RG.2.2.18030.48967). 4613
(doi: 10.13140/RG.2.2.13973.81121). 4616
2023, (doi: 10.13140/RG.2.2.34106.47047). 4619
2023, (doi: 10.13140/RG.2.2.31956.88961). 4625
2023, (doi: 10.13140/RG.2.2.15179.67361). 4628
10.13140/RG.2.2.21510.45125). 4631
2023, (doi: 10.13140/RG.2.2.13121.84321). 4634

10.13140/RG.2.2.11758.69441). 4637
2023, (doi: 10.13140/RG.2.2.31891.35367). 4640
10.13140/RG.2.2.19360.87048). 4643
2023, (doi: 10.13140/RG.2.2.32363.21286). 4646
(doi: 10.13140/RG.2.2.23266.81602). 4649
10.13140/RG.2.2.19911.37285). 4652
10.13140/RG.2.2.11050.90569). 4655
(doi: 10.13140/RG.2.2.30182.50241). 4667

2023, (doi: 10.13140/RG.2.2.17252.24968). 4700
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 4709
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4712


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

10.20944/preprints202301.0282.v1). 4733
10.20944/preprints202301.0267.v1).). 4736
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 4741
prints202301.0262.v1). 4745
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4751


10.13140/RG.2.2.35061.65767). 4754
10.13140/RG.2.2.18494.15680). 4758

10.13140/RG.2.2.32530.73922). 4762
10.13140/RG.2.2.15897.70243). 4766
10.13140/RG.2.2.32530.73922). 4770
prints202301.0105.v1). 4773

10.13140/RG.2.2.23172.19849). 4780

10.13140/RG.2.2.17385.36968). 4790


(doi: 10.20944/preprints202301.0043.v1). 4796
2023, (doi: 10.13140/RG.2.2.28945.92007). 4799
10.13140/RG.2.2.35774.77123). 4805

10.13140/RG.2.2.29430.88642). 4811
(doi: 10.20944/preprints202212.0549.v1). 4817

10.13140/RG.2.2.19380.94084). 4820

(doi: 10.20944/preprints202212.0500.v1). 4831
10.13140/RG.2.2.20993.12640). 4834




10.13140/RG.2.2.29173.86244). 4849
(doi: 10.5281/zenodo.7826705). 4854
2023 (doi: 10.5281/zenodo.7820680). 4856
10.5281/zenodo.7812750). 4858


2023 (doi: 10.5281/zenodo.7807782). 4864
2023 (doi: 10.5281/zenodo.7804449). 4866


(doi: 10.5281/zenodo.7792307). 4870
(doi: 10.5281/zenodo.7790728). 4872
2023 (doi: 10.5281/zenodo.7787712). 4874
10.5281/zenodo.7783791). 4876
10.5281/zenodo.7780123). 4878
(doi: 10.5281/zenodo.7773119). 4880
odo.7637762). 4882
10.5281/zenodo.7766174). 4884
10.5281/zenodo.7762232). 4886
(doi: 10.5281/zenodo.7758601). 4888
10.5281/zenodo.7754661). 4890
10.5281/zenodo.7750995) . 4892
(doi: 10.5281/zenodo.7749875). 4894
10.5281/zenodo.7747236). 4896
10.5281/zenodo.7742587). 4898
(doi: 10.5281/zenodo.7738635). 4900
10.5281/zenodo.7734719). 4902

10.5281/zenodo.7730484). 4904
(doi: 10.5281/zenodo.7730469). 4906
10.5281/zenodo.7722865). 4908
odo.7713563). 4910
odo.7709116). 4912
10.5281/zenodo.7706415). 4914
(doi: 10.5281/zenodo.7706063). 4916
(doi: 10.5281/zenodo.7701906). 4918
odo.7700205). 4920
10.5281/zenodo.7694876). 4922
10.5281/zenodo.7679410). 4924
10.5281/zenodo.7675982). 4926
10.5281/zenodo.7672388). 4928
odo.7668648). 4930
10.5281/zenodo.7662810). 4932
10.5281/zenodo.7659162). 4934
odo.7653233). 4936
odo.7653204). 4938

odo.7653142). 4940
odo.7653117). 4942
odo.7653089). 4944
odo.7651687). 4946
odo.7651619). 4948
odo.7651439). 4950
odo.7650729). 4952
odo.7647868). 4954
odo.7647017). 4956
odo.7644894). 4958
odo.7641880). 4960
odo.7632923). 4962
odo.7623459). 4964
10.5281/zenodo.7606416). 4966
10.5281/zenodo.7606416). 4968
odo.7606404). 4970
10.5281/zenodo.7580018). 4972
odo.7580018). 4974

odo.7580018). 4976
odo.7579929). 4978
10.5281/zenodo.7563170). 4980
odo.7563164). 4982
odo.7563160). 4984
odo.7563160). 4986
10.5281/zenodo.7563160). 4988
10.5281/zenodo.7557063). 4990
10.5281/zenodo.7557009). 4992
10.5281/zenodo.7539484). 4994
10.5281/zenodo.7523390). 4996
10.5281/zenodo.7523390). 4998
10.5281/zenodo.7523390). 5000
odo.7574952). 5002
10.5281/zenodo.7574992). 5004
odo.7523357). 5006
10.5281/zenodo.7523357). 5008
10.5281/zenodo.7504782). 5010

10.5281/zenodo.7504782). 5012
10.5281/zenodo.7504782). 5014
10.5281/zenodo.7499395). 5016
odo.7499395). 5018
10.5281/zenodo.7499395). 5020
10.5281/zenodo.7497450). 5022
10.5281/zenodo.7497450). 5024
10.5281/zenodo.7494862). 5026
odo.7494862). 5028
10.5281/zenodo.7494862). 5030
10.5281/zenodo.7493845). 5032
10.5281/zenodo.7493845). 5034
10.5281/zenodo.7493845). 5036
odo.7539484). 5038
odo.7523390). 5040
odo.7523357). 5042
odo.7504782). 5044
odo.7499395). 5046

odo.7497450). 5048
odo.7494862). 5050
odo.7493845). 5052
odo.7480110). 5054
odo.7378758). 5056
odo.6320305). 5058
odo.6677173). 5060

CHAPTER 24 5061
Cancer In Neutrosophic 5062
SuperHyperGraph 5063
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5064
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5065
disease is considered and as the consequences of the model, some parameters are used. The cells 5066
are under attack of this disease but the moves of the cancer in the special region are the matter 5067
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5068
treatments for this Neutrosophic disease. 5069
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5070
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5071
term Neutrosophic function. 5072
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5073
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5074
move from the cancer is identified by this research. Sometimes the move of the cancer 5075
about the moves and the effects of the cancer on that region; this event leads us to 5077
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5078
perception on what’s happened and what’s done. 5079
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5080
known and they’ve got the names, and some general Neutrosophic models. The moves 5081
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5082
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5083
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5084
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5085
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5086
Models. 5087
Some cells have been faced with some attacks from the situation which is caused by the 5088
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5089
which in that, the cells could be labelled as some groups and some groups or individuals have 5090
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5091
the embedded situations, the individuals of cells and the groups of cells could be considered 5092
245
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5093
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5094
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5095
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5096
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5097
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5098
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5099
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5100
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5101
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5102
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5103
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5104
out what’s going on this phenomenon. The special case of this disease is considered and as the 5105
consequences of the model, some parameters are used. The cells are under attack of this disease 5106
but the moves of the cancer in the special region are the matter of mind. The recognition of 5107
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5108
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5109
both bases are the background of this research. Sometimes the cancer has been happened on the 5110
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5111
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5112
in the forms of alliances’ styles with the formation of the design and the architecture are 5113
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5114
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5115
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5116
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5117
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5118
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5119
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5120
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5121
and what’s done. There are some specific models, which are well-known and they’ve got the 5122
names, and some general models. The moves and the traces of the cancer on the complex tracks 5123
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5124
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5125
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5126
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5127
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5128
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5129
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5130
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5131
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5132
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5134
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5135
based on the fixed groups of cells or the fixed groups of group of cells? 5136
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5137

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5141
Then the research has taken more motivations to define SuperHyperClasses and to find some 5142
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5143
some instances and examples to make clarifications about the framework of this research. The 5144
general results and some results about some connections are some avenues to make key point of 5145
this research, “Cancer’s Recognition”, more understandable and more clear. 5146
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5147
research on the modeling of the regions where are under the attacks of the cancer to 5148
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5149
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5150
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5151
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5152

instances and literature reviews have taken the whole way through. In this scientific research, 5153
the literature reviews have fulfilled the lines containing the notions and the results. The 5154
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5155
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5156
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5157
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5158
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5159
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5160
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5161
to figure out the background for the SuperHyperNotions. 5162

CHAPTER 25 5163
Neutrosophic Eulerian-Path-Neighbor 5164
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5165
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5166
2023, (doi: 10.13140/RG.2.2.34953.52320). 5167

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5168
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5169
(doi: 10.13140/RG.2.2.33275.80161). 5170
10.13140/RG.2.2.11050.90569). 5173
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5174
10.13140/RG.2.2.17761.79206). 5176
10.13140/RG.2.2.19911.37285). 5179
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5180
10.13140/RG.2.2.23266.81602). 5182
10.13140/RG.2.2.19360.87048). 5185
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5186
10.13140/RG.2.2.32363.21286). 5188
10.13140/RG.2.2.11758.69441). 5191
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5192
10.13140/RG.2.2.31891.35367). 5194
10.13140/RG.2.2.21510.45125). 5197
249
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5198
10.13140/RG.2.2.13121.84321). 5200

CHAPTER 26 5201
New Ideas In Recognition of Cancer And 5202
Neutrosophic SuperHyperGraph By 5203
Eulerian-Path-Neighbor As Hyper 5204
Nebbish On Super Nebulous 5205
251
CHAPTER 27 5206
ABSTRACT 5207
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5208
Path-Neighbor ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Path-Neighbor 5209

pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5210
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperEulerian-Path-Neighbor 5211
if the following expression is called Neutrosophic e-SuperHyperEulerian-Path-Neighbor criteria holds 5212
∀N (Ea ) ∈ P : P is
Neutrosophic re-SuperHyperEulerian-Path-Neighbor if the following expression is called Neutrosophic 5213

e-SuperHyperEulerian-Path-Neighbor criteria holds 5214
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5215

SuperHyperEulerian-Path-Neighbor if the following expression is called Neutrosophic v- 5216
SuperHyperEulerian-Path-Neighbor criteria holds 5217
∀N (Va ) ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Path-Neighbor if the following expression is called Neutrosophic 5218

v-SuperHyperEulerian-Path-Neighbor criteria holds 5219
∀N (Va ) ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5220
253

and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor. ((Neutrosophic) SuperHyperEulerian-Path- 5223
Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5224
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5225
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 5229
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 5230
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5231
the Extreme SuperHyperEulerian-Path-Neighbor; a Neutrosophic SuperHyperEulerian-Path-Neighbor if it’s 5232
either of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path- 5233
Neighbor, Neutrosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian- 5234

Path-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 5235
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 5236
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges 5237
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 5238
Path-Neighbor; an Extreme SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s either of 5239
Neutrosophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, 5240

Neutrosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path- 5241
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 5242
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 5243
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 5244
SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Path-Neighbor; and the 5246
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian- 5247
and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor and C(N SHG) for a Neutrosophic Su- 5250
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5251
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 5252
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 5255
Path-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an 5256
Extreme V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian- 5257

Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neutrosophic v-SuperHyperEulerian- 5258
Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor and C(N SHG) for an Extreme 5259
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 5260
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 5261
conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHy- 5262
perVertices such that they form the Extreme SuperHyperEulerian-Path-Neighbor; a Neutrosophic 5263
V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, 5264
and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor and C(N SHG) for a Neutrosophic Super- 5266
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5267

SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 5268

seNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 5269
they form the Neutrosophic SuperHyperEulerian-Path-Neighbor; an Extreme V-SuperHyperEulerian- 5270
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 5274
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 5275
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 5276
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5277
SuperHyperEulerian-Path-Neighbor; and the Extreme power is corresponded to its Extreme coefficient; 5278
a Neutrosophic SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s either of Neutro- 5279
sophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neut- 5280

rosophic v-SuperHyperEulerian-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Path-Neighbor 5281
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5282
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 5284
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 5285
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5286
SuperHyperEulerian-Path-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic 5287
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 5288
namely, a SuperHyperEulerian-Path-Neighbor and Neutrosophic SuperHyperEulerian-Path-Neighbor. Two 5289
different types of SuperHyperDefinitions are debut for them but the research goes further 5290
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 5297
under research to figure out the challenges make sense about ongoing and upcoming research. 5298
The special case is up. The cells are viewed in the deemed ways. There are different types 5299
of them. Some of them are individuals and some of them are well-modeled by the group of 5300
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 5301
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 5302
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 5303
these complex and dense SuperHyperModels open up some avenues to research on theoret- 5304
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 5305
It’s also officially collected in the form of some questions and some problems. Assume a 5306
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Path-Neighbor is 5307
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5308

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5310
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5311
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Path-Neighbor is a max- 5312
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5313

that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5314
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5315
and |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first Expression, holds if S is a 5316
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5317
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperEulerian- 5318
Path-Neighbor . Since there’s more ways to get type-results to make a SuperHyperEulerian-Path-Neighbor 5319
more understandable. For the sake of having Neutrosophic SuperHyperEulerian-Path-Neighbor, there’s 5320
a need to “redefine” the notion of a “SuperHyperEulerian-Path-Neighbor ”. The SuperHyperVertices 5321
a SuperHyperEulerian-Path-Neighbor . It’s redefined a Neutrosophic SuperHyperEulerian-Path-Neighbor 5324
if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 5325
HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with 5326

the key points, “The Values of The Vertices & The Number of Position in Alphabet”, 5327
“The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Values of 5328
The Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The 5329
maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum 5330
Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce 5331
the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Path-Neighbor 5332

. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 5333
kind of SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Path-Neighbor until 5334
the SuperHyperEulerian-Path-Neighbor, then it’s officially called a “SuperHyperEulerian-Path-Neighbor” 5335
but otherwise, it isn’t a SuperHyperEulerian-Path-Neighbor . There are some instances about the 5336
clarifications for the main definition titled a “SuperHyperEulerian-Path-Neighbor ”. These two 5337
examples get more scrutiny and discernment since there are characterized in the disciplinary 5338
ways of the SuperHyperClass based on a SuperHyperEulerian-Path-Neighbor . For the sake of having 5339
a Neutrosophic SuperHyperEulerian-Path-Neighbor, there’s a need to “redefine” the notion of a “Neut- 5340
rosophic SuperHyperEulerian-Path-Neighbor” and a “Neutrosophic SuperHyperEulerian-Path-Neighbor ”. 5341
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 5342
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 5343
values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyper- 5344

Graph” if the intended Table holds. And a SuperHyperEulerian-Path-Neighbor are redefined to a 5345
“Neutrosophic SuperHyperEulerian-Path-Neighbor” if the intended Table holds. It’s useful to define 5346
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 5347
results to make a Neutrosophic SuperHyperEulerian-Path-Neighbor more understandable. Assume 5348
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5349

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Path-Neighbor, SuperHyperStar, 5350
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5351
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Path-Neighbor”, “Neutrosophic SuperHyper- 5352
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 5353
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 5354
“Neutrosophic SuperHyperEulerian-Path-Neighbor” where it’s the strongest [the maximum Neutro- 5355
sophic value from all the SuperHyperEulerian-Path-Neighbor amid the maximum value amid all 5356
SuperHyperVertices from a SuperHyperEulerian-Path-Neighbor .] SuperHyperEulerian-Path-Neighbor . 5357
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5358
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5359

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5360
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Path-Neighbor if it’s 5361
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 5362
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5363
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 5365
the traces of the cancer on the complex tracks and between complicated groups of cells could 5386
be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Path-Neighbor, SuperHyper- 5387
Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 5388
either the longest SuperHyperEulerian-Path-Neighbor or the strongest SuperHyperEulerian-Path-Neighbor 5389
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Path-Neighbor, 5390

called SuperHyperEulerian-Path-Neighbor, and the strongest SuperHyperEulerian-Path-Neighbor, called 5391
Neutrosophic SuperHyperEulerian-Path-Neighbor, some general results are introduced. Beyond that 5392
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5393
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5394

and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Path-Neighbor 5397
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5398
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Path-Neighbor, Cancer’s Neutro- 5399
sophic Recognition 5400


CHAPTER 28 5402
Applied Notions Under The Scrutiny Of 5403
The Motivation Of This Scientific 5404
Research 5405
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5406
try to bring the motivations in the narrative ways. Some cells have been faced with some 5407
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5408
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5409
as some groups and some groups or individuals have excessive labels which all are raised from 5410
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5411
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5412
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5413
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5414
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5415
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5416
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5417
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5418
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5419
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5420
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5421
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5422
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5423
is the disease but the model is going to figure out what’s going on this phenomenon. The 5424
special case of this disease is considered and as the consequences of the model, some parameters 5425
are used. The cells are under attack of this disease but the moves of the cancer in the 5426
special region are the matter of mind. The recognition of the cancer could help to find some 5427
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5428
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5429
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 5432
259
embedded styles to figure out the background for the SuperHyperNotions. The recognition 5435
of the cancer in the long-term function. The specific region has been assigned by the model 5436
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 5437
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 5438
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5439
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5440
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5441
are some specific models, which are well-known and they’ve got the names, and some general 5442
models. The moves and the traces of the cancer on the complex tracks and between complicated 5443
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperEulerian-Path- 5444
Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 5445
The aim is to find either the optimal SuperHyperEulerian-Path-Neighbor or the Neutrosophic 5446
SuperHyperEulerian-Path-Neighbor in those Neutrosophic SuperHyperModels. Some general results 5447

are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 5448
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 5449
three SuperHyperEdges to form any style of a SuperHyperEulerian-Path-Neighbor. There isn’t 5450
any formation of any SuperHyperEulerian-Path-Neighbor but literarily, it’s the deformation of any 5451
SuperHyperEulerian-Path-Neighbor. It, literarily, deforms and it doesn’t form. 5452
amount of SuperHyperEulerian-Path-Neighbor” of either individual of cells or the groups of cells based 5454
on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian-Path- 5455
Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 5456
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5457
these messy and dense SuperHyperModels where embedded notions are illustrated? 5458
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5459
it motivates us to define different types of “ SuperHyperEulerian-Path-Neighbor” and “Neutrosophic 5460
SuperHyperEulerian-Path-Neighbor” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5461

Then the research has taken more motivations to define SuperHyperClasses and to find some 5462
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5463
some instances and examples to make clarifications about the framework of this research. The 5464
general results and some results about some connections are some avenues to make key point of 5465
this research, “Cancer’s Recognition”, more understandable and more clear. 5466
The framework of this research is as follows. In the beginning, I introduce basic definitions 5467
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5468
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5469
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5470
review literature are applied to make sense about what’s going to figure out about the upcoming 5471
sections. The main definitions and their clarifications alongside some results about new notions, 5472
SuperHyperEulerian-Path-Neighbor and Neutrosophic SuperHyperEulerian-Path-Neighbor, are figured out 5473

in sections “ SuperHyperEulerian-Path-Neighbor” and “Neutrosophic SuperHyperEulerian-Path-Neighbor”. 5474
In the sense of tackling on getting results and in Eulerian-Path-Neighbor to make sense about continuing 5475
the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5476
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5477
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5478
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5479

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5480
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5481
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5482
and as concluding and closing section of theoretical research are contained in the section “General 5483
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5484
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5485
“ SuperHyperEulerian-Path-Neighbor”, “Neutrosophic SuperHyperEulerian-Path-Neighbor”, “Results on 5486

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5487
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5488
this research and going to figure out the word “best” as the description and adjective for this 5489
research as presented in section, “ SuperHyperEulerian-Path-Neighbor”. The keyword of this research 5490
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5491
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5492
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5493
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5494
research in the terms of “questions” and “problems” to make sense to figure out this research in 5495
featured style. The advantages and the limitations of this research alongside about what’s done 5496
in this research to make sense and to get sense about what’s figured out are included in the 5497
section, “Conclusion and Closing Remarks”. 5498

CHAPTER 29 5499
Neutrosophic Preliminaries Of This 5500
Scientific Research On the Redeemed 5501
Ways 5502
In this section, the basic material in this scientific research, is referred to [Single Valued 5503
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5504

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5505
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5506
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5507
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5508
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5509
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5510
their clarifications are addressed to Ref.[HG38]. 5511
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5512
the new ideas and their clarifications are elicited. 5513
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

Let X be a Eulerian-Path-Neighbor 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}.
263

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). 5515
where 5517
1, 2, . . . , n0 ); 5522
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5523
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5524

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5553
x, y, z, w ∈ [0, 1]: 5554
(i) 1 ⊗ x = x; 5555
(ii) x ⊗ y = y ⊗ x; 5556
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5557
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5558

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

where 5561

1, 2, . . . , n0 ); 5566
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5567
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5568
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5569
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5570
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5582
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5583
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5584
SuperEdge; 5590
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5593
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5594
makes the patterns and regularities. 5595
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5596
of elements of SuperHyperEdges are the same. 5597

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5598
makes to have SuperHyperUniform more understandable. 5599
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5600
Classes as follows. 5601
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5602
two given SuperHyperEdges with two exceptions; 5603
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5604
SuperHyperEdges; 5605
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5606
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5607
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5608
in common; 5609
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5610
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5611
SuperHyperEdge in common; 5612
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5613
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5614
SuperVertex. 5615
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 5616
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5617
(i) Vi , Vi+1 ∈ Ei0 ; 5618
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5619
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5620
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5621
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5622
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5623
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5624
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5625
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5627
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5628
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5629
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5630
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5631
perPath . 5632
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 5633
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5634
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5635
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5636
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5637
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5638

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5651
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5652
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5653
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Path- 5654

Neighbor). 5655
(i) Neutrosophic e-SuperHyperEulerian-Path-Neighbor if the following expression is called 5659

Neutrosophic e-SuperHyperEulerian-Path-Neighbor criteria holds 5660
∀N (Ea ) ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Path-Neighbor if the following expression is called 5661

Neutrosophic re-SuperHyperEulerian-Path-Neighbor criteria holds 5662
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5663
(iii) Neutrosophic v-SuperHyperEulerian-Path-Neighbor if the following expression is called 5664
∀N (Va ) ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Path-Neighbor if the following expression is called 5666
∀N (Va ) ∈ P : P is

(v) Neutrosophic SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 5669

Neighbor. 5672
Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Path-Neighbor). 5673

(i) an Extreme SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 5676

SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neut- 5677

the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 5681
(ii) a Neutrosophic SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 5684

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 5688
(iii) an Extreme SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s either 5692

of Neutrosophic e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian- 5693

Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5698
(iv) a Neutrosophic SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s 5702


of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neut- 5708

(v) an Extreme V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic e- 5712

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 5716
(vi) a Neutrosophic V-SuperHyperEulerian-Path-Neighbor if it’s either of Neutrosophic 5720
e-SuperHyperEulerian-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Path-Neighbor, Neut- 5721

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 5724
(vii) an Extreme V-SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s 5728


Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5734
(viii) a Neutrosophic SuperHyperEulerian-Path-Neighbor SuperHyperPolynomial if it’s 5738


of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neut- 5744
and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 5747
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Path-Neighbor). 5748

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5749
(i) an δ−SuperHyperEulerian-Path-Neighbor is a Neutrosophic kind of Neutrosophic 5750

SuperHyperEulerian-Path-Neighbor such that either of the following expressions hold for 5751
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5752
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2


136TBL3
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 5753

(29.1), holds if S is an δ−SuperHyperDefensive; 5754
(ii) a Neutrosophic δ−SuperHyperEulerian-Path-Neighbor is a Neutrosophic kind of Neut- 5755

rosophic SuperHyperEulerian-Path-Neighbor such that either of the following Neutrosophic 5756
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5757
|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 5758

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5759

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5761
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5762
there’s the usage of the position of labels to assign to the values. 5763
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5765
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5766
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5767
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5769
sophic SuperHyperPath , SuperHyperEulerian-Path-Neighbor, SuperHyperStar, SuperHyperBipart- 5770
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5771
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5772
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5773
perHyperWheel if the Table (29.2) holds. 5774
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Path-Neighbor. 5775
Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Path- 5776
Neighbor more Neutrosophicly understandable. 5777
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Path-Neighbor”. The 5779
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5780
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5781
5782

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

136TBL4

136TBL1
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Path-Neighbor. It’s redefined a Neutrosophic 5783

SuperHyperEulerian-Path-Neighbor if the Table (29.3) holds. 5784

CHAPTER 30 5785
Neutrosophic SuperHyper But As Eulerian-Path-Neighbor 5786
Super Forms 5788
Definition 30.0.1. (Neutrosophic event). 5789
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5790
is a probability Eulerian-Path-Neighbor. Any Neutrosophic k-subset of A of V is called Neutrosophic 5791
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5792
following expression is called Neutrosophic probability of A. 5793
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5794

is a probability Eulerian-Path-Neighbor. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5796

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5801
S = (V, E) is a probability Eulerian-Path-Neighbor. Any k-function Eulerian-Path-Neighbor like E is 5802

called Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Path-Neighbor like E is 5803
called Neutrosophic Variable. 5804
The notion of independent on Neutrosophic Variable is likewise. 5805
Definition 30.0.4. (Neutrosophic Expectation). 5806
275
is a probability Eulerian-Path-Neighbor. A Neutrosophic k-Variable E has a number is called 5808

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5809
criteria 5810
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5811
is a probability Eulerian-Path-Neighbor. A Neutrosophic number is called Neutrosophic Crossing 5813
if the following expression is called Neutrosophic Crossing criteria 5814
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). 5815
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let m and n propose special Eulerian-Path- 5816
Neighbor. Then with m ≥ 4n, 5817
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 Eulerian-Path-Neighbor 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: 5818
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5819
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5820
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let P be a SuperHyperSet of n points in 5821

the plane, and let l be the Neutrosophic number√of SuperHyperLines in the plane passing through 5822
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5823
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5824

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

Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let P be a SuperHyperSet of n points in 5831
the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5832
k < 5n4/3 . 5833
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5834
S = (V, E) is a probability Eulerian-Path-Neighbor. Draw a SuperHyperUnit SuperHyperCircle around 5835

each SuperHyperPoint of P. Let ni be the Neutrosophic number of thesePSuperHyperCircles 5836
i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now
P
passing through exactly i points of P. Then 5837
form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 5838
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 5839
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5840
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 5841

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5842
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5843
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5844
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5845
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5846
4/3 4/3
k < 4n + n < 5n . 5847
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5848
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let X be a nonnegative Neutrosophic 5849
Variable and t a positive real number. Then 5850
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. 5851
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5852
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let Xn be a nonnegative integer-valued 5853
variable in a probability Eulerian-Path-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 5854

P (Xn = 0) → 1 as n → ∞. 5855
Proof. 5856
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. A special SuperHyperGraph in Gn,p 5858
almost surely has stability number at most d2p−1 log ne. 5859

S = (V, E) is a probability Eulerian-Path-Neighbor. A special SuperHyperGraph in Gn,p is up. Let 5861
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 5862
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 5863
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 5864
of the Neutrosophic SuperHyperGraph G. 5865
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5866
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5867
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 5868
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5869
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: 5870
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5871
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 5872
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5873
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5874
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5875
Definition 30.0.12. (Neutrosophic Variance). 5876
is a probability Eulerian-Path-Neighbor. A Neutrosophic k-Variable E has a number is called 5878
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5879
criteria 5880
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let X be a Neutrosophic Variable and 5882
let t be a positive real number. Then 5883
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Path-Neighbor. Let X be a Neutrosophic Variable and let t be a 5885
positive real number. Then 5886
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5887
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let Xn be a Neutrosophic Variable in a 5889

probability Eulerian-Path-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 5890
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Path-Neighbor. Set X := Xn and t := |Ex(Xn )| in 5892
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5893
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5894
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5896
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 5897
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5898
S = (V, E) is a probability Eulerian-Path-Neighbor. As in the proof of related Theorem, the result is 5900
Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be as 5903
defined in previous Theorem. Then either: 5904
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5905
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5906
Definition 30.0.17. (Neutrosophic Threshold). 5909
is a probability Eulerian-Path-Neighbor. Let P be a monotone property of SuperHyperGraphs (one 5911
which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for 5912
P is a function f (n) such that: 5913
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5914
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5915

Definition 30.0.18. (Neutrosophic Balanced). 5916

is a probability Eulerian-Path-Neighbor. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5918
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5919
SubSuperHyperGraph is called Neutrosophic Balanced. 5920
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5921

(V, E). Consider S = (V, E) is a probability Eulerian-Path-Neighbor. Let F be a nonempty 5922
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5923
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5924
SubSuperHyperGraph. 5925
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5928
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5929
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5930

SuperHyperEulerian-Path-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5931
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5932
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5933

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5934
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5935
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5936
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5937
Neutrosophic SuperHyperEulerian-Path-Neighbor. 5938
C(N SHG)Neutrosophic Eulerian-Path-Neighbor

= {E4 }.
C(N SHG)Neutrosophic Eulerian-Path-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Eulerian-Path-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Eulerian-Path-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .
5939

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

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

Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Path- 5947

Neighbor. 5948

= {E4 }.
= z3.
= {V1 , V2 , V4 }.
= z 5 + 2z 3 + z.
5949


= {E4 }.
= z3.
= {V1 , V2 , V3 }.



= z8 + z4 + z3.
5953


= {E1 }.
= z3.
= {V3 }.
= z2.
5957






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


= {}.
= 0z 0 .



= {}.
= 0z 0 .
5965


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




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


= {}.


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


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







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


= {}.


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


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




= {E1 , E2 }.
= 2z 2 .
= {V1 }.
= z5.
5997


= {}.


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


= {}.


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


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







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


= {}.



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


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


= 0z 0 .
6021


= {E1 , E2 }.
= z 10 + z 2 .
= {V2 ({R}, {M6 }, {L6 }, {F }, {P }, {J}, {M }), V1 , V3 }.
= z 5 + 2z 3 + 7z.
6025


Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.3) 95NHG1

= {}.
= 0z 0 .
= {}.
= 0z 0 .
6029
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6030
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Path- 6031


Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.3) 95NHG2
Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6032
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6033
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6034
them. 6035
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6036

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6037
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6038
Neutrosophic quasi-R-Eulerian-Path-Neighbor minus all Neutrosophic SuperHypeNeighbor to some of 6039
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6040
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6041
quasi-R-Eulerian-Path-Neighbor, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6042
all of them. 6043
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-Eulerian-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Path-Neighbor is at 6044
least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6045
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6046
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6047

Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Eulerian- 6048

Path-Neighbor in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 6049
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6050
SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Path-Neighbor. 6051
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).

Then the Neutrosophic number of type-result-R-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor with the least Neutrosophic cardinality, 6052

the lower sharp Neutrosophic bound for cardinality. 6053
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6054

(V, E). Then in the worst case, literally, 6055
C(N SHG)N eutrosophicQuasi−Eulerian−P ath−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−P ath−N eighborSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Eulerian-Path-Neighbor. In other words, the least cardinality, the lower 6056
sharp bound for the cardinality, of a Neutrosophic type-result-Eulerian-Path-Neighbor is the cardinality 6057
of 6058

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−P ath−N eighborSuperHyperP 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-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor. 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-Eulerian-Path-Neighbor decorates the Neutrosophic
SuperHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic
style implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutro-
sophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower
Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHy-
perVertices have perfect Neutrosophic connections inside each of SuperHyperEdges and the
outside of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of

the used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from
the fact that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the
targeted Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore,
the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Eulerian-Path-Neighbor. Since at least two Neutrosophic Supe-
rHyperVertices involve to make a title in the Neutrosophic background of the Neutrosophic
SuperHyperGraph. The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic
SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the Neutrosophic
version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious
Neutrosophic SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Neutrosophic adjective for the initial
Neutrosophic SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neut-
rosophic version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph
is said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic set-
ting. With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least
one Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Eulerian-Path-Neighbor
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic
R-Eulerian-Path-Neighbor has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a
Neutrosophic R-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor” since the maximum Neutro-
sophic 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-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor 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-Eulerian-Path-Neighbor.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Eulerian-Path-Neighbor. 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-Eulerian-Path-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Path-Neighbor but with
slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z
and
is formalized with mathematical literatures on the Neutrosophic R-Eulerian-Path-Neighbor. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6059
Neutrosophic R-Eulerian-Path-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6060
Neutrosophic R-Eulerian-Path-Neighbor =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Path-Neighbor where E ∈ EESHG:(V,E) is

fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Eulerian-Path-Neighbor, 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-Eulerian-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Path-Neighbor 6061
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neut- 6062
rosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6063
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains the max- 6064
imum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic 6065
Eulerian-Path-Neighbor in some cases but the maximum number of the Neutrosophic SuperHyperEdge 6066

with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutro- 6067
sophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Path-Neighbor. 6068
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6069
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6070
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6071
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6072
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6073

to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6074
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6075
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6076
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6077
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6078
Neutrosophic quasi-R-Eulerian-Path-Neighbor where the Neutrosophic completion of the Neutrosophic 6079

incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Eulerian-Path-Neighbor. The 6080
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6081
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHy- 6082
perCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6083
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6084
timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6085
minimum Neutrosophic style of the embedded Neutrosophic R-Eulerian-Path-Neighbor. The interior 6086
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6087
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6088
common connections, more precise and more formal, the perfect unique connections inside the 6089
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the 6090
Neutrosophic R-Eulerian-Path-Neighbor. Thus Neutrosophic exterior SuperHyperVertices could be 6091

used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6092
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6093
embedded Neutrosophic Eulerian-Path-Neighbor, there’s the usage of exterior Neutrosophic SuperHy- 6094
perVertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6095
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6096
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one 6097
SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the 6098
Neutrosophic R-Eulerian-Path-Neighbor. The Neutrosophic R-Eulerian-Path-Neighbor with the exclusion of 6099
the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and 6100
with other terms, the Neutrosophic R-Eulerian-Path-Neighbor with the inclusion of all Neutrosophic 6101
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian- 6102

Path-Neighbor. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6103
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6104
the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of 6105
any given Neutrosophic quasi-R-Eulerian-Path-Neighbor minus all Neutrosophic SuperHypeNeighbor 6106
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6107
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices 6108

in an Neutrosophic quasi-R-Eulerian-Path-Neighbor, minus all Neutrosophic SuperHypeNeighbor to 6109
some of them but not all of them. 6110
The main definition of the Neutrosophic R-Eulerian-Path-Neighbor has two titles. a Neut- 6111
rosophic quasi-R-Eulerian-Path-Neighbor and its corresponded quasi-maximum Neutrosophic R- 6112

SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 6113
ber, there’s a Neutrosophic quasi-R-Eulerian-Path-Neighbor with that quasi-maximum Neutrosophic 6114
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 6115
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 6116
lead us to take the collection of all the Neutrosophic quasi-R-Eulerian-Path-Neighbors for all Neut- 6117
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 6118
of the Neutrosophic Eulerian-Path-Neighbor ends up but this essence starts up in the terms of the 6119
Neutrosophic quasi-R-Eulerian-Path-Neighbor, again and more in the operations of collecting all the 6120
Neutrosophic quasi-R-Eulerian-Path-Neighbors acted on the all possible used formations of the Neut- 6121
rosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic number is 6122
considered as the equivalence class for all corresponded quasi-R-Eulerian-Path-Neighbors. Let 6123
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Path-Neighbor be a Neutro- 6124
sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Path-Neighbor. Then 6125
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Path-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Path-Neighbor is re-formalized 6126
and redefined as follows. 6127
GNeutrosophic Eulerian-Path-Neighbor ∈ ∪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 6128
definition for the Neutrosophic Eulerian-Path-Neighbor. 6129
GNeutrosophic Eulerian-Path-Neighbor =
{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 Eulerian- 6130
poses the upcoming expressions.
Path-Neighbor 6131

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

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

And then, 6133

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


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

6136


6137

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6138
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6139
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6140
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Eulerian- 6141
Path-Neighbor” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Path-Neighbor” 6142
since “Neutrosophic Quasi-Eulerian-Path-Neighbor” happens “Neutrosophic Eulerian-Path-Neighbor” in a 6143
Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic Super- 6144
HyperNeighborhood” may not happens “Neutrosophic Eulerian-Path-Neighbor” in a Neutrosophic 6145
SuperHyperGraph as initial framework and preliminarily background since there are some am- 6146
biguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, 6147
the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Eulerian-Path-Neighbor”, 6148
and “Neutrosophic Eulerian-Path-Neighbor” are up. 6149
Thus, let 6150
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6151
GNeutrosophic Eulerian-Path-Neighbor be a Neutrosophic number, a Neutrosophic SuperHyperNeigh- 6152
borhood and a Neutrosophic Eulerian-Path-Neighbor and the new terms are up. 6153
GNeutrosophic Eulerian-Path-Neighbor ∈ ∪zNeutrosophic Number

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

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |

6156
And with go back to initial structure, 6157
GNeutrosophic Eulerian-Path-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6159

6160


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

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

Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Path-

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

Path-Neighbor, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6161
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6162
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6163
type-SuperHyperSet called the 6164
“Neutrosophic R-Eulerian-Path-Neighbor” 6165
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6166
Neutrosophic R-Eulerian-Path-Neighbor, 6167
is only and only

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

perModeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel
and a Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic
stable embedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic R-Eulerian-Path-Neighbor amid those obvious simple Neutro-
sophic type-SuperHyperSets of the Neutrosophic Eulerian-Path-Neighbor, 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-Eulerian-Path-Neighbor. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Eulerian-Path-Neighbor is the cardinality of
6168
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all in- 6169
terior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Path-Neighbor 6170

if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6171
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6172
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6173
them. 6174
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6175
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6176

all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6177
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6178
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6179
Consider there’s a Neutrosophic R-Eulerian-Path-Neighbor with the least cardinality, the lower 6180
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6181
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6182
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6183
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6184
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Path-Neighbor. Since it doesn’t 6185
have 6186
6187
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6188

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6189
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6190
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6191
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian- 6192
Path-Neighbor. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6193
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6194

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6195
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6196
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6197
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6198
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6199
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6200
obvious Neutrosophic R-Eulerian-Path-Neighbor, VESHE is up. The obvious simple Neutrosophic 6201
type-SuperHyperSet of the Neutrosophic R-Eulerian-Path-Neighbor, VESHE , is a Neutrosophic Supe- 6202
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6203
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6204
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6205
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6206
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6207

a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6208
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6209
R-Eulerian-Path-Neighbor only contains all interior Neutrosophic SuperHyperVertices and all exterior 6210
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6211
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6212
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6213

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6214
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6215
The SuperHyperNotion, namely, Eulerian-Path-Neighbor, is up. There’s neither empty SuperHy- 6216
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6217
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6218
Neutrosophic Eulerian-Path-Neighbor. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6219


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−P ath−N eighborSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−P ath−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−P ath−N eighborSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Path-Neighbor. The 6221
Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6222

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


= az s + bz t .
Is an Neutrosophic Eulerian-Path-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph 6223

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

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6229
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6230
Neutrosophic Eulerian-Path-Neighbor is up. The obvious simple Neutrosophic type-SuperHyperSet 6231
called the Neutrosophic Eulerian-Path-Neighbor is a Neutrosophic SuperHyperSet includes only two 6232
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6233
SuperHyperEdges[SuperHyperVertices], 6234

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- 6235
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6236
Eulerian-Path-Neighbor is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6237
SuperHyperEdges[SuperHyperVertices], 6238

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 Eulerian- 6239

.
Path-Neighbor Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6240

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Path-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph 6242

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6243
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6244
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Path-Neighbor and 6245
it’s an Neutrosophic Eulerian-Path-Neighbor. Since it’s 6246

6247
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6249
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6250
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6251
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6252

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Eulerian-Path-Neighbor , 6253

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 Eulerian-Path- 6254

Neighbor , not: 6255

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

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- 6257
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6258
Neutrosophic type-SuperHyperSet called the 6259
“Neutrosophic Eulerian-Path-Neighbor ” 6260
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6261
Neutrosophic Eulerian-Path-Neighbor , 6262
is only and only 6263

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

CHAPTER 31 6265
The Neutrosophic Departures on The 6266
Theoretical Results Toward Theoretical 6267
Motivations 6268
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6269
Neutrosophic SuperHyperClasses. 6270
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6271

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6272
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6273
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
317
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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

6278
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6279
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6280
SuperHyperModel (31.1), is the SuperHyperEulerian-Path-Neighbor. 6281
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6282

= {}.
= 0z 0 .

= {}.
= 0z 0 .
Proof. Let 6283
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6284
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). 6285

6289
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6290
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6291
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Path-Neighbor. 6292
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6293

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

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

Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.7) 136NSHG19a
Proof. Let 6294
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6295
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6296

6300

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

Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6301
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6302
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6303
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6304
the Neutrosophic SuperHyperEulerian-Path-Neighbor. 6305
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6306
Then 6307

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6308
P :

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

are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6316
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Path-Neighbor taken from a connected Neutrosophic SuperHyperBi- 6318
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6319
of-SuperHyperPart SuperHyperEdges are attained in any solution 6320
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6322
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6323
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6324
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6325
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6326

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Path-Neighbor in the Example (42.0.11) 136NSHG21a
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6328
Then 6329

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6330
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

6331
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Path-Neighbor taken from a connected Neutrosophic SuperHyper- 6332

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

are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6338
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6340
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6341
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6345
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6346
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6347
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6348
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Path-Neighbor. 6349
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6350
Then, 6351

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

= {}.
= 0z 0 .
= {CEN T ER}.
X
= z |Vi ∈VN SHG | .
Proof. Let 6352
P :
CEN T ER, E2∗
6353
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Path-Neighbor taken from a connected Neutrosophic SuperHyper- 6354

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Path-Neighbor in the Neutrosophic Example (42.0.15) 136NSHG23a
Wheel ESHW : (V, E). There’s a new way to redefine as 6355

Then there’s at least one SuperHyperEulerian-Path-Neighbor. Thus the notion of quasi isn’t up and 6358
the SuperHyperNotions based on SuperHyperEulerian-Path-Neighbor could be applied. The unique 6359
embedded SuperHyperEulerian-Path-Neighbor proposes some longest SuperHyperEulerian-Path-Neighbor 6360
excerpt from some representatives. The latter is straightforward. 6361
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6362
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6363
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6364

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6365
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Path-Neighbor. 6366

CHAPTER 32 6367
The Surveys of Mathematical Sets On 6368
The Results But As The Initial Motivation 6369
For the SuperHyperEulerian-Path-Neighbor, Neutrosophic SuperHyperEulerian-Path-Neighbor, and the 6370

Neutrosophic SuperHyperEulerian-Path-Neighbor, some general results are introduced. 6371
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Path-Neighbor is “redefined” 6372
on the positions of the alphabets. 6373
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Path-Neighbor. Then 6374
N eutrosophic SuperHyperEulerian − P ath − N eighbor =

{theSuperHyperEulerian − P ath − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − P ath − N eighbor
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−P ath−N eighbor. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6375
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6376
the neutrality, for i = 1, 2, 3, respectively. 6377
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6378
alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Path-Neighbor and SuperHyperEulerian- 6379
Path-Neighbor coincide. 6380
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6381
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6382
SuperHyperEulerian-Path-Neighbor if and only if it’s a SuperHyperEulerian-Path-Neighbor. 6383
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6384
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6385
SuperHyperEulerian-Path-Neighbor if and only if it’s a longest SuperHyperEulerian-Path-Neighbor. 6386
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6387
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Path-Neighbor is its 6388
327
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Path-Neighbor, 6390

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6391
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Path-Neighbor is its 6392
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6394

SuperHyperEulerian-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Path-Neighbor 6395
isn’t well-defined. 6396
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6397

Neutrosophic SuperHyperEulerian-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 6398
Path-Neighbor isn’t well-defined. 6399

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6401
Neutrosophic SuperHyperEulerian-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 6402
Path-Neighbor isn’t well-defined. 6403
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6404

SuperHyperEulerian-Path-Neighbor is well-defined if and only if its SuperHyperEulerian-Path-Neighbor is 6405
well-defined. 6406
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6407
Neutrosophic SuperHyperEulerian-Path-Neighbor is well-defined if and only if its SuperHyperEulerian- 6408

Path-Neighbor is well-defined. 6409
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6411

Neutrosophic SuperHyperEulerian-Path-Neighbor is well-defined if and only if its SuperHyperEulerian- 6412
Path-Neighbor is well-defined. 6413
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6414
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6415
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6416
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6417
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6418
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6419
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 6420
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6421
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6424

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

independent SuperHyperSet is 6429
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6432
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6436

Graph which is a SuperHyperEulerian-Path-Neighbor/SuperHyperPath. Then V is a maximal 6437
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6441
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6442
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6443
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6445
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6446
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6450
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6451
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6452
Graph which is a SuperHyperEulerian-Path-Neighbor/SuperHyperPath. Then the number of 6455

(i) : the SuperHyperEulerian-Path-Neighbor; 6456
(ii) : the SuperHyperEulerian-Path-Neighbor; 6457
(iii) : the connected SuperHyperEulerian-Path-Neighbor; 6458
(iv) : the O(ESHG)-SuperHyperEulerian-Path-Neighbor; 6459
(v) : the strong O(ESHG)-SuperHyperEulerian-Path-Neighbor; 6460
(vi) : the connected O(ESHG)-SuperHyperEulerian-Path-Neighbor. 6461
coincide. 6463

Graph which is a SuperHyperWheel. Then the number of 6465
(i) : the dual SuperHyperEulerian-Path-Neighbor; 6466
(ii) : the dual SuperHyperEulerian-Path-Neighbor; 6467
(iii) : the dual connected SuperHyperEulerian-Path-Neighbor; 6468
(iv) : the dual O(ESHG)-SuperHyperEulerian-Path-Neighbor; 6469
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Path-Neighbor; 6470
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Path-Neighbor. 6471
coincide. 6473
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6474

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6486
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6487
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6488
SuperHyperPart is a 6489
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6493
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6494
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 6495
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6497

plete SuperHyperMultipartite. Then Then the number of 6498
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6505
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6506
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6508
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6509
(iv) : SuperHyperEulerian-Path-Neighbor; 6513

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6516
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6517
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6518
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6519

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6527
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6528
of dual 6529
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6533

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6537

SuperHyperEulerian-Path-Neighbor/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6539
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6540
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6544
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6545
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Path-Neighbor. 6546


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


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

a dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 6562
(i) v ∈ Ns (x); 6563
(ii) vx ∈ E. 6564
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6565

a dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor, then 6566
(i) S is SuperHyperEulerian-Path-Neighbor set; 6567
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6568
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6569
(i) Γ ≤ O; 6570
(ii) Γs ≤ On . 6571
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6572
connected. Then 6573
(i) Γ ≤ O − 1; 6574
(ii) Γs ≤ On − Σ3i=1 σi (x). 6575
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6576

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6580
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6581
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6583
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Path-Neighbor; 6584
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6585
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6586
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6587
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Path-Neighbor. Then 6589
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 6590

Path-Neighbor; 6591
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6592
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6593
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6594
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Path-Neighbor. Then 6596

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6600
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6601
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6603
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Path-Neighbor; 6604
(ii) Γ = 1; 6605
(iii) Γs = Σ3i=1 σi (c); 6606
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Path-Neighbor. 6607
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6608

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6609
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6611
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6612
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6613
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6615
b n c+1
2
Neighbor; 6617
(ii) Γ = b n2 c + 1; 6618

2
; 6619
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6620
Path-Neighbor. 6621
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6622
bnc
2
Neighbor; 6624
(ii) Γ = b n2 c; 6625
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 6626
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6627
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6629

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

Path-Neighbor for N SHF; 6632
(ii) Γ = m for N SHF : (V, E); 6633
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6634
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Path- 6635
Neighbor for N SHF : (V, E). 6636
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6637
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6638

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6639
SuperHyperEulerian-Path-Neighbor for N SHF; 6640
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6641

b n c+1 for N SHF : (V, E); 6642
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperEulerian-Path-Neighbor 6643
for N SHF : (V, E). 6644
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6645

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6646
bnc
2
Neighbor for N SHF : (V, E); 6648
(ii) Γ = b n2 c for N SHF : (V, E); 6649

bnc for N SHF : (V, E); 6650
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Path-Neighbor for 6651
N SHF : (V, E). 6652
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6655

SuperHyperEulerian-Path-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian-Path- 6656
Neighbor; 6657

SuperHyperEulerian-Path-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 6659
Path-Neighbor. 6660
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6663
SuperHyperEulerian-Path-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian-Path- 6664

Neighbor; 6665

SuperHyperEulerian-Path-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 6667
Path-Neighbor. 6668
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6669

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 6711
Path-Neighbor; 6712
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6713

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

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


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

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

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


CHAPTER 33 6729
Neutrosophic Applications in Cancer’s 6730
Neutrosophic Recognition 6731
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6732
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6733
disease is considered and as the consequences of the model, some parameters are used. The cells 6734
are under attack of this disease but the moves of the cancer in the special region are the matter 6735
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6736
treatments for this Neutrosophic disease. 6737
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6738
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6739
term Neutrosophic function. 6740
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6741
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6742
move from the cancer is identified by this research. Sometimes the move of the cancer 6743
about the moves and the effects of the cancer on that region; this event leads us to 6745
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6746
perception on what’s happened and what’s done. 6747
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6748
known and they’ve got the names, and some general Neutrosophic models. The moves 6749
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6750
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian- 6751
Path-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 6752
perWheel). The aim is to find either the Neutrosophic SuperHyperEulerian-Path-Neighbor 6753

or the Neutrosophic SuperHyperEulerian-Path-Neighbor in those Neutrosophic Neutrosophic 6754
SuperHyperModels. 6755
339
CHAPTER 34 6756
Case 1: The Initial Neutrosophic Steps 6757
Toward Neutrosophic 6758
SuperHyperBipartite as Neutrosophic 6759
SuperHyperModel 6760
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6761
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6762
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

341
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6763
perBipartite is obtained. 6764
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6765
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6766
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6767
(34.1), is the Neutrosophic SuperHyperEulerian-Path-Neighbor. 6768

CHAPTER 35 6769
Case 2: The Increasing Neutrosophic 6770
Steps Toward Neutrosophic 6771
SuperHyperMultipartite as 6772
Neutrosophic SuperHyperModel 6773
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6774
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6775
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6776
perMultipartite is obtained. 6777
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6778
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

343
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6780
Neutrosophic SuperHyperEulerian-Path-Neighbor. 6781

CHAPTER 36 6782
Wondering Open Problems But As The 6783
Directions To Forming The Motivations 6784
In what follows, some “problems” and some “questions” are proposed. 6785
The SuperHyperEulerian-Path-Neighbor and the Neutrosophic SuperHyperEulerian-Path-Neighbor are 6786
defined on a real-world application, titled “Cancer’s Recognitions”. 6787
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6788
recognitions? 6789
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Path-Neighbor 6790

and the Neutrosophic SuperHyperEulerian-Path-Neighbor? 6791
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6792
them? 6793
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6794
and the Neutrosophic SuperHyperEulerian-Path-Neighbor?
Path-Neighbor 6795
Problem 36.0.5. The SuperHyperEulerian-Path-Neighbor and the Neutrosophic SuperHyperEulerian- 6796

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
Path-Neighbor 6797
SuperHyperEulerian-Path-Neighbor, are there else? 6798
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6799
Numbers types-results? 6800
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6801
the multiple types of SuperHyperNotions? 6802
345
CHAPTER 37 6803
Conclusion and Closing Remarks 6804
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6805
research are illustrated. Some benefits and some advantages of this research are highlighted. 6806
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6807
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Path-Neighbor. 6808
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 6809
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6810
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian-Path-Neighbor, 6811
finds the convenient background to implement some results based on that. Some SuperHy- 6812
perClasses and some Neutrosophic SuperHyperClasses are the cases of this research on the 6813
modeling of the regions where are under the attacks of the cancer to recognize this disease as 6814
it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHy- 6815
perNotion, SuperHyperEulerian-Path-Neighbor, the new SuperHyperClasses and SuperHyperClasses, 6816
are introduced. Some general results are gathered in the section on the SuperHyperEulerian-Path- 6817
Neighbor and the Neutrosophic SuperHyperEulerian-Path-Neighbor. The clarifications, instances and 6818
literature reviews have taken the whole way through. In this research, the literature reviews 6819
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 6820
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 6821
both bases are the background of this research. Sometimes the cancer has been happened on the 6822
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 6823
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 6824
longest and strongest styles with the formation of the design and the architecture are formally 6825
called “ SuperHyperEulerian-Path-Neighbor” in the themes of jargons and buzzwords. The prefix 6826
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 6827
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 6828
pointed out and spoken out. 6829
347
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Path-Neighbor
3. Neutrosophic SuperHyperEulerian-Path-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6830
Neutrosophic SuperHyperDuality But As 6831
Super Forms 6833
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6834

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

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

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6847
sophic rv-SuperHyperDuality. 6848
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6849

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6854
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6855
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6856
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6857
form the Extreme SuperHyperDuality; 6858
349
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6859

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6861
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6862
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6863
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6864
such that they form the Neutrosophic SuperHyperDuality; 6865
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6866
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6867

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6868
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6869
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6870
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6871
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6873
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6875

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6877
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6878
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6879
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6880
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6881
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6882
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6883
coefficient; 6884
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6885

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6887
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6888
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6889
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6890
form the Extreme SuperHyperDuality; 6891
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6892

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6893
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6894
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6895
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6896
such that they form the Neutrosophic SuperHyperDuality; 6898
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6899

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6900
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6901

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6903
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 6904
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6906
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6908

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6910

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6913
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6916
coefficient. 6917
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6918
the mentioned Neutrosophic Figures in every Neutrosophic items. 6919

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6921
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6922
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6923
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6924
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6925
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6926
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6927
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 6931
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6932
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6933
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6934
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6935

every given Neutrosophic SuperHyperDuality. 6936




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 6996
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 6998


the Neutrosophic SuperHyperDuality. 7007
Then 7009
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 7010
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7016
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7019

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7020
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7029

(V, E). Then 7030

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 7031
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7032


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

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

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7048
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7049
Then, 7051
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 7052
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 7053


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7058
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7059
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7065

CHAPTER 39 7066
Neutrosophic SuperHyperJoin But As 7067
Super Forms 7069
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7070

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7074
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7076

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

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7081

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7085
rv-SuperHyperJoin. 7086
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7087

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

363

Extreme SuperHyperJoin; 7096
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7097

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7099
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7100
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7101
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7102

form the Neutrosophic SuperHyperJoin; 7103
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7104

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7105
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7106
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7111
coefficient; 7112
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7113

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7114
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7115
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7116
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7117

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7120
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7122

Extreme SuperHyperJoin; 7128
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7129

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7131
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7132
form the Neutrosophic SuperHyperJoin; 7135

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7136

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7138
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7142

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7143
to its Extreme coefficient; 7144
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7145

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7147
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7148

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7149
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7150
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7153
coefficient. 7154
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7158

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7159

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7224

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7233
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 7235


the Neutrosophic SuperHyperJoin. 7244
Then 7246
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 7247
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 7253
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7255

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


(V, E). Then 7266

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7268


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

Then, 7286

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

.
Proof. Let 7287
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7288


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7292
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7293
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7294
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7299

CHAPTER 40 7300
Neutrosophic SuperHyperPerfect But As 7301
Super Forms 7303
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7304

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

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

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

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

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

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7317
rv-SuperHyperPerfect. 7318
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7319

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7324
377
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7329

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7331
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7332
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7333
form the Neutrosophic SuperHyperPerfect; 7335
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7336

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7337
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7338
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7341
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7345

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7347
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7353
coefficient; 7354
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7355

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7363
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7364
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7365
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7366
such that they form the Neutrosophic SuperHyperPerfect; 7368
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7369

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7371

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7374
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7378

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7380

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7386
coefficient. 7387

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

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7457
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 7459
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7477
Then 7479
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 7480
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 7484
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7485
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7486
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7489

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

(V, E). Then 7500

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7523


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7526
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7527
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7528
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7529
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7535

CHAPTER 41 7536
Neutrosophic SuperHyperTotal But As 7537
Super Forms 7539
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7540

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7544

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7547
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7548

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

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

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7553
rv-SuperHyperTotal. 7554
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7555

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7560
Extreme SuperHyperTotal; 7564
391
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7565

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7567
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7568
form the Neutrosophic SuperHyperTotal; 7571
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7572
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7573

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7574
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7579
coefficient; 7580
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7581
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7582

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7583
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7584
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7589
cient; 7590
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7591

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

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7600
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7601
form the Neutrosophic SuperHyperTotal; 7604
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7605

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


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7612
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7614

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7615
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7616
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7617

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7622
cient. 7623

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7627
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. 7642




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 |Neutrosophic Cardinality −2
= {Ei }i=1ESHG:(V,E) .
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 7686
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

SuperHyperModel (31.1), is the SuperHyperTotal. 7693
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 7695
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. 7702
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 7704



the Neutrosophic SuperHyperTotal. 7713
Then 7715
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 7716
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7722
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7724
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7735

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7742
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. 7753
Then, 7755
∗
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 7756
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7757


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7761
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7762

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7763
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7769

CHAPTER 42 7770
Neutrosophic SuperHyperConnected But 7771
As The Extensions Excerpt From Dense 7772
And Super Forms 7773
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7774

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7778
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7779
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7780

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

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

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7786
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7787
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7788
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7789
rosophic rv-SuperHyperConnected. 7790
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7791

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

7794
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7795
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7796
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7797
405
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7798

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7799
that they form the Extreme SuperHyperConnected; 7800
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7801

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7802
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7803
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7804
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7805
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7806

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7807
nected; 7808
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7809

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7810
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7811
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7812
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7813
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7814

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7816
Extreme power is corresponded to its Extreme coefficient; 7817
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7818

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7819
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7820
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7821
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7823

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7825
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7826
its Neutrosophic coefficient; 7827
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7828

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7831
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7832

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7833
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7834
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7835

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7838
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7839
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7840

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7841
nected; 7842
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7843

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7846
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7847
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7848
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7849

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7850
and the Extreme power is corresponded to its Extreme coefficient; 7851
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7852

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7855

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7857
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7859
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7860
its Neutrosophic coefficient. 7861
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7864
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7865
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7867
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7868
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7869
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7870
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7871
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. 7879


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 7923
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. 7930
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 7932
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. 7939
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 7941



the Neutrosophic SuperHyperConnected. 7950
Then 7952
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 7953
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 7958
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7959
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7962

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7973
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 7974
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7975


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7979
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7980
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7981
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. 7992
Then, 7994
∗
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 7995
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 7996


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 7999
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8000
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8001
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8002
some representatives. The latter is straightforward. 8003
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8008

CHAPTER 43 8009
Background 8010
419











in Scribd. 8171



Bibliography 8206
10.33140/JMTCM.01.03.09) 8213
425
10.20944/preprints202301.0282.v1). 8241
10.20944/preprints202301.0267.v1). 8244

(doi: 10.20944/preprints202301.0265.v1). 8249
prints202301.0262.v1). 8253
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8259
prints202301.0105.v1). 8262
Preprints 2023, 2023010044 8268
10.20944/preprints202301.0043.v1). 8271

(doi: 10.20944/preprints202212.0549.v1). 8280
(doi: 10.20944/preprints202212.0500.v1). 8287
10.5281/zenodo.7824560). 8296
(doi: 10.5281/zenodo.7824623). 8299
2023, (doi: 10.5281/zenodo.7809365). 8310
2023, (doi: 10.5281/zenodo.7809358). 8313

10.5281/zenodo.7809219). 8316
10.5281/zenodo.7809328). 8319
2023, (doi: 10.5281/zenodo.7806767). 8322
2023, (doi: 10.5281/zenodo.7806838). 8325
(doi: 10.5281/zenodo.7799902). 8334
2023, (doi: 10.5281/zenodo.7804218). 8337
(doi: 10.5281/zenodo.7796334). 8340
10.5281/zenodo.7791952). 8346
(doi: 10.5281/zenodo.7791982). 8349
10.5281/zenodo.7790026). 8352

2023, (doi: 10.5281/zenodo.7790052). 8355
2023, (doi: 10.5281/zenodo.7787066). 8358
10.5281/zenodo.7781476). 8364
10.5281/zenodo.7783082). 8367
10.5281/zenodo.7777857). 8370
10.5281/zenodo.7779286). 8373
(doi: 10.5281/zenodo.7771831). 8376
2023, (doi: 10.5281/zenodo.7772468). 8379
10.13140/RG.2.2.20913.25446). 8382
10.5281/zenodo.7764916). 8385
10.13140/RG.2.2.11770.98247). 8388
10.13140/RG.2.2.12400.12808). 8391

2023, (doi: 10.13140/RG.2.2.22545.10089). 8394
10.13140/RG.2.2.11377.76644). 8400
10.13140/RG.2.2.23750.96329). 8403
10.13140/RG.2.2.31366.24641). 8406
10.13140/RG.2.2.34721.68960). 8409
10.13140/RG.2.2.24288.35842). 8418
10.13140/RG.2.2.32467.25124). 8421
10.13140/RG.2.2.31025.45925). 8424
10.13140/RG.2.2.17184.25602). 8427
10.13140/RG.2.2.23423.28327). 8430

10.13140/RG.2.2.28456.44805). 8433
10.13140/RG.2.2.23525.68320). 8436
10.13140/RG.2.2.20170.24000). 8439
10.13140/RG.2.2.36475.59683). 8442
10.13140/RG.2.2.29764.71046). 8445
2023, (doi: 10.13140/RG.2.2.18780.87683). 8448
10.13140/RG.2.2.26134.01603). 8454
10.13140/RG.2.2.27392.30721). 8457
10.13140/RG.2.2.33028.40321). 8460
10.13140/RG.2.2.21389.20966). 8463
10.13140/RG.2.2.16356.04489). 8466
10.13140/RG.2.2.21756.21129). 8469

10.13140/RG.2.2.30983.68009). 8472
10.13140/RG.2.2.28552.29445). 8475
10.13140/RG.2.2.35105.89447). 8481
(doi: 10.13140/RG.2.2.30072.72960). 8484
10.13140/RG.2.2.31147.52003). 8487
10.13140/RG.2.2.32825.24163). 8490
10.13140/RG.2.2.13059.58401). 8493
10.13140/RG.2.2.11172.14720). 8496
2023, (doi: 10.13140/RG.2.2.22011.80165). 8499
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8502
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8508

2023, (doi: 10.13140/RG.2.2.19944.14086). 8511
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8514
(doi: 10.13140/RG.2.2.33103.76968). 8517
2023, (doi: 10.13140/RG.2.2.23037.44003). 8520
(doi: 10.13140/RG.2.2.35646.56641). 8523
(doi: 10.13140/RG.2.2.18030.48967). 8526
(doi: 10.13140/RG.2.2.13973.81121). 8529
2023, (doi: 10.13140/RG.2.2.34106.47047). 8532
2023, (doi: 10.13140/RG.2.2.31956.88961). 8538
2023, (doi: 10.13140/RG.2.2.15179.67361). 8541
10.13140/RG.2.2.21510.45125). 8544
2023, (doi: 10.13140/RG.2.2.13121.84321). 8547

10.13140/RG.2.2.11758.69441). 8550
2023, (doi: 10.13140/RG.2.2.31891.35367). 8553
10.13140/RG.2.2.19360.87048). 8556
2023, (doi: 10.13140/RG.2.2.32363.21286). 8559
(doi: 10.13140/RG.2.2.23266.81602). 8562
10.13140/RG.2.2.19911.37285). 8565
10.13140/RG.2.2.11050.90569). 8568
(doi: 10.13140/RG.2.2.30182.50241). 8580

2023, (doi: 10.13140/RG.2.2.17252.24968). 8613
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 8622
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8625


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

10.20944/preprints202301.0282.v1). 8646
10.20944/preprints202301.0267.v1).). 8649
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 8654
prints202301.0262.v1). 8658
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8664


10.13140/RG.2.2.35061.65767). 8667
10.13140/RG.2.2.18494.15680). 8671

10.13140/RG.2.2.32530.73922). 8675
10.13140/RG.2.2.15897.70243). 8679
10.13140/RG.2.2.32530.73922). 8683
prints202301.0105.v1). 8686

10.13140/RG.2.2.23172.19849). 8693

10.13140/RG.2.2.17385.36968). 8703


(doi: 10.20944/preprints202301.0043.v1). 8709
2023, (doi: 10.13140/RG.2.2.28945.92007). 8712
10.13140/RG.2.2.35774.77123). 8718

10.13140/RG.2.2.29430.88642). 8724
(doi: 10.20944/preprints202212.0549.v1). 8730

10.13140/RG.2.2.19380.94084). 8733

(doi: 10.20944/preprints202212.0500.v1). 8744
10.13140/RG.2.2.20993.12640). 8747




10.13140/RG.2.2.29173.86244). 8762
(doi: 10.5281/zenodo.7826705). 8767
2023 (doi: 10.5281/zenodo.7820680). 8769
10.5281/zenodo.7812750). 8771


2023 (doi: 10.5281/zenodo.7807782). 8777
2023 (doi: 10.5281/zenodo.7804449). 8779


(doi: 10.5281/zenodo.7792307). 8783
(doi: 10.5281/zenodo.7790728). 8785
2023 (doi: 10.5281/zenodo.7787712). 8787
10.5281/zenodo.7783791). 8789
10.5281/zenodo.7780123). 8791
(doi: 10.5281/zenodo.7773119). 8793
odo.7637762). 8795
10.5281/zenodo.7766174). 8797
10.5281/zenodo.7762232). 8799
(doi: 10.5281/zenodo.7758601). 8801
10.5281/zenodo.7754661). 8803
10.5281/zenodo.7750995) . 8805
(doi: 10.5281/zenodo.7749875). 8807
10.5281/zenodo.7747236). 8809
10.5281/zenodo.7742587). 8811
(doi: 10.5281/zenodo.7738635). 8813
10.5281/zenodo.7734719). 8815

10.5281/zenodo.7730484). 8817
(doi: 10.5281/zenodo.7730469). 8819
10.5281/zenodo.7722865). 8821
odo.7713563). 8823
odo.7709116). 8825
10.5281/zenodo.7706415). 8827
(doi: 10.5281/zenodo.7706063). 8829
(doi: 10.5281/zenodo.7701906). 8831
odo.7700205). 8833
10.5281/zenodo.7694876). 8835
10.5281/zenodo.7679410). 8837
10.5281/zenodo.7675982). 8839
10.5281/zenodo.7672388). 8841
odo.7668648). 8843
10.5281/zenodo.7662810). 8845
10.5281/zenodo.7659162). 8847
odo.7653233). 8849
odo.7653204). 8851

odo.7653142). 8853
odo.7653117). 8855
odo.7653089). 8857
odo.7651687). 8859
odo.7651619). 8861
odo.7651439). 8863
odo.7650729). 8865
odo.7647868). 8867
odo.7647017). 8869
odo.7644894). 8871
odo.7641880). 8873
odo.7632923). 8875
odo.7623459). 8877
10.5281/zenodo.7606416). 8879
10.5281/zenodo.7606416). 8881
odo.7606404). 8883
10.5281/zenodo.7580018). 8885
odo.7580018). 8887

odo.7580018). 8889
odo.7579929). 8891
10.5281/zenodo.7563170). 8893
odo.7563164). 8895
odo.7563160). 8897
odo.7563160). 8899
10.5281/zenodo.7563160). 8901
10.5281/zenodo.7557063). 8903
10.5281/zenodo.7557009). 8905
10.5281/zenodo.7539484). 8907
10.5281/zenodo.7523390). 8909
10.5281/zenodo.7523390). 8911
10.5281/zenodo.7523390). 8913
odo.7574952). 8915
10.5281/zenodo.7574992). 8917
odo.7523357). 8919
10.5281/zenodo.7523357). 8921
10.5281/zenodo.7504782). 8923

10.5281/zenodo.7504782). 8925
10.5281/zenodo.7504782). 8927
10.5281/zenodo.7499395). 8929
odo.7499395). 8931
10.5281/zenodo.7499395). 8933
10.5281/zenodo.7497450). 8935
10.5281/zenodo.7497450). 8937
10.5281/zenodo.7494862). 8939
odo.7494862). 8941
10.5281/zenodo.7494862). 8943
10.5281/zenodo.7493845). 8945
10.5281/zenodo.7493845). 8947
10.5281/zenodo.7493845). 8949
odo.7539484). 8951
odo.7523390). 8953
odo.7523357). 8955
odo.7504782). 8957
odo.7499395). 8959

odo.7497450). 8961
odo.7494862). 8963
odo.7493845). 8965
odo.7480110). 8967
odo.7378758). 8969
odo.6320305). 8971
odo.6677173). 8973

CHAPTER 44 8974
Books’ Contributions 8975
“Books’ Contributions”: | Featured Threads 8976

The following references are cited by chapters. 8977
8978
[Ref244] 8979
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-Neighbor In 8980
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8981
odo.7824623). 8982
8983
[Ref245] 8984
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8985
10.5281/zenodo.7824560). 8987
8988
The links to the contributions of this scientific research book are listed below. 8989
[HG244] 8990
odo.7824623). 8993
8994
[TITLE] “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-Neighbor 8995
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph” 8996

8997
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8998
https://www.researchgate.net/publication/369976979 8999
9000
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9001
https://www.scribd.com/document/637997066 9002
9003
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9004
https://zenodo.org/record/7824623 9005
9006
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9007
https://www.academia.edu/100136682 9008
447
Figure 44.1: 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).
9009
[ADDRESSED CITATION] 9010
odo.7824623). 9013
[ASSIGNED NUMBER] #244 Article 9014
[DATE] April 2023 9015

[DOI] 10.5281/zenodo.7824623 9016
[LICENSE] CC BY-NC-ND 4.0 9017
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9018
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9019
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9020
9021
[HG245] 9022
10.5281/zenodo.7824560). 9025
9026
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9027

Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous” 9028
9029
https://www.researchgate.net/publication/369977142 9031
9032
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9033

(doi: 10.5281/zenodo.7824623).
(doi: 10.5281/zenodo.7824623).

Figure 44.4: 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).
9035
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9036
9038
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9039
https://www.academia.edu/100136177 9040
9041
10.5281/zenodo.7824560). 9045
[ASSIGNED NUMBER] #245 Article 9046

[DATE] April 2023 9047
[DOI] 10.5281/zenodo.7824560 9048
[LICENSE] CC BY-NC-ND 4.0 9049
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9050
[AVAILABLE AT TWITTER’S IDS] 9051
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9052
googlebooks GooglePlay 9053
9054
[ASSIGNED NUMBER] | Book #161 9055
Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9057
10.5281/zenodo.7826705). 9058

2023, (doi: 10.5281/zenodo.7824560).
2023, (doi: 10.5281/zenodo.7824560).

[TITLE] Eulerian-Path-Neighbor In SuperHyperGraphs 9059

#Latest_Updates 9060
#The_Links 9061
9065
9067
#The_Links 9068
9069
[ASSIGNED NUMBER] | Book #161 9070

9071
[TITLE] Eulerian-Path-Neighbor In SuperHyperGraphs 9072
9073
9077
– 9078
9079
[PUBLISHER] 9080
(Paperback): https://www.amazon.com/dp/- 9081
(Hardcover): https://www.amazon.com/dp/- 9082

(Kindle Edition): https://www.amazon.com/dp/- 9083
9084
– 9085
9086
[ISBN] 9087
(Paperback): - 9088
(Hardcover): - 9089
(Kindle Edition): CC BY-NC-ND 4.0 9090
(EBook): CC BY-NC-ND 4.0 9091
9092
– 9093
9094
[PRINT LENGTH] 9095
(Paperback): - pages 9096
(Hardcover): - pages 9097
(Kindle Edition): - pages 9098
(E-Book): - pages 9099
9100
– 9101
9102
9104

#The_Links 9105
9106
https://www.researchgate.net/publication/- 9108
9109
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9110
https://drhenrygarrett.wordpress.com/2023/04/22/ 9111
Eulerian-Path-Neighbor-In-SuperHyperGraphs/ 9112
9113
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9114
9116
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9117
https://www.academia.edu/- 9118
9119
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9120
9122
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9123
https://books.google.com/books/about?id=- 9124
9125
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9126
https://play.google.com/store/books/details?id=- 9127

[TITLE] Eulerian-Path-Neighbor In SuperHyperGraphs (Published Version) 9128

9129
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9130
9131
https://drhenrygarrett.wordpress.com/2023/04/22/ 9132
Eulerian-Path-Neighbor-In-SuperHyperGraphs/ 9133
9134
– 9135
9136
[POSTED BY] Dr. Henry Garrett 9137
9138
[DATE] April 013, 2023 9139

9140
[POSTED IN] 161 | Eulerian-Path-Neighbor In SuperHyperGraphs 9141
9142
[TAGS] 9143
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9144
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9145
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9146
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9147
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs, 9148
Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real- 9149
World Applications, Recent Research, Recognitions, Research, scientific research Article, 9150
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9151
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Su- 9152

perHyperGraph Theory, SuperHyperGraphs, Eulerian-Path-Neighbor In SuperHyperGraphs, 9153
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9154
In this scientific research book, there are some scientific research chapters on “Extreme 9155
Eulerian-Path-Neighbor In SuperHyperGraphs” and “Neutrosophic Eulerian-Path-Neighbor In 9156
SuperHyperGraphs” about some scientific research on Eulerian-Path-Neighbor In SuperHyper- 9157
Graphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Path-Neighbor In 9158

SuperHyperGraphs and Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs. With 9159
scientific research on the basic scientific research properties, the scientific research book 9160
starts to make Extreme Eulerian-Path-Neighbor In SuperHyperGraphs theory and Neutro- 9161
sophic Eulerian-Path-Neighbor In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9162
understandable. 9163

CHAPTER 45 9164
“SuperHyperGraph-Based Books”: | 9165
Featured Tweets 9166
“SuperHyperGraph-Based Books”: | Featured Tweets 9167
455
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 9168
CV 9169
483
9170
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: https://www.sciencepublishinggroup.com/journal/index?journalid=303; PDF:
https://drhenrygarrett.files.wordpress.com/2023/02/certificate_for_reviewer-2.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
Journal Referee
Sep 2022 Editorial Board Member to JMTCM JMTCM

9171
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)
9172
Publications: Articles
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).
@ResearchGate: https://www.researchgate.net/publication/369456588
@Scribd: https://www.scribd.com/document/633165164
@ZENODO_ORG: https://zenodo.org/record/7763661
@academia: https://www.academia.edu/98987491
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).
@Scribd: https://www.scribd.com/document/-
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
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript

9173
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

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

9174
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor
10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

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

9175
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript
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

9176
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In
10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

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

9177
By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript
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

9178
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript
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

9179
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity
10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

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

9180
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript
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

9181
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

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
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

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

9182
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript
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).
9183
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
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

9184

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

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

9185
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of
Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript
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

9186
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

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

9187
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: -
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: -
9188
2023 129 Manuscript
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
9189
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
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
9190
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
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
9191
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To

Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 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
9192
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
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).
9193
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript
Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
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”,

9194
2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
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”,

9195
2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
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

9196
2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
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).
9197
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
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).
9198
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
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
9199
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
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).
9200

(doi: 10.13140/RG.2.2.34040.16648).

(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).
9201
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
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).
9202
Publications: Books
2023 147 | SuperHyperDuality Amazon
[ADDRESSED CITATION]
[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
@academia:https://www.academia.edu/96858234
(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): -
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
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
(Kindle Edition): CC BY-NC-ND 4.0
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9203
[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

9204
[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

9205
[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

9206
[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

9207
[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

9208
[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

9209
[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

9210
[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

9211
[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

9212
[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

9213
[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

9214
[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

9215
[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

9216
[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

9217
[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

9218
[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

9219
[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

9220
[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

9221
[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
9222
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

9223
[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

9224
[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

9225
[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: -
@ZENODOO RG : https : //zenodo.org/record/7563160
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

9226
[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

9227
[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
9228
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

9229
“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

9230
[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
9231
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

9232
[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

9233
[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

9234
[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

9235
[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

9236
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

9237
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
9238
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
9239
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

9240
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

9241
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
-
9242
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

9243
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9244
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
9245
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
9246
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

9247
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
9248
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
...
9249
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/
9250
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
9251
View publication stats

Eulerian-Path-Neighbor 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

Eulerian-Path-Neighbor in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · April 2023

445 PUBLICATIONS 12,180 CITATIONS

On Fuzzy Logic View project

On Combinatorics 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 Nebulous By Hyper Nebbish Of Eulerian-Path-

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 SuperHyperEulerian-Path-Neighbor But As The Extensions Excerpt

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 245

25 Neutrosophic Eulerian-Path-Neighbor 249

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 SuperHyperEulerian-Path-Neighbor But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 339

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 347

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 447

45 “SuperHyperGraph-Based Books”: | Featured Tweets 455

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 a Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 456

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.23“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 475

Henry Garrett · Independent Researcher · Department of Mathematics ·

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